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+Arg_1,Arg_1-Arg_2,Arg_2+1):|: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+Arg_1,Arg_1-Arg_2,Arg_2+1):|:1<=Arg_0

MPRF for transition 1:f1(Arg_0,Arg_1,Arg_2) -> f1(Arg_0+Arg_1,Arg_1-Arg_2,Arg_2+1):|:1<=Arg_0 of depth 3:

new bound:

27*Arg_0+27*Arg_1+27*Arg_2+55 {O(n)}

MPRF:

f1 [1-Arg_2 ; Arg_1+1 ; Arg_0 ]

All Bounds

Timebounds

Overall timebound:27*Arg_0+27*Arg_1+27*Arg_2+56 {O(n)}
0: f0->f1: 1 {O(1)}
1: f1->f1: 27*Arg_0+27*Arg_1+27*Arg_2+55 {O(n)}

Costbounds

Overall costbound: 27*Arg_0+27*Arg_1+27*Arg_2+56 {O(n)}
0: f0->f1: 1 {O(1)}
1: f1->f1: 27*Arg_0+27*Arg_1+27*Arg_2+55 {O(n)}

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)}
1: f1->f1, Arg_0: 121014*Arg_0*Arg_1*Arg_2+19683*Arg_0*Arg_0*Arg_0+19683*Arg_1*Arg_1*Arg_1+21141*Arg_2*Arg_2*Arg_2+59049*Arg_0*Arg_0*Arg_1+59049*Arg_0*Arg_1*Arg_1+60507*Arg_0*Arg_0*Arg_2+60507*Arg_1*Arg_1*Arg_2+61965*Arg_0*Arg_2*Arg_2+61965*Arg_1*Arg_2*Arg_2+121743*Arg_0*Arg_0+121797*Arg_1*Arg_1+127791*Arg_2*Arg_2+243540*Arg_0*Arg_1+249534*Arg_0*Arg_2+249588*Arg_1*Arg_2+250993*Arg_0+251104*Arg_1+257264*Arg_2+172480 {O(n^3)}
1: f1->f1, Arg_1: 1458*Arg_0*Arg_1+1512*Arg_0*Arg_2+1512*Arg_1*Arg_2+729*Arg_0*Arg_0+729*Arg_1*Arg_1+783*Arg_2*Arg_2+2997*Arg_0+2998*Arg_1+3109*Arg_2+3080 {O(n^2)}
1: f1->f1, Arg_2: 27*Arg_0+27*Arg_1+28*Arg_2+55 {O(n)}