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


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


MAYBE

DP problem for innermost termination.
P =
  init#(x1, x2, x3) -> f1#(rnd1, rnd2, rnd3) 
  f2#(I0, I1, I2) -> f2#(I0 - I1 + I1 - (I0 - I1), I0 - I1 + I1, I0 - I1 + I1 - (I0 - I1) + I0 - I1 + I1) [I2 <= 4]
  f1#(I3, I4, I5) -> f2#(1, 2, 3) 
R = 
  init(x1, x2, x3) -> f1(rnd1, rnd2, rnd3) 
  f2(I0, I1, I2) -> f2(I0 - I1 + I1 - (I0 - I1), I0 - I1 + I1, I0 - I1 + I1 - (I0 - I1) + I0 - I1 + I1) [I2 <= 4]
  f1(I3, I4, I5) -> f2(1, 2, 3) 

The dependency graph for this problem is:
  0 -> 2
  1 -> 1
  2 -> 1
Where:
  0) init#(x1, x2, x3) -> f1#(rnd1, rnd2, rnd3) 
  1) f2#(I0, I1, I2) -> f2#(I0 - I1 + I1 - (I0 - I1), I0 - I1 + I1, I0 - I1 + I1 - (I0 - I1) + I0 - I1 + I1) [I2 <= 4]
  2) f1#(I3, I4, I5) -> f2#(1, 2, 3) 

We have the following SCCs.
  { 1 }

DP problem for innermost termination.
P =
  f2#(I0, I1, I2) -> f2#(I0 - I1 + I1 - (I0 - I1), I0 - I1 + I1, I0 - I1 + I1 - (I0 - I1) + I0 - I1 + I1) [I2 <= 4]
R = 
  init(x1, x2, x3) -> f1(rnd1, rnd2, rnd3) 
  f2(I0, I1, I2) -> f2(I0 - I1 + I1 - (I0 - I1), I0 - I1 + I1, I0 - I1 + I1 - (I0 - I1) + I0 - I1 + I1) [I2 <= 4]
  f1(I3, I4, I5) -> f2(1, 2, 3)