Initial Problem

Start: n_f300
Program_Vars: Arg_0, Arg_1
Temp_Vars: NoDet0
Locations: n_f1___1, n_f1___3, n_f2___2, n_f2___4, n_f300
Transitions:
0:n_f2___2(Arg_0,Arg_1) -> n_f1___1(Arg_0-1,NoDet0):|:1<=Arg_0 && Arg_0<=1
1:n_f2___2(Arg_0,Arg_1) -> n_f2___2(Arg_0-1,Arg_1):|:1<=Arg_0 && 2<=Arg_0
2:n_f2___4(Arg_0,Arg_1) -> n_f1___3(Arg_0-1,NoDet0):|:Arg_0<=1
3:n_f2___4(Arg_0,Arg_1) -> n_f2___2(Arg_0-1,Arg_1):|:2<=Arg_0
4:n_f300(Arg_0,Arg_1) -> n_f2___4(Arg_0,Arg_1)

Preprocessing

Eliminate variables {NoDet0,Arg_1} that do not contribute to the problem

Found invariant Arg_0<=0 for location n_f1___3

Found invariant Arg_0<=0 && 0<=Arg_0 for location n_f1___1

Found invariant 1<=Arg_0 for location n_f2___2

Problem after Preprocessing

Start: n_f300
Program_Vars: Arg_0
Temp_Vars:
Locations: n_f1___1, n_f1___3, n_f2___2, n_f2___4, n_f300
Transitions:
10:n_f2___2(Arg_0) -> n_f1___1(Arg_0-1):|:1<=Arg_0 && 1<=Arg_0 && Arg_0<=1
11:n_f2___2(Arg_0) -> n_f2___2(Arg_0-1):|:1<=Arg_0 && 1<=Arg_0 && 2<=Arg_0
12:n_f2___4(Arg_0) -> n_f1___3(Arg_0-1):|:Arg_0<=1
13:n_f2___4(Arg_0) -> n_f2___2(Arg_0-1):|:2<=Arg_0
14:n_f300(Arg_0) -> n_f2___4(Arg_0)

MPRF for transition 11:n_f2___2(Arg_0) -> n_f2___2(Arg_0-1):|:1<=Arg_0 && 1<=Arg_0 && 2<=Arg_0 of depth 1:

new bound:

Arg_0 {O(n)}

MPRF:

n_f2___2 [Arg_0 ]

All Bounds

Timebounds

Overall timebound:Arg_0+4 {O(n)}
10: n_f2___2->n_f1___1: 1 {O(1)}
11: n_f2___2->n_f2___2: Arg_0 {O(n)}
12: n_f2___4->n_f1___3: 1 {O(1)}
13: n_f2___4->n_f2___2: 1 {O(1)}
14: n_f300->n_f2___4: 1 {O(1)}

Costbounds

Overall costbound: Arg_0+4 {O(n)}
10: n_f2___2->n_f1___1: 1 {O(1)}
11: n_f2___2->n_f2___2: Arg_0 {O(n)}
12: n_f2___4->n_f1___3: 1 {O(1)}
13: n_f2___4->n_f2___2: 1 {O(1)}
14: n_f300->n_f2___4: 1 {O(1)}

Sizebounds

10: n_f2___2->n_f1___1, Arg_0: 0 {O(1)}
11: n_f2___2->n_f2___2, Arg_0: Arg_0 {O(n)}
12: n_f2___4->n_f1___3, Arg_0: Arg_0+1 {O(n)}
13: n_f2___4->n_f2___2, Arg_0: Arg_0 {O(n)}
14: n_f300->n_f2___4, Arg_0: Arg_0 {O(n)}