Initial Problem

Start: l0
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4, Arg_5
Temp_Vars:
Locations: l0, l1
Transitions:
0:l0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> l1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5)
1:l1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> l1(Arg_0+Arg_1,Arg_1+Arg_2,Arg_2+Arg_3,Arg_3+Arg_4,Arg_4+Arg_5,Arg_5-1):|:1<=Arg_0

Preprocessing

Problem after Preprocessing

Start: l0
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4, Arg_5
Temp_Vars:
Locations: l0, l1
Transitions:
0:l0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> l1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5)
1:l1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> l1(Arg_0+Arg_1,Arg_1+Arg_2,Arg_2+Arg_3,Arg_3+Arg_4,Arg_4+Arg_5,Arg_5-1):|:1<=Arg_0

All Bounds

Timebounds

Overall timebound:inf {Infinity}
0: l0->l1: 1 {O(1)}
1: l1->l1: inf {Infinity}

Costbounds

Overall costbound: inf {Infinity}
0: l0->l1: 1 {O(1)}
1: l1->l1: inf {Infinity}

Sizebounds

0: l0->l1, Arg_0: Arg_0 {O(n)}
0: l0->l1, Arg_1: Arg_1 {O(n)}
0: l0->l1, Arg_2: Arg_2 {O(n)}
0: l0->l1, Arg_3: Arg_3 {O(n)}
0: l0->l1, Arg_4: Arg_4 {O(n)}
0: l0->l1, Arg_5: Arg_5 {O(n)}