@Test
public void checkRandomSymbols() {

  final int[] input = new int[scaledRandomIntBetween(1, 25000)];
  for (int i = 0; i < input.length; i++) {
    input[i] = randomIntBetween(0, 100);
  }
  input[input.length - 1] = Integer.MAX_VALUE;
  final SuffixTree stree =
      SuffixTreeBuilder.from(
              new Sequence() {
                public int objectAt(int i) {
                  return input[i];
                }
                public int size() {
                  return input.length;
                }
              })
          .build();
  for (int i = 0; i < Math.min(5000, input.length); i++) {
    stree.containsSuffix(new IntegerSequence(input, i, input.length - i));
  }
}