MAYBE


Termination: (Ranking Functions Found)
------------
l5: < < - y_9_0 + z_10_0 >, < - x_8_0 + y_9_0 > >
l1: < < - tmp_11_0 - y_9_0 + z_10_0 > >
l6: < < - y_9_0 + z_10_0 > >
l7: < < -1 - y_9_0 + z_10_0 > >
l2: < < - y_9_0 + z_10_0 > >
l3: < < - y_9_0 + z_10_0 >, < - x_8_0 + y_9_0 > >
l0: < < - y_9_0 + z_10_0 > >


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