The way I frame this is that the Halting Problem doesn't say you cannot prove any properties of any program with static analysis. It merely says you cannot prove all properties for all programs.

This is often misunderstood. Static analysis can indeed prove many useful properties of many useful programs.

Likewise, you can eliminate many "unsafe" utterances from LLMs; you just can never eliminate all of them.