Decidability of locally testable model checking for countable quasiminimal subshifts

Let $X$ be a countable quasiminimal recursive subshift. The model-checking problem asks whether the language of $X$ intersects a given formal language. Locally testable decidability conjecture. The model-checking problem of $X$ for locally testable languages is decidable. The conjecture proposes a general decidability result for locally testable languages in the countable case. The surrounding text notes related decidability results for starfree languages but gives no resolution of this stronger claim.