Start: n_f3
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: n_f0___1, n_f0___2, n_f3
Transitions:
0:n_f0___1(Arg_0,Arg_1) -> n_f0___1(Arg_0+1,Arg_1)
1:n_f0___2(Arg_0,Arg_1) -> n_f0___1(Arg_0+1,Arg_1):|:Arg_1<=1 && 1<=Arg_1 && Arg_0<=1 && 1<=Arg_0
2:n_f3(Arg_0,Arg_1) -> n_f0___2(1,1)
Found invariant Arg_1<=1 && Arg_1<=Arg_0 && Arg_0+Arg_1<=2 && 1<=Arg_1 && 2<=Arg_0+Arg_1 && Arg_0<=Arg_1 && Arg_0<=1 && 1<=Arg_0 for location n_f0___2
Found invariant Arg_1<=1 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 3<=Arg_0+Arg_1 && 2<=Arg_0 for location n_f0___1
Start: n_f3
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: n_f0___1, n_f0___2, n_f3
Transitions:
0:n_f0___1(Arg_0,Arg_1) -> n_f0___1(Arg_0+1,Arg_1):|:Arg_1<=1 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 3<=Arg_0+Arg_1 && 2<=Arg_0
1:n_f0___2(Arg_0,Arg_1) -> n_f0___1(Arg_0+1,Arg_1):|:Arg_1<=1 && Arg_1<=Arg_0 && Arg_0+Arg_1<=2 && 1<=Arg_1 && 2<=Arg_0+Arg_1 && Arg_0<=Arg_1 && Arg_0<=1 && 1<=Arg_0 && Arg_1<=1 && 1<=Arg_1 && Arg_0<=1 && 1<=Arg_0
2:n_f3(Arg_0,Arg_1) -> n_f0___2(1,1)
Overall timebound:inf {Infinity}
0: n_f0___1->n_f0___1: inf {Infinity}
1: n_f0___2->n_f0___1: 1 {O(1)}
2: n_f3->n_f0___2: 1 {O(1)}
Overall costbound: inf {Infinity}
0: n_f0___1->n_f0___1: inf {Infinity}
1: n_f0___2->n_f0___1: 1 {O(1)}
2: n_f3->n_f0___2: 1 {O(1)}
0: n_f0___1->n_f0___1, Arg_1: 1 {O(1)}
1: n_f0___2->n_f0___1, Arg_0: 2 {O(1)}
1: n_f0___2->n_f0___1, Arg_1: 1 {O(1)}
2: n_f3->n_f0___2, Arg_0: 1 {O(1)}
2: n_f3->n_f0___2, Arg_1: 1 {O(1)}