YES Termination proof succeeded Initially, performed program simplifications using lexicographic rank functions: * Removed transitions 28, 29, 30, 31, 33, 34, 39, 40, 41, 42, 43, 44, 45, 47, 48, 53 using the following rank functions: - Rank function 1: RF for loc. 19: -10-12*i8_0 RF for loc. 21: -1-12*i8_0 RF for loc. 22: -1-12*i8_0 RF for loc. 23: -12*i8_0 RF for loc. 24: -1-12*i8_0 RF for loc. 25: -1-12*i8_0 RF for loc. 26: -1-12*i8_0 RF for loc. 33: 1-12*i8_0 RF for loc. 37: -1-12*i8_0 Bound for (chained) transitions 53: -1188 - Rank function 2: RF for loc. 19: -6*Index7_0+-2 RF for loc. 21: -6*Index7_0+-3 RF for loc. 22: -6*Index7_0+2 RF for loc. 23: -6*Index7_0+-4 RF for loc. 24: -6*Index7_0+-2 RF for loc. 25: -6*Index7_0+-1 RF for loc. 26: -6*Index7_0 RF for loc. 33: -6*Index7_0+-3 RF for loc. 37: -6*Index7_0+1 Bound for (chained) transitions 44: -594 - Rank function 3: RF for loc. 19: -2 RF for loc. 21: 2 RF for loc. 22: 1 RF for loc. 23: -4 RF for loc. 24: 3 RF for loc. 25: 4 RF for loc. 26: -1 RF for loc. 33: -3 RF for loc. 37: 0 Bound for (chained) transitions 28, 29, 31: -2 Bound for (chained) transitions 30: 2 Bound for (chained) transitions 33: -3 Bound for (chained) transitions 39: 3 Bound for (chained) transitions 40: 3 Bound for (chained) transitions 41: 4 Bound for (chained) transitions 42: 4 Bound for (chained) transitions 43: -1 Bound for (chained) transitions 45: 1 Bound for (chained) transitions 47: 0 Bound for (chained) transitions 48: 0 - Rank function 4: RF for loc. 23: 0 RF for loc. 33: 1 Bound for (chained) transitions 34: 1 * Removed transitions 19, 20, 22, 23 using the following rank functions: - Rank function 1: RF for loc. 27: -2*Index2_0+-1 RF for loc. 29: -2*Index2_0 Bound for (chained) transitions 19, 20: -201 - Rank function 2: RF for loc. 27: 0 RF for loc. 29: 1 Bound for (chained) transitions 22: 1 Bound for (chained) transitions 23: 1 Errors: