| wlar[m] = wl-entry(m0, erasing), apebs[n] = mkpeb(aehdr, avhdr, buf, m2, boolvar), wlar[n] = wl-entry(m4, stat), m < # wlar, n < # wlar, m < # wlar → (wlar[m].status = erroneous ↔ apebs[m].bad) ∧ (wlar[m].status = free → apebs[m].vidhdr = empty) ∧ (wlar[m].status ≠ erroneous ∧ wlar[m].status ≠ erasing → apebs[m].echdr = aechdr(wlar[m].ec)) ∧ (wlar[m].status = used → (∃ v, m0. valid-peb(v, m0, apebs[m]) ∧ apebs[m].vidhdr.sqn = valid-sqns(v, m0, apebs).max)), ∀ n. n < # wlar → (wlar[n].status = erroneous ↔ apebs[n].bad) ∧ (wlar[n].status = free → apebs[n].vidhdr = empty) ∧ (wlar[n].status ≠ erroneous ∧ wlar[n].status ≠ erasing → apebs[n].echdr = aechdr(wlar[n].ec)) ∧ (wlar[n].status = used → (∃ v, m. valid-peb(v, m, apebs[n]) ∧ apebs[n].vidhdr.sqn = valid-sqns(v, m, apebs).max)) ⊦ n = m, (stat = erroneous ↔ boolvar) ∧ (stat = free → avhdr = empty) ∧ (stat ≠ erroneous ∧ stat ≠ erasing → aehdr = aechdr(m4)) ∧ (stat = used → (∃ v, m1. valid-peb(v, m1, mkpeb(aehdr, avhdr, buf, m2, false)) ∧ avhdr.sqn = valid-sqns(v, m1, apebs).max)) |
wlar[m] = wl-entry(m0, erasing), apebs[n] = mkpeb(aehdr, avhdr, buf, m2, boolvar), wlar[n] = wl-entry(m4, stat), m < # wlar, n < # wlar, ∀ n. n < # wlar → (wlar[n].status = erroneous ↔ apebs[n].bad) ∧ (wlar[n].status = free → apebs[n].vidhdr = empty) ∧ (wlar[n].status ≠ erroneous ∧ wlar[n].status ≠ erasing → apebs[n].echdr = aechdr(wlar[n].ec)) ∧ (wlar[n].status = used → (∃ v, m. valid-peb(v, m, apebs[n]) ∧ apebs[n].vidhdr.sqn = valid-sqns(v, m, apebs).max)) ⊦ n = m, apebs[m].bad, (stat = erroneous ↔ boolvar) ∧ (stat = free → avhdr = empty) ∧ (stat ≠ erroneous ∧ stat ≠ erasing → aehdr = aechdr(m4)) ∧ (stat = used → (∃ v, m1. valid-peb(v, m1, mkpeb(aehdr, avhdr, buf, m2, false)) ∧ avhdr.sqn = valid-sqns(v, m1, apebs).max))
Used simplifier rules: ⊦ free ≠ erasing; (s)% ⊦ used ≠ erasing; (s)% ⊦ erroneous ≠ erasing; (s)% ⊦ wl-entry(m, stat).status = stat; (s)