The same program, ending with the test $count = V - count$, that is $2 · count = V$ (the count is at most $V$, so the subtraction is exact): a perfect matching exists exactly when twice the matching number is the number of vertices ($GraphBridge.exists_perfect_iff$).