File: why3session.xml

package info (click to toggle)
why3 1.8.2-3
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 45,028 kB
  • sloc: xml: 185,443; ml: 111,224; ansic: 3,998; sh: 2,578; makefile: 2,568; java: 865; python: 720; javascript: 290; lisp: 205; pascal: 173
file content (162 lines) | stat: -rw-r--r-- 8,473 bytes parent folder | download | duplicates (2) 
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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
 
<?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="0" name="Alt-Ergo" version="2.4.0" timelimit="1" steplimit="0" memlimit="1000"/>
<prover id="1" name="CVC4" version="1.8" timelimit="1" steplimit="0" memlimit="1000"/>
<prover id="2" name="CVC5" version="1.0.2" timelimit="1" steplimit="0" memlimit="1000"/>
<prover id="3" name="Z3" version="4.8.10" timelimit="1" steplimit="0" memlimit="1000"/>
<file format="whyml" proved="true">
<path name=".."/><path name="search.mlw"/>
<theory name="Path" proved="true">
 <goal name="path_inversion&#39;vc" expl="VC for path_inversion" proved="true">
 <transf name="induction_pr" proved="true" >
  <goal name="path_inversion&#39;vc.0" expl="VC for path_inversion" proved="true">
  <proof prover="3"><result status="valid" time="0.032249" steps="5422"/></proof>
  </goal>
  <goal name="path_inversion&#39;vc.1" expl="VC for path_inversion" proved="true">
  <proof prover="3"><result status="valid" time="0.044416" steps="6373"/></proof>
  </goal>
  <goal name="path_inversion&#39;vc.2" expl="VC for path_inversion" proved="true">
  <proof prover="2"><result status="valid" time="0.047658" steps="4123"/></proof>
  </goal>
 </transf>
 </goal>
 <goal name="path_length&#39;vc" expl="VC for path_length" proved="true">
 <proof prover="3"><result status="valid" time="0.122809" steps="6435"/></proof>
 </goal>
 <goal name="path_first&#39;vc" expl="VC for path_first" proved="true">
 <proof prover="3"><result status="valid" time="0.038741" steps="12893"/></proof>
 </goal>
 <goal name="path_inversion_right&#39;vc" expl="VC for path_inversion_right" proved="true">
 <proof prover="3"><result status="valid" time="0.071913" steps="20300"/></proof>
 </goal>
 <goal name="path_last&#39;vc" expl="VC for path_last" proved="true">
 <proof prover="3"><result status="valid" time="0.058092" steps="66391"/></proof>
 </goal>
 <goal name="shorter_path&#39;vc" expl="VC for shorter_path" proved="true">
 <proof prover="3"><result status="valid" time="0.051951" steps="27474"/></proof>
 </goal>
</theory>
<theory name="Bfs" proved="true">
 <goal name="bfs&#39;vc" expl="VC for bfs" proved="true">
 <transf name="split_vc" proved="true" >
  <goal name="bfs&#39;vc.0" expl="loop invariant init" proved="true">
  <proof prover="3"><result status="valid" time="0.023619" steps="3311"/></proof>
  </goal>
  <goal name="bfs&#39;vc.1" expl="loop invariant init" proved="true">
  <proof prover="3"><result status="valid" time="0.046315" steps="39198"/></proof>
  </goal>
  <goal name="bfs&#39;vc.2" expl="loop invariant init" proved="true">
  <proof prover="3"><result status="valid" time="0.047521" steps="40529"/></proof>
  </goal>
  <goal name="bfs&#39;vc.3" expl="loop invariant init" proved="true">
  <proof prover="3"><result status="valid" time="0.044162" steps="40247"/></proof>
  </goal>
  <goal name="bfs&#39;vc.4" expl="loop invariant init" proved="true">
  <proof prover="3"><result status="valid" time="0.038739" steps="6301"/></proof>
  </goal>
  <goal name="bfs&#39;vc.5" expl="loop invariant init" proved="true">
  <proof prover="3"><result status="valid" time="0.020112" steps="3595"/></proof>
  </goal>
  <goal name="bfs&#39;vc.6" expl="loop invariant init" proved="true">
  <proof prover="3"><result status="valid" time="0.021397" steps="3634"/></proof>
  </goal>
  <goal name="bfs&#39;vc.7" expl="postcondition" proved="true">
  <proof prover="3"><result status="valid" time="0.046254" steps="42917"/></proof>
  </goal>
  <goal name="bfs&#39;vc.8" expl="loop invariant preservation" proved="true">
  <proof prover="3"><result status="valid" time="0.060226" steps="53465"/></proof>
  </goal>
  <goal name="bfs&#39;vc.9" expl="loop invariant preservation" proved="true">
  <proof prover="3"><result status="valid" time="0.041998" steps="57925"/></proof>
  </goal>
  <goal name="bfs&#39;vc.10" expl="loop invariant preservation" proved="true">
  <proof prover="3"><result status="valid" time="0.040037" steps="53168"/></proof>
  </goal>
  <goal name="bfs&#39;vc.11" expl="loop invariant preservation" proved="true">
  <proof prover="3"><result status="valid" time="0.045103" steps="47740"/></proof>
  </goal>
  <goal name="bfs&#39;vc.12" expl="loop invariant preservation" proved="true">
  <proof prover="3"><result status="valid" time="0.043727" steps="50795"/></proof>
  </goal>
  <goal name="bfs&#39;vc.13" expl="loop invariant preservation" proved="true">
  <proof prover="3"><result status="valid" time="0.055946" steps="61833"/></proof>
  </goal>
  <goal name="bfs&#39;vc.14" expl="loop invariant preservation" proved="true">
  <proof prover="3"><result status="valid" time="0.040194" steps="50571"/></proof>
  </goal>
  <goal name="bfs&#39;vc.15" expl="out of loop bounds" proved="true">
  <proof prover="3"><result status="valid" time="0.029725" steps="47983"/></proof>
  </goal>
  <goal name="bfs&#39;vc.16" expl="postcondition" proved="true">
  <transf name="case" proved="true" arg1="(path start t n)">
   <goal name="bfs&#39;vc.16.0" expl="true case (postcondition)" proved="true">
   <transf name="assert" proved="true" arg1="(exists s. path start s p)">
    <goal name="bfs&#39;vc.16.0.0" expl="asserted formula" proved="true">
    <transf name="apply" proved="true" arg1="shorter_path" arg2="with" arg3="t,n">
     <goal name="bfs&#39;vc.16.0.0.0" expl="apply premises" proved="true">
     <proof prover="0"><result status="valid" time="0.012880" steps="12"/></proof>
     <proof prover="1"><result status="valid" time="0.091121" steps="9185"/></proof>
     <proof prover="2"><result status="valid" time="0.110920" steps="5900"/></proof>
     <proof prover="3"><result status="valid" time="0.017973" steps="3463"/></proof>
     </goal>
     <goal name="bfs&#39;vc.16.0.0.1" expl="apply premises" proved="true">
     <proof prover="0"><result status="valid" time="0.015100" steps="14"/></proof>
     <proof prover="1"><result status="valid" time="0.109160" steps="10088"/></proof>
     <proof prover="2"><result status="valid" time="0.129142" steps="6592"/></proof>
     <proof prover="3"><result status="valid" time="0.039671" steps="40889"/></proof>
     </goal>
    </transf>
    </goal>
    <goal name="bfs&#39;vc.16.0.1" expl="true case (postcondition)" proved="true">
    <proof prover="3"><result status="valid" time="0.039363" steps="44721"/></proof>
    </goal>
   </transf>
   </goal>
   <goal name="bfs&#39;vc.16.1" expl="false case (postcondition)" proved="true">
   <proof prover="3"><result status="valid" time="0.022479" steps="3469"/></proof>
   </goal>
  </transf>
  </goal>
 </transf>
 </goal>
</theory>
<theory name="Dfs" proved="true">
 <goal name="dfs&#39;vc" expl="VC for dfs" proved="true">
 <transf name="split_vc" proved="true" >
  <goal name="dfs&#39;vc.0" expl="postcondition" proved="true">
  <proof prover="3"><result status="valid" time="0.077800" steps="11261"/></proof>
  </goal>
  <goal name="dfs&#39;vc.1" expl="postcondition" proved="true">
  <proof prover="3"><result status="valid" time="0.048443" steps="10873"/></proof>
  </goal>
  <goal name="dfs&#39;vc.2" expl="loop invariant init" proved="true">
  <proof prover="3"><result status="valid" time="0.027507" steps="902"/></proof>
  </goal>
  <goal name="dfs&#39;vc.3" expl="variant decrease" proved="true">
  <proof prover="3"><result status="valid" time="0.041510" steps="4950"/></proof>
  </goal>
  <goal name="dfs&#39;vc.4" expl="precondition" proved="true">
  <proof prover="3"><result status="valid" time="0.051158" steps="10890"/></proof>
  </goal>
  <goal name="dfs&#39;vc.5" expl="postcondition" proved="true">
  <proof prover="3"><result status="valid" time="0.056966" steps="12462"/></proof>
  </goal>
  <goal name="dfs&#39;vc.6" expl="loop invariant preservation" proved="true">
  <proof prover="3"><result status="valid" time="0.017269" steps="12681"/></proof>
  </goal>
  <goal name="dfs&#39;vc.7" expl="postcondition" proved="true">
  <proof prover="3"><result status="valid" time="0.059360" steps="14616"/></proof>
  </goal>
  <goal name="dfs&#39;vc.8" expl="VC for dfs" proved="true">
  <proof prover="3"><result status="valid" time="0.052279" steps="11574"/></proof>
  </goal>
 </transf>
 </goal>
 <goal name="dfs_max&#39;vc" expl="VC for dfs_max" proved="true">
 <proof prover="3"><result status="valid" time="0.045978" steps="12293"/></proof>
 </goal>
</theory>
</file>
</why3session>