NO


Termination: (Ranking Functions Found)
------------
l0: < < -i5_0 + length4_0 > >
l2: < < -i5_0 + length4_0 > >


NON-Termination:
----------------
SCC:
+--transitions: t12,t3,t4,t6
+--nodes: l3,l4,l5
Closed walk: 3 -> t12, t4, t3
Reachability checked!
- Recurrent Set Found:
{
	tmp_0 -tmp_post == 0,
	s_0 -s_post == 0,
	length4_0 -length4_post == 0,
	i5_0 -i5_post == 0,
	tmp_0 -X7 == 0,
	s_0 -X6 == 0,
	length4_0 -X5 == 0,
	i5_0 -X4 == 0,
	tmp_0 -X3 == 0,
	s_0 -X2 == 0,
	length4_0 -X1 == 0,
	i5_0 -X0 == 0
}
Connected Subgraphs where we couldn't prove Termination:
--------------------------------------------------------
SCC:
+--transitions: t10,t7,t8,t9
+--nodes: l1,l7,l8
SCC:
+--transitions: t2
+--nodes: l0,l2


method 1