YES Termination proof succeeded Initially, performed program simplifications using lexicographic rank functions: * Removed transitions 48, 50, 51, 65 using the following rank functions: - Rank function 1: RF for loc. 27: -1+2*x0_0-2*x3_0 RF for loc. 34: 2*x0_0-2*x3_0 Bound for (chained) transitions 50: 4 Bound for (chained) transitions 51: 4 - Rank function 2: RF for loc. 27: 0 RF for loc. 34: -1 Bound for (chained) transitions 48, 65: 0 * Removed transitions 33, 34, 35, 38, 39, 54, 56, 66, 67, 68, 70, 71 using the following rank functions: - Rank function 1: RF for loc. 19: 1+6*x0_0-6*x2_0 RF for loc. 20: 1+6*x0_0-6*x2_0 RF for loc. 22: 1+6*x0_0-6*x2_0 RF for loc. 25: 5+6*x0_0-6*x2_0 RF for loc. 30: 1+6*x0_0-6*x2_0 RF for loc. 42: 6*x0_0-6*x2_0 Bound for (chained) transitions 54, 56: 17 - Rank function 2: RF for loc. 19: 1+4*x0_0-4*x3_0 RF for loc. 20: 4*x0_0-4*x3_0 RF for loc. 22: 3+4*x0_0-4*x3_0 RF for loc. 25: 4*oldX0_post-4*oldX3_post RF for loc. 30: 2+4*x0_0-4*x3_0 RF for loc. 42: 1+4*x0_0-4*x3_0 Bound for (chained) transitions 39: 6 - Rank function 3: RF for loc. 19: 1 RF for loc. 20: 0 RF for loc. 22: -1 RF for loc. 25: -4 RF for loc. 30: -2 RF for loc. 42: -3 Bound for (chained) transitions 33: 1 Bound for (chained) transitions 34, 67: 1 Bound for (chained) transitions 35: -1 Bound for (chained) transitions 38, 68: -2 Bound for (chained) transitions 66: 0 Bound for (chained) transitions 71: -3 - Rank function 4: RF for loc. 25: 0 RF for loc. 42: 1 Bound for (chained) transitions 70: 1 * Removed transitions 57, 59, 61, 62 using the following rank functions: - Rank function 1: RF for loc. 28: -1+2*x0_0-2*x1_0 RF for loc. 38: 2*x0_0-2*x1_0 Bound for (chained) transitions 61: 4 Bound for (chained) transitions 62: 4 - Rank function 2: RF for loc. 28: 0 RF for loc. 38: -1 Bound for (chained) transitions 57, 59: 0 Errors: