| 1 |
; COMMAND-LINE: --finite-model-find |
| 2 |
; EXPECT: unsat |
| 3 |
|
| 4 |
; Preamble -------------- |
| 5 |
(set-logic AUFDTLIA) |
| 6 |
(set-info :status unsat) |
| 7 |
(declare-datatypes ((UNIT 0)) (((Unit)))) |
| 8 |
(declare-datatypes ((BOOL 0)) (((Truth) (Falsity)))) |
| 9 |
|
| 10 |
; Decls -------------- |
| 11 |
(declare-sort node$type 0) |
| 12 |
(declare-sort value$type 0) |
| 13 |
(define-sort Nodes$elem$type () node$type) |
| 14 |
(declare-sort Nodes$t$type 0) |
| 15 |
(declare-fun Nodes$empty () Nodes$t$type) |
| 16 |
(declare-fun Nodes$mem (Nodes$elem$type Nodes$t$type) BOOL) |
| 17 |
(declare-fun Nodes$add (Nodes$elem$type Nodes$t$type) Nodes$t$type) |
| 18 |
(declare-fun Nodes$remove (Nodes$elem$type Nodes$t$type) Nodes$t$type) |
| 19 |
(declare-fun Nodes$cardinality (Nodes$t$type) Int) |
| 20 |
(declare-fun Nodes$union (Nodes$t$type Nodes$t$type) Nodes$t$type) |
| 21 |
(declare-fun Nodes$disjoint (Nodes$t$type Nodes$t$type) BOOL) |
| 22 |
;Nodes$disjoint_empty : |
| 23 |
(assert (forall ((a Nodes$t$type)) (= (Nodes$disjoint a Nodes$empty) Truth))) |
| 24 |
;Nodes$disjoint_comm : |
| 25 |
(assert (forall ((a Nodes$t$type) (b Nodes$t$type)) (= (Nodes$disjoint a b) |
| 26 |
(Nodes$disjoint b a)))) |
| 27 |
;Nodes$mem_empty : |
| 28 |
(assert (forall ((e Nodes$elem$type)) (not (= (Nodes$mem e Nodes$empty) |
| 29 |
Truth)))) |
| 30 |
;Nodes$mem_add : |
| 31 |
(assert (forall ((x Nodes$elem$type) (y Nodes$elem$type) (s Nodes$t$type)) |
| 32 |
(= (Nodes$mem x (Nodes$add y s)) (ite (or (= x y) (= (Nodes$mem x s) |
| 33 |
Truth)) Truth |
| 34 |
Falsity)))) |
| 35 |
;Nodes$mem_remove : |
| 36 |
(assert (forall ((x Nodes$elem$type) (y Nodes$elem$type) (s Nodes$t$type)) |
| 37 |
(= (Nodes$mem x (Nodes$remove y s)) (ite (and (not (= x y)) (= |
| 38 |
(Nodes$mem |
| 39 |
x s) |
| 40 |
Truth)) |
| 41 |
Truth Falsity)))) |
| 42 |
;Nodes$mem_union1 : |
| 43 |
(assert (forall ((x Nodes$elem$type) (a Nodes$t$type)) (=> (= (Nodes$mem x a) |
| 44 |
Truth) (forall |
| 45 |
((b Nodes$t$type)) |
| 46 |
(= |
| 47 |
(Nodes$mem |
| 48 |
x (Nodes$union |
| 49 |
a b)) |
| 50 |
Truth))))) |
| 51 |
;Nodes$mem_union2 : |
| 52 |
(assert (forall ((a Nodes$t$type) (b Nodes$t$type)) (= (Nodes$union a b) |
| 53 |
(Nodes$union b a)))) |
| 54 |
;Nodes$mem_union3 : |
| 55 |
(assert (forall ((x Nodes$elem$type) (a Nodes$t$type) (b Nodes$t$type)) |
| 56 |
(=> (= (Nodes$mem x (Nodes$union a b)) Truth) (or (= (Nodes$mem x a) |
| 57 |
Truth) (= (Nodes$mem |
| 58 |
x b) |
| 59 |
Truth))))) |
| 60 |
;Nodes$mem_union4 : |
| 61 |
(assert (forall ((a Nodes$t$type)) (= (Nodes$union a a) a))) |
| 62 |
;Nodes$mem_union5 : |
| 63 |
(assert (forall ((a Nodes$t$type)) (= (Nodes$union a Nodes$empty) a))) |
| 64 |
;Nodes$empty_union : |
| 65 |
(assert (forall ((a Nodes$t$type) (b Nodes$t$type)) (=> (= (Nodes$union a b) |
| 66 |
Nodes$empty) |
| 67 |
(= a Nodes$empty)))) |
| 68 |
;Nodes$card_empty : |
| 69 |
(assert (= (Nodes$cardinality Nodes$empty) 0)) |
| 70 |
;Nodes$card_zero : |
| 71 |
(assert (forall ((s Nodes$t$type)) (=> (= (Nodes$cardinality s) 0) (= |
| 72 |
s |
| 73 |
Nodes$empty)))) |
| 74 |
;Nodes$card_non_negative : |
| 75 |
(assert (forall ((s Nodes$t$type)) (>= (Nodes$cardinality s) 0))) |
| 76 |
;Nodes$card_add : |
| 77 |
(assert (forall ((x Nodes$elem$type) (s Nodes$t$type)) (= (Nodes$cardinality |
| 78 |
(Nodes$add x s)) |
| 79 |
(ite (= (Nodes$mem |
| 80 |
x s) Truth) |
| 81 |
(Nodes$cardinality |
| 82 |
s) (+ (Nodes$cardinality |
| 83 |
s) 1))))) |
| 84 |
;Nodes$card_remove : |
| 85 |
(assert (forall ((x Nodes$elem$type) (s Nodes$t$type)) (= (Nodes$cardinality |
| 86 |
(Nodes$remove x s)) |
| 87 |
(ite (= (Nodes$mem |
| 88 |
x s) Truth) (- |
| 89 |
(Nodes$cardinality |
| 90 |
s) 1) (Nodes$cardinality |
| 91 |
s))))) |
| 92 |
;Nodes$card_union : |
| 93 |
(assert (forall ((a Nodes$t$type) (b Nodes$t$type)) (=> (= (Nodes$disjoint |
| 94 |
a b) Truth) |
| 95 |
(= (Nodes$cardinality |
| 96 |
(Nodes$union a b)) (+ |
| 97 |
(Nodes$cardinality |
| 98 |
a) (Nodes$cardinality b)))))) |
| 99 |
(declare-fun Nodes$eq (Nodes$t$type Nodes$t$type) BOOL) |
| 100 |
;Nodes$eq_is_equality : |
| 101 |
(assert (forall ((a Nodes$t$type) (b Nodes$t$type)) (= (Nodes$eq a b) |
| 102 |
(ite (= a b) Truth |
| 103 |
Falsity)))) |
| 104 |
;Nodes$equal1 : |
| 105 |
(assert (forall ((a Nodes$t$type) (b Nodes$t$type)) (=> (forall ((x Nodes$elem$type)) |
| 106 |
(= (Nodes$mem x a) |
| 107 |
(Nodes$mem x b))) |
| 108 |
(= (Nodes$eq a b) |
| 109 |
Truth)))) |
| 110 |
(define-sort Values$elem$type () value$type) |
| 111 |
(declare-sort Values$t$type 0) |
| 112 |
(declare-fun Values$empty () Values$t$type) |
| 113 |
(declare-fun Values$mem (Values$elem$type Values$t$type) BOOL) |
| 114 |
(declare-fun Values$add (Values$elem$type Values$t$type) Values$t$type) |
| 115 |
(declare-fun Values$remove (Values$elem$type Values$t$type) Values$t$type) |
| 116 |
(declare-fun Values$cardinality (Values$t$type) Int) |
| 117 |
(declare-fun Values$union (Values$t$type Values$t$type) Values$t$type) |
| 118 |
(declare-fun Values$disjoint (Values$t$type Values$t$type) BOOL) |
| 119 |
;Values$disjoint_empty : |
| 120 |
(assert (forall ((a Values$t$type)) (= (Values$disjoint a Values$empty) |
| 121 |
Truth))) |
| 122 |
;Values$disjoint_comm : |
| 123 |
(assert (forall ((a Values$t$type) (b Values$t$type)) (= (Values$disjoint |
| 124 |
a b) (Values$disjoint |
| 125 |
b a)))) |
| 126 |
;Values$mem_empty : |
| 127 |
(assert (forall ((e Values$elem$type)) (not (= (Values$mem e Values$empty) |
| 128 |
Truth)))) |
| 129 |
;Values$mem_add : |
| 130 |
(assert (forall ((x Values$elem$type) (y Values$elem$type) (s Values$t$type)) |
| 131 |
(= (Values$mem x (Values$add y s)) (ite (or (= x y) (= (Values$mem |
| 132 |
x s) Truth)) |
| 133 |
Truth Falsity)))) |
| 134 |
;Values$mem_remove : |
| 135 |
(assert (forall ((x Values$elem$type) (y Values$elem$type) (s Values$t$type)) |
| 136 |
(= (Values$mem x (Values$remove y s)) (ite (and (not (= x y)) |
| 137 |
(= (Values$mem x s) |
| 138 |
Truth)) Truth Falsity)))) |
| 139 |
;Values$mem_union1 : |
| 140 |
(assert (forall ((x Values$elem$type) (a Values$t$type)) (=> (= (Values$mem |
| 141 |
x a) |
| 142 |
Truth) (forall |
| 143 |
( |
| 144 |
(b Values$t$type)) |
| 145 |
(= |
| 146 |
(Values$mem |
| 147 |
x |
| 148 |
(Values$union |
| 149 |
a b)) |
| 150 |
Truth))))) |
| 151 |
;Values$mem_union2 : |
| 152 |
(assert (forall ((a Values$t$type) (b Values$t$type)) (= (Values$union a b) |
| 153 |
(Values$union b a)))) |
| 154 |
;Values$mem_union3 : |
| 155 |
(assert (forall ((x Values$elem$type) (a Values$t$type) (b Values$t$type)) |
| 156 |
(=> (= (Values$mem x (Values$union a b)) Truth) (or (= (Values$mem |
| 157 |
x a) Truth) |
| 158 |
(= (Values$mem x b) |
| 159 |
Truth))))) |
| 160 |
;Values$mem_union4 : |
| 161 |
(assert (forall ((a Values$t$type)) (= (Values$union a a) a))) |
| 162 |
;Values$mem_union5 : |
| 163 |
(assert (forall ((a Values$t$type)) (= (Values$union a Values$empty) a))) |
| 164 |
;Values$empty_union : |
| 165 |
(assert (forall ((a Values$t$type) (b Values$t$type)) (=> (= (Values$union |
| 166 |
a b) Values$empty) |
| 167 |
(= a Values$empty)))) |
| 168 |
;Values$card_empty : |
| 169 |
(assert (= (Values$cardinality Values$empty) 0)) |
| 170 |
;Values$card_zero : |
| 171 |
(assert (forall ((s Values$t$type)) (=> (= (Values$cardinality s) 0) |
| 172 |
(= s Values$empty)))) |
| 173 |
;Values$card_non_negative : |
| 174 |
(assert (forall ((s Values$t$type)) (>= (Values$cardinality s) 0))) |
| 175 |
;Values$card_add : |
| 176 |
(assert (forall ((x Values$elem$type) (s Values$t$type)) (= (Values$cardinality |
| 177 |
(Values$add x s)) |
| 178 |
(ite (= (Values$mem |
| 179 |
x s) |
| 180 |
Truth) |
| 181 |
(Values$cardinality |
| 182 |
s) (+ (Values$cardinality |
| 183 |
s) 1))))) |
| 184 |
;Values$card_remove : |
| 185 |
(assert (forall ((x Values$elem$type) (s Values$t$type)) (= (Values$cardinality |
| 186 |
(Values$remove |
| 187 |
x s)) (ite |
| 188 |
(= |
| 189 |
(Values$mem |
| 190 |
x s) |
| 191 |
Truth) (- |
| 192 |
(Values$cardinality |
| 193 |
s) |
| 194 |
1) |
| 195 |
(Values$cardinality |
| 196 |
s))))) |
| 197 |
;Values$card_union : |
| 198 |
(assert (forall ((a Values$t$type) (b Values$t$type)) (=> (= (Values$disjoint |
| 199 |
a b) Truth) |
| 200 |
(= (Values$cardinality |
| 201 |
(Values$union a b)) (+ |
| 202 |
(Values$cardinality |
| 203 |
a) (Values$cardinality |
| 204 |
b)))))) |
| 205 |
(declare-fun Values$eq (Values$t$type Values$t$type) BOOL) |
| 206 |
;Values$eq_is_equality : |
| 207 |
(assert (forall ((a Values$t$type) (b Values$t$type)) (= (Values$eq a b) |
| 208 |
(ite (= a b) Truth |
| 209 |
Falsity)))) |
| 210 |
;Values$equal1 : |
| 211 |
(assert (forall ((a Values$t$type) (b Values$t$type)) (=> (forall ((x Values$elem$type)) |
| 212 |
(= (Values$mem x a) |
| 213 |
(Values$mem |
| 214 |
x b))) (= (Values$eq |
| 215 |
a b) |
| 216 |
Truth)))) |
| 217 |
(define-sort node_set$type () (Array node$type BOOL)) |
| 218 |
(declare-fun mk_array_1 () (Array node$type BOOL)) |
| 219 |
;mk_array_1_def : |
| 220 |
(assert (forall ((mk_array_1_index node$type)) (= (select mk_array_1 |
| 221 |
mk_array_1_index) Falsity))) |
| 222 |
(define-fun empty_node_set () node_set$type mk_array_1) |
| 223 |
(define-sort node_pair_set$type () (Array node$type (Array node$type BOOL))) |
| 224 |
(declare-fun mk_array_2 () (Array node$type BOOL)) |
| 225 |
;mk_array_2_def : |
| 226 |
(assert (forall ((mk_array_2_index node$type)) (= (select mk_array_2 |
| 227 |
mk_array_2_index) Falsity))) |
| 228 |
(declare-fun mk_array_3 () (Array node$type (Array node$type BOOL))) |
| 229 |
;mk_array_3_def : |
| 230 |
(assert (forall ((mk_array_3_index node$type)) (= (select mk_array_3 |
| 231 |
mk_array_3_index) mk_array_2))) |
| 232 |
(define-fun empty_node_pair_set () node_pair_set$type mk_array_3) |
| 233 |
(declare-fun mk_array_4 () (Array node$type BOOL)) |
| 234 |
;mk_array_4_def : |
| 235 |
(assert (forall ((mk_array_4_index node$type)) (= (select mk_array_4 |
| 236 |
mk_array_4_index) Truth))) |
| 237 |
(declare-fun mk_array_5 () (Array node$type (Array node$type BOOL))) |
| 238 |
;mk_array_5_def : |
| 239 |
(assert (forall ((mk_array_5_index node$type)) (= (select mk_array_5 |
| 240 |
mk_array_5_index) mk_array_4))) |
| 241 |
(define-fun full_node_pair_set () node_pair_set$type mk_array_5) |
| 242 |
(declare-fun input () (Array node$type value$type)) |
| 243 |
(declare-fun t () Int) |
| 244 |
;positive_bound : |
| 245 |
(assert (> t 0)) |
| 246 |
(define-sort message$type () Values$t$type) |
| 247 |
(define-sort message_set$type () (Array node$type message$type)) |
| 248 |
(define-sort state$type () Values$t$type) |
| 249 |
(define-sort state_set$type () (Array node$type state$type)) |
| 250 |
(define-fun null_message () message$type Values$empty) |
| 251 |
(declare-fun mk_array_6 () (Array node$type message$type)) |
| 252 |
;mk_array_6_def : |
| 253 |
(assert (forall ((mk_array_6_index node$type)) (= (select mk_array_6 |
| 254 |
mk_array_6_index) null_message))) |
| 255 |
(define-fun null_message_set () message_set$type mk_array_6) |
| 256 |
(define-fun null_state () state$type Values$empty) |
| 257 |
(declare-fun mk_array_7 () (Array node$type state$type)) |
| 258 |
;mk_array_7_def : |
| 259 |
(assert (forall ((mk_array_7_index node$type)) (= (select mk_array_7 |
| 260 |
mk_array_7_index) null_state))) |
| 261 |
(define-fun null_state_set () state_set$type mk_array_7) |
| 262 |
(declare-fun set.choose (Values$t$type) value$type) |
| 263 |
;choosen_value : |
| 264 |
(assert (forall ((vals Values$t$type)) (or (= vals Values$empty) (= (Values$mem |
| 265 |
(set.choose |
| 266 |
vals) |
| 267 |
vals) |
| 268 |
Truth)))) |
| 269 |
(define-sort failure_pattern$type () node_pair_set$type) |
| 270 |
(define-fun is_faulty ((p node$type) (deliver failure_pattern$type)) BOOL |
| 271 |
(ite (exists ((q node$type)) (not (= (select (select deliver p) q) Truth))) |
| 272 |
Truth Falsity)) |
| 273 |
(define-fun is_silent ((p node$type) (deliver failure_pattern$type)) BOOL |
| 274 |
(ite (forall ((q node$type)) (not (= (select (select deliver p) q) Truth))) |
| 275 |
Truth Falsity)) |
| 276 |
(declare-datatypes ((phase_state$type 0)) (((init_phase) (send_phase) (recv_phase) (comp_phase)))) |
| 277 |
(declare-datatypes ((clean_state$type 0)) (((before) (active) (after)))) |
| 278 |
|
| 279 |
; Var Decls -------------- |
| 280 |
(declare-fun init_done () node_set$type) |
| 281 |
(declare-fun crashed () Nodes$t$type) |
| 282 |
(declare-fun comp_done () node_set$type) |
| 283 |
(declare-fun chosen () (Array node$type BOOL)) |
| 284 |
(declare-fun recv_done () node_pair_set$type) |
| 285 |
(declare-fun phase () phase_state$type) |
| 286 |
(declare-fun clean () clean_state$type) |
| 287 |
(declare-fun global_state () state_set$type) |
| 288 |
(declare-fun messages () (Array node$type message_set$type)) |
| 289 |
(declare-fun deliver_message () failure_pattern$type) |
| 290 |
(declare-fun crashing () Nodes$t$type) |
| 291 |
(declare-fun round () Int) |
| 292 |
(declare-fun send_done () node_pair_set$type) |
| 293 |
|
| 294 |
; Asserts -------------- |
| 295 |
(declare-fun mk_array_8 () (Array node$type BOOL)) |
| 296 |
;mk_array_8_def : |
| 297 |
(assert (forall ((mk_array_8_index node$type)) (= (select mk_array_8 |
| 298 |
mk_array_8_index) Falsity))) |
| 299 |
(declare-fun mk_array_9 () (Array node$type message_set$type)) |
| 300 |
;mk_array_9_def : |
| 301 |
(assert (forall ((mk_array_9_index node$type)) (= (select mk_array_9 |
| 302 |
mk_array_9_index) null_message_set))) |
| 303 |
(assert (not (=> (and (and (and (and (and (and (and (and (and (and (and |
| 304 |
(and |
| 305 |
(= |
| 306 |
clean |
| 307 |
before) |
| 308 |
(= |
| 309 |
global_state |
| 310 |
null_state_set)) |
| 311 |
(= |
| 312 |
messages |
| 313 |
mk_array_9)) |
| 314 |
(= deliver_message |
| 315 |
full_node_pair_set)) |
| 316 |
(= comp_done |
| 317 |
empty_node_set)) |
| 318 |
(= recv_done empty_node_pair_set)) |
| 319 |
(= send_done empty_node_pair_set)) |
| 320 |
(= init_done empty_node_set)) |
| 321 |
(= phase init_phase)) (= crashing |
| 322 |
Nodes$empty)) |
| 323 |
(= crashed Nodes$empty)) (= round 0)) (= chosen |
| 324 |
mk_array_8)) |
| 325 |
(forall ((n node$type)) (=> (and (= (select chosen n) Truth) |
| 326 |
(= round (+ t 1))) (and (forall |
| 327 |
((n node$type) (m node$type)) |
| 328 |
(= (select |
| 329 |
(select |
| 330 |
send_done |
| 331 |
n) |
| 332 |
m) |
| 333 |
Truth)) |
| 334 |
(forall ( |
| 335 |
(n node$type) (m node$type)) |
| 336 |
(= (select |
| 337 |
(select |
| 338 |
recv_done |
| 339 |
n) m) |
| 340 |
Truth)))))))) |
| 341 |
|
| 342 |
(check-sat) |