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