Start: start
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: eval1, eval2, start
Transitions:
0:eval1(Arg_0,Arg_1) -> eval2(Arg_0,Arg_1):|:1<=Arg_0
2:eval2(Arg_0,Arg_1) -> eval1(Arg_0-1,Arg_1):|:1<=Arg_0 && Arg_1<=0
1:eval2(Arg_0,Arg_1) -> eval2(Arg_0,Arg_1-1):|:1<=Arg_0 && 1<=Arg_1
3:start(Arg_0,Arg_1) -> eval1(Arg_0,Arg_1)
Found invariant 1<=Arg_0 for location eval2
Start: start
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: eval1, eval2, start
Transitions:
0:eval1(Arg_0,Arg_1) -> eval2(Arg_0,Arg_1):|:1<=Arg_0
2:eval2(Arg_0,Arg_1) -> eval1(Arg_0-1,Arg_1):|:1<=Arg_0 && 1<=Arg_0 && Arg_1<=0
1:eval2(Arg_0,Arg_1) -> eval2(Arg_0,Arg_1-1):|:1<=Arg_0 && 1<=Arg_0 && 1<=Arg_1
3:start(Arg_0,Arg_1) -> eval1(Arg_0,Arg_1)
new bound:
Arg_0 {O(n)}
MPRF:
eval2 [Arg_0-1 ]
eval1 [Arg_0 ]
new bound:
Arg_1 {O(n)}
MPRF:
eval2 [Arg_1 ]
eval1 [Arg_1 ]
new bound:
Arg_0 {O(n)}
MPRF:
eval2 [Arg_0 ]
eval1 [Arg_0 ]
Overall timebound:2*Arg_0+Arg_1+1 {O(n)}
0: eval1->eval2: Arg_0 {O(n)}
1: eval2->eval2: Arg_1 {O(n)}
2: eval2->eval1: Arg_0 {O(n)}
3: start->eval1: 1 {O(1)}
Overall costbound: 2*Arg_0+Arg_1+1 {O(n)}
0: eval1->eval2: Arg_0 {O(n)}
1: eval2->eval2: Arg_1 {O(n)}
2: eval2->eval1: Arg_0 {O(n)}
3: start->eval1: 1 {O(1)}
0: eval1->eval2, Arg_0: Arg_0 {O(n)}
0: eval1->eval2, Arg_1: Arg_1 {O(n)}
1: eval2->eval2, Arg_0: Arg_0 {O(n)}
1: eval2->eval2, Arg_1: Arg_1 {O(n)}
2: eval2->eval1, Arg_0: Arg_0 {O(n)}
2: eval2->eval1, Arg_1: Arg_1 {O(n)}
3: start->eval1, Arg_0: Arg_0 {O(n)}
3: start->eval1, Arg_1: Arg_1 {O(n)}