Checkpoint: lowest-free allocation

Allocation problems are state machines plus a search: the state is "which slots are free," and each transition scans from the start. The rubric-visible parts are the guard (full → -1), the silent invalid release, and the null owner.