Start: f1
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4, Arg_5
Temp_Vars: G, H, I, J, K
Locations: f0, f1
Transitions:
0:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> f0(-Arg_0,Arg_1+Arg_0,Arg_2+Arg_0,Arg_3,Arg_4,Arg_5):|:Arg_0+1<=0
1:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> f0(Arg_0+Arg_1,-Arg_1,Arg_2,Arg_3+Arg_1,Arg_4,Arg_5):|:Arg_1+1<=0
2:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> f0(Arg_0,Arg_1+Arg_3,Arg_2,-Arg_3,Arg_4+Arg_3,Arg_5):|:Arg_3+1<=0
3:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> f0(Arg_0,Arg_1,Arg_2+Arg_4,Arg_3+Arg_4,-Arg_4,Arg_5):|:Arg_4+1<=0
4:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> f0(Arg_0+Arg_2,Arg_1,-Arg_2,Arg_3,Arg_4+Arg_2,Arg_5):|:Arg_2+1<=0
5:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> f0(G,H,K,I,J,G+H+I+J+K):|:1<=G+H+I+J+K
Eliminate variables {Arg_5} that do not contribute to the problem
Start: f1
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4
Temp_Vars: G, H, I, J, K
Locations: f0, f1
Transitions:
12:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f0(-Arg_0,Arg_1+Arg_0,Arg_2+Arg_0,Arg_3,Arg_4):|:Arg_0+1<=0
13:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f0(Arg_0+Arg_1,-Arg_1,Arg_2,Arg_3+Arg_1,Arg_4):|:Arg_1+1<=0
14:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f0(Arg_0,Arg_1+Arg_3,Arg_2,-Arg_3,Arg_4+Arg_3):|:Arg_3+1<=0
15:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f0(Arg_0,Arg_1,Arg_2+Arg_4,Arg_3+Arg_4,-Arg_4):|:Arg_4+1<=0
16:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f0(Arg_0+Arg_2,Arg_1,-Arg_2,Arg_3,Arg_4+Arg_2):|:Arg_2+1<=0
17:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f0(G,H,K,I,J):|:1<=G+H+I+J+K
Overall timebound:inf {Infinity}
12: f0->f0: inf {Infinity}
13: f0->f0: inf {Infinity}
14: f0->f0: inf {Infinity}
15: f0->f0: inf {Infinity}
16: f0->f0: inf {Infinity}
17: f1->f0: 1 {O(1)}
Overall costbound: inf {Infinity}
12: f0->f0: inf {Infinity}
13: f0->f0: inf {Infinity}
14: f0->f0: inf {Infinity}
15: f0->f0: inf {Infinity}
16: f0->f0: inf {Infinity}
17: f1->f0: 1 {O(1)}