It is easily shown that in proving compactness, we can assume the arbitrary open cover is given by a basic open cover. However, the same proof does not work when proving countable compactness. The reason is that not every open set can be written as a countable union of basic open sets.
So my question is: in proving countable compactness, is there a counterexample showing that we cannot assume the cover is by basic elements? Note that such a space cannot be second countable.
The trivial example of a discrete uncountable space is not a counterexample.
A discrete uncountable space $X$ is in fact a counterexample, even with the standard basis $\{\{x\}:x\in X\}$. Every countable open cover of basic open sets has a finite subcover... because such covers do not exist. But the space is not countably compact: consider any cover by any countably infinite partition of $X$, which has no proper subcover.
If you prefer a non-vacuous answer, consider the basis $\{X\}\cup\{\{x\}:x\in X\}$ for the same space. Then every countable open cover includes $X$, and thus includes a finite subcover.