NO


Termination: (Ranking Functions Found)
------------
l2: < < n1_0 -y_0 > >
l3: < < n1_0 -y_0 > >
l4: < < n1_0 -y_0 > >
l5: < < n1_0 -y_0 > >


NON-Termination:
----------------
SCC:
+--transitions: t11,t19,t20,t21,t22,t23,t24,t25,t26,t7
+--nodes: l2,l3,l4,l5
Closed walk: 4 -> t25, t22, t7, t19
deterministic: Forced for: X2, X7, X10, X14, X12, X3, X14, X14, X12, X12, X7, X7, X7, X10, X10, X3, X3, X17, X22, X25, X29, X27, X18, X29, X29, X27, X27, X22, X22, X22, X25, X25, X18, X18, X36, X36, X37, X40, X44, X42, X33, X44, X44, X42, X42, X37, X37, X37, X40, X40, X33, X33, y_post, x_post, is_aborted_post, pc_Drive_next_post, pc_Plan_next_post, y_next_post, x_next_post, is_aborted_next_post, y_next_post, y_next_post, x_next_post, x_next_post, pc_Drive_next_post, pc_Drive_next_post, pc_Drive_next_post, pc_Plan_next_post, pc_Plan_next_post, is_aborted_next_post, is_aborted_next_post
Reachability checked!
- Recurrent Set Found:
{
	y_next_post == 0,
	y_post == 0,
	x_next_post == 0,
	x_post == 0,
	-1 + pc_Plan_next_post == 0,
	-1 + pc_Plan_post == 0,
	-2 + pc_Loop_post == 0,
	-5 + pc_Drive_next_post == 0,
	-5 + pc_Drive_post == 0,
	n1_0 -n1_post == 0,
	n0_0 -n0_post == 0,
	is_aborted_next_post == 0,
	is_aborted_post == 0,
	fair_0 -fair_post == 0,
	-1 + executed_Drive_post == 0,
	X44 == 0,
	X43 == 0,
	X42 == 0,
	X41 == 0,
	-1 + X40 == 0,
	-1 + X39 == 0,
	-4 + X38 == 0,
	-7 + X37 == 0,
	-7 + X36 == 0,
	n1_0 -X35 == 0,
	n0_0 -X34 == 0,
	X33 == 0,
	X32 == 0,
	fair_0 -X31 == 0,
	-1 + X30 == 0,
	X29 == 0,
	X28 == 0,
	X27 == 0,
	X26 == 0,
	-1 + X25 == 0,
	-1 + X24 == 0,
	-6 + X23 == 0,
	-5 + X22 == 0,
	-5 + X21 == 0,
	n1_0 -X20 == 0,
	n0_0 -X19 == 0,
	-1 + X18 == 0,
	-1 + X17 == 0,
	fair_0 -X16 == 0,
	-1 + X15 == 0,
	X14 == 0,
	X13 == 0,
	X12 == 0,
	X11 == 0,
	-1 + X10 == 0,
	-1 + X9 == 0,
	-3 + X8 == 0,
	-5 + X7 == 0,
	-5 + X6 == 0,
	n1_0 -X5 == 0,
	n0_0 -X4 == 0,
	X3 == 0,
	X2 == 0,
	fair_0 -X1 == 0,
	-1 + X0 == 0,
	y_0 == 0,
	x_0 == 0,
	-1 + executed_Drive_0 == 0,
	-1 + n0_0 >= 0,
	-1 + n1_0 >= 0
}
method 1