The theorem only applies to perfectly asynchronous systems, which assume that algorithms are deterministic and have no clocks. We must introduce imperfect heuristics like timeouts in order to conclude nodes have crashed by deduction and be able to reach consensus in concrete distributed systems.
This paper is referenced in chapter 9 (Consistency and Consensus) of "Designing Data-Intensive Applications" by Martin Kleppmann.