sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page
Bitwuzla.IncrementalSourceCreate a new Bitwuzla session in incremental mode.
include sig ... endThe bit-vector kind.
The rounding-mode kind.
The floating-point kind.
type (!'a, !'b) ar = [ ] constraint 'a = [< `Bv | `Fp | `Rm ] constraint 'b = [< `Bv | `Fp | `Rm ]The array kind with 'a index and 'b element.
Both index and element should be of bit-vector, rounding-mode or floating-point kind
The function kind taking 'a argument and returning 'b element.
Functions accept only bit-vector, rounding-mode or floating-point as argument and return only bit-vector.
A sort of 'a kind.
A term of 'a kind.
A value of 'a kind.
Values are subtype of terms and can be downcasted using :> operator.
A satisfiability result.
pp formatter result pretty print result.
check_sat ~interrupt () check satisfiability of current input formula.
timeout t f configure the interruptible function f with a timeout of t seconds.
timeout can be used to limit the time spend on check_sat or check_sat_assuming. For instance, for a 1 second time credit, use:
(timeout 1. check_sat) ()(timeout 1. check_sat_assuming) assumptionsunafe_close () close the session.
UNSAFE: call this ONLY to release the resources earlier if the session is about to be garbage collected.
push nlevels push context levels.
pop nlevels pop context levels.
val check_sat_assuming :
?interrupt:(('a -> int) * 'a) ->
?names:string array ->
bv term array ->
resultcheck_sat_assuming ~interrupt ~names assumptions check satisfiability of current input formula, with the search for a solution guided by the given assumptions.
An input formula consists of assertions added via assert' combined with assumptions via Boolean and. Unsatifiable assumptions can be queried via get_unsat_assumptions.