The classic Fischer, Lynch, and Paterson impossibility proof 7, 12 demonstrates that any deterministic protocol for consensus in either a message-passing or shared-memory system must violate at least one of termination, validity, or agreement in some execution. But it does not provide an efficient procedure to find such a bad execution.
Aspnes et al. (Tue,) studied this question.