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

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

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

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