Thomas's conjecture on reducts of countable ultrahomogeneous structures

Let $\mathstrut M$ be a countable ultrahomogeneous structure in a finite relational language. A reduct of $\mathstrut M$ is a structure on the same domain whose relations and functions are definable in $\mathstrut M$ without parameters; two reducts are interdefinable when each is a reduct of the other. Thomas's conjecture. If $\mathstrut M$ is a countable ultrahomogeneous structure in a finite relational language, then $\mathstrut M$ has finitely many reducts up to interdefinability. The conjecture concerns the classification of reducts of ultrahomogeneous structures; the supplied text gives no resolution status.