Relativized world where $LogCFL^A=PSPACE^A$
Maybe it is easier to look at the problem from the other side: ... the German wikipedia article on NP claims that $LogCFL\neq PSPACE$ would be known, ...


It is know: $CFL \subset DSPACE(O(\log^2 n))$ was shown in [ 1 ] and "generalized" in [ 2 ] (whatever that means, I don't have full text access to those articles). This algorithm takes superpolynomial time, i.e. it is different from the CYK algorithm taught in Hopcroft and Ullman (and not even mentioned there, despite contrary claims). It directly follows that $LogCFL\subset DSPACE(O(\log^2 n))$ and hence $LogCFL \neq PSPACE$.


  But if this should be known indeed, then I wonder whether it also applies to $AC^1$, ...


The English wikipedia article on complexity classes claims that $NC\neq PSPACE$ would be known. Since $AC^1\subset NC$, this would mean that it also applies to $AC^1$. This separation can be deduced from $NC^k\subset DSPACE(O(\log^k n))$, see for example Lemma 5.4 A circuit of depth $D$ can be simulated in $O(D)$ space or slides 25-28 of this ppt. So it is well known indeed.


  But does this resolve the initial question whether there is a relativization barrier?


Who cares!



1
Lewis, P.M. II, R. E. Stearns, and J. Hartmanis. "Memory Bounds for the Recognition of Context-Free and Context Sensitive Languages." IEEE Conference Record on 1965 Symposium on Switching Circuit Theory and Logical Design.

2
Stephen A. Cook, Path systems and language recognition, Proceedings of the second annual ACM symposium on Theory of computing, p.70-72, May 04-06, 1970, Northampton, Massachusetts, United States