Start: n_f300
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4, Arg_5, Arg_6, Arg_7, Arg_8, Arg_9, Arg_10
Temp_Vars: B_P, C_P, G_P, H_P, NoDet0, NoDet1, NoDet2, NoDet3, NoDet4, NoDet5, NoDet6
Locations: n_f1___2, n_f1___3, n_f2___1, n_f300
Transitions:
0:n_f2___1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> n_f2___1(Arg_0,Arg_2,Arg_2,NoDet0,NoDet1,NoDet2,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:1<=Arg_0 && 1<=Arg_0 && Arg_1<=Arg_2 && Arg_2<=Arg_1 && 1<=Arg_0 && Arg_1<=Arg_2 && Arg_2<=Arg_1 && 1<=Arg_0 && 1<=Arg_6 && 1<=Arg_0
1:n_f300(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> n_f1___2(Arg_0,B_P,C_P,NoDet0,NoDet1,NoDet2,Arg_6,NoDet3,NoDet4,NoDet5,NoDet6):|:Arg_0<=0 && 1<=Arg_6 && B_P<=C_P && C_P<=B_P
2:n_f300(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> n_f1___3(Arg_0,B_P,NoDet0,NoDet1,NoDet2,Arg_5,Arg_6,H_P,NoDet3,NoDet4,NoDet5):|:Arg_6<=0 && B_P<=H_P && H_P<=B_P
3:n_f300(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> n_f2___1(Arg_0,B_P,C_P,NoDet0,NoDet1,NoDet2,G_P,NoDet3,NoDet4,NoDet5,Arg_10):|:1<=G_P && 1<=Arg_0 && B_P<=C_P && C_P<=B_P && Arg_6<=G_P && G_P<=Arg_6
Eliminate variables {NoDet1,NoDet2,NoDet3,NoDet4,NoDet5,NoDet6,Arg_3,Arg_4,Arg_5,Arg_7,Arg_8,Arg_9,Arg_10} that do not contribute to the problem
Found invariant 1<=Arg_6 && 2<=Arg_0+Arg_6 && Arg_2<=Arg_1 && Arg_1<=Arg_2 && 1<=Arg_0 for location n_f2___1
Found invariant 1<=Arg_6 && 1+Arg_0<=Arg_6 && Arg_2<=Arg_1 && Arg_1<=Arg_2 && Arg_0<=0 for location n_f1___2
Found invariant Arg_6<=0 for location n_f1___3
Start: n_f300
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_6
Temp_Vars: B_P, C_P, G_P, H_P, NoDet0
Locations: n_f1___2, n_f1___3, n_f2___1, n_f300
Transitions:
6:n_f2___1(Arg_0,Arg_1,Arg_2,Arg_6) -> n_f2___1(Arg_0,Arg_2,Arg_2,Arg_6):|:1<=Arg_6 && 2<=Arg_0+Arg_6 && Arg_2<=Arg_1 && Arg_1<=Arg_2 && 1<=Arg_0 && 1<=Arg_0 && 1<=Arg_0 && Arg_1<=Arg_2 && Arg_2<=Arg_1 && 1<=Arg_0 && Arg_1<=Arg_2 && Arg_2<=Arg_1 && 1<=Arg_0 && 1<=Arg_6 && 1<=Arg_0
7:n_f300(Arg_0,Arg_1,Arg_2,Arg_6) -> n_f1___2(Arg_0,B_P,C_P,Arg_6):|:Arg_0<=0 && 1<=Arg_6 && B_P<=C_P && C_P<=B_P
8:n_f300(Arg_0,Arg_1,Arg_2,Arg_6) -> n_f1___3(Arg_0,B_P,NoDet0,Arg_6):|:Arg_6<=0 && B_P<=H_P && H_P<=B_P
9:n_f300(Arg_0,Arg_1,Arg_2,Arg_6) -> n_f2___1(Arg_0,B_P,C_P,G_P):|:1<=G_P && 1<=Arg_0 && B_P<=C_P && C_P<=B_P && Arg_6<=G_P && G_P<=Arg_6
Overall timebound:inf {Infinity}
6: n_f2___1->n_f2___1: inf {Infinity}
7: n_f300->n_f1___2: 1 {O(1)}
8: n_f300->n_f1___3: 1 {O(1)}
9: n_f300->n_f2___1: 1 {O(1)}
Overall costbound: inf {Infinity}
6: n_f2___1->n_f2___1: inf {Infinity}
7: n_f300->n_f1___2: 1 {O(1)}
8: n_f300->n_f1___3: 1 {O(1)}
9: n_f300->n_f2___1: 1 {O(1)}
6: n_f2___1->n_f2___1, Arg_0: Arg_0 {O(n)}
6: n_f2___1->n_f2___1, Arg_6: Arg_6 {O(n)}
7: n_f300->n_f1___2, Arg_0: Arg_0 {O(n)}
7: n_f300->n_f1___2, Arg_6: Arg_6 {O(n)}
8: n_f300->n_f1___3, Arg_0: Arg_0 {O(n)}
8: n_f300->n_f1___3, Arg_6: Arg_6 {O(n)}
9: n_f300->n_f2___1, Arg_0: Arg_0 {O(n)}
9: n_f300->n_f2___1, Arg_6: Arg_6 {O(n)}