Start: f1
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4
Temp_Vars: F, G, H
Locations: f0, f1, f2
Transitions:
1:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f0(1+3*Arg_0,Arg_1,F,H,G):|:1<=Arg_0 && 2*G+1<=Arg_0 && 3*F<=3*Arg_0 && 3*Arg_0<=3*F && 2*G+1<=F && 1<=F
2:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f0(1+3*Arg_0,Arg_1,F,H,G):|:1<=Arg_0 && 2*G+1<=Arg_0 && 3*F<=3*Arg_0 && 3*Arg_0<=3*F && F+1<=2*G && 1<=F
3:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f0(1+3*Arg_0,Arg_1,F,H,G):|:1<=Arg_0 && Arg_0+1<=2*G && 3*F<=3*Arg_0 && 3*Arg_0<=3*F && 2*G+1<=F && 1<=F
4:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f0(1+3*Arg_0,Arg_1,F,H,G):|:1<=Arg_0 && Arg_0+1<=2*G && 3*F<=3*Arg_0 && 3*Arg_0<=3*F && F+1<=2*G && 1<=F
5:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f0(F,Arg_1,Arg_2,H,F):|:1<=2*F && 1<=G && Arg_0<=2*F && 2*F<=Arg_0
0:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f2(Arg_0,F,Arg_2,Arg_3,Arg_4):|:Arg_0<=0
6:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4)
Cut unsatisfiable transition 2: f0->f0
Cut unsatisfiable transition 3: f0->f0
Eliminate variables {H,Arg_1,Arg_2,Arg_3,Arg_4} that do not contribute to the problem
Found invariant Arg_0<=0 for location f2
Start: f1
Program_Vars: Arg_0
Temp_Vars: F, G
Locations: f0, f1, f2
Transitions:
25:f0(Arg_0) -> f0(1+3*Arg_0):|:1<=Arg_0 && 2*G+1<=Arg_0 && 3*F<=3*Arg_0 && 3*Arg_0<=3*F && 2*G+1<=F && 1<=F
26:f0(Arg_0) -> f0(1+3*Arg_0):|:1<=Arg_0 && Arg_0+1<=2*G && 3*F<=3*Arg_0 && 3*Arg_0<=3*F && F+1<=2*G && 1<=F
27:f0(Arg_0) -> f0(F):|:1<=2*F && 1<=G && Arg_0<=2*F && 2*F<=Arg_0
24:f0(Arg_0) -> f2(Arg_0):|:Arg_0<=0
28:f1(Arg_0) -> f0(Arg_0)
Overall timebound:inf {Infinity}
24: f0->f2: 1 {O(1)}
25: f0->f0: inf {Infinity}
26: f0->f0: inf {Infinity}
27: f0->f0: inf {Infinity}
28: f1->f0: 1 {O(1)}
Overall costbound: inf {Infinity}
24: f0->f2: 1 {O(1)}
25: f0->f0: inf {Infinity}
26: f0->f0: inf {Infinity}
27: f0->f0: inf {Infinity}
28: f1->f0: 1 {O(1)}
24: f0->f2, Arg_0: Arg_0 {O(n)}
28: f1->f0, Arg_0: Arg_0 {O(n)}