$x \in \mathbb C^n$ is called eigenvector of the pair $(A,B)$ with eigenvalue $\lambda$ for two symmetric matrices $A,B \in \mathbb R^{n,n}$ if it holds $Ax = \lambda B x$.
What's the strategy behind finding two symmetric matrices $A,B \in \mathbb R^{n,n}$ such that the pair $(A,B)$ doesn't have any real eigenvalues or eigenvectors?
Projection matrices seem to be the natural place to start with this condition. They are symmetric, and it is easy to consider matrices where the condition of no real eigenvalues are satisfied.
Let $S$ be any subspace of $\mathbb{R}^n$. Let $A$ be a projection matrix with range $S$ and let $B$ be a projection matrix for $S^\perp$. Then the ranges of $A$ and $B$ have trivial intersection, so there the pair will not have any real eigenvalues. The only possibility to check is $\lambda=0$. If $Ax=0$, then $Bx \neq 0$ if $x \neq 0$ since $x$ would be by necessity in $S^\perp$.
For example, let $n=3$. Let $S$ be spanned by $\langle 1,0,0 \rangle$ and $\langle 1,0,0 \rangle$. Then $S^\perp$ is spanned by $\langle 0,0,1 \rangle$. The corresponding projection matrices are $$ A =\begin{pmatrix} 1 & 0 & 0\\ 0 & 1 & 0 \\ 0 & 0 & 0 \end{pmatrix}$$ and $$ B =\begin{pmatrix} 0 & 0 & 0\\ 0 & 0 & 0 \\ 0 & 0 & 1 \end{pmatrix}$$ It is easy to see that the only way $Ax=\lambda Bx$ is if $x$ is the zero vector. This works because $S$ and $S^\perp$ have trivial intersections, and so no nonzero vector gets mapped to the same direction by both $A$ and $B$.