YES
Termination proof succeeded
Initially, performed program simplifications using lexicographic rank functions:
 * Removed transitions 35, 37, 38, 43, 44 using the following rank functions:
    - Rank function 1:
      RF for loc. 11: -1+3*arg2
      RF for loc. 12: 3*arg1
      RF for loc. 22: -2+3*arg2
      Bound for (chained) transitions 37: 1
      Bound for (chained) transitions 38: 1
      Bound for (chained) transitions 43: 0
      Bound for (chained) transitions 44: 0
    - Rank function 2:
      RF for loc. 11: 1
      RF for loc. 22: 0
      Bound for (chained) transitions 35: 1
 * Removed transitions 45, 49, 50 using the following rank functions:
    - Rank function 1:
      RF for loc. 13: 1+2*arg4
      RF for loc. 26: 2*arg4
      Bound for (chained) transitions 50: 2
    - Rank function 2:
      RF for loc. 13: 2*arg4
      RF for loc. 26: -1+2*arg4
      Bound for (chained) transitions 49: 1
    - Rank function 3:
      RF for loc. 13: 0
      RF for loc. 26: -1
      Bound for (chained) transitions 45: 0
 * Removed transitions 26, 31, 32 using the following rank functions:
    - Rank function 1:
      RF for loc. 10: 1+2*arg2
      RF for loc. 18: 2*arg2
      Bound for (chained) transitions 32: 2
    - Rank function 2:
      RF for loc. 10: 2*arg2
      RF for loc. 18: -1+2*arg2
      Bound for (chained) transitions 31: 1
    - Rank function 3:
      RF for loc. 10: 1
      RF for loc. 18: 0
      Bound for (chained) transitions 26: 1
 * Removed transitions 12, 17, 18 using the following rank functions:
    - Rank function 1:
      RF for loc. 9: 1+2*arg4
      RF for loc. 14: 2*arg4
      Bound for (chained) transitions 17: 2
      Bound for (chained) transitions 18: 2
    - Rank function 2:
      RF for loc. 9: 0
      RF for loc. 14: -1
      Bound for (chained) transitions 12: 0
Errors: