Start: l0
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3
Temp_Vars:
Locations: l0, l1, l2
Transitions:
0:l0(Arg_0,Arg_1,Arg_2,Arg_3) -> l1(Arg_0,Arg_1,Arg_2,Arg_3)
1:l1(Arg_0,Arg_1,Arg_2,Arg_3) -> l1(Arg_0+Arg_1,Arg_1+Arg_2,Arg_2-1,Arg_3):|:1<=Arg_0
2:l1(Arg_0,Arg_1,Arg_2,Arg_3) -> l2(Arg_0,Arg_1,Arg_2,Arg_3-1):|:Arg_0<=0
3:l2(Arg_0,Arg_1,Arg_2,Arg_3) -> l1(Arg_3,Arg_3,Arg_3,Arg_3):|:1<=Arg_3
Found invariant Arg_0<=0 for location l2
Start: l0
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3
Temp_Vars:
Locations: l0, l1, l2
Transitions:
0:l0(Arg_0,Arg_1,Arg_2,Arg_3) -> l1(Arg_0,Arg_1,Arg_2,Arg_3)
1:l1(Arg_0,Arg_1,Arg_2,Arg_3) -> l1(Arg_0+Arg_1,Arg_1+Arg_2,Arg_2-1,Arg_3):|:1<=Arg_0
2:l1(Arg_0,Arg_1,Arg_2,Arg_3) -> l2(Arg_0,Arg_1,Arg_2,Arg_3-1):|:Arg_0<=0
3:l2(Arg_0,Arg_1,Arg_2,Arg_3) -> l1(Arg_3,Arg_3,Arg_3,Arg_3):|:Arg_0<=0 && 1<=Arg_3
new bound:
Arg_3+1 {O(n)}
MPRF:
l2 [Arg_3 ]
l1 [Arg_3-1 ]
new bound:
Arg_3+2 {O(n)}
MPRF:
l1 [1 ]
l2 [0 ]
Cut unsatisfiable transition 41: n_l1___1->l2
Found invariant Arg_0<=0 for location l2
Found invariant Arg_3<=1+Arg_2 && 1+Arg_3<=Arg_1 && 1+Arg_3<=Arg_0 && 1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 3<=Arg_1+Arg_3 && 3<=Arg_0+Arg_3 && 2+Arg_2<=Arg_1 && 2+Arg_2<=Arg_0 && 0<=Arg_2 && 2<=Arg_1+Arg_2 && 2<=Arg_0+Arg_2 && 2<=Arg_1 && 4<=Arg_0+Arg_1 && 2<=Arg_0 for location n_l1___1
knowledge_propagation leads to new time bound 1 {O(1)} for transition 2:l1(Arg_0,Arg_1,Arg_2,Arg_3) -> l2(Arg_0,Arg_1,Arg_2,Arg_3-1):|:Arg_0<=0
knowledge_propagation leads to new time bound Arg_3+2 {O(n)} for transition 37:l1(Arg_0,Arg_1,Arg_2,Arg_3) -> n_l1___1(Arg_0+Arg_1,Arg_1+Arg_2,Arg_2-1,Arg_3):|:1<=Arg_0 && Arg_0<=Arg_2 && Arg_2<=Arg_0 && Arg_0<=Arg_3 && Arg_3<=Arg_0 && Arg_0<=Arg_1 && Arg_1<=Arg_0 && 1<=Arg_0 && 1<=Arg_0 && Arg_1<=Arg_0+Arg_2 && 1<=Arg_0
knowledge_propagation leads to new time bound Arg_3+2 {O(n)} for transition 38:l1(Arg_0,Arg_1,Arg_2,Arg_3) -> n_l1___2(Arg_0+Arg_1,Arg_1+Arg_2,Arg_2-1,Arg_3):|:1<=Arg_0
knowledge_propagation leads to new time bound Arg_3+2 {O(n)} for transition 35:n_l1___1(Arg_0,Arg_1,Arg_2,Arg_3) -> n_l1___2(Arg_0+Arg_1,Arg_1+Arg_2,Arg_2-1,Arg_3):|:Arg_3<=1+Arg_2 && 1+Arg_3<=Arg_1 && 1+Arg_3<=Arg_0 && 1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 3<=Arg_1+Arg_3 && 3<=Arg_0+Arg_3 && 2+Arg_2<=Arg_1 && 2+Arg_2<=Arg_0 && 0<=Arg_2 && 2<=Arg_1+Arg_2 && 2<=Arg_0+Arg_2 && 2<=Arg_1 && 4<=Arg_0+Arg_1 && 2<=Arg_0 && 1<=Arg_0 && 1<=Arg_0 && Arg_1<=Arg_0+Arg_2 && 1<=Arg_0
new bound:
Arg_3+2 {O(n)}
MPRF:
l1 [1 ]
n_l1___1 [1 ]
n_l1___2 [1 ]
l2 [0 ]
Overall timebound:inf {Infinity}
0: l0->l1: 1 {O(1)}
1: l1->l1: inf {Infinity}
2: l1->l2: Arg_3+2 {O(n)}
3: l2->l1: Arg_3+1 {O(n)}
Overall costbound: inf {Infinity}
0: l0->l1: 1 {O(1)}
1: l1->l1: inf {Infinity}
2: l1->l2: Arg_3+2 {O(n)}
3: l2->l1: Arg_3+1 {O(n)}
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)}
1: l1->l1, Arg_3: 3*Arg_3+2 {O(n)}
2: l1->l2, Arg_3: 3*Arg_3+2 {O(n)}
3: l2->l1, Arg_0: 3*Arg_3+2 {O(n)}
3: l2->l1, Arg_1: 3*Arg_3+2 {O(n)}
3: l2->l1, Arg_2: 3*Arg_3+2 {O(n)}
3: l2->l1, Arg_3: 3*Arg_3+2 {O(n)}