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:
[loop,structural,local_polyh]                public static QuicksortRec.QuicksortRec.sortedHigh(QuicksortRec.List,int):QuicksortRec.List
[loop,numerical,local_polyh]                 public static QuicksortRec.QuicksortRec.createList(int):QuicksortRec.List
[loop,structural,local_polyh]                public static QuicksortRec.QuicksortRec.quicksort(QuicksortRec.List):QuicksortRec.List
                                             public static QuicksortRec.QuicksortRec.main(java.lang.String[]):void
                                             static QuicksortRec.Random.():void
[loop,local_polyh]                           public static QuicksortRec.QuicksortRec.append(QuicksortRec.List,QuicksortRec.List):QuicksortRec.List
                                             public QuicksortRec.List.(int,QuicksortRec.List):void
                                             public static QuicksortRec.Random.random():int
[loop,structural,local_polyh]                public static QuicksortRec.QuicksortRec.sortedLow(QuicksortRec.List,int):QuicksortRec.List

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