[Imprint][Data Privacy Statement][E-Mail]

View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 18 from proof inv-format (previous step)

err = ESUCCESS, m = 0, m0 = EB_PAGE_SIZE, n = # pebs, mtd-cons(pebs) ⊦ ⟪while m < n ∧ err = ESUCCESS do {/* (inv-format : invariant m ≤ n ∧ n = # pebs ∧ mtd-cons(pebs) ∧ (err = ESUCCESS → ubi-io-initial(subarray(pebs, 0, m))) ∧ (err = ESUCCESS ∨ ⌊err⌋ ) wfbound n - m) */; let isbad = ? in {mtd_asm_isbad#(m, pebs; ; isbad, err); if err = ESUCCESS ∧ ¬ isbad then let aehdr = ?, bitflips = ? in {ubi_io_read_echdr#(m, m0, pebs; aehdr; bitflips, err); let n = (err = ESUCCESS ∧ aehdr.valid? ⊃ aehdr.ec + 1;0) in {mtd_asm_erase#(m; pebs; err); if err = ESUCCESS then ubi_io_write_echdr#(m, aechdr(n), m0; pebs; err)}}}; m := m + 1}⟫ ((err = ESUCCESS → m0 = EB_PAGE_SIZE ∧ mtd-cons(pebs)) ∧ (err = ESUCCESS → ubi-io-initial(pebs)) ∧ (err = ESUCCESS ∨ ⌊err⌋ ))

Heuristic annotation applied rule annotation right

And obtained the following new goals

Proof step 19:
err = ESUCCESS, m = 0, m0 = EB_PAGE_SIZE, n = # pebs, mtd-cons(pebs) ⊦ m ≤ n ∧ n = # pebs ∧ mtd-cons(pebs) ∧ (err = ESUCCESS → ubi-io-initial(subarray(pebs, 0, m))) ∧ (err = ESUCCESS ∨ ⌊err⌋ )
Proof step 22:
err = ESUCCESS, err0 = ESUCCESS, m = m1, m0 = EB_PAGE_SIZE, m2 = 0, n = # pebs0, n = # pebs, m < n, mtd-cons(pebs0), mtd-cons(pebs), m ≤ n, err = ESUCCESS → ubi-io-initial(subarray(pebs, 0, m)), err = ESUCCESS ∨ ⌊err⌋ ⊦ ⟪let isbad = ? in {mtd_asm_isbad#(m, pebs; ; isbad, err); if err = ESUCCESS ∧ ¬ isbad then let aehdr = ?, bitflips = ? in {ubi_io_read_echdr#(m, m0, pebs; aehdr; bitflips, err); let n = (err = ESUCCESS ∧ aehdr.valid? ⊃ aehdr.ec + 1;0) in {mtd_asm_erase#(m; pebs; err); if err = ESUCCESS then ubi_io_write_echdr#(m, aechdr(n), m0; pebs; err)}}}; m := m + 1⟫ ( (m ≤ n ∧ n = # pebs ∧ mtd-cons(pebs) ∧ (err = ESUCCESS → ubi-io-initial(subarray(pebs, 0, m))) ∧ (err = ESUCCESS ∨ ⌊err⌋ )) ∧ n - m < n - m1)

Rule argument

rule: invariant right arg: bound: n - m inv: m ≤ n ∧ n = # pebs ∧ mtd-cons(pebs) ∧ (err = ESUCCESS → ubi-io-initial(subarray(pebs, 0, m))) ∧ (err = ESUCCESS ∨ ⌊err⌋ ) fmapos: right 1 pos: right 1

Additional information

Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss)% ⊦ m ≤ n → (n ≤ m ↔ m = n); (s)%# pebs = n ⊦ subarray(pebs, 0, n) = pebs; (s) Used formulas: m ≤ n ∧ n = # pebs ∧ mtd-cons(pebs) ∧ (err = ESUCCESS → ubi-io-initial(subarray(pebs, 0, m))) ∧ (err = ESUCCESS ∨ ⌊err⌋ ), n - m = n - m