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 static Alternate.Tree.createNode():Alternate.Tree
                                             public static Alternate.Random.random():int
                                             public Alternate.Tree.(Alternate.Tree,Alternate.Tree):void
                                             public static Alternate.Alternate.main(java.lang.String[]):void
                                             static Alternate.Random.():void
[loop,structural,local_polyh]                public static Alternate.Alternate.alternate(Alternate.Tree,Alternate.Tree):Alternate.Tree
[loop,numerical,structural,local_polyh]      public static Alternate.Tree.createTree():Alternate.Tree
[loop,structural,local_polyh]                public static Alternate.Tree.copy(Alternate.Tree):Alternate.Tree
                                             public Alternate.Tree.():void
                                             public static Alternate.Tree.main(java.lang.String[]):void

Some calls to these methods might not terminate:
  none
There are no warnings