Turing completeness of the language is only a problem if you don't want to reject safe programs. If you're fine with false positives you can just check (using a regex!) that no \write happens. Static analysis (not using regexes) is a thing for Turing complete languages and can prove non-trivial things.
If analysis was easy you could prove (as in mathematically, e.g. with type theory and such) that the program could never get in certain insecure states.
In fact, lots of highly secure environments (NASA etc), require just such proofs from certain programming modules in order to use them.