MAYBE


Termination: (Ranking Functions Found)
------------
l3: < < 1 + x_5_0 > >
l6: < < x_5_0 > >
l5: < < x_5_0 > >
l1: < < 1 + x_5_0 > >
l4: < < 1 + x_5_0 > >


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