On the Le Bars conjecture

In 2001, Le Bars proved that there is an existential second order property that has no limit probability for the uniformly chosen random graph G(n,1/2). He conjectured that two first order quantifiers are enough to construct such a sentence. We prove that the conjecture is true for G(n,p) where p equals either (3-\sqrt{5})/2 or (\sqrt{5}-1)/2.