Start: f0
Program_Vars: Arg_0, Arg_1
Temp_Vars: C
Locations: f0, f10, f19, f2, f25, f27, f29, f9
Transitions:
11:f0(Arg_0,Arg_1) -> f9(C,Arg_1)
5:f10(Arg_0,Arg_1) -> f9(Arg_0+1,Arg_1):|:6<=Arg_0
9:f10(Arg_0,Arg_1) -> f9(Arg_0+1,Arg_1):|:Arg_0<=5
7:f19(Arg_0,Arg_1) -> f19(Arg_0-1,Arg_1):|:3<=Arg_0
8:f19(Arg_0,Arg_1) -> f9(Arg_0,Arg_1):|:Arg_0<=2
2:f2(Arg_0,Arg_1) -> f2(Arg_0,Arg_1)
1:f25(Arg_0,Arg_1) -> f2(Arg_0,Arg_1)
6:f27(Arg_0,Arg_1) -> f29(Arg_0,Arg_1)
0:f9(Arg_0,Arg_1) -> f10(Arg_0,Arg_1):|:Arg_0<=5
3:f9(Arg_0,Arg_1) -> f10(Arg_0,C):|:6<=Arg_0 && C+1<=0
4:f9(Arg_0,Arg_1) -> f10(Arg_0,C):|:6<=Arg_0 && 1<=C
10:f9(Arg_0,Arg_1) -> f19(Arg_0,0):|:6<=Arg_0
Cut unreachable locations [f2; f25; f27; f29] from the program graph
Eliminate variables {Arg_1} that do not contribute to the problem
Found invariant 2<=Arg_0 for location f19
Start: f0
Program_Vars: Arg_0
Temp_Vars: C
Locations: f0, f10, f19, f9
Transitions:
27:f0(Arg_0) -> f9(C)
28:f10(Arg_0) -> f9(Arg_0+1):|:6<=Arg_0
29:f10(Arg_0) -> f9(Arg_0+1):|:Arg_0<=5
30:f19(Arg_0) -> f19(Arg_0-1):|:2<=Arg_0 && 3<=Arg_0
31:f19(Arg_0) -> f9(Arg_0):|:2<=Arg_0 && Arg_0<=2
32:f9(Arg_0) -> f10(Arg_0):|:Arg_0<=5
33:f9(Arg_0) -> f10(Arg_0):|:6<=Arg_0 && C+1<=0
34:f9(Arg_0) -> f10(Arg_0):|:6<=Arg_0 && 1<=C
35:f9(Arg_0) -> f19(Arg_0):|:6<=Arg_0
Overall timebound:inf {Infinity}
27: f0->f9: 1 {O(1)}
28: f10->f9: inf {Infinity}
29: f10->f9: inf {Infinity}
30: f19->f19: inf {Infinity}
31: f19->f9: inf {Infinity}
32: f9->f10: inf {Infinity}
33: f9->f10: inf {Infinity}
34: f9->f10: inf {Infinity}
35: f9->f19: inf {Infinity}
Overall costbound: inf {Infinity}
27: f0->f9: 1 {O(1)}
28: f10->f9: inf {Infinity}
29: f10->f9: inf {Infinity}
30: f19->f19: inf {Infinity}
31: f19->f9: inf {Infinity}
32: f9->f10: inf {Infinity}
33: f9->f10: inf {Infinity}
34: f9->f10: inf {Infinity}
35: f9->f19: inf {Infinity}
31: f19->f9, Arg_0: 2 {O(1)}