YES
Termination proof succeeded
Initially, performed program simplifications using lexicographic rank functions:
 * Removed transitions 2, 5, 6, 7, 17 using the following rank functions:
    - Rank function 1:
      RF for loc. 6: -1+3*arg1
      RF for loc. 7: 0
      RF for loc. 8: -2+3*arg1
      Bound for (chained) transitions 6: 1
      Bound for (chained) transitions 7: 1
      Bound for (chained) transitions 17: 0
    - Rank function 2:
      RF for loc. 6: 2*arg1
      RF for loc. 8: -1+2*arg1
      Bound for (chained) transitions 5: 1
    - Rank function 3:
      RF for loc. 6: 0
      RF for loc. 8: -1
      Bound for (chained) transitions 2: 0
Errors: