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