Limit Check As Equality

A bounded counter is checked against its ceiling with an equality test against a single target value (`count == max - K`) rather than an inequality against the limit (`count >= max`). The check fires at exactly one value of the counter and at exactly one value of the target. Any deviation in the target's computation that drives it out of the counter's reachable range disables enforcement entirely; any path that steps the counter past the target without firing the check, missing decrements, concurrent increments, signed underflow on `max - 1` when `max = 0`, bypasses the check for the rest of the lifetime of the object holding the counter. The fix is the inequality the equality was substituting for.