[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 737 from proof hasSharing-put-index-refval (previous step)

i ' ' + sks3 ≠ [], st[r0 -- _type] .type = mkarraytype(ty), st[r -- sks] = refval(r1), st[r -- sks1] = refval(r0), (st[r0 -- i ', refval(r2)][r2 -- (sks0 + i ' ' + sks3)]) = refval(r1), st[r2 -- sks0] = refval(r0), (st[r0 -- i ', refval(r2)][r2 -- sks0]) = refval(r3), 0 < st[r0 -- _length] .intval, 0 ≤ i, i < st[r0 -- _length] .intval, validref(str, r2, ty, st), disjoint(str, r ' + r2 ', st), fits(r, sks, st), fits(r, sks1, st), fits(r2, sks0, st), r3 ≠ jvmref ∧ is_referencevalue(st[r0 -- i ', refval(r2)][r3 -- (i ' ' + sks3) .first]) ∧ ( is_classtype((st[r0 -- i ', refval(r2)][r3 -- _type]) .type) → (i ' ' + sks3) .first ∈ instfields((st[r0 -- i ', refval(r2)][r3 -- _type]) .type .class)) ∧ ( is_arraytype((st[r0 -- i ', refval(r2)][r3 -- _type]) .type) → is_indexkey((i ' ' + sks3) .first) ∧ 0 ≤ (i ' ' + sks3) .first .index ∧ (i ' ' + sks3) .first .index < (st[r0 -- i ', refval(r2)][r3 -- _length]) .intval) ∧ fits((st[r0 -- i ', refval(r2)][r3 -- (i ' ' + sks3) .first]) .refval, (i ' ' + sks3) .rest, st[r0 -- i ', refval(r2)]) ⊦ sks1 = [], sks1 + i ' ' + sks0 + i ' ' + sks3 = sks, sks = [], r1 = jvmref, r = r2, r0 = jvmref, r2 = jvmref, hasSharing(r, st), hasSharing(r2, st), junkref(str, r, st), ∃ sks1, sks3. sks = sks1 + i ' ' + sks3 ∧ st[r -- sks1] .refval = r0 ∧ (∀ sks2. sks2 + i ' ' ⊑ sks1 → st[r -- sks2] .refval ≠ st[r -- sks1] .refval), ∃ sks3. ¬ (sks3 + i ' ' ⊑ sks1 → st[r -- sks3] .refval ≠ r0), ∃ sks, sks3. sks1 = sks + i ' ' + sks3 ∧ st[r -- sks] .refval = r0 ∧ (∀ sks4. sks4 + i ' ' ⊑ sks → st[r -- sks4] .refval ≠ st[r -- sks] .refval), ∃ sks4. ¬ (sks4 + i ' ' ⊑ sks0 → st[r2 -- sks4] .refval ≠ r0), ∃ sks2, sks4. sks0 = sks2 + i ' ' + sks4 ∧ st[r2 -- sks2] .refval = r0 ∧ (∀ sks5. sks5 + i ' ' ⊑ sks2 → st[r2 -- sks5] .refval ≠ st[r2 -- sks2] .refval)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 736:
st[r0 -- _type] .type = mkarraytype(ty), st[r -- sks] = refval(r1), st[r -- sks1] = refval(r0), (st[r0 -- i ', refval(r2)][r2 -- (sks0 + i ' ' + sks3)]) = refval(r1), st[r2 -- sks0] = refval(r0), (st[r0 -- i ', refval(r2)][r2 -- sks0]) = refval(r3), 0 < st[r0 -- _length] .intval, 0 ≤ i, i < st[r0 -- _length] .intval, validref(str, r2, ty, st), disjoint(str, r ' + r2 ', st), fits(r, sks, st), fits(r, sks1, st), fits(r2, sks0, st), is_referencevalue(st[r0 -- i ', refval(r2)][r3 -- i ']), fits((st[r0 -- i ', refval(r2)][r3 -- i ']) .refval, sks3, st[r0 -- i ', refval(r2)]), is_arraytype(st[r3 -- _type] .type) → i < st[r3 -- _length] .intval ⊦ sks1 = [], sks1 + i ' ' + sks0 + i ' ' + sks3 = sks, sks = [], r1 = jvmref, r = r2, r0 = jvmref, r2 = jvmref, r3 = jvmref, hasSharing(r, st), hasSharing(r2, st), junkref(str, r, st), is_classtype(st[r3 -- _type] .type), ∃ sks1, sks3. sks = sks1 + i ' ' + sks3 ∧ st[r -- sks1] .refval = r0 ∧ (∀ sks2. sks2 + i ' ' ⊑ sks1 → st[r -- sks2] .refval ≠ st[r -- sks1] .refval), ∃ sks3. ¬ (sks3 + i ' ' ⊑ sks1 → st[r -- sks3] .refval ≠ r0), ∃ sks, sks3. sks1 = sks + i ' ' + sks3 ∧ st[r -- sks] .refval = r0 ∧ (∀ sks4. sks4 + i ' ' ⊑ sks → st[r -- sks4] .refval ≠ st[r -- sks] .refval), ∃ sks4. ¬ (sks4 + i ' ' ⊑ sks0 → st[r2 -- sks4] .refval ≠ r0), ∃ sks2, sks4. sks0 = sks2 + i ' ' + sks4 ∧ st[r2 -- sks2] .refval = r0 ∧ (∀ sks5. sks5 + i ' ' ⊑ sks2 → st[r2 -- sks5] .refval ≠ st[r2 -- sks2] .refval)

Rule argument

[emptyarg]

Additional information

[[CONCRETESIMPRULES : ([CSIMPNAMEDSEQ : javastore, , length-at, ⊦ (st[r -- i ', val] [r0 -- _length ] ) = st[r0 -- _length]], [CSIMPNAMEDSEQ : int-abs, , zero-gels-04, ⊦ i ≤ 0 ∧ 0 ≤ j → i ≤ j], [CSIMPNAMEDSEQ : storekey, , sel-06, ⊦ i ' .index = i], [CSIMPNAMEDSEQ : storekey, , test-08, ⊦ is_indexkey(i ')], [CSIMPNAMEDSEQ : addfuns, , instfields-index, ⊦ ¬ i ' ∈ instfields(class)], [CSIMPNAMEDSEQ : javastore, , type-at, ⊦ (st[r -- i ', val] [r0 -- _type ] ) = st[r0 -- _type]], [CSIMPNAMEDSEQ : list, storekeys, c-07, ⊦ (sk ' + sks) .rest = sks], [CSIMPNAMEDSEQ : list, storekeys, c-08, ⊦ (sk ' + sks) .first = sk], [CSIMPNAMEDSEQ : list, storekeys, a, ⊦ (sks + sks0) + sks1 = sks + sks0 + sks1], [CSIMPNAMEDSEQ : list, storekeys, e-01, ⊦ sk ' + sks ≠ []])]]