Initial Problem

Start: f2
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3
Temp_Vars: E
Locations: f1, f2, f300
Transitions:
0:f2(Arg_0,Arg_1,Arg_2,Arg_3) -> f300(Arg_0,Arg_1,Arg_2,Arg_3)
4:f300(Arg_0,Arg_1,Arg_2,Arg_3) -> f1(Arg_0,Arg_1,Arg_2,E):|:1<=Arg_0 && Arg_1+Arg_0<=0 && 1<=Arg_1
5:f300(Arg_0,Arg_1,Arg_2,Arg_3) -> f1(Arg_0,Arg_1,Arg_2,E):|:1<=Arg_1 && Arg_0<=0
6:f300(Arg_0,Arg_1,Arg_2,Arg_3) -> f1(Arg_0,Arg_1,Arg_2,E):|:Arg_1<=0
1:f300(Arg_0,Arg_1,Arg_2,Arg_3) -> f300(Arg_1-1,Arg_1-1,E,Arg_3):|:1<=Arg_0 && 1<=Arg_1 && 1<=E && 1<=Arg_1+Arg_0
2:f300(Arg_0,Arg_1,Arg_2,Arg_3) -> f300(Arg_1-1,Arg_1-1,E,Arg_3):|:1<=Arg_0 && 1<=Arg_1 && E+1<=0 && 1<=Arg_1+Arg_0
3:f300(Arg_0,Arg_1,Arg_2,Arg_3) -> f300(Arg_0-1,Arg_0-2,0,Arg_3):|:1<=Arg_0 && 1<=Arg_1+Arg_0 && 1<=Arg_1

Preprocessing

Cut unsatisfiable transition 4: f300->f1

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

Problem after Preprocessing

Start: f2
Program_Vars: Arg_0, Arg_1
Temp_Vars: E
Locations: f1, f2, f300
Transitions:
21:f2(Arg_0,Arg_1) -> f300(Arg_0,Arg_1)
25:f300(Arg_0,Arg_1) -> f1(Arg_0,Arg_1):|:1<=Arg_1 && Arg_0<=0
26:f300(Arg_0,Arg_1) -> f1(Arg_0,Arg_1):|:Arg_1<=0
22:f300(Arg_0,Arg_1) -> f300(Arg_1-1,Arg_1-1):|:1<=Arg_0 && 1<=Arg_1 && 1<=E && 1<=Arg_1+Arg_0
23:f300(Arg_0,Arg_1) -> f300(Arg_1-1,Arg_1-1):|:1<=Arg_0 && 1<=Arg_1 && E+1<=0 && 1<=Arg_1+Arg_0
24:f300(Arg_0,Arg_1) -> f300(Arg_0-1,Arg_0-2):|:1<=Arg_0 && 1<=Arg_1+Arg_0 && 1<=Arg_1

All Bounds

Timebounds

Overall timebound:inf {Infinity}
21: f2->f300: 1 {O(1)}
22: f300->f300: inf {Infinity}
23: f300->f300: inf {Infinity}
24: f300->f300: inf {Infinity}
25: f300->f1: 1 {O(1)}
26: f300->f1: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
21: f2->f300: 1 {O(1)}
22: f300->f300: inf {Infinity}
23: f300->f300: inf {Infinity}
24: f300->f300: inf {Infinity}
25: f300->f1: 1 {O(1)}
26: f300->f1: 1 {O(1)}

Sizebounds

21: f2->f300, Arg_0: Arg_0 {O(n)}
21: f2->f300, Arg_1: Arg_1 {O(n)}
22: f300->f300, Arg_0: 2*Arg_0+4*Arg_1 {O(n)}
22: f300->f300, Arg_1: 2*Arg_0+4*Arg_1 {O(n)}
23: f300->f300, Arg_0: 2*Arg_0+4*Arg_1 {O(n)}
23: f300->f300, Arg_1: 2*Arg_0+4*Arg_1 {O(n)}
24: f300->f300, Arg_0: 2*Arg_0+4*Arg_1 {O(n)}
24: f300->f300, Arg_1: 2*Arg_0+4*Arg_1 {O(n)}
25: f300->f1, Arg_0: Arg_0 {O(n)}
25: f300->f1, Arg_1: Arg_1 {O(n)}
26: f300->f1, Arg_0: 12*Arg_1+7*Arg_0 {O(n)}
26: f300->f1, Arg_1: 13*Arg_1+6*Arg_0 {O(n)}