// Path: src/main/java/org/avmframework/localsearch/IntegerFibonacciNumbers.java
// static int fibonacci(int position) {
//   if (position < 0 || position >= maxPosition()) {
//     throw new IntegerFibonacciNumberException(
//         "Cannot return fibonacci number at position "
//             + position
//             + " in sequences. Positions range from 0 to "
//             + maxPosition());
//   }
//   return numbers.get(position);
// }
// 
// Path: src/main/java/org/avmframework/localsearch/IntegerFibonacciNumbers.java
// static int maxPosition() {
//   return numbers.size();
// }
// 
// Path: src/main/java/org/avmframework/localsearch/IntegerFibonacciNumbers.java
// static int positionOfSmallestFibonacciNumberGreaterOrEqualTo(int target) {
//   int num = -1;
//   do {
//     num++;
//   }
//   while (num < maxPosition() && fibonacci(num) < target);
//   return num;
// }


import static org.avmframework.localsearch.IntegerFibonacciNumbers.fibonacci;
import static org.avmframework.localsearch.IntegerFibonacciNumbers.maxPosition;
import static org.avmframework.localsearch.IntegerFibonacciNumbers.positionOfSmallestFibonacciNumberGreaterOrEqualTo;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertFalse;
import org.junit.Test;
package org.avmframework.localsearch;



public class TestIntegerFibonacciNumbers {

  @Test
  public void testSequence() {
// Path: src/main/java/org/avmframework/localsearch/IntegerFibonacciNumbers.java
// static int fibonacci(int position) {
//   if (position < 0 || position >= maxPosition()) {
//     throw new IntegerFibonacciNumberException(
//         "Cannot return fibonacci number at position "
//             + position
//             + " in sequences. Positions range from 0 to "
//             + maxPosition());
//   }
//   return numbers.get(position);
// }
// 
// Path: src/main/java/org/avmframework/localsearch/IntegerFibonacciNumbers.java
// static int maxPosition() {
//   return numbers.size();
// }
// 
// Path: src/main/java/org/avmframework/localsearch/IntegerFibonacciNumbers.java
// static int positionOfSmallestFibonacciNumberGreaterOrEqualTo(int target) {
//   int num = -1;
//   do {
//     num++;
//   }
//   while (num < maxPosition() && fibonacci(num) < target);
//   return num;
// }


// Path: src/test/java/org/avmframework/localsearch/TestIntegerFibonacciNumbers.java
import static org.avmframework.localsearch.IntegerFibonacciNumbers.fibonacci;
import static org.avmframework.localsearch.IntegerFibonacciNumbers.maxPosition;
import static org.avmframework.localsearch.IntegerFibonacciNumbers.positionOfSmallestFibonacciNumberGreaterOrEqualTo;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertFalse;
import org.junit.Test;

package org.avmframework.localsearch;



public class TestIntegerFibonacciNumbers {

  @Test
  public void testSequence() {
    for (int i = 2; i < maxPosition(); i++) {