YES
Termination proof succeeded
Initially, performed program simplifications using lexicographic rank functions:
 * Removed transitions 9, 26, 28, 29 using the following rank functions:
    - Rank function 1:
      RF for loc. 15: -1+2*ctr23_0
      RF for loc. 25: 2*ctr23_0
      Bound for (chained) transitions 9, 26: -1
    - Rank function 2:
      RF for loc. 15: -1
      RF for loc. 25: 0
      Bound for (chained) transitions 29: 0
    - Rank function 3:
      RF for loc. 15: -1
      RF for loc. 25: 0
      Bound for (chained) transitions 28: 0
 * Removed transitions 18, 20, 21, 35 using the following rank functions:
    - Rank function 1:
      RF for loc. 12: -1+2*ctr23_0
      RF for loc. 21: 2*ctr23_0
      Bound for (chained) transitions 18, 35: -1
    - Rank function 2:
      RF for loc. 12: 0
      RF for loc. 21: 1
      Bound for (chained) transitions 21: 1
    - Rank function 3:
      RF for loc. 12: -1
      RF for loc. 21: 0
      Bound for (chained) transitions 20: 0
 * Removed transitions 8, 10, 12, 13 using the following rank functions:
    - Rank function 1:
      RF for loc. 13: -1-2*i_0
      RF for loc. 17: -2*i_0
      Bound for (chained) transitions 8, 10: -127
    - Rank function 2:
      RF for loc. 13: -1
      RF for loc. 17: 0
      Bound for (chained) transitions 12: 0
      Bound for (chained) transitions 13: 0
Errors: