/export/starexec/sandbox/solver/bin/starexec_run_Transition /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


MAYBE

DP problem for innermost termination.
P =
  f6#(x1, x2) -> f5#(x1, x2) 
  f5#(I0, I1) -> f1#(I0, I1) 
  f4#(I2, I3) -> f1#(-1 + I2, 1 + I3) 
  f4#(I4, I5) -> f1#(I4, 1 + I5) 
  f2#(I6, I7) -> f4#(I6, I7) 
  f3#(I8, I9) -> f2#(I8, I9) 
  f2#(I10, I11) -> f3#(I10, -1 + I11) [1 <= I11]
  f1#(I12, I13) -> f2#(I12, I12) [1 <= I12]
R = 
  f6(x1, x2) -> f5(x1, x2) 
  f5(I0, I1) -> f1(I0, I1) 
  f4(I2, I3) -> f1(-1 + I2, 1 + I3) 
  f4(I4, I5) -> f1(I4, 1 + I5) 
  f2(I6, I7) -> f4(I6, I7) 
  f3(I8, I9) -> f2(I8, I9) 
  f2(I10, I11) -> f3(I10, -1 + I11) [1 <= I11]
  f1(I12, I13) -> f2(I12, I12) [1 <= I12]

The dependency graph for this problem is:
  0 -> 1
  1 -> 7
  2 -> 7
  3 -> 7
  4 -> 2, 3
  5 -> 4, 6
  6 -> 5
  7 -> 4, 6
Where:
  0) f6#(x1, x2) -> f5#(x1, x2) 
  1) f5#(I0, I1) -> f1#(I0, I1) 
  2) f4#(I2, I3) -> f1#(-1 + I2, 1 + I3) 
  3) f4#(I4, I5) -> f1#(I4, 1 + I5) 
  4) f2#(I6, I7) -> f4#(I6, I7) 
  5) f3#(I8, I9) -> f2#(I8, I9) 
  6) f2#(I10, I11) -> f3#(I10, -1 + I11) [1 <= I11]
  7) f1#(I12, I13) -> f2#(I12, I12) [1 <= I12]

We have the following SCCs.
  { 2, 3, 4, 5, 6, 7 }

DP problem for innermost termination.
P =
  f4#(I2, I3) -> f1#(-1 + I2, 1 + I3) 
  f4#(I4, I5) -> f1#(I4, 1 + I5) 
  f2#(I6, I7) -> f4#(I6, I7) 
  f3#(I8, I9) -> f2#(I8, I9) 
  f2#(I10, I11) -> f3#(I10, -1 + I11) [1 <= I11]
  f1#(I12, I13) -> f2#(I12, I12) [1 <= I12]
R = 
  f6(x1, x2) -> f5(x1, x2) 
  f5(I0, I1) -> f1(I0, I1) 
  f4(I2, I3) -> f1(-1 + I2, 1 + I3) 
  f4(I4, I5) -> f1(I4, 1 + I5) 
  f2(I6, I7) -> f4(I6, I7) 
  f3(I8, I9) -> f2(I8, I9) 
  f2(I10, I11) -> f3(I10, -1 + I11) [1 <= I11]
  f1(I12, I13) -> f2(I12, I12) [1 <= I12]