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
|
/**************************************************************************/
/* */
/* The Why platform for program certification */
/* Copyright (C) 2002-2008 */
/* Romain BARDOU */
/* Jean-Franois COUCHOT */
/* Mehdi DOGGUY */
/* Jean-Christophe FILLITRE */
/* Thierry HUBERT */
/* Claude MARCH */
/* Yannick MOY */
/* Christine PAULIN */
/* Yann RGIS-GIANAS */
/* Nicolas ROUSSET */
/* Xavier URBAIN */
/* */
/* This software is free software; you can redistribute it and/or */
/* modify it under the terms of the GNU General Public */
/* License version 2, as published by the Free Software Foundation. */
/* */
/* This software is distributed in the hope that it will be useful, */
/* but WITHOUT ANY WARRANTY; without even the implied warranty of */
/* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. */
/* */
/* See the GNU General Public License version 2 for more details */
/* (enclosed in the file GPL). */
/* */
/**************************************************************************/
const int c = 5;
const int t[] = {1,2,3,4};
/*@ ensures \result == 8 */
int f (){
return c+t[2];
}
struct T {
int x;
int y;
int z[3];
};
const struct T x = {5,6,{1,2,3}};
/*@ ensures \result == 3*/
int g(){
return x.z[2];
}
struct U {
int x;
const int y;
};
struct U y = { 1, 2 };
/*@ ensures \result == 2 */
int h() { return y.y; }
struct V {
int t1[2];
int t2[1];
};
struct V w = {{1, 2},{3}};
/*@ ensures \result == 1 */
int i (){
w.t1[0] = 1;
w.t2[0] = 2;
return w.t1[0];
}
/*
const int N = 100;
int t2[N];
void j() { return t2[99]; }
*/
enum E { A,B,C };
const enum E e = B;
//@ ensures \result == B
enum E k() { return e; }
|
