YES Termination proof succeeded Initially, performed program simplifications using lexicographic rank functions: * Removed transitions 18, 65, 67, 68 using the following rank functions: - Rank function 1: RF for loc. 19: -i_0+nodecount_0 RF for loc. 49: -i_0+nodecount_0 Bound for (chained) transitions 18, 65: 1 - Rank function 2: RF for loc. 19: 0 RF for loc. 49: 1 Bound for (chained) transitions 67: 1 - Rank function 3: RF for loc. 19: -1 RF for loc. 49: 0 Bound for (chained) transitions 68: 0 * Removed transitions 19, 21, 57, 59, 60 using the following rank functions: - Rank function 1: RF for loc. 23: -1+2*edgecount_0-2*i_0 RF for loc. 45: 2*edgecount_0-2*i_0 Bound for (chained) transitions 19, 21, 57: 1 - Rank function 2: RF for loc. 23: 0 RF for loc. 45: 1 Bound for (chained) transitions 59: 1 - Rank function 3: RF for loc. 23: 0 RF for loc. 45: 1 Bound for (chained) transitions 60: 1 * Removed transitions 22, 23, 25, 41, 43, 44, 49, 51, 52 using the following rank functions: - Rank function 1: RF for loc. 24: -3*i_0+3*nodecount_0 RF for loc. 26: -3*i_0+3*nodecount_0 RF for loc. 27: 1-3*i_0+3*nodecount_0 RF for loc. 37: 2-3*i_0+3*nodecount_0 RF for loc. 41: -3*i_0+3*nodecount_0 Bound for (chained) transitions 25: 4 - Rank function 2: RF for loc. 24: -1+3*edgecount_0-3*j_0 RF for loc. 26: 1+3*edgecount_0-3*j_0 RF for loc. 27: -3+3*edgecount_0-3*j_0 RF for loc. 37: -2+3*edgecount_0-3*j_0 RF for loc. 41: 3*edgecount_0-3*j_0 Bound for (chained) transitions 23: 2 - Rank function 3: RF for loc. 24: -1 RF for loc. 26: 1 RF for loc. 27: -3 RF for loc. 37: -2 RF for loc. 41: 0 Bound for (chained) transitions 22, 41: -1 Bound for (chained) transitions 43: -2 Bound for (chained) transitions 44: -2 Bound for (chained) transitions 49: 1 Bound for (chained) transitions 51: 0 Bound for (chained) transitions 52: 0 * Removed transitions 26, 28, 29, 34, 35, 36, 37, 38, 40 using the following rank functions: - Rank function 1: RF for loc. 29: 1-6*i_0+6*nodecount_0 RF for loc. 30: -6*i_0+6*nodecount_0 RF for loc. 31: -1-6*i_0+6*nodecount_0 RF for loc. 32: -6*i_0+6*nodecount_0 RF for loc. 33: 2-6*i_0+6*nodecount_0 Bound for (chained) transitions 40: 7 - Rank function 2: RF for loc. 29: -4 RF for loc. 30: -1 RF for loc. 31: -2 RF for loc. 32: 0 RF for loc. 33: -3 Bound for (chained) transitions 26, 35: -2 Bound for (chained) transitions 28: -3 Bound for (chained) transitions 29: -3 Bound for (chained) transitions 34: -1 Bound for (chained) transitions 36: 0 Bound for (chained) transitions 37: 0 Bound for (chained) transitions 38: 0 Errors: