/export/starexec/sandbox2/solver/bin/starexec_run_Transition /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES

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

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

We have the following SCCs.