Initial Problem

Start: n_f0
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: n_f0, n_f2___1, n_f2___2
Transitions:
0:n_f0(Arg_0,Arg_1,Arg_2) -> n_f2___2(Arg_0,Arg_1,Arg_2):|:0<=Arg_0
1:n_f2___1(Arg_0,Arg_1,Arg_2) -> n_f2___1(Arg_0+Arg_1,Arg_1-2,Arg_2+1)
2:n_f2___1(Arg_0,Arg_1,Arg_2) -> n_f2___1(Arg_0+Arg_2,Arg_1,Arg_2-2)
3:n_f2___2(Arg_0,Arg_1,Arg_2) -> n_f2___1(Arg_0+Arg_1,Arg_1-2,Arg_2+1):|:0<=Arg_0
4:n_f2___2(Arg_0,Arg_1,Arg_2) -> n_f2___1(Arg_0+Arg_2,Arg_1,Arg_2-2):|:0<=Arg_0

Preprocessing

Found invariant 0<=Arg_0 for location n_f2___2

Problem after Preprocessing

Start: n_f0
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: n_f0, n_f2___1, n_f2___2
Transitions:
0:n_f0(Arg_0,Arg_1,Arg_2) -> n_f2___2(Arg_0,Arg_1,Arg_2):|:0<=Arg_0
1:n_f2___1(Arg_0,Arg_1,Arg_2) -> n_f2___1(Arg_0+Arg_1,Arg_1-2,Arg_2+1)
2:n_f2___1(Arg_0,Arg_1,Arg_2) -> n_f2___1(Arg_0+Arg_2,Arg_1,Arg_2-2)
3:n_f2___2(Arg_0,Arg_1,Arg_2) -> n_f2___1(Arg_0+Arg_1,Arg_1-2,Arg_2+1):|:0<=Arg_0 && 0<=Arg_0
4:n_f2___2(Arg_0,Arg_1,Arg_2) -> n_f2___1(Arg_0+Arg_2,Arg_1,Arg_2-2):|:0<=Arg_0 && 0<=Arg_0

All Bounds

Timebounds

Overall timebound:inf {Infinity}
0: n_f0->n_f2___2: 1 {O(1)}
1: n_f2___1->n_f2___1: inf {Infinity}
2: n_f2___1->n_f2___1: inf {Infinity}
3: n_f2___2->n_f2___1: 1 {O(1)}
4: n_f2___2->n_f2___1: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
0: n_f0->n_f2___2: 1 {O(1)}
1: n_f2___1->n_f2___1: inf {Infinity}
2: n_f2___1->n_f2___1: inf {Infinity}
3: n_f2___2->n_f2___1: 1 {O(1)}
4: n_f2___2->n_f2___1: 1 {O(1)}

Sizebounds

0: n_f0->n_f2___2, Arg_0: Arg_0 {O(n)}
0: n_f0->n_f2___2, Arg_1: Arg_1 {O(n)}
0: n_f0->n_f2___2, Arg_2: Arg_2 {O(n)}
3: n_f2___2->n_f2___1, Arg_0: Arg_0+Arg_1 {O(n)}
3: n_f2___2->n_f2___1, Arg_1: Arg_1+2 {O(n)}
3: n_f2___2->n_f2___1, Arg_2: Arg_2+1 {O(n)}
4: n_f2___2->n_f2___1, Arg_0: Arg_0+Arg_2 {O(n)}
4: n_f2___2->n_f2___1, Arg_1: Arg_1 {O(n)}
4: n_f2___2->n_f2___1, Arg_2: Arg_2+2 {O(n)}