Initial Problem

Start: f0
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4, Arg_5
Temp_Vars: G
Locations: f0, f11, f21, f23, f26
Transitions:
5:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> f11(4,G,0,Arg_3,G,4):|:1<=G
0:f11(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> f11(Arg_0-1,Arg_1-1,Arg_2+1,G,Arg_4,Arg_5):|:1<=Arg_0 && 1<=G
1:f11(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> f11(Arg_0-1,Arg_1,Arg_2,G,Arg_4,Arg_5):|:G<=0 && 1<=Arg_0 && Arg_1+1<=Arg_0
4:f11(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> f21(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5):|:Arg_0<=0
2:f21(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> f21(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5)
3:f23(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> f26(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5)

Preprocessing

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

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

Found invariant 0<=3+Arg_1 && 0<=3+Arg_0+Arg_1 && Arg_0<=3+Arg_1 && Arg_0<=4 && 0<=Arg_0 for location f11

Found invariant 0<=3+Arg_1 && 0<=3+Arg_0+Arg_1 && Arg_0<=3+Arg_1 && Arg_0<=0 && 0<=Arg_0 for location f21

Problem after Preprocessing

Start: f0
Program_Vars: Arg_0, Arg_1
Temp_Vars: G
Locations: f0, f11, f21
Transitions:
13:f0(Arg_0,Arg_1) -> f11(4,G):|:1<=G
14:f11(Arg_0,Arg_1) -> f11(Arg_0-1,Arg_1-1):|:0<=3+Arg_1 && 0<=3+Arg_0+Arg_1 && Arg_0<=3+Arg_1 && Arg_0<=4 && 0<=Arg_0 && 1<=Arg_0 && 1<=G
15:f11(Arg_0,Arg_1) -> f11(Arg_0-1,Arg_1):|:0<=3+Arg_1 && 0<=3+Arg_0+Arg_1 && Arg_0<=3+Arg_1 && Arg_0<=4 && 0<=Arg_0 && G<=0 && 1<=Arg_0 && Arg_1+1<=Arg_0
16:f11(Arg_0,Arg_1) -> f21(Arg_0,Arg_1):|:0<=3+Arg_1 && 0<=3+Arg_0+Arg_1 && Arg_0<=3+Arg_1 && Arg_0<=4 && 0<=Arg_0 && Arg_0<=0
17:f21(Arg_0,Arg_1) -> f21(Arg_0,Arg_1):|:0<=3+Arg_1 && 0<=3+Arg_0+Arg_1 && Arg_0<=3+Arg_1 && Arg_0<=0 && 0<=Arg_0

MPRF for transition 14:f11(Arg_0,Arg_1) -> f11(Arg_0-1,Arg_1-1):|:0<=3+Arg_1 && 0<=3+Arg_0+Arg_1 && Arg_0<=3+Arg_1 && Arg_0<=4 && 0<=Arg_0 && 1<=Arg_0 && 1<=G of depth 1:

new bound:

5 {O(1)}

MPRF:

f11 [Arg_0+1 ]

MPRF for transition 15:f11(Arg_0,Arg_1) -> f11(Arg_0-1,Arg_1):|:0<=3+Arg_1 && 0<=3+Arg_0+Arg_1 && Arg_0<=3+Arg_1 && Arg_0<=4 && 0<=Arg_0 && G<=0 && 1<=Arg_0 && Arg_1+1<=Arg_0 of depth 1:

new bound:

5 {O(1)}

MPRF:

f11 [Arg_0+1 ]

All Bounds

Timebounds

Overall timebound:inf {Infinity}
13: f0->f11: 1 {O(1)}
14: f11->f11: 5 {O(1)}
15: f11->f11: 5 {O(1)}
16: f11->f21: 1 {O(1)}
17: f21->f21: inf {Infinity}

Costbounds

Overall costbound: inf {Infinity}
13: f0->f11: 1 {O(1)}
14: f11->f11: 5 {O(1)}
15: f11->f11: 5 {O(1)}
16: f11->f21: 1 {O(1)}
17: f21->f21: inf {Infinity}

Sizebounds

13: f0->f11, Arg_0: 4 {O(1)}
14: f11->f11, Arg_0: 3 {O(1)}
15: f11->f11, Arg_0: 3 {O(1)}
15: f11->f11, Arg_1: 3 {O(1)}
16: f11->f21, Arg_0: 0 {O(1)}
17: f21->f21, Arg_0: 0 {O(1)}