Commit ae474d09 authored by MARCHE Claude's avatar MARCHE Claude

update a few more examples

parent 14bfd09c
......@@ -18,7 +18,7 @@
<proof prover="0"><result status="valid" time="0.00" steps="1"/></proof>
</goal>
</theory>
<theory name="AVL" sum="685a6c3f9ca1d8850254333db1860c27">
<theory name="AVL" sum="fbe4c9b252772ab5f1d75809246c2f5a">
<goal name="M.M.assoc">
<proof prover="0"><result status="valid" time="0.00" steps="3"/></proof>
</goal>
......@@ -259,7 +259,7 @@
<proof prover="0"><result status="valid" time="0.26" steps="667"/></proof>
</goal>
<goal name="VC insert.11" expl="11. postcondition">
<proof prover="0"><result status="valid" time="0.51" steps="1079"/></proof>
<proof prover="0"><result status="valid" time="0.36" steps="1079"/></proof>
</goal>
<goal name="VC insert.12" expl="12. variant decrease">
<proof prover="0"><result status="valid" time="0.08" steps="282"/></proof>
......
......@@ -4,7 +4,7 @@
<why3session shape_version="4">
<prover id="0" name="Alt-Ergo" version="1.30" timelimit="1" steplimit="0" memlimit="1000"/>
<file name="../ral.mlw">
<theory name="RAL" sum="8eef46a79b8f7e645bf03e91400b9f70">
<theory name="RAL" sum="23b1953119a07d783af66468a25d4402">
<goal name="VC balancing" expl="VC for balancing">
<proof prover="0"><result status="valid" time="0.01" steps="2"/></proof>
</goal>
......
......@@ -2,11 +2,12 @@
<!DOCTYPE why3session PUBLIC "-//Why3//proof session v5//EN"
"http://why3.lri.fr/why3session.dtd">
<why3session shape_version="4">
<prover id="0" name="Z3" version="4.5.0" timelimit="1" steplimit="0" memlimit="1000"/>
<prover id="3" name="Alt-Ergo" version="1.30" timelimit="36" steplimit="0" memlimit="1000"/>
<file name="../insertion_sort.mlw" expanded="true">
<theory name="InsertionSort" sum="0ff7000b58975d960a0cfedb21e74cdc" expanded="true">
<goal name="VC insertion_sort" expl="VC for insertion_sort" expanded="true">
<transf name="split_goal_wp" expanded="true">
<theory name="InsertionSort" sum="cdd336989bf33b7c22065e15316b5bb4" expanded="true">
<goal name="VC insertion_sort" expl="VC for insertion_sort">
<transf name="split_goal_wp">
<goal name="VC insertion_sort.1" expl="1. loop invariant init">
<proof prover="3"><result status="valid" time="0.00" steps="13"/></proof>
</goal>
......@@ -17,13 +18,13 @@
<proof prover="3"><result status="valid" time="0.00" steps="7"/></proof>
</goal>
<goal name="VC insertion_sort.4" expl="4. loop invariant init">
<proof prover="3"><result status="valid" time="0.06" steps="132"/></proof>
<proof prover="3"><result status="valid" time="0.06" steps="130"/></proof>
</goal>
<goal name="VC insertion_sort.5" expl="5. loop invariant init">
<proof prover="3"><result status="valid" time="0.01" steps="19"/></proof>
<proof prover="3"><result status="valid" time="0.01" steps="28"/></proof>
</goal>
<goal name="VC insertion_sort.6" expl="6. loop invariant init">
<proof prover="3"><result status="valid" time="0.00" steps="7"/></proof>
<proof prover="3"><result status="valid" time="0.00" steps="10"/></proof>
</goal>
<goal name="VC insertion_sort.7" expl="7. index in array bounds">
<proof prover="3"><result status="valid" time="0.00" steps="12"/></proof>
......@@ -35,7 +36,7 @@
<proof prover="3"><result status="valid" time="0.01" steps="13"/></proof>
</goal>
<goal name="VC insertion_sort.10" expl="10. assertion">
<proof prover="3"><result status="valid" time="0.01" steps="37"/></proof>
<proof prover="3"><result status="valid" time="0.01" steps="36"/></proof>
</goal>
<goal name="VC insertion_sort.11" expl="11. loop variant decrease">
<proof prover="3"><result status="valid" time="0.00" steps="17"/></proof>
......@@ -44,13 +45,13 @@
<proof prover="3"><result status="valid" time="0.00" steps="17"/></proof>
</goal>
<goal name="VC insertion_sort.13" expl="13. loop invariant preservation">
<proof prover="3"><result status="valid" time="0.22" steps="264"/></proof>
<proof prover="3"><result status="valid" time="0.22" steps="256"/></proof>
</goal>
<goal name="VC insertion_sort.14" expl="14. loop invariant preservation">
<proof prover="3"><result status="valid" time="0.13" steps="194"/></proof>
<proof prover="3"><result status="valid" time="0.13" steps="184"/></proof>
</goal>
<goal name="VC insertion_sort.15" expl="15. loop invariant preservation">
<proof prover="3"><result status="valid" time="0.03" steps="83"/></proof>
<proof prover="3"><result status="valid" time="0.03" steps="101"/></proof>
</goal>
<goal name="VC insertion_sort.16" expl="16. assertion">
<proof prover="3"><result status="valid" time="0.01" steps="21"/></proof>
......@@ -59,7 +60,7 @@
<proof prover="3"><result status="valid" time="0.00" steps="11"/></proof>
</goal>
<goal name="VC insertion_sort.18" expl="18. loop invariant preservation">
<proof prover="3"><result status="valid" time="0.13" steps="254"/></proof>
<proof prover="3"><result status="valid" time="0.13" steps="163"/></proof>
</goal>
<goal name="VC insertion_sort.19" expl="19. postcondition">
<proof prover="3"><result status="valid" time="0.00" steps="6"/></proof>
......@@ -69,19 +70,80 @@
</goal>
</transf>
</goal>
<goal name="VC test1" expl="VC for test1" expanded="true">
<goal name="VC test1" expl="VC for test1">
<proof prover="3"><result status="valid" time="0.00" steps="9"/></proof>
</goal>
<goal name="VC test2" expl="VC for test2" expanded="true">
<goal name="VC test2" expl="VC for test2">
<proof prover="3"><result status="valid" time="0.01" steps="31"/></proof>
</goal>
<goal name="VC bench" expl="VC for bench" expanded="true">
<goal name="VC bench" expl="VC for bench">
<proof prover="3"><result status="valid" time="0.01" steps="28"/></proof>
</goal>
</theory>
<theory name="InsertionSortGen" sum="50a9cb1ad6d5481b25700b8f407f3dc5" expanded="true">
<goal name="VC insertion_sort" expl="VC for insertion_sort" expanded="true">
<proof prover="3"><result status="valid" time="2.54" steps="3264"/></proof>
<theory name="InsertionSortGen" sum="494ddd8f911bb14871302a6165580d0d" expanded="true">
<goal name="VC insertion_sort" expl="VC for insertion_sort">
<transf name="split_goal_wp">
<goal name="VC insertion_sort.1" expl="1. loop invariant init">
<proof prover="0"><result status="valid" time="0.02"/></proof>
</goal>
<goal name="VC insertion_sort.2" expl="2. index in array bounds">
<proof prover="0"><result status="valid" time="0.02"/></proof>
</goal>
<goal name="VC insertion_sort.3" expl="3. loop invariant init">
<proof prover="0"><result status="valid" time="0.02"/></proof>
</goal>
<goal name="VC insertion_sort.4" expl="4. loop invariant init">
<proof prover="3" timelimit="1"><result status="valid" time="0.04" steps="130"/></proof>
</goal>
<goal name="VC insertion_sort.5" expl="5. loop invariant init">
<proof prover="0"><result status="valid" time="0.02"/></proof>
</goal>
<goal name="VC insertion_sort.6" expl="6. loop invariant init">
<proof prover="0"><result status="valid" time="0.02"/></proof>
</goal>
<goal name="VC insertion_sort.7" expl="7. index in array bounds">
<proof prover="0"><result status="valid" time="0.02"/></proof>
</goal>
<goal name="VC insertion_sort.8" expl="8. index in array bounds">
<proof prover="0"><result status="valid" time="0.02"/></proof>
</goal>
<goal name="VC insertion_sort.9" expl="9. index in array bounds">
<proof prover="0"><result status="valid" time="0.02"/></proof>
</goal>
<goal name="VC insertion_sort.10" expl="10. assertion">
<proof prover="0"><result status="valid" time="0.04"/></proof>
</goal>
<goal name="VC insertion_sort.11" expl="11. loop variant decrease">
<proof prover="0"><result status="valid" time="0.02"/></proof>
</goal>
<goal name="VC insertion_sort.12" expl="12. loop invariant preservation">
<proof prover="0"><result status="valid" time="0.02"/></proof>
</goal>
<goal name="VC insertion_sort.13" expl="13. loop invariant preservation">
<proof prover="3" timelimit="1"><result status="valid" time="0.12" steps="254"/></proof>
</goal>
<goal name="VC insertion_sort.14" expl="14. loop invariant preservation">
<proof prover="0"><result status="valid" time="0.03"/></proof>
</goal>
<goal name="VC insertion_sort.15" expl="15. loop invariant preservation">
<proof prover="0"><result status="valid" time="0.05"/></proof>
</goal>
<goal name="VC insertion_sort.16" expl="16. assertion">
<proof prover="3" timelimit="1"><result status="valid" time="0.01" steps="37"/></proof>
</goal>
<goal name="VC insertion_sort.17" expl="17. index in array bounds">
<proof prover="0"><result status="valid" time="0.02"/></proof>
</goal>
<goal name="VC insertion_sort.18" expl="18. loop invariant preservation">
<proof prover="0"><result status="valid" time="0.03"/></proof>
</goal>
<goal name="VC insertion_sort.19" expl="19. postcondition">
<proof prover="0"><result status="valid" time="0.02"/></proof>
</goal>
<goal name="VC insertion_sort.20" expl="20. postcondition">
<proof prover="0"><result status="valid" time="0.02"/></proof>
</goal>
</transf>
</goal>
</theory>
</file>
......
This diff is collapsed.
......@@ -2,35 +2,63 @@
<!DOCTYPE why3session PUBLIC "-//Why3//proof session v5//EN"
"http://why3.lri.fr/why3session.dtd">
<why3session shape_version="4">
<prover id="0" name="Alt-Ergo" version="0.99.1" timelimit="5" memlimit="1000"/>
<prover id="1" name="CVC4" version="1.4" timelimit="1" steplimit="0" memlimit="1000"/>
<prover id="2" name="Alt-Ergo" version="1.30" timelimit="5" steplimit="0" memlimit="1000"/>
<file name="../power.mlw" expanded="true">
<theory name="FastExponentiation" sum="59458d7b652c546b94dcf3b8b47284f0" expanded="true">
<theory name="FastExponentiation" sum="5d1f8538bcba3ee0dc589aff289e6694" expanded="true">
<goal name="VC fast_exp" expl="VC for fast_exp" expanded="true">
<transf name="split_goal_wp" expanded="true">
<goal name="VC fast_exp.1" expl="1. variant decrease">
<proof prover="0"><result status="valid" time="0.03" steps="7"/></proof>
<goal name="VC fast_exp.1" expl="1. precondition">
<proof prover="2"><result status="valid" time="0.00" steps="3"/></proof>
</goal>
<goal name="VC fast_exp.2" expl="2. precondition">
<proof prover="0"><result status="valid" time="0.02" steps="5"/></proof>
<goal name="VC fast_exp.2" expl="2. variant decrease">
<proof prover="2"><result status="valid" time="0.01" steps="7"/></proof>
</goal>
<goal name="VC fast_exp.3" expl="3. postcondition">
<proof prover="0"><result status="valid" time="0.96" steps="33"/></proof>
<goal name="VC fast_exp.3" expl="3. precondition">
<proof prover="2"><result status="valid" time="0.00" steps="6"/></proof>
</goal>
<goal name="VC fast_exp.4" expl="4. precondition">
<proof prover="2"><result status="valid" time="0.00" steps="3"/></proof>
</goal>
<goal name="VC fast_exp.5" expl="5. postcondition">
<proof prover="2"><result status="valid" time="0.42" steps="47"/></proof>
</goal>
</transf>
</goal>
<goal name="VC fast_exp_imperative" expl="VC for fast_exp_imperative" expanded="true">
<transf name="split_goal_wp" expanded="true">
<goal name="VC fast_exp_imperative.1" expl="1. loop invariant init">
<proof prover="0"><result status="valid" time="0.00" steps="1"/></proof>
<proof prover="2"><result status="valid" time="0.00" steps="2"/></proof>
</goal>
<goal name="VC fast_exp_imperative.2" expl="2. precondition">
<proof prover="2"><result status="valid" time="0.00" steps="5"/></proof>
</goal>
<goal name="VC fast_exp_imperative.3" expl="3. precondition">
<proof prover="2"><result status="valid" time="0.00" steps="8"/></proof>
</goal>
<goal name="VC fast_exp_imperative.4" expl="4. assertion">
<proof prover="1"><result status="valid" time="0.01"/></proof>
</goal>
<goal name="VC fast_exp_imperative.5" expl="5. loop variant decrease">
<proof prover="2"><result status="valid" time="0.54" steps="11"/></proof>
</goal>
<goal name="VC fast_exp_imperative.6" expl="6. loop invariant preservation">
<proof prover="2"><result status="valid" time="1.12" steps="32"/></proof>
</goal>
<goal name="VC fast_exp_imperative.7" expl="7. precondition">
<proof prover="2"><result status="valid" time="0.00" steps="7"/></proof>
</goal>
<goal name="VC fast_exp_imperative.8" expl="8. assertion">
<proof prover="1"><result status="valid" time="0.01"/></proof>
</goal>
<goal name="VC fast_exp_imperative.2" expl="2. loop invariant preservation">
<proof prover="0"><result status="valid" time="3.31" steps="72"/></proof>
<goal name="VC fast_exp_imperative.9" expl="9. loop variant decrease">
<proof prover="2"><result status="valid" time="0.29" steps="22"/></proof>
</goal>
<goal name="VC fast_exp_imperative.3" expl="3. loop variant decrease">
<proof prover="0"><result status="valid" time="0.17" steps="21"/></proof>
<goal name="VC fast_exp_imperative.10" expl="10. loop invariant preservation">
<proof prover="2"><result status="valid" time="0.25" steps="36"/></proof>
</goal>
<goal name="VC fast_exp_imperative.4" expl="4. postcondition">
<proof prover="0"><result status="valid" time="0.01" steps="7"/></proof>
<goal name="VC fast_exp_imperative.11" expl="11. postcondition">
<proof prover="2"><result status="valid" time="0.00" steps="6"/></proof>
</goal>
</transf>
</goal>
......
......@@ -64,6 +64,7 @@ run_dir () {
}
echo "=== Programs already ported === MUST REPLAY AND ALL GOALS PROVED ==="
echo ""
run_dir .
run_dir double_wp "-L double_wp"
echo ""
......@@ -72,6 +73,7 @@ echo "Score on ported programs : $success/$total"
echo ""
echo "=== Programs that remain to be ported ==="
echo ""
run_dir to_port
run_dir foveoos11-cm
run_dir WP_revisited
......@@ -80,24 +82,29 @@ run_dir avl "-L avl"
echo ""
echo "=== Standard Library ==="
echo ""
run_dir stdlib
echo ""
echo "=== Tests ==="
echo ""
# there's no session there...
# run_dir tests
run_dir tests-provers
echo ""
echo "=== Check Builtin translation ==="
echo ""
run_dir check-builtin
echo ""
echo "=== BTS ==="
echo ""
run_dir bts
echo ""
echo "=== Logic ==="
echo ""
run_dir logic
run_dir bitvectors "-L bitvectors"
echo ""
......
......@@ -2,13 +2,13 @@
<!DOCTYPE why3session PUBLIC "-//Why3//proof session v5//EN"
"http://why3.lri.fr/why3session.dtd">
<why3session shape_version="4">
<prover id="2" name="CVC4" version="1.4" timelimit="5" steplimit="0" memlimit="1000"/>
<prover id="2" name="CVC4" version="1.4" timelimit="1" steplimit="0" memlimit="1000"/>
<prover id="3" name="Alt-Ergo" version="1.30" timelimit="5" steplimit="0" memlimit="1000"/>
<prover id="4" name="Coq" version="8.6" timelimit="5" steplimit="0" memlimit="1000"/>
<file name="../there_and_back_again.mlw" expanded="true">
<theory name="Convolution" sum="ec40727b08fc6f1a7c42bee1cc3bd30f">
<goal name="VC convolution_rec" expl="VC for convolution_rec">
<transf name="split_goal_wp">
<theory name="Convolution" sum="7aaf8d9d20c73a42a0052eaff3677d36" expanded="true">
<goal name="VC convolution_rec" expl="VC for convolution_rec" expanded="true">
<transf name="split_goal_wp" expanded="true">
<goal name="VC convolution_rec.1" expl="1. variant decrease">
<proof prover="3"><result status="valid" time="0.01" steps="22"/></proof>
</goal>
......@@ -19,15 +19,12 @@
<proof prover="3"><result status="valid" time="0.01" steps="10"/></proof>
</goal>
<goal name="VC convolution_rec.4" expl="4. postcondition">
<proof prover="2"><result status="valid" time="0.04"/></proof>
</goal>
<goal name="VC convolution_rec.5" expl="5. postcondition">
<proof prover="3"><result status="valid" time="0.01" steps="92"/></proof>
<proof prover="2"><result status="valid" time="0.06"/></proof>
</goal>
</transf>
</goal>
<goal name="VC convolution" expl="VC for convolution">
<proof prover="3"><result status="valid" time="0.01" steps="33"/></proof>
<goal name="VC convolution" expl="VC for convolution" expanded="true">
<proof prover="3"><result status="valid" time="0.01" steps="34"/></proof>
</goal>
</theory>
<theory name="Palindrome" sum="ff7472b3e21bc3ea07e0ea91f11d7593" expanded="true">
......@@ -69,7 +66,7 @@
<goal name="VC palindrome_rec.12" expl="12. unreachable point">
<proof prover="3"><result status="valid" time="0.00" steps="11"/></proof>
</goal>
<goal name="VC palindrome_rec.13" expl="13. exceptional postcondition" expanded="true">
<goal name="VC palindrome_rec.13" expl="13. exceptional postcondition">
<proof prover="4" edited="there_and_back_again_Palindrome_VC_palindrome_rec_1.v"><result status="valid" time="0.51"/></proof>
</goal>
<goal name="VC palindrome_rec.14" expl="14. unreachable point">
......@@ -77,7 +74,7 @@
</goal>
</transf>
</goal>
<goal name="VC palindrome" expl="VC for palindrome">
<goal name="VC palindrome" expl="VC for palindrome" expanded="true">
<proof prover="3"><result status="valid" time="0.00" steps="14"/></proof>
</goal>
</theory>
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment