MAYBE


Termination: (Ranking Functions Found)
------------
l0: < < n_0 > >
l2: < < n_0 > >
n_l1___2: < < n_0 > >
n_l0___3: < < n_0 > >
n_l0___1: < < 0 >, < n_0 > >
l1: < < n_0 > >


Connected Subgraphs where we couldn't prove Termination:
--------------------------------------------------------
SCC:
+--transitions: t2
+--nodes: n_n_n_l0___3___2___2