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

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

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

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