| 1 |
; COMMAND-LINE: --finite-model-find --ieval=use-learn |
| 2 |
; EXPECT: sat |
| 3 |
; Preamble -------------- |
| 4 |
(set-logic AUFDTLIA) |
| 5 |
(set-info :status sat) |
| 6 |
(declare-datatypes ((UNIT 0)) (((Unit)))) |
| 7 |
(declare-datatypes ((BOOL 0)) (((Truth) (Falsity)))) |
| 8 |
|
| 9 |
; Decls -------------- |
| 10 |
(declare-sort node$type 0) |
| 11 |
(declare-sort value$type 0) |
| 12 |
(define-sort Nodes$elem$type () node$type) |
| 13 |
(declare-sort Nodes$t$type 0) |
| 14 |
(declare-fun Nodes$empty () Nodes$t$type) |
| 15 |
(declare-fun Nodes$mem (Nodes$elem$type Nodes$t$type) BOOL) |
| 16 |
(declare-fun Nodes$add (Nodes$elem$type Nodes$t$type) Nodes$t$type) |
| 17 |
(declare-fun Nodes$remove (Nodes$elem$type Nodes$t$type) Nodes$t$type) |
| 18 |
(declare-fun Nodes$cardinality (Nodes$t$type) Int) |
| 19 |
(declare-fun Nodes$union (Nodes$t$type Nodes$t$type) Nodes$t$type) |
| 20 |
(declare-fun Nodes$disjoint (Nodes$t$type Nodes$t$type) BOOL) |
| 21 |
;Nodes$disjoint_empty : |
| 22 |
(assert (forall ((a Nodes$t$type)) (= (Nodes$disjoint a Nodes$empty) Truth))) |
| 23 |
;Nodes$disjoint_comm : |
| 24 |
(assert (forall ((a Nodes$t$type) (b Nodes$t$type)) (= (Nodes$disjoint a b) |
| 25 |
(Nodes$disjoint b a)))) |
| 26 |
;Nodes$mem_empty : |
| 27 |
(assert (forall ((e Nodes$elem$type)) (not (= (Nodes$mem e Nodes$empty) |
| 28 |
Truth)))) |
| 29 |
;Nodes$mem_add : |
| 30 |
(assert (forall ((x Nodes$elem$type) (y Nodes$elem$type) (s Nodes$t$type)) |
| 31 |
(= (Nodes$mem x (Nodes$add y s)) (ite (or (= x y) (= (Nodes$mem x s) |
| 32 |
Truth)) Truth |
| 33 |
Falsity)))) |
| 34 |
;Nodes$mem_remove : |
| 35 |
(assert (forall ((x Nodes$elem$type) (y Nodes$elem$type) (s Nodes$t$type)) |
| 36 |
(= (Nodes$mem x (Nodes$remove y s)) (ite (and (not (= x y)) (= |
| 37 |
(Nodes$mem |
| 38 |
x s) |
| 39 |
Truth)) |
| 40 |
Truth Falsity)))) |
| 41 |
;Nodes$mem_union1 : |
| 42 |
(assert (forall ((x Nodes$elem$type) (a Nodes$t$type)) (=> (= (Nodes$mem x a) |
| 43 |
Truth) (forall |
| 44 |
((b Nodes$t$type)) |
| 45 |
(= |
| 46 |
(Nodes$mem |
| 47 |
x (Nodes$union |
| 48 |
a b)) |
| 49 |
Truth))))) |
| 50 |
;Nodes$mem_union2 : |
| 51 |
(assert (forall ((a Nodes$t$type) (b Nodes$t$type)) (= (Nodes$union a b) |
| 52 |
(Nodes$union b a)))) |
| 53 |
;Nodes$mem_union3 : |
| 54 |
(assert (forall ((x Nodes$elem$type) (a Nodes$t$type) (b Nodes$t$type)) |
| 55 |
(=> (= (Nodes$mem x (Nodes$union a b)) Truth) (or (= (Nodes$mem x a) |
| 56 |
Truth) (= (Nodes$mem |
| 57 |
x b) |
| 58 |
Truth))))) |
| 59 |
;Nodes$mem_union4 : |
| 60 |
(assert (forall ((a Nodes$t$type)) (= (Nodes$union a a) a))) |
| 61 |
;Nodes$mem_union5 : |
| 62 |
(assert (forall ((a Nodes$t$type)) (= (Nodes$union a Nodes$empty) a))) |
| 63 |
;Nodes$empty_union : |
| 64 |
(assert (forall ((a Nodes$t$type) (b Nodes$t$type)) (=> (= (Nodes$union a b) |
| 65 |
Nodes$empty) |
| 66 |
(= a Nodes$empty)))) |
| 67 |
;Nodes$card_empty : |
| 68 |
(assert (= (Nodes$cardinality Nodes$empty) 0)) |
| 69 |
;Nodes$card_zero : |
| 70 |
(assert (forall ((s Nodes$t$type)) (=> (= (Nodes$cardinality s) 0) (= |
| 71 |
s |
| 72 |
Nodes$empty)))) |
| 73 |
;Nodes$card_non_negative : |
| 74 |
(assert (forall ((s Nodes$t$type)) (>= (Nodes$cardinality s) 0))) |
| 75 |
;Nodes$card_add : |
| 76 |
(assert (forall ((x Nodes$elem$type) (s Nodes$t$type)) (= (Nodes$cardinality |
| 77 |
(Nodes$add x s)) |
| 78 |
(ite (= (Nodes$mem |
| 79 |
x s) Truth) |
| 80 |
(Nodes$cardinality |
| 81 |
s) (+ (Nodes$cardinality |
| 82 |
s) 1))))) |
| 83 |
;Nodes$card_remove : |
| 84 |
(assert (forall ((x Nodes$elem$type) (s Nodes$t$type)) (= (Nodes$cardinality |
| 85 |
(Nodes$remove x s)) |
| 86 |
(ite (= (Nodes$mem |
| 87 |
x s) Truth) (- |
| 88 |
(Nodes$cardinality |
| 89 |
s) 1) (Nodes$cardinality |
| 90 |
s))))) |
| 91 |
;Nodes$card_union : |
| 92 |
(assert (forall ((a Nodes$t$type) (b Nodes$t$type)) (=> (= (Nodes$disjoint |
| 93 |
a b) Truth) |
| 94 |
(= (Nodes$cardinality |
| 95 |
(Nodes$union a b)) (+ |
| 96 |
(Nodes$cardinality |
| 97 |
a) (Nodes$cardinality b)))))) |
| 98 |
(declare-fun Nodes$eq (Nodes$t$type Nodes$t$type) BOOL) |
| 99 |
;Nodes$eq_is_equality : |
| 100 |
(assert (forall ((a Nodes$t$type) (b Nodes$t$type)) (= (Nodes$eq a b) |
| 101 |
(ite (= a b) Truth |
| 102 |
Falsity)))) |
| 103 |
;Nodes$equal1 : |
| 104 |
(assert (forall ((a Nodes$t$type) (b Nodes$t$type)) (=> (forall ((x Nodes$elem$type)) |
| 105 |
(= (Nodes$mem x a) |
| 106 |
(Nodes$mem x b))) |
| 107 |
(= (Nodes$eq a b) |
| 108 |
Truth)))) |
| 109 |
(define-sort Values$elem$type () value$type) |
| 110 |
(declare-sort Values$t$type 0) |
| 111 |
(declare-fun Values$empty () Values$t$type) |
| 112 |
(declare-fun Values$mem (Values$elem$type Values$t$type) BOOL) |
| 113 |
(declare-fun Values$add (Values$elem$type Values$t$type) Values$t$type) |
| 114 |
(declare-fun Values$remove (Values$elem$type Values$t$type) Values$t$type) |
| 115 |
(declare-fun Values$cardinality (Values$t$type) Int) |
| 116 |
(declare-fun Values$union (Values$t$type Values$t$type) Values$t$type) |
| 117 |
(declare-fun Values$disjoint (Values$t$type Values$t$type) BOOL) |
| 118 |
;Values$disjoint_empty : |
| 119 |
(assert (forall ((a Values$t$type)) (= (Values$disjoint a Values$empty) |
| 120 |
Truth))) |
| 121 |
;Values$disjoint_comm : |
| 122 |
(assert (forall ((a Values$t$type) (b Values$t$type)) (= (Values$disjoint |
| 123 |
a b) (Values$disjoint |
| 124 |
b a)))) |
| 125 |
;Values$mem_empty : |
| 126 |
(assert (forall ((e Values$elem$type)) (not (= (Values$mem e Values$empty) |
| 127 |
Truth)))) |
| 128 |
;Values$mem_add : |
| 129 |
(assert (forall ((x Values$elem$type) (y Values$elem$type) (s Values$t$type)) |
| 130 |
(= (Values$mem x (Values$add y s)) (ite (or (= x y) (= (Values$mem |
| 131 |
x s) Truth)) |
| 132 |
Truth Falsity)))) |
| 133 |
;Values$mem_remove : |
| 134 |
(assert (forall ((x Values$elem$type) (y Values$elem$type) (s Values$t$type)) |
| 135 |
(= (Values$mem x (Values$remove y s)) (ite (and (not (= x y)) |
| 136 |
(= (Values$mem x s) |
| 137 |
Truth)) Truth Falsity)))) |
| 138 |
;Values$mem_union1 : |
| 139 |
(assert (forall ((x Values$elem$type) (a Values$t$type)) (=> (= (Values$mem |
| 140 |
x a) |
| 141 |
Truth) (forall |
| 142 |
( |
| 143 |
(b Values$t$type)) |
| 144 |
(= |
| 145 |
(Values$mem |
| 146 |
x |
| 147 |
(Values$union |
| 148 |
a b)) |
| 149 |
Truth))))) |
| 150 |
;Values$mem_union2 : |
| 151 |
(assert (forall ((a Values$t$type) (b Values$t$type)) (= (Values$union a b) |
| 152 |
(Values$union b a)))) |
| 153 |
;Values$mem_union3 : |
| 154 |
(assert (forall ((x Values$elem$type) (a Values$t$type) (b Values$t$type)) |
| 155 |
(=> (= (Values$mem x (Values$union a b)) Truth) (or (= (Values$mem |
| 156 |
x a) Truth) |
| 157 |
(= (Values$mem x b) |
| 158 |
Truth))))) |
| 159 |
;Values$mem_union4 : |
| 160 |
(assert (forall ((a Values$t$type)) (= (Values$union a a) a))) |
| 161 |
;Values$mem_union5 : |
| 162 |
(assert (forall ((a Values$t$type)) (= (Values$union a Values$empty) a))) |
| 163 |
;Values$empty_union : |
| 164 |
(assert (forall ((a Values$t$type) (b Values$t$type)) (=> (= (Values$union |
| 165 |
a b) Values$empty) |
| 166 |
(= a Values$empty)))) |
| 167 |
;Values$card_empty : |
| 168 |
(assert (= (Values$cardinality Values$empty) 0)) |
| 169 |
;Values$card_zero : |
| 170 |
(assert (forall ((s Values$t$type)) (=> (= (Values$cardinality s) 0) |
| 171 |
(= s Values$empty)))) |
| 172 |
;Values$card_non_negative : |
| 173 |
(assert (forall ((s Values$t$type)) (>= (Values$cardinality s) 0))) |
| 174 |
;Values$card_add : |
| 175 |
(assert (forall ((x Values$elem$type) (s Values$t$type)) (= (Values$cardinality |
| 176 |
(Values$add x s)) |
| 177 |
(ite (= (Values$mem |
| 178 |
x s) |
| 179 |
Truth) |
| 180 |
(Values$cardinality |
| 181 |
s) (+ (Values$cardinality |
| 182 |
s) 1))))) |
| 183 |
;Values$card_remove : |
| 184 |
(assert (forall ((x Values$elem$type) (s Values$t$type)) (= (Values$cardinality |
| 185 |
(Values$remove |
| 186 |
x s)) (ite |
| 187 |
(= |
| 188 |
(Values$mem |
| 189 |
x s) |
| 190 |
Truth) (- |
| 191 |
(Values$cardinality |
| 192 |
s) |
| 193 |
1) |
| 194 |
(Values$cardinality |
| 195 |
s))))) |
| 196 |
;Values$card_union : |
| 197 |
(assert (forall ((a Values$t$type) (b Values$t$type)) (=> (= (Values$disjoint |
| 198 |
a b) Truth) |
| 199 |
(= (Values$cardinality |
| 200 |
(Values$union a b)) (+ |
| 201 |
(Values$cardinality |
| 202 |
a) (Values$cardinality |
| 203 |
b)))))) |
| 204 |
(declare-fun Values$eq (Values$t$type Values$t$type) BOOL) |
| 205 |
;Values$eq_is_equality : |
| 206 |
(assert (forall ((a Values$t$type) (b Values$t$type)) (= (Values$eq a b) |
| 207 |
(ite (= a b) Truth |
| 208 |
Falsity)))) |
| 209 |
;Values$equal1 : |
| 210 |
(assert (forall ((a Values$t$type) (b Values$t$type)) (=> (forall ((x Values$elem$type)) |
| 211 |
(= (Values$mem x a) |
| 212 |
(Values$mem |
| 213 |
x b))) (= (Values$eq |
| 214 |
a b) |
| 215 |
Truth)))) |
| 216 |
(define-sort node_set$type () (Array node$type BOOL)) |
| 217 |
(declare-fun mk_array_1 () (Array node$type BOOL)) |
| 218 |
;mk_array_1_def : |
| 219 |
(assert (forall ((mk_array_1_index node$type)) (= (select mk_array_1 |
| 220 |
mk_array_1_index) Falsity))) |
| 221 |
(define-fun empty_node_set () node_set$type mk_array_1) |
| 222 |
(define-sort node_pair_set$type () (Array node$type (Array node$type BOOL))) |
| 223 |
(declare-fun mk_array_2 () (Array node$type BOOL)) |
| 224 |
;mk_array_2_def : |
| 225 |
(assert (forall ((mk_array_2_index node$type)) (= (select mk_array_2 |
| 226 |
mk_array_2_index) Falsity))) |
| 227 |
(declare-fun mk_array_3 () (Array node$type (Array node$type BOOL))) |
| 228 |
;mk_array_3_def : |
| 229 |
(assert (forall ((mk_array_3_index node$type)) (= (select mk_array_3 |
| 230 |
mk_array_3_index) mk_array_2))) |
| 231 |
(define-fun empty_node_pair_set () node_pair_set$type mk_array_3) |
| 232 |
(declare-fun mk_array_4 () (Array node$type BOOL)) |
| 233 |
;mk_array_4_def : |
| 234 |
(assert (forall ((mk_array_4_index node$type)) (= (select mk_array_4 |
| 235 |
mk_array_4_index) Truth))) |
| 236 |
(declare-fun mk_array_5 () (Array node$type (Array node$type BOOL))) |
| 237 |
;mk_array_5_def : |
| 238 |
(assert (forall ((mk_array_5_index node$type)) (= (select mk_array_5 |
| 239 |
mk_array_5_index) mk_array_4))) |
| 240 |
(define-fun full_node_pair_set () node_pair_set$type mk_array_5) |
| 241 |
(declare-fun input () (Array node$type value$type)) |
| 242 |
(declare-fun t () Int) |
| 243 |
;positive_bound : |
| 244 |
(assert (> t 0)) |
| 245 |
(define-sort message$type () Values$t$type) |
| 246 |
(define-sort message_set$type () (Array node$type message$type)) |
| 247 |
(define-sort state$type () Values$t$type) |
| 248 |
(define-sort state_set$type () (Array node$type state$type)) |
| 249 |
(define-fun null_message () message$type Values$empty) |
| 250 |
(declare-fun mk_array_6 () (Array node$type message$type)) |
| 251 |
;mk_array_6_def : |
| 252 |
(assert (forall ((mk_array_6_index node$type)) (= (select mk_array_6 |
| 253 |
mk_array_6_index) null_message))) |
| 254 |
(define-fun null_message_set () message_set$type mk_array_6) |
| 255 |
(define-fun null_state () state$type Values$empty) |
| 256 |
(declare-fun mk_array_7 () (Array node$type state$type)) |
| 257 |
;mk_array_7_def : |
| 258 |
(assert (forall ((mk_array_7_index node$type)) (= (select mk_array_7 |
| 259 |
mk_array_7_index) null_state))) |
| 260 |
(define-fun null_state_set () state_set$type mk_array_7) |
| 261 |
(declare-fun choose (Values$t$type) value$type) |
| 262 |
;choosen_value : |
| 263 |
(assert (forall ((vals Values$t$type)) (or (= vals Values$empty) (= (Values$mem |
| 264 |
(choose |
| 265 |
vals) |
| 266 |
vals) |
| 267 |
Truth)))) |
| 268 |
(define-sort failure_pattern$type () node_pair_set$type) |
| 269 |
(define-fun is_faulty ((p node$type) (deliver failure_pattern$type)) BOOL |
| 270 |
(ite (exists ((q node$type)) (not (= (select (select deliver p) q) Truth))) |
| 271 |
Truth Falsity)) |
| 272 |
(define-fun is_silent ((p node$type) (deliver failure_pattern$type)) BOOL |
| 273 |
(ite (forall ((q node$type)) (not (= (select (select deliver p) q) Truth))) |
| 274 |
Truth Falsity)) |
| 275 |
(declare-datatypes ((phase_state$type 0)) (((init_phase) (send_phase) (recv_phase) (comp_phase)))) |
| 276 |
(declare-datatypes ((clean_state$type 0)) (((before) (active) (after)))) |
| 277 |
|
| 278 |
; Var Decls -------------- |
| 279 |
(declare-fun my_compute$result$1 () state$type) |
| 280 |
(declare-fun output$1 () (Array node$type value$type)) |
| 281 |
(declare-fun comp_done () node_set$type) |
| 282 |
(declare-fun compute$can_decide$0$1 () BOOL) |
| 283 |
(declare-fun chosen () (Array node$type BOOL)) |
| 284 |
(declare-fun recv_done () node_pair_set$type) |
| 285 |
(declare-fun output () (Array node$type value$type)) |
| 286 |
(declare-fun phase () phase_state$type) |
| 287 |
(declare-fun global_state () state_set$type) |
| 288 |
(declare-fun my_decide$result$1 () value$type) |
| 289 |
(declare-fun round () Int) |
| 290 |
(declare-fun compute$n () node$type) |
| 291 |
(declare-fun send_done () node_pair_set$type) |
| 292 |
(declare-fun my_can_decide$result$1 () BOOL) |
| 293 |
(declare-fun chosen$1 () (Array node$type BOOL)) |
| 294 |
(declare-fun comp_done$1 () node_set$type) |
| 295 |
(declare-fun global_state$1 () state_set$type) |
| 296 |
|
| 297 |
; Asserts -------------- |
| 298 |
(assert (not (=> (forall ((n node$type)) (=> |
| 299 |
(and |
| 300 |
(= |
| 301 |
(select |
| 302 |
chosen |
| 303 |
n) |
| 304 |
Truth) |
| 305 |
(= |
| 306 |
round (+ |
| 307 |
t |
| 308 |
1))) |
| 309 |
(and |
| 310 |
(forall |
| 311 |
( |
| 312 |
(n node$type) (m node$type)) |
| 313 |
(= |
| 314 |
(select |
| 315 |
(select |
| 316 |
send_done |
| 317 |
n) |
| 318 |
m) |
| 319 |
Truth)) |
| 320 |
(forall |
| 321 |
( |
| 322 |
(n node$type) (m node$type)) |
| 323 |
(= |
| 324 |
(select |
| 325 |
(select |
| 326 |
recv_done |
| 327 |
n) |
| 328 |
m) |
| 329 |
Truth))))) |
| 330 |
(=> (= phase comp_phase) (=> |
| 331 |
(not |
| 332 |
(= (select |
| 333 |
comp_done |
| 334 |
compute$n) |
| 335 |
Truth)) |
| 336 |
(=> |
| 337 |
(= my_compute$result$1 |
| 338 |
(select |
| 339 |
global_state |
| 340 |
compute$n)) |
| 341 |
(=> |
| 342 |
(= global_state$1 |
| 343 |
(store |
| 344 |
global_state |
| 345 |
compute$n |
| 346 |
my_compute$result$1)) |
| 347 |
(=> |
| 348 |
(= my_can_decide$result$1 |
| 349 |
(ite |
| 350 |
(= round (+ |
| 351 |
t 1)) |
| 352 |
Truth |
| 353 |
Falsity)) |
| 354 |
(=> |
| 355 |
(= compute$can_decide$0$1 |
| 356 |
my_can_decide$result$1) |
| 357 |
(= (ite |
| 358 |
(= |
| 359 |
compute$can_decide$0$1 |
| 360 |
Truth) |
| 361 |
(ite |
| 362 |
(=> |
| 363 |
(= |
| 364 |
my_decide$result$1 |
| 365 |
(choose |
| 366 |
(select |
| 367 |
global_state$1 |
| 368 |
compute$n))) |
| 369 |
(=> |
| 370 |
(= |
| 371 |
output$1 |
| 372 |
(store |
| 373 |
output |
| 374 |
compute$n |
| 375 |
my_decide$result$1)) |
| 376 |
(=> |
| 377 |
(= |
| 378 |
chosen$1 |
| 379 |
(store |
| 380 |
chosen |
| 381 |
compute$n |
| 382 |
Truth)) |
| 383 |
(=> |
| 384 |
(= |
| 385 |
comp_done$1 |
| 386 |
(store |
| 387 |
comp_done |
| 388 |
compute$n |
| 389 |
Truth)) |
| 390 |
(forall |
| 391 |
( |
| 392 |
(n node$type)) |
| 393 |
(=> |
| 394 |
(and |
| 395 |
(= |
| 396 |
(select |
| 397 |
chosen$1 |
| 398 |
n) |
| 399 |
Truth) |
| 400 |
(= |
| 401 |
round (+ |
| 402 |
t |
| 403 |
1))) |
| 404 |
(and |
| 405 |
(forall |
| 406 |
( |
| 407 |
(n node$type) (m node$type)) |
| 408 |
(= |
| 409 |
(select |
| 410 |
(select |
| 411 |
send_done |
| 412 |
n) |
| 413 |
m) |
| 414 |
Truth)) |
| 415 |
(forall |
| 416 |
( |
| 417 |
(n node$type) (m node$type)) |
| 418 |
(= |
| 419 |
(select |
| 420 |
(select |
| 421 |
recv_done |
| 422 |
n) |
| 423 |
m) |
| 424 |
Truth))))))))) |
| 425 |
Truth |
| 426 |
Falsity) |
| 427 |
(ite |
| 428 |
(=> |
| 429 |
(= |
| 430 |
comp_done$1 |
| 431 |
(store |
| 432 |
comp_done |
| 433 |
compute$n |
| 434 |
Truth)) |
| 435 |
(forall |
| 436 |
( |
| 437 |
(n node$type)) |
| 438 |
(=> |
| 439 |
(and |
| 440 |
(= |
| 441 |
(select |
| 442 |
chosen |
| 443 |
n) |
| 444 |
Truth) |
| 445 |
(= |
| 446 |
round (+ |
| 447 |
t |
| 448 |
1))) |
| 449 |
(and |
| 450 |
(forall |
| 451 |
( |
| 452 |
(n node$type) (m node$type)) |
| 453 |
(= |
| 454 |
(select |
| 455 |
(select |
| 456 |
send_done |
| 457 |
n) |
| 458 |
m) |
| 459 |
Truth)) |
| 460 |
(forall |
| 461 |
( |
| 462 |
(n node$type) (m node$type)) |
| 463 |
(= |
| 464 |
(select |
| 465 |
(select |
| 466 |
recv_done |
| 467 |
n) |
| 468 |
m) |
| 469 |
Truth)))))) |
| 470 |
Truth |
| 471 |
Falsity)) |
| 472 |
Truth)))))))))) |
| 473 |
|
| 474 |
(check-sat) |