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

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

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

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