MAYBE


Termination: (Ranking Functions Found)
------------
l3: < < -2 + 3 * __const_10_0 -2 * i_0, 0 > >
l2: < < -2 + 3 * __const_10_0 -2 * i_0, 0 > >
l0: < < 3 * __const_10_0 -2 * i_0, 0 > >
l1: < < -2 + 3 * __const_10_0 -2 * i_0, 3 * __const_10_0 -3 * i_0 > >


Connected Subgraphs where we couldn't prove Termination:
--------------------------------------------------------
SCC:
+--transitions: t4,t6
+--nodes: n_n_n_l2___2___2___2,n_n_n_l3___1___1___1