Whether the given language is a CFL or not?
The language is context-free.

The statemant of the pumping lemma claims "there exists a $uvwxy$-division", so in order to show a language non-context-free, you have to check that every possible division leads to a pumping contradiction. Your mistake is that you only checked one division.