/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) -> f4#(x1) 
  f4#(I0) -> f3#(I0) 
  f4#(I1) -> f1#(rnd1) [rnd1 = rnd1]
  f4#(I2) -> f3#(I2) 
  f3#(I3) -> f1#(I3) 
R = 
  f5(x1) -> f4(x1) 
  f4(I0) -> f3(I0) 
  f4(I1) -> f1(rnd1) [rnd1 = rnd1]
  f4(I2) -> f3(I2) 
  f3(I3) -> f1(I3) 
  f1(I4) -> f2(I4) 

The dependency graph for this problem is:
  0 -> 1, 2, 3
  1 -> 4
  2 -> 
  3 -> 4
  4 -> 
Where:
  0) f5#(x1) -> f4#(x1) 
  1) f4#(I0) -> f3#(I0) 
  2) f4#(I1) -> f1#(rnd1) [rnd1 = rnd1]
  3) f4#(I2) -> f3#(I2) 
  4) f3#(I3) -> f1#(I3) 

We have the following SCCs.