YES
Termination proof succeeded
Initially, performed program simplifications using lexicographic rank functions:
 * Removed transitions 15, 16, 18, 19 using the following rank functions:
    - Rank function 1:
      RF for loc. 10: 2*___const_200_0+-1-2*j_0
      RF for loc. 17: 2*___const_200_0-2*j_0
      Bound for (chained) transitions 15, 16: 1
    - Rank function 2:
      RF for loc. 10: -1
      RF for loc. 17: 0
      Bound for (chained) transitions 18: 0
      Bound for (chained) transitions 19: 0
 * Removed transitions 6, 7, 9, 10 using the following rank functions:
    - Rank function 1:
      RF for loc. 11: 2*___const_100_0+-1-2*i_0
      RF for loc. 13: 2*___const_100_0-2*i_0
      Bound for (chained) transitions 6, 7: 1
    - Rank function 2:
      RF for loc. 11: -1
      RF for loc. 13: 0
      Bound for (chained) transitions 9: 0
      Bound for (chained) transitions 10: 0
Errors: