/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 =
  f3#(x1, x2, x3, x4, x5) -> f1#(x1, x2, x3, x4, x5) 
R = 
  f3(x1, x2, x3, x4, x5) -> f1(x1, x2, x3, x4, x5) 
  f1(I0, I1, I2, I3, I4) -> f2(rnd1, rnd2, rnd3, rnd4, rnd5) [y1 = 0 /\ rnd2 = y1 /\ y2 = 1 + y1 /\ rnd4 = y2 /\ y3 = 1 + y2 /\ rnd3 = y3 /\ y4 = 1 + y3 /\ rnd5 = y4 /\ rnd1 = 1 + y4]

The dependency graph for this problem is:
  0 -> 
Where:
  0) f3#(x1, x2, x3, x4, x5) -> f1#(x1, x2, x3, x4, x5) 

We have the following SCCs.