You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

255 lines
8.7 KiB

1 week ago
  1. Student 1: Name Surname Matriculation Number
  2. Student 2: Name Surname Matriculation Number
  3. ## Basics of z3
  4. The exercises you will solve in the practicals are only going to cover a small subset of the possibilities of solving problems with z3. If you are interested in more background or need to look into some details we suggest you to take a look [here](https://theory.stanford.edu/~nikolaj/programmingz3.html).
  5. #### A Simple Example
  6. In a python program we usually follow this workflow:
  7. - import `z3`,
  8. - declare needed variables of specific `Sort` (this is the word we use for types in z3),
  9. - declare a solver: `solver = Solver()` and
  10. - add constraints for the declared variables to the solver.
  11. - After adding all the constraints we tell the solver to try to `check()` for satisfiability and if the solver tells us that the model is satisfiable we may
  12. - print the model.
  13. Consider the following simple example:
  14. ``` python
  15. # coding: utf-8
  16. import os, sys
  17. from z3 import *
  18. # v-- internal z3 representation
  19. x = Bool('x')
  20. #^-- python variable
  21. # v-- internal z3 representation
  22. gamma = Bool('g') # possible, but not advisable
  23. #^-- python variable
  24. # Declare a solver with which we can do some work
  25. solver = Solver()
  26. p = Bool('p')
  27. qu = Bool('q')
  28. r = Bool('r')
  29. # p -> q, r = ~q, ~p or r
  30. # Add constraints
  31. solver.add(Implies(p,qu))
  32. solver.add(r == Not(qu))
  33. solver.add(Or(Not(p), r))
  34. # solver.add(r == q)
  35. res = solver.check()
  36. if res != sat:
  37. print("unsat")
  38. sys.exit(1)
  39. m = solver.model()
  40. for d in m.decls():
  41. print("%s -> %s" % (d, m[d]))
  42. ```
  43. At first we import z3 `from z3 import *`.
  44. We then need to declare variables:
  45. ``` python
  46. # v-- internal z3 representation
  47. x = Bool('x')
  48. #^-- python variable
  49. # v-- internal z3 representation
  50. gamma = Bool('g') # possible, but not advisable
  51. #^-- python variable
  52. ```
  53. Lets have a closer look: In z3 we declare variable of some kind of `Sort` just like you would declare variable of some type in other language. z3 has a `BoolSort`, `IntSort`, `RealSort` and some more. Our example from above only covers propositional logic so far so we have declared our variables of type `Bool`.
  54. We have to distinct between z3 variables and python variables. The code block above gives you the answer to this distinction and as the second examples tells you, you may give these two different names, but this is not advisable since it will probably only confuse you and others which need to read your code.
  55. In order to check for satisfiability we are going to need a solver: `solver = Solver()`.
  56. In the next step we will add some constraints to the solver:
  57. ``` python
  58. p = Bool('p')
  59. qu = Bool('qu')
  60. r = Bool('r')
  61. # p -> q, r = ~q, ~p or r
  62. # Add constraints
  63. solver.add(Implies(p,qu))
  64. solver.add(r == Not(qu))
  65. solver.add(Or(Not(p), r))
  66. ```
  67. Adding constraints is done with the solvers `add()` method. Remember that the constraints have to be expressed in prefix notation.
  68. At the very end we have to tell the solver to check whether our constraints are satisfiable, is they are not we simply exit the program:
  69. ``` python
  70. res = solver.check()
  71. if res != sat:
  72. print("unsat")
  73. sys.exit(1)
  74. ```
  75. Our example is satisfiable so in the end we print the model by asking the solver for the created model and print all of the variables which have an associated value in the created model:
  76. ``` python
  77. m = solver.model()
  78. for d in m.decls():
  79. print("%s -> %s" % (d, m[d]))
  80. > q -> True
  81. > p -> False
  82. > r -> False
  83. ```
  84. This can be done with `solver.model().decls()` which lists the assignments as a dictionary. You can also evaluate individual variables in your model:
  85. ``` python
  86. m = solver.model()
  87. print("qu: " + str(m.eval(qu)))
  88. print("p: " + str(m.eval(p)))
  89. print("r: " + str(m.eval(r)))
  90. > qu: True
  91. > p: False
  92. > r: False
  93. ```
  94. ### First Order Logic Types and Constraints
  95. So far we have only touched propositional logic, but z3 is an SMT-solver so lets expand our knowledge to use these funtionalities.
  96. ``` python
  97. from z3 import Solver, Int
  98. from z3 import sat as SAT
  99. x, y = Int('x'), Int("%s" % "y") # create integer variables
  100. solver = Solver() # create a solver
  101. solver.add(x < 6 * y) # assert x < 6y
  102. solver.add(x % 2 == 1) # assert x == 1 mod 2
  103. solver.add(sum([x,y]) == 42) # assert x + y = 42
  104. if solver.check() == SAT: # check if satisfiable
  105. m = solver.model() # retrieve the solution
  106. print(m[x] + m[y]) # print symbolic sum
  107. print(m.eval(x) + m.eval(y)) # use eval to print
  108. # hint: use m[x].as_long() to get python integers
  109. for d in m.decls():
  110. print("%s -> %d" % (d, m[d].as_long()))
  111. > 35 + 7
  112. > 35 + 7
  113. > x -> 35
  114. > y -> 7
  115. ```
  116. From the example above, you can see that creating z3 integer variables follows the same principle as for booleans.
  117. Python expressions are valid in constraints too, for example using a built-in function: `solver.add(sum([x,y]) == 42)`.
  118. ### Custom Datatypes and Sorts
  119. So far we have used z3's capabilities by using boolean or integer valued variables. This already gives us quite a powerful tool, but we want to extend this to be able to use our own custom structures and datatypes. A first approach is to use the `DataType` functionality.
  120. ``` python
  121. Colour = DataType("Colour")
  122. ```
  123. This will create a placeholder that contains constructors and accessors for our custom `Colour` variables.
  124. ``` python
  125. Colour.declare("green")
  126. Colour.declare("yellow")
  127. ColourSort = Colour.create()
  128. ```
  129. We have now defined two constructors for possible values of our `Colour` variable type and finalized the definition of `Colour`. `.create()` returns a sort that we can now work with. z3 will now internally work with these possible values for `Colour`. You may think of `Colour` in the same way as of the `IntSort` mentioned above. Let's consider this once more. We have used `Int(...)` to tell z3 that we want it to create an internal representation of an integer variable. This could be refactored as such:
  130. ``` python
  131. x, y = Const('x', IntSort()), Const("%s" % "y", IntSort()) # create integer variables
  132. ```
  133. This means that `Int("x")` is only syntactic sugar to make our code more legible. But this also tells us how to use our `Colour` datatype:
  134. ``` python
  135. x = Const("cell", ColourSort)
  136. ```
  137. We have used the `DataType` functionality solely to model an enum-type variable. A constructor for such a datatype but might also have some accessor associated with it, allowing us to create algebraic structures like lists or trees.
  138. Another type of a custom structures are uninterpreted sorts. These can be created using `DeclareSort(...)`:
  139. ```python
  140. A = DeclareSort('A')
  141. x, y = Consts('x y', A)
  142. ```
  143. As you can see we may use them in a similar way to the above discussed `DataType`s. z3 will see `x` and `y` as of type `A`. Since these sorts are uninterpreted the do not come with any kind of semantics, i.e. we have no means to compare `x` and `y`. This will be useful for our next topic: Uninterpreted functions.
  144. Note that you do not have to actually `create()` your custom sort, it will be handled like a set of its declared variables.
  145. ### Uninterpreted Functions
  146. Uninterpreted functions give us a way to let z3 model relationships, equalities, etc. between certain variables. A function maps from a set of sorts to a sort.
  147. Consider this example (taken from [here](https://ece.uwaterloo.ca/~agurfink/ece653w17/z3py-advanced)):
  148. ```python
  149. from z3 import *
  150. A = DeclareSort('A')
  151. x, y = Consts('x y', A)
  152. f = Function('f', A, A)
  153. s = Solver()
  154. s.add(f(x) == y, f(f(x)) == x, x != y)
  155. s.check()
  156. m = s.model()
  157. print(m)
  158. print("interpretation assigned to A:")
  159. print("f(x) = " + m.evaluate(f(x)).decl().name())
  160. print("f(y) = " + m.evaluate(f(y)).decl().name())
  161. ```
  162. We use an uninterpreted sort `A` with values `x` and `y`. `f` is declared as a `Function(...)` mapping `A` to `A`. We are then telling the solver that `f` used on `x` will map to `y`, `f` used twice on `x` will give `x` again and that those two values are different. Checking for satisfiability will now check if such a function can exist. If it can the model produced by z3 will contain the look-up table for `f` that we have expected.
  163. ```python
  164. [x = A!val!0,
  165. y = A!val!1,
  166. f = [A!val!1 -> A!val!0, else -> A!val!1]]
  167. interpretation assigned to A:
  168. f(x) = A!val!1
  169. f(y) = A!val!0
  170. ```
  171. This function does not need to be fully defined, as z3 will only check if it can exist with respect to our expressed constraints. In order to get an assignment for all possible values in our sort, we can evaluate the model using the `model_completion=True` flag. This is taked from the `seating-arrangement` example:
  172. ```python
  173. arrangement = ["" for guest in range(len(guests))]
  174. for guest in guests:
  175. arrangement[m.evaluate(position(guest),model_completion=True).as_long()] = guest.decl().name()
  176. ```