mirror of
https://github.com/AdaCore/why3.git
synced 2026-02-12 12:34:55 -08:00
224 lines
12 KiB
XML
224 lines
12 KiB
XML
<?xml version="1.0" encoding="UTF-8"?>
|
|
<!DOCTYPE why3session PUBLIC "-//Why3//proof session v5//EN"
|
|
"http://why3.lri.fr/why3session.dtd">
|
|
<why3session shape_version="6">
|
|
<prover id="0" name="Alt-Ergo" version="2.3.3" timelimit="5" steplimit="0" memlimit="1000"/>
|
|
<prover id="1" name="CVC4" version="1.8" timelimit="1" steplimit="0" memlimit="1000"/>
|
|
<prover id="2" name="Z3" version="4.11.2" timelimit="1" steplimit="0" memlimit="1000"/>
|
|
<prover id="3" name="CVC4" version="1.7" timelimit="1" steplimit="0" memlimit="1000"/>
|
|
<prover id="5" name="Alt-Ergo" version="2.3.0" timelimit="5" steplimit="0" memlimit="1000"/>
|
|
<file format="whyml" proved="true">
|
|
<path name=".."/><path name="insertion_sort.mlw"/>
|
|
<theory name="InsertionSort" proved="true">
|
|
<goal name="insertion_sort'vc" expl="VC for insertion_sort" proved="true">
|
|
<transf name="split_goal_right" proved="true" >
|
|
<goal name="insertion_sort'vc.0" expl="loop invariant init" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="42473"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.1" expl="index in array bounds" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="37788"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.2" expl="loop invariant init" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="37415"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.3" expl="loop invariant init" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.12" steps="324"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.4" expl="loop invariant init" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="42695"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.5" expl="loop invariant init" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="39035"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.6" expl="index in array bounds" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="40192"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.7" expl="index in array bounds" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="40710"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.8" expl="index in array bounds" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="40703"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.9" expl="assertion" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.02" steps="60426"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.10" expl="loop variant decrease" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.02" steps="51851"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.11" expl="loop invariant preservation" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="52630"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.12" expl="loop invariant preservation" proved="true">
|
|
<proof prover="1"><result status="valid" time="0.08" steps="17649"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.13" expl="loop invariant preservation" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.02" steps="67392"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.14" expl="loop invariant preservation" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.02" steps="62246"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.15" expl="assertion" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="44755"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.16" expl="index in array bounds" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="41095"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.17" expl="loop invariant preservation" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.02" steps="62727"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.18" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.05" steps="9832"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.19" expl="postcondition" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="37453"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.20" expl="out of loop bounds" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="37690"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="test1'vc" expl="VC for test1" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="48315"/></proof>
|
|
</goal>
|
|
<goal name="test2'vc" expl="VC for test2" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.02" steps="58561"/></proof>
|
|
</goal>
|
|
<goal name="bench'vc" expl="VC for bench" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="36943"/></proof>
|
|
</goal>
|
|
</theory>
|
|
<theory name="InsertionSortGen" proved="true">
|
|
<goal name="insertion_sort'vc" expl="VC for insertion_sort" proved="true">
|
|
<transf name="split_goal_right" proved="true" >
|
|
<goal name="insertion_sort'vc.0" expl="loop invariant init" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.05" steps="10282"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.1" expl="loop invariant init" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="38773"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.2" expl="index in array bounds" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="39092"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.3" expl="loop invariant init" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="38704"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.4" expl="loop invariant init" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.09" steps="310"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.5" expl="loop invariant init" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.01" steps="78"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.6" expl="loop invariant init" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="40219"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.7" expl="index in array bounds" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="41363"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.8" expl="index in array bounds" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="41757"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.9" expl="index in array bounds" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="41750"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.10" expl="assertion" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.02" steps="60746"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.11" expl="loop variant decrease" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.02" steps="52973"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.12" expl="loop invariant preservation" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.02" steps="53705"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.13" expl="loop invariant preservation" proved="true">
|
|
<proof prover="1"><result status="valid" time="0.07" steps="17613"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.14" expl="loop invariant preservation" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.02" steps="72132"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.15" expl="loop invariant preservation" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.02" steps="71418"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.16" expl="assertion" proved="true">
|
|
<proof prover="0" timelimit="1"><result status="valid" time="0.01" steps="67"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.17" expl="index in array bounds" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="42152"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.18" expl="loop invariant preservation" proved="true">
|
|
<proof prover="2" timelimit="5"><result status="valid" time="0.02" steps="63200"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.19" expl="loop invariant preservation" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.02" steps="53235"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.20" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.04" steps="10141"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.21" expl="postcondition" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="38728"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.22" expl="out of loop bounds" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.01" steps="38975"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
</theory>
|
|
<theory name="InsertionSortSwaps" proved="true">
|
|
<goal name="insertion_sort'vc" expl="VC for insertion_sort" proved="true">
|
|
<transf name="split_vc" proved="true" >
|
|
<goal name="insertion_sort'vc.0" expl="loop invariant init" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.05" steps="8792"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.1" expl="loop invariant init" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.05" steps="9659"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.2" expl="loop invariant init" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.02" steps="8979"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.3" expl="loop invariant init" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.03" steps="8691"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.4" expl="loop invariant init" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.04" steps="9929"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.5" expl="index in array bounds" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.04" steps="9288"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.6" expl="index in array bounds" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.04" steps="9302"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.7" expl="precondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.04" steps="9492"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.8" expl="loop variant decrease" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.03" steps="9075"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.9" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.03" steps="9565"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.10" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.06" steps="11741"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.11" expl="loop invariant preservation" proved="true">
|
|
<proof prover="5"><result status="valid" time="0.10" steps="467"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.12" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.05" steps="12623"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.13" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.03" steps="9186"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.14" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.03" steps="9828"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.15" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.02" steps="8787"/></proof>
|
|
</goal>
|
|
<goal name="insertion_sort'vc.16" expl="out of loop bounds" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.05" steps="10148"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
</theory>
|
|
</file>
|
|
</why3session>
|