MAYBE


Termination: (Ranking Functions Found)
------------
n_l2___3: < < x_0 > >
n_l1___5: < < x_0 > >
l1: < < x_0 > >
n_n_l1___4___2: < < x_0 > >
n_n_l1___5___3: < < y_0 > >
n_l0___2: < < x_0 > >
n_n_n_l1___4___2___2: < < x_0 > >
n_l0___1: < < x_0 > >
n_n_l2___3___1: < < x_0 > >
n_n_n_l1___5___3___3: < < y_0 > >
l2: < < x_0 > >
n_l1___4: < < x_0 > >
n_n_n_l2___3___1___1: < < x_0 > >
l0: < < x_0 > >
l3: < < x_0 > >


Connected Subgraphs where we couldn't prove Termination:
--------------------------------------------------------
SCC:
+--transitions: t1,t2,t3,t5
+--nodes: n_n_n_l1___4___2___2,n_n_n_l1___5___3___3,n_n_n_l2___3___1___1