Start: n_l0
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: n_l0, n_l1___1, n_l1___2
Transitions:
0:n_l0(Arg_0,Arg_1) -> n_l1___2(Arg_0,Arg_1)
1:n_l1___1(Arg_0,Arg_1) -> n_l1___1(2*Arg_0,3*Arg_1):|:Arg_0<=4*Arg_1 && 1<=Arg_1 && 2*Arg_1<=3*Arg_0 && 3*Arg_0<=8*Arg_1 && 3<=Arg_1 && Arg_1<=Arg_0 && 1<=Arg_1 && Arg_0<=4*Arg_1
2:n_l1___2(Arg_0,Arg_1) -> n_l1___1(2*Arg_0,3*Arg_1):|:Arg_1<=Arg_0 && 1<=Arg_1 && Arg_0<=4*Arg_1
Found invariant 3<=Arg_1 && 5<=Arg_0+Arg_1 && 2<=Arg_0 for location n_l1___1
Start: n_l0
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: n_l0, n_l1___1, n_l1___2
Transitions:
0:n_l0(Arg_0,Arg_1) -> n_l1___2(Arg_0,Arg_1)
1:n_l1___1(Arg_0,Arg_1) -> n_l1___1(2*Arg_0,3*Arg_1):|:3<=Arg_1 && 5<=Arg_0+Arg_1 && 2<=Arg_0 && Arg_0<=4*Arg_1 && 1<=Arg_1 && 2*Arg_1<=3*Arg_0 && 3*Arg_0<=8*Arg_1 && 3<=Arg_1 && Arg_1<=Arg_0 && 1<=Arg_1 && Arg_0<=4*Arg_1
2:n_l1___2(Arg_0,Arg_1) -> n_l1___1(2*Arg_0,3*Arg_1):|:Arg_1<=Arg_0 && 1<=Arg_1 && Arg_0<=4*Arg_1
Overall timebound:inf {Infinity}
0: n_l0->n_l1___2: 1 {O(1)}
1: n_l1___1->n_l1___1: inf {Infinity}
2: n_l1___2->n_l1___1: 1 {O(1)}
Overall costbound: inf {Infinity}
0: n_l0->n_l1___2: 1 {O(1)}
1: n_l1___1->n_l1___1: inf {Infinity}
2: n_l1___2->n_l1___1: 1 {O(1)}
0: n_l0->n_l1___2, Arg_0: Arg_0 {O(n)}
0: n_l0->n_l1___2, Arg_1: Arg_1 {O(n)}
2: n_l1___2->n_l1___1, Arg_0: 2*Arg_0 {O(n)}
2: n_l1___2->n_l1___1, Arg_1: 3*Arg_1 {O(n)}