YES Termination proof succeeded Initially, performed program simplifications using lexicographic rank functions: * Removed transitions 129 using the following rank functions: - Rank function 1: RF for loc. 45: 1-12*iq_0+12*n_0 RF for loc. 46: 1-12*iq_0+12*n_0 RF for loc. 47: -12*iq_0+12*n_0 RF for loc. 48: -1-12*iq_0+12*n_0 RF for loc. 49: -1-12*iq_0+12*n_0 RF for loc. 50: -1-12*iq_0+12*n_0 RF for loc. 51: -1-12*iq_0+12*n_0 RF for loc. 52: -12*iq_0+12*n_0 RF for loc. 57: 3-12*iq_0+12*n_0 RF for loc. 58: 2-12*iq_0+12*n_0 RF for loc. 59: 3-12*iq_0+12*n_0 RF for loc. 60: 3-12*iq_0+12*n_0 RF for loc. 61: 4-12*iq_0+12*n_0 RF for loc. 62: -2-12*iq_0+12*n_0 RF for loc. 63: 5-12*iq_0+12*n_0 RF for loc. 64: 6-12*iq_0+12*n_0 RF for loc. 65: 6-12*iq_0+12*n_0 RF for loc. 66: 9-12*iq_0+12*n_0 RF for loc. 67: 7-12*iq_0+12*n_0 RF for loc. 68: 8-12*iq_0+12*n_0 RF for loc. 69: 9-12*iq_0+12*n_0 RF for loc. 70: 9-12*iq_0+12*n_0 RF for loc. 71: 9-12*iq_0+12*n_0 RF for loc. 72: 9-12*iq_0+12*n_0 RF for loc. 73: 9-12*iq_0+12*n_0 RF for loc. 74: 9-12*iq_0+12*n_0 RF for loc. 77: 9-12*iq_0+12*n_0 RF for loc. 78: 9-12*iq_0+12*n_0 RF for loc. 79: 9-12*iq_0+12*n_0 RF for loc. 80: 9-12*iq_0+12*n_0 RF for loc. 81: 9-12*iq_0+12*n_0 RF for loc. 82: 9-12*iq_0+12*n_0 RF for loc. 83: 9-12*iq_0+12*n_0 RF for loc. 85: 1-12*iq_0+12*n_0 RF for loc. 93: 9-12*iq_0+12*n_0 RF for loc. 97: 9-12*iq_0+12*n_0 RF for loc. 105: 9-12*iq_0+12*n_0 RF for loc. 109: 9-12*iq_0+12*n_0 RF for loc. 113: 9-12*iq_0+12*n_0 RF for loc. 121: 9-12*iq_0+12*n_0 RF for loc. 125: -1-12*iq_0+12*n_0 RF for loc. 129: -1-12*iq_0+12*n_0 RF for loc. 133: -12*iq_0+12*n_0 Bound for (chained) transitions 129: 9 * Removed transitions 157, 159, 161, 162 using the following rank functions: - Rank function 1: RF for loc. 76: -1-2*ip_0+2*n_0 RF for loc. 117: -2*ip_0+2*n_0 Bound for (chained) transitions 157, 159: -1 - Rank function 2: RF for loc. 76: 0 RF for loc. 117: 1 Bound for (chained) transitions 161: 1 Bound for (chained) transitions 162: 1 * Removed transitions 65, 66, 84, 86, 87, 107, 120, 122, 123 using the following rank functions: - Rank function 1: RF for loc. 53: -2-5*ip_0+5*n_0 RF for loc. 55: -2-5*ip_0+5*n_0 RF for loc. 56: -1-5*ip_0+5*n_0 RF for loc. 89: -2-5*ip_0+5*n_0 RF for loc. 101: -5*ip_0+5*n_0 Bound for (chained) transitions 107: -1 - Rank function 2: RF for loc. 53: -1-3*iq_0+3*n_0 RF for loc. 55: 1-3*iq_0+3*n_0 RF for loc. 56: -2-4*iq_0+4*n_0 RF for loc. 89: -3*iq_0+3*n_0 RF for loc. 101: -1-4*iq_0+4*n_0 Bound for (chained) transitions 66: -1 - Rank function 3: RF for loc. 53: 1 RF for loc. 55: 3 RF for loc. 56: -1 RF for loc. 89: 2 RF for loc. 101: 0 Bound for (chained) transitions 65, 120: 1 Bound for (chained) transitions 84: 3 Bound for (chained) transitions 86: 2 Bound for (chained) transitions 87: 2 Bound for (chained) transitions 122: 0 Bound for (chained) transitions 123: 0 Errors: