Initial Problem

Start: n_l0
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: n_l0, n_l1___1, n_l1___2
Transitions:
0:n_l0(Arg_0,Arg_1) -> n_l1___2(Arg_0,Arg_1)
1:n_l1___1(Arg_0,Arg_1) -> n_l1___1(Arg_0-2*Arg_1,Arg_1+1):|:3<=Arg_0+2*Arg_1 && 1<=Arg_0
2:n_l1___2(Arg_0,Arg_1) -> n_l1___1(Arg_0-2*Arg_1,Arg_1+1):|:1<=Arg_0

Preprocessing

Problem after Preprocessing

Start: n_l0
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: n_l0, n_l1___1, n_l1___2
Transitions:
0:n_l0(Arg_0,Arg_1) -> n_l1___2(Arg_0,Arg_1)
1:n_l1___1(Arg_0,Arg_1) -> n_l1___1(Arg_0-2*Arg_1,Arg_1+1):|:3<=Arg_0+2*Arg_1 && 1<=Arg_0
2:n_l1___2(Arg_0,Arg_1) -> n_l1___1(Arg_0-2*Arg_1,Arg_1+1):|:1<=Arg_0

All Bounds

Timebounds

Overall timebound:inf {Infinity}
0: n_l0->n_l1___2: 1 {O(1)}
1: n_l1___1->n_l1___1: inf {Infinity}
2: n_l1___2->n_l1___1: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
0: n_l0->n_l1___2: 1 {O(1)}
1: n_l1___1->n_l1___1: inf {Infinity}
2: n_l1___2->n_l1___1: 1 {O(1)}

Sizebounds

0: n_l0->n_l1___2, Arg_0: Arg_0 {O(n)}
0: n_l0->n_l1___2, Arg_1: Arg_1 {O(n)}
2: n_l1___2->n_l1___1, Arg_0: 2*Arg_0+2*Arg_1 {O(n)}
2: n_l1___2->n_l1___1, Arg_1: Arg_1+1 {O(n)}