NO


Termination: (Ranking Functions Found)
------------
l26: < < x5_0 > >
l27: < < x5_0 > >


NON-Termination:
----------------
SCC:
+--transitions: t2,t4
+--nodes: l3,l4
Closed walk: 2 -> t4, t2
deterministic: Forced for: X15, X14, X13, X9, X8, X7, X2, X9, oldX9_post, oldX8_post, oldX7_post, oldX3_post, oldX2_post, oldX1_post, oldX0_post
Reachability checked!
- Recurrent Set Found:
{
	x6_post == 0,
	x5_post == 0,
	x4_post == 0,
	-1 + x3_post == 0,
	x2_post == 0,
	x1_post == 0,
	x0_post == 0,
	oldX9_post == 0,
	oldX8_post == 0,
	oldX7_post == 0,
	oldX6_post == 0,
	oldX5_post == 0,
	oldX4_post == 0,
	-1 + oldX3_post == 0,
	oldX2_post == 0,
	oldX1_post == 0,
	oldX13_0 -oldX13_post == 0,
	oldX12_0 -oldX12_post == 0,
	oldX11_0 -oldX11_post == 0,
	oldX10_0 -oldX10_post == 0,
	oldX0_post == 0,
	__const_32_post == 0,
	__const_31_0 -__const_31_post == 0,
	X22 == 0,
	X21 == 0,
	X20 == 0,
	-1 + X19 == 0,
	X18 == 0,
	X17 == 0,
	X16 == 0,
	X15 == 0,
	X14 == 0,
	X13 == 0,
	x6_0 -X12 == 0,
	x5_0 -X11 == 0,
	x4_0 -X10 == 0,
	-1 + X9 == 0,
	X8 == 0,
	X7 == 0,
	oldX13_0 -X6 == 0,
	oldX12_0 -X5 == 0,
	oldX11_0 -X4 == 0,
	oldX10_0 -X3 == 0,
	X2 == 0,
	X1 == 0,
	__const_31_0 -X0 == 0,
	-1 + x3_0 == 0,
	x2_0 == 0,
	x1_0 == 0,
	x0_0 == 0,
	__const_32_0 == 0,
	-__const_31_0 >= 0
}
Connected Subgraphs where we couldn't prove Termination:
--------------------------------------------------------
SCC:
+--transitions: t14,t15
+--nodes: l11,l12
SCC:
+--transitions: t18,t20
+--nodes: l14,l15
SCC:
+--transitions: t21,t23
+--nodes: l16,l17
SCC:
+--transitions: t10,t5,t7,t8
+--nodes: l5,l6,l7
SCC:
+--transitions: t24,t27,t28,t30
+--nodes: l18,l19,l21
SCC:
+--transitions: t1,t39
+--nodes: l0,l2
SCC:
+--transitions: t36
+--nodes: l26,l27


method 1