Initial Problem

Start: f0
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars: D, E
Locations: f0, f11, f14, f20, f26, f27, f29, f32
Transitions:
10:f0(Arg_0,Arg_1,Arg_2) -> f11(D,E,D)
0:f11(Arg_0,Arg_1,Arg_2) -> f14(Arg_0,Arg_1,Arg_2):|:6<=Arg_0
1:f11(Arg_0,Arg_1,Arg_2) -> f14(Arg_0,Arg_1,Arg_2):|:Arg_0<=5 && Arg_1<=0
9:f11(Arg_0,Arg_1,Arg_2) -> f20(Arg_0,Arg_1,Arg_2):|:Arg_0<=5 && 1<=Arg_1
2:f14(Arg_0,Arg_1,Arg_2) -> f11(Arg_0+1,D,Arg_2):|:6<=Arg_0
8:f14(Arg_0,Arg_1,Arg_2) -> f11(Arg_0+1,D,Arg_2):|:Arg_0<=5
7:f20(Arg_0,Arg_1,Arg_2) -> f11(Arg_0,D,Arg_2):|:Arg_0<=2
6:f20(Arg_0,Arg_1,Arg_2) -> f20(Arg_0-1,Arg_1,Arg_2):|:3<=Arg_0
3:f26(Arg_0,Arg_1,Arg_2) -> f27(Arg_0,Arg_1,Arg_2)
4:f27(Arg_0,Arg_1,Arg_2) -> f27(Arg_0,Arg_1,Arg_2)
5:f29(Arg_0,Arg_1,Arg_2) -> f32(Arg_0,Arg_1,Arg_2)

Preprocessing

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

Eliminate variables {Arg_2} that do not contribute to the problem

Found invariant 1<=Arg_1 && Arg_0<=4+Arg_1 && Arg_0<=5 for location f20

Problem after Preprocessing

Start: f0
Program_Vars: Arg_0, Arg_1
Temp_Vars: D, E
Locations: f0, f11, f14, f20
Transitions:
22:f0(Arg_0,Arg_1) -> f11(D,E)
23:f11(Arg_0,Arg_1) -> f14(Arg_0,Arg_1):|:6<=Arg_0
24:f11(Arg_0,Arg_1) -> f14(Arg_0,Arg_1):|:Arg_0<=5 && Arg_1<=0
25:f11(Arg_0,Arg_1) -> f20(Arg_0,Arg_1):|:Arg_0<=5 && 1<=Arg_1
26:f14(Arg_0,Arg_1) -> f11(Arg_0+1,D):|:6<=Arg_0
27:f14(Arg_0,Arg_1) -> f11(Arg_0+1,D):|:Arg_0<=5
29:f20(Arg_0,Arg_1) -> f11(Arg_0,D):|:1<=Arg_1 && Arg_0<=4+Arg_1 && Arg_0<=5 && Arg_0<=2
28:f20(Arg_0,Arg_1) -> f20(Arg_0-1,Arg_1):|:1<=Arg_1 && Arg_0<=4+Arg_1 && Arg_0<=5 && 3<=Arg_0

Analysing control-flow refined program

Found invariant Arg_0<=6 for location n_f11___7

Found invariant 1<=Arg_1 && Arg_0<=4+Arg_1 && Arg_0<=5 for location n_f20___10

Found invariant Arg_1<=0 && Arg_0+Arg_1<=5 && Arg_0<=5 for location n_f14___11

Found invariant 1<=Arg_1 && 3<=Arg_0+Arg_1 && Arg_0<=3+Arg_1 && Arg_0<=4 && 2<=Arg_0 for location n_f20___4

Found invariant Arg_0<=2 for location n_f11___5

Found invariant 1<=Arg_1 && Arg_0<=1+Arg_1 && Arg_0<=2 for location n_f20___2

Found invariant 7<=Arg_0 for location n_f11___9

Found invariant Arg_0<=3 for location n_f11___1

Found invariant Arg_1<=0 && Arg_0+Arg_1<=2 && Arg_0<=2 for location n_f14___3

Found invariant 6<=Arg_0 for location n_f14___12

Found invariant Arg_0<=6 && 6<=Arg_0 for location n_f14___6

Found invariant 7<=Arg_0 for location n_f14___8

CFR did not improve the program. Rolling back

All Bounds

Timebounds

Overall timebound:inf {Infinity}
22: f0->f11: 1 {O(1)}
23: f11->f14: inf {Infinity}
24: f11->f14: inf {Infinity}
25: f11->f20: inf {Infinity}
26: f14->f11: inf {Infinity}
27: f14->f11: inf {Infinity}
28: f20->f20: inf {Infinity}
29: f20->f11: inf {Infinity}

Costbounds

Overall costbound: inf {Infinity}
22: f0->f11: 1 {O(1)}
23: f11->f14: inf {Infinity}
24: f11->f14: inf {Infinity}
25: f11->f20: inf {Infinity}
26: f14->f11: inf {Infinity}
27: f14->f11: inf {Infinity}
28: f20->f20: inf {Infinity}
29: f20->f11: inf {Infinity}

Sizebounds

28: f20->f20, Arg_0: 4 {O(1)}