File: modulo.res.oracle

package info (click to toggle)
frama-c 20161101%2Bsilicon%2Bdfsg-5
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 42,324 kB
  • ctags: 35,695
  • sloc: ml: 200,142; ansic: 31,465; makefile: 2,334; sh: 1,643; lisp: 259; python: 85; asm: 26
file content (289 lines) | stat: -rw-r--r-- 9,737 bytes parent folder | download
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
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
[kernel] Parsing share/libc/__fc_builtin_for_normalization.i (no preprocessing)
[kernel] Parsing tests/value/modulo.i (no preprocessing)
[value] Analyzing a complete application starting at main
[value] Computing initial state
[value] Initial state computed
[value:initial-state] Values of globals at initialization
  A ∈ {0}
  B ∈ {0}
  C ∈ {0}
  D ∈ {0}
  E ∈ {0}
  F ∈ {0}
  G ∈ {0}
  H ∈ {0}
  I ∈ {0}
  J ∈ {0}
  K ∈ {0}
  L ∈ {0}
  M ∈ {0}
  N ∈ {0}
  O ∈ {0}
  P ∈ {0}
  Q ∈ {0}
  R ∈ {0}
  v ∈ [--..--]
  a ∈ [--..--]
  b ∈ [--..--]
  i2 ∈ [--..--]
[value] computing for function pgcd1 <- main.
        Called from tests/value/modulo.i:151.
tests/value/modulo.i:34:[value] warning: function pgcd1: precondition got status unknown.
tests/value/modulo.i:37:[value] loop invariant got status valid.
tests/value/modulo.i:38:[value] loop invariant got status valid.
[value] Called Frama_C_show_each_1([1..10], [1..10], [0..9])
[value] Called Frama_C_show_each_1({0}, [1..10], {0})
[value] Called Frama_C_show_each_1([-10..-1], [1..10], [-9..0])
[value] Called Frama_C_show_each_1([1..10], [-10..-1], [0..9])
[value] Called Frama_C_show_each_1({0}, [-10..-1], {0})
[value] Called Frama_C_show_each_1([-10..-1], [-10..-1], [-9..0])
[value] Recording results for pgcd1
[value] Done for function pgcd1
[value] computing for function pgcd2 <- main.
        Called from tests/value/modulo.i:152.
tests/value/modulo.i:47:[value] warning: function pgcd2: precondition got status unknown.
tests/value/modulo.i:50:[value] loop invariant got status valid.
[value] Called Frama_C_show_each_2([-10..10], [1..10], [-9..9])
[value] Called Frama_C_show_each_2([-10..10], [-10..-1], [-9..9])
[value] Recording results for pgcd2
[value] Done for function pgcd2
[value] computing for function pgcd3 <- main.
        Called from tests/value/modulo.i:153.
tests/value/modulo.i:59:[value] warning: function pgcd3: precondition got status unknown.
tests/value/modulo.i:63:[value] warning: division by zero. assert b_0 ≢ 0;
[value] Called Frama_C_show_each_3([-10..10], [-10..10], [-9..9])
[value] Recording results for pgcd3
[value] Done for function pgcd3
[value] computing for function main2 <- main.
        Called from tests/value/modulo.i:155.
tests/value/modulo.i:9:[value] warning: signed overflow. assert -2147483648 ≤ 4 * i;
tests/value/modulo.i:9:[value] warning: signed overflow. assert 4 * i ≤ 2147483647;
tests/value/modulo.i:10:[value] warning: signed overflow. assert -2147483648 ≤ 4 * i;
tests/value/modulo.i:10:[value] warning: signed overflow. assert 4 * i ≤ 2147483647;
tests/value/modulo.i:11:[value] warning: assertion got status unknown.
tests/value/modulo.i:13:[value] warning: assertion got status unknown.
tests/value/modulo.i:27:[value] warning: division by zero. assert G ≢ 0;
tests/value/modulo.i:29:[value] warning: division by zero. assert L ≢ 0;
[value] Recording results for main2
[value] Done for function main2
[value] computing for function simultaneous_congruences <- main.
        Called from tests/value/modulo.i:156.
tests/value/modulo.i:76:[value] warning: assertion got status unknown.
tests/value/modulo.i:95:[value] entering loop for the first time
tests/value/modulo.i:82:[value] entering loop for the first time
[value] Recording results for simultaneous_congruences
[value] Done for function simultaneous_congruences
[value] computing for function shift_modulo <- main.
        Called from tests/value/modulo.i:157.
tests/value/modulo.i:100:[value] warning: assertion got status unknown.
tests/value/modulo.i:103:[value] warning: signed overflow. assert (int)((int)(i * 12) + 5) << 25 ≤ 2147483647;
tests/value/modulo.i:104:[value] warning: signed overflow. assert (int)((int)(i * 13) + 7) << 25 ≤ 2147483647;
[value] Recording results for shift_modulo
[value] Done for function shift_modulo
[value] computing for function extract_bits_modulo <- main.
        Called from tests/value/modulo.i:158.
tests/value/modulo.i:109:[value] warning: assertion got status unknown.
[value] Recording results for extract_bits_modulo
[value] Done for function extract_bits_modulo
[value] computing for function pos_rem <- main.
        Called from tests/value/modulo.i:159.
tests/value/modulo.i:137:[value] warning: assertion got status unknown.
tests/value/modulo.i:142:[value] warning: assertion got status unknown.
tests/value/modulo.i:146:[value] warning: assertion got status unknown.
[value] Recording results for pos_rem
[value] Done for function pos_rem
[value] Recording results for main
[value] done for function main
[value] ====== VALUES COMPUTED ======
[value:final-states] Values at end of function extract_bits_modulo:
  i ∈ [0..10]
  aa1 ∈ [1291..32011],1291%3072
  ptr1 ∈ {{ (unsigned char *)&aa1 }}
  m1 ∈ {11}
  n1 ∈ [5..125],1%4
  aa2 ∈ [1294..32124]
  ptr2 ∈ {{ (unsigned char *)&aa2 }}
  m2 ∈ [0..255]
  n2 ∈ [5..125]
  aa3 ∈ [1296..32126]
  ptr3 ∈ {{ (unsigned char *)&aa3 }}
  m3 ∈ [0..255]
  n3 ∈ [5..125]
  aa4 ∈ [16..126],5%11
  ptr4 ∈ {{ (unsigned char *)&aa4 }}
  m4 ∈ [16..126]
  n4 ∈ {0}
[value:final-states] Values at end of function main2:
  A ∈ {0}
  B ∈ {-3; 1}
  C ∈ {1}
  D ∈ {1; 4; 7; 10}
  E ∈ {-11; -8; -5; -2; 1; 4; 7; 10}
  F ∈ {5}
  G ∈ [0..12]
  H ∈ [0..100]
  I ∈ [101..301],1%2
  J ∈ [-201..299],4%5
  K ∈ {-6; -1; 4; 9}
  L ∈ [-9..9]
  M ∈ {-6; -2; -1; 0; 1; 2; 4; 9}
  N ∈ [-299..299]
  O ∈ [0..11]
  P ∈ {0}
  Q ∈ [-8..8]
  i ∈ [0..100]
[value:final-states] Values at end of function pgcd1:
  a_0 ∈ [-10..10]
  b_0 ∈ {0}
[value:final-states] Values at end of function pgcd2:
  a_0 ∈ [-10..10]
  b_0 ∈ {0}
[value:final-states] Values at end of function pgcd3:
  a_0 ∈ [-10..10]
  b_0 ∈ {0}
[value:final-states] Values at end of function pos_rem:
  n ∈ [-1..72]
  j ∈ [-128..127]
  k ∈ [0..135]
  l ∈ [-128..127]
[value:final-states] Values at end of function shift_modulo:
  i ∈ [0..10]
  r ∈ [20..500],20%48
  s ∈ [5..125],5%12
  q ∈ {5; 17; 29; 41; 53}
  t ∈ {7; 20; 33; 46; 59}
[value:final-states] Values at end of function simultaneous_congruences:
  n1 ∈ [98..436207493],98%195
  n2 ∈ [98..436207493],98%195
  n3 ∈ [98..436207493],98%195
  m1 ∈ [7..134217735],3%4
  m2 ∈ [10..201326602],4%6
  o1 ∈ [11..268435451],11%24
  o2 ∈ [11..268435451],11%24
  o3 ∈ [11..268435451],11%24
[value:final-states] Values at end of function main:
  A ∈ {0}
  B ∈ {-3; 1}
  C ∈ {1}
  D ∈ {1; 4; 7; 10}
  E ∈ {-11; -8; -5; -2; 1; 4; 7; 10}
  F ∈ {5}
  G ∈ [0..12]
  H ∈ [0..100]
  I ∈ [101..301],1%2
  J ∈ [-201..299],4%5
  K ∈ {-6; -1; 4; 9}
  L ∈ [-9..9]
  M ∈ {-6; -2; -1; 0; 1; 2; 4; 9}
  N ∈ [-299..299]
  O ∈ [0..11]
  P ∈ {0}
  Q ∈ [-8..8]
[from] Computing for function extract_bits_modulo
[from] Done for function extract_bits_modulo
[from] Computing for function main2
[from] Done for function main2
[from] Computing for function pgcd1
[from] Done for function pgcd1
[from] Computing for function pgcd2
[from] Done for function pgcd2
[from] Computing for function pgcd3
[from] Done for function pgcd3
[from] Computing for function pos_rem
[from] Done for function pos_rem
[from] Computing for function shift_modulo
[from] Done for function shift_modulo
[from] Computing for function simultaneous_congruences
[from] Done for function simultaneous_congruences
[from] Computing for function main
[from] Done for function main
[from] ====== DEPENDENCIES COMPUTED ======
       These dependencies hold at termination for the executions that terminate:
[from] Function extract_bits_modulo:
  NO EFFECTS
[from] Function main2:
  A FROM v
  B FROM v
  C FROM v
  D FROM v
  E FROM v
  F FROM v
  G FROM v
  H FROM v
  I FROM v
  J FROM v
  K FROM v
  L FROM v
  M FROM v
  N FROM v
  O FROM v
  P FROM v
  Q FROM v
[from] Function pgcd1:
  \result FROM x; y
[from] Function pgcd2:
  \result FROM x; y
[from] Function pgcd3:
  \result FROM x; y
[from] Function pos_rem:
  NO EFFECTS
[from] Function shift_modulo:
  NO EFFECTS
[from] Function simultaneous_congruences:
  NO EFFECTS
[from] Function main:
  A FROM v
  B FROM v
  C FROM v
  D FROM v
  E FROM v
  F FROM v
  G FROM v
  H FROM v
  I FROM v
  J FROM v
  K FROM v
  L FROM v
  M FROM v
  N FROM v
  O FROM v
  P FROM v
  Q FROM v
[from] ====== END OF DEPENDENCIES ======
[inout] Out (internal) for function extract_bits_modulo:
          i; aa1; ptr1; m1; n1; aa2; ptr2; m2; n2; aa3; ptr3; m3; n3; aa4; ptr4; 
          m4; n4
[inout] Inputs for function extract_bits_modulo:
          v
[inout] Out (internal) for function main2:
          A; B; C; D; E; F; G; H; I; J; K; L; M; N; O; P; Q; i
[inout] Inputs for function main2:
          A; D; G; I; J; K; L; v
[inout] Out (internal) for function pgcd1:
          a_0; b_0; tmp
[inout] Inputs for function pgcd1:
          \nothing
[inout] Out (internal) for function pgcd2:
          a_0; b_0; tmp
[inout] Inputs for function pgcd2:
          \nothing
[inout] Out (internal) for function pgcd3:
          a_0; b_0; tmp
[inout] Inputs for function pgcd3:
          \nothing
[inout] Out (internal) for function pos_rem:
          n; j; k; l
[inout] Inputs for function pos_rem:
          v
[inout] Out (internal) for function shift_modulo:
          i; r; s; q; t
[inout] Inputs for function shift_modulo:
          v
[inout] Out (internal) for function simultaneous_congruences:
          n1; n2; n3; m1; m2; o1; o2; o3
[inout] Inputs for function simultaneous_congruences:
          i2
[inout] Out (internal) for function main:
          A; B; C; D; E; F; G; H; I; J; K; L; M; N; O; P; Q
[inout] Inputs for function main:
          A; D; G; I; J; K; L; v; a; b; i2