You don't need to generate compressed/uncompressed public keys and segwit-/legacy- addresses for each iteration.
It is enough to only test the ones where the decrypted private key is a valid private key (checksum helps here).
This reduces the 9025 iterations (based on your post) to a fraction.
But.. even with 9025 iterations (if you'd have to generate compressed/uncompressed public keys and all 3 types of addresses) it would NEVER take 6-8 hours on a modern machine.
With a somewhat modern graphic card, this won't take much more than a minute.
Again, you seems not to know what you are talking about. If you study BIP 38 for a while you will know its not possible to hashcat or use john the ripper. You would also know that the bippy code out there has a bug so you would need to do both compressed/uncompressed addys in order to cover the
whole spectrum of space with possible addresses. Finally, if you know anything about passwords, you would know the iterations wont be less than 9025 out of two missing characters.