Start: n_f2
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars: A_P, C_P, NoDet0
Locations: n_f1___3, n_f1___5, n_f2, n_f3___1, n_f3___2, n_f3___4
Transitions:
0:n_f1___3(Arg_0,Arg_1,Arg_2) -> n_f1___3(Arg_0+1,Arg_1,Arg_2):|:Arg_0<=500 && Arg_0<=499
1:n_f1___3(Arg_0,Arg_1,Arg_2) -> n_f3___1(Arg_0,NoDet0,Arg_2):|:Arg_0<=500 && 500<=Arg_0
2:n_f1___5(Arg_0,Arg_1,Arg_2) -> n_f1___3(Arg_0+1,Arg_1,Arg_2):|:Arg_0<=500 && Arg_0<=1+Arg_2 && 1+Arg_2<=Arg_0 && Arg_0<=500 && Arg_0<=499
3:n_f1___5(Arg_0,Arg_1,Arg_2) -> n_f3___2(Arg_0,NoDet0,Arg_2):|:Arg_0<=500 && Arg_0<=1+Arg_2 && 1+Arg_2<=Arg_0 && Arg_0<=500 && 500<=Arg_0
4:n_f2(Arg_0,Arg_1,Arg_2) -> n_f1___5(A_P,Arg_1,C_P):|:C_P<=499 && A_P<=C_P+1 && 1+C_P<=A_P
5:n_f2(Arg_0,Arg_1,Arg_2) -> n_f3___4(A_P,NoDet0,C_P):|:500<=A_P && A_P<=C_P && C_P<=A_P
Eliminate variables {NoDet0,Arg_1} that do not contribute to the problem
Found invariant Arg_2<=499 && 1+Arg_2<=Arg_0 && Arg_0+Arg_2<=999 && 499<=Arg_2 && 999<=Arg_0+Arg_2 && Arg_0<=1+Arg_2 && Arg_0<=500 && 500<=Arg_0 for location n_f3___2
Found invariant Arg_2<=498 && 2+Arg_2<=Arg_0 && Arg_0+Arg_2<=998 && Arg_0<=500 for location n_f1___3
Found invariant Arg_2<=Arg_0 && 500<=Arg_2 && 1000<=Arg_0+Arg_2 && Arg_0<=Arg_2 && 500<=Arg_0 for location n_f3___4
Found invariant Arg_2<=499 && 1+Arg_2<=Arg_0 && Arg_0+Arg_2<=999 && Arg_0<=1+Arg_2 && Arg_0<=500 for location n_f1___5
Found invariant Arg_2<=498 && 2+Arg_2<=Arg_0 && Arg_0+Arg_2<=998 && Arg_0<=500 && 500<=Arg_0 for location n_f3___1
Start: n_f2
Program_Vars: Arg_0, Arg_2
Temp_Vars: A_P, C_P
Locations: n_f1___3, n_f1___5, n_f2, n_f3___1, n_f3___2, n_f3___4
Transitions:
11:n_f1___3(Arg_0,Arg_2) -> n_f1___3(Arg_0+1,Arg_2):|:Arg_2<=498 && 2+Arg_2<=Arg_0 && Arg_0+Arg_2<=998 && Arg_0<=500 && Arg_0<=500 && Arg_0<=499
12:n_f1___3(Arg_0,Arg_2) -> n_f3___1(Arg_0,Arg_2):|:Arg_2<=498 && 2+Arg_2<=Arg_0 && Arg_0+Arg_2<=998 && Arg_0<=500 && Arg_0<=500 && 500<=Arg_0
13:n_f1___5(Arg_0,Arg_2) -> n_f1___3(Arg_0+1,Arg_2):|:Arg_2<=499 && 1+Arg_2<=Arg_0 && Arg_0+Arg_2<=999 && Arg_0<=1+Arg_2 && Arg_0<=500 && Arg_0<=500 && Arg_0<=1+Arg_2 && 1+Arg_2<=Arg_0 && Arg_0<=500 && Arg_0<=499
14:n_f1___5(Arg_0,Arg_2) -> n_f3___2(Arg_0,Arg_2):|:Arg_2<=499 && 1+Arg_2<=Arg_0 && Arg_0+Arg_2<=999 && Arg_0<=1+Arg_2 && Arg_0<=500 && Arg_0<=500 && Arg_0<=1+Arg_2 && 1+Arg_2<=Arg_0 && Arg_0<=500 && 500<=Arg_0
15:n_f2(Arg_0,Arg_2) -> n_f1___5(A_P,C_P):|:C_P<=499 && A_P<=C_P+1 && 1+C_P<=A_P
16:n_f2(Arg_0,Arg_2) -> n_f3___4(A_P,C_P):|:500<=A_P && A_P<=C_P && C_P<=A_P
Overall timebound:inf {Infinity}
11: n_f1___3->n_f1___3: inf {Infinity}
12: n_f1___3->n_f3___1: 1 {O(1)}
13: n_f1___5->n_f1___3: 1 {O(1)}
14: n_f1___5->n_f3___2: 1 {O(1)}
15: n_f2->n_f1___5: 1 {O(1)}
16: n_f2->n_f3___4: 1 {O(1)}
Overall costbound: inf {Infinity}
11: n_f1___3->n_f1___3: inf {Infinity}
12: n_f1___3->n_f3___1: 1 {O(1)}
13: n_f1___5->n_f1___3: 1 {O(1)}
14: n_f1___5->n_f3___2: 1 {O(1)}
15: n_f2->n_f1___5: 1 {O(1)}
16: n_f2->n_f3___4: 1 {O(1)}
12: n_f1___3->n_f3___1, Arg_0: 500 {O(1)}
14: n_f1___5->n_f3___2, Arg_0: 500 {O(1)}
14: n_f1___5->n_f3___2, Arg_2: 499 {O(1)}