NO


NON-Termination:
----------------
SCC:
+--transitions: t0,t1,t2
+--nodes: l0,l1
Closed walk: 2 -> t2, t0
deterministic: Forced for: X1
Reachability checked!
- Recurrent Set Found:
{
	x_0 -x_post == 0,
	start_post == 0,
	p_post == 0,
	__rho_2_post == 0,
	__rho_1_0 -__rho_1_post == 0,
	x_0 -X4 == 0,
	X3 == 0,
	X2 == 0,
	X1 == 0,
	__rho_1_0 -X0 == 0,
	start_0 == 0,
	p_0 == 0,
	-x_0 >= 0
}
Connected Subgraphs where we couldn't prove Termination:
--------------------------------------------------------
SCC:
+--transitions: t3,t4,t6
+--nodes: l2,l3


method 1