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


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


YES

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

The dependency graph for this problem is:
  0 -> 1
  1 -> 2, 3
  2 -> 
  3 -> 
Where:
  0) f5#(x1, x2) -> f3#(x1, x2) 
  1) f3#(I2, I3) -> f1#(I2, I3) 
  2) f1#(I4, I5) -> f2#(I4, I5) [0 <= -1 - I5]
  3) f1#(I6, I7) -> f2#(I6, 1 + I7) [-1 * I7 <= 0]

We have the following SCCs.