Question on halting

I have a question on phrasing.

As we know, solidity is a Turing complete language.

The halting problem on a Turing machine is supposed to be undecidable.

However, a smart contract will always halt. It either completes or runs out of gas.

So, the evm is a Turing machine, runs a Turing complete language, but the halting problem is decidable.

So, is the evm a Turing machine? No? What’s the standard way to describe this sort of Turing machine that can halt?