[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 254 from proof refine-gc (previous step)

# lax = # gndx0, # ax0 = # referenced-adrs(lax.to-adr(n1), ri), gstore2[n1] = groupblock(gndx0, lax, m0), abs-log(nx0, gstore3 ↓) = abs-log(nx1, gstore2 ↓) + ax0, fs = nodes(gstore3 ↓, jro), nodes(gstore3 ↓, jro) = nodes(gstore2 ↓, jro0)[ax0, nodes(gstore2 ↓, jro0)[referenced-adrs(lax.to-adr(n1), ri)]], remove-refsize0(gstore1) = gstore1, elems nx1 ∩ jro0 = ∅, (nx0.toSet \ nx1.toSet) ∩ dom gstore2 = ∅, elems nx0 ∩ jro = ∅, dom gstore1 ∪ elems nx1 = dom gstore2 ∪ jro0, dom gstore1 ∪ elems nx0 = dom gstore3 ∪ jro, jmaxino ≠ 0, jmaxino0 ≠ 0, m0 ≠ 0, pmaxino ≠ 0, jro1.keys.inodes?, p_os.keys.inodes?, fi1.inos < pmaxino, ri.inos < jmaxino, p_os < pmaxino, jro1 < jmaxino, ri[nodes(gstore2 ↓, jro0)[referenced-adrs(lax.to-adr(n1), ri)].keys, ax0].inos < jmaxino0, jro1 < jmaxino0, inv(gstore2 \ jro0), inv(gstore1), inv(groupblock(gndx0, lax, m0)), inv(gstore3 \ jro), log-cons(abs-log(nx1, gstore2 ↓), nodes(gstore2 ↓, jro0)), new(ax0, nodes(gstore2 ↓, jro0)), refsize-cons(gstore1, range fi1), refsize-cons(gstore2, range ri), refsize-cons(gstore3, range ri[nodes(gstore2 ↓, jro0)[referenced-adrs(lax.to-adr(n1), ri)].keys, ax0]), ri-cons(ri, nodes(gstore2 ↓, jro0)), ri-inj(fi1), ri-inj(ri), ri-inj(ri[nodes(gstore2 ↓, jro0)[referenced-adrs(lax.to-adr(n1), ri)].keys, ax0]), n1 ∈ gstore3, n1 ∈ gstore2, n1 ∈ gstore1, pmaxino ≤ jmaxino, jmaxino ≤ jmaxino0, pmaxino ≤ jmaxino0, range ri ⊆ dom nodes(gstore2 ↓, jro0), fi1.lebs ⊆ dom gstore1, ri.lebs ⊆ dom gstore2, dom gstore2 ⊆ dom gstore3, ri[nodes(gstore2 ↓, jro0)[referenced-adrs(lax.to-adr(n1), ri)].keys, ax0].lebs ⊆ dom gstore3, ri.lebs ⊆ dom gstore3, ⌊err0⌋ , ¬ dups(ax0), ¬ dups(nx0), ¬ dups(nx1), ¬ dups(nodes(gstore2 ↓, jro0)[referenced-adrs(lax.to-adr(n1), ri)].keys), ¬ n1 ∈ nx0, ¬ n1 ∈ jro0, ¬ n1 ∈ nx1, jvalid0 ∧ nx0 ≠ [] → valid-journal-head(nx0, gstore3, jro), jvalid3 ∧ nx1 ≠ [] → valid-journal-head(nx1, gstore2, jro0), jvalid5 → jvalid4 ⊦ ⟨aubifs_core_gc_drop#(ri[nodes(gstore2 ↓, jro0)[referenced-adrs(lax.to-adr(n1), ri)].keys, ax0], abs-log(nx0, gstore3 ↓); fs); jvalid := ?⟩ (fs = nodes(gstore3 ↓, jro))

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 255:
# ax0 = # referenced-adrs(lax.to-adr(n1), ri0), # lax = # gndx0, gstore2[n1] = groupblock(gndx0, lax, m0), abs-log(nx0, gstore3 ↓) = abs-log(nx1, gstore2 ↓) + ax0, fs = nodes(gstore3 ↓, jro), log = abs-log(nx0, gstore3 ↓), nodes(gstore3 ↓, jro) = nodes(gstore2 ↓, jro0)[ax0, nodes(gstore2 ↓, jro0)[referenced-adrs(lax.to-adr(n1), ri0)]], remove-refsize0(gstore1) = gstore1, ri = ri0[nodes(gstore2 ↓, jro0)[referenced-adrs(lax.to-adr(n1), ri0)].keys, ax0], elems nx0 ∩ jro = ∅, (nx0.toSet \ nx1.toSet) ∩ dom gstore2 = ∅, elems nx1 ∩ jro0 = ∅, dom gstore1 ∪ elems nx0 = dom gstore3 ∪ jro, dom gstore1 ∪ elems nx1 = dom gstore2 ∪ jro0, p_os.keys.inodes?, jro1.keys.inodes?, jro1 < jmaxino0, ri0[nodes(gstore2 ↓, jro0)[referenced-adrs(lax.to-adr(n1), ri0)].keys, ax0].inos < jmaxino0, jro1 < jmaxino, p_os < pmaxino, ri0.inos < jmaxino, fi1.inos < pmaxino, inv(gstore3 \ jro), inv(groupblock(gndx0, lax, m0)), inv(gstore1), inv(gstore2 \ jro0), log-cons(abs-log(nx1, gstore2 ↓), nodes(gstore2 ↓, jro0)), new(ax0, nodes(gstore2 ↓, jro0)), refsize-cons(gstore3, range ri0[nodes(gstore2 ↓, jro0)[referenced-adrs(lax.to-adr(n1), ri0)].keys, ax0]), refsize-cons(gstore2, range ri0), refsize-cons(gstore1, range fi1), ri-cons(ri0, nodes(gstore2 ↓, jro0)), ri-inj(ri0[nodes(gstore2 ↓, jro0)[referenced-adrs(lax.to-adr(n1), ri0)].keys, ax0]), ri-inj(ri0), ri-inj(fi1), n1 ∈ gstore1, n1 ∈ gstore2, n1 ∈ gstore3, pmaxino ≤ jmaxino0, jmaxino ≤ jmaxino0, pmaxino ≤ jmaxino, ri0.lebs ⊆ dom gstore3, ri0[nodes(gstore2 ↓, jro0)[referenced-adrs(lax.to-adr(n1), ri0)].keys, ax0].lebs ⊆ dom gstore3, dom gstore2 ⊆ dom gstore3, ri0.lebs ⊆ dom gstore2, fi1.lebs ⊆ dom gstore1, range ri0 ⊆ dom nodes(gstore2 ↓, jro0), ⌊err0⌋ , jvalid5 → jvalid4, jvalid3 ∧ nx1 ≠ [] → valid-journal-head(nx1, gstore2, jro0), jvalid0 ∧ nx0 ≠ [] → valid-journal-head(nx0, gstore3, jro) ⊦ ⟨choose as with as ∩ range ri = ∅ ∧ log.toSet ∩ as = ∅ in fs := fs \ as; jvalid := ?⟩ (fs = nodes(gstore3 ↓, jro)), jmaxino = 0, jmaxino0 = 0, m0 = 0, pmaxino = 0, dups(ax0), dups(nx0), dups(nx1), dups(nodes(gstore2 ↓, jro0)[referenced-adrs(lax.to-adr(n1), ri0)].keys), n1 ∈ nx0, n1 ∈ jro0, n1 ∈ nx1

Rule argument

pos: right 1

Additional information

Used simplifier rules: aubifs_core_gc_drop#(RI, LOG; FS) {choose AS with AS ∩ range RI = ∅ ∧ LOG.toSet ∩ AS = ∅ in FS := FS \ AS };