Start: f0
Program_Vars: Arg_0, Arg_1
Temp_Vars: C
Locations: f0, f13, f15, f17, f7
Transitions:
5:f0(Arg_0,Arg_1) -> f7(C,1)
2:f13(Arg_0,Arg_1) -> f13(Arg_0,Arg_1)
3:f15(Arg_0,Arg_1) -> f17(Arg_0,Arg_1)
4:f7(Arg_0,Arg_1) -> f13(0,1):|:Arg_0<=0 && 0<=Arg_0
0:f7(Arg_0,Arg_1) -> f7(C,Arg_1):|:Arg_0+1<=0
1:f7(Arg_0,Arg_1) -> f7(C,Arg_1):|:1<=Arg_0
Cut unreachable locations [f15; f17] from the program graph
Eliminate variables {Arg_1} that do not contribute to the problem
Found invariant Arg_0<=0 && 0<=Arg_0 for location f13
Start: f0
Program_Vars: Arg_0
Temp_Vars: C
Locations: f0, f13, f7
Transitions:
12:f0(Arg_0) -> f7(C)
13:f13(Arg_0) -> f13(Arg_0):|:Arg_0<=0 && 0<=Arg_0
16:f7(Arg_0) -> f13(0):|:Arg_0<=0 && 0<=Arg_0
14:f7(Arg_0) -> f7(C):|:Arg_0+1<=0
15:f7(Arg_0) -> f7(C):|:1<=Arg_0
Overall timebound:inf {Infinity}
12: f0->f7: 1 {O(1)}
13: f13->f13: inf {Infinity}
14: f7->f7: inf {Infinity}
15: f7->f7: inf {Infinity}
16: f7->f13: 1 {O(1)}
Overall costbound: inf {Infinity}
12: f0->f7: 1 {O(1)}
13: f13->f13: inf {Infinity}
14: f7->f7: inf {Infinity}
15: f7->f7: inf {Infinity}
16: f7->f13: 1 {O(1)}
13: f13->f13, Arg_0: 0 {O(1)}
16: f7->f13, Arg_0: 0 {O(1)}