7.32/7.49 YES 7.32/7.49 7.32/7.49 DP problem for innermost termination. 7.32/7.49 P = 7.32/7.49 f8#(x1, x2, x3) -> f1#(x1, x2, x3) 7.32/7.49 f7#(I0, I1, I2) -> f2#(I0, I1, I2) 7.32/7.49 f2#(I3, I4, I5) -> f7#(I3, 1 + I4, I5) [0 <= -1 - I4 + I5] 7.32/7.49 f6#(I6, I7, I8) -> f2#(I6, I7, I8) 7.32/7.49 f2#(I9, I10, I11) -> f6#(I9, 1 + I10, I11) [I11 <= I10 /\ I10 <= I11 /\ -1 * I10 + I11 <= 0 /\ -1 * I10 + I11 <= 0] 7.32/7.49 f3#(I15, I16, I17) -> f4#(I15, I16, I17) [1 + I17 <= I16] 7.32/7.49 f3#(I18, I19, I20) -> f4#(I18, I19, I20) [1 + I19 <= I20] 7.32/7.49 f2#(I21, I22, I23) -> f3#(I21, I22, I23) [-1 * I22 + I23 <= 0 /\ -1 * I22 + I23 <= 0] 7.32/7.49 f1#(I24, I25, I26) -> f2#(I24, I25, I26) 7.32/7.49 R = 7.32/7.49 f8(x1, x2, x3) -> f1(x1, x2, x3) 7.32/7.49 f7(I0, I1, I2) -> f2(I0, I1, I2) 7.32/7.49 f2(I3, I4, I5) -> f7(I3, 1 + I4, I5) [0 <= -1 - I4 + I5] 7.32/7.49 f6(I6, I7, I8) -> f2(I6, I7, I8) 7.32/7.49 f2(I9, I10, I11) -> f6(I9, 1 + I10, I11) [I11 <= I10 /\ I10 <= I11 /\ -1 * I10 + I11 <= 0 /\ -1 * I10 + I11 <= 0] 7.32/7.49 f4(I12, I13, I14) -> f5(rnd1, I13, I14) [rnd1 = rnd1] 7.32/7.49 f3(I15, I16, I17) -> f4(I15, I16, I17) [1 + I17 <= I16] 7.32/7.49 f3(I18, I19, I20) -> f4(I18, I19, I20) [1 + I19 <= I20] 7.32/7.49 f2(I21, I22, I23) -> f3(I21, I22, I23) [-1 * I22 + I23 <= 0 /\ -1 * I22 + I23 <= 0] 7.32/7.49 f1(I24, I25, I26) -> f2(I24, I25, I26) 7.32/7.49 7.32/7.49 The dependency graph for this problem is: 7.32/7.49 0 -> 8 7.32/7.49 1 -> 2, 4, 7 7.32/7.49 2 -> 1 7.32/7.49 3 -> 2, 4, 7 7.32/7.49 4 -> 3 7.32/7.49 5 -> 7.32/7.49 6 -> 7.32/7.49 7 -> 5 7.32/7.49 8 -> 2, 4, 7 7.32/7.49 Where: 7.32/7.49 0) f8#(x1, x2, x3) -> f1#(x1, x2, x3) 7.32/7.49 1) f7#(I0, I1, I2) -> f2#(I0, I1, I2) 7.32/7.49 2) f2#(I3, I4, I5) -> f7#(I3, 1 + I4, I5) [0 <= -1 - I4 + I5] 7.32/7.49 3) f6#(I6, I7, I8) -> f2#(I6, I7, I8) 7.32/7.49 4) f2#(I9, I10, I11) -> f6#(I9, 1 + I10, I11) [I11 <= I10 /\ I10 <= I11 /\ -1 * I10 + I11 <= 0 /\ -1 * I10 + I11 <= 0] 7.32/7.49 5) f3#(I15, I16, I17) -> f4#(I15, I16, I17) [1 + I17 <= I16] 7.32/7.49 6) f3#(I18, I19, I20) -> f4#(I18, I19, I20) [1 + I19 <= I20] 7.32/7.49 7) f2#(I21, I22, I23) -> f3#(I21, I22, I23) [-1 * I22 + I23 <= 0 /\ -1 * I22 + I23 <= 0] 7.32/7.49 8) f1#(I24, I25, I26) -> f2#(I24, I25, I26) 7.32/7.49 7.32/7.49 We have the following SCCs. 7.32/7.49 { 1, 2, 3, 4 } 7.32/7.49 7.32/7.49 DP problem for innermost termination. 7.32/7.49 P = 7.32/7.49 f7#(I0, I1, I2) -> f2#(I0, I1, I2) 7.32/7.49 f2#(I3, I4, I5) -> f7#(I3, 1 + I4, I5) [0 <= -1 - I4 + I5] 7.32/7.49 f6#(I6, I7, I8) -> f2#(I6, I7, I8) 7.32/7.49 f2#(I9, I10, I11) -> f6#(I9, 1 + I10, I11) [I11 <= I10 /\ I10 <= I11 /\ -1 * I10 + I11 <= 0 /\ -1 * I10 + I11 <= 0] 7.32/7.49 R = 7.32/7.49 f8(x1, x2, x3) -> f1(x1, x2, x3) 7.32/7.49 f7(I0, I1, I2) -> f2(I0, I1, I2) 7.32/7.49 f2(I3, I4, I5) -> f7(I3, 1 + I4, I5) [0 <= -1 - I4 + I5] 7.32/7.49 f6(I6, I7, I8) -> f2(I6, I7, I8) 7.32/7.49 f2(I9, I10, I11) -> f6(I9, 1 + I10, I11) [I11 <= I10 /\ I10 <= I11 /\ -1 * I10 + I11 <= 0 /\ -1 * I10 + I11 <= 0] 7.32/7.49 f4(I12, I13, I14) -> f5(rnd1, I13, I14) [rnd1 = rnd1] 7.32/7.49 f3(I15, I16, I17) -> f4(I15, I16, I17) [1 + I17 <= I16] 7.32/7.49 f3(I18, I19, I20) -> f4(I18, I19, I20) [1 + I19 <= I20] 7.32/7.49 f2(I21, I22, I23) -> f3(I21, I22, I23) [-1 * I22 + I23 <= 0 /\ -1 * I22 + I23 <= 0] 7.32/7.49 f1(I24, I25, I26) -> f2(I24, I25, I26) 7.32/7.49 7.32/7.49 We use the reverse value criterion with the projection function NU: 7.32/7.49 NU[f6#(z1,z2,z3)] = z3 + -1 * z2 7.32/7.49 NU[f2#(z1,z2,z3)] = z3 + -1 * z2 7.32/7.49 NU[f7#(z1,z2,z3)] = z3 + -1 * z2 7.32/7.49 7.32/7.49 This gives the following inequalities: 7.32/7.49 ==> I2 + -1 * I1 >= I2 + -1 * I1 7.32/7.49 0 <= -1 - I4 + I5 ==> I5 + -1 * I4 > I5 + -1 * (1 + I4) with I5 + -1 * I4 >= 0 7.32/7.49 ==> I8 + -1 * I7 >= I8 + -1 * I7 7.32/7.49 I11 <= I10 /\ I10 <= I11 /\ -1 * I10 + I11 <= 0 /\ -1 * I10 + I11 <= 0 ==> I11 + -1 * I10 > I11 + -1 * (1 + I10) with I11 + -1 * I10 >= 0 7.32/7.49 7.32/7.49 We remove all the strictly oriented dependency pairs. 7.32/7.49 7.32/7.49 DP problem for innermost termination. 7.32/7.49 P = 7.32/7.49 f7#(I0, I1, I2) -> f2#(I0, I1, I2) 7.32/7.49 f6#(I6, I7, I8) -> f2#(I6, I7, I8) 7.32/7.49 R = 7.32/7.49 f8(x1, x2, x3) -> f1(x1, x2, x3) 7.32/7.49 f7(I0, I1, I2) -> f2(I0, I1, I2) 7.32/7.49 f2(I3, I4, I5) -> f7(I3, 1 + I4, I5) [0 <= -1 - I4 + I5] 7.32/7.49 f6(I6, I7, I8) -> f2(I6, I7, I8) 7.32/7.49 f2(I9, I10, I11) -> f6(I9, 1 + I10, I11) [I11 <= I10 /\ I10 <= I11 /\ -1 * I10 + I11 <= 0 /\ -1 * I10 + I11 <= 0] 7.32/7.49 f4(I12, I13, I14) -> f5(rnd1, I13, I14) [rnd1 = rnd1] 7.32/7.49 f3(I15, I16, I17) -> f4(I15, I16, I17) [1 + I17 <= I16] 7.32/7.49 f3(I18, I19, I20) -> f4(I18, I19, I20) [1 + I19 <= I20] 7.32/7.49 f2(I21, I22, I23) -> f3(I21, I22, I23) [-1 * I22 + I23 <= 0 /\ -1 * I22 + I23 <= 0] 7.32/7.49 f1(I24, I25, I26) -> f2(I24, I25, I26) 7.32/7.49 7.32/7.49 The dependency graph for this problem is: 7.32/7.49 1 -> 7.32/7.49 3 -> 7.32/7.49 Where: 7.32/7.49 1) f7#(I0, I1, I2) -> f2#(I0, I1, I2) 7.32/7.49 3) f6#(I6, I7, I8) -> f2#(I6, I7, I8) 7.32/7.49 7.32/7.49 We have the following SCCs. 7.32/7.49 7.32/10.47 EOF