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