```
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:
public static WorkingSignals.testAll(Signal):void
Signal.(boolean,Transition):void
public static WorkingSignals.invert(Signal):Signal
[loop,local_bds]                             public static WorkingSignals.testValues(Signal):void
[loop,local_bds]                             public static WorkingSignals.print(Signal):void
[loop,local_bds]                             public static WorkingSignals.xorTransitions(Transition,Transition):Transition
[loop,local_bds]                             public static WorkingSignals.renverser(Signal):Signal
public static WorkingSignals.shift(Signal,int):Signal
public static Random.random():int
public static WorkingSignals.xorSignals(Signal,Signal):Signal
public static WorkingSignals.main(java.lang.String[]):void
Transition.(int,Transition):void
static Random.():void
public static WorkingSignals.test(Signal):void
[loop,local_bds]                             public static WorkingSignals.shift(Transition,int):Transition

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

Nothing is known about these methods:
none

There are no warnings
```