{-# LANGUAGE DataKinds #-}
{-# LANGUAGE QuasiQuotes #-}

{- |
    Module: EVM.SMT
    Description: Utilities for building and executing SMT queries from Expr instances
-}
module EVM.SMT where

import Prelude hiding (LT, GT)

import Control.Monad
import Data.Containers.ListUtils (nubOrd)
import Data.ByteString (ByteString)
import Data.ByteString qualified as BS
import Data.List qualified as List
import Data.List.NonEmpty (NonEmpty((:|)))
import Data.List.NonEmpty qualified as NonEmpty
import Data.String.Here
import Data.Maybe (fromJust, fromMaybe)
import Data.Map.Strict (Map)
import Data.Map.Strict qualified as Map
import Data.Set (Set)
import Data.Set qualified as Set
import Data.Word (Word8)
import Data.Text.Lazy (Text)
import Data.Text qualified as TS
import Data.Text.Lazy qualified as T
import Data.Text.Lazy.Builder
import Language.SMT2.Parser (getValueRes, parseCommentFreeFileMsg)
import Language.SMT2.Syntax (Symbol, SpecConstant(..), GeneralRes(..), Term(..), QualIdentifier(..), Identifier(..), Sort(..), Index(..), VarBinding(..))
import Numeric (readHex, readBin)
import Witch (into, unsafeInto)
import Control.Monad.State (State, runState, get, put)
import EVM.Format (formatProp)

import EVM.CSE
import EVM.Expr (writeByte, bufLengthEnv, containsNode, bufLength, minLength, inRange)
import EVM.Expr qualified as Expr
import EVM.Keccak (keccakAssumptions, keccakCompute)
import EVM.Traversals
import EVM.Types
import EVM.Effects


-- ** Encoding ** ----------------------------------------------------------------------------------


-- | Data that we need to construct a nice counterexample
data CexVars = CexVars
  { -- | variable names that we need models for to reconstruct calldata
    CexVars -> [Text]
calldata     :: [Text]
    -- | symbolic address names
  , CexVars -> [Text]
addrs        :: [Text]
    -- | buffer names and guesses at their maximum size
  , CexVars -> Map Text (Expr 'EWord)
buffers      :: Map Text (Expr EWord)
    -- | reads from abstract storage
  , CexVars -> Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord))
storeReads   :: Map (Expr EAddr, Maybe W256) (Set (Expr EWord))
    -- | the names of any block context variables
  , CexVars -> [Text]
blockContext :: [Text]
    -- | the names of any tx context variables
  , CexVars -> [Text]
txContext    :: [Text]
  }
  deriving (CexVars -> CexVars -> Bool
(CexVars -> CexVars -> Bool)
-> (CexVars -> CexVars -> Bool) -> Eq CexVars
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
$c== :: CexVars -> CexVars -> Bool
== :: CexVars -> CexVars -> Bool
$c/= :: CexVars -> CexVars -> Bool
/= :: CexVars -> CexVars -> Bool
Eq, Int -> CexVars -> ShowS
[CexVars] -> ShowS
CexVars -> [Char]
(Int -> CexVars -> ShowS)
-> (CexVars -> [Char]) -> ([CexVars] -> ShowS) -> Show CexVars
forall a.
(Int -> a -> ShowS) -> (a -> [Char]) -> ([a] -> ShowS) -> Show a
$cshowsPrec :: Int -> CexVars -> ShowS
showsPrec :: Int -> CexVars -> ShowS
$cshow :: CexVars -> [Char]
show :: CexVars -> [Char]
$cshowList :: [CexVars] -> ShowS
showList :: [CexVars] -> ShowS
Show)

instance Semigroup CexVars where
  (CexVars [Text]
a [Text]
b Map Text (Expr 'EWord)
c Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord))
d [Text]
e [Text]
f) <> :: CexVars -> CexVars -> CexVars
<> (CexVars [Text]
a2 [Text]
b2 Map Text (Expr 'EWord)
c2 Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord))
d2 [Text]
e2 [Text]
f2) = [Text]
-> [Text]
-> Map Text (Expr 'EWord)
-> Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord))
-> [Text]
-> [Text]
-> CexVars
CexVars ([Text]
a [Text] -> [Text] -> [Text]
forall a. Semigroup a => a -> a -> a
<> [Text]
a2) ([Text]
b [Text] -> [Text] -> [Text]
forall a. Semigroup a => a -> a -> a
<> [Text]
b2) (Map Text (Expr 'EWord)
c Map Text (Expr 'EWord)
-> Map Text (Expr 'EWord) -> Map Text (Expr 'EWord)
forall a. Semigroup a => a -> a -> a
<> Map Text (Expr 'EWord)
c2) (Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord))
d Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord))
-> Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord))
-> Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord))
forall a. Semigroup a => a -> a -> a
<> Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord))
d2) ([Text]
e [Text] -> [Text] -> [Text]
forall a. Semigroup a => a -> a -> a
<> [Text]
e2) ([Text]
f [Text] -> [Text] -> [Text]
forall a. Semigroup a => a -> a -> a
<> [Text]
f2)

instance Monoid CexVars where
    mempty :: CexVars
mempty = CexVars
      { $sel:calldata:CexVars :: [Text]
calldata = [Text]
forall a. Monoid a => a
mempty
      , $sel:addrs:CexVars :: [Text]
addrs = [Text]
forall a. Monoid a => a
mempty
      , $sel:buffers:CexVars :: Map Text (Expr 'EWord)
buffers = Map Text (Expr 'EWord)
forall a. Monoid a => a
mempty
      , $sel:storeReads:CexVars :: Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord))
storeReads = Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord))
forall a. Monoid a => a
mempty
      , $sel:blockContext:CexVars :: [Text]
blockContext = [Text]
forall a. Monoid a => a
mempty
      , $sel:txContext:CexVars :: [Text]
txContext = [Text]
forall a. Monoid a => a
mempty
      }

-- | A model for a buffer, either in it's compressed form (for storing parsed
-- models from a solver), or as a bytestring (for presentation to users)
data BufModel
  = Comp CompressedBuf
  | Flat ByteString
  deriving (BufModel -> BufModel -> Bool
(BufModel -> BufModel -> Bool)
-> (BufModel -> BufModel -> Bool) -> Eq BufModel
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
$c== :: BufModel -> BufModel -> Bool
== :: BufModel -> BufModel -> Bool
$c/= :: BufModel -> BufModel -> Bool
/= :: BufModel -> BufModel -> Bool
Eq, Int -> BufModel -> ShowS
[BufModel] -> ShowS
BufModel -> [Char]
(Int -> BufModel -> ShowS)
-> (BufModel -> [Char]) -> ([BufModel] -> ShowS) -> Show BufModel
forall a.
(Int -> a -> ShowS) -> (a -> [Char]) -> ([a] -> ShowS) -> Show a
$cshowsPrec :: Int -> BufModel -> ShowS
showsPrec :: Int -> BufModel -> ShowS
$cshow :: BufModel -> [Char]
show :: BufModel -> [Char]
$cshowList :: [BufModel] -> ShowS
showList :: [BufModel] -> ShowS
Show)

-- | This representation lets us store buffers of arbitrary length without
-- exhausting the available memory, it closely matches the format used by
-- smt-lib when returning models for arrays
data CompressedBuf
  = Base { CompressedBuf -> Word8
byte :: Word8, CompressedBuf -> W256
length :: W256}
  | Write { byte :: Word8, CompressedBuf -> W256
idx :: W256, CompressedBuf -> CompressedBuf
next :: CompressedBuf }
  deriving (CompressedBuf -> CompressedBuf -> Bool
(CompressedBuf -> CompressedBuf -> Bool)
-> (CompressedBuf -> CompressedBuf -> Bool) -> Eq CompressedBuf
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
$c== :: CompressedBuf -> CompressedBuf -> Bool
== :: CompressedBuf -> CompressedBuf -> Bool
$c/= :: CompressedBuf -> CompressedBuf -> Bool
/= :: CompressedBuf -> CompressedBuf -> Bool
Eq, Int -> CompressedBuf -> ShowS
[CompressedBuf] -> ShowS
CompressedBuf -> [Char]
(Int -> CompressedBuf -> ShowS)
-> (CompressedBuf -> [Char])
-> ([CompressedBuf] -> ShowS)
-> Show CompressedBuf
forall a.
(Int -> a -> ShowS) -> (a -> [Char]) -> ([a] -> ShowS) -> Show a
$cshowsPrec :: Int -> CompressedBuf -> ShowS
showsPrec :: Int -> CompressedBuf -> ShowS
$cshow :: CompressedBuf -> [Char]
show :: CompressedBuf -> [Char]
$cshowList :: [CompressedBuf] -> ShowS
showList :: [CompressedBuf] -> ShowS
Show)


-- | a final post shrinking cex, buffers here are all represented as concrete bytestrings
data SMTCex = SMTCex
  { SMTCex -> Map (Expr 'EWord) W256
vars :: Map (Expr EWord) W256
  , SMTCex -> Map (Expr 'EAddr) Addr
addrs :: Map (Expr EAddr) Addr
  , SMTCex -> Map (Expr 'Buf) BufModel
buffers :: Map (Expr Buf) BufModel
  , SMTCex -> Map (Expr 'EAddr) (Map W256 W256)
store :: Map (Expr EAddr) (Map W256 W256)
  , SMTCex -> Map (Expr 'EWord) W256
blockContext :: Map (Expr EWord) W256
  , SMTCex -> Map (Expr 'EWord) W256
txContext :: Map (Expr EWord) W256
  }
  deriving (SMTCex -> SMTCex -> Bool
(SMTCex -> SMTCex -> Bool)
-> (SMTCex -> SMTCex -> Bool) -> Eq SMTCex
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
$c== :: SMTCex -> SMTCex -> Bool
== :: SMTCex -> SMTCex -> Bool
$c/= :: SMTCex -> SMTCex -> Bool
/= :: SMTCex -> SMTCex -> Bool
Eq, Int -> SMTCex -> ShowS
[SMTCex] -> ShowS
SMTCex -> [Char]
(Int -> SMTCex -> ShowS)
-> (SMTCex -> [Char]) -> ([SMTCex] -> ShowS) -> Show SMTCex
forall a.
(Int -> a -> ShowS) -> (a -> [Char]) -> ([a] -> ShowS) -> Show a
$cshowsPrec :: Int -> SMTCex -> ShowS
showsPrec :: Int -> SMTCex -> ShowS
$cshow :: SMTCex -> [Char]
show :: SMTCex -> [Char]
$cshowList :: [SMTCex] -> ShowS
showList :: [SMTCex] -> ShowS
Show)


-- | Used for abstraction-refinement of the SMT formula. Contains assertions that make our query fully precise. These will be added to the assertion stack if we get `sat` with the abstracted query.
data RefinementEqs = RefinementEqs [Builder] [Prop]
  deriving (RefinementEqs -> RefinementEqs -> Bool
(RefinementEqs -> RefinementEqs -> Bool)
-> (RefinementEqs -> RefinementEqs -> Bool) -> Eq RefinementEqs
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
$c== :: RefinementEqs -> RefinementEqs -> Bool
== :: RefinementEqs -> RefinementEqs -> Bool
$c/= :: RefinementEqs -> RefinementEqs -> Bool
/= :: RefinementEqs -> RefinementEqs -> Bool
Eq, Int -> RefinementEqs -> ShowS
[RefinementEqs] -> ShowS
RefinementEqs -> [Char]
(Int -> RefinementEqs -> ShowS)
-> (RefinementEqs -> [Char])
-> ([RefinementEqs] -> ShowS)
-> Show RefinementEqs
forall a.
(Int -> a -> ShowS) -> (a -> [Char]) -> ([a] -> ShowS) -> Show a
$cshowsPrec :: Int -> RefinementEqs -> ShowS
showsPrec :: Int -> RefinementEqs -> ShowS
$cshow :: RefinementEqs -> [Char]
show :: RefinementEqs -> [Char]
$cshowList :: [RefinementEqs] -> ShowS
showList :: [RefinementEqs] -> ShowS
Show)

instance Semigroup RefinementEqs where
  (RefinementEqs [Builder]
a [Prop]
b) <> :: RefinementEqs -> RefinementEqs -> RefinementEqs
<> (RefinementEqs [Builder]
a2 [Prop]
b2) = [Builder] -> [Prop] -> RefinementEqs
RefinementEqs ([Builder]
a [Builder] -> [Builder] -> [Builder]
forall a. Semigroup a => a -> a -> a
<> [Builder]
a2) ([Prop]
b [Prop] -> [Prop] -> [Prop]
forall a. Semigroup a => a -> a -> a
<> [Prop]
b2)

instance Monoid RefinementEqs where
  mempty :: RefinementEqs
mempty = [Builder] -> [Prop] -> RefinementEqs
RefinementEqs [Builder]
forall a. Monoid a => a
mempty [Prop]
forall a. Monoid a => a
mempty

flattenBufs :: SMTCex -> Maybe SMTCex
flattenBufs :: SMTCex -> Maybe SMTCex
flattenBufs SMTCex
cex = do
  Map (Expr 'Buf) BufModel
bs <- (BufModel -> Maybe BufModel)
-> Map (Expr 'Buf) BufModel -> Maybe (Map (Expr 'Buf) BufModel)
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> Map (Expr 'Buf) a -> m (Map (Expr 'Buf) b)
mapM BufModel -> Maybe BufModel
collapse SMTCex
cex.buffers
  SMTCex -> Maybe SMTCex
forall a. a -> Maybe a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (SMTCex -> Maybe SMTCex) -> SMTCex -> Maybe SMTCex
forall a b. (a -> b) -> a -> b
$ SMTCex
cex{ $sel:buffers:SMTCex :: Map (Expr 'Buf) BufModel
buffers = Map (Expr 'Buf) BufModel
bs }

-- | Attempts to collapse a compressed buffer representation down to a flattened one
collapse :: BufModel -> Maybe BufModel
collapse :: BufModel -> Maybe BufModel
collapse BufModel
model = case BufModel -> Maybe (Expr 'Buf)
toBuf BufModel
model of
  Just (ConcreteBuf ByteString
b) -> BufModel -> Maybe BufModel
forall a. a -> Maybe a
Just (BufModel -> Maybe BufModel) -> BufModel -> Maybe BufModel
forall a b. (a -> b) -> a -> b
$ ByteString -> BufModel
Flat ByteString
b
  Maybe (Expr 'Buf)
_ -> Maybe BufModel
forall a. Maybe a
Nothing
  where
    toBuf :: BufModel -> Maybe (Expr 'Buf)
toBuf (Comp (Base Word8
b W256
sz)) | W256
sz W256 -> W256 -> Bool
forall a. Ord a => a -> a -> Bool
<= W256
120_000_000 = Expr 'Buf -> Maybe (Expr 'Buf)
forall a. a -> Maybe a
Just (Expr 'Buf -> Maybe (Expr 'Buf))
-> (ByteString -> Expr 'Buf) -> ByteString -> Maybe (Expr 'Buf)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ByteString -> Expr 'Buf
ConcreteBuf (ByteString -> Maybe (Expr 'Buf))
-> ByteString -> Maybe (Expr 'Buf)
forall a b. (a -> b) -> a -> b
$ Int -> Word8 -> ByteString
BS.replicate (W256 -> Int
forall target source.
(HasCallStack, TryFrom source target, Show source, Typeable source,
 Typeable target) =>
source -> target
unsafeInto W256
sz) Word8
b
    toBuf (Comp (Write Word8
b W256
idx CompressedBuf
next)) = (Expr 'Buf -> Expr 'Buf) -> Maybe (Expr 'Buf) -> Maybe (Expr 'Buf)
forall a b. (a -> b) -> Maybe a -> Maybe b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (Expr 'EWord -> Expr 'Byte -> Expr 'Buf -> Expr 'Buf
writeByte (W256 -> Expr 'EWord
Lit W256
idx) (Word8 -> Expr 'Byte
LitByte Word8
b)) (BufModel -> Maybe (Expr 'Buf)
toBuf (BufModel -> Maybe (Expr 'Buf)) -> BufModel -> Maybe (Expr 'Buf)
forall a b. (a -> b) -> a -> b
$ CompressedBuf -> BufModel
Comp CompressedBuf
next)
    toBuf (Flat ByteString
b) = Expr 'Buf -> Maybe (Expr 'Buf)
forall a. a -> Maybe a
Just (Expr 'Buf -> Maybe (Expr 'Buf))
-> (ByteString -> Expr 'Buf) -> ByteString -> Maybe (Expr 'Buf)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ByteString -> Expr 'Buf
ConcreteBuf (ByteString -> Maybe (Expr 'Buf))
-> ByteString -> Maybe (Expr 'Buf)
forall a b. (a -> b) -> a -> b
$ ByteString
b
    toBuf BufModel
_ = Maybe (Expr 'Buf)
forall a. Maybe a
Nothing

getVar :: SMTCex -> TS.Text -> W256
getVar :: SMTCex -> Text -> W256
getVar SMTCex
cex Text
name = Maybe W256 -> W256
forall a. HasCallStack => Maybe a -> a
fromJust (Maybe W256 -> W256) -> Maybe W256 -> W256
forall a b. (a -> b) -> a -> b
$ Expr 'EWord -> Map (Expr 'EWord) W256 -> Maybe W256
forall k a. Ord k => k -> Map k a -> Maybe a
Map.lookup (Text -> Expr 'EWord
Var Text
name) SMTCex
cex.vars

data SMT2 = SMT2 [Builder] RefinementEqs CexVars [Prop]
  deriving (SMT2 -> SMT2 -> Bool
(SMT2 -> SMT2 -> Bool) -> (SMT2 -> SMT2 -> Bool) -> Eq SMT2
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
$c== :: SMT2 -> SMT2 -> Bool
== :: SMT2 -> SMT2 -> Bool
$c/= :: SMT2 -> SMT2 -> Bool
/= :: SMT2 -> SMT2 -> Bool
Eq, Int -> SMT2 -> ShowS
[SMT2] -> ShowS
SMT2 -> [Char]
(Int -> SMT2 -> ShowS)
-> (SMT2 -> [Char]) -> ([SMT2] -> ShowS) -> Show SMT2
forall a.
(Int -> a -> ShowS) -> (a -> [Char]) -> ([a] -> ShowS) -> Show a
$cshowsPrec :: Int -> SMT2 -> ShowS
showsPrec :: Int -> SMT2 -> ShowS
$cshow :: SMT2 -> [Char]
show :: SMT2 -> [Char]
$cshowList :: [SMT2] -> ShowS
showList :: [SMT2] -> ShowS
Show)

instance Semigroup SMT2 where
  (SMT2 [Builder]
a (RefinementEqs [Builder]
b [Prop]
refps) CexVars
c [Prop]
d) <> :: SMT2 -> SMT2 -> SMT2
<> (SMT2 [Builder]
a2 (RefinementEqs [Builder]
b2 [Prop]
refps2) CexVars
c2 [Prop]
d2) = [Builder] -> RefinementEqs -> CexVars -> [Prop] -> SMT2
SMT2 ([Builder]
a [Builder] -> [Builder] -> [Builder]
forall a. Semigroup a => a -> a -> a
<> [Builder]
a2) ([Builder] -> [Prop] -> RefinementEqs
RefinementEqs ([Builder]
b [Builder] -> [Builder] -> [Builder]
forall a. Semigroup a => a -> a -> a
<> [Builder]
b2) ([Prop]
refps [Prop] -> [Prop] -> [Prop]
forall a. Semigroup a => a -> a -> a
<> [Prop]
refps2)) (CexVars
c CexVars -> CexVars -> CexVars
forall a. Semigroup a => a -> a -> a
<> CexVars
c2) ([Prop]
d [Prop] -> [Prop] -> [Prop]
forall a. Semigroup a => a -> a -> a
<> [Prop]
d2)

instance Monoid SMT2 where
  mempty :: SMT2
mempty = [Builder] -> RefinementEqs -> CexVars -> [Prop] -> SMT2
SMT2 [Builder]
forall a. Monoid a => a
mempty RefinementEqs
forall a. Monoid a => a
mempty CexVars
forall a. Monoid a => a
mempty [Prop]
forall a. Monoid a => a
mempty

formatSMT2 :: SMT2 -> Text
formatSMT2 :: SMT2 -> Text
formatSMT2 (SMT2 [Builder]
ls RefinementEqs
_ CexVars
_ [Prop]
ps) = Text
expr Text -> Text -> Text
forall a. Semigroup a => a -> a -> a
<> Text
smt2
 where
 expr :: Text
expr = [Text] -> Text
T.concat [Char -> Text
T.singleton Char
';', HasCallStack => Text -> Text -> Text -> Text
Text -> Text -> Text -> Text
T.replace Text
"\n" Text
"\n;" (Text -> Text) -> Text -> Text
forall a b. (a -> b) -> a -> b
$ [Char] -> Text
T.pack ([Char] -> Text) -> (Text -> [Char]) -> Text -> Text
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Text -> [Char]
TS.unpack (Text -> Text) -> Text -> Text
forall a b. (a -> b) -> a -> b
$  [Text] -> Text
TS.unlines ((Prop -> Text) -> [Prop] -> [Text]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Prop -> Text
formatProp [Prop]
ps)]
 smt2 :: Text
smt2 = [Text] -> Text
T.unlines ((Builder -> Text) -> [Builder] -> [Text]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Builder -> Text
toLazyText [Builder]
ls)

-- | Reads all intermediate variables from the builder state and produces SMT declaring them as constants
declareIntermediates :: BufEnv -> StoreEnv -> SMT2
declareIntermediates :: BufEnv -> StoreEnv -> SMT2
declareIntermediates BufEnv
bufs StoreEnv
stores =
  let encSs :: Map Int SMT2
encSs = (Int -> Expr 'Storage -> SMT2) -> StoreEnv -> Map Int SMT2
forall k a b. (k -> a -> b) -> Map k a -> Map k b
Map.mapWithKey Int -> Expr 'Storage -> SMT2
forall {p} {a :: EType}. Show p => p -> Expr a -> SMT2
encodeStore StoreEnv
stores
      encBs :: Map Int SMT2
encBs = (Int -> Expr 'Buf -> SMT2) -> BufEnv -> Map Int SMT2
forall k a b. (k -> a -> b) -> Map k a -> Map k b
Map.mapWithKey Int -> Expr 'Buf -> SMT2
encodeBuf BufEnv
bufs
      sorted :: [(Int, SMT2)]
sorted = ((Int, SMT2) -> (Int, SMT2) -> Ordering)
-> [(Int, SMT2)] -> [(Int, SMT2)]
forall a. (a -> a -> Ordering) -> [a] -> [a]
List.sortBy (Int, SMT2) -> (Int, SMT2) -> Ordering
forall {a} {b} {b}. Ord a => (a, b) -> (a, b) -> Ordering
compareFst ([(Int, SMT2)] -> [(Int, SMT2)]) -> [(Int, SMT2)] -> [(Int, SMT2)]
forall a b. (a -> b) -> a -> b
$ Map Int SMT2 -> [(Int, SMT2)]
forall k a. Map k a -> [(k, a)]
Map.toList (Map Int SMT2 -> [(Int, SMT2)]) -> Map Int SMT2 -> [(Int, SMT2)]
forall a b. (a -> b) -> a -> b
$ Map Int SMT2
encSs Map Int SMT2 -> Map Int SMT2 -> Map Int SMT2
forall a. Semigroup a => a -> a -> a
<> Map Int SMT2
encBs
      decls :: [SMT2]
decls = ((Int, SMT2) -> SMT2) -> [(Int, SMT2)] -> [SMT2]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (Int, SMT2) -> SMT2
forall a b. (a, b) -> b
snd [(Int, SMT2)]
sorted
      smt2 :: [SMT2]
smt2 = ([Builder] -> RefinementEqs -> CexVars -> [Prop] -> SMT2
SMT2 [Text -> Builder
fromText Text
"; intermediate buffers & stores"] RefinementEqs
forall a. Monoid a => a
mempty CexVars
forall a. Monoid a => a
mempty [Prop]
forall a. Monoid a => a
mempty)SMT2 -> [SMT2] -> [SMT2]
forall a. a -> [a] -> [a]
:[SMT2]
decls
  in  (SMT2 -> SMT2 -> SMT2) -> SMT2 -> [SMT2] -> SMT2
forall a b. (a -> b -> b) -> b -> [a] -> b
forall (t :: * -> *) a b.
Foldable t =>
(a -> b -> b) -> b -> t a -> b
foldr SMT2 -> SMT2 -> SMT2
forall a. Semigroup a => a -> a -> a
(<>) ([Builder] -> RefinementEqs -> CexVars -> [Prop] -> SMT2
SMT2[Builder
""] RefinementEqs
forall a. Monoid a => a
mempty CexVars
forall a. Monoid a => a
mempty [Prop]
forall a. Monoid a => a
mempty) [SMT2]
smt2
  where
    compareFst :: (a, b) -> (a, b) -> Ordering
compareFst (a
l, b
_) (a
r, b
_) = a -> a -> Ordering
forall a. Ord a => a -> a -> Ordering
compare a
l a
r
    encodeBuf :: Int -> Expr 'Buf -> SMT2
encodeBuf Int
n Expr 'Buf
expr =
      [Builder] -> RefinementEqs -> CexVars -> [Prop] -> SMT2
SMT2 [Builder
"(define-fun buf" Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> ([Char] -> Builder
fromString ([Char] -> Builder) -> (Int -> [Char]) -> Int -> Builder
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Int -> [Char]
forall a. Show a => a -> [Char]
show (Int -> Builder) -> Int -> Builder
forall a b. (a -> b) -> a -> b
$ Int
n) Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
"() Buf " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Expr 'Buf -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'Buf
expr Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")\n"]  RefinementEqs
forall a. Monoid a => a
mempty CexVars
forall a. Monoid a => a
mempty [Prop]
forall a. Monoid a => a
mempty SMT2 -> SMT2 -> SMT2
forall a. Semigroup a => a -> a -> a
<> Int -> Expr 'Buf -> SMT2
encodeBufLen Int
n Expr 'Buf
expr
    encodeBufLen :: Int -> Expr 'Buf -> SMT2
encodeBufLen Int
n Expr 'Buf
expr =
      [Builder] -> RefinementEqs -> CexVars -> [Prop] -> SMT2
SMT2 [Builder
"(define-fun buf" Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> ([Char] -> Builder
fromString ([Char] -> Builder) -> (Int -> [Char]) -> Int -> Builder
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Int -> [Char]
forall a. Show a => a -> [Char]
show (Int -> Builder) -> Int -> Builder
forall a b. (a -> b) -> a -> b
$ Int
n) Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<>Builder
"_length () (_ BitVec 256) " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Expr 'EWord -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT (BufEnv -> Bool -> Expr 'Buf -> Expr 'EWord
bufLengthEnv BufEnv
bufs Bool
True Expr 'Buf
expr) Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"] RefinementEqs
forall a. Monoid a => a
mempty CexVars
forall a. Monoid a => a
mempty [Prop]
forall a. Monoid a => a
mempty
    encodeStore :: p -> Expr a -> SMT2
encodeStore p
n Expr a
expr =
      [Builder] -> RefinementEqs -> CexVars -> [Prop] -> SMT2
SMT2 [Builder
"(define-fun store" Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> ([Char] -> Builder
fromString ([Char] -> Builder) -> (p -> [Char]) -> p -> Builder
forall b c a. (b -> c) -> (a -> b) -> a -> c
. p -> [Char]
forall a. Show a => a -> [Char]
show (p -> Builder) -> p -> Builder
forall a b. (a -> b) -> a -> b
$ p
n) Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
" () Storage " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Expr a -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr a
expr Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"] RefinementEqs
forall a. Monoid a => a
mempty CexVars
forall a. Monoid a => a
mempty [Prop]
forall a. Monoid a => a
mempty

data AbstState = AbstState
  { AbstState -> Map (Expr 'EWord) Int
words :: Map (Expr EWord) Int
  , AbstState -> Int
count :: Int
  }
  deriving (Int -> AbstState -> ShowS
[AbstState] -> ShowS
AbstState -> [Char]
(Int -> AbstState -> ShowS)
-> (AbstState -> [Char])
-> ([AbstState] -> ShowS)
-> Show AbstState
forall a.
(Int -> a -> ShowS) -> (a -> [Char]) -> ([a] -> ShowS) -> Show a
$cshowsPrec :: Int -> AbstState -> ShowS
showsPrec :: Int -> AbstState -> ShowS
$cshow :: AbstState -> [Char]
show :: AbstState -> [Char]
$cshowList :: [AbstState] -> ShowS
showList :: [AbstState] -> ShowS
Show)

abstractAwayProps :: Config -> [Prop] -> ([Prop], AbstState)
abstractAwayProps :: Config -> [Prop] -> ([Prop], AbstState)
abstractAwayProps Config
conf [Prop]
ps = State AbstState [Prop] -> AbstState -> ([Prop], AbstState)
forall s a. State s a -> s -> (a, s)
runState ((Prop -> StateT AbstState Identity Prop)
-> [Prop] -> State AbstState [Prop]
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
forall (m :: * -> *) a b. Monad m => (a -> m b) -> [a] -> m [b]
mapM Prop -> StateT AbstState Identity Prop
abstrAway [Prop]
ps) (Map (Expr 'EWord) Int -> Int -> AbstState
AbstState Map (Expr 'EWord) Int
forall a. Monoid a => a
mempty Int
0)
  where
    abstrAway :: Prop -> State AbstState Prop
    abstrAway :: Prop -> StateT AbstState Identity Prop
abstrAway Prop
prop = (forall (a :: EType). Expr a -> StateT AbstState Identity (Expr a))
-> Prop -> StateT AbstState Identity Prop
forall (m :: * -> *).
Monad m =>
(forall (a :: EType). Expr a -> m (Expr a)) -> Prop -> m Prop
mapPropM Expr a -> State AbstState (Expr a)
forall (a :: EType). Expr a -> StateT AbstState Identity (Expr a)
go Prop
prop
    go :: Expr a -> State AbstState (Expr a)
    go :: forall (a :: EType). Expr a -> StateT AbstState Identity (Expr a)
go Expr a
x = case Expr a
x of
        e :: Expr a
e@(Mod{})       | Config
conf.abstRefineArith  -> Expr 'EWord -> StateT AbstState Identity (Expr 'EWord)
forall {m :: * -> *}.
MonadState AbstState m =>
Expr 'EWord -> m (Expr 'EWord)
abstrExpr Expr a
Expr 'EWord
e
        e :: Expr a
e@(SMod{})      | Config
conf.abstRefineArith  -> Expr 'EWord -> StateT AbstState Identity (Expr 'EWord)
forall {m :: * -> *}.
MonadState AbstState m =>
Expr 'EWord -> m (Expr 'EWord)
abstrExpr Expr a
Expr 'EWord
e
        e :: Expr a
e@(MulMod{})    | Config
conf.abstRefineArith  -> Expr 'EWord -> StateT AbstState Identity (Expr 'EWord)
forall {m :: * -> *}.
MonadState AbstState m =>
Expr 'EWord -> m (Expr 'EWord)
abstrExpr Expr a
Expr 'EWord
e
        e :: Expr a
e@(AddMod{})    | Config
conf.abstRefineArith  -> Expr 'EWord -> StateT AbstState Identity (Expr 'EWord)
forall {m :: * -> *}.
MonadState AbstState m =>
Expr 'EWord -> m (Expr 'EWord)
abstrExpr Expr a
Expr 'EWord
e
        e :: Expr a
e@(Mul{})       | Config
conf.abstRefineArith  -> Expr 'EWord -> StateT AbstState Identity (Expr 'EWord)
forall {m :: * -> *}.
MonadState AbstState m =>
Expr 'EWord -> m (Expr 'EWord)
abstrExpr Expr a
Expr 'EWord
e
        e :: Expr a
e@(Div{})       | Config
conf.abstRefineArith  -> Expr 'EWord -> StateT AbstState Identity (Expr 'EWord)
forall {m :: * -> *}.
MonadState AbstState m =>
Expr 'EWord -> m (Expr 'EWord)
abstrExpr Expr a
Expr 'EWord
e
        e :: Expr a
e@(SDiv {})     | Config
conf.abstRefineArith  -> Expr 'EWord -> StateT AbstState Identity (Expr 'EWord)
forall {m :: * -> *}.
MonadState AbstState m =>
Expr 'EWord -> m (Expr 'EWord)
abstrExpr Expr a
Expr 'EWord
e
        e :: Expr a
e@(ReadWord {}) | Config
conf.abstRefineMem -> Expr 'EWord -> StateT AbstState Identity (Expr 'EWord)
forall {m :: * -> *}.
MonadState AbstState m =>
Expr 'EWord -> m (Expr 'EWord)
abstrExpr Expr a
Expr 'EWord
e
        Expr a
e -> Expr a -> State AbstState (Expr a)
forall a. a -> StateT AbstState Identity a
forall (f :: * -> *) a. Applicative f => a -> f a
pure Expr a
e
        where
            abstrExpr :: Expr 'EWord -> m (Expr 'EWord)
abstrExpr Expr 'EWord
e = do
              AbstState
s <- m AbstState
forall s (m :: * -> *). MonadState s m => m s
get
              case Expr 'EWord -> Map (Expr 'EWord) Int -> Maybe Int
forall k a. Ord k => k -> Map k a -> Maybe a
Map.lookup Expr 'EWord
e AbstState
s.words of
                Just Int
v -> Expr 'EWord -> m (Expr 'EWord)
forall a. a -> m a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Text -> Expr 'EWord
Var ([Char] -> Text
TS.pack ([Char]
"abst_" [Char] -> ShowS
forall a. [a] -> [a] -> [a]
++ Int -> [Char]
forall a. Show a => a -> [Char]
show Int
v)))
                Maybe Int
Nothing -> do
                  let
                    next :: Int
next = AbstState
s.count
                    bs' :: Map (Expr 'EWord) Int
bs' = Expr 'EWord
-> Int -> Map (Expr 'EWord) Int -> Map (Expr 'EWord) Int
forall k a. Ord k => k -> a -> Map k a -> Map k a
Map.insert Expr 'EWord
e Int
next AbstState
s.words
                  AbstState -> m ()
forall s (m :: * -> *). MonadState s m => s -> m ()
put (AbstState -> m ()) -> AbstState -> m ()
forall a b. (a -> b) -> a -> b
$ AbstState
s{$sel:words:AbstState :: Map (Expr 'EWord) Int
words=Map (Expr 'EWord) Int
bs', $sel:count:AbstState :: Int
count=Int
nextInt -> Int -> Int
forall a. Num a => a -> a -> a
+Int
1}
                  Expr 'EWord -> m (Expr 'EWord)
forall a. a -> m a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Expr 'EWord -> m (Expr 'EWord)) -> Expr 'EWord -> m (Expr 'EWord)
forall a b. (a -> b) -> a -> b
$ Text -> Expr 'EWord
Var ([Char] -> Text
TS.pack ([Char]
"abst_" [Char] -> ShowS
forall a. [a] -> [a] -> [a]
++ Int -> [Char]
forall a. Show a => a -> [Char]
show Int
next))

smt2Line :: Builder -> SMT2
smt2Line :: Builder -> SMT2
smt2Line Builder
txt = [Builder] -> RefinementEqs -> CexVars -> [Prop] -> SMT2
SMT2 [Builder
txt] RefinementEqs
forall a. Monoid a => a
mempty CexVars
forall a. Monoid a => a
mempty [Prop]
forall a. Monoid a => a
mempty

assertProps :: Config -> [Prop] -> SMT2
-- simplify to rewrite sload/sstore combos
-- notice: it is VERY important not to concretize, because Keccak assumptions
--         will be generated by assertPropsNoSimp, and that needs unconcretized Props
assertProps :: Config -> [Prop] -> SMT2
assertProps Config
conf [Prop]
ps = Config -> [Prop] -> SMT2
assertPropsNoSimp Config
conf ([Prop] -> [Prop]
decompose ([Prop] -> [Prop]) -> ([Prop] -> [Prop]) -> [Prop] -> [Prop]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Prop] -> [Prop]
Expr.simplifyProps ([Prop] -> [Prop]) -> [Prop] -> [Prop]
forall a b. (a -> b) -> a -> b
$ [Prop]
ps)
  where
    decompose :: [Prop] -> [Prop]
    decompose :: [Prop] -> [Prop]
decompose [Prop]
props = [Prop] -> Maybe [Prop] -> [Prop]
forall a. a -> Maybe a -> a
fromMaybe [Prop]
props ((Prop -> Maybe Prop) -> [Prop] -> Maybe [Prop]
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
forall (m :: * -> *) a b. Monad m => (a -> m b) -> [a] -> m [b]
mapM ((forall (a :: EType). Expr a -> Maybe (Expr a))
-> Prop -> Maybe Prop
forall (m :: * -> *).
Monad m =>
(forall (a :: EType). Expr a -> m (Expr a)) -> Prop -> m Prop
mapPropM Expr a -> Maybe (Expr a)
forall (a :: EType). Expr a -> Maybe (Expr a)
Expr.decomposeStorage) [Prop]
props)

-- Note: we need a version that does NOT call simplify,
-- because we make use of it to verify the correctness of our simplification
-- passes through property-based testing.
assertPropsNoSimp :: Config -> [Prop] -> SMT2
assertPropsNoSimp :: Config -> [Prop] -> SMT2
assertPropsNoSimp Config
config [Prop]
psPreConc =
  let encs :: [Builder]
encs = (Prop -> Builder) -> [Prop] -> [Builder]
forall a b. (a -> b) -> [a] -> [b]
map Prop -> Builder
propToSMT [Prop]
psElimAbst
      abstSMT :: [Builder]
abstSMT = (Prop -> Builder) -> [Prop] -> [Builder]
forall a b. (a -> b) -> [a] -> [b]
map Prop -> Builder
propToSMT [Prop]
abstProps
      intermediates :: SMT2
intermediates = BufEnv -> StoreEnv -> SMT2
declareIntermediates BufEnv
bufs StoreEnv
stores in
  SMT2
prelude
  SMT2 -> SMT2 -> SMT2
forall a. Semigroup a => a -> a -> a
<> ([Builder] -> SMT2
declareAbstractStores [Builder]
abstractStores)
  SMT2 -> SMT2 -> SMT2
forall a. Semigroup a => a -> a -> a
<> Builder -> SMT2
smt2Line Builder
""
  SMT2 -> SMT2 -> SMT2
forall a. Semigroup a => a -> a -> a
<> ([Builder] -> SMT2
declareAddrs [Builder]
addresses)
  SMT2 -> SMT2 -> SMT2
forall a. Semigroup a => a -> a -> a
<> Builder -> SMT2
smt2Line Builder
""
  SMT2 -> SMT2 -> SMT2
forall a. Semigroup a => a -> a -> a
<> ([Prop] -> BufEnv -> StoreEnv -> SMT2
declareBufs [Prop]
toDeclarePsElim BufEnv
bufs StoreEnv
stores)
  SMT2 -> SMT2 -> SMT2
forall a. Semigroup a => a -> a -> a
<> Builder -> SMT2
smt2Line Builder
""
  SMT2 -> SMT2 -> SMT2
forall a. Semigroup a => a -> a -> a
<> ([Builder] -> SMT2
declareVars ([Builder] -> SMT2)
-> ([Builder] -> [Builder]) -> [Builder] -> SMT2
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Builder] -> [Builder]
forall a. Ord a => [a] -> [a]
nubOrd ([Builder] -> SMT2) -> [Builder] -> SMT2
forall a b. (a -> b) -> a -> b
$ ([Builder] -> [Builder] -> [Builder])
-> [Builder] -> [[Builder]] -> [Builder]
forall b a. (b -> a -> b) -> b -> [a] -> b
forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
foldl [Builder] -> [Builder] -> [Builder]
forall a. Semigroup a => a -> a -> a
(<>) [] [[Builder]]
allVars)
  SMT2 -> SMT2 -> SMT2
forall a. Semigroup a => a -> a -> a
<> Builder -> SMT2
smt2Line Builder
""
  SMT2 -> SMT2 -> SMT2
forall a. Semigroup a => a -> a -> a
<> ([(Builder, [Prop])] -> SMT2
declareFrameContext ([(Builder, [Prop])] -> SMT2)
-> ([(Builder, [Prop])] -> [(Builder, [Prop])])
-> [(Builder, [Prop])]
-> SMT2
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [(Builder, [Prop])] -> [(Builder, [Prop])]
forall a. Ord a => [a] -> [a]
nubOrd ([(Builder, [Prop])] -> SMT2) -> [(Builder, [Prop])] -> SMT2
forall a b. (a -> b) -> a -> b
$ ([(Builder, [Prop])] -> [(Builder, [Prop])] -> [(Builder, [Prop])])
-> [(Builder, [Prop])]
-> [[(Builder, [Prop])]]
-> [(Builder, [Prop])]
forall b a. (b -> a -> b) -> b -> [a] -> b
forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
foldl [(Builder, [Prop])] -> [(Builder, [Prop])] -> [(Builder, [Prop])]
forall a. Semigroup a => a -> a -> a
(<>) [] [[(Builder, [Prop])]]
frameCtx)
  SMT2 -> SMT2 -> SMT2
forall a. Semigroup a => a -> a -> a
<> Builder -> SMT2
smt2Line Builder
""
  SMT2 -> SMT2 -> SMT2
forall a. Semigroup a => a -> a -> a
<> ([(Builder, [Prop])] -> SMT2
declareBlockContext ([(Builder, [Prop])] -> SMT2)
-> ([(Builder, [Prop])] -> [(Builder, [Prop])])
-> [(Builder, [Prop])]
-> SMT2
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [(Builder, [Prop])] -> [(Builder, [Prop])]
forall a. Ord a => [a] -> [a]
nubOrd ([(Builder, [Prop])] -> SMT2) -> [(Builder, [Prop])] -> SMT2
forall a b. (a -> b) -> a -> b
$ ([(Builder, [Prop])] -> [(Builder, [Prop])] -> [(Builder, [Prop])])
-> [(Builder, [Prop])]
-> [[(Builder, [Prop])]]
-> [(Builder, [Prop])]
forall b a. (b -> a -> b) -> b -> [a] -> b
forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
foldl [(Builder, [Prop])] -> [(Builder, [Prop])] -> [(Builder, [Prop])]
forall a. Semigroup a => a -> a -> a
(<>) [] [[(Builder, [Prop])]]
blockCtx)
  SMT2 -> SMT2 -> SMT2
forall a. Semigroup a => a -> a -> a
<> Builder -> SMT2
smt2Line Builder
""
  SMT2 -> SMT2 -> SMT2
forall a. Semigroup a => a -> a -> a
<> SMT2
intermediates
  SMT2 -> SMT2 -> SMT2
forall a. Semigroup a => a -> a -> a
<> Builder -> SMT2
smt2Line Builder
""
  SMT2 -> SMT2 -> SMT2
forall a. Semigroup a => a -> a -> a
<> SMT2
keccakAssertions
  SMT2 -> SMT2 -> SMT2
forall a. Semigroup a => a -> a -> a
<> SMT2
readAssumes
  SMT2 -> SMT2 -> SMT2
forall a. Semigroup a => a -> a -> a
<> Builder -> SMT2
smt2Line Builder
""
  SMT2 -> SMT2 -> SMT2
forall a. Semigroup a => a -> a -> a
<> [Builder] -> RefinementEqs -> CexVars -> [Prop] -> SMT2
SMT2 ((Builder -> Builder) -> [Builder] -> [Builder]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (\Builder
p -> Builder
"(assert " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
p Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")") [Builder]
encs) RefinementEqs
forall a. Monoid a => a
mempty CexVars
forall a. Monoid a => a
mempty [Prop]
forall a. Monoid a => a
mempty
  SMT2 -> SMT2 -> SMT2
forall a. Semigroup a => a -> a -> a
<> [Builder] -> RefinementEqs -> CexVars -> [Prop] -> SMT2
SMT2 [Builder]
forall a. Monoid a => a
mempty ([Builder] -> [Prop] -> RefinementEqs
RefinementEqs ((Builder -> Builder) -> [Builder] -> [Builder]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (\Builder
p -> Builder
"(assert " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
p Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")") [Builder]
abstSMT) ([Prop]
psElimAbst [Prop] -> [Prop] -> [Prop]
forall a. Semigroup a => a -> a -> a
<> [Prop]
abstProps)) CexVars
forall a. Monoid a => a
mempty [Prop]
forall a. Monoid a => a
mempty
  SMT2 -> SMT2 -> SMT2
forall a. Semigroup a => a -> a -> a
<> [Builder] -> RefinementEqs -> CexVars -> [Prop] -> SMT2
SMT2 [Builder]
forall a. Monoid a => a
mempty RefinementEqs
forall a. Monoid a => a
mempty CexVars
forall a. Monoid a => a
mempty { $sel:storeReads:CexVars :: Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord))
storeReads = Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord))
storageReads } [Prop]
forall a. Monoid a => a
mempty
  SMT2 -> SMT2 -> SMT2
forall a. Semigroup a => a -> a -> a
<> [Builder] -> RefinementEqs -> CexVars -> [Prop] -> SMT2
SMT2 [Builder]
forall a. Monoid a => a
mempty RefinementEqs
forall a. Monoid a => a
mempty CexVars
forall a. Monoid a => a
mempty [Prop]
psPreConc

  where
    ps :: [Prop]
ps = [Prop] -> [Prop]
Expr.concKeccakProps [Prop]
psPreConc
    ([Prop]
psElim, BufEnv
bufs, StoreEnv
stores) = [Prop] -> ([Prop], BufEnv, StoreEnv)
eliminateProps [Prop]
ps
    ([Prop]
psElimAbst, abst :: AbstState
abst@(AbstState Map (Expr 'EWord) Int
abstExprToInt Int
_)) = if Config
config.abstRefineArith Bool -> Bool -> Bool
|| Config
config.abstRefineMem
      then Config -> [Prop] -> ([Prop], AbstState)
abstractAwayProps Config
config [Prop]
psElim
      else ([Prop]
psElim, Map (Expr 'EWord) Int -> Int -> AbstState
AbstState Map (Expr 'EWord) Int
forall a. Monoid a => a
mempty Int
0)

    abstProps :: [Prop]
abstProps = ((Expr 'EWord, Int) -> Prop) -> [(Expr 'EWord, Int)] -> [Prop]
forall a b. (a -> b) -> [a] -> [b]
map (Expr 'EWord, Int) -> Prop
toProp (Map (Expr 'EWord) Int -> [(Expr 'EWord, Int)]
forall k a. Map k a -> [(k, a)]
Map.toList Map (Expr 'EWord) Int
abstExprToInt)
      where
      toProp :: (Expr EWord, Int) -> Prop
      toProp :: (Expr 'EWord, Int) -> Prop
toProp (Expr 'EWord
e, Int
num) = Expr 'EWord -> Expr 'EWord -> Prop
forall (a :: EType). Typeable a => Expr a -> Expr a -> Prop
PEq Expr 'EWord
e (Text -> Expr 'EWord
Var ([Char] -> Text
TS.pack ([Char]
"abst_" [Char] -> ShowS
forall a. [a] -> [a] -> [a]
++ (Int -> [Char]
forall a. Show a => a -> [Char]
show Int
num))))

    -- Props storing info that need declaration(s)
    toDeclarePs :: [Prop]
toDeclarePs     = [Prop]
ps [Prop] -> [Prop] -> [Prop]
forall a. Semigroup a => a -> a -> a
<> [Prop]
keccAssump [Prop] -> [Prop] -> [Prop]
forall a. Semigroup a => a -> a -> a
<> [Prop]
keccComp
    toDeclarePsElim :: [Prop]
toDeclarePsElim = [Prop]
psElim [Prop] -> [Prop] -> [Prop]
forall a. Semigroup a => a -> a -> a
<> [Prop]
keccAssump [Prop] -> [Prop] -> [Prop]
forall a. Semigroup a => a -> a -> a
<> [Prop]
keccComp

    -- vars, frames, and block contexts in need of declaration
    allVars :: [[Builder]]
allVars = (Prop -> [Builder]) -> [Prop] -> [[Builder]]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Prop -> [Builder]
forall a. TraversableTerm a => a -> [Builder]
referencedVars [Prop]
toDeclarePsElim [[Builder]] -> [[Builder]] -> [[Builder]]
forall a. Semigroup a => a -> a -> a
<> (Expr 'Buf -> [Builder]) -> [Expr 'Buf] -> [[Builder]]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Expr 'Buf -> [Builder]
forall a. TraversableTerm a => a -> [Builder]
referencedVars [Expr 'Buf]
bufVals [[Builder]] -> [[Builder]] -> [[Builder]]
forall a. Semigroup a => a -> a -> a
<> (Expr 'Storage -> [Builder]) -> [Expr 'Storage] -> [[Builder]]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Expr 'Storage -> [Builder]
forall a. TraversableTerm a => a -> [Builder]
referencedVars [Expr 'Storage]
storeVals [[Builder]] -> [[Builder]] -> [[Builder]]
forall a. Semigroup a => a -> a -> a
<> [AbstState -> [Builder]
abstrVars AbstState
abst]
    frameCtx :: [[(Builder, [Prop])]]
frameCtx = (Prop -> [(Builder, [Prop])]) -> [Prop] -> [[(Builder, [Prop])]]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Prop -> [(Builder, [Prop])]
forall a. TraversableTerm a => a -> [(Builder, [Prop])]
referencedFrameContext [Prop]
toDeclarePsElim [[(Builder, [Prop])]]
-> [[(Builder, [Prop])]] -> [[(Builder, [Prop])]]
forall a. Semigroup a => a -> a -> a
<> (Expr 'Buf -> [(Builder, [Prop])])
-> [Expr 'Buf] -> [[(Builder, [Prop])]]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Expr 'Buf -> [(Builder, [Prop])]
forall a. TraversableTerm a => a -> [(Builder, [Prop])]
referencedFrameContext [Expr 'Buf]
bufVals [[(Builder, [Prop])]]
-> [[(Builder, [Prop])]] -> [[(Builder, [Prop])]]
forall a. Semigroup a => a -> a -> a
<> (Expr 'Storage -> [(Builder, [Prop])])
-> [Expr 'Storage] -> [[(Builder, [Prop])]]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Expr 'Storage -> [(Builder, [Prop])]
forall a. TraversableTerm a => a -> [(Builder, [Prop])]
referencedFrameContext [Expr 'Storage]
storeVals
    blockCtx :: [[(Builder, [Prop])]]
blockCtx = (Prop -> [(Builder, [Prop])]) -> [Prop] -> [[(Builder, [Prop])]]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Prop -> [(Builder, [Prop])]
forall a. TraversableTerm a => a -> [(Builder, [Prop])]
referencedBlockContext [Prop]
toDeclarePsElim [[(Builder, [Prop])]]
-> [[(Builder, [Prop])]] -> [[(Builder, [Prop])]]
forall a. Semigroup a => a -> a -> a
<> (Expr 'Buf -> [(Builder, [Prop])])
-> [Expr 'Buf] -> [[(Builder, [Prop])]]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Expr 'Buf -> [(Builder, [Prop])]
forall a. TraversableTerm a => a -> [(Builder, [Prop])]
referencedBlockContext [Expr 'Buf]
bufVals [[(Builder, [Prop])]]
-> [[(Builder, [Prop])]] -> [[(Builder, [Prop])]]
forall a. Semigroup a => a -> a -> a
<> (Expr 'Storage -> [(Builder, [Prop])])
-> [Expr 'Storage] -> [[(Builder, [Prop])]]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Expr 'Storage -> [(Builder, [Prop])]
forall a. TraversableTerm a => a -> [(Builder, [Prop])]
referencedBlockContext [Expr 'Storage]
storeVals

    abstrVars :: AbstState -> [Builder]
    abstrVars :: AbstState -> [Builder]
abstrVars (AbstState Map (Expr 'EWord) Int
b Int
_) = ((Expr 'EWord, Int) -> Builder)
-> [(Expr 'EWord, Int)] -> [Builder]
forall a b. (a -> b) -> [a] -> [b]
map ((\Int
v->[Char] -> Builder
fromString ([Char]
"abst_" [Char] -> ShowS
forall a. [a] -> [a] -> [a]
++ Int -> [Char]
forall a. Show a => a -> [Char]
show Int
v)) (Int -> Builder)
-> ((Expr 'EWord, Int) -> Int) -> (Expr 'EWord, Int) -> Builder
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Expr 'EWord, Int) -> Int
forall a b. (a, b) -> b
snd) (Map (Expr 'EWord) Int -> [(Expr 'EWord, Int)]
forall k a. Map k a -> [(k, a)]
Map.toList Map (Expr 'EWord) Int
b)

    -- Buf, Storage, etc. declarations needed
    bufVals :: [Expr 'Buf]
bufVals = BufEnv -> [Expr 'Buf]
forall k a. Map k a -> [a]
Map.elems BufEnv
bufs
    storeVals :: [Expr 'Storage]
storeVals = StoreEnv -> [Expr 'Storage]
forall k a. Map k a -> [a]
Map.elems StoreEnv
stores
    storageReads :: Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord))
storageReads = (Set (Expr 'EWord) -> Set (Expr 'EWord) -> Set (Expr 'EWord))
-> [Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord))]
-> Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord))
forall (f :: * -> *) k a.
(Foldable f, Ord k) =>
(a -> a -> a) -> f (Map k a) -> Map k a
Map.unionsWith Set (Expr 'EWord) -> Set (Expr 'EWord) -> Set (Expr 'EWord)
forall a. Semigroup a => a -> a -> a
(<>) ([Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord))]
 -> Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord)))
-> [Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord))]
-> Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord))
forall a b. (a -> b) -> a -> b
$ (Prop -> Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord)))
-> [Prop] -> [Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord))]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Prop -> Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord))
findStorageReads [Prop]
toDeclarePs
    abstractStores :: [Builder]
abstractStores = Set Builder -> [Builder]
forall a. Set a -> [a]
Set.toList (Set Builder -> [Builder]) -> Set Builder -> [Builder]
forall a b. (a -> b) -> a -> b
$ [Set Builder] -> Set Builder
forall (f :: * -> *) a. (Foldable f, Ord a) => f (Set a) -> Set a
Set.unions ((Prop -> Set Builder) -> [Prop] -> [Set Builder]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Prop -> Set Builder
forall a. TraversableTerm a => a -> Set Builder
referencedAbstractStores [Prop]
toDeclarePs)
    addresses :: [Builder]
addresses = Set Builder -> [Builder]
forall a. Set a -> [a]
Set.toList (Set Builder -> [Builder]) -> Set Builder -> [Builder]
forall a b. (a -> b) -> a -> b
$ [Set Builder] -> Set Builder
forall (f :: * -> *) a. (Foldable f, Ord a) => f (Set a) -> Set a
Set.unions ((Prop -> Set Builder) -> [Prop] -> [Set Builder]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Prop -> Set Builder
forall a. TraversableTerm a => a -> Set Builder
referencedWAddrs [Prop]
toDeclarePs)

    -- Keccak assertions: concrete values, distance between pairs, injectivity, etc.
    --      This will make sure concrete values of Keccak are asserted, if they can be computed (i.e. can be concretized)
    keccAssump :: [Prop]
keccAssump = [Prop] -> [Expr 'Buf] -> [Expr 'Storage] -> [Prop]
keccakAssumptions [Prop]
psPreConc [Expr 'Buf]
bufVals [Expr 'Storage]
storeVals
    keccComp :: [Prop]
keccComp = [Prop] -> [Expr 'Buf] -> [Expr 'Storage] -> [Prop]
keccakCompute [Prop]
psPreConc [Expr 'Buf]
bufVals [Expr 'Storage]
storeVals
    keccakAssertions :: SMT2
keccakAssertions
      = Builder -> SMT2
smt2Line Builder
"; keccak assumptions"
      SMT2 -> SMT2 -> SMT2
forall a. Semigroup a => a -> a -> a
<> [Builder] -> RefinementEqs -> CexVars -> [Prop] -> SMT2
SMT2 ((Prop -> Builder) -> [Prop] -> [Builder]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (\Prop
p -> Builder
"(assert " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Prop -> Builder
propToSMT Prop
p Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")") [Prop]
keccAssump) RefinementEqs
forall a. Monoid a => a
mempty CexVars
forall a. Monoid a => a
mempty [Prop]
forall a. Monoid a => a
mempty
      SMT2 -> SMT2 -> SMT2
forall a. Semigroup a => a -> a -> a
<> Builder -> SMT2
smt2Line Builder
"; keccak computations"
      SMT2 -> SMT2 -> SMT2
forall a. Semigroup a => a -> a -> a
<> [Builder] -> RefinementEqs -> CexVars -> [Prop] -> SMT2
SMT2 ((Prop -> Builder) -> [Prop] -> [Builder]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (\Prop
p -> Builder
"(assert " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Prop -> Builder
propToSMT Prop
p Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")") [Prop]
keccComp) RefinementEqs
forall a. Monoid a => a
mempty CexVars
forall a. Monoid a => a
mempty [Prop]
forall a. Monoid a => a
mempty

    -- assert that reads beyond size of buffer & storage is zero
    readAssumes :: SMT2
readAssumes
      = Builder -> SMT2
smt2Line Builder
"; read assumptions"
        SMT2 -> SMT2 -> SMT2
forall a. Semigroup a => a -> a -> a
<> [Builder] -> RefinementEqs -> CexVars -> [Prop] -> SMT2
SMT2 ((Prop -> Builder) -> [Prop] -> [Builder]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (\Prop
p -> Builder
"(assert " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Prop -> Builder
propToSMT Prop
p Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")") ([Prop] -> BufEnv -> StoreEnv -> [Prop]
assertReads [Prop]
psElim BufEnv
bufs StoreEnv
stores)) RefinementEqs
forall a. Monoid a => a
mempty CexVars
forall a. Monoid a => a
mempty [Prop]
forall a. Monoid a => a
mempty

referencedAbstractStores :: TraversableTerm a => a -> Set Builder
referencedAbstractStores :: forall a. TraversableTerm a => a -> Set Builder
referencedAbstractStores a
term = (forall (b :: EType). Expr b -> Set Builder)
-> Set Builder -> a -> Set Builder
forall c.
Monoid c =>
(forall (b :: EType). Expr b -> c) -> c -> a -> c
forall a c.
(TraversableTerm a, Monoid c) =>
(forall (b :: EType). Expr b -> c) -> c -> a -> c
foldTerm Expr b -> Set Builder
forall (b :: EType). Expr b -> Set Builder
go Set Builder
forall a. Monoid a => a
mempty a
term
  where
    go :: Expr a -> Set Builder
go = \case
      AbstractStore Expr 'EAddr
s Maybe W256
idx -> Builder -> Set Builder
forall a. a -> Set a
Set.singleton (Expr 'EAddr -> Maybe W256 -> Builder
storeName Expr 'EAddr
s Maybe W256
idx)
      Expr a
_ -> Set Builder
forall a. Monoid a => a
mempty

referencedWAddrs :: TraversableTerm a => a -> Set Builder
referencedWAddrs :: forall a. TraversableTerm a => a -> Set Builder
referencedWAddrs a
term = (forall (b :: EType). Expr b -> Set Builder)
-> Set Builder -> a -> Set Builder
forall c.
Monoid c =>
(forall (b :: EType). Expr b -> c) -> c -> a -> c
forall a c.
(TraversableTerm a, Monoid c) =>
(forall (b :: EType). Expr b -> c) -> c -> a -> c
foldTerm Expr b -> Set Builder
forall (b :: EType). Expr b -> Set Builder
go Set Builder
forall a. Monoid a => a
mempty a
term
  where
    go :: Expr a -> Set Builder
go = \case
      WAddr(a :: Expr 'EAddr
a@(SymAddr Text
_)) -> Builder -> Set Builder
forall a. a -> Set a
Set.singleton (Expr 'EAddr -> Builder
formatEAddr Expr 'EAddr
a)
      Expr a
_ -> Set Builder
forall a. Monoid a => a
mempty

referencedBufs :: TraversableTerm a => a -> [Builder]
referencedBufs :: forall a. TraversableTerm a => a -> [Builder]
referencedBufs a
expr = [Builder] -> [Builder]
forall a. Ord a => [a] -> [a]
nubOrd ([Builder] -> [Builder]) -> [Builder] -> [Builder]
forall a b. (a -> b) -> a -> b
$ (forall (b :: EType). Expr b -> [Builder])
-> [Builder] -> a -> [Builder]
forall c.
Monoid c =>
(forall (b :: EType). Expr b -> c) -> c -> a -> c
forall a c.
(TraversableTerm a, Monoid c) =>
(forall (b :: EType). Expr b -> c) -> c -> a -> c
foldTerm Expr b -> [Builder]
forall (b :: EType). Expr b -> [Builder]
go [] a
expr
  where
    go :: Expr a -> [Builder]
    go :: forall (b :: EType). Expr b -> [Builder]
go = \case
      AbstractBuf Text
s -> [Text -> Builder
fromText Text
s]
      Expr a
_ -> []

referencedVars :: TraversableTerm a => a -> [Builder]
referencedVars :: forall a. TraversableTerm a => a -> [Builder]
referencedVars a
expr = [Builder] -> [Builder]
forall a. Ord a => [a] -> [a]
nubOrd ([Builder] -> [Builder]) -> [Builder] -> [Builder]
forall a b. (a -> b) -> a -> b
$ (forall (b :: EType). Expr b -> [Builder])
-> [Builder] -> a -> [Builder]
forall c.
Monoid c =>
(forall (b :: EType). Expr b -> c) -> c -> a -> c
forall a c.
(TraversableTerm a, Monoid c) =>
(forall (b :: EType). Expr b -> c) -> c -> a -> c
foldTerm Expr b -> [Builder]
forall (b :: EType). Expr b -> [Builder]
go [] a
expr
  where
    go :: Expr a -> [Builder]
    go :: forall (b :: EType). Expr b -> [Builder]
go = \case
      Var Text
s -> [Text -> Builder
fromText Text
s]
      Expr a
_ -> []

referencedFrameContext :: TraversableTerm a => a -> [(Builder, [Prop])]
referencedFrameContext :: forall a. TraversableTerm a => a -> [(Builder, [Prop])]
referencedFrameContext a
expr = [(Builder, [Prop])] -> [(Builder, [Prop])]
forall a. Ord a => [a] -> [a]
nubOrd ([(Builder, [Prop])] -> [(Builder, [Prop])])
-> [(Builder, [Prop])] -> [(Builder, [Prop])]
forall a b. (a -> b) -> a -> b
$ (forall (b :: EType). Expr b -> [(Builder, [Prop])])
-> [(Builder, [Prop])] -> a -> [(Builder, [Prop])]
forall c.
Monoid c =>
(forall (b :: EType). Expr b -> c) -> c -> a -> c
forall a c.
(TraversableTerm a, Monoid c) =>
(forall (b :: EType). Expr b -> c) -> c -> a -> c
foldTerm Expr b -> [(Builder, [Prop])]
forall (b :: EType). Expr b -> [(Builder, [Prop])]
go [] a
expr
  where
    go :: Expr a -> [(Builder, [Prop])]
    go :: forall (b :: EType). Expr b -> [(Builder, [Prop])]
go = \case
      Expr a
TxValue -> [([Char] -> Builder
fromString [Char]
"txvalue", [])]
      v :: Expr a
v@(Balance Expr 'EAddr
a) -> [([Char] -> Builder
fromString [Char]
"balance_" Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Expr 'EAddr -> Builder
formatEAddr Expr 'EAddr
a, [Expr 'EWord -> Expr 'EWord -> Prop
PLT Expr a
Expr 'EWord
v (W256 -> Expr 'EWord
Lit (W256 -> Expr 'EWord) -> W256 -> Expr 'EWord
forall a b. (a -> b) -> a -> b
$ W256
2 W256 -> Int -> W256
forall a b. (Num a, Integral b) => a -> b -> a
^ (Int
96 :: Int))])]
      Gas {} -> [Char] -> [(Builder, [Prop])]
forall a. HasCallStack => [Char] -> a
internalError [Char]
"TODO: GAS"
      Expr a
_ -> []

referencedBlockContext :: TraversableTerm a => a -> [(Builder, [Prop])]
referencedBlockContext :: forall a. TraversableTerm a => a -> [(Builder, [Prop])]
referencedBlockContext a
expr = [(Builder, [Prop])] -> [(Builder, [Prop])]
forall a. Ord a => [a] -> [a]
nubOrd ([(Builder, [Prop])] -> [(Builder, [Prop])])
-> [(Builder, [Prop])] -> [(Builder, [Prop])]
forall a b. (a -> b) -> a -> b
$ (forall (b :: EType). Expr b -> [(Builder, [Prop])])
-> [(Builder, [Prop])] -> a -> [(Builder, [Prop])]
forall c.
Monoid c =>
(forall (b :: EType). Expr b -> c) -> c -> a -> c
forall a c.
(TraversableTerm a, Monoid c) =>
(forall (b :: EType). Expr b -> c) -> c -> a -> c
foldTerm Expr b -> [(Builder, [Prop])]
forall (b :: EType). Expr b -> [(Builder, [Prop])]
go [] a
expr
  where
    go :: Expr a -> [(Builder, [Prop])]
    go :: forall (b :: EType). Expr b -> [(Builder, [Prop])]
go = \case
      Expr a
Origin -> [(Builder
"origin", [Int -> Expr 'EWord -> Prop
inRange Int
160 Expr 'EWord
Origin])]
      Expr a
Coinbase -> [(Builder
"coinbase", [Int -> Expr 'EWord -> Prop
inRange Int
160 Expr 'EWord
Coinbase])]
      Expr a
Timestamp -> [(Builder
"timestamp", [])]
      Expr a
BlockNumber -> [(Builder
"blocknumber", [])]
      Expr a
PrevRandao -> [(Builder
"prevrandao", [])]
      Expr a
GasLimit -> [(Builder
"gaslimit", [])]
      Expr a
ChainId -> [(Builder
"chainid", [])]
      Expr a
BaseFee -> [(Builder
"basefee", [])]
      Expr a
_ -> []

-- | This function overapproximates the reads from the abstract
-- storage. Potentially, it can return locations that do not read a
-- slot directly from the abstract store but from subsequent writes on
-- the store (e.g, SLoad addr idx (SStore addr idx val AbstractStore)).
-- However, we expect that most of such reads will have been
-- simplified away.
findStorageReads :: Prop -> Map (Expr EAddr, Maybe W256) (Set (Expr EWord))
findStorageReads :: Prop -> Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord))
findStorageReads Prop
p = (Set (Expr 'EWord) -> Set (Expr 'EWord) -> Set (Expr 'EWord))
-> [((Expr 'EAddr, Maybe W256), Set (Expr 'EWord))]
-> Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord))
forall k a. Ord k => (a -> a -> a) -> [(k, a)] -> Map k a
Map.fromListWith Set (Expr 'EWord) -> Set (Expr 'EWord) -> Set (Expr 'EWord)
forall a. Semigroup a => a -> a -> a
(<>) ([((Expr 'EAddr, Maybe W256), Set (Expr 'EWord))]
 -> Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord)))
-> [((Expr 'EAddr, Maybe W256), Set (Expr 'EWord))]
-> Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord))
forall a b. (a -> b) -> a -> b
$ (forall (a :: EType).
 Expr a -> [((Expr 'EAddr, Maybe W256), Set (Expr 'EWord))])
-> [((Expr 'EAddr, Maybe W256), Set (Expr 'EWord))]
-> Prop
-> [((Expr 'EAddr, Maybe W256), Set (Expr 'EWord))]
forall b.
Monoid b =>
(forall (a :: EType). Expr a -> b) -> b -> Prop -> b
foldProp Expr a -> [((Expr 'EAddr, Maybe W256), Set (Expr 'EWord))]
forall (a :: EType).
Expr a -> [((Expr 'EAddr, Maybe W256), Set (Expr 'EWord))]
go [((Expr 'EAddr, Maybe W256), Set (Expr 'EWord))]
forall a. Monoid a => a
mempty Prop
p
  where
    go :: Expr a -> [((Expr EAddr, Maybe W256), Set (Expr EWord))]
    go :: forall (a :: EType).
Expr a -> [((Expr 'EAddr, Maybe W256), Set (Expr 'EWord))]
go = \case
      SLoad Expr 'EWord
slot Expr 'Storage
store ->
        [((Expr 'EAddr -> Maybe (Expr 'EAddr) -> Expr 'EAddr
forall a. a -> Maybe a -> a
fromMaybe ([Char] -> Expr 'EAddr
forall a. HasCallStack => [Char] -> a
internalError ([Char] -> Expr 'EAddr) -> [Char] -> Expr 'EAddr
forall a b. (a -> b) -> a -> b
$ [Char]
"could not extract address from: " [Char] -> ShowS
forall a. Semigroup a => a -> a -> a
<> Expr 'Storage -> [Char]
forall a. Show a => a -> [Char]
show Expr 'Storage
store) (Expr 'Storage -> Maybe (Expr 'EAddr)
Expr.getAddr Expr 'Storage
store), Expr 'Storage -> Maybe W256
Expr.getLogicalIdx Expr 'Storage
store), Expr 'EWord -> Set (Expr 'EWord)
forall a. a -> Set a
Set.singleton Expr 'EWord
slot) | (forall (a :: EType). Expr a -> Bool) -> Expr 'Storage -> Bool
forall (b :: EType).
(forall (a :: EType). Expr a -> Bool) -> Expr b -> Bool
containsNode Expr a -> Bool
forall (a :: EType). Expr a -> Bool
isAbstractStore Expr 'Storage
store]
      Expr a
_ -> []

    isAbstractStore :: Expr a -> Bool
isAbstractStore (AbstractStore Expr 'EAddr
_ Maybe W256
_) = Bool
True
    isAbstractStore Expr a
_ = Bool
False

findBufferAccess :: TraversableTerm a => [a] -> [(Expr EWord, Expr EWord, Expr Buf)]
findBufferAccess :: forall a.
TraversableTerm a =>
[a] -> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
findBufferAccess = ([(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
 -> a -> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)])
-> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
-> [a]
-> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
forall b a. (b -> a -> b) -> b -> [a] -> b
forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
foldl ((forall (b :: EType).
 Expr b -> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)])
-> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
-> a
-> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
forall c.
Monoid c =>
(forall (b :: EType). Expr b -> c) -> c -> a -> c
forall a c.
(TraversableTerm a, Monoid c) =>
(forall (b :: EType). Expr b -> c) -> c -> a -> c
foldTerm Expr b -> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
forall (b :: EType).
Expr b -> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
go) [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
forall a. Monoid a => a
mempty
  where
    go :: Expr a -> [(Expr EWord, Expr EWord, Expr Buf)]
    go :: forall (b :: EType).
Expr b -> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
go = \case
      ReadWord Expr 'EWord
idx Expr 'Buf
buf -> [(Expr 'EWord
idx, W256 -> Expr 'EWord
Lit W256
32, Expr 'Buf
buf)]
      ReadByte Expr 'EWord
idx Expr 'Buf
buf -> [(Expr 'EWord
idx, W256 -> Expr 'EWord
Lit W256
1, Expr 'Buf
buf)]
      CopySlice Expr 'EWord
srcOff Expr 'EWord
_ Expr 'EWord
size Expr 'Buf
src Expr 'Buf
_  -> [(Expr 'EWord
srcOff, Expr 'EWord
size, Expr 'Buf
src)]
      Expr a
_ -> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
forall a. Monoid a => a
mempty

-- | Asserts that buffer reads beyond the size of the buffer are equal
-- to zero. Looks for buffer reads in the a list of given predicates
-- and the buffer and storage environments.
assertReads :: [Prop] -> BufEnv -> StoreEnv -> [Prop]
assertReads :: [Prop] -> BufEnv -> StoreEnv -> [Prop]
assertReads [Prop]
props BufEnv
benv StoreEnv
senv = ((Expr 'EWord, Expr 'EWord, Expr 'Buf) -> [Prop])
-> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)] -> [Prop]
forall (t :: * -> *) a b. Foldable t => (a -> [b]) -> t a -> [b]
concatMap (Expr 'EWord, Expr 'EWord, Expr 'Buf) -> [Prop]
assertRead [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
allReads
  where
    assertRead :: (Expr EWord, Expr EWord, Expr Buf) -> [Prop]
    assertRead :: (Expr 'EWord, Expr 'EWord, Expr 'Buf) -> [Prop]
assertRead (Expr 'EWord
idx, Lit W256
32, Expr 'Buf
buf) = [Prop -> Prop -> Prop
PImpl (Expr 'EWord -> Expr 'EWord -> Prop
PGEq Expr 'EWord
idx (Expr 'Buf -> Expr 'EWord
bufLength Expr 'Buf
buf)) (Expr 'EWord -> Expr 'EWord -> Prop
forall (a :: EType). Typeable a => Expr a -> Expr a -> Prop
PEq (Expr 'EWord -> Expr 'Buf -> Expr 'EWord
ReadWord Expr 'EWord
idx Expr 'Buf
buf) (W256 -> Expr 'EWord
Lit W256
0))]
    assertRead (Expr 'EWord
idx, Lit W256
sz, Expr 'Buf
buf) =
      (Int -> Prop) -> [Int] -> [Prop]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap
        -- TODO: unsafeInto instead fromIntegral here makes symbolic tests fail
        (Prop -> Prop -> Prop
PImpl (Expr 'EWord -> Expr 'EWord -> Prop
PGEq Expr 'EWord
idx (Expr 'Buf -> Expr 'EWord
bufLength Expr 'Buf
buf)) (Prop -> Prop) -> (Int -> Prop) -> Int -> Prop
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Expr 'Byte -> Expr 'Byte -> Prop
forall (a :: EType). Typeable a => Expr a -> Expr a -> Prop
PEq (Expr 'EWord -> Expr 'Buf -> Expr 'Byte
ReadByte Expr 'EWord
idx Expr 'Buf
buf) (Expr 'Byte -> Prop) -> (Int -> Expr 'Byte) -> Int -> Prop
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Word8 -> Expr 'Byte
LitByte (Word8 -> Expr 'Byte) -> (Int -> Word8) -> Int -> Expr 'Byte
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Int -> Word8
forall a b. (Integral a, Num b) => a -> b
fromIntegral)
        [(Int
0::Int)..W256 -> Int
forall target source.
(HasCallStack, TryFrom source target, Show source, Typeable source,
 Typeable target) =>
source -> target
unsafeInto W256
szInt -> Int -> Int
forall a. Num a => a -> a -> a
-Int
1]
    assertRead (Expr 'EWord
_, Expr 'EWord
_, Expr 'Buf
_) = [Char] -> [Prop]
forall a. HasCallStack => [Char] -> a
internalError [Char]
"Cannot generate assertions for accesses of symbolic size"

    allReads :: [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
allReads = ((Expr 'EWord, Expr 'EWord, Expr 'Buf) -> Bool)
-> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
-> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
forall a. (a -> Bool) -> [a] -> [a]
filter (Expr 'EWord, Expr 'EWord, Expr 'Buf) -> Bool
keepRead ([(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
 -> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)])
-> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
-> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
forall a b. (a -> b) -> a -> b
$ [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
-> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
forall a. Ord a => [a] -> [a]
nubOrd ([(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
 -> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)])
-> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
-> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
forall a b. (a -> b) -> a -> b
$ [Prop] -> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
forall a.
TraversableTerm a =>
[a] -> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
findBufferAccess [Prop]
props [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
-> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
-> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
forall a. Semigroup a => a -> a -> a
<> [Expr 'Buf] -> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
forall a.
TraversableTerm a =>
[a] -> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
findBufferAccess (BufEnv -> [Expr 'Buf]
forall k a. Map k a -> [a]
Map.elems BufEnv
benv) [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
-> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
-> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
forall a. Semigroup a => a -> a -> a
<> [Expr 'Storage] -> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
forall a.
TraversableTerm a =>
[a] -> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
findBufferAccess (StoreEnv -> [Expr 'Storage]
forall k a. Map k a -> [a]
Map.elems StoreEnv
senv)

    -- discard constraints if we can statically determine that read is less than the buffer length
    keepRead :: (Expr 'EWord, Expr 'EWord, Expr 'Buf) -> Bool
keepRead (Lit W256
idx, Lit W256
size, Expr 'Buf
buf) =
      case BufEnv -> Expr 'Buf -> Maybe Integer
minLength BufEnv
benv Expr 'Buf
buf of
        Just Integer
l | W256 -> Integer
forall target source. From source target => source -> target
into (W256
idx W256 -> W256 -> W256
forall a. Num a => a -> a -> a
+ W256
size) Integer -> Integer -> Bool
forall a. Ord a => a -> a -> Bool
<= Integer
l -> Bool
False
        Maybe Integer
_ -> Bool
True
    keepRead (Expr 'EWord, Expr 'EWord, Expr 'Buf)
_ = Bool
True

-- | Finds the maximum read index for each abstract buffer in the input props
discoverMaxReads :: [Prop] -> BufEnv -> StoreEnv -> Map Text (Expr EWord)
discoverMaxReads :: [Prop] -> BufEnv -> StoreEnv -> Map Text (Expr 'EWord)
discoverMaxReads [Prop]
props BufEnv
benv StoreEnv
senv = Map Text (Expr 'EWord)
bufMap
  where
    allReads :: [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
allReads = [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
-> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
forall a. Ord a => [a] -> [a]
nubOrd ([(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
 -> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)])
-> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
-> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
forall a b. (a -> b) -> a -> b
$ [Prop] -> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
forall a.
TraversableTerm a =>
[a] -> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
findBufferAccess [Prop]
props [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
-> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
-> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
forall a. Semigroup a => a -> a -> a
<> [Expr 'Buf] -> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
forall a.
TraversableTerm a =>
[a] -> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
findBufferAccess (BufEnv -> [Expr 'Buf]
forall k a. Map k a -> [a]
Map.elems BufEnv
benv) [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
-> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
-> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
forall a. Semigroup a => a -> a -> a
<> [Expr 'Storage] -> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
forall a.
TraversableTerm a =>
[a] -> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
findBufferAccess (StoreEnv -> [Expr 'Storage]
forall k a. Map k a -> [a]
Map.elems StoreEnv
senv)
    -- we can have buffers that are not read from but are still mentioned via BufLength in some branch condition
    -- we assign a default read hint of 4 to start with in these cases (since in most cases we will need at least 4 bytes to produce a counterexample)
    allBufs :: Map Text (Expr 'EWord)
allBufs = [(Text, Expr 'EWord)] -> Map Text (Expr 'EWord)
forall k a. Ord k => [(k, a)] -> Map k a
Map.fromList ([(Text, Expr 'EWord)] -> Map Text (Expr 'EWord))
-> ([[Builder]] -> [(Text, Expr 'EWord)])
-> [[Builder]]
-> Map Text (Expr 'EWord)
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Text -> (Text, Expr 'EWord)) -> [Text] -> [(Text, Expr 'EWord)]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (, W256 -> Expr 'EWord
Lit W256
4) ([Text] -> [(Text, Expr 'EWord)])
-> ([[Builder]] -> [Text]) -> [[Builder]] -> [(Text, Expr 'EWord)]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Builder -> Text) -> [Builder] -> [Text]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Builder -> Text
toLazyText ([Builder] -> [Text])
-> ([[Builder]] -> [Builder]) -> [[Builder]] -> [Text]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Builder] -> [Builder]
forall a. Ord a => [a] -> [a]
nubOrd ([Builder] -> [Builder])
-> ([[Builder]] -> [Builder]) -> [[Builder]] -> [Builder]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [[Builder]] -> [Builder]
forall (t :: * -> *) a. Foldable t => t [a] -> [a]
concat ([[Builder]] -> Map Text (Expr 'EWord))
-> [[Builder]] -> Map Text (Expr 'EWord)
forall a b. (a -> b) -> a -> b
$ (Prop -> [Builder]) -> [Prop] -> [[Builder]]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Prop -> [Builder]
forall a. TraversableTerm a => a -> [Builder]
referencedBufs [Prop]
props [[Builder]] -> [[Builder]] -> [[Builder]]
forall a. Semigroup a => a -> a -> a
<> (Expr 'Buf -> [Builder]) -> [Expr 'Buf] -> [[Builder]]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Expr 'Buf -> [Builder]
forall a. TraversableTerm a => a -> [Builder]
referencedBufs (BufEnv -> [Expr 'Buf]
forall k a. Map k a -> [a]
Map.elems BufEnv
benv) [[Builder]] -> [[Builder]] -> [[Builder]]
forall a. Semigroup a => a -> a -> a
<> (Expr 'Storage -> [Builder]) -> [Expr 'Storage] -> [[Builder]]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Expr 'Storage -> [Builder]
forall a. TraversableTerm a => a -> [Builder]
referencedBufs (StoreEnv -> [Expr 'Storage]
forall k a. Map k a -> [a]
Map.elems StoreEnv
senv)

    bufMap :: Map Text (Expr 'EWord)
bufMap = (Expr 'EWord -> Expr 'EWord -> Expr 'EWord)
-> Map Text (Expr 'EWord)
-> Map Text (Expr 'EWord)
-> Map Text (Expr 'EWord)
forall k a. Ord k => (a -> a -> a) -> Map k a -> Map k a -> Map k a
Map.unionWith Expr 'EWord -> Expr 'EWord -> Expr 'EWord
Expr.max ((Map Text (Expr 'EWord)
 -> (Expr 'EWord, Expr 'EWord, Expr 'Buf) -> Map Text (Expr 'EWord))
-> Map Text (Expr 'EWord)
-> [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
-> Map Text (Expr 'EWord)
forall b a. (b -> a -> b) -> b -> [a] -> b
forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
foldl Map Text (Expr 'EWord)
-> (Expr 'EWord, Expr 'EWord, Expr 'Buf) -> Map Text (Expr 'EWord)
addBound Map Text (Expr 'EWord)
forall a. Monoid a => a
mempty [(Expr 'EWord, Expr 'EWord, Expr 'Buf)]
allReads) Map Text (Expr 'EWord)
allBufs

    addBound :: Map Text (Expr 'EWord)
-> (Expr 'EWord, Expr 'EWord, Expr 'Buf) -> Map Text (Expr 'EWord)
addBound Map Text (Expr 'EWord)
m (Expr 'EWord
idx, Expr 'EWord
size, Expr 'Buf
buf) =
      case Expr 'Buf -> Expr 'Buf
baseBuf Expr 'Buf
buf of
        AbstractBuf Text
b -> (Expr 'EWord -> Expr 'EWord -> Expr 'EWord)
-> Text
-> Expr 'EWord
-> Map Text (Expr 'EWord)
-> Map Text (Expr 'EWord)
forall k a. Ord k => (a -> a -> a) -> k -> a -> Map k a -> Map k a
Map.insertWith Expr 'EWord -> Expr 'EWord -> Expr 'EWord
Expr.max (Text -> Text
T.fromStrict Text
b) (Expr 'EWord -> Expr 'EWord -> Expr 'EWord
Expr.add Expr 'EWord
idx Expr 'EWord
size) Map Text (Expr 'EWord)
m
        Expr 'Buf
_ -> Map Text (Expr 'EWord)
m

    baseBuf :: Expr Buf -> Expr Buf
    baseBuf :: Expr 'Buf -> Expr 'Buf
baseBuf (AbstractBuf Text
b) = Text -> Expr 'Buf
AbstractBuf Text
b
    baseBuf (ConcreteBuf ByteString
b) = ByteString -> Expr 'Buf
ConcreteBuf ByteString
b
    baseBuf (GVar (BufVar Int
a)) =
      case Int -> BufEnv -> Maybe (Expr 'Buf)
forall k a. Ord k => k -> Map k a -> Maybe a
Map.lookup Int
a BufEnv
benv of
        Just Expr 'Buf
b -> Expr 'Buf -> Expr 'Buf
baseBuf Expr 'Buf
b
        Maybe (Expr 'Buf)
Nothing -> [Char] -> Expr 'Buf
forall a. HasCallStack => [Char] -> a
internalError [Char]
"could not find buffer variable"
    baseBuf (WriteByte Expr 'EWord
_ Expr 'Byte
_ Expr 'Buf
b) = Expr 'Buf -> Expr 'Buf
baseBuf Expr 'Buf
b
    baseBuf (WriteWord Expr 'EWord
_ Expr 'EWord
_ Expr 'Buf
b) = Expr 'Buf -> Expr 'Buf
baseBuf Expr 'Buf
b
    baseBuf (CopySlice Expr 'EWord
_ Expr 'EWord
_ Expr 'EWord
_ Expr 'Buf
_ Expr 'Buf
dst)= Expr 'Buf -> Expr 'Buf
baseBuf Expr 'Buf
dst

-- | Returns an SMT2 object with all buffers referenced from the input props declared, and with the appropriate cex extraction metadata attached
declareBufs :: [Prop] -> BufEnv -> StoreEnv -> SMT2
declareBufs :: [Prop] -> BufEnv -> StoreEnv -> SMT2
declareBufs [Prop]
props BufEnv
bufEnv StoreEnv
storeEnv = [Builder] -> RefinementEqs -> CexVars -> [Prop] -> SMT2
SMT2 (Builder
"; buffers" Builder -> [Builder] -> [Builder]
forall a. a -> [a] -> [a]
: (Builder -> Builder) -> [Builder] -> [Builder]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Builder -> Builder
forall {a}. (Semigroup a, IsString a) => a -> a
declareBuf [Builder]
allBufs [Builder] -> [Builder] -> [Builder]
forall a. Semigroup a => a -> a -> a
<> (Builder
"; buffer lengths" Builder -> [Builder] -> [Builder]
forall a. a -> [a] -> [a]
: (Builder -> Builder) -> [Builder] -> [Builder]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Builder -> Builder
forall {a}. (Semigroup a, IsString a) => a -> a
declareLength [Builder]
allBufs)) RefinementEqs
forall a. Monoid a => a
mempty CexVars
cexvars [Prop]
forall a. Monoid a => a
mempty
  where
    cexvars :: CexVars
cexvars = (CexVars
forall a. Monoid a => a
mempty :: CexVars){ $sel:buffers:CexVars :: Map Text (Expr 'EWord)
buffers = [Prop] -> BufEnv -> StoreEnv -> Map Text (Expr 'EWord)
discoverMaxReads [Prop]
props BufEnv
bufEnv StoreEnv
storeEnv }
    allBufs :: [Builder]
allBufs = (Text -> Builder) -> [Text] -> [Builder]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Text -> Builder
fromLazyText ([Text] -> [Builder]) -> [Text] -> [Builder]
forall a b. (a -> b) -> a -> b
$ Map Text (Expr 'EWord) -> [Text]
forall k a. Map k a -> [k]
Map.keys CexVars
cexvars.buffers
    declareBuf :: a -> a
declareBuf a
n = a
"(declare-const " a -> a -> a
forall a. Semigroup a => a -> a -> a
<> a
n a -> a -> a
forall a. Semigroup a => a -> a -> a
<> a
" (Array (_ BitVec 256) (_ BitVec 8)))"
    declareLength :: a -> a
declareLength a
n = a
"(declare-const " a -> a -> a
forall a. Semigroup a => a -> a -> a
<> a
n a -> a -> a
forall a. Semigroup a => a -> a -> a
<> a
"_length" a -> a -> a
forall a. Semigroup a => a -> a -> a
<> a
" (_ BitVec 256))"

-- Given a list of variable names, create an SMT2 object with the variables declared
declareVars :: [Builder] -> SMT2
declareVars :: [Builder] -> SMT2
declareVars [Builder]
names = [Builder] -> RefinementEqs -> CexVars -> [Prop] -> SMT2
SMT2 ([Builder
"; variables"] [Builder] -> [Builder] -> [Builder]
forall a. Semigroup a => a -> a -> a
<> (Builder -> Builder) -> [Builder] -> [Builder]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Builder -> Builder
forall {a}. (Semigroup a, IsString a) => a -> a
declare [Builder]
names) RefinementEqs
forall a. Monoid a => a
mempty CexVars
cexvars [Prop]
forall a. Monoid a => a
mempty
  where
    declare :: a -> a
declare a
n = a
"(declare-const " a -> a -> a
forall a. Semigroup a => a -> a -> a
<> a
n a -> a -> a
forall a. Semigroup a => a -> a -> a
<> a
" (_ BitVec 256))"
    cexvars :: CexVars
cexvars = (CexVars
forall a. Monoid a => a
mempty :: CexVars){ $sel:calldata:CexVars :: [Text]
calldata = (Builder -> Text) -> [Builder] -> [Text]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Builder -> Text
toLazyText [Builder]
names }

-- Given a list of variable names, create an SMT2 object with the variables declared
declareAddrs :: [Builder] -> SMT2
declareAddrs :: [Builder] -> SMT2
declareAddrs [Builder]
names = [Builder] -> RefinementEqs -> CexVars -> [Prop] -> SMT2
SMT2 ([Builder
"; symbolic addresseses"] [Builder] -> [Builder] -> [Builder]
forall a. Semigroup a => a -> a -> a
<> (Builder -> Builder) -> [Builder] -> [Builder]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Builder -> Builder
forall {a}. (Semigroup a, IsString a) => a -> a
declare [Builder]
names) RefinementEqs
forall a. Monoid a => a
mempty CexVars
cexvars [Prop]
forall a. Monoid a => a
mempty
  where
    declare :: a -> a
declare a
n = a
"(declare-const " a -> a -> a
forall a. Semigroup a => a -> a -> a
<> a
n a -> a -> a
forall a. Semigroup a => a -> a -> a
<> a
" Addr)"
    cexvars :: CexVars
cexvars = (CexVars
forall a. Monoid a => a
mempty :: CexVars){ $sel:addrs:CexVars :: [Text]
addrs = (Builder -> Text) -> [Builder] -> [Text]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Builder -> Text
toLazyText [Builder]
names }

declareFrameContext :: [(Builder, [Prop])] -> SMT2
declareFrameContext :: [(Builder, [Prop])] -> SMT2
declareFrameContext [(Builder, [Prop])]
names = [Builder] -> RefinementEqs -> CexVars -> [Prop] -> SMT2
SMT2 ([Builder
"; frame context"] [Builder] -> [Builder] -> [Builder]
forall a. Semigroup a => a -> a -> a
<> ((Builder, [Prop]) -> [Builder])
-> [(Builder, [Prop])] -> [Builder]
forall (t :: * -> *) a b. Foldable t => (a -> [b]) -> t a -> [b]
concatMap (Builder, [Prop]) -> [Builder]
declare [(Builder, [Prop])]
names) RefinementEqs
forall a. Monoid a => a
mempty CexVars
cexvars [Prop]
forall a. Monoid a => a
mempty
  where
    declare :: (Builder, [Prop]) -> [Builder]
declare (Builder
n,[Prop]
props) = [ Builder
"(declare-const " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
n Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
" (_ BitVec 256))" ]
                        [Builder] -> [Builder] -> [Builder]
forall a. Semigroup a => a -> a -> a
<> (Prop -> Builder) -> [Prop] -> [Builder]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (\Prop
p -> Builder
"(assert " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Prop -> Builder
propToSMT Prop
p Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")") [Prop]
props
    cexvars :: CexVars
cexvars = (CexVars
forall a. Monoid a => a
mempty :: CexVars){ $sel:txContext:CexVars :: [Text]
txContext = ((Builder, [Prop]) -> Text) -> [(Builder, [Prop])] -> [Text]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (Builder -> Text
toLazyText (Builder -> Text)
-> ((Builder, [Prop]) -> Builder) -> (Builder, [Prop]) -> Text
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Builder, [Prop]) -> Builder
forall a b. (a, b) -> a
fst) [(Builder, [Prop])]
names }

declareAbstractStores :: [Builder] -> SMT2
declareAbstractStores :: [Builder] -> SMT2
declareAbstractStores [Builder]
names = [Builder] -> RefinementEqs -> CexVars -> [Prop] -> SMT2
SMT2 ([Builder
"; abstract base stores"] [Builder] -> [Builder] -> [Builder]
forall a. Semigroup a => a -> a -> a
<> (Builder -> Builder) -> [Builder] -> [Builder]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap Builder -> Builder
forall {a}. (Semigroup a, IsString a) => a -> a
declare [Builder]
names) RefinementEqs
forall a. Monoid a => a
mempty CexVars
forall a. Monoid a => a
mempty [Prop]
forall a. Monoid a => a
mempty
  where
    declare :: a -> a
declare a
n = a
"(declare-const " a -> a -> a
forall a. Semigroup a => a -> a -> a
<> a
n a -> a -> a
forall a. Semigroup a => a -> a -> a
<> a
" Storage)"

declareBlockContext :: [(Builder, [Prop])] -> SMT2
declareBlockContext :: [(Builder, [Prop])] -> SMT2
declareBlockContext [(Builder, [Prop])]
names = [Builder] -> RefinementEqs -> CexVars -> [Prop] -> SMT2
SMT2 ([Builder
"; block context"] [Builder] -> [Builder] -> [Builder]
forall a. Semigroup a => a -> a -> a
<> ((Builder, [Prop]) -> [Builder])
-> [(Builder, [Prop])] -> [Builder]
forall (t :: * -> *) a b. Foldable t => (a -> [b]) -> t a -> [b]
concatMap (Builder, [Prop]) -> [Builder]
declare [(Builder, [Prop])]
names) RefinementEqs
forall a. Monoid a => a
mempty CexVars
cexvars [Prop]
forall a. Monoid a => a
mempty
  where
    declare :: (Builder, [Prop]) -> [Builder]
declare (Builder
n, [Prop]
props) = [ Builder
"(declare-const " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
n Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
" (_ BitVec 256))" ]
                         [Builder] -> [Builder] -> [Builder]
forall a. Semigroup a => a -> a -> a
<> (Prop -> Builder) -> [Prop] -> [Builder]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (\Prop
p -> Builder
"(assert " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Prop -> Builder
propToSMT Prop
p Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")") [Prop]
props
    cexvars :: CexVars
cexvars = (CexVars
forall a. Monoid a => a
mempty :: CexVars){ $sel:blockContext:CexVars :: [Text]
blockContext = ((Builder, [Prop]) -> Text) -> [(Builder, [Prop])] -> [Text]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (Builder -> Text
toLazyText (Builder -> Text)
-> ((Builder, [Prop]) -> Builder) -> (Builder, [Prop]) -> Text
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (Builder, [Prop]) -> Builder
forall a b. (a, b) -> a
fst) [(Builder, [Prop])]
names }

prelude :: SMT2
prelude :: SMT2
prelude =  [Builder] -> RefinementEqs -> CexVars -> [Prop] -> SMT2
SMT2 [Builder]
src RefinementEqs
forall a. Monoid a => a
mempty CexVars
forall a. Monoid a => a
mempty [Prop]
forall a. Monoid a => a
mempty
  where
  src :: [Builder]
src = (Text -> Builder) -> [Text] -> [Builder]
forall a b. (a -> b) -> [a] -> [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (Text -> Builder
fromLazyText (Text -> Builder) -> (Text -> Text) -> Text -> Builder
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Int64 -> Text -> Text
T.drop Int64
2) ([Text] -> [Builder]) -> (Text -> [Text]) -> Text -> [Builder]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Text -> [Text]
T.lines (Text -> [Builder]) -> Text -> [Builder]
forall a b. (a -> b) -> a -> b
$ Text
[i|
  ; logic
  ; TODO: this creates an error when used with z3?
  ;(set-logic QF_AUFBV)
  (set-logic ALL)

  ; types
  (define-sort Byte () (_ BitVec 8))
  (define-sort Word () (_ BitVec 256))
  (define-sort Addr () (_ BitVec 160))
  (define-sort Buf () (Array Word Byte))

  ; slot -> value
  (define-sort Storage () (Array Word Word))

  ; hash functions
  (declare-fun keccak (Buf) Word)
  (declare-fun sha256 (Buf) Word)
  (define-fun max ((a (_ BitVec 256)) (b (_ BitVec 256))) (_ BitVec 256) (ite (bvult a b) b a))

  ; word indexing
  (define-fun indexWord31 ((w Word)) Byte ((_ extract 7 0) w))
  (define-fun indexWord30 ((w Word)) Byte ((_ extract 15 8) w))
  (define-fun indexWord29 ((w Word)) Byte ((_ extract 23 16) w))
  (define-fun indexWord28 ((w Word)) Byte ((_ extract 31 24) w))
  (define-fun indexWord27 ((w Word)) Byte ((_ extract 39 32) w))
  (define-fun indexWord26 ((w Word)) Byte ((_ extract 47 40) w))
  (define-fun indexWord25 ((w Word)) Byte ((_ extract 55 48) w))
  (define-fun indexWord24 ((w Word)) Byte ((_ extract 63 56) w))
  (define-fun indexWord23 ((w Word)) Byte ((_ extract 71 64) w))
  (define-fun indexWord22 ((w Word)) Byte ((_ extract 79 72) w))
  (define-fun indexWord21 ((w Word)) Byte ((_ extract 87 80) w))
  (define-fun indexWord20 ((w Word)) Byte ((_ extract 95 88) w))
  (define-fun indexWord19 ((w Word)) Byte ((_ extract 103 96) w))
  (define-fun indexWord18 ((w Word)) Byte ((_ extract 111 104) w))
  (define-fun indexWord17 ((w Word)) Byte ((_ extract 119 112) w))
  (define-fun indexWord16 ((w Word)) Byte ((_ extract 127 120) w))
  (define-fun indexWord15 ((w Word)) Byte ((_ extract 135 128) w))
  (define-fun indexWord14 ((w Word)) Byte ((_ extract 143 136) w))
  (define-fun indexWord13 ((w Word)) Byte ((_ extract 151 144) w))
  (define-fun indexWord12 ((w Word)) Byte ((_ extract 159 152) w))
  (define-fun indexWord11 ((w Word)) Byte ((_ extract 167 160) w))
  (define-fun indexWord10 ((w Word)) Byte ((_ extract 175 168) w))
  (define-fun indexWord9 ((w Word)) Byte ((_ extract 183 176) w))
  (define-fun indexWord8 ((w Word)) Byte ((_ extract 191 184) w))
  (define-fun indexWord7 ((w Word)) Byte ((_ extract 199 192) w))
  (define-fun indexWord6 ((w Word)) Byte ((_ extract 207 200) w))
  (define-fun indexWord5 ((w Word)) Byte ((_ extract 215 208) w))
  (define-fun indexWord4 ((w Word)) Byte ((_ extract 223 216) w))
  (define-fun indexWord3 ((w Word)) Byte ((_ extract 231 224) w))
  (define-fun indexWord2 ((w Word)) Byte ((_ extract 239 232) w))
  (define-fun indexWord1 ((w Word)) Byte ((_ extract 247 240) w))
  (define-fun indexWord0 ((w Word)) Byte ((_ extract 255 248) w))

  ; symbolic word indexing
  ; a bitshift based version might be more performant here...
  (define-fun indexWord ((idx Word) (w Word)) Byte
    (ite (bvuge idx (_ bv32 256)) (_ bv0 8)
    (ite (= idx (_ bv31 256)) (indexWord31 w)
    (ite (= idx (_ bv30 256)) (indexWord30 w)
    (ite (= idx (_ bv29 256)) (indexWord29 w)
    (ite (= idx (_ bv28 256)) (indexWord28 w)
    (ite (= idx (_ bv27 256)) (indexWord27 w)
    (ite (= idx (_ bv26 256)) (indexWord26 w)
    (ite (= idx (_ bv25 256)) (indexWord25 w)
    (ite (= idx (_ bv24 256)) (indexWord24 w)
    (ite (= idx (_ bv23 256)) (indexWord23 w)
    (ite (= idx (_ bv22 256)) (indexWord22 w)
    (ite (= idx (_ bv21 256)) (indexWord21 w)
    (ite (= idx (_ bv20 256)) (indexWord20 w)
    (ite (= idx (_ bv19 256)) (indexWord19 w)
    (ite (= idx (_ bv18 256)) (indexWord18 w)
    (ite (= idx (_ bv17 256)) (indexWord17 w)
    (ite (= idx (_ bv16 256)) (indexWord16 w)
    (ite (= idx (_ bv15 256)) (indexWord15 w)
    (ite (= idx (_ bv14 256)) (indexWord14 w)
    (ite (= idx (_ bv13 256)) (indexWord13 w)
    (ite (= idx (_ bv12 256)) (indexWord12 w)
    (ite (= idx (_ bv11 256)) (indexWord11 w)
    (ite (= idx (_ bv10 256)) (indexWord10 w)
    (ite (= idx (_ bv9 256)) (indexWord9 w)
    (ite (= idx (_ bv8 256)) (indexWord8 w)
    (ite (= idx (_ bv7 256)) (indexWord7 w)
    (ite (= idx (_ bv6 256)) (indexWord6 w)
    (ite (= idx (_ bv5 256)) (indexWord5 w)
    (ite (= idx (_ bv4 256)) (indexWord4 w)
    (ite (= idx (_ bv3 256)) (indexWord3 w)
    (ite (= idx (_ bv2 256)) (indexWord2 w)
    (ite (= idx (_ bv1 256)) (indexWord1 w)
    (indexWord0 w)
    ))))))))))))))))))))))))))))))))
  )

  (define-fun readWord ((idx Word) (buf Buf)) Word
    (concat
      (select buf idx)
      (select buf (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000001))
      (select buf (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000002))
      (select buf (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000003))
      (select buf (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000004))
      (select buf (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000005))
      (select buf (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000006))
      (select buf (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000007))
      (select buf (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000008))
      (select buf (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000009))
      (select buf (bvadd idx #x000000000000000000000000000000000000000000000000000000000000000a))
      (select buf (bvadd idx #x000000000000000000000000000000000000000000000000000000000000000b))
      (select buf (bvadd idx #x000000000000000000000000000000000000000000000000000000000000000c))
      (select buf (bvadd idx #x000000000000000000000000000000000000000000000000000000000000000d))
      (select buf (bvadd idx #x000000000000000000000000000000000000000000000000000000000000000e))
      (select buf (bvadd idx #x000000000000000000000000000000000000000000000000000000000000000f))
      (select buf (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000010))
      (select buf (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000011))
      (select buf (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000012))
      (select buf (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000013))
      (select buf (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000014))
      (select buf (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000015))
      (select buf (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000016))
      (select buf (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000017))
      (select buf (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000018))
      (select buf (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000019))
      (select buf (bvadd idx #x000000000000000000000000000000000000000000000000000000000000001a))
      (select buf (bvadd idx #x000000000000000000000000000000000000000000000000000000000000001b))
      (select buf (bvadd idx #x000000000000000000000000000000000000000000000000000000000000001c))
      (select buf (bvadd idx #x000000000000000000000000000000000000000000000000000000000000001d))
      (select buf (bvadd idx #x000000000000000000000000000000000000000000000000000000000000001e))
      (select buf (bvadd idx #x000000000000000000000000000000000000000000000000000000000000001f))
    )
  )

  (define-fun writeWord ((idx Word) (val Word) (buf Buf)) Buf
      (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store
      (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store buf
      (bvadd idx #x000000000000000000000000000000000000000000000000000000000000001f) (indexWord31 val))
      (bvadd idx #x000000000000000000000000000000000000000000000000000000000000001e) (indexWord30 val))
      (bvadd idx #x000000000000000000000000000000000000000000000000000000000000001d) (indexWord29 val))
      (bvadd idx #x000000000000000000000000000000000000000000000000000000000000001c) (indexWord28 val))
      (bvadd idx #x000000000000000000000000000000000000000000000000000000000000001b) (indexWord27 val))
      (bvadd idx #x000000000000000000000000000000000000000000000000000000000000001a) (indexWord26 val))
      (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000019) (indexWord25 val))
      (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000018) (indexWord24 val))
      (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000017) (indexWord23 val))
      (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000016) (indexWord22 val))
      (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000015) (indexWord21 val))
      (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000014) (indexWord20 val))
      (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000013) (indexWord19 val))
      (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000012) (indexWord18 val))
      (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000011) (indexWord17 val))
      (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000010) (indexWord16 val))
      (bvadd idx #x000000000000000000000000000000000000000000000000000000000000000f) (indexWord15 val))
      (bvadd idx #x000000000000000000000000000000000000000000000000000000000000000e) (indexWord14 val))
      (bvadd idx #x000000000000000000000000000000000000000000000000000000000000000d) (indexWord13 val))
      (bvadd idx #x000000000000000000000000000000000000000000000000000000000000000c) (indexWord12 val))
      (bvadd idx #x000000000000000000000000000000000000000000000000000000000000000b) (indexWord11 val))
      (bvadd idx #x000000000000000000000000000000000000000000000000000000000000000a) (indexWord10 val))
      (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000009) (indexWord9 val))
      (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000008) (indexWord8 val))
      (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000007) (indexWord7 val))
      (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000006) (indexWord6 val))
      (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000005) (indexWord5 val))
      (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000004) (indexWord4 val))
      (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000003) (indexWord3 val))
      (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000002) (indexWord2 val))
      (bvadd idx #x0000000000000000000000000000000000000000000000000000000000000001) (indexWord1 val))
      idx (indexWord0 val))
  )

  ; block context
  (declare-fun blockhash (Word) Word)
  (declare-fun codesize (Addr) Word)

  ; macros
  (define-fun signext ( (b Word) (val Word)) Word
    (ite (= b (_ bv0  256)) ((_ sign_extend 248) ((_ extract 7    0) val))
    (ite (= b (_ bv1  256)) ((_ sign_extend 240) ((_ extract 15   0) val))
    (ite (= b (_ bv2  256)) ((_ sign_extend 232) ((_ extract 23   0) val))
    (ite (= b (_ bv3  256)) ((_ sign_extend 224) ((_ extract 31   0) val))
    (ite (= b (_ bv4  256)) ((_ sign_extend 216) ((_ extract 39   0) val))
    (ite (= b (_ bv5  256)) ((_ sign_extend 208) ((_ extract 47   0) val))
    (ite (= b (_ bv6  256)) ((_ sign_extend 200) ((_ extract 55   0) val))
    (ite (= b (_ bv7  256)) ((_ sign_extend 192) ((_ extract 63   0) val))
    (ite (= b (_ bv8  256)) ((_ sign_extend 184) ((_ extract 71   0) val))
    (ite (= b (_ bv9  256)) ((_ sign_extend 176) ((_ extract 79   0) val))
    (ite (= b (_ bv10 256)) ((_ sign_extend 168) ((_ extract 87   0) val))
    (ite (= b (_ bv11 256)) ((_ sign_extend 160) ((_ extract 95   0) val))
    (ite (= b (_ bv12 256)) ((_ sign_extend 152) ((_ extract 103  0) val))
    (ite (= b (_ bv13 256)) ((_ sign_extend 144) ((_ extract 111  0) val))
    (ite (= b (_ bv14 256)) ((_ sign_extend 136) ((_ extract 119  0) val))
    (ite (= b (_ bv15 256)) ((_ sign_extend 128) ((_ extract 127  0) val))
    (ite (= b (_ bv16 256)) ((_ sign_extend 120) ((_ extract 135  0) val))
    (ite (= b (_ bv17 256)) ((_ sign_extend 112) ((_ extract 143  0) val))
    (ite (= b (_ bv18 256)) ((_ sign_extend 104) ((_ extract 151  0) val))
    (ite (= b (_ bv19 256)) ((_ sign_extend 96 ) ((_ extract 159  0) val))
    (ite (= b (_ bv20 256)) ((_ sign_extend 88 ) ((_ extract 167  0) val))
    (ite (= b (_ bv21 256)) ((_ sign_extend 80 ) ((_ extract 175  0) val))
    (ite (= b (_ bv22 256)) ((_ sign_extend 72 ) ((_ extract 183  0) val))
    (ite (= b (_ bv23 256)) ((_ sign_extend 64 ) ((_ extract 191  0) val))
    (ite (= b (_ bv24 256)) ((_ sign_extend 56 ) ((_ extract 199  0) val))
    (ite (= b (_ bv25 256)) ((_ sign_extend 48 ) ((_ extract 207  0) val))
    (ite (= b (_ bv26 256)) ((_ sign_extend 40 ) ((_ extract 215  0) val))
    (ite (= b (_ bv27 256)) ((_ sign_extend 32 ) ((_ extract 223  0) val))
    (ite (= b (_ bv28 256)) ((_ sign_extend 24 ) ((_ extract 231  0) val))
    (ite (= b (_ bv29 256)) ((_ sign_extend 16 ) ((_ extract 239  0) val))
    (ite (= b (_ bv30 256)) ((_ sign_extend 8  ) ((_ extract 247  0) val)) val))))))))))))))))))))))))))))))))
  |]

exprToSMT :: Expr a -> Builder
exprToSMT :: forall (a :: EType). Expr a -> Builder
exprToSMT = \case
  Lit W256
w -> Text -> Builder
fromLazyText (Text -> Builder) -> Text -> Builder
forall a b. (a -> b) -> a -> b
$ Text
"(_ bv" Text -> Text -> Text
forall a. Semigroup a => a -> a -> a
<> ([Char] -> Text
T.pack ([Char] -> Text) -> [Char] -> Text
forall a b. (a -> b) -> a -> b
$ Integer -> [Char]
forall a. Show a => a -> [Char]
show (W256 -> Integer
forall target source. From source target => source -> target
into W256
w :: Integer)) Text -> Text -> Text
forall a. Semigroup a => a -> a -> a
<> Text
" 256)"
  Var Text
s -> Text -> Builder
fromText Text
s
  GVar (BufVar Int
n) -> [Char] -> Builder
fromString ([Char] -> Builder) -> [Char] -> Builder
forall a b. (a -> b) -> a -> b
$ [Char]
"buf" [Char] -> ShowS
forall a. Semigroup a => a -> a -> a
<> (Int -> [Char]
forall a. Show a => a -> [Char]
show Int
n)
  GVar (StoreVar Int
n) -> [Char] -> Builder
fromString ([Char] -> Builder) -> [Char] -> Builder
forall a b. (a -> b) -> a -> b
$ [Char]
"store" [Char] -> ShowS
forall a. Semigroup a => a -> a -> a
<> (Int -> [Char]
forall a. Show a => a -> [Char]
show Int
n)
  JoinBytes
    Expr 'Byte
z Expr 'Byte
o Expr 'Byte
two Expr 'Byte
three Expr 'Byte
four Expr 'Byte
five Expr 'Byte
six Expr 'Byte
seven
    Expr 'Byte
eight Expr 'Byte
nine Expr 'Byte
ten Expr 'Byte
eleven Expr 'Byte
twelve Expr 'Byte
thirteen Expr 'Byte
fourteen Expr 'Byte
fifteen
    Expr 'Byte
sixteen Expr 'Byte
seventeen Expr 'Byte
eighteen Expr 'Byte
nineteen Expr 'Byte
twenty Expr 'Byte
twentyone Expr 'Byte
twentytwo Expr 'Byte
twentythree
    Expr 'Byte
twentyfour Expr 'Byte
twentyfive Expr 'Byte
twentysix Expr 'Byte
twentyseven Expr 'Byte
twentyeight Expr 'Byte
twentynine Expr 'Byte
thirty Expr 'Byte
thirtyone
    -> [Expr 'Byte] -> Builder
concatBytes [
        Expr 'Byte
z, Expr 'Byte
o, Expr 'Byte
two, Expr 'Byte
three, Expr 'Byte
four, Expr 'Byte
five, Expr 'Byte
six, Expr 'Byte
seven
        , Expr 'Byte
eight, Expr 'Byte
nine, Expr 'Byte
ten, Expr 'Byte
eleven, Expr 'Byte
twelve, Expr 'Byte
thirteen, Expr 'Byte
fourteen, Expr 'Byte
fifteen
        , Expr 'Byte
sixteen, Expr 'Byte
seventeen, Expr 'Byte
eighteen, Expr 'Byte
nineteen, Expr 'Byte
twenty, Expr 'Byte
twentyone, Expr 'Byte
twentytwo, Expr 'Byte
twentythree
        , Expr 'Byte
twentyfour, Expr 'Byte
twentyfive, Expr 'Byte
twentysix, Expr 'Byte
twentyseven, Expr 'Byte
twentyeight, Expr 'Byte
twentynine, Expr 'Byte
thirty, Expr 'Byte
thirtyone]

  Add Expr 'EWord
a Expr 'EWord
b -> Builder -> Expr 'EWord -> Expr 'EWord -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2 Builder
"bvadd" Expr 'EWord
a Expr 'EWord
b
  Sub Expr 'EWord
a Expr 'EWord
b -> Builder -> Expr 'EWord -> Expr 'EWord -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2 Builder
"bvsub" Expr 'EWord
a Expr 'EWord
b
  Mul Expr 'EWord
a Expr 'EWord
b -> Builder -> Expr 'EWord -> Expr 'EWord -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2 Builder
"bvmul" Expr 'EWord
a Expr 'EWord
b
  Exp Expr 'EWord
a Expr 'EWord
b -> case Expr 'EWord
b of
               Lit W256
b' -> Expr 'EWord -> W256 -> Builder
expandExp Expr 'EWord
a W256
b'
               Expr 'EWord
_ -> [Char] -> Builder
forall a. HasCallStack => [Char] -> a
internalError [Char]
"cannot encode symbolic exponentiation into SMT"
  Min Expr 'EWord
a Expr 'EWord
b ->
    let aenc :: Builder
aenc = Expr 'EWord -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'EWord
a
        benc :: Builder
benc = Expr 'EWord -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'EWord
b in
    Builder
"(ite (bvule " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
aenc Builder -> Builder -> Builder
`sp` Builder
benc Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
") " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
aenc Builder -> Builder -> Builder
`sp` Builder
benc Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
  Max Expr 'EWord
a Expr 'EWord
b ->
    let aenc :: Builder
aenc = Expr 'EWord -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'EWord
a
        benc :: Builder
benc = Expr 'EWord -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'EWord
b in
    Builder
"(max " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
aenc Builder -> Builder -> Builder
`sp` Builder
benc Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
  LT Expr 'EWord
a Expr 'EWord
b ->
    let cond :: Builder
cond = Builder -> Expr 'EWord -> Expr 'EWord -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2 Builder
"bvult" Expr 'EWord
a Expr 'EWord
b in
    Builder
"(ite " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
cond Builder -> Builder -> Builder
`sp` Builder
one Builder -> Builder -> Builder
`sp` Builder
zero Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
  SLT Expr 'EWord
a Expr 'EWord
b ->
    let cond :: Builder
cond = Builder -> Expr 'EWord -> Expr 'EWord -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2 Builder
"bvslt" Expr 'EWord
a Expr 'EWord
b in
    Builder
"(ite " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
cond Builder -> Builder -> Builder
`sp` Builder
one Builder -> Builder -> Builder
`sp` Builder
zero Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
  SGT Expr 'EWord
a Expr 'EWord
b ->
    let cond :: Builder
cond = Builder -> Expr 'EWord -> Expr 'EWord -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2 Builder
"bvsgt" Expr 'EWord
a Expr 'EWord
b in
    Builder
"(ite " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
cond Builder -> Builder -> Builder
`sp` Builder
one Builder -> Builder -> Builder
`sp` Builder
zero Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
  GT Expr 'EWord
a Expr 'EWord
b ->
    let cond :: Builder
cond = Builder -> Expr 'EWord -> Expr 'EWord -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2 Builder
"bvugt" Expr 'EWord
a Expr 'EWord
b in
    Builder
"(ite " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
cond Builder -> Builder -> Builder
`sp` Builder
one Builder -> Builder -> Builder
`sp` Builder
zero Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
  LEq Expr 'EWord
a Expr 'EWord
b ->
    let cond :: Builder
cond = Builder -> Expr 'EWord -> Expr 'EWord -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2 Builder
"bvule" Expr 'EWord
a Expr 'EWord
b in
    Builder
"(ite " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
cond Builder -> Builder -> Builder
`sp` Builder
one Builder -> Builder -> Builder
`sp` Builder
zero Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
  GEq Expr 'EWord
a Expr 'EWord
b ->
    let cond :: Builder
cond = Builder -> Expr 'EWord -> Expr 'EWord -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2 Builder
"bvuge" Expr 'EWord
a Expr 'EWord
b in
    Builder
"(ite " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
cond Builder -> Builder -> Builder
`sp` Builder
one Builder -> Builder -> Builder
`sp` Builder
zero Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
  Eq Expr 'EWord
a Expr 'EWord
b ->
    let cond :: Builder
cond = Builder -> Expr 'EWord -> Expr 'EWord -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2 Builder
"=" Expr 'EWord
a Expr 'EWord
b in
    Builder
"(ite " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
cond Builder -> Builder -> Builder
`sp` Builder
one Builder -> Builder -> Builder
`sp` Builder
zero Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
  IsZero Expr 'EWord
a ->
    let cond :: Builder
cond = Builder -> Expr 'EWord -> Expr 'EWord -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2 Builder
"=" Expr 'EWord
a (W256 -> Expr 'EWord
Lit W256
0) in
    Builder
"(ite " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
cond Builder -> Builder -> Builder
`sp` Builder
one Builder -> Builder -> Builder
`sp` Builder
zero Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
  And Expr 'EWord
a Expr 'EWord
b -> Builder -> Expr 'EWord -> Expr 'EWord -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2 Builder
"bvand" Expr 'EWord
a Expr 'EWord
b
  Or Expr 'EWord
a Expr 'EWord
b -> Builder -> Expr 'EWord -> Expr 'EWord -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2 Builder
"bvor" Expr 'EWord
a Expr 'EWord
b
  Xor Expr 'EWord
a Expr 'EWord
b -> Builder -> Expr 'EWord -> Expr 'EWord -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2 Builder
"bvxor" Expr 'EWord
a Expr 'EWord
b
  Not Expr 'EWord
a -> Builder -> Expr 'EWord -> Builder
forall {a :: EType}. Builder -> Expr a -> Builder
op1 Builder
"bvnot" Expr 'EWord
a
  SHL Expr 'EWord
a Expr 'EWord
b -> Builder -> Expr 'EWord -> Expr 'EWord -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2 Builder
"bvshl" Expr 'EWord
b Expr 'EWord
a
  SHR Expr 'EWord
a Expr 'EWord
b -> Builder -> Expr 'EWord -> Expr 'EWord -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2 Builder
"bvlshr" Expr 'EWord
b Expr 'EWord
a
  SAR Expr 'EWord
a Expr 'EWord
b -> Builder -> Expr 'EWord -> Expr 'EWord -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2 Builder
"bvashr" Expr 'EWord
b Expr 'EWord
a
  SEx Expr 'EWord
a Expr 'EWord
b -> Builder -> Expr 'EWord -> Expr 'EWord -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2 Builder
"signext" Expr 'EWord
a Expr 'EWord
b
  Div Expr 'EWord
a Expr 'EWord
b -> Builder -> Expr 'EWord -> Expr 'EWord -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2CheckZero Builder
"bvudiv" Expr 'EWord
a Expr 'EWord
b
  SDiv Expr 'EWord
a Expr 'EWord
b -> Builder -> Expr 'EWord -> Expr 'EWord -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2CheckZero Builder
"bvsdiv" Expr 'EWord
a Expr 'EWord
b
  Mod Expr 'EWord
a Expr 'EWord
b -> Builder -> Expr 'EWord -> Expr 'EWord -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2CheckZero Builder
"bvurem" Expr 'EWord
a Expr 'EWord
b
  SMod Expr 'EWord
a Expr 'EWord
b -> Builder -> Expr 'EWord -> Expr 'EWord -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2CheckZero Builder
"bvsrem" Expr 'EWord
a Expr 'EWord
b
  -- NOTE: this needs to do the MUL at a higher precision, then MOD, then downcast
  MulMod Expr 'EWord
a Expr 'EWord
b Expr 'EWord
c ->
    let aExp :: Builder
aExp = Expr 'EWord -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'EWord
a
        bExp :: Builder
bExp = Expr 'EWord -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'EWord
b
        cExp :: Builder
cExp = Expr 'EWord -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'EWord
c
        aLift :: Builder
aLift = Builder
"(concat (_ bv0 256) " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
aExp Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
        bLift :: Builder
bLift = Builder
"(concat (_ bv0 256) " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
bExp Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
        cLift :: Builder
cLift = Builder
"(concat (_ bv0 256) " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
cExp Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
    in  Builder
"((_ extract 255 0) (ite (= " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
cExp Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
" (_ bv0 256)) (_ bv0 512) (bvurem (bvmul " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
aLift Builder -> Builder -> Builder
`sp` Builder
bLift Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")" Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
cLift Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")))"
  AddMod Expr 'EWord
a Expr 'EWord
b Expr 'EWord
c ->
    let aExp :: Builder
aExp = Expr 'EWord -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'EWord
a
        bExp :: Builder
bExp = Expr 'EWord -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'EWord
b
        cExp :: Builder
cExp = Expr 'EWord -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'EWord
c
        aLift :: Builder
aLift = Builder
"(concat (_ bv0 256) " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
aExp Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
        bLift :: Builder
bLift = Builder
"(concat (_ bv0 256) " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
bExp Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
        cLift :: Builder
cLift = Builder
"(concat (_ bv0 256) " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
cExp Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
    in  Builder
"((_ extract 255 0) (ite (= " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
cExp Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
" (_ bv0 256)) (_ bv0 512) (bvurem (bvadd " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
aLift Builder -> Builder -> Builder
`sp` Builder
bLift Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")" Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
cLift Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")))"
  EqByte Expr 'Byte
a Expr 'Byte
b ->
    let cond :: Builder
cond = Builder -> Expr 'Byte -> Expr 'Byte -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2 Builder
"=" Expr 'Byte
a Expr 'Byte
b in
    Builder
"(ite " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
cond Builder -> Builder -> Builder
`sp` Builder
one Builder -> Builder -> Builder
`sp` Builder
zero Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
  Keccak Expr 'Buf
a ->
    let enc :: Builder
enc = Expr 'Buf -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'Buf
a in
    Builder
"(keccak " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
enc Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
  SHA256 Expr 'Buf
a ->
    let enc :: Builder
enc = Expr 'Buf -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'Buf
a in
    Builder
"(sha256 " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
enc Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"

  Expr a
TxValue -> [Char] -> Builder
fromString [Char]
"txvalue"
  Balance Expr 'EAddr
a -> [Char] -> Builder
fromString [Char]
"balance_" Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Expr 'EAddr -> Builder
formatEAddr Expr 'EAddr
a

  Expr a
Origin ->  Builder
"origin"
  BlockHash Expr 'EWord
a ->
    let enc :: Builder
enc = Expr 'EWord -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'EWord
a in
    Builder
"(blockhash " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
enc Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
  CodeSize Expr 'EAddr
a ->
    let enc :: Builder
enc = Expr 'EAddr -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'EAddr
a in
    Builder
"(codesize " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
enc Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
  Expr a
Coinbase -> Builder
"coinbase"
  Expr a
Timestamp -> Builder
"timestamp"
  Expr a
BlockNumber -> Builder
"blocknumber"
  Expr a
PrevRandao -> Builder
"prevrandao"
  Expr a
GasLimit -> Builder
"gaslimit"
  Expr a
ChainId -> Builder
"chainid"
  Expr a
BaseFee -> Builder
"basefee"

  a :: Expr a
a@(SymAddr Text
_) -> Expr 'EAddr -> Builder
formatEAddr Expr a
Expr 'EAddr
a
  WAddr(a :: Expr 'EAddr
a@(SymAddr Text
_)) -> Builder
"(concat (_ bv0 96)" Builder -> Builder -> Builder
`sp` Expr 'EAddr -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'EAddr
a Builder -> Builder -> Builder
`sp` Builder
")"

  LitByte Word8
b -> Text -> Builder
fromLazyText (Text -> Builder) -> Text -> Builder
forall a b. (a -> b) -> a -> b
$ Text
"(_ bv" Text -> Text -> Text
forall a. Semigroup a => a -> a -> a
<> [Char] -> Text
T.pack (Integer -> [Char]
forall a. Show a => a -> [Char]
show (Word8 -> Integer
forall target source. From source target => source -> target
into Word8
b :: Integer)) Text -> Text -> Text
forall a. Semigroup a => a -> a -> a
<> Text
" 8)"
  IndexWord Expr 'EWord
idx Expr 'EWord
w -> case Expr 'EWord
idx of
    Lit W256
n -> if W256
n W256 -> W256 -> Bool
forall a. Ord a => a -> a -> Bool
>= W256
0 Bool -> Bool -> Bool
&& W256
n W256 -> W256 -> Bool
forall a. Ord a => a -> a -> Bool
< W256
32
             then
               let enc :: Builder
enc = Expr 'EWord -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'EWord
w in
               Text -> Builder
fromLazyText (Text
"(indexWord" Text -> Text -> Text
forall a. Semigroup a => a -> a -> a
<> [Char] -> Text
T.pack (Integer -> [Char]
forall a. Show a => a -> [Char]
show (W256 -> Integer
forall target source. From source target => source -> target
into W256
n :: Integer))) Builder -> Builder -> Builder
`sp` Builder
enc Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
             else Expr 'Byte -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT (Word8 -> Expr 'Byte
LitByte Word8
0)
    Expr 'EWord
_ -> Builder -> Expr 'EWord -> Expr 'EWord -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2 Builder
"indexWord" Expr 'EWord
idx Expr 'EWord
w
  ReadByte Expr 'EWord
idx Expr 'Buf
src -> Builder -> Expr 'Buf -> Expr 'EWord -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2 Builder
"select" Expr 'Buf
src Expr 'EWord
idx

  ConcreteBuf ByteString
"" -> Builder
"((as const Buf) #b00000000)"
  ConcreteBuf ByteString
bs -> ByteString -> Expr 'Buf -> Builder
writeBytes ByteString
bs Expr 'Buf
forall a. Monoid a => a
mempty
  AbstractBuf Text
s -> Text -> Builder
fromText Text
s
  ReadWord Expr 'EWord
idx Expr 'Buf
prev -> Builder -> Expr 'EWord -> Expr 'Buf -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2 Builder
"readWord" Expr 'EWord
idx Expr 'Buf
prev
  BufLength (AbstractBuf Text
b) -> Text -> Builder
fromText Text
b Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
"_length"
  BufLength (GVar (BufVar Int
n)) -> Text -> Builder
fromLazyText (Text -> Builder) -> Text -> Builder
forall a b. (a -> b) -> a -> b
$ Text
"buf" Text -> Text -> Text
forall a. Semigroup a => a -> a -> a
<> ([Char] -> Text
T.pack ([Char] -> Text) -> (Int -> [Char]) -> Int -> Text
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Int -> [Char]
forall a. Show a => a -> [Char]
show (Int -> Text) -> Int -> Text
forall a b. (a -> b) -> a -> b
$ Int
n) Text -> Text -> Text
forall a. Semigroup a => a -> a -> a
<> Text
"_length"
  BufLength Expr 'Buf
b -> Expr 'EWord -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT (Expr 'Buf -> Expr 'EWord
bufLength Expr 'Buf
b)
  WriteByte Expr 'EWord
idx Expr 'Byte
val Expr 'Buf
prev ->
    let encIdx :: Builder
encIdx = Expr 'EWord -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'EWord
idx
        encVal :: Builder
encVal = Expr 'Byte -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'Byte
val
        encPrev :: Builder
encPrev = Expr 'Buf -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'Buf
prev in
    Builder
"(store " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
encPrev Builder -> Builder -> Builder
`sp` Builder
encIdx Builder -> Builder -> Builder
`sp` Builder
encVal Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
  WriteWord Expr 'EWord
idx Expr 'EWord
val Expr 'Buf
prev ->
    let encIdx :: Builder
encIdx = Expr 'EWord -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'EWord
idx
        encVal :: Builder
encVal = Expr 'EWord -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'EWord
val
        encPrev :: Builder
encPrev = Expr 'Buf -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'Buf
prev in
    Builder
"(writeWord " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
encIdx Builder -> Builder -> Builder
`sp` Builder
encVal Builder -> Builder -> Builder
`sp` Builder
encPrev Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
  CopySlice Expr 'EWord
srcIdx Expr 'EWord
dstIdx Expr 'EWord
size Expr 'Buf
src Expr 'Buf
dst ->
    Expr 'EWord
-> Expr 'EWord -> Expr 'EWord -> Builder -> Builder -> Builder
copySlice Expr 'EWord
srcIdx Expr 'EWord
dstIdx Expr 'EWord
size (Expr 'Buf -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'Buf
src) (Expr 'Buf -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'Buf
dst)

  -- we need to do a bit of processing here.
  ConcreteStore Map W256 W256
s -> Map W256 W256 -> Builder
encodeConcreteStore Map W256 W256
s
  AbstractStore Expr 'EAddr
a Maybe W256
idx -> Expr 'EAddr -> Maybe W256 -> Builder
storeName Expr 'EAddr
a Maybe W256
idx
  SStore Expr 'EWord
idx Expr 'EWord
val Expr 'Storage
prev ->
    let encIdx :: Builder
encIdx = Expr 'EWord -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'EWord
idx
        encVal :: Builder
encVal = Expr 'EWord -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'EWord
val
        encPrev :: Builder
encPrev = Expr 'Storage -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'Storage
prev in
    Builder
"(store" Builder -> Builder -> Builder
`sp` Builder
encPrev Builder -> Builder -> Builder
`sp` Builder
encIdx Builder -> Builder -> Builder
`sp` Builder
encVal Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
  SLoad Expr 'EWord
idx Expr 'Storage
store -> Builder -> Expr 'Storage -> Expr 'EWord -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2 Builder
"select" Expr 'Storage
store Expr 'EWord
idx

  Expr a
a -> [Char] -> Builder
forall a. HasCallStack => [Char] -> a
internalError ([Char] -> Builder) -> [Char] -> Builder
forall a b. (a -> b) -> a -> b
$ [Char]
"TODO: implement: " [Char] -> ShowS
forall a. Semigroup a => a -> a -> a
<> Expr a -> [Char]
forall a. Show a => a -> [Char]
show Expr a
a
  where
    op1 :: Builder -> Expr a -> Builder
op1 Builder
op Expr a
a =
      let enc :: Builder
enc =  Expr a -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr a
a in
      Builder
"(" Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
op Builder -> Builder -> Builder
`sp` Builder
enc Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
    op2 :: Builder -> Expr a -> Expr a -> Builder
op2 Builder
op Expr a
a Expr a
b =
      let aenc :: Builder
aenc = Expr a -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr a
a
          benc :: Builder
benc = Expr a -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr a
b in
      Builder
"(" Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
op Builder -> Builder -> Builder
`sp` Builder
aenc Builder -> Builder -> Builder
`sp` Builder
benc Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
    op2CheckZero :: Builder -> Expr a -> Expr a -> Builder
op2CheckZero Builder
op Expr a
a Expr a
b =
      let aenc :: Builder
aenc = Expr a -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr a
a
          benc :: Builder
benc = Expr a -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr a
b in
      Builder
"(ite (= " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
benc Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
" (_ bv0 256)) (_ bv0 256) " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<>  Builder
"(" Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
op Builder -> Builder -> Builder
`sp` Builder
aenc Builder -> Builder -> Builder
`sp` Builder
benc Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
"))"

sp :: Builder -> Builder -> Builder
Builder
a sp :: Builder -> Builder -> Builder
`sp` Builder
b = Builder
a Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> (Text -> Builder
fromText Text
" ") Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
b

zero :: Builder
zero :: Builder
zero = Builder
"(_ bv0 256)"

one :: Builder
one :: Builder
one = Builder
"(_ bv1 256)"

propToSMT :: Prop -> Builder
propToSMT :: Prop -> Builder
propToSMT = \case
  PEq Expr a
a Expr a
b -> Builder -> Expr a -> Expr a -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2 Builder
"=" Expr a
a Expr a
b
  PLT Expr 'EWord
a Expr 'EWord
b -> Builder -> Expr 'EWord -> Expr 'EWord -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2 Builder
"bvult" Expr 'EWord
a Expr 'EWord
b
  PGT Expr 'EWord
a Expr 'EWord
b -> Builder -> Expr 'EWord -> Expr 'EWord -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2 Builder
"bvugt" Expr 'EWord
a Expr 'EWord
b
  PLEq Expr 'EWord
a Expr 'EWord
b -> Builder -> Expr 'EWord -> Expr 'EWord -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2 Builder
"bvule" Expr 'EWord
a Expr 'EWord
b
  PGEq Expr 'EWord
a Expr 'EWord
b -> Builder -> Expr 'EWord -> Expr 'EWord -> Builder
forall {a :: EType} {a :: EType}.
Builder -> Expr a -> Expr a -> Builder
op2 Builder
"bvuge" Expr 'EWord
a Expr 'EWord
b
  PNeg Prop
a ->
    let enc :: Builder
enc = Prop -> Builder
propToSMT Prop
a in
    Builder
"(not " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
enc Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
  PAnd Prop
a Prop
b ->
    let aenc :: Builder
aenc = Prop -> Builder
propToSMT Prop
a
        benc :: Builder
benc = Prop -> Builder
propToSMT Prop
b in
    Builder
"(and " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
aenc Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
" " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
benc Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
  POr Prop
a Prop
b ->
    let aenc :: Builder
aenc = Prop -> Builder
propToSMT Prop
a
        benc :: Builder
benc = Prop -> Builder
propToSMT Prop
b in
    Builder
"(or " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
aenc Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
" " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
benc Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
  PImpl Prop
a Prop
b ->
    let aenc :: Builder
aenc = Prop -> Builder
propToSMT Prop
a
        benc :: Builder
benc = Prop -> Builder
propToSMT Prop
b in
    Builder
"(=> " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
aenc Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
" " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
benc Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"
  PBool Bool
b -> if Bool
b then Builder
"true" else Builder
"false"
  where
    op2 :: Builder -> Expr a -> Expr a -> Builder
op2 Builder
op Expr a
a Expr a
b =
      let aenc :: Builder
aenc = Expr a -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr a
a
          benc :: Builder
benc = Expr a -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr a
b in
      Builder
"(" Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
op Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
" " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
aenc Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
" " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
benc Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"



-- ** Helpers ** ---------------------------------------------------------------------------------


-- | Stores a region of src into dst
copySlice :: Expr EWord -> Expr EWord -> Expr EWord -> Builder -> Builder -> Builder
copySlice :: Expr 'EWord
-> Expr 'EWord -> Expr 'EWord -> Builder -> Builder -> Builder
copySlice Expr 'EWord
srcOffset Expr 'EWord
dstOffset size :: Expr 'EWord
size@(Lit W256
_) Builder
src Builder
dst
  | Expr 'EWord
size Expr 'EWord -> Expr 'EWord -> Bool
forall a. Eq a => a -> a -> Bool
== (W256 -> Expr 'EWord
Lit W256
0) = Builder
dst
  | Bool
otherwise =
    let size' :: Expr 'EWord
size' = (Expr 'EWord -> Expr 'EWord -> Expr 'EWord
Expr.sub Expr 'EWord
size (W256 -> Expr 'EWord
Lit W256
1))
        encDstOff :: Builder
encDstOff = Expr 'EWord -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT (Expr 'EWord -> Expr 'EWord -> Expr 'EWord
Expr.add Expr 'EWord
dstOffset Expr 'EWord
size')
        encSrcOff :: Builder
encSrcOff = Expr 'EWord -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT (Expr 'EWord -> Expr 'EWord -> Expr 'EWord
Expr.add Expr 'EWord
srcOffset Expr 'EWord
size')
        child :: Builder
child = Expr 'EWord
-> Expr 'EWord -> Expr 'EWord -> Builder -> Builder -> Builder
copySlice Expr 'EWord
srcOffset Expr 'EWord
dstOffset Expr 'EWord
size' Builder
src Builder
dst in
    Builder
"(store " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
child Builder -> Builder -> Builder
`sp` Builder
encDstOff Builder -> Builder -> Builder
`sp` Builder
"(select " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
src Builder -> Builder -> Builder
`sp` Builder
encSrcOff Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
"))"
copySlice Expr 'EWord
_ Expr 'EWord
_ Expr 'EWord
_ Builder
_ Builder
_ = [Char] -> Builder
forall a. HasCallStack => [Char] -> a
internalError [Char]
"TODO: implement copySlice with a symbolically sized region"

-- | Unrolls an exponentiation into a series of multiplications
expandExp :: Expr EWord -> W256 -> Builder
expandExp :: Expr 'EWord -> W256 -> Builder
expandExp Expr 'EWord
base W256
expnt
  | W256
expnt W256 -> W256 -> Bool
forall a. Eq a => a -> a -> Bool
== W256
1 = Expr 'EWord -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'EWord
base
  | Bool
otherwise =
    let b :: Builder
b = Expr 'EWord -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'EWord
base
        n :: Builder
n = Expr 'EWord -> W256 -> Builder
expandExp Expr 'EWord
base (W256
expnt W256 -> W256 -> W256
forall a. Num a => a -> a -> a
- W256
1) in
    Builder
"(bvmul " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
b Builder -> Builder -> Builder
`sp` Builder
n Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"

-- | Concatenates a list of bytes into a larger bitvector
concatBytes :: [Expr Byte] -> Builder
concatBytes :: [Expr 'Byte] -> Builder
concatBytes [Expr 'Byte]
bytes =
  let bytesRev :: [Expr 'Byte]
bytesRev = [Expr 'Byte] -> [Expr 'Byte]
forall a. [a] -> [a]
reverse [Expr 'Byte]
bytes
      a2 :: Builder
a2 = Expr 'Byte -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT ([Expr 'Byte] -> Expr 'Byte
forall a. HasCallStack => [a] -> a
head [Expr 'Byte]
bytesRev) in
  (Builder -> Expr 'Byte -> Builder)
-> Builder -> [Expr 'Byte] -> Builder
forall b a. (b -> a -> b) -> b -> [a] -> b
forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
foldl Builder -> Expr 'Byte -> Builder
forall {a :: EType}. Builder -> Expr a -> Builder
wrap Builder
a2 ([Expr 'Byte] -> Builder) -> [Expr 'Byte] -> Builder
forall a b. (a -> b) -> a -> b
$ [Expr 'Byte] -> [Expr 'Byte]
forall a. HasCallStack => [a] -> [a]
tail [Expr 'Byte]
bytesRev
  where
    wrap :: Builder -> Expr a -> Builder
wrap Builder
inner Expr a
byte =
      let byteSMT :: Builder
byteSMT = Expr a -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr a
byte in
      Builder
"(concat " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
byteSMT Builder -> Builder -> Builder
`sp` Builder
inner Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"

-- | Concatenates a list of bytes into a larger bitvector
writeBytes :: ByteString -> Expr Buf -> Builder
writeBytes :: ByteString -> Expr 'Buf -> Builder
writeBytes ByteString
bytes Expr 'Buf
buf = (Int, Builder) -> Builder
forall a b. (a, b) -> b
snd ((Int, Builder) -> Builder) -> (Int, Builder) -> Builder
forall a b. (a -> b) -> a -> b
$ ((Int, Builder) -> Word8 -> (Int, Builder))
-> (Int, Builder) -> ByteString -> (Int, Builder)
forall a. (a -> Word8 -> a) -> a -> ByteString -> a
BS.foldl' (Int, Builder) -> Word8 -> (Int, Builder)
wrap (Int
0, Expr 'Buf -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'Buf
buf) ByteString
bytes
  where
    -- we don't need to store zeros if the base buffer is empty
    skipZeros :: Bool
skipZeros = Expr 'Buf
buf Expr 'Buf -> Expr 'Buf -> Bool
forall a. Eq a => a -> a -> Bool
== Expr 'Buf
forall a. Monoid a => a
mempty
    wrap :: (Int, Builder) -> Word8 -> (Int, Builder)
    wrap :: (Int, Builder) -> Word8 -> (Int, Builder)
wrap (Int
idx, Builder
inner) Word8
byte =
      if Bool
skipZeros Bool -> Bool -> Bool
&& Word8
byte Word8 -> Word8 -> Bool
forall a. Eq a => a -> a -> Bool
== Word8
0
      then (Int
idx Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
1, Builder
inner)
      else let
          byteSMT :: Builder
byteSMT = Expr 'Byte -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT (Word8 -> Expr 'Byte
LitByte Word8
byte)
          idxSMT :: Builder
idxSMT = Expr 'EWord -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT (Expr 'EWord -> Builder) -> (Int -> Expr 'EWord) -> Int -> Builder
forall b c a. (b -> c) -> (a -> b) -> a -> c
. W256 -> Expr 'EWord
Lit (W256 -> Expr 'EWord) -> (Int -> W256) -> Int -> Expr 'EWord
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Int -> W256
forall target source.
(HasCallStack, TryFrom source target, Show source, Typeable source,
 Typeable target) =>
source -> target
unsafeInto (Int -> Builder) -> Int -> Builder
forall a b. (a -> b) -> a -> b
$ Int
idx
        in (Int
idx Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
1, Builder
"(store " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
inner Builder -> Builder -> Builder
`sp` Builder
idxSMT Builder -> Builder -> Builder
`sp` Builder
byteSMT Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")")

encodeConcreteStore :: Map W256 W256 -> Builder
encodeConcreteStore :: Map W256 W256 -> Builder
encodeConcreteStore Map W256 W256
s = (Builder -> (W256, W256) -> Builder)
-> Builder -> [(W256, W256)] -> Builder
forall b a. (b -> a -> b) -> b -> [a] -> b
forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
foldl Builder -> (W256, W256) -> Builder
encodeWrite Builder
"((as const Storage) #x0000000000000000000000000000000000000000000000000000000000000000)" (Map W256 W256 -> [(W256, W256)]
forall k a. Map k a -> [(k, a)]
Map.toList Map W256 W256
s)
  where
    encodeWrite :: Builder -> (W256, W256) -> Builder
encodeWrite Builder
prev (W256
key, W256
val) = let
        encKey :: Builder
encKey = Expr 'EWord -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT (W256 -> Expr 'EWord
Lit W256
key)
        encVal :: Builder
encVal = Expr 'EWord -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT (W256 -> Expr 'EWord
Lit W256
val)
      in Builder
"(store " Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
prev Builder -> Builder -> Builder
`sp` Builder
encKey Builder -> Builder -> Builder
`sp` Builder
encVal Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
")"

storeName :: Expr EAddr -> Maybe W256 -> Builder
storeName :: Expr 'EAddr -> Maybe W256 -> Builder
storeName Expr 'EAddr
a Maybe W256
Nothing = [Char] -> Builder
fromString ([Char]
"baseStore_") Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Expr 'EAddr -> Builder
formatEAddr Expr 'EAddr
a
storeName Expr 'EAddr
a (Just W256
idx) = [Char] -> Builder
fromString ([Char]
"baseStore_") Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Expr 'EAddr -> Builder
formatEAddr Expr 'EAddr
a Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> Builder
"_" Builder -> Builder -> Builder
forall a. Semigroup a => a -> a -> a
<> ([Char] -> Builder
fromString ([Char] -> Builder) -> [Char] -> Builder
forall a b. (a -> b) -> a -> b
$ W256 -> [Char]
forall a. Show a => a -> [Char]
show W256
idx)

formatEAddr :: Expr EAddr -> Builder
formatEAddr :: Expr 'EAddr -> Builder
formatEAddr = \case
  LitAddr Addr
a -> [Char] -> Builder
fromString ([Char]
"litaddr_" [Char] -> ShowS
forall a. Semigroup a => a -> a -> a
<> Addr -> [Char]
forall a. Show a => a -> [Char]
show Addr
a)
  SymAddr Text
a -> Text -> Builder
fromText (Text
"symaddr_" Text -> Text -> Text
forall a. Semigroup a => a -> a -> a
<> Text
a)
  GVar GVar 'EAddr
_ -> [Char] -> Builder
forall a. HasCallStack => [Char] -> a
internalError [Char]
"Unexpected GVar"


-- ** Cex parsing ** --------------------------------------------------------------------------------

parseAddr :: SpecConstant -> Addr
parseAddr :: SpecConstant -> Addr
parseAddr = SpecConstant -> Addr
forall a. (Num a, Eq a) => SpecConstant -> a
parseSC

parseW256 :: SpecConstant -> W256
parseW256 :: SpecConstant -> W256
parseW256 = SpecConstant -> W256
forall a. (Num a, Eq a) => SpecConstant -> a
parseSC

parseInteger :: SpecConstant -> Integer
parseInteger :: SpecConstant -> Integer
parseInteger = SpecConstant -> Integer
forall a. (Num a, Eq a) => SpecConstant -> a
parseSC

parseW8 :: SpecConstant -> Word8
parseW8 :: SpecConstant -> Word8
parseW8 = SpecConstant -> Word8
forall a. (Num a, Eq a) => SpecConstant -> a
parseSC

parseSC :: (Num a, Eq a) => SpecConstant -> a
parseSC :: forall a. (Num a, Eq a) => SpecConstant -> a
parseSC (SCHexadecimal Text
a) = (a, [Char]) -> a
forall a b. (a, b) -> a
fst ((a, [Char]) -> a) -> (Text -> (a, [Char])) -> Text -> a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [(a, [Char])] -> (a, [Char])
forall a. HasCallStack => [a] -> a
head ([(a, [Char])] -> (a, [Char]))
-> (Text -> [(a, [Char])]) -> Text -> (a, [Char])
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ReadS a
forall a. (Eq a, Num a) => ReadS a
Numeric.readHex ReadS a -> (Text -> [Char]) -> Text -> [(a, [Char])]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Text -> [Char]
T.unpack (Text -> [Char]) -> (Text -> Text) -> Text -> [Char]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Text -> Text
T.fromStrict (Text -> a) -> Text -> a
forall a b. (a -> b) -> a -> b
$ Text
a
parseSC (SCBinary Text
a) = (a, [Char]) -> a
forall a b. (a, b) -> a
fst ((a, [Char]) -> a) -> (Text -> (a, [Char])) -> Text -> a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [(a, [Char])] -> (a, [Char])
forall a. HasCallStack => [a] -> a
head ([(a, [Char])] -> (a, [Char]))
-> (Text -> [(a, [Char])]) -> Text -> (a, [Char])
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ReadS a
forall a. (Eq a, Num a) => ReadS a
Numeric.readBin ReadS a -> (Text -> [Char]) -> Text -> [(a, [Char])]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Text -> [Char]
T.unpack (Text -> [Char]) -> (Text -> Text) -> Text -> [Char]
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Text -> Text
T.fromStrict (Text -> a) -> Text -> a
forall a b. (a -> b) -> a -> b
$ Text
a
parseSC SpecConstant
sc = [Char] -> a
forall a. HasCallStack => [Char] -> a
internalError ([Char] -> a) -> [Char] -> a
forall a b. (a -> b) -> a -> b
$ [Char]
"cannot parse: " [Char] -> ShowS
forall a. Semigroup a => a -> a -> a
<> SpecConstant -> [Char]
forall a. Show a => a -> [Char]
show SpecConstant
sc

parseErr :: (Show a) => a -> b
parseErr :: forall a b. Show a => a -> b
parseErr a
res = [Char] -> b
forall a. HasCallStack => [Char] -> a
internalError ([Char] -> b) -> [Char] -> b
forall a b. (a -> b) -> a -> b
$ [Char]
"cannot parse solver response: " [Char] -> ShowS
forall a. Semigroup a => a -> a -> a
<> a -> [Char]
forall a. Show a => a -> [Char]
show a
res

parseVar :: TS.Text -> Expr EWord
parseVar :: Text -> Expr 'EWord
parseVar = Text -> Expr 'EWord
Var

parseEAddr :: TS.Text -> Expr EAddr
parseEAddr :: Text -> Expr 'EAddr
parseEAddr Text
name
  | Just Text
a <- Text -> Text -> Maybe Text
TS.stripPrefix Text
"litaddr_" Text
name = Addr -> Expr 'EAddr
LitAddr ([Char] -> Addr
forall a. Read a => [Char] -> a
read (Text -> [Char]
TS.unpack Text
a))
  | Just Text
a <- Text -> Text -> Maybe Text
TS.stripPrefix Text
"symaddr_" Text
name = Text -> Expr 'EAddr
SymAddr Text
a
  | Bool
otherwise = [Char] -> Expr 'EAddr
forall a. HasCallStack => [Char] -> a
internalError ([Char] -> Expr 'EAddr) -> [Char] -> Expr 'EAddr
forall a b. (a -> b) -> a -> b
$ [Char]
"cannot parse: " [Char] -> ShowS
forall a. Semigroup a => a -> a -> a
<> Text -> [Char]
forall a. Show a => a -> [Char]
show Text
name

parseBlockCtx :: TS.Text -> Expr EWord
parseBlockCtx :: Text -> Expr 'EWord
parseBlockCtx Text
"origin" = Expr 'EWord
Origin
parseBlockCtx Text
"coinbase" = Expr 'EWord
Coinbase
parseBlockCtx Text
"timestamp" = Expr 'EWord
Timestamp
parseBlockCtx Text
"blocknumber" = Expr 'EWord
BlockNumber
parseBlockCtx Text
"prevrandao" = Expr 'EWord
PrevRandao
parseBlockCtx Text
"gaslimit" = Expr 'EWord
GasLimit
parseBlockCtx Text
"chainid" = Expr 'EWord
ChainId
parseBlockCtx Text
"basefee" = Expr 'EWord
BaseFee
parseBlockCtx Text
t = [Char] -> Expr 'EWord
forall a. HasCallStack => [Char] -> a
internalError ([Char] -> Expr 'EWord) -> [Char] -> Expr 'EWord
forall a b. (a -> b) -> a -> b
$ [Char]
"cannot parse " [Char] -> ShowS
forall a. Semigroup a => a -> a -> a
<> (Text -> [Char]
TS.unpack Text
t) [Char] -> ShowS
forall a. Semigroup a => a -> a -> a
<> [Char]
" into an Expr"

parseTxCtx :: TS.Text -> Expr EWord
parseTxCtx :: Text -> Expr 'EWord
parseTxCtx Text
name
  | Text
name Text -> Text -> Bool
forall a. Eq a => a -> a -> Bool
== Text
"txvalue" = Expr 'EWord
TxValue
  | Just Text
a <- Text -> Text -> Maybe Text
TS.stripPrefix Text
"balance_" Text
name = Expr 'EAddr -> Expr 'EWord
Balance (Text -> Expr 'EAddr
parseEAddr Text
a)
  | Bool
otherwise = [Char] -> Expr 'EWord
forall a. HasCallStack => [Char] -> a
internalError ([Char] -> Expr 'EWord) -> [Char] -> Expr 'EWord
forall a b. (a -> b) -> a -> b
$ [Char]
"cannot parse " [Char] -> ShowS
forall a. Semigroup a => a -> a -> a
<> (Text -> [Char]
TS.unpack Text
name) [Char] -> ShowS
forall a. Semigroup a => a -> a -> a
<> [Char]
" into an Expr"

getAddrs :: (TS.Text -> Expr EAddr) -> (Text -> IO Text) -> [TS.Text] -> IO (Map (Expr EAddr) Addr)
getAddrs :: (Text -> Expr 'EAddr)
-> (Text -> IO Text) -> [Text] -> IO (Map (Expr 'EAddr) Addr)
getAddrs Text -> Expr 'EAddr
parseName Text -> IO Text
getVal [Text]
names = (Text -> Expr 'EAddr) -> Map Text Addr -> Map (Expr 'EAddr) Addr
forall k2 k1 a. Ord k2 => (k1 -> k2) -> Map k1 a -> Map k2 a
Map.mapKeys Text -> Expr 'EAddr
parseName (Map Text Addr -> Map (Expr 'EAddr) Addr)
-> IO (Map Text Addr) -> IO (Map (Expr 'EAddr) Addr)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> (Map Text Addr -> Text -> IO (Map Text Addr))
-> Map Text Addr -> [Text] -> IO (Map Text Addr)
forall (t :: * -> *) (m :: * -> *) b a.
(Foldable t, Monad m) =>
(b -> a -> m b) -> b -> t a -> m b
foldM ((SpecConstant -> Addr)
-> (Text -> IO Text) -> Map Text Addr -> Text -> IO (Map Text Addr)
forall a.
(SpecConstant -> a)
-> (Text -> IO Text) -> Map Text a -> Text -> IO (Map Text a)
getOne SpecConstant -> Addr
parseAddr Text -> IO Text
getVal) Map Text Addr
forall a. Monoid a => a
mempty [Text]
names

getVars :: (TS.Text -> Expr EWord) -> (Text -> IO Text) -> [TS.Text] -> IO (Map (Expr EWord) W256)
getVars :: (Text -> Expr 'EWord)
-> (Text -> IO Text) -> [Text] -> IO (Map (Expr 'EWord) W256)
getVars Text -> Expr 'EWord
parseName Text -> IO Text
getVal [Text]
names = (Text -> Expr 'EWord) -> Map Text W256 -> Map (Expr 'EWord) W256
forall k2 k1 a. Ord k2 => (k1 -> k2) -> Map k1 a -> Map k2 a
Map.mapKeys Text -> Expr 'EWord
parseName (Map Text W256 -> Map (Expr 'EWord) W256)
-> IO (Map Text W256) -> IO (Map (Expr 'EWord) W256)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> (Map Text W256 -> Text -> IO (Map Text W256))
-> Map Text W256 -> [Text] -> IO (Map Text W256)
forall (t :: * -> *) (m :: * -> *) b a.
(Foldable t, Monad m) =>
(b -> a -> m b) -> b -> t a -> m b
foldM ((SpecConstant -> W256)
-> (Text -> IO Text) -> Map Text W256 -> Text -> IO (Map Text W256)
forall a.
(SpecConstant -> a)
-> (Text -> IO Text) -> Map Text a -> Text -> IO (Map Text a)
getOne SpecConstant -> W256
parseW256 Text -> IO Text
getVal) Map Text W256
forall a. Monoid a => a
mempty [Text]
names

getOne :: (SpecConstant -> a) -> (Text -> IO Text) -> Map TS.Text a -> TS.Text -> IO (Map TS.Text a)
getOne :: forall a.
(SpecConstant -> a)
-> (Text -> IO Text) -> Map Text a -> Text -> IO (Map Text a)
getOne SpecConstant -> a
parseVal Text -> IO Text
getVal Map Text a
acc Text
name = do
  Text
raw <- Text -> IO Text
getVal (Text -> Text
T.fromStrict Text
name)
  let
    parsed :: ValuationPair
parsed = case Parser GetValueRes -> Text -> Either Text GetValueRes
forall a. Parser a -> Text -> Either Text a
parseCommentFreeFileMsg Parser GetValueRes
forall st. GenParser st GetValueRes
getValueRes (Text -> Text
T.toStrict Text
raw) of
      Right (ResSpecific (ValuationPair
valParsed :| [])) -> ValuationPair
valParsed
      Either Text GetValueRes
r -> Either Text GetValueRes -> ValuationPair
forall a b. Show a => a -> b
parseErr Either Text GetValueRes
r
    val :: a
val = case ValuationPair
parsed of
      (TermQualIdentifier (
        Unqualified (IdSymbol Text
symbol)),
        TermSpecConstant SpecConstant
sc)
          -> if Text
symbol Text -> Text -> Bool
forall a. Eq a => a -> a -> Bool
== Text
name
             then SpecConstant -> a
parseVal SpecConstant
sc
             else [Char] -> a
forall a. HasCallStack => [Char] -> a
internalError [Char]
"solver did not return model for requested value"
      ValuationPair
r -> ValuationPair -> a
forall a b. Show a => a -> b
parseErr ValuationPair
r
  Map Text a -> IO (Map Text a)
forall a. a -> IO a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Map Text a -> IO (Map Text a)) -> Map Text a -> IO (Map Text a)
forall a b. (a -> b) -> a -> b
$ Text -> a -> Map Text a -> Map Text a
forall k a. Ord k => k -> a -> Map k a -> Map k a
Map.insert Text
name a
val Map Text a
acc

-- | Queries the solver for models for each of the expressions representing the
-- max read index for a given buffer
queryMaxReads :: (Text -> IO Text) -> Map Text (Expr EWord)  -> IO (Map Text W256)
queryMaxReads :: (Text -> IO Text) -> Map Text (Expr 'EWord) -> IO (Map Text W256)
queryMaxReads Text -> IO Text
getVal Map Text (Expr 'EWord)
maxReads = (Expr 'EWord -> IO W256)
-> Map Text (Expr 'EWord) -> IO (Map Text W256)
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> Map Text a -> m (Map Text b)
mapM ((Text -> IO Text) -> Expr 'EWord -> IO W256
queryValue Text -> IO Text
getVal) Map Text (Expr 'EWord)
maxReads

-- | Gets the initial model for each buffer, these will often be much too large for our purposes
getBufs :: (Text -> IO Text) -> [Text] -> IO (Map (Expr Buf) BufModel)
getBufs :: (Text -> IO Text) -> [Text] -> IO (Map (Expr 'Buf) BufModel)
getBufs Text -> IO Text
getVal [Text]
bufs = (Map (Expr 'Buf) BufModel -> Text -> IO (Map (Expr 'Buf) BufModel))
-> Map (Expr 'Buf) BufModel
-> [Text]
-> IO (Map (Expr 'Buf) BufModel)
forall (t :: * -> *) (m :: * -> *) b a.
(Foldable t, Monad m) =>
(b -> a -> m b) -> b -> t a -> m b
foldM Map (Expr 'Buf) BufModel -> Text -> IO (Map (Expr 'Buf) BufModel)
getBuf Map (Expr 'Buf) BufModel
forall a. Monoid a => a
mempty [Text]
bufs
  where
    getLength :: Text -> IO W256
    getLength :: Text -> IO W256
getLength Text
name = do
      Text
val <- Text -> IO Text
getVal (Text
name Text -> Text -> Text
forall a. Semigroup a => a -> a -> a
<> Text
"_length ")
      W256 -> IO W256
forall a. a -> IO a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (W256 -> IO W256) -> W256 -> IO W256
forall a b. (a -> b) -> a -> b
$ case Parser GetValueRes -> Text -> Either Text GetValueRes
forall a. Parser a -> Text -> Either Text a
parseCommentFreeFileMsg Parser GetValueRes
forall st. GenParser st GetValueRes
getValueRes (Text -> Text
T.toStrict Text
val) of
        Right (ResSpecific (ValuationPair
parsed :| [])) -> case ValuationPair
parsed of
          (TermQualIdentifier (Unqualified (IdSymbol Text
symbol)), (TermSpecConstant SpecConstant
sc))
            -> if Text
symbol Text -> Text -> Bool
forall a. Eq a => a -> a -> Bool
== (Text -> Text
T.toStrict (Text -> Text) -> Text -> Text
forall a b. (a -> b) -> a -> b
$ Text
name Text -> Text -> Text
forall a. Semigroup a => a -> a -> a
<> Text
"_length")
               then SpecConstant -> W256
parseW256 SpecConstant
sc
               else [Char] -> W256
forall a. HasCallStack => [Char] -> a
internalError [Char]
"solver did not return model for requested value"
          ValuationPair
res -> ValuationPair -> W256
forall a b. Show a => a -> b
parseErr ValuationPair
res
        Either Text GetValueRes
res -> Either Text GetValueRes -> W256
forall a b. Show a => a -> b
parseErr Either Text GetValueRes
res

    getBuf :: Map (Expr Buf) BufModel -> Text -> IO (Map (Expr Buf) BufModel)
    getBuf :: Map (Expr 'Buf) BufModel -> Text -> IO (Map (Expr 'Buf) BufModel)
getBuf Map (Expr 'Buf) BufModel
acc Text
name = do
      W256
len <- Text -> IO W256
getLength Text
name
      Text
val <- Text -> IO Text
getVal Text
name

      BufModel
buf <- case Parser GetValueRes -> Text -> Either Text GetValueRes
forall a. Parser a -> Text -> Either Text a
parseCommentFreeFileMsg Parser GetValueRes
forall st. GenParser st GetValueRes
getValueRes (Text -> Text
T.toStrict Text
val) of
        Right (ResSpecific (ValuationPair
valParsed :| [])) -> case ValuationPair
valParsed of
          (TermQualIdentifier (Unqualified (IdSymbol Text
symbol)), Term
term)
            -> if (Text -> Text
T.fromStrict Text
symbol) Text -> Text -> Bool
forall a. Eq a => a -> a -> Bool
== Text
name
               then BufModel -> IO BufModel
forall a. a -> IO a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (BufModel -> IO BufModel) -> BufModel -> IO BufModel
forall a b. (a -> b) -> a -> b
$ W256 -> Term -> BufModel
parseBuf W256
len Term
term
               else [Char] -> IO BufModel
forall a. HasCallStack => [Char] -> a
internalError [Char]
"solver did not return model for requested value"
          ValuationPair
res -> [Char] -> IO BufModel
forall a. HasCallStack => [Char] -> a
internalError ([Char] -> IO BufModel) -> [Char] -> IO BufModel
forall a b. (a -> b) -> a -> b
$ [Char]
"cannot parse solver response: " [Char] -> ShowS
forall a. Semigroup a => a -> a -> a
<> ValuationPair -> [Char]
forall a. Show a => a -> [Char]
show ValuationPair
res
        Either Text GetValueRes
res -> [Char] -> IO BufModel
forall a. HasCallStack => [Char] -> a
internalError ([Char] -> IO BufModel) -> [Char] -> IO BufModel
forall a b. (a -> b) -> a -> b
$ [Char]
"cannot parse solver response: " [Char] -> ShowS
forall a. Semigroup a => a -> a -> a
<> Either Text GetValueRes -> [Char]
forall a. Show a => a -> [Char]
show Either Text GetValueRes
res
      Map (Expr 'Buf) BufModel -> IO (Map (Expr 'Buf) BufModel)
forall a. a -> IO a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Map (Expr 'Buf) BufModel -> IO (Map (Expr 'Buf) BufModel))
-> Map (Expr 'Buf) BufModel -> IO (Map (Expr 'Buf) BufModel)
forall a b. (a -> b) -> a -> b
$ Expr 'Buf
-> BufModel -> Map (Expr 'Buf) BufModel -> Map (Expr 'Buf) BufModel
forall k a. Ord k => k -> a -> Map k a -> Map k a
Map.insert (Text -> Expr 'Buf
AbstractBuf (Text -> Expr 'Buf) -> Text -> Expr 'Buf
forall a b. (a -> b) -> a -> b
$ Text -> Text
T.toStrict Text
name) BufModel
buf Map (Expr 'Buf) BufModel
acc

    parseBuf :: W256 -> Term -> BufModel
    parseBuf :: W256 -> Term -> BufModel
parseBuf W256
len = CompressedBuf -> BufModel
Comp (CompressedBuf -> BufModel)
-> (Term -> CompressedBuf) -> Term -> BufModel
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Map Text CompressedBuf -> Term -> CompressedBuf
go Map Text CompressedBuf
forall a. Monoid a => a
mempty
      where
        go :: Map Text CompressedBuf -> Term -> CompressedBuf
go Map Text CompressedBuf
env = \case
          -- constant arrays
          (TermApplication (
            Qualified (IdSymbol Text
"const") (
              SortParameter (IdSymbol Text
"Array") (
                SortSymbol (IdIndexed Text
"BitVec" (IxNumeral Text
"256" :| []))
                :| [SortSymbol (IdIndexed Text
"BitVec" (IxNumeral Text
"8" :| []))]
              )
            )) ((TermSpecConstant SpecConstant
val :| [])))
            -> case SpecConstant
val of
                 SCHexadecimal Text
"00" -> Word8 -> W256 -> CompressedBuf
Base Word8
0 W256
0
                 SpecConstant
v -> Word8 -> W256 -> CompressedBuf
Base (SpecConstant -> Word8
parseW8 SpecConstant
v) W256
len

          -- writing a byte over some array
          (TermApplication
            (Unqualified (IdSymbol Text
"store"))
            (Term
base :| [TermSpecConstant SpecConstant
idx, TermSpecConstant SpecConstant
val])
            ) -> let
              pbase :: CompressedBuf
pbase = Map Text CompressedBuf -> Term -> CompressedBuf
go Map Text CompressedBuf
env Term
base
              pidx :: W256
pidx = SpecConstant -> W256
parseW256 SpecConstant
idx
              pval :: Word8
pval = SpecConstant -> Word8
parseW8 SpecConstant
val
            in Word8 -> W256 -> CompressedBuf -> CompressedBuf
Write Word8
pval W256
pidx CompressedBuf
pbase

          -- binding a new name
          (TermLet ((VarBinding Text
name Term
bound) :| []) Term
term) -> let
              pbound :: CompressedBuf
pbound = Map Text CompressedBuf -> Term -> CompressedBuf
go Map Text CompressedBuf
env Term
bound
            in Map Text CompressedBuf -> Term -> CompressedBuf
go (Text
-> CompressedBuf
-> Map Text CompressedBuf
-> Map Text CompressedBuf
forall k a. Ord k => k -> a -> Map k a -> Map k a
Map.insert Text
name CompressedBuf
pbound Map Text CompressedBuf
env) Term
term

          -- looking up a bound name
          (TermQualIdentifier (Unqualified (IdSymbol Text
name))) -> case Text -> Map Text CompressedBuf -> Maybe CompressedBuf
forall k a. Ord k => k -> Map k a -> Maybe a
Map.lookup Text
name Map Text CompressedBuf
env of
            Just CompressedBuf
t -> CompressedBuf
t
            Maybe CompressedBuf
Nothing -> [Char] -> CompressedBuf
forall a. HasCallStack => [Char] -> a
internalError ([Char] -> CompressedBuf) -> [Char] -> CompressedBuf
forall a b. (a -> b) -> a -> b
$ [Char]
"could not find "
                            [Char] -> ShowS
forall a. Semigroup a => a -> a -> a
<> (Text -> [Char]
TS.unpack Text
name)
                            [Char] -> ShowS
forall a. Semigroup a => a -> a -> a
<> [Char]
" in environment mapping"
          Term
p -> Term -> CompressedBuf
forall a b. Show a => a -> b
parseErr Term
p

-- | Takes a Map containing all reads from a store with an abstract base, as
-- well as the concrete part of the storage prestate and returns a fully
-- concretized storage
getStore
  :: (Text -> IO Text)
  -> Map (Expr EAddr, Maybe W256) (Set (Expr EWord))
  -> IO (Map (Expr EAddr) (Map W256 W256))
getStore :: (Text -> IO Text)
-> Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord))
-> IO (Map (Expr 'EAddr) (Map W256 W256))
getStore Text -> IO Text
getVal Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord))
abstractReads =
  ([(Expr 'EAddr, Map W256 W256)]
 -> Map (Expr 'EAddr) (Map W256 W256))
-> IO [(Expr 'EAddr, Map W256 W256)]
-> IO (Map (Expr 'EAddr) (Map W256 W256))
forall a b. (a -> b) -> IO a -> IO b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap [(Expr 'EAddr, Map W256 W256)] -> Map (Expr 'EAddr) (Map W256 W256)
forall k a. Ord k => [(k, a)] -> Map k a
Map.fromList (IO [(Expr 'EAddr, Map W256 W256)]
 -> IO (Map (Expr 'EAddr) (Map W256 W256)))
-> IO [(Expr 'EAddr, Map W256 W256)]
-> IO (Map (Expr 'EAddr) (Map W256 W256))
forall a b. (a -> b) -> a -> b
$ [((Expr 'EAddr, Maybe W256), Set (Expr 'EWord))]
-> (((Expr 'EAddr, Maybe W256), Set (Expr 'EWord))
    -> IO (Expr 'EAddr, Map W256 W256))
-> IO [(Expr 'EAddr, Map W256 W256)]
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
t a -> (a -> m b) -> m (t b)
forM (Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord))
-> [((Expr 'EAddr, Maybe W256), Set (Expr 'EWord))]
forall k a. Map k a -> [(k, a)]
Map.toList Map (Expr 'EAddr, Maybe W256) (Set (Expr 'EWord))
abstractReads) ((((Expr 'EAddr, Maybe W256), Set (Expr 'EWord))
  -> IO (Expr 'EAddr, Map W256 W256))
 -> IO [(Expr 'EAddr, Map W256 W256)])
-> (((Expr 'EAddr, Maybe W256), Set (Expr 'EWord))
    -> IO (Expr 'EAddr, Map W256 W256))
-> IO [(Expr 'EAddr, Map W256 W256)]
forall a b. (a -> b) -> a -> b
$ \((Expr 'EAddr
addr, Maybe W256
idx), Set (Expr 'EWord)
slots) -> do
    let name :: Text
name = Builder -> Text
toLazyText (Expr 'EAddr -> Maybe W256 -> Builder
storeName Expr 'EAddr
addr Maybe W256
idx)
    Text
raw <- Text -> IO Text
getVal Text
name
    let parsed :: ValuationPair
parsed = case Parser GetValueRes -> Text -> Either Text GetValueRes
forall a. Parser a -> Text -> Either Text a
parseCommentFreeFileMsg Parser GetValueRes
forall st. GenParser st GetValueRes
getValueRes (Text -> Text
T.toStrict Text
raw) of
                   Right (ResSpecific (ValuationPair
valParsed :| [])) -> ValuationPair
valParsed
                   Either Text GetValueRes
r -> Either Text GetValueRes -> ValuationPair
forall a b. Show a => a -> b
parseErr Either Text GetValueRes
r
        -- first interpret SMT term as a function
        fun :: W256 -> W256
fun = case ValuationPair
parsed of
                (TermQualIdentifier (Unqualified (IdSymbol Text
symbol)), Term
term) ->
                  if Text
symbol Text -> Text -> Bool
forall a. Eq a => a -> a -> Bool
== (Text -> Text
T.toStrict Text
name)
                  then Map Text Term -> Term -> W256 -> W256
interpret1DArray Map Text Term
forall k a. Map k a
Map.empty Term
term
                  else [Char] -> W256 -> W256
forall a. HasCallStack => [Char] -> a
internalError [Char]
"solver did not return model for requested value"
                ValuationPair
r -> ValuationPair -> W256 -> W256
forall a b. Show a => a -> b
parseErr ValuationPair
r

    -- then create a map by adding only the locations that are read by the program
    Map W256 W256
store <- (Map W256 W256 -> Expr 'EWord -> IO (Map W256 W256))
-> Map W256 W256 -> Set (Expr 'EWord) -> IO (Map W256 W256)
forall (t :: * -> *) (m :: * -> *) b a.
(Foldable t, Monad m) =>
(b -> a -> m b) -> b -> t a -> m b
foldM (\Map W256 W256
m Expr 'EWord
slot -> do
      W256
slot' <- (Text -> IO Text) -> Expr 'EWord -> IO W256
queryValue Text -> IO Text
getVal Expr 'EWord
slot
      Map W256 W256 -> IO (Map W256 W256)
forall a. a -> IO a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Map W256 W256 -> IO (Map W256 W256))
-> Map W256 W256 -> IO (Map W256 W256)
forall a b. (a -> b) -> a -> b
$ W256 -> W256 -> Map W256 W256 -> Map W256 W256
forall k a. Ord k => k -> a -> Map k a -> Map k a
Map.insert W256
slot' (W256 -> W256
fun W256
slot') Map W256 W256
m) Map W256 W256
forall k a. Map k a
Map.empty Set (Expr 'EWord)
slots
    (Expr 'EAddr, Map W256 W256) -> IO (Expr 'EAddr, Map W256 W256)
forall a. a -> IO a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Expr 'EAddr
addr, Map W256 W256
store)

-- | Ask the solver to give us the concrete value of an arbitrary abstract word
queryValue :: (Text -> IO Text) -> Expr EWord -> IO W256
queryValue :: (Text -> IO Text) -> Expr 'EWord -> IO W256
queryValue Text -> IO Text
_ (Lit W256
w) = W256 -> IO W256
forall a. a -> IO a
forall (f :: * -> *) a. Applicative f => a -> f a
pure W256
w
queryValue Text -> IO Text
getVal Expr 'EWord
w = do
  let expr :: Text
expr = Builder -> Text
toLazyText (Builder -> Text) -> Builder -> Text
forall a b. (a -> b) -> a -> b
$ Expr 'EWord -> Builder
forall (a :: EType). Expr a -> Builder
exprToSMT Expr 'EWord
w
  Text
raw <- Text -> IO Text
getVal Text
expr
  case Parser GetValueRes -> Text -> Either Text GetValueRes
forall a. Parser a -> Text -> Either Text a
parseCommentFreeFileMsg Parser GetValueRes
forall st. GenParser st GetValueRes
getValueRes (Text -> Text
T.toStrict Text
raw) of
    Right (ResSpecific (ValuationPair
valParsed :| [])) ->
      case ValuationPair
valParsed of
        (Term
_, TermSpecConstant SpecConstant
sc) -> W256 -> IO W256
forall a. a -> IO a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (W256 -> IO W256) -> W256 -> IO W256
forall a b. (a -> b) -> a -> b
$ SpecConstant -> W256
parseW256 SpecConstant
sc
        ValuationPair
_ -> [Char] -> IO W256
forall a. HasCallStack => [Char] -> a
internalError ([Char] -> IO W256) -> [Char] -> IO W256
forall a b. (a -> b) -> a -> b
$ [Char]
"cannot parse model for: " [Char] -> ShowS
forall a. Semigroup a => a -> a -> a
<> Expr 'EWord -> [Char]
forall a. Show a => a -> [Char]
show Expr 'EWord
w
    Either Text GetValueRes
r -> Either Text GetValueRes -> IO W256
forall a b. Show a => a -> b
parseErr Either Text GetValueRes
r

-- | Interpret an N-dimensional array as a value of type a.
-- Parameterized by an interpretation function for array values.
interpretNDArray :: (Map Symbol Term -> Term -> a) -> (Map Symbol Term) -> Term -> (W256 -> a)
interpretNDArray :: forall a.
(Map Text Term -> Term -> a) -> Map Text Term -> Term -> W256 -> a
interpretNDArray Map Text Term -> Term -> a
interp Map Text Term
env = \case
  -- variable reference
  TermQualIdentifier (Unqualified (IdSymbol Text
s)) ->
    case Text -> Map Text Term -> Maybe Term
forall k a. Ord k => k -> Map k a -> Maybe a
Map.lookup Text
s Map Text Term
env of
      Just Term
t -> (Map Text Term -> Term -> a) -> Map Text Term -> Term -> W256 -> a
forall a.
(Map Text Term -> Term -> a) -> Map Text Term -> Term -> W256 -> a
interpretNDArray Map Text Term -> Term -> a
interp Map Text Term
env Term
t
      Maybe Term
Nothing -> [Char] -> W256 -> a
forall a. HasCallStack => [Char] -> a
internalError [Char]
"unknown identifier, cannot parse array"
  -- (let (x t') t)
  TermLet (VarBinding Text
x Term
t' :| []) Term
t -> (Map Text Term -> Term -> a) -> Map Text Term -> Term -> W256 -> a
forall a.
(Map Text Term -> Term -> a) -> Map Text Term -> Term -> W256 -> a
interpretNDArray Map Text Term -> Term -> a
interp (Text -> Term -> Map Text Term -> Map Text Term
forall k a. Ord k => k -> a -> Map k a -> Map k a
Map.insert Text
x Term
t' Map Text Term
env) Term
t
  TermLet (VarBinding Text
x Term
t' :| [VarBinding]
lets) Term
t -> (Map Text Term -> Term -> a) -> Map Text Term -> Term -> W256 -> a
forall a.
(Map Text Term -> Term -> a) -> Map Text Term -> Term -> W256 -> a
interpretNDArray Map Text Term -> Term -> a
interp (Text -> Term -> Map Text Term -> Map Text Term
forall k a. Ord k => k -> a -> Map k a -> Map k a
Map.insert Text
x Term
t' Map Text Term
env) (NonEmpty VarBinding -> Term -> Term
TermLet ([VarBinding] -> NonEmpty VarBinding
forall a. HasCallStack => [a] -> NonEmpty a
NonEmpty.fromList [VarBinding]
lets) Term
t)
  -- (as const (Array (_ BitVec 256) (_ BitVec 256))) SpecConstant
  TermApplication QualIdentifier
asconst (Term
val :| []) | QualIdentifier -> Bool
isArrConst QualIdentifier
asconst ->
    \W256
_ -> Map Text Term -> Term -> a
interp Map Text Term
env Term
val
  -- (store arr ind val)
  TermApplication QualIdentifier
store (Term
arr :| [TermSpecConstant SpecConstant
ind, Term
val]) | QualIdentifier -> Bool
isStore QualIdentifier
store ->
    \W256
x -> if W256
x W256 -> W256 -> Bool
forall a. Eq a => a -> a -> Bool
== SpecConstant -> W256
parseW256 SpecConstant
ind then Map Text Term -> Term -> a
interp Map Text Term
env Term
val else (Map Text Term -> Term -> a) -> Map Text Term -> Term -> W256 -> a
forall a.
(Map Text Term -> Term -> a) -> Map Text Term -> Term -> W256 -> a
interpretNDArray Map Text Term -> Term -> a
interp Map Text Term
env Term
arr W256
x
  Term
t -> [Char] -> W256 -> a
forall a. HasCallStack => [Char] -> a
internalError ([Char] -> W256 -> a) -> [Char] -> W256 -> a
forall a b. (a -> b) -> a -> b
$ [Char]
"cannot parse array value. Unexpected term: " [Char] -> ShowS
forall a. Semigroup a => a -> a -> a
<> (Term -> [Char]
forall a. Show a => a -> [Char]
show Term
t)

  where
    isArrConst :: QualIdentifier -> Bool
    isArrConst :: QualIdentifier -> Bool
isArrConst = \case
      Qualified (IdSymbol Text
"const") (SortParameter (IdSymbol Text
"Array") NonEmpty Sort
_) -> Bool
True
      QualIdentifier
_ -> Bool
False

    isStore :: QualIdentifier -> Bool
    isStore :: QualIdentifier -> Bool
isStore QualIdentifier
t = QualIdentifier
t QualIdentifier -> QualIdentifier -> Bool
forall a. Eq a => a -> a -> Bool
== Identifier -> QualIdentifier
Unqualified (Text -> Identifier
IdSymbol Text
"store")


-- | Interpret an 1-dimensional array as a function
interpret1DArray :: (Map Symbol Term) -> Term -> (W256 -> W256)
interpret1DArray :: Map Text Term -> Term -> W256 -> W256
interpret1DArray = (Map Text Term -> Term -> W256)
-> Map Text Term -> Term -> W256 -> W256
forall a.
(Map Text Term -> Term -> a) -> Map Text Term -> Term -> W256 -> a
interpretNDArray Map Text Term -> Term -> W256
interpretW256
  where
    interpretW256 :: (Map Symbol Term) -> Term -> W256
    interpretW256 :: Map Text Term -> Term -> W256
interpretW256 Map Text Term
_ (TermSpecConstant SpecConstant
val) = SpecConstant -> W256
parseW256 SpecConstant
val
    interpretW256 Map Text Term
env (TermQualIdentifier (Unqualified (IdSymbol Text
s))) =
      case Text -> Map Text Term -> Maybe Term
forall k a. Ord k => k -> Map k a -> Maybe a
Map.lookup Text
s Map Text Term
env of
        Just Term
t -> Map Text Term -> Term -> W256
interpretW256 Map Text Term
env Term
t
        Maybe Term
Nothing -> [Char] -> W256
forall a. HasCallStack => [Char] -> a
internalError [Char]
"unknown identifier, cannot parse array"
    interpretW256 Map Text Term
_ Term
t = [Char] -> W256
forall a. HasCallStack => [Char] -> a
internalError ([Char] -> W256) -> [Char] -> W256
forall a b. (a -> b) -> a -> b
$ [Char]
"cannot parse array value. Unexpected term: " [Char] -> ShowS
forall a. Semigroup a => a -> a -> a
<> (Term -> [Char]
forall a. Show a => a -> [Char]
show Term
t)