/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 =
  f4#(x1) -> f3#(x1) 
  f3#(I0) -> f2#(100 + I0) [101 <= 100 + I0]
  f3#(I1) -> f1#(200 + I1) [101 <= 200 + I1]
  f2#(I2) -> f1#(400 + I2) [101 <= 400 + I2]
  f1#(I3) -> f2#(300 + I3) [101 <= 300 + I3]
R = 
  f4(x1) -> f3(x1) 
  f3(I0) -> f2(100 + I0) [101 <= 100 + I0]
  f3(I1) -> f1(200 + I1) [101 <= 200 + I1]
  f2(I2) -> f1(400 + I2) [101 <= 400 + I2]
  f1(I3) -> f2(300 + I3) [101 <= 300 + I3]

The dependency graph for this problem is:
  0 -> 1, 2
  1 -> 3
  2 -> 4
  3 -> 4
  4 -> 3
Where:
  0) f4#(x1) -> f3#(x1) 
  1) f3#(I0) -> f2#(100 + I0) [101 <= 100 + I0]
  2) f3#(I1) -> f1#(200 + I1) [101 <= 200 + I1]
  3) f2#(I2) -> f1#(400 + I2) [101 <= 400 + I2]
  4) f1#(I3) -> f2#(300 + I3) [101 <= 300 + I3]

We have the following SCCs.
  { 3, 4 }

DP problem for innermost termination.
P =
  f2#(I2) -> f1#(400 + I2) [101 <= 400 + I2]
  f1#(I3) -> f2#(300 + I3) [101 <= 300 + I3]
R = 
  f4(x1) -> f3(x1) 
  f3(I0) -> f2(100 + I0) [101 <= 100 + I0]
  f3(I1) -> f1(200 + I1) [101 <= 200 + I1]
  f2(I2) -> f1(400 + I2) [101 <= 400 + I2]
  f1(I3) -> f2(300 + I3) [101 <= 300 + I3]