Initial Problem

Start: f0
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: f0, f1
Transitions:
0:f0(Arg_0,Arg_1,Arg_2) -> f1(Arg_0,Arg_1,Arg_2)
1:f1(Arg_0,Arg_1,Arg_2) -> f1(Arg_0+1,Arg_1+Arg_0+1,Arg_2):|:Arg_1<=Arg_0
2:f1(Arg_0,Arg_1,Arg_2) -> f1(Arg_0-Arg_2,Arg_1-2*Arg_2,Arg_2-1):|:Arg_1<=Arg_0

Preprocessing

Problem after Preprocessing

Start: f0
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: f0, f1
Transitions:
0:f0(Arg_0,Arg_1,Arg_2) -> f1(Arg_0,Arg_1,Arg_2)
1:f1(Arg_0,Arg_1,Arg_2) -> f1(Arg_0+1,Arg_1+Arg_0+1,Arg_2):|:Arg_1<=Arg_0
2:f1(Arg_0,Arg_1,Arg_2) -> f1(Arg_0-Arg_2,Arg_1-2*Arg_2,Arg_2-1):|:Arg_1<=Arg_0

Analysing control-flow refined program

MPRF for transition 32:n_f1___2(Arg_0,Arg_1,Arg_2) -> n_f1___2(Arg_0-Arg_2,Arg_1-2*Arg_2,Arg_2-1):|:1+Arg_1+Arg_2<=Arg_0 && Arg_1<=Arg_0 of depth 2:

new bound:

16*Arg_1+32*Arg_2+8*Arg_0+17 {O(n)}

MPRF:

n_f1___2 [Arg_2+1 ; Arg_0-Arg_1 ]

CFR did not improve the program. Rolling back

All Bounds

Timebounds

Overall timebound:inf {Infinity}
0: f0->f1: 1 {O(1)}
1: f1->f1: inf {Infinity}
2: f1->f1: inf {Infinity}

Costbounds

Overall costbound: inf {Infinity}
0: f0->f1: 1 {O(1)}
1: f1->f1: inf {Infinity}
2: f1->f1: inf {Infinity}

Sizebounds

0: f0->f1, Arg_0: Arg_0 {O(n)}
0: f0->f1, Arg_1: Arg_1 {O(n)}
0: f0->f1, Arg_2: Arg_2 {O(n)}