The authors show. by means of a finitary version $\square_{\lambda D}^{fin}$ of the combinatorial principle $\square_\lambda^{h*}$ of [7]. the consistency of the failure, relative to the consistency of supercompact cardinals, of the following: for all regular filters D on a cardinal A. if Mi and Ni are elementarily equivalent models of a language of size $\leq \lambda$ , then the second player has a winning strategy in the Ehrenfeucht- $Fra\uml{i}ss\acute{e}$ game of length $\lambda^{+}$ on $\pi_{i} M_{i}/D$ and $\pi_{i} N_{i}/D$ . (...) If in addition $2^{\lambda} = \labda^{+}$ and i < $\lambda$ implies | $M_{i}$ | +| $N_{i}$ | $\leq$ \lambda^{+} this means that the ultrapowers are isomorphic. This settles negatively conjecture 18 in [2]. (shrink)