MAYBE


Termination: (Ranking Functions Found)
------------
l6: < < 0 >, < -1 > >
l5: < < 0 >, < 0 > >
l9: < < - x_5_0 + y_6_0 >, < - x_5_0 + y_6_0 > >
l7: < < 0 >, < -1 > >
l1: < < - x_5_0 + y_6_0 >, < - x_5_0 + y_6_0 > >
n_l1___1: < < - x_5_0 + y_6_0 > >
l11: < < -1 - x_5_0 + y_6_0 > >
l8: < < 0 >, < -1 > >
l12: < < -1 - x_5_0 + y_6_0 > >
l10: < < - x_5_0 + y_6_0 > >
n_l1___4: < < - x_5_0 + y_6_0 >, < - x_5_0 + y_6_0 > >


Connected Subgraphs where we couldn't prove Termination:
--------------------------------------------------------
SCC:
+--transitions: t6
+--nodes: n_n_n_l1___3___2___2