Initial Problem

Start: n_f3
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3
Temp_Vars: C_P, NoDet0
Locations: n_f1___3, n_f1___4, n_f2___1, n_f2___2, n_f3
Transitions:
0:n_f1___3(Arg_0,Arg_1,Arg_2,Arg_3) -> n_f1___3(0,Arg_1+1,Arg_2+1,Arg_3):|:2+Arg_1<=Arg_2 && Arg_0<=0 && 0<=Arg_0 && Arg_0<=0 && 0<=Arg_0 && Arg_0<=0 && 0<=Arg_0 && 2+Arg_1<=Arg_2 && Arg_0<=0 && 0<=Arg_0 && 2+Arg_1<=Arg_2 && 2+Arg_1<=Arg_2 && Arg_0<=0 && 0<=Arg_0
1:n_f1___4(Arg_0,Arg_1,Arg_2,Arg_3) -> n_f1___3(0,Arg_1+1,Arg_2+1,Arg_3):|:Arg_0<=0 && 0<=Arg_0 && Arg_0<=0 && 0<=Arg_0 && 2+Arg_1<=Arg_2 && Arg_0<=0 && 0<=Arg_0
2:n_f1___4(Arg_0,Arg_1,Arg_2,Arg_3) -> n_f2___1(1,Arg_1+1,Arg_1+1,NoDet0):|:Arg_0<=0 && 0<=Arg_0 && Arg_0<=0 && 0<=Arg_0 && Arg_1+1<=Arg_2 && Arg_2<=1+Arg_1 && Arg_0<=0 && 0<=Arg_0
3:n_f1___4(Arg_0,Arg_1,Arg_2,Arg_3) -> n_f2___2(Arg_0,Arg_1,C_P,NoDet0):|:Arg_0<=0 && 0<=Arg_0 && Arg_0<=0 && 0<=Arg_0 && C_P<=Arg_1 && Arg_2<=C_P && C_P<=Arg_2
4:n_f3(Arg_0,Arg_1,Arg_2,Arg_3) -> n_f1___4(0,Arg_1,Arg_2,Arg_3)

Preprocessing

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

Found invariant Arg_2<=Arg_1 && Arg_1<=Arg_2 && Arg_0<=1 && 1<=Arg_0 for location n_f2___1

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

Found invariant 2+Arg_1<=Arg_2 && Arg_0<=0 && 0<=Arg_0 for location n_f1___3

Found invariant Arg_2<=Arg_1 && Arg_0<=0 && 0<=Arg_0 for location n_f2___2

Problem after Preprocessing

Start: n_f3
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars: C_P
Locations: n_f1___3, n_f1___4, n_f2___1, n_f2___2, n_f3
Transitions:
10:n_f1___3(Arg_0,Arg_1,Arg_2) -> n_f1___3(0,Arg_1+1,Arg_2+1):|:2+Arg_1<=Arg_2 && Arg_0<=0 && 0<=Arg_0 && 2+Arg_1<=Arg_2 && Arg_0<=0 && 0<=Arg_0 && Arg_0<=0 && 0<=Arg_0 && Arg_0<=0 && 0<=Arg_0 && 2+Arg_1<=Arg_2 && Arg_0<=0 && 0<=Arg_0 && 2+Arg_1<=Arg_2 && 2+Arg_1<=Arg_2 && Arg_0<=0 && 0<=Arg_0
11:n_f1___4(Arg_0,Arg_1,Arg_2) -> n_f1___3(0,Arg_1+1,Arg_2+1):|:Arg_0<=0 && 0<=Arg_0 && Arg_0<=0 && 0<=Arg_0 && Arg_0<=0 && 0<=Arg_0 && 2+Arg_1<=Arg_2 && Arg_0<=0 && 0<=Arg_0
12:n_f1___4(Arg_0,Arg_1,Arg_2) -> n_f2___1(1,Arg_1+1,Arg_1+1):|:Arg_0<=0 && 0<=Arg_0 && Arg_0<=0 && 0<=Arg_0 && Arg_0<=0 && 0<=Arg_0 && Arg_1+1<=Arg_2 && Arg_2<=1+Arg_1 && Arg_0<=0 && 0<=Arg_0
13:n_f1___4(Arg_0,Arg_1,Arg_2) -> n_f2___2(Arg_0,Arg_1,C_P):|:Arg_0<=0 && 0<=Arg_0 && Arg_0<=0 && 0<=Arg_0 && Arg_0<=0 && 0<=Arg_0 && C_P<=Arg_1 && Arg_2<=C_P && C_P<=Arg_2
14:n_f3(Arg_0,Arg_1,Arg_2) -> n_f1___4(0,Arg_1,Arg_2)

All Bounds

Timebounds

Overall timebound:inf {Infinity}
10: n_f1___3->n_f1___3: inf {Infinity}
11: n_f1___4->n_f1___3: 1 {O(1)}
12: n_f1___4->n_f2___1: 1 {O(1)}
13: n_f1___4->n_f2___2: 1 {O(1)}
14: n_f3->n_f1___4: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
10: n_f1___3->n_f1___3: inf {Infinity}
11: n_f1___4->n_f1___3: 1 {O(1)}
12: n_f1___4->n_f2___1: 1 {O(1)}
13: n_f1___4->n_f2___2: 1 {O(1)}
14: n_f3->n_f1___4: 1 {O(1)}

Sizebounds

10: n_f1___3->n_f1___3, Arg_0: 0 {O(1)}
11: n_f1___4->n_f1___3, Arg_0: 0 {O(1)}
11: n_f1___4->n_f1___3, Arg_1: Arg_1+1 {O(n)}
11: n_f1___4->n_f1___3, Arg_2: Arg_2+1 {O(n)}
12: n_f1___4->n_f2___1, Arg_0: 1 {O(1)}
12: n_f1___4->n_f2___1, Arg_1: Arg_1+1 {O(n)}
12: n_f1___4->n_f2___1, Arg_2: Arg_1+1 {O(n)}
13: n_f1___4->n_f2___2, Arg_0: 0 {O(1)}
13: n_f1___4->n_f2___2, Arg_1: Arg_1 {O(n)}
13: n_f1___4->n_f2___2, Arg_2: Arg_2 {O(n)}
14: n_f3->n_f1___4, Arg_0: 0 {O(1)}
14: n_f3->n_f1___4, Arg_1: Arg_1 {O(n)}
14: n_f3->n_f1___4, Arg_2: Arg_2 {O(n)}