-
Notifications
You must be signed in to change notification settings - Fork 1
/
example1.cpp
482 lines (415 loc) · 15.4 KB
/
example1.cpp
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
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
/* ********************************************************************** */
/* example1.c: using APRON library */
/* ********************************************************************** */
/* We illustrate here the use of the APRON interface, at level 1 */
#include "ap_global0.h"
#include "ap_global1.h"
#include "box.h"
#include "oct.h"
#include "pk.h"
#include "pkeq.h"
//#include "apron_ppl.h"
void ex1(ap_manager_t* man)
{
printf("******************************\n");
printf("ex1\n");
printf("Library %s, version %s\n",man->library,man->version);
printf("******************************\n");
ap_var_t name_of_dim[6] = {
"x","y","z","u","w","v"
};
ap_environment_t* env = ap_environment_alloc(&name_of_dim[0],3,&name_of_dim[3],3);
/* =================================================================== */
/* Creation of polyhedra
1/2x+2/3y=1, [1,2]<=z+2w<=4 */
/* =================================================================== */
/* 0. Create the array */
ap_lincons1_array_t array = ap_lincons1_array_make(env,3);
/* 1.a Creation of an equality constraint 1/2x+2/3y=1 */
ap_linexpr1_t expr = ap_linexpr1_make(env,AP_LINEXPR_SPARSE,2);
ap_lincons1_t cons = ap_lincons1_make(AP_CONS_EQ,&expr,NULL);
/* Now expr is memory-managed by cons */
/* 1.b Fill the constraint */
ap_lincons1_set_list(&cons,
AP_COEFF_S_FRAC,1,2,"x",
AP_COEFF_S_FRAC,2,3,"y",
AP_CST_S_INT,1,
AP_END);
/* 1.c Put in the array */
ap_lincons1_array_set(&array,0,&cons);
/* Now cons is memory-managed by array */
/* 2.a Creation of an inequality constraint [1,2]<=z+2w */
expr = ap_linexpr1_make(env,AP_LINEXPR_SPARSE,2);
cons = ap_lincons1_make(AP_CONS_SUPEQ,&expr,NULL);
/* The old cons is not lost, because it is stored in the array.
It would be an error to clear it (same for expr). */
/* 2.b Fill the constraint */
ap_lincons1_set_list(&cons,
AP_COEFF_S_INT,1,"z",
AP_COEFF_S_DOUBLE,2.0,"w",
AP_CST_I_INT,-2,-1,
AP_END);
/* 2.c Put in the array */
ap_lincons1_array_set(&array,1,&cons);
// /* 2.a Creation of an inequality constraint */
// expr = ap_linexpr1_make(env,AP_LINEXPR_SPARSE,2);
// cons = ap_lincons1_make(AP_CONS_SUPEQ,&expr,NULL);
// /* The old cons is not lost, because it is stored in the array.
// It would be an error to clear it (same for expr). */
// /* 2.b Fill the constraint */
// ap_lincons1_set_list(&cons,
// AP_COEFF_S_INT,1,"z",
// AP_COEFF_S_DOUBLE,2.0,"w",
// AP_CST_I_INT,-2,-1,
// AP_END);
// /* 2.c Put in the array */
// ap_lincons1_array_set(&array,1,&cons);
//
/* 3.a Creation of an inequality constraint by duplication and
modification z+2w<=4 */
cons = ap_lincons1_copy(&cons);
/* 3.b Fill the constraint (by negating the existing coefficients) */
expr = ap_lincons1_linexpr1ref(&cons);
{
ap_coeff_t* pcoeff;
ap_var_t var;
size_t i;
ap_linexpr1_ForeachLinterm1(&expr,i,var,pcoeff){
ap_coeff_neg(pcoeff,pcoeff);
}
}
ap_linexpr1_set_cst_scalar_int(&expr,4);
/* 3.c Put in the array */
ap_lincons1_array_set(&array,2,&cons);
/* 4. Creation of an abstract value */
ap_abstract1_t abs = ap_abstract1_of_lincons_array(man,env,&array);
fprintf(stdout,"Abstract value:\n");
ap_abstract1_fprint(stdout,man,&abs);
/* deallocation */
ap_lincons1_array_clear(&array);
/* =================================================================== */
/* Creation of polyhedra
x+y+z+w+u=0, 0<= w <= 5, -5<=u<=0, x+y-z-w>=0, */
/* =================================================================== */
array = ap_lincons1_array_make(env,6);
expr = ap_linexpr1_make(env,AP_LINEXPR_DENSE,0);
cons = ap_lincons1_make(AP_CONS_EQ,&expr,NULL);
ap_linexpr1_set_list(&expr,
AP_COEFF_S_INT,1,"x",
AP_COEFF_S_INT,1,"y",
AP_COEFF_S_INT,1,"z",
AP_COEFF_S_INT,1,"w",
AP_COEFF_S_INT,1,"u",
AP_END);
ap_lincons1_array_set(&array,0,&cons);
expr = ap_linexpr1_make(env,AP_LINEXPR_SPARSE,0);
cons = ap_lincons1_make(AP_CONS_SUPEQ,&expr,NULL);
ap_linexpr1_set_list(&expr, AP_COEFF_S_INT,1,"w",AP_END);
ap_lincons1_array_set(&array,1,&cons);
expr = ap_linexpr1_make(env,AP_LINEXPR_SPARSE,0);
cons = ap_lincons1_make(AP_CONS_SUPEQ,&expr,NULL);
ap_linexpr1_set_list(&expr, AP_COEFF_S_INT,-1,"w",AP_CST_S_INT,5, AP_END);
ap_lincons1_array_set(&array,2,&cons);
expr = ap_linexpr1_make(env,AP_LINEXPR_SPARSE,0);
cons = ap_lincons1_make(AP_CONS_SUPEQ,&expr,NULL);
ap_linexpr1_set_list(&expr, AP_COEFF_S_INT,1,"u",AP_CST_S_INT,5, AP_END);
ap_lincons1_array_set(&array,3,&cons);
expr = ap_linexpr1_make(env,AP_LINEXPR_SPARSE,0);
cons = ap_lincons1_make(AP_CONS_SUPEQ,&expr,NULL);
ap_linexpr1_set_list(&expr, AP_COEFF_S_INT,-1,"u",AP_END);
ap_lincons1_array_set(&array,4,&cons);
expr = ap_linexpr1_make(env,AP_LINEXPR_DENSE,0);
cons = ap_lincons1_make(AP_CONS_EQ,&expr,NULL);
ap_linexpr1_set_list(&expr,
AP_COEFF_S_INT,1,"x",
AP_COEFF_S_INT,1,"y",
AP_COEFF_S_INT,-1,"z",
AP_COEFF_S_INT,-1,"w",
AP_END);
ap_lincons1_array_set(&array,5,&cons);
ap_abstract1_t abs2 = ap_abstract1_of_lincons_array(man,env,&array);
fprintf(stdout,"Abstract value 2:\n");
ap_abstract1_fprint(stdout,man,&abs2);
ap_lincons1_array_clear(&array);
/* =================================================================== */
/* Meet and Join */
/* =================================================================== */
ap_abstract1_t res = ap_abstract1_meet(man,false,&abs,&abs2);
fprintf(stdout,"Meet:\n");
ap_abstract1_fprint(stdout,man,&res);
ap_abstract1_clear(man,&res);
res = ap_abstract1_join(man,false,&abs,&abs2);
fprintf(stdout,"Join:\n");
ap_abstract1_fprint(stdout,man,&res);
ap_abstract1_clear(man,&res);
/* =================================================================== */
/* Assignement */
/* =================================================================== */
expr = ap_linexpr1_make(env,AP_LINEXPR_SPARSE,0);
ap_linexpr1_set_list(&expr,
AP_COEFF_S_INT,-3,"w",
AP_COEFF_S_DOUBLE,2.625,"z",
AP_CST_I_INT,0,3,
AP_END);
fprintf(stdout,"Assignement (side-effect) in abstract value of u by expression:\n");
ap_linexpr1_fprint(stdout,&expr);
abs = ap_abstract1_assign_linexpr(man,true,&abs,"u",&expr,NULL);
fprintf(stdout,"\n");
ap_abstract1_fprint(stdout,man,&abs);
ap_linexpr1_clear(&expr);
/* deallocation */
ap_abstract1_clear(man,&abs);
ap_abstract1_clear(man,&abs2);
ap_environment_free(env);
}
void ex2(ap_manager_t* man)
{
printf("******************************\n");
printf("ex2\n");
printf("Library %s, version %s\n",man->library,man->version);
printf("******************************\n");
ap_var_t name_of_dim[6] = {
"x","y","z","u","w","v"
};
ap_var_t tab[2] = {
"x","y"
};
ap_environment_t* env = ap_environment_alloc(&name_of_dim[0],3,&name_of_dim[3],3);
/* =================================================================== */
/* Creation of polyhedra
-39x + 40y >= 0
-6x - 20y + 85 >= 0
x >= 0 */
/* =================================================================== */
/* 0. Create the array */
ap_lincons1_array_t array = ap_lincons1_array_make(env,3);
/* 1.a Creation of constraint -39x + 40y >= 0 */
ap_linexpr1_t expr = ap_linexpr1_make(env,AP_LINEXPR_SPARSE,2);
ap_lincons1_t cons = ap_lincons1_make(AP_CONS_SUPEQ,&expr,NULL);
/* Now expr is memory-managed by cons */
/* 1.b Fill the constraint */
ap_lincons1_set_list(&cons,
AP_COEFF_S_INT,-39,"x",
AP_COEFF_S_INT,40,"y",
AP_CST_S_INT,0,
AP_END);
/* 1.c Put in the array */
ap_lincons1_array_set(&array,0,&cons);
/* Now cons is memory-managed by array */
/* 2.a Creation of an inequality constraint -6x - 20y + 85 >= 0 */
expr = ap_linexpr1_make(env,AP_LINEXPR_SPARSE,2);
cons = ap_lincons1_make(AP_CONS_SUPEQ,&expr,NULL);
/* The old cons is not lost, because it is stored in the array.
It would be an error to clear it (same for expr). */
/* 2.b Fill the constraint */
ap_lincons1_set_list(&cons,
AP_COEFF_S_INT,-6,"x",
AP_COEFF_S_INT,-20,"y",
AP_CST_S_INT,85,
AP_END);
/* 2.c Put in the array */
ap_lincons1_array_set(&array,1,&cons);
/* 3.a Creation of an inequality constraint x >= 0 */
expr = ap_linexpr1_make(env,AP_LINEXPR_SPARSE,1);
cons = ap_lincons1_make(AP_CONS_SUPEQ,&expr,NULL);
/* The old cons is not lost, because it is stored in the array.
It would be an error to clear it (same for expr). */
/* 3.b Fill the constraint */
ap_lincons1_set_list(&cons,
AP_COEFF_S_INT,1,"x",
AP_CST_S_INT,0,
AP_END);
/* 3.c Put in the array */
ap_lincons1_array_set(&array,2,&cons);
ap_abstract1_t abs = ap_abstract1_of_lincons_array(man,env,&array);
fprintf(stdout,"Abstract value:\n");
ap_abstract1_fprint(stdout,man,&abs);
ap_abstract1_t abs2 = ap_abstract1_fold(man,false,&abs,tab,2);
fprintf(stdout,"Abstract value 2:\n");
ap_abstract1_fprint(stdout,man,&abs2);
ap_lincons1_array_clear(&array);
ap_abstract1_clear(man,&abs);
ap_abstract1_clear(man,&abs2);
ap_environment_free(env);
}
void ex3(ap_manager_t* man)
{
printf("******************************\n");
printf("ex3\n");
printf("Library %s, version %s\n",man->library,man->version);
printf("******************************\n");
ap_var_t name_of_dim[6] = {
"x","y","z","u","w","v"
};
// ap_var_t tab[2] = {
// "x","y"
// };
ap_environment_t* env = ap_environment_alloc(&name_of_dim[0],6,NULL,0);
/* =================================================================== */
/* Creation of polyhedra
-39x + 40y = 0
-3x - 10z + 43 = 0
-6x - 20y + 86 >= 0
*/
/* =================================================================== */
/* 0. Create the array */
ap_lincons1_array_t array = ap_lincons1_array_make(env,1);
/* 1.a Creation of constraint -39x + 40y = 0 */
ap_linexpr1_t expr = ap_linexpr1_make(env,AP_LINEXPR_SPARSE,2);
ap_lincons1_t cons = ap_lincons1_make(AP_CONS_EQ,&expr,NULL);
/* Now expr is memory-managed by cons */
/* 1.b Fill the constraint */
ap_lincons1_set_list(&cons,
AP_COEFF_S_INT,-39,"x",
AP_COEFF_S_INT,40,"y",
AP_CST_S_INT,0,
AP_END);
/* 1.c Put in the array */
ap_lincons1_array_set(&array,0,&cons);
/* Now cons is memory-managed by array */
ap_abstract1_t abs = ap_abstract1_of_lincons_array(man,env,&array);
fprintf(stdout,"Abstract value:\n");
ap_abstract1_fprint(stdout,man,&abs);
ap_generator1_array_t garray = ap_abstract1_to_generator_array(man,&abs);
ap_generator1_array_fprint(stdout,&garray);
ap_generator1_array_clear(&garray);
/* 2.a Creation of an equality constraint -3x - 10z + 43 = 0 */
expr = ap_linexpr1_make(env,AP_LINEXPR_SPARSE,2);
cons = ap_lincons1_make(AP_CONS_EQ,&expr,NULL);
/* The old cons is not lost, because it is stored in the array.
It would be an error to clear it (same for expr). */
/* 2.b Fill the constraint */
ap_lincons1_set_list(&cons,
AP_COEFF_S_INT,-3,"x",
AP_COEFF_S_INT,-10,"z",
AP_CST_S_INT,43,
AP_END);
/* 2.c Put in the array */
ap_lincons1_array_set(&array,0,&cons);
fprintf(stdout,"Adding constraints:\n");
ap_lincons1_array_fprint(stdout,&array);
abs = ap_abstract1_meet_lincons_array(man,true,&abs,&array);
fprintf(stdout,"Abstract value:\n");
ap_abstract1_fprint(stdout,man,&abs);
/* 3.a Creation of an inequality constraint -6x - 20y + 86 >= 0 */
expr = ap_linexpr1_make(env,AP_LINEXPR_SPARSE,2);
cons = ap_lincons1_make(AP_CONS_SUPEQ,&expr,NULL);
/* The old cons is not lost, because it is stored in the array.
It would be an error to clear it (same for expr). */
/* 2.b Fill the constraint */
ap_lincons1_set_list(&cons,
AP_COEFF_S_INT,-6,"x",
AP_COEFF_S_INT,-20,"y",
AP_CST_S_INT,86,
AP_END);
/* 2.c Put in the array */
ap_lincons1_array_set(&array,0,&cons);
fprintf(stdout,"Adding constraints:\n");
ap_lincons1_array_fprint(stdout,&array);
abs = ap_abstract1_meet_lincons_array(man,true,&abs,&array);
fprintf(stdout,"Abstract value:\n");
ap_abstract1_fprint(stdout,man,&abs);
ap_lincons1_array_clear(&array);
/* =================================================================== */
/* Creation of polyhedra
-39x + 40u = 0
u = y
v = x+z
-6v - 14z + 86 = 0
*/
/* =================================================================== */
/* 0. Create the array */
array = ap_lincons1_array_make(env,4);
expr = ap_linexpr1_make(env,AP_LINEXPR_SPARSE,2);
cons = ap_lincons1_make(AP_CONS_EQ,&expr,NULL);
ap_lincons1_set_list(&cons,
AP_COEFF_S_INT,-39,"x",
AP_COEFF_S_INT,40,"u",
AP_CST_S_INT,0,
AP_END);
ap_lincons1_array_set(&array,0,&cons);
expr = ap_linexpr1_make(env,AP_LINEXPR_SPARSE,2);
cons = ap_lincons1_make(AP_CONS_EQ,&expr,NULL);
ap_lincons1_set_list(&cons,
AP_COEFF_S_INT,-1,"u",
AP_COEFF_S_INT,1,"y",
AP_CST_S_INT,0,
AP_END);
ap_lincons1_array_set(&array,1,&cons);
expr = ap_linexpr1_make(env,AP_LINEXPR_SPARSE,2);
cons = ap_lincons1_make(AP_CONS_EQ,&expr,NULL);
ap_lincons1_set_list(&cons,
AP_COEFF_S_INT,-1,"v",
AP_COEFF_S_INT,1,"x",
AP_COEFF_S_INT,1,"y",
AP_CST_S_INT,0,
AP_END);
ap_lincons1_array_set(&array,1,&cons);
expr = ap_linexpr1_make(env,AP_LINEXPR_SPARSE,2);
cons = ap_lincons1_make(AP_CONS_EQ,&expr,NULL);
ap_lincons1_set_list(&cons,
AP_COEFF_S_INT,-1,"v",
AP_COEFF_S_INT,1,"x",
AP_COEFF_S_INT,1,"z",
AP_CST_S_INT,0,
AP_END);
ap_lincons1_array_set(&array,2,&cons);
expr = ap_linexpr1_make(env,AP_LINEXPR_SPARSE,2);
cons = ap_lincons1_make(AP_CONS_EQ,&expr,NULL);
ap_lincons1_set_list(&cons,
AP_COEFF_S_INT,-6,"v",
AP_COEFF_S_INT,-14,"z",
AP_CST_S_INT,86,
AP_END);
ap_lincons1_array_set(&array,3,&cons);
ap_abstract1_t abs2 = ap_abstract1_of_lincons_array(man,env,&array);
fprintf(stdout,"Abstract value 2:\n");
ap_abstract1_fprint(stdout,man,&abs2);
ap_lincons1_array_clear(&array);
ap_abstract1_canonicalize(man,&abs2);
fprintf(stdout,"Abstract value 2:\n");
ap_abstract1_fprint(stdout,man,&abs2);
ap_abstract1_t abs3 = ap_abstract1_join(man,false,&abs,&abs2);
fprintf(stdout,"Abstract value 3 (join of 1 and 2):\n");
ap_abstract1_fprint(stdout,man,&abs3);
ap_abstract1_t abs4 = ap_abstract1_meet(man,false,&abs,&abs2);
fprintf(stdout,"Abstract value 3 (meet of 1 and 2):\n");
ap_abstract1_fprint(stdout,man,&abs4);
ap_abstract1_clear(man,&abs);
ap_abstract1_clear(man,&abs2);
ap_abstract1_clear(man,&abs3);
ap_abstract1_clear(man,&abs4);
ap_environment_free(env);
}
int main()
{
ap_manager_t* man;
man = box_manager_alloc();
ex1(man);
ex2(man);
ap_manager_free(man);
man = oct_manager_alloc();
ex1(man);
ex2(man);
ap_manager_free(man);
man = pk_manager_alloc(true);
ex1(man);
ex2(man);
ex3(man);
ap_manager_free(man);
// man = ap_ppl_poly_manager_alloc(true);
// ex1(man);
// ex2(man);
// ex3(man);
// ap_manager_free(man);
//
man = pkeq_manager_alloc();
ex2(man);
ex3(man);
ap_manager_free(man);
// man = ap_ppl_grid_manager_alloc();
// ex2(man);
// ex3(man);
// ap_manager_free(man);
}
//