Initial Problem

Start: n_f1
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4, Arg_5, Arg_6, Arg_7, Arg_8, Arg_9
Temp_Vars: G_P, H_P, I_P, J_P, NoDet0, NoDet1, NoDet2
Locations: n_f1, n_f2___2, n_f2___3, n_f300___1
Transitions:
0:n_f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9) -> n_f2___3(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,G_P,H_P,I_P,J_P):|:H_P<=I_P && I_P<=H_P && G_P<=J_P && J_P<=G_P
1:n_f2___2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9) -> n_f2___2(Arg_0,Arg_1,NoDet0,NoDet1,NoDet2,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9):|:1+Arg_0<=Arg_1 && 1+Arg_0<=Arg_1 && 1+Arg_0<=Arg_1 && Arg_6<=Arg_9 && Arg_9<=Arg_6 && Arg_7<=Arg_8 && Arg_8<=Arg_7 && 1+Arg_0<=Arg_1
2:n_f2___3(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9) -> n_f2___2(Arg_0,Arg_1,NoDet0,NoDet1,NoDet2,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9):|:Arg_6<=Arg_9 && Arg_9<=Arg_6 && Arg_7<=Arg_8 && Arg_8<=Arg_7 && 1+Arg_0<=Arg_1
3:n_f2___3(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9) -> n_f300___1(Arg_0,Arg_1,NoDet0,NoDet1,Arg_4,NoDet2,Arg_6,Arg_7,Arg_8,Arg_9):|:Arg_6<=Arg_9 && Arg_9<=Arg_6 && Arg_7<=Arg_8 && Arg_8<=Arg_7 && Arg_1<=Arg_0

Preprocessing

Eliminate variables {NoDet0,NoDet1,NoDet2,Arg_2,Arg_3,Arg_4,Arg_5} that do not contribute to the problem

Found invariant Arg_9<=Arg_6 && Arg_6<=Arg_9 && Arg_8<=Arg_7 && Arg_7<=Arg_8 && Arg_1<=Arg_0 for location n_f300___1

Found invariant Arg_9<=Arg_6 && Arg_6<=Arg_9 && Arg_8<=Arg_7 && Arg_7<=Arg_8 && 1+Arg_0<=Arg_1 for location n_f2___2

Found invariant Arg_9<=Arg_6 && Arg_6<=Arg_9 && Arg_8<=Arg_7 && Arg_7<=Arg_8 for location n_f2___3

Problem after Preprocessing

Start: n_f1
Program_Vars: Arg_0, Arg_1, Arg_6, Arg_7, Arg_8, Arg_9
Temp_Vars: G_P, H_P, I_P, J_P
Locations: n_f1, n_f2___2, n_f2___3, n_f300___1
Transitions:
8:n_f1(Arg_0,Arg_1,Arg_6,Arg_7,Arg_8,Arg_9) -> n_f2___3(Arg_0,Arg_1,G_P,H_P,I_P,J_P):|:H_P<=I_P && I_P<=H_P && G_P<=J_P && J_P<=G_P
9:n_f2___2(Arg_0,Arg_1,Arg_6,Arg_7,Arg_8,Arg_9) -> n_f2___2(Arg_0,Arg_1,Arg_6,Arg_7,Arg_8,Arg_9):|:Arg_9<=Arg_6 && Arg_6<=Arg_9 && Arg_8<=Arg_7 && Arg_7<=Arg_8 && 1+Arg_0<=Arg_1 && 1+Arg_0<=Arg_1 && 1+Arg_0<=Arg_1 && 1+Arg_0<=Arg_1 && Arg_6<=Arg_9 && Arg_9<=Arg_6 && Arg_7<=Arg_8 && Arg_8<=Arg_7 && 1+Arg_0<=Arg_1
10:n_f2___3(Arg_0,Arg_1,Arg_6,Arg_7,Arg_8,Arg_9) -> n_f2___2(Arg_0,Arg_1,Arg_6,Arg_7,Arg_8,Arg_9):|:Arg_9<=Arg_6 && Arg_6<=Arg_9 && Arg_8<=Arg_7 && Arg_7<=Arg_8 && Arg_6<=Arg_9 && Arg_9<=Arg_6 && Arg_7<=Arg_8 && Arg_8<=Arg_7 && 1+Arg_0<=Arg_1
11:n_f2___3(Arg_0,Arg_1,Arg_6,Arg_7,Arg_8,Arg_9) -> n_f300___1(Arg_0,Arg_1,Arg_6,Arg_7,Arg_8,Arg_9):|:Arg_9<=Arg_6 && Arg_6<=Arg_9 && Arg_8<=Arg_7 && Arg_7<=Arg_8 && Arg_6<=Arg_9 && Arg_9<=Arg_6 && Arg_7<=Arg_8 && Arg_8<=Arg_7 && Arg_1<=Arg_0

All Bounds

Timebounds

Overall timebound:inf {Infinity}
8: n_f1->n_f2___3: 1 {O(1)}
9: n_f2___2->n_f2___2: inf {Infinity}
10: n_f2___3->n_f2___2: 1 {O(1)}
11: n_f2___3->n_f300___1: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
8: n_f1->n_f2___3: 1 {O(1)}
9: n_f2___2->n_f2___2: inf {Infinity}
10: n_f2___3->n_f2___2: 1 {O(1)}
11: n_f2___3->n_f300___1: 1 {O(1)}

Sizebounds

8: n_f1->n_f2___3, Arg_0: Arg_0 {O(n)}
8: n_f1->n_f2___3, Arg_1: Arg_1 {O(n)}
9: n_f2___2->n_f2___2, Arg_0: Arg_0 {O(n)}
9: n_f2___2->n_f2___2, Arg_1: Arg_1 {O(n)}
10: n_f2___3->n_f2___2, Arg_0: Arg_0 {O(n)}
10: n_f2___3->n_f2___2, Arg_1: Arg_1 {O(n)}
11: n_f2___3->n_f300___1, Arg_0: Arg_0 {O(n)}
11: n_f2___3->n_f300___1, Arg_1: Arg_1 {O(n)}