Meaning of the annotations for the proof of each method:
- loop: the method seems to be part of a loop or recursion
- 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
  * numerical: the ranking function uses numerical variables or fields
  * structural: the ranking function uses reference variables or fields

All calls to these methods terminate:
[loop,numerical,structural,local_bds]        Partie.jouer(int,Sequence):boolean
                                             Sequence.imprimer():void
                                             Domino.(int,int):void
                                             static Partie.():void
                                             Sequence.(Domino):void
[loop,numerical,structural,local_bds]        Partie.plusForteMain():int
                                             Domino.retourne():void
[loop,structural,local_bds]                  Partie.mettreMeilleurDevant(Liste,Sequence):Liste
[loop,structural,local_bds]                  static Partie.lister(Liste):void
                                             Partie.valeurDomino(Domino):int
[loop,structural,local_bds]                  Sequence.valeurDroite():int
[loop,numerical,structural,local_bds]        Partie.imprimeGagnants():void
[loop,numerical,structural,local_bds]        static Partie.nieme(Liste,int):Domino
                                             Partie.piocher():Domino
                                             Partie.imprimeMain(int):void
                                             Sequence.ajouterAGauche(Domino):void
                                             Partie.premierCoup(int):Sequence
[loop,numerical,structural,local_bds]        public Partie.(int):void
                                             public static Partie.main(java.lang.String[]):void
                                             static Partie.jouable(Domino,Sequence):boolean
[loop,structural,local_bds]                  static Partie.longueur(Liste):int
[loop,numerical,structural,local_sct]        Partie.creerPioche():void
[loop,numerical,structural,local_bds]        Partie.valeurMain(int):int
[loop,structural,local_bds]                  static Partie.supprimer(Liste,Domino):Liste
[loop,numerical,structural,local_bds]        Partie.creerMain(int,int):void
[loop,structural,local_bds]                  Sequence.ajouterADroite(Domino):void
                                             public Domino.equals(java.lang.Object):boolean
                                             Sequence.valeurGauche():int
                                             Liste.(Domino,Liste):void
                                             Partie.entierAuHasard(int):int

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

Nothing is known about these methods:
  none

There are no warnings