YES
Termination proof succeeded
Initially, performed program simplifications using lexicographic rank functions:
 * Removed transitions 24, 26, 27, 32, 33, 35, 36 using the following rank functions:
    - Rank function 1:
      RF for loc. 11: -4*arg2+4*arg4
      RF for loc. 20: 3-4*arg2+4*arg3
      RF for loc. 24: -4*arg2+4*arg4
      Bound for (chained) transitions 26: 7
      Bound for (chained) transitions 27: 7
    - Rank function 2:
      RF for loc. 11: 0
      RF for loc. 20: -1
      RF for loc. 24: 0
      Bound for (chained) transitions 24, 32: 0
    - Rank function 3:
      RF for loc. 11: 1-2*arg3+2*arg4
      RF for loc. 24: -2*arg3+2*arg4
      Bound for (chained) transitions 35: 2
      Bound for (chained) transitions 36: 2
    - Rank function 4:
      RF for loc. 11: 1
      RF for loc. 24: 0
      Bound for (chained) transitions 33: 1
 * Removed transitions 7, 10, 11, 17, 18, 20, 21 using the following rank functions:
    - Rank function 1:
      RF for loc. 9: 3*arg1-3*arg2
      RF for loc. 12: 2+3*arg1-3*arg2
      RF for loc. 16: 3*arg1-3*arg2
      Bound for (chained) transitions 10: 5
      Bound for (chained) transitions 11: 5
    - Rank function 2:
      RF for loc. 9: 0
      RF for loc. 12: -arg1P
      RF for loc. 16: 0
      Bound for (chained) transitions 7, 17: 0
    - Rank function 3:
      RF for loc. 9: 1-2*arg3
      RF for loc. 16: -2*arg3
      Bound for (chained) transitions 20: -4
      Bound for (chained) transitions 21: -4
    - Rank function 4:
      RF for loc. 9: 0
      RF for loc. 16: -1
      Bound for (chained) transitions 18: 0
Errors: