Yes, unfortunately. And not much other than I suppose it just seems unintuitive to me that the halting problem is solvable for "most" programs.

The real challenge would be to show that "interesting" programs (i.e. that generate some sort of real world data) are solvable. There have been similar efforts in the field of complexity theory that aim to show certain NP-hard problems are tractable in the case of real world data (as opposed to a pathologically selected worst-case problem).