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