Start: f0
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars: D
Locations: f0, f5, f7
Transitions:
0:f0(Arg_0,Arg_1,Arg_2) -> f5(Arg_0,0,Arg_2):|:128<=Arg_0
1:f0(Arg_0,Arg_1,Arg_2) -> f7(Arg_0,0,D):|:Arg_0<=127
3:f7(Arg_0,Arg_1,Arg_2) -> f5(Arg_0,Arg_1,Arg_2):|:36<=Arg_1
2:f7(Arg_0,Arg_1,Arg_2) -> f7(Arg_0,Arg_1+1,Arg_2+1):|:Arg_1<=35
Eliminate variables {D,Arg_2} that do not contribute to the problem
Found invariant Arg_1<=36 && 0<=Arg_1 for location f5
Found invariant Arg_1<=36 && Arg_0+Arg_1<=163 && 0<=Arg_1 && Arg_0<=127+Arg_1 && Arg_0<=127 for location f7
Start: f0
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: f0, f5, f7
Transitions:
8:f0(Arg_0,Arg_1) -> f5(Arg_0,0):|:128<=Arg_0
9:f0(Arg_0,Arg_1) -> f7(Arg_0,0):|:Arg_0<=127
11:f7(Arg_0,Arg_1) -> f5(Arg_0,Arg_1):|:Arg_1<=36 && Arg_0+Arg_1<=163 && 0<=Arg_1 && Arg_0<=127+Arg_1 && Arg_0<=127 && 36<=Arg_1
10:f7(Arg_0,Arg_1) -> f7(Arg_0,Arg_1+1):|:Arg_1<=36 && Arg_0+Arg_1<=163 && 0<=Arg_1 && Arg_0<=127+Arg_1 && Arg_0<=127 && Arg_1<=35
new bound:
36 {O(1)}
MPRF:
f7 [36-Arg_1 ]
Overall timebound:39 {O(1)}
8: f0->f5: 1 {O(1)}
9: f0->f7: 1 {O(1)}
10: f7->f7: 36 {O(1)}
11: f7->f5: 1 {O(1)}
Overall costbound: 39 {O(1)}
8: f0->f5: 1 {O(1)}
9: f0->f7: 1 {O(1)}
10: f7->f7: 36 {O(1)}
11: f7->f5: 1 {O(1)}
8: f0->f5, Arg_0: Arg_0 {O(n)}
8: f0->f5, Arg_1: 0 {O(1)}
9: f0->f7, Arg_0: Arg_0 {O(n)}
9: f0->f7, Arg_1: 0 {O(1)}
10: f7->f7, Arg_0: Arg_0 {O(n)}
10: f7->f7, Arg_1: 36 {O(1)}
11: f7->f5, Arg_0: Arg_0 {O(n)}
11: f7->f5, Arg_1: 36 {O(1)}