Start: f0
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4, Arg_5, Arg_6, Arg_7, Arg_8, Arg_9
Temp_Vars: K, L
Locations: f0, f18, f24, f31, f33, f36
Transitions:
7:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9) -> f18(1,Arg_1,Arg_2,Arg_3,Arg_4,K,K,Arg_7,Arg_8,Arg_9):|:K<=0
8:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9) -> f18(1,Arg_1,Arg_2,Arg_3,Arg_4,K,0,1,L,L):|:1<=K && 1<=L
9:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9) -> f31(1,Arg_1,Arg_2,Arg_3,Arg_4,K,0,1,L,L):|:1<=K && L<=0
0:f18(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9) -> f24(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9):|:Arg_0<=0
6:f18(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9) -> f24(0,Arg_1,K,Arg_3,K,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9):|:1<=Arg_0
3:f24(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9) -> f31(Arg_0,K,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9):|:1<=Arg_0
4:f24(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9) -> f31(Arg_0,L,Arg_2,K,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9):|:Arg_0<=0 && K<=999+Arg_2
5:f24(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9) -> f31(1,L,Arg_2,K,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9):|:Arg_0<=0 && Arg_2+1000<=K
1:f31(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9) -> f31(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9)
2:f33(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9) -> f36(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9)
Cut unreachable locations [f33; f36] from the program graph
Cut unsatisfiable transition 0: f18->f24
Cut unsatisfiable transition 3: f24->f31
Eliminate variables {Arg_1,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9} that do not contribute to the problem
Found invariant Arg_0<=1 && 0<=Arg_0 for location f31
Found invariant Arg_0<=1 && 1<=Arg_0 for location f18
Found invariant Arg_0<=0 && 0<=Arg_0 for location f24
Start: f0
Program_Vars: Arg_0, Arg_2
Temp_Vars: K, L
Locations: f0, f18, f24, f31
Transitions:
20:f0(Arg_0,Arg_2) -> f18(1,Arg_2):|:K<=0
21:f0(Arg_0,Arg_2) -> f18(1,Arg_2):|:1<=K && 1<=L
22:f0(Arg_0,Arg_2) -> f31(1,Arg_2):|:1<=K && L<=0
23:f18(Arg_0,Arg_2) -> f24(0,K):|:Arg_0<=1 && 1<=Arg_0 && 1<=Arg_0
24:f24(Arg_0,Arg_2) -> f31(Arg_0,Arg_2):|:Arg_0<=0 && 0<=Arg_0 && Arg_0<=0 && K<=999+Arg_2
25:f24(Arg_0,Arg_2) -> f31(1,Arg_2):|:Arg_0<=0 && 0<=Arg_0 && Arg_0<=0 && Arg_2+1000<=K
26:f31(Arg_0,Arg_2) -> f31(Arg_0,Arg_2):|:Arg_0<=1 && 0<=Arg_0
Overall timebound:inf {Infinity}
20: f0->f18: 1 {O(1)}
21: f0->f18: 1 {O(1)}
22: f0->f31: 1 {O(1)}
23: f18->f24: 1 {O(1)}
24: f24->f31: 1 {O(1)}
25: f24->f31: 1 {O(1)}
26: f31->f31: inf {Infinity}
Overall costbound: inf {Infinity}
20: f0->f18: 1 {O(1)}
21: f0->f18: 1 {O(1)}
22: f0->f31: 1 {O(1)}
23: f18->f24: 1 {O(1)}
24: f24->f31: 1 {O(1)}
25: f24->f31: 1 {O(1)}
26: f31->f31: inf {Infinity}
20: f0->f18, Arg_0: 1 {O(1)}
20: f0->f18, Arg_2: Arg_2 {O(n)}
21: f0->f18, Arg_0: 1 {O(1)}
21: f0->f18, Arg_2: Arg_2 {O(n)}
22: f0->f31, Arg_0: 1 {O(1)}
22: f0->f31, Arg_2: Arg_2 {O(n)}
23: f18->f24, Arg_0: 0 {O(1)}
24: f24->f31, Arg_0: 0 {O(1)}
25: f24->f31, Arg_0: 1 {O(1)}
26: f31->f31, Arg_0: 1 {O(1)}