1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
|
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE why3session PUBLIC "-//Why3//proof session v5//EN"
"https://www.why3.org/why3session.dtd">
<why3session shape_version="6">
<prover id="1" name="Alt-Ergo" version="2.2.0" timelimit="1" steplimit="0" memlimit="1000"/>
<prover id="2" name="CVC4" version="1.6" timelimit="1" steplimit="0" memlimit="1000"/>
<prover id="3" name="Z3" version="4.11.2" timelimit="1" steplimit="0" memlimit="1000"/>
<file format="whyml" proved="true">
<path name=".."/><path name=".."/><path name=".."/><path name="stdlib"/>
<path name="pqueue.mlw"/>
<theory name="Pqueue" proved="true">
<goal name="t'vc" expl="VC for t" proved="true">
<proof prover="3"><result status="valid" time="0.020000" steps="47230"/></proof>
</goal>
</theory>
<theory name="Harness" proved="true">
<goal name="PQ.Refl" proved="true">
<proof prover="2"><result status="valid" time="0.050000" steps="15332"/></proof>
</goal>
<goal name="PQ.Trans" proved="true">
<proof prover="2"><result status="valid" time="0.060000" steps="15996"/></proof>
</goal>
<goal name="PQ.Total" proved="true">
<proof prover="2"><result status="valid" time="0.030000" steps="16091"/></proof>
</goal>
<goal name="heapsort'vc" expl="VC for heapsort" proved="true">
<transf name="split_vc" proved="true" >
<goal name="heapsort'vc.0" expl="loop invariant init" proved="true">
<proof prover="2"><result status="valid" time="0.050000" steps="22339"/></proof>
</goal>
<goal name="heapsort'vc.1" expl="loop invariant init" proved="true">
<proof prover="2"><result status="valid" time="0.090000" steps="34704"/></proof>
</goal>
<goal name="heapsort'vc.2" expl="index in array bounds" proved="true">
<proof prover="2"><result status="valid" time="0.040000" steps="25945"/></proof>
</goal>
<goal name="heapsort'vc.3" expl="loop invariant preservation" proved="true">
<proof prover="2"><result status="valid" time="0.060000" steps="27077"/></proof>
</goal>
<goal name="heapsort'vc.4" expl="loop invariant preservation" proved="true">
<proof prover="1"><result status="valid" time="0.140000" steps="401"/></proof>
</goal>
<goal name="heapsort'vc.5" expl="loop invariant init" proved="true">
<proof prover="2"><result status="valid" time="0.040000" steps="25908"/></proof>
</goal>
<goal name="heapsort'vc.6" expl="loop invariant init" proved="true">
<proof prover="2"><result status="valid" time="0.060000" steps="31266"/></proof>
</goal>
<goal name="heapsort'vc.7" expl="loop invariant init" proved="true">
<proof prover="2"><result status="valid" time="0.040000" steps="26299"/></proof>
</goal>
<goal name="heapsort'vc.8" expl="loop invariant init" proved="true">
<proof prover="2"><result status="valid" time="0.110000" steps="32070"/></proof>
</goal>
<goal name="heapsort'vc.9" expl="precondition" proved="true">
<proof prover="2"><result status="valid" time="0.050000" steps="27664"/></proof>
</goal>
<goal name="heapsort'vc.10" expl="index in array bounds" proved="true">
<proof prover="2"><result status="valid" time="0.040000" steps="27804"/></proof>
</goal>
<goal name="heapsort'vc.11" expl="loop invariant preservation" proved="true">
<proof prover="1"><result status="valid" time="0.010000" steps="50"/></proof>
</goal>
<goal name="heapsort'vc.12" expl="loop invariant preservation" proved="true">
<proof prover="1"><result status="valid" time="0.030000" steps="154"/></proof>
</goal>
<goal name="heapsort'vc.13" expl="loop invariant preservation" proved="true">
<proof prover="1"><result status="valid" time="0.020000" steps="125"/></proof>
</goal>
<goal name="heapsort'vc.14" expl="loop invariant preservation" proved="true">
<proof prover="1"><result status="valid" time="0.720000" steps="1057"/></proof>
</goal>
<goal name="heapsort'vc.15" expl="postcondition" proved="true">
<proof prover="2"><result status="valid" time="0.070000" steps="30002"/></proof>
</goal>
<goal name="heapsort'vc.16" expl="postcondition" proved="true">
<proof prover="1" timelimit="10" memlimit="4000"><result status="valid" time="2.890000" steps="725"/></proof>
</goal>
<goal name="heapsort'vc.17" expl="out of loop bounds" proved="true">
<proof prover="2"><result status="valid" time="0.040000" steps="26243"/></proof>
</goal>
<goal name="heapsort'vc.18" expl="out of loop bounds" proved="true">
<proof prover="2"><result status="valid" time="0.070000" steps="32438"/></proof>
</goal>
</transf>
</goal>
</theory>
</file>
</why3session>
|
