/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, x3) -> f1#(x1, x2, x3) 
  f5#(I0, I1, I2) -> f2#(I0, I1, I2) 
  f4#(I3, I4, I5) -> f5#(I3, I4 + I5, I5) 
  f3#(I6, I7, I8) -> f4#(I6, I7, I8) [I6 = I6]
  f2#(I9, I10, I11) -> f3#(I9, I10, I11) [1 <= I10]
  f1#(I12, I13, I14) -> f2#(I12, I13, I14) 
R = 
  f6(x1, x2, x3) -> f1(x1, x2, x3) 
  f5(I0, I1, I2) -> f2(I0, I1, I2) 
  f4(I3, I4, I5) -> f5(I3, I4 + I5, I5) 
  f3(I6, I7, I8) -> f4(I6, I7, I8) [I6 = I6]
  f2(I9, I10, I11) -> f3(I9, I10, I11) [1 <= I10]
  f1(I12, I13, I14) -> f2(I12, I13, I14) 

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

We have the following SCCs.
  { 1, 2, 3, 4 }

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