0.00/0.37	MAYBE
0.00/0.37	
0.00/0.37	DP problem for innermost termination.
0.00/0.37	P =
0.00/0.37	  init#(x1, x2) -> f1#(rnd1, rnd2) 
0.00/0.37	  f2#(I0, I1) -> f2#(I1, I1 - 1) [I1 <= I0 - 1]
0.00/0.37	  f1#(I2, I3) -> f2#(I3, I3 - 1) [-1 <= I3 - 1 /\ 0 <= I2 - 1]
0.00/0.37	R = 
0.00/0.37	  init(x1, x2) -> f1(rnd1, rnd2) 
0.00/0.37	  f2(I0, I1) -> f2(I1, I1 - 1) [I1 <= I0 - 1]
0.00/0.37	  f1(I2, I3) -> f2(I3, I3 - 1) [-1 <= I3 - 1 /\ 0 <= I2 - 1]
0.00/0.37	
0.00/0.37	The dependency graph for this problem is:
0.00/0.37	  0 -> 2
0.00/0.37	  1 -> 1
0.00/0.37	  2 -> 1
0.00/0.37	Where:
0.00/0.37	  0) init#(x1, x2) -> f1#(rnd1, rnd2) 
0.00/0.37	  1) f2#(I0, I1) -> f2#(I1, I1 - 1) [I1 <= I0 - 1]
0.00/0.37	  2) f1#(I2, I3) -> f2#(I3, I3 - 1) [-1 <= I3 - 1 /\ 0 <= I2 - 1]
0.00/0.37	
0.00/0.37	We have the following SCCs.
0.00/0.37	  { 1 }
0.00/0.37	
0.00/0.37	DP problem for innermost termination.
0.00/0.37	P =
0.00/0.37	  f2#(I0, I1) -> f2#(I1, I1 - 1) [I1 <= I0 - 1]
0.00/0.37	R = 
0.00/0.37	  init(x1, x2) -> f1(rnd1, rnd2) 
0.00/0.37	  f2(I0, I1) -> f2(I1, I1 - 1) [I1 <= I0 - 1]
0.00/0.37	  f1(I2, I3) -> f2(I3, I3 - 1) [-1 <= I3 - 1 /\ 0 <= I2 - 1]
0.00/0.37	
0.00/3.35	EOF