MAYBE


Termination: (Ranking Functions Found)
------------
n_n_n_l9___1___1___1: < < i6_0 > >
n_n_n_l1___2___2___2: < < i6_0 > >
n_n_l1___2___2: < < i6_0 > >
n_n_l9___1___1: < < i6_0 > >
l10: < < -1 + i6_0 > >
l1: < < i6_0 > >
n_l1___2: < < i6_0 > >
l8: < < -1 + i6_0 > >
l9: < < i6_0 > >
n_l9___1: < < i6_0 > >


Connected Subgraphs where we couldn't prove Termination:
--------------------------------------------------------
SCC:
+--transitions: t3,t5
+--nodes: n_n_n_l1___2___2___2,n_n_n_l9___1___1___1