YES
Termination proof succeeded
Initially, performed program simplifications using lexicographic rank functions:
 * Removed transitions 5, 6, 8, 9 using the following rank functions:
    - Rank function 1:
      RF for loc. 8: 2*___const_36_0+-1-2*counter_0
      RF for loc. 10: 2*___const_36_0-2*counter_0
      Bound for (chained) transitions 5, 6: 1
    - Rank function 2:
      RF for loc. 8: -1
      RF for loc. 10: 0
      Bound for (chained) transitions 9: 0
    - Rank function 3:
      RF for loc. 8: -1
      RF for loc. 10: 0
      Bound for (chained) transitions 8: 0
Errors: