Start: start
Program_Vars: Arg_0, Arg_1
Temp_Vars: C, D, E
Locations: eval, start
Transitions:
0:eval(Arg_0,Arg_1) -> eval(D,Arg_1):|:0<=Arg_0 && 0<=Arg_1 && Arg_0+1<=Arg_1 && 2*C<=Arg_0+Arg_1 && Arg_0+Arg_1+1<=3*C && C+1<=D && 2*E<=Arg_0+Arg_1 && Arg_0+Arg_1+1<=3*E && D<=E+1
1:eval(Arg_0,Arg_1) -> eval(Arg_0,D):|:0<=Arg_0 && 0<=Arg_1 && Arg_0+1<=Arg_1 && 2*C<=Arg_0+Arg_1 && Arg_0+Arg_1+1<=3*C && C<=D && 2*E<=Arg_0+Arg_1 && Arg_0+Arg_1+1<=3*E && D<=E
2:start(Arg_0,Arg_1) -> eval(Arg_0,Arg_1)
Start: start
Program_Vars: Arg_0, Arg_1
Temp_Vars: C, D, E
Locations: eval, start
Transitions:
0:eval(Arg_0,Arg_1) -> eval(D,Arg_1):|:0<=Arg_0 && 0<=Arg_1 && Arg_0+1<=Arg_1 && 2*C<=Arg_0+Arg_1 && Arg_0+Arg_1+1<=3*C && C+1<=D && 2*E<=Arg_0+Arg_1 && Arg_0+Arg_1+1<=3*E && D<=E+1
1:eval(Arg_0,Arg_1) -> eval(Arg_0,D):|:0<=Arg_0 && 0<=Arg_1 && Arg_0+1<=Arg_1 && 2*C<=Arg_0+Arg_1 && Arg_0+Arg_1+1<=3*C && C<=D && 2*E<=Arg_0+Arg_1 && Arg_0+Arg_1+1<=3*E && D<=E
2:start(Arg_0,Arg_1) -> eval(Arg_0,Arg_1)
new bound:
2*Arg_1+1 {O(n)}
MPRF:
eval [2*Arg_1+1 ]
Overall timebound:inf {Infinity}
0: eval->eval: inf {Infinity}
1: eval->eval: 2*Arg_1+1 {O(n)}
2: start->eval: 1 {O(1)}
Overall costbound: inf {Infinity}
0: eval->eval: inf {Infinity}
1: eval->eval: 2*Arg_1+1 {O(n)}
2: start->eval: 1 {O(1)}
0: eval->eval, Arg_1: 2*Arg_1 {O(n)}
1: eval->eval, Arg_1: 2*Arg_1 {O(n)}
2: start->eval, Arg_0: Arg_0 {O(n)}
2: start->eval, Arg_1: Arg_1 {O(n)}