Meaning of the annotations for the proof of each method:
- loop: the method seems to be part of a loop or recursion
- inherits: the method seems to call a method that possibly diverges
- may_diverge: proved the existence of at least a diverging execution
- local_polyh: proved to terminate by using a local linear ranking function for the binary unfolding with polyhedra
- local_bds: proved to terminate by using local linear ranking functions for the binary unfolding with bounded difference shapes
- local_sct: proved to terminate via the size change termination principle with monotonicity constraints
- global_lex_aff_rnkfn: proved to terminate by using a global lexicographic affine ranking function
- finite_unfoldings: proved to terminate since there is a finite number of undoldings
  * numerical: the ranking function uses numerical variables or fields
  * structural: the ranking function uses reference variables or fields

These methods do not introduce divergence:
                                             Random.random():int
                                             Random.():void
                                             DuplicateTreePath.main(java.lang.String[]):void
                                             Tree.(Tree,Tree):void
                                             Tree.():void
                                             Tree.main(java.lang.String[]):void
[loop,numerical,structural,local_bds]        Tree.createTree():Tree
[loop,numerical,structural,local_bds]        DuplicateTreePath.duplicateRandomPath(Tree):void
                                             Tree.createNode():Tree

There is at least a diverging computation for these methods:
  none

Nothing is known about these methods:
  none

Methods that might introduce divergence: 0/9 (  0.00%)
Methods that do might introduce or inherit divergence: 0/9 (  0.00%)
Methods that definitely terminate: 9/9 (100.00%)

There are no warnings