YES Termination proof succeeded Initially, performed program simplifications using lexicographic rank functions: * Removed transitions 12, 13, 14, 15, 16, 17, 18, 19, 21, 22, 27, 28, 29, 31, 32, 37 using the following rank functions: - Rank function 1: RF for loc. 13: -8-11*i8_0+11*in_len4_0 RF for loc. 14: -9-11*i8_0+11*in_len4_0 RF for loc. 15: -7-11*i8_0+11*in_len4_0 RF for loc. 17: -6-11*i8_0+11*in_len4_0 RF for loc. 18: -11*i8_0+11*in_len4_0 RF for loc. 19: -5-11*i8_0+11*in_len4_0 RF for loc. 20: -5-11*i8_0+11*in_len4_0 RF for loc. 21: 1-11*i8_0+11*in_len4_0 RF for loc. 25: -5-11*i8_0+11*in_len4_0 Bound for (chained) transitions 37: 11 - Rank function 2: RF for loc. 13: -4+3*acc_length11_0-3*j9_0 RF for loc. 14: -5+3*acc_length11_0-3*j9_0 RF for loc. 15: 3*acc_length11_0-3*j9_0 RF for loc. 17: 1+3*acc_length11_0-3*j9_0 RF for loc. 18: -7+3*acc_length11_0-3*j9_0 RF for loc. 19: 2+3*acc_length11_0-3*j9_0 RF for loc. 20: 4+3*acc_length11_0-3*j9_0 RF for loc. 21: -6+3*acc_length11_0-3*j9_0 RF for loc. 25: 3+3*acc_length11_0-3*j9_0 Bound for (chained) transitions 27: 5 - Rank function 3: RF for loc. 13: -4 RF for loc. 14: -5 RF for loc. 15: -3 RF for loc. 17: -2 RF for loc. 18: -7 RF for loc. 19: -1 RF for loc. 20: 1 RF for loc. 21: -6 RF for loc. 25: 0 Bound for (chained) transitions 12: -4 Bound for (chained) transitions 13: -3 Bound for (chained) transitions 14: -3 Bound for (chained) transitions 15, 19: -5 Bound for (chained) transitions 16: -2 Bound for (chained) transitions 17: -2 Bound for (chained) transitions 18: -2 Bound for (chained) transitions 21: -6 Bound for (chained) transitions 22: -6 Bound for (chained) transitions 28: -1 Bound for (chained) transitions 29: 1 Bound for (chained) transitions 31: 0 Bound for (chained) transitions 32: 0 Errors: