TIME: 4359


SCC: 48
=================================
Global Ranking Function: nat(1*A+ -1)

  OrderedCollection/Tree_minimum(LOrderedCollection/Node;)LOrderedCollection/Value;(A) :- OrderedCollection/Tree_minimum(LOrderedCollection/Node;)LOrderedCollection/Value;(B) [1*A+ -1*B>=1,1*B>=1]
=================================

SCC: 160
=================================
Global Ranking Function: nat(1*A)

  OrderedCollection/List_insert(LOrderedCollection/ListElement;LOrderedCollection/Value;)LOrderedCollection/ListElement;(A,B) :- OrderedCollection/List_insert(LOrderedCollection/ListElement;LOrderedCollection/Value;)LOrderedCollection/ListElement;(C,D) [1*B>= -1,1*B+1*C>=0,1*C>=0,1*A+ -1*C>=1,1*B+ -1*D=0]
=================================

SCC: 233
=================================
Global Ranking Function: nat(1*A)

  OrderedCollection/Tree_insert(LOrderedCollection/Node;LOrderedCollection/Value;)LOrderedCollection/Node;(A,B) :- OrderedCollection/Tree_insert(LOrderedCollection/Node;LOrderedCollection/Value;)LOrderedCollection/Node;(C,D) [1*B>=0,1*A+ -1*C>=1,1*C>=0,1*B+ -1*D=0]
=================================

SCC: 282
=================================
Global Ranking Function: nat(1*B+ -1*C)

  18_loop(A,B,C) :- 18_loop(D,E,F) [1*B+ -1*F>=0,1*D>=1,1*B+ -1*E=0,1*A+ -1*D=0,1*C+ -1*F= -1]
=================================