log.debug("Change notification failed for: " + handle.getDirectoryPath(), e);
                        incrementFailureCount(handle);
                        // Exponential backoff with max 8 seconds delay (up to MAX_RETRY_DELAY)
                        try {
                            long retryDelay = Math.min(MAX_RETRY_DELAY,

        assertEquals(1.0, noRetryPolicy.getBackoffMultiplier());
        assertFalse(noRetryPolicy.isExponentialBackoff());
    }

    @Test
    @DisplayName("Should limit retry delay to maximum")
    void testMaxDelayLimit() {
        // Given
        SmbOperationException.RetryPolicy policy = new SmbOperationException.RetryPolicy(10, 1000, 5000, 2.0, true);

        requestBody.put("depth", 0);
        requestBody.put("max_access_count", 1L); // Already minimal
        requestBody.put("num_of_thread", 1);
        requestBody.put("interval_time", 0); // No delay between requests
        requestBody.put("boost", 100);
        requestBody.put("available", true);
        requestBody.put("sort_order", 0);
        createWebConfig(requestBody);
    }

    /**

		if m[err.Error()] > 2 {
			peersLogAlwaysIf(ctx, fmt.Errorf("Following error has been printed %d times.. %w", m[err.Error()], err))
			// Reduce the count to introduce further delay in printing
			// but let it again print after the 2th attempt
			m[err.Error()]--
			m[err.Error()]--
		}
		m[err.Error()]++
	}
}()

// Cleans up tmp directory of the local disk.

	dm.refreshInterval = testDrwMutexUnlockCallTimeout
	if !dm.GetLock(t.Context(), nil, id, source, Options{Timeout: 5 * time.Minute}) {
		t.Fatal("GetLock() should be successful")
	}

	// Add delay to lock server responses to ensure that lock does not timeout
	for i := range lockServers {
		lockServers[i].setResponseDelay(5 * testDrwMutexUnlockCallTimeout)
		defer lockServers[i].setResponseDelay(0)
	}

  // TODO(cpovirk): Return ListenableScheduledFuture?
  public static <O extends @Nullable Object> ListenableFuture<O> scheduleAsync(
      AsyncCallable<O> callable, Duration delay, ScheduledExecutorService executorService) {
    return scheduleAsync(callable, toNanosSaturated(delay), NANOSECONDS, executorService);
  }

  /**
   * Schedules {@code callable} on the specified {@code executor}, returning a {@code Future}.
   *

    }

    static TestCondition createAndSignalAfter(long delay, TimeUnit unit) {
      TestCondition testCondition = create();

      ScheduledExecutorService scheduledPool = newScheduledThreadPool(1);
      // If signal() fails somehow, we should see a failed test, even without looking at the Future.
      Future<?> unused = scheduledPool.schedule(testCondition::signal, delay, unit);

      return testCondition;
    }

                                localFailures = 0; // Reset on success
                            }

                            Thread.sleep(5); // Small delay to spread out requests
                        }
                        successfulThreads.incrementAndGet();
                    } catch (Exception e) {
                        exceptionCount.incrementAndGet();

        requestBody.put("depth", 0);
        requestBody.put("max_access_count", 2L); // Minimal: 1 success + 1 failure
        requestBody.put("num_of_thread", 1);
        requestBody.put("interval_time", 0); // No delay
        requestBody.put("boost", 100);
        requestBody.put("available", true);
        requestBody.put("sort_order", 0);
        createWebConfig(requestBody);
    }

    private static void createJob() {

        Thread.sleep(200);

        long laterAge = keyManager.getKeyAge(sessionId);
        assertTrue(laterAge >= 200, "Age should increase after delay");
    }

    @Test
    public void testKeyAgeNonExistent() {
        assertEquals(-1, keyManager.getKeyAge("non-existent"), "Non-existent key should return -1 for age");
    }

    @Test