Build a deadline-aware retry simulator

Your task

1. Accept nonnegative finite deadline, base, and durations; require positive integer max_attempts excluding booleans, boolean idempotent, and status ok, transient, or permanent. Raise ValueError for invalid inputs.
2. An attempt starts only strictly before the deadline. A result arriving exactly at the deadline can succeed. A duration exceeding remaining time ends at the deadline with status deadline.
3. Stop on ok or permanent. Stop on the first transient outcome with status unsafe if idempotent is false.
4. Between retryable attempts wait base * 2 ** (attempt_number - 1). If the next start would be at or after the deadline, return deadline with elapsed_time equal to the deadline.
5. When the attempt limit or supplied outcomes are exhausted after a transient result, return exhausted without an extra wait. No outcomes returns exhausted at time zero unless the deadline is zero, which returns deadline.
6. Do not sleep or call a network. This is a deterministic policy simulator; real jitter and receiver deduplication are outside its contract.

Examples