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