Start: n_f2
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3
Temp_Vars:
Locations: n_f0___1, n_f0___2, n_f2
Transitions:
0:n_f0___1(Arg_0,Arg_1,Arg_2,Arg_3) -> n_f0___1(Arg_0-1,Arg_1,Arg_0,Arg_3):|:Arg_0<=9 && Arg_0<=9 && 1+Arg_0<=Arg_2 && Arg_2<=1+Arg_0 && Arg_0<=8 && Arg_0<=9
1:n_f0___2(Arg_0,Arg_1,Arg_2,Arg_3) -> n_f0___1(Arg_0-1,Arg_1,Arg_0,Arg_3):|:Arg_0<=9 && Arg_0<=9 && Arg_0<=0 && 0<=Arg_0 && Arg_0<=9
2:n_f2(Arg_0,Arg_1,Arg_2,Arg_3) -> n_f0___2(0,Arg_1,Arg_2,Arg_3)
Eliminate variables {Arg_1,Arg_3} that do not contribute to the problem
Found invariant Arg_0<=0 && 0<=Arg_0 for location n_f0___2
Found invariant Arg_2<=0 && Arg_2<=1+Arg_0 && 1+Arg_0+Arg_2<=0 && 1+Arg_0<=Arg_2 && 1+Arg_0<=0 for location n_f0___1
Start: n_f2
Program_Vars: Arg_0, Arg_2
Temp_Vars:
Locations: n_f0___1, n_f0___2, n_f2
Transitions:
6:n_f0___1(Arg_0,Arg_2) -> n_f0___1(Arg_0-1,Arg_0):|:Arg_2<=0 && Arg_2<=1+Arg_0 && 1+Arg_0+Arg_2<=0 && 1+Arg_0<=Arg_2 && 1+Arg_0<=0 && Arg_0<=9 && Arg_0<=9 && 1+Arg_0<=Arg_2 && Arg_2<=1+Arg_0 && Arg_0<=8 && Arg_0<=9
7:n_f0___2(Arg_0,Arg_2) -> n_f0___1(Arg_0-1,Arg_0):|:Arg_0<=0 && 0<=Arg_0 && Arg_0<=9 && Arg_0<=9 && Arg_0<=0 && 0<=Arg_0 && Arg_0<=9
8:n_f2(Arg_0,Arg_2) -> n_f0___2(0,Arg_2)
Overall timebound:inf {Infinity}
6: n_f0___1->n_f0___1: inf {Infinity}
7: n_f0___2->n_f0___1: 1 {O(1)}
8: n_f2->n_f0___2: 1 {O(1)}
Overall costbound: inf {Infinity}
6: n_f0___1->n_f0___1: inf {Infinity}
7: n_f0___2->n_f0___1: 1 {O(1)}
8: n_f2->n_f0___2: 1 {O(1)}
7: n_f0___2->n_f0___1, Arg_0: 1 {O(1)}
7: n_f0___2->n_f0___1, Arg_2: 0 {O(1)}
8: n_f2->n_f0___2, Arg_0: 0 {O(1)}
8: n_f2->n_f0___2, Arg_2: Arg_2 {O(n)}