NO


Termination: (Ranking Functions Found)
------------
l0: < < x3_0 > >
l2: < < x3_0 > >


NON-Termination:
----------------
SCC:
+--transitions: t5,t7
+--nodes: l4,l5
Closed walk: 2 -> t7, t5
deterministic: Forced for: X6, X4, X3, X2, X4, oldX4_post, oldX2_post, oldX1_post, oldX0_post
Reachability checked!
- Recurrent Set Found:
{
	x3_post == 0,
	-1 + x2_post == 0,
	x1_post == 0,
	x0_post == 0,
	oldX7_0 -oldX7_post == 0,
	oldX6_0 -oldX6_post == 0,
	oldX5_0 -oldX5_post == 0,
	oldX4_post == 0,
	oldX3_post == 0,
	-1 + oldX2_post == 0,
	oldX1_post == 0,
	oldX0_post == 0,
	__const_8_post == 0,
	__const_7_0 -__const_7_post == 0,
	X13 == 0,
	-1 + X12 == 0,
	X11 == 0,
	X10 == 0,
	oldX7_0 -X9 == 0,
	oldX6_0 -X8 == 0,
	oldX5_0 -X7 == 0,
	X6 == 0,
	x3_0 -X5 == 0,
	-1 + X4 == 0,
	X3 == 0,
	X2 == 0,
	X1 == 0,
	__const_7_0 -X0 == 0,
	-1 + x2_0 == 0,
	x1_0 == 0,
	x0_0 == 0,
	__const_8_0 == 0,
	-__const_7_0 >= 0
}
Connected Subgraphs where we couldn't prove Termination:
--------------------------------------------------------
SCC:
+--transitions: t2
+--nodes: l0,l2


method 1