YES
Termination proof succeeded
Initially, performed program simplifications using lexicographic rank functions:
 * Removed transitions 15, 17, 18, 23 using the following rank functions:
    - Rank function 1:
      RF for loc. 10: -1-2*i7_0
      RF for loc. 17: -2*i7_0
      Bound for (chained) transitions 15, 23: -19
    - Rank function 2:
      RF for loc. 10: 0
      RF for loc. 17: 1
      Bound for (chained) transitions 18: 1
    - Rank function 3:
      RF for loc. 10: 0
      RF for loc. 17: 1
      Bound for (chained) transitions 17: 1
 * Removed transitions 6, 7, 9, 10 using the following rank functions:
    - Rank function 1:
      RF for loc. 11: -1-2*i4_0
      RF for loc. 13: -2*i4_0
      Bound for (chained) transitions 6, 7: -19
    - Rank function 2:
      RF for loc. 11: -1
      RF for loc. 13: 0
      Bound for (chained) transitions 10: 0
    - Rank function 3:
      RF for loc. 11: -1
      RF for loc. 13: 0
      Bound for (chained) transitions 9: 0
Errors: