Debian Codegraph @

test/regress/cli/regress0/sep/trees-1.smt2

raw
1 (set-logic QF_ALL)
2 (set-info :status unsat)
3
4 (declare-sort Loc 0)
5 (declare-const loc0 Loc)
6
7 (declare-datatypes ((Node 0)) (((node (data Int) (left Loc) (right Loc)))))
8 (declare-heap (Loc Node))
9
10 (declare-fun data0 () Node)
11
12 (declare-const dv Int)
13 (declare-const v Loc)
14
15 (declare-const dl Int)
16 (declare-const l Loc)
17 (declare-const dr Int)
18 (declare-const r Loc)
19
20 (define-fun ten-tree0 ((x Loc) (d Int)) Bool
21 (or (and sep.emp (= x (as sep.nil Loc))) (and (sep (pto x (node d l r)) (and sep.emp (= l (as sep.nil Loc))) (and sep.emp (= r (as sep.nil Loc)))) (= dl (- d 10)) (= dr (+ d 10)))))
22
23 (declare-const dy Int)
24 (declare-const y Loc)
25 (declare-const dz Int)
26 (declare-const z Loc)
27
28 (define-fun ord-tree0 ((x Loc) (d Int)) Bool
29 (or (and sep.emp (= x (as sep.nil Loc))) (and (sep (pto x (node d y z)) (and sep.emp (= y (as sep.nil Loc))) (and sep.emp (= z (as sep.nil Loc)))) (<= dy d) (<= d dz))))
30
31 ;------- f -------
32 (assert (= y (as sep.nil Loc)))
33 (assert (= z (as sep.nil Loc)))
34
35 (assert (= dy dv))
36 (assert (= dz (+ dv 10)))
37 ;-----------------
38
39 (assert (not (= v (as sep.nil Loc))))
40
41 (assert (ten-tree0 v dv))
42 (assert (not (ord-tree0 v dv)))
43
44 (check-sat)