Start: f0
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3
Temp_Vars: E
Locations: f0, f14, f22, f24, f27, f9
Transitions:
6:f0(Arg_0,Arg_1,Arg_2,Arg_3) -> f9(E,0,Arg_2,0)
1:f14(Arg_0,Arg_1,Arg_2,Arg_3) -> f14(Arg_0,Arg_1,Arg_2-1,Arg_3):|:1<=Arg_2
4:f14(Arg_0,Arg_1,Arg_2,Arg_3) -> f9(E,Arg_1,Arg_2,0):|:Arg_2<=0
2:f22(Arg_0,Arg_1,Arg_2,Arg_3) -> f22(Arg_0,Arg_1,Arg_2,Arg_3)
3:f24(Arg_0,Arg_1,Arg_2,Arg_3) -> f27(Arg_0,Arg_1,Arg_2,Arg_3)
0:f9(Arg_0,Arg_1,Arg_2,Arg_3) -> f14(Arg_0,0,E,Arg_3):|:Arg_0<=0
5:f9(Arg_0,Arg_1,Arg_2,Arg_3) -> f22(Arg_0,Arg_1,Arg_2,Arg_3):|:1<=Arg_0
Cut unreachable locations [f24; f27] from the program graph
Eliminate variables {Arg_1,Arg_3} that do not contribute to the problem
Found invariant Arg_0<=0 for location f14
Found invariant 1<=Arg_0 for location f22
Start: f0
Program_Vars: Arg_0, Arg_2
Temp_Vars: E
Locations: f0, f14, f22, f9
Transitions:
13:f0(Arg_0,Arg_2) -> f9(E,Arg_2)
14:f14(Arg_0,Arg_2) -> f14(Arg_0,Arg_2-1):|:Arg_0<=0 && 1<=Arg_2
15:f14(Arg_0,Arg_2) -> f9(E,Arg_2):|:Arg_0<=0 && Arg_2<=0
16:f22(Arg_0,Arg_2) -> f22(Arg_0,Arg_2):|:1<=Arg_0
17:f9(Arg_0,Arg_2) -> f14(Arg_0,E):|:Arg_0<=0
18:f9(Arg_0,Arg_2) -> f22(Arg_0,Arg_2):|:1<=Arg_0
Overall timebound:inf {Infinity}
13: f0->f9: 1 {O(1)}
14: f14->f14: inf {Infinity}
15: f14->f9: inf {Infinity}
16: f22->f22: inf {Infinity}
17: f9->f14: inf {Infinity}
18: f9->f22: 1 {O(1)}
Overall costbound: inf {Infinity}
13: f0->f9: 1 {O(1)}
14: f14->f14: inf {Infinity}
15: f14->f9: inf {Infinity}
16: f22->f22: inf {Infinity}
17: f9->f14: inf {Infinity}
18: f9->f22: 1 {O(1)}
13: f0->f9, Arg_2: Arg_2 {O(n)}