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

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

We have the following SCCs.
  { 1, 2 }

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