Start: n_l0
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4
Temp_Vars:
Locations: n_l0, n_l1___3, n_l1___4, n_l2___1, n_l2___2
Transitions:
0:n_l0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> n_l1___4(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4)
1:n_l1___3(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> n_l1___3(Arg_0+Arg_1,Arg_1+Arg_2,Arg_2-1,Arg_3,Arg_4):|:Arg_1<=Arg_0+Arg_2 && 1<=Arg_0
2:n_l1___3(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> n_l2___2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4):|:Arg_1<=Arg_0+Arg_2 && Arg_0<=0
3:n_l1___4(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> n_l1___3(Arg_0+Arg_1,Arg_1+Arg_2,Arg_2-1,Arg_3,Arg_4):|:1<=Arg_0
4:n_l1___4(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> n_l2___2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4):|:Arg_0<=0
5:n_l2___1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> n_l2___1(Arg_0,Arg_1,Arg_2,Arg_3+Arg_4,Arg_4-1):|:Arg_0<=0 && 2+Arg_4<=Arg_3 && 1<=Arg_3
6:n_l2___2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> n_l2___1(Arg_0,Arg_1,Arg_2,Arg_3+Arg_4,Arg_4-1):|:Arg_0<=0 && 1<=Arg_3
Found invariant 2+Arg_4<=Arg_3 && Arg_0<=0 for location n_l2___1
Found invariant Arg_0<=0 for location n_l2___2
Start: n_l0
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4
Temp_Vars:
Locations: n_l0, n_l1___3, n_l1___4, n_l2___1, n_l2___2
Transitions:
0:n_l0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> n_l1___4(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4)
1:n_l1___3(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> n_l1___3(Arg_0+Arg_1,Arg_1+Arg_2,Arg_2-1,Arg_3,Arg_4):|:Arg_1<=Arg_0+Arg_2 && 1<=Arg_0
2:n_l1___3(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> n_l2___2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4):|:Arg_1<=Arg_0+Arg_2 && Arg_0<=0
3:n_l1___4(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> n_l1___3(Arg_0+Arg_1,Arg_1+Arg_2,Arg_2-1,Arg_3,Arg_4):|:1<=Arg_0
4:n_l1___4(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> n_l2___2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4):|:Arg_0<=0
5:n_l2___1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> n_l2___1(Arg_0,Arg_1,Arg_2,Arg_3+Arg_4,Arg_4-1):|:2+Arg_4<=Arg_3 && Arg_0<=0 && Arg_0<=0 && 2+Arg_4<=Arg_3 && 1<=Arg_3
6:n_l2___2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> n_l2___1(Arg_0,Arg_1,Arg_2,Arg_3+Arg_4,Arg_4-1):|:Arg_0<=0 && Arg_0<=0 && 1<=Arg_3
Overall timebound:inf {Infinity}
0: n_l0->n_l1___4: 1 {O(1)}
1: n_l1___3->n_l1___3: inf {Infinity}
2: n_l1___3->n_l2___2: 1 {O(1)}
3: n_l1___4->n_l1___3: 1 {O(1)}
4: n_l1___4->n_l2___2: 1 {O(1)}
5: n_l2___1->n_l2___1: inf {Infinity}
6: n_l2___2->n_l2___1: 1 {O(1)}
Overall costbound: inf {Infinity}
0: n_l0->n_l1___4: 1 {O(1)}
1: n_l1___3->n_l1___3: inf {Infinity}
2: n_l1___3->n_l2___2: 1 {O(1)}
3: n_l1___4->n_l1___3: 1 {O(1)}
4: n_l1___4->n_l2___2: 1 {O(1)}
5: n_l2___1->n_l2___1: inf {Infinity}
6: n_l2___2->n_l2___1: 1 {O(1)}
0: n_l0->n_l1___4, Arg_0: Arg_0 {O(n)}
0: n_l0->n_l1___4, Arg_1: Arg_1 {O(n)}
0: n_l0->n_l1___4, Arg_2: Arg_2 {O(n)}
0: n_l0->n_l1___4, Arg_3: Arg_3 {O(n)}
0: n_l0->n_l1___4, Arg_4: Arg_4 {O(n)}
1: n_l1___3->n_l1___3, Arg_3: Arg_3 {O(n)}
1: n_l1___3->n_l1___3, Arg_4: Arg_4 {O(n)}
2: n_l1___3->n_l2___2, Arg_3: 2*Arg_3 {O(n)}
2: n_l1___3->n_l2___2, Arg_4: 2*Arg_4 {O(n)}
3: n_l1___4->n_l1___3, Arg_0: Arg_0+Arg_1 {O(n)}
3: n_l1___4->n_l1___3, Arg_1: Arg_1+Arg_2 {O(n)}
3: n_l1___4->n_l1___3, Arg_2: Arg_2+1 {O(n)}
3: n_l1___4->n_l1___3, Arg_3: Arg_3 {O(n)}
3: n_l1___4->n_l1___3, Arg_4: Arg_4 {O(n)}
4: n_l1___4->n_l2___2, Arg_0: Arg_0 {O(n)}
4: n_l1___4->n_l2___2, Arg_1: Arg_1 {O(n)}
4: n_l1___4->n_l2___2, Arg_2: Arg_2 {O(n)}
4: n_l1___4->n_l2___2, Arg_3: Arg_3 {O(n)}
4: n_l1___4->n_l2___2, Arg_4: Arg_4 {O(n)}
6: n_l2___2->n_l2___1, Arg_3: 3*Arg_3+3*Arg_4 {O(n)}
6: n_l2___2->n_l2___1, Arg_4: 3*Arg_4+2 {O(n)}