Initial Problem

Start: f0
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4, Arg_5, Arg_6
Temp_Vars: H, I
Locations: f0, f14, f24, f26, f29
Transitions:
5:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> f14(2*I+1,H,0,Arg_3,H,2*I+1,I):|:1<=H && 0<=2*I
0:f14(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> f14(Arg_0-1,Arg_1-1,Arg_2+1,H,Arg_4,Arg_5,Arg_6):|:1<=Arg_0 && 1<=H
1:f14(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> f14(Arg_0-1,Arg_1,Arg_2,H,Arg_4,Arg_5,Arg_6):|:H<=0 && 1<=Arg_0 && Arg_1+1<=Arg_0
4:f14(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> f24(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6):|:Arg_0<=0
2:f24(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> f24(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6)
3:f26(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> f29(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6)

Preprocessing

Cut unreachable locations [f26; f29] from the program graph

Eliminate variables {Arg_2,Arg_3,Arg_4,Arg_5,Arg_6} that do not contribute to the problem

Found invariant Arg_0<=0 && 0<=Arg_0 for location f24

Found invariant 0<=Arg_0 for location f14

Problem after Preprocessing

Start: f0
Program_Vars: Arg_0, Arg_1
Temp_Vars: H, I
Locations: f0, f14, f24
Transitions:
13:f0(Arg_0,Arg_1) -> f14(2*I+1,H):|:1<=H && 0<=2*I
14:f14(Arg_0,Arg_1) -> f14(Arg_0-1,Arg_1-1):|:0<=Arg_0 && 1<=Arg_0 && 1<=H
15:f14(Arg_0,Arg_1) -> f14(Arg_0-1,Arg_1):|:0<=Arg_0 && H<=0 && 1<=Arg_0 && Arg_1+1<=Arg_0
16:f14(Arg_0,Arg_1) -> f24(Arg_0,Arg_1):|:0<=Arg_0 && Arg_0<=0
17:f24(Arg_0,Arg_1) -> f24(Arg_0,Arg_1):|:Arg_0<=0 && 0<=Arg_0

All Bounds

Timebounds

Overall timebound:inf {Infinity}
13: f0->f14: 1 {O(1)}
14: f14->f14: inf {Infinity}
15: f14->f14: inf {Infinity}
16: f14->f24: 1 {O(1)}
17: f24->f24: inf {Infinity}

Costbounds

Overall costbound: inf {Infinity}
13: f0->f14: 1 {O(1)}
14: f14->f14: inf {Infinity}
15: f14->f14: inf {Infinity}
16: f14->f24: 1 {O(1)}
17: f24->f24: inf {Infinity}

Sizebounds

16: f14->f24, Arg_0: 0 {O(1)}
17: f24->f24, Arg_0: 0 {O(1)}