The three strongly connected components conjecture for two-generated clone-minimal dispersive algebras

Let $\mathbb{A}$ be a clone-minimal dispersive algebra generated by two elements, and let $D_{\mathbb{A}}$ be its associated digraph. A strongly connected component is a maximal subset of vertices in which every vertex is reachable from every other by directed paths.

Three strongly connected components conjecture. The digraph $D_{\mathbb{A}}$ has at least three strongly connected components.

This is one of the paper's stated conjectures about clone-minimal dispersive algebras; the source provides no resolution.