Neumann-Lara's conjecture on NL-2-coflows of planar digraphs

A loopless planar digraph is a planar directed graph with no loops. An NL-$2$-coflow is a coflow whose associated pair satisfies the NL-coflow condition; equivalently, by the preceding characterization, its support contains a feedback arc set.

Neumann-Lara's conjecture. Every loopless planar digraph admits an NL-$2$-coflow.

Via planar duality, NL-coflows correspond to NL-flows in the dual digraph. The conjecture is the coflow formulation of Neumann-Lara's conjecture concerning acyclic vertex colorings of planar digraphs; the supplied text gives no resolution status.