Start: f300
Program_Vars: Arg_0, Arg_1
Temp_Vars: C
Locations: f1, f300, f5
Transitions:
3:f300(Arg_0,Arg_1) -> f1(Arg_0,C):|:Arg_0<=0
2:f300(Arg_0,Arg_1) -> f5(Arg_0-1,Arg_1):|:1<=Arg_0
1:f5(Arg_0,Arg_1) -> f1(Arg_0,C):|:Arg_0<=0
0:f5(Arg_0,Arg_1) -> f5(Arg_0-1,Arg_1):|:1<=Arg_0
Eliminate variables {C,Arg_1} that do not contribute to the problem
Found invariant 0<=Arg_0 for location f5
Found invariant Arg_0<=0 for location f1
Start: f300
Program_Vars: Arg_0
Temp_Vars:
Locations: f1, f300, f5
Transitions:
9:f300(Arg_0) -> f1(Arg_0):|:Arg_0<=0
8:f300(Arg_0) -> f5(Arg_0-1):|:1<=Arg_0
11:f5(Arg_0) -> f1(Arg_0):|:0<=Arg_0 && Arg_0<=0
10:f5(Arg_0) -> f5(Arg_0-1):|:0<=Arg_0 && 1<=Arg_0
new bound:
Arg_0+1 {O(n)}
MPRF:
f5 [Arg_0+1 ]
Overall timebound:Arg_0+4 {O(n)}
8: f300->f5: 1 {O(1)}
9: f300->f1: 1 {O(1)}
10: f5->f5: Arg_0+1 {O(n)}
11: f5->f1: 1 {O(1)}
Overall costbound: Arg_0+4 {O(n)}
8: f300->f5: 1 {O(1)}
9: f300->f1: 1 {O(1)}
10: f5->f5: Arg_0+1 {O(n)}
11: f5->f1: 1 {O(1)}
8: f300->f5, Arg_0: Arg_0 {O(n)}
9: f300->f1, Arg_0: Arg_0 {O(n)}
10: f5->f5, Arg_0: Arg_0 {O(n)}
11: f5->f1, Arg_0: 0 {O(1)}