YES
Termination proof succeeded
Initially, performed program simplifications using lexicographic rank functions:
 * Removed transitions 7, 11, 12, 13, 14 using the following rank functions:
    - Rank function 1:
      RF for loc. 6: 1+42*e_0-4*n_0
      RF for loc. 7: 42*e_0-4*n_0
      Bound for (chained) transitions 11: -358
      Bound for (chained) transitions 13: -358
    - Rank function 2:
      RF for loc. 6: 10+20*e_0
      RF for loc. 7: 20*e_0
      Bound for (chained) transitions 12: 20
      Bound for (chained) transitions 14: 20
    - Rank function 3:
      RF for loc. 6: 0
      RF for loc. 7: -1
      Bound for (chained) transitions 7: 0
Errors: