Debian Codegraph @

test/regress/cli/regress0/auflia/bug336.smt2

raw
1 (set-logic QF_AUFLIA)
2 (set-info :source | This is based on an example in Section 6.2 of "A Decision
3 Procedure for an Extensional Theory of Arrays" by Stump, Barrett, Dill, and
4 Levitt. |)
5 (set-info :smt-lib-version 2.6)
6 (set-info :category "check")
7 (set-info :status unsat)
8 (set-info :notes |This benchmark is designed to require an array DP to propagate a properly entailed disjunction of equalities between shared terms.|)
9 (declare-fun a () (Array Int Int))
10 (declare-fun b () (Array Int Int))
11 (declare-fun v () Int)
12 (declare-fun w () Int)
13 (declare-fun x () Int)
14 (declare-fun y () Int)
15 (declare-fun g ((Array Int Int)) Int)
16 (declare-fun f (Int) Int)
17 (assert (and (= (store a x v) b) (= (store a y w) b) (not (= (f x) (f y))) (not (= (g a) (g b)))))
18 (check-sat)
19 (exit)