/export/starexec/sandbox2/solver/bin/starexec_run_Transition /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE DP problem for innermost termination. P = init#(x1, x2) -> f1#(rnd1, rnd2) f3#(I0, I1) -> f3#(I0 - 1, I1 + I0) [0 <= I1 - 1] f2#(I2, I3) -> f2#(I2 - 1, I3 + I2) [0 <= I3 - 1] f1#(I4, I5) -> f3#(I6, I7) [0 <= I4 - 1 /\ -1 <= I7 - 1 /\ 1 <= I5 - 1 /\ -1 <= I6 - 1] f1#(I8, I9) -> f2#(0, I10) [1 = I9 /\ -1 <= I10 - 1 /\ 0 <= I8 - 1] R = init(x1, x2) -> f1(rnd1, rnd2) f3(I0, I1) -> f3(I0 - 1, I1 + I0) [0 <= I1 - 1] f2(I2, I3) -> f2(I2 - 1, I3 + I2) [0 <= I3 - 1] f1(I4, I5) -> f3(I6, I7) [0 <= I4 - 1 /\ -1 <= I7 - 1 /\ 1 <= I5 - 1 /\ -1 <= I6 - 1] f1(I8, I9) -> f2(0, I10) [1 = I9 /\ -1 <= I10 - 1 /\ 0 <= I8 - 1] The dependency graph for this problem is: 0 -> 3, 4 1 -> 1 2 -> 2 3 -> 1 4 -> 2 Where: 0) init#(x1, x2) -> f1#(rnd1, rnd2) 1) f3#(I0, I1) -> f3#(I0 - 1, I1 + I0) [0 <= I1 - 1] 2) f2#(I2, I3) -> f2#(I2 - 1, I3 + I2) [0 <= I3 - 1] 3) f1#(I4, I5) -> f3#(I6, I7) [0 <= I4 - 1 /\ -1 <= I7 - 1 /\ 1 <= I5 - 1 /\ -1 <= I6 - 1] 4) f1#(I8, I9) -> f2#(0, I10) [1 = I9 /\ -1 <= I10 - 1 /\ 0 <= I8 - 1] We have the following SCCs. { 1 } { 2 } DP problem for innermost termination. P = f2#(I2, I3) -> f2#(I2 - 1, I3 + I2) [0 <= I3 - 1] R = init(x1, x2) -> f1(rnd1, rnd2) f3(I0, I1) -> f3(I0 - 1, I1 + I0) [0 <= I1 - 1] f2(I2, I3) -> f2(I2 - 1, I3 + I2) [0 <= I3 - 1] f1(I4, I5) -> f3(I6, I7) [0 <= I4 - 1 /\ -1 <= I7 - 1 /\ 1 <= I5 - 1 /\ -1 <= I6 - 1] f1(I8, I9) -> f2(0, I10) [1 = I9 /\ -1 <= I10 - 1 /\ 0 <= I8 - 1]