Start: n_start
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: n_eval___1, n_eval___2, n_start
Transitions:
0:n_eval___1(Arg_0,Arg_1,Arg_2) -> n_eval___1(Arg_2,Arg_1-1,Arg_0+1):|:Arg_2<=101 && Arg_0<=1+Arg_1 && Arg_2<=Arg_1 && Arg_0<=100
1:n_eval___2(Arg_0,Arg_1,Arg_2) -> n_eval___1(Arg_2,Arg_1-1,Arg_0+1):|:Arg_2<=Arg_1 && Arg_0<=100
2:n_start(Arg_0,Arg_1,Arg_2) -> n_eval___2(Arg_0,Arg_1,Arg_2)
Found invariant Arg_2<=101 && Arg_0<=1+Arg_1 for location n_eval___1
Start: n_start
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: n_eval___1, n_eval___2, n_start
Transitions:
0:n_eval___1(Arg_0,Arg_1,Arg_2) -> n_eval___1(Arg_2,Arg_1-1,Arg_0+1):|:Arg_2<=101 && Arg_0<=1+Arg_1 && Arg_2<=101 && Arg_0<=1+Arg_1 && Arg_2<=Arg_1 && Arg_0<=100
1:n_eval___2(Arg_0,Arg_1,Arg_2) -> n_eval___1(Arg_2,Arg_1-1,Arg_0+1):|:Arg_2<=Arg_1 && Arg_0<=100
2:n_start(Arg_0,Arg_1,Arg_2) -> n_eval___2(Arg_0,Arg_1,Arg_2)
new bound:
2*Arg_1+Arg_0+Arg_2+5 {O(n)}
MPRF:
n_eval___1 [2*Arg_1+2-Arg_0-Arg_2 ]
Overall timebound:2*Arg_1+Arg_0+Arg_2+7 {O(n)}
0: n_eval___1->n_eval___1: 2*Arg_1+Arg_0+Arg_2+5 {O(n)}
1: n_eval___2->n_eval___1: 1 {O(1)}
2: n_start->n_eval___2: 1 {O(1)}
Overall costbound: 2*Arg_1+Arg_0+Arg_2+7 {O(n)}
0: n_eval___1->n_eval___1: 2*Arg_1+Arg_0+Arg_2+5 {O(n)}
1: n_eval___2->n_eval___1: 1 {O(1)}
2: n_start->n_eval___2: 1 {O(1)}
0: n_eval___1->n_eval___1, Arg_0: 2*Arg_0+2*Arg_1+2*Arg_2+6 {O(n)}
0: n_eval___1->n_eval___1, Arg_1: 3*Arg_1+Arg_0+Arg_2+6 {O(n)}
0: n_eval___1->n_eval___1, Arg_2: 2*Arg_0+2*Arg_1+2*Arg_2+6 {O(n)}
1: n_eval___2->n_eval___1, Arg_0: Arg_2 {O(n)}
1: n_eval___2->n_eval___1, Arg_1: Arg_1+1 {O(n)}
1: n_eval___2->n_eval___1, Arg_2: Arg_0+1 {O(n)}
2: n_start->n_eval___2, Arg_0: Arg_0 {O(n)}
2: n_start->n_eval___2, Arg_1: Arg_1 {O(n)}
2: n_start->n_eval___2, Arg_2: Arg_2 {O(n)}