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