YES
Termination proof succeeded
Initially, performed program simplifications using lexicographic rank functions:
 * Removed transitions 46, 49, 50, 58, 60, 61, 62 using the following rank functions:
    - Rank function 1:
      RF for loc. 15: 2-3*arg4+3*arg8
      RF for loc. 16: 3*arg10-3*arg3
      RF for loc. 25: 1-3*arg4+3*arg8
      RF for loc. 29: 3*arg10-3*arg3
      Bound for (chained) transitions 49: 4
      Bound for (chained) transitions 50: 4
    - Rank function 2:
      RF for loc. 15: 0
      RF for loc. 16: 2*arg4+arg5
      RF for loc. 25: -1
      RF for loc. 29: -2+2*arg4+arg5
      Bound for (chained) transitions 46: 0
      Bound for (chained) transitions 60: 2
      Bound for (chained) transitions 62: -1
    - Rank function 3:
      RF for loc. 16: arg5
      RF for loc. 29: -1+arg5
      Bound for (chained) transitions 61: 2
    - Rank function 4:
      RF for loc. 16: 1
      RF for loc. 29: 0
      Bound for (chained) transitions 58: 1
 * Removed transitions 17, 22, 23, 24, 25, 26, 27, 45 using the following rank functions:
    - Rank function 1:
      RF for loc. 13: 2*arg4
      RF for loc. 14: 1+2*arg9
      RF for loc. 21: -1+2*arg4
      Bound for (chained) transitions 22: -1
      Bound for (chained) transitions 24: -1
      Bound for (chained) transitions 25: -1
      Bound for (chained) transitions 26: -1
      Bound for (chained) transitions 27: -1
      Bound for (chained) transitions 45: 1
    - Rank function 2:
      RF for loc. 13: 0
      RF for loc. 14: -2*arg1P
      RF for loc. 21: -4
      Bound for (chained) transitions 17: 0
      Bound for (chained) transitions 23: -4
 * Removed transitions 7, 10, 11 using the following rank functions:
    - Rank function 1:
      RF for loc. 12: 1+arg3-arg4
      RF for loc. 17: arg3-arg4
      Bound for (chained) transitions 10: 2
      Bound for (chained) transitions 11: 2
    - Rank function 2:
      RF for loc. 12: 1
      RF for loc. 17: 0
      Bound for (chained) transitions 7: 1
Errors: