MAYBE


Termination: (Ranking Functions Found)
------------
l0: < < 1 - x_5_0 + y_6_0 > >
l3: < < 1 - x_5_0 + y_6_0 > >
l2: < < 1 - x_5_0 + y_6_0 > >
l5: < < - x_5_0 + y_6_0 > >
l4: < < - x_5_0 + y_6_0 > >


Connected Subgraphs where we couldn't prove Termination:
--------------------------------------------------------
SCC:
+--transitions: t3
+--nodes: n_n_n_l0___3___4___4