> Different LLMs executions take different branches, but eventually the possible branches based on the code possible states are saturated

With LLMs even the halting problem is just the question of paying for pro subscription!

The proof of halting being unsolvable usually uses a specific "adverserial" machine. In practice it's incredibly likely for the halt question to be answerable for any specific real life program.