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