YES
Termination proof succeeded
Initially, performed program simplifications using lexicographic rank functions:
 * Removed transitions 18, 65, 67, 68 using the following rank functions:
    - Rank function 1:
      RF for loc. 19: -1-2*i_0+2*nodecount_0
      RF for loc. 49: -2*i_0+2*nodecount_0
      Bound for (chained) transitions 18, 65: 1
    - Rank function 2:
      RF for loc. 19: -1
      RF for loc. 49: 0
      Bound for (chained) transitions 67: 0
      Bound for (chained) transitions 68: 0
 * Removed transitions 19, 21, 57, 59, 60 using the following rank functions:
    - Rank function 1:
      RF for loc. 23: -1+2*edgecount_0-2*i_0
      RF for loc. 45: 2*edgecount_0-2*i_0
      Bound for (chained) transitions 19, 21, 57: 1
    - Rank function 2:
      RF for loc. 23: -1
      RF for loc. 45: 0
      Bound for (chained) transitions 59: 0
      Bound for (chained) transitions 60: 0
 * Removed transitions 30, 31, 32, 34, 35, 41, 49, 51, 52 using the following rank functions:
    - Rank function 1:
      RF for loc. 29: -7*i_0+7*nodecount_0
      RF for loc. 31: -7*i_0+7*nodecount_0
      RF for loc. 32: 5-7*i_0+7*nodecount_0
      RF for loc. 37: 6-7*i_0+7*nodecount_0
      RF for loc. 41: -7*i_0+7*nodecount_0
      Bound for (chained) transitions 41: 12
    - Rank function 2:
      RF for loc. 29: -1+3*edgecount_0-3*j_0
      RF for loc. 31: 1+3*edgecount_0-3*j_0
      RF for loc. 32: -3+3*edgecount_0-3*j_0
      RF for loc. 37: -2+3*edgecount_0-3*j_0
      RF for loc. 41: 3*edgecount_0-3*j_0
      Bound for (chained) transitions 31: 2
    - Rank function 3:
      RF for loc. 29: -1
      RF for loc. 31: 1
      RF for loc. 32: -3
      RF for loc. 37: -2
      RF for loc. 41: 0
      Bound for (chained) transitions 30, 32: -1
      Bound for (chained) transitions 34: -2
      Bound for (chained) transitions 35: -2
      Bound for (chained) transitions 49: 1
      Bound for (chained) transitions 51: 0
      Bound for (chained) transitions 52: 0
 * Removed transitions 22, 24, 25, 42, 43, 44, 45, 46, 48 using the following rank functions:
    - Rank function 1:
      RF for loc. 25: 3-6*i_0+6*nodecount_0
      RF for loc. 26: -6*i_0+6*nodecount_0
      RF for loc. 27: -1-6*i_0+6*nodecount_0
      RF for loc. 28: -6*i_0+6*nodecount_0
      RF for loc. 33: 4-6*i_0+6*nodecount_0
      Bound for (chained) transitions 48: 9
    - Rank function 2:
      RF for loc. 25: -4
      RF for loc. 26: -1
      RF for loc. 27: -2
      RF for loc. 28: 0
      RF for loc. 33: -3
      Bound for (chained) transitions 22, 43: -2
      Bound for (chained) transitions 24: -3
      Bound for (chained) transitions 25: -3
      Bound for (chained) transitions 42: -1
      Bound for (chained) transitions 44: 0
      Bound for (chained) transitions 45: 0
      Bound for (chained) transitions 46: 0
Errors: