/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, x3) -> f4#(x1, x2, x3) 
  f4#(I0, I1, I2) -> f1#(0, 1, rnd3) [rnd3 = rnd3]
  f1#(I6, I7, I8) -> f2#(I6, I7, I8) 
  f1#(I9, I10, I11) -> f2#(I9, I10, I11) 
R = 
  f5(x1, x2, x3) -> f4(x1, x2, x3) 
  f4(I0, I1, I2) -> f1(0, 1, rnd3) [rnd3 = rnd3]
  f2(I3, I4, I5) -> f3(I3, I4, I5) 
  f1(I6, I7, I8) -> f2(I6, I7, I8) 
  f1(I9, I10, I11) -> f2(I9, I10, I11) 

The dependency graph for this problem is:
  0 -> 1
  1 -> 2, 3
  2 -> 
  3 -> 
Where:
  0) f5#(x1, x2, x3) -> f4#(x1, x2, x3) 
  1) f4#(I0, I1, I2) -> f1#(0, 1, rnd3) [rnd3 = rnd3]
  2) f1#(I6, I7, I8) -> f2#(I6, I7, I8) 
  3) f1#(I9, I10, I11) -> f2#(I9, I10, I11) 

We have the following SCCs.