A proof for the NP-containment for the probabilistic coherence problem over events represented by formulas of the infinite-valued Łukasiewicz logic was proposed in [1]. The geometric and combinatorial argument to prove that complexity bound contains a mistake that is fixed in the present paper. Actually we present two ways to restore that imprecise claim and, by doing so, we show that the main result of that paper is indeed valid.