NO


NON-Termination:
----------------
SCC:
+--transitions: t3,t4
+--nodes: l6,l7
Closed walk: 2 -> t3, t4
Reachability checked!
- Recurrent Set Found:
{
	n_0 -n_post == 0,
	___rho_1__0 -dobreak_post == 0,
	___rho_2__0 -___rho_2__post == 0,
	___rho_1__0 -___rho_1__post == 0,
	R_post == 0,
	A_post == 0,
	n_0 -X5 == 0,
	___rho_1__0 -X4 == 0,
	___rho_2__0 -X3 == 0,
	___rho_1__0 -X2 == 0,
	X1 == 0,
	X0 == 0,
	___rho_1__0 -dobreak_0 == 0,
	R_0 == 0,
	A_0 == 0,
	-1 + ___rho_1__0 >= 0
}
Connected Subgraphs where we couldn't prove Termination:
--------------------------------------------------------
SCC:
+--transitions: t0,t1,t5,t6,t7
+--nodes: l0,l1,l2,l3


method 1