/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#(I3, I4, I2) [-1 <= y1 - 1 /\ I1 <= I2 - 1 /\ -1 <= I1 - 1 /\ I3 <= I0 /\ 0 <= I0 - 1 /\ 0 <= I3 - 1 /\ I1 + y1 = I4]
  f1#(I5, I6, I7) -> f2#(I8, 0, I6) [0 <= I8 - 1 /\ 0 <= I5 - 1 /\ -1 <= I6 - 1 /\ I8 <= I5]
R = 
  init(x1, x2, x3) -> f1(rnd1, rnd2, rnd3) 
  f2(I0, I1, I2) -> f2(I3, I4, I2) [-1 <= y1 - 1 /\ I1 <= I2 - 1 /\ -1 <= I1 - 1 /\ I3 <= I0 /\ 0 <= I0 - 1 /\ 0 <= I3 - 1 /\ I1 + y1 = I4]
  f1(I5, I6, I7) -> f2(I8, 0, I6) [0 <= I8 - 1 /\ 0 <= I5 - 1 /\ -1 <= I6 - 1 /\ I8 <= I5]

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#(I3, I4, I2) [-1 <= y1 - 1 /\ I1 <= I2 - 1 /\ -1 <= I1 - 1 /\ I3 <= I0 /\ 0 <= I0 - 1 /\ 0 <= I3 - 1 /\ I1 + y1 = I4]
  2) f1#(I5, I6, I7) -> f2#(I8, 0, I6) [0 <= I8 - 1 /\ 0 <= I5 - 1 /\ -1 <= I6 - 1 /\ I8 <= I5]

We have the following SCCs.
  { 1 }

DP problem for innermost termination.
P =
  f2#(I0, I1, I2) -> f2#(I3, I4, I2) [-1 <= y1 - 1 /\ I1 <= I2 - 1 /\ -1 <= I1 - 1 /\ I3 <= I0 /\ 0 <= I0 - 1 /\ 0 <= I3 - 1 /\ I1 + y1 = I4]
R = 
  init(x1, x2, x3) -> f1(rnd1, rnd2, rnd3) 
  f2(I0, I1, I2) -> f2(I3, I4, I2) [-1 <= y1 - 1 /\ I1 <= I2 - 1 /\ -1 <= I1 - 1 /\ I3 <= I0 /\ 0 <= I0 - 1 /\ 0 <= I3 - 1 /\ I1 + y1 = I4]
  f1(I5, I6, I7) -> f2(I8, 0, I6) [0 <= I8 - 1 /\ 0 <= I5 - 1 /\ -1 <= I6 - 1 /\ I8 <= I5]