Meaning of the annotations for the proof of each method:
- local_polyh: uses a local linear ranking function for the binary unfolding with polyhedra
- local_mono: uses a local linear ranking function for the binary unfolding with monotonicity constraints
- global_affrnkfn: uses a global affine ranking function with polyhedra
- numerical: the ranking function uses numerical variables or fields
- structural: the ranking function uses reference variables or fields
- loop: the method seems to be part of a loop or recursion
All calls to these methods terminate:
public OrderedCollection.OrderedCollection.():void
public OrderedCollection.Element.getValue():OrderedCollection.Value
[loop,structural,local_polyh] private static OrderedCollection.List.insert(OrderedCollection.ListElement,OrderedCollection.Value):OrderedCollection.ListElement
protected OrderedCollection.Element.(OrderedCollection.Value):void
public static OrderedCollection.Random.random():int
public OrderedCollection.Node.setRight(OrderedCollection.Node):void
public OrderedCollection.List.insert(OrderedCollection.Value):void
public OrderedCollection.Node.setLeft(OrderedCollection.Node):void
[loop,numerical,local_polyh] private static OrderedCollection.Main.createCollection():OrderedCollection.OrderedCollection
public OrderedCollection.Node.(OrderedCollection.Value,OrderedCollection.Node,OrderedCollection.Node):void
static OrderedCollection.Random.():void
public OrderedCollection.List.minimum():OrderedCollection.Value
public OrderedCollection.ListElement.(OrderedCollection.Value,OrderedCollection.ListElement):void
[loop,structural,local_polyh] private static OrderedCollection.Tree.minimum(OrderedCollection.Node):OrderedCollection.Value
public OrderedCollection.List.():void
public OrderedCollection.IntValue.isSmaller(OrderedCollection.Value):boolean
public OrderedCollection.Node.getRight():OrderedCollection.Node
public static OrderedCollection.Main.main(java.lang.String[]):void
public OrderedCollection.IntValue.(int):void
public OrderedCollection.Node.getLeft():OrderedCollection.Node
public OrderedCollection.Tree.insert(OrderedCollection.Value):void
[loop,structural,local_polyh] private static OrderedCollection.Tree.insert(OrderedCollection.Node,OrderedCollection.Value):OrderedCollection.Node
public OrderedCollection.Tree.():void
public OrderedCollection.Tree.minimum():OrderedCollection.Value
public OrderedCollection.ListElement.getNext():OrderedCollection.ListElement
public OrderedCollection.ListElement.setNext(OrderedCollection.ListElement):void
Some calls to these methods might not terminate:
none
There are no warnings