Regular Separability of One Counter Automata

The regular separability problem asks, for two given languages, if there exists a regular language including one of them but disjoint from the other. We show that regular separability problem is undecidable for one counter automata, but decidable (and PSPACE-complete) for one counter automata without zero tests (aka 1-dimensional vector addition systems with states).