PySMT 0.9.7.dev477__py2.py3-none-any.whl → 0.9.7.dev485__py2.py3-none-any.whl

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
pysmt/__init__.py CHANGED
@@ -19,7 +19,7 @@
19
19
  from typing import Tuple, Union
20
20
 
21
21
 
22
- VERSION: Union[Tuple[int, int, int], Tuple[int, int, int, str, int]] = (0, 9, 7, "dev", 477)
22
+ VERSION: Union[Tuple[int, int, int], Tuple[int, int, int, str, int]] = (0, 9, 7, "dev", 485)
23
23
 
24
24
  # Try to provide human-readable version of latest commit for dev versions
25
25
  # E.g. v0.5.1-4-g49a49f2-wip
pysmt/cmd/install.py CHANGED
@@ -36,7 +36,7 @@ INSTALLERS = [
36
36
  Installer(CVC5Installer, "1.3.3", {}),
37
37
  Installer(CVC4Installer, "1.7-prerelease",
38
38
  {"git_version" : "391ab9df6c3fd9a3771864900c1718534c1e4666"}),
39
- Installer(Z3Installer, "4.15.0", {}),
39
+ Installer(Z3Installer, "5.1.0", {}),
40
40
  Installer(YicesInstaller, "2.6.4", {"yices_api_version": "1.1.5"}),
41
41
  Installer(BtorInstaller, "3.2.3", {}),
42
42
  Installer(PicoSATInstaller, "965",
pysmt/optimization/z3.py CHANGED
@@ -18,8 +18,6 @@
18
18
 
19
19
  from __future__ import absolute_import
20
20
 
21
- from warnings import warn
22
-
23
21
  from pysmt.decorators import clear_pending_pop
24
22
  from pysmt.solvers.solver import Model
25
23
  from pysmt.solvers.z3 import Z3Solver, Z3Model
@@ -127,33 +125,31 @@ class Z3NativeOptimizer(Optimizer, Z3Solver):
127
125
 
128
126
  @clear_pending_pop
129
127
  def boxed_optimize(self, goals: Sequence[Goal]) -> Optional[Dict[Goal, Tuple[Model, FNode]]]:
130
- # This implementation is a naive simulation of a box optimization,
131
- # but is needed to cope with an upstream Z3 issue:
132
- # https://github.com/Z3Prover/z3/issues/7240
133
- #
134
- # A properer implementation would be as follows.
135
- # '''python
136
- # self.z3.set(priority='box')
137
- # models = {}
138
- # for goal_id, goal in enumerate(goals):
139
- # self._assert_z3_goal(goal, goal_id)
140
- # for goal in goals:
141
- # if self.z3.check() == z3.sat:
142
- # model = Z3Model(self.environment, self.z3.model())
143
- # models[goal] = (model, model.get_value(goal.term()))
144
- # else:
145
- # return None
146
- # return models
147
- # '''
148
- warn("Boxed optimization is not working in Z3 (see https://github.com/Z3Prover/z3/issues/7240). "
149
- "PySMT will simulate the correct behavior, but the performance will be sub-optimal")
150
- models = {}
151
- for g in goals:
152
- r = self.optimize(g)
153
- if r is None:
154
- return None
155
- models[g] = r
156
- return models
128
+ self.push()
129
+ try:
130
+ self.z3.set(priority='box')
131
+ handles = [self._assert_z3_goal(goal, goal_id)
132
+ for goal_id, goal in enumerate(goals)]
133
+ # In box mode, each call to check() yields the optimal model
134
+ # of the next objective, in the order they were asserted
135
+ models: Dict[Goal, Tuple[Model, FNode]] = {}
136
+ for goal, h in zip(goals, handles):
137
+ if self.z3.check() != z3.sat:
138
+ return None
139
+ try:
140
+ model = Z3Model(self.environment, self.z3.model())
141
+ if goal.is_maxsmt_goal():
142
+ models[goal] = (model, self._compute_max_smt_cost(model, goal))
143
+ else:
144
+ self.converter.back(self.z3.lower(h))
145
+ models[goal] = (model, model.get_value(goal.term()))
146
+ except PysmtInfinityError:
147
+ raise PysmtUnboundedOptimizationError("The optimal value is unbounded")
148
+ except PysmtInfinitesimalError:
149
+ raise PysmtInfinitesimalError("The optimal value is infinitesimal")
150
+ return models
151
+ finally:
152
+ self.pop()
157
153
 
158
154
  @clear_pending_pop
159
155
  def lexicographic_optimize(self, goals: Sequence[Goal]) -> Optional[Tuple[Model, List[FNode]]]:
pysmt/solvers/msat.py CHANGED
@@ -232,6 +232,7 @@ class MathSAT5Solver(IncrementalTrackingSolver, UnsatCoreSolver, SmtLibBasicSolv
232
232
  self.intType = self._msat_lib.msat_get_integer_type(self.msat_env())
233
233
  self.boolType = self._msat_lib.msat_get_bool_type(self.msat_env())
234
234
  self.mgr = environment.formula_manager
235
+ self._assumption_keys: Dict[FNode, FNode] = {}
235
236
 
236
237
  @clear_pending_pop
237
238
  def _reset_assertions(self):
@@ -269,7 +270,9 @@ class MathSAT5Solver(IncrementalTrackingSolver, UnsatCoreSolver, SmtLibBasicSolv
269
270
 
270
271
  def _named_assertions_map(self):
271
272
  if self.options.unsat_cores_mode == "named":
272
- return dict((t[0], (t[1],t[2])) for t in self.assertions)
273
+ # not self.assertions: popping the assumptions level would
274
+ # invalidate the unsat core in MathSAT (dangling terms, segfault)
275
+ return dict((t[0], (t[1],t[2])) for t in self._assertion_stack)
273
276
  return None
274
277
 
275
278
  @clear_pending_pop
@@ -277,6 +280,8 @@ class MathSAT5Solver(IncrementalTrackingSolver, UnsatCoreSolver, SmtLibBasicSolv
277
280
  res = None
278
281
  bool_ass = []
279
282
  other_ass = []
283
+ # maps the fresh literal standing for each non-literal assumption to it
284
+ self._assumption_keys = {}
280
285
  for x in assumptions if assumptions is not None else []:
281
286
  if x.is_literal():
282
287
  bool_ass.append(self.converter.convert(x))
@@ -284,8 +289,14 @@ class MathSAT5Solver(IncrementalTrackingSolver, UnsatCoreSolver, SmtLibBasicSolv
284
289
  other_ass.append(x)
285
290
  if len(other_ass) > 0:
286
291
  self.push()
287
- # this introduces new named assertions if named unsat cores.
288
- self.add_assertion(self.mgr.And(other_ass))
292
+ for x in other_ass:
293
+ key = self.mgr.FreshSymbol(template="_assumption_%d")
294
+ self._assumption_keys[key] = x
295
+ term = self.converter.convert(self.mgr.Implies(key, x))
296
+ if self._msat_lib.msat_assert_formula(self.msat_env(), term) != 0:
297
+ raise InternalSolverError(
298
+ self._msat_lib.msat_last_error_message(self.msat_env()))
299
+ bool_ass.append(self.converter.convert(key))
289
300
 
290
301
  n_ass = self._named_assertions()
291
302
  if n_ass is not None and len(n_ass) > 0:
@@ -319,6 +330,9 @@ class MathSAT5Solver(IncrementalTrackingSolver, UnsatCoreSolver, SmtLibBasicSolv
319
330
  raise InternalSolverError(
320
331
  self._msat_lib.msat_last_error_message(self.msat_env()))
321
332
  res = set(self.converter.back(t) for t in terms)
333
+ # drop the Implies(key, x) encoding of non-literal assumptions
334
+ res = set(f for f in res
335
+ if not f.get_free_variables() & self._assumption_keys.keys())
322
336
  return res | self._unsat_assumptions()
323
337
  else:
324
338
  return set(self.get_named_unsat_core().values()) | \
@@ -334,7 +348,7 @@ class MathSAT5Solver(IncrementalTrackingSolver, UnsatCoreSolver, SmtLibBasicSolv
334
348
  if n_ass_map is not None:
335
349
  # in named mode the named assertions are passed as assumptions too
336
350
  res -= set(n_ass_map)
337
- return res
351
+ return set(self._assumption_keys.get(f, f) for f in res)
338
352
 
339
353
  def get_named_unsat_core(self):
340
354
  """After a call to solve() yielding UNSAT, returns the unsat core as a
pysmt/solvers/z3.py CHANGED
@@ -177,6 +177,7 @@ class Z3Solver(IncrementalTrackingSolver, UnsatCoreSolver, SmtLibBasicSolver):
177
177
  self.mgr = environment.formula_manager
178
178
 
179
179
  self._name_cnt = 0
180
+ self._assumption_keys: Dict[FNode, FNode] = {}
180
181
  return
181
182
 
182
183
  @clear_pending_pop
@@ -218,9 +219,15 @@ class Z3Solver(IncrementalTrackingSolver, UnsatCoreSolver, SmtLibBasicSolver):
218
219
  else:
219
220
  other_ass.append(x)
220
221
 
222
+ # maps the fresh literal standing for each non-literal assumption to it
223
+ self._assumption_keys = {}
221
224
  if len(other_ass) > 0:
222
225
  self.push()
223
- self.add_assertion(self.mgr.And(other_ass))
226
+ for x in other_ass:
227
+ key = self.mgr.FreshSymbol(template="_assumption_%d")
228
+ self._assumption_keys[key] = x
229
+ self.z3.add(self.converter.convert(self.mgr.Implies(key, x)))
230
+ bool_ass.append(self.converter.convert(key))
224
231
  self.pending_pop = True
225
232
  res = self.z3.check(*bool_ass)
226
233
  else:
@@ -240,7 +247,8 @@ class Z3Solver(IncrementalTrackingSolver, UnsatCoreSolver, SmtLibBasicSolver):
240
247
 
241
248
  def _named_assertions_map(self):
242
249
  if self.options.unsat_cores_mode is not None:
243
- return dict((t[0], (t[1],t[2])) for t in self.assertions)
250
+ # not self.assertions: that would pop the assumptions level
251
+ return dict((t[0], (t[1],t[2])) for t in self._assertion_stack)
244
252
  return None
245
253
 
246
254
  def get_named_unsat_core(self):
@@ -279,7 +287,7 @@ class Z3Solver(IncrementalTrackingSolver, UnsatCoreSolver, SmtLibBasicSolver):
279
287
  cnt += 1
280
288
  res[name] = formula
281
289
  else:
282
- core_assumptions.add(key)
290
+ core_assumptions.add(self._assumption_keys.get(key, key))
283
291
  return res, core_assumptions
284
292
 
285
293
  @clear_pending_pop
@@ -0,0 +1,75 @@
1
+ #
2
+ # This file is part of pySMT.
3
+ #
4
+ # Copyright 2014 Andrea Micheli and Marco Gario
5
+ #
6
+ # Licensed under the Apache License, Version 2.0 (the "License");
7
+ # you may not use this file except in compliance with the License.
8
+ # You may obtain a copy of the License at
9
+ #
10
+ # http://www.apache.org/licenses/LICENSE-2.0
11
+ #
12
+ # Unless required by applicable law or agreed to in writing, software
13
+ # distributed under the License is distributed on an "AS IS" BASIS,
14
+ # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
15
+ # See the License for the specific language governing permissions and
16
+ # limitations under the License.
17
+ #
18
+ import os
19
+ import runpy
20
+ import unittest
21
+
22
+ from pysmt.test import (TestCase, skipIfSolverNotAvailable,
23
+ skipIfNoSolverForLogic,
24
+ skipIfNoUnsatCoreSolverForLogic, main)
25
+ from pysmt.logics import QF_LIA
26
+
27
+
28
+ SNIPPETS_DIR = os.path.join(os.path.dirname(__file__),
29
+ "..", "..", "docs", "code_snippets")
30
+
31
+
32
+ # The docs are not shipped with the package, so skip when run from an install.
33
+ @unittest.skipIf(not os.path.isdir(SNIPPETS_DIR), "docs/ not available")
34
+ class TestDocSnippets(TestCase):
35
+
36
+ def setUp(self):
37
+ super().setUp()
38
+ # Match the default environment a reader gets from pysmt.shortcuts.
39
+ self.env.enable_infix_notation = True
40
+
41
+ def run_snippets(self, *names):
42
+ for name in names:
43
+ with self.subTest(snippet=name):
44
+ runpy.run_path(os.path.join(SNIPPETS_DIR, name + ".py"),
45
+ run_name="__main__")
46
+
47
+ def test_no_solver(self):
48
+ self.run_snippets("hello_world_opening", "hello_world_infix")
49
+
50
+ @skipIfNoSolverForLogic(QF_LIA)
51
+ def test_qf_lia(self):
52
+ self.run_snippets("hello_world_is_sat", "hello_world_get_model",
53
+ "hello_world_qf_lia")
54
+
55
+ @skipIfSolverNotAvailable("z3")
56
+ def test_z3(self):
57
+ self.run_snippets("hello_world")
58
+
59
+ @skipIfNoUnsatCoreSolverForLogic(QF_LIA)
60
+ def test_unsat_cores(self):
61
+ self.run_snippets("unsat_core", "unsat_core_named",
62
+ "unsat_core_assumptions")
63
+
64
+ def test_all_snippets_are_tested(self):
65
+ tested = {"hello_world_opening", "hello_world_infix",
66
+ "hello_world_is_sat", "hello_world_get_model",
67
+ "hello_world_qf_lia", "hello_world", "unsat_core",
68
+ "unsat_core_named", "unsat_core_assumptions"}
69
+ found = {f[:-3] for f in os.listdir(SNIPPETS_DIR) if f.endswith(".py")}
70
+ self.assertEqual(found, tested,
71
+ "Add new docs/code_snippets files to this test")
72
+
73
+
74
+ if __name__ == '__main__':
75
+ main()
@@ -18,7 +18,7 @@
18
18
  from pysmt.test import (TestCase, skipIfSolverNotAvailable,
19
19
  skipIfNoUnsatCoreSolverForLogic, main)
20
20
  from pysmt.shortcuts import (get_unsat_core, And, Or, Not, Symbol, UnsatCoreSolver,
21
- Solver, is_unsat, Int, GT, get_env)
21
+ Solver, is_unsat, Int, GT, GE, LE, get_env)
22
22
  from pysmt.typing import INT
23
23
  from pysmt.logics import QF_BOOL, QF_BV, QF_LIA
24
24
  from pysmt.exceptions import (SolverStatusError, SolverReturnedUnknownResultError,
@@ -214,6 +214,25 @@ class TestUnsatCores(TestCase):
214
214
  {"n1": Or(x, y)}, name)
215
215
 
216
216
 
217
+ @skipIfNoUnsatCoreSolverForLogic(QF_LIA)
218
+ def test_non_literal_assumptions_in_unsat_core(self):
219
+ a = Symbol("a", INT)
220
+ pos, neg = GE(a, Int(1)), LE(a, Int(0))
221
+ for name in get_env().factory.all_unsat_core_solvers(logic=QF_LIA):
222
+ for mode in ["all", "named"]:
223
+ with UnsatCoreSolver(name=name, logic=QF_LIA,
224
+ unsat_cores_mode=mode) as s:
225
+ s.add_assertion(pos, named="pos")
226
+ self.assertFalse(s.solve([neg]))
227
+ # twice: reading the core must not pop the assumptions level
228
+ for _ in range(2):
229
+ self.assertEqual(s.get_unsat_core(), {pos, neg},
230
+ (name, mode))
231
+ if mode == "named":
232
+ self.assertEqual(s.get_named_unsat_core(),
233
+ {"pos": pos}, (name, mode))
234
+
235
+
217
236
  @skipIfNoUnsatCoreSolverForLogic(QF_BOOL)
218
237
  def test_assumptions_as_iterator(self):
219
238
  x, y = Symbol("x"), Symbol("y")
@@ -1,6 +1,6 @@
1
1
  Metadata-Version: 2.4
2
2
  Name: PySMT
3
- Version: 0.9.7.dev477
3
+ Version: 0.9.7.dev485
4
4
  Summary: A solver-agnostic library for SMT Formulae manipulation and solving
5
5
  Home-page: http://www.pysmt.org
6
6
  Author: PySMT Team
@@ -1,4 +1,4 @@
1
- pysmt/__init__.py,sha256=D4wKbKbyKykOKhdJR9zJPcu0mML4q9kKVXFpLzvfvxc,1701
1
+ pysmt/__init__.py,sha256=-1nhsqf1cDJwZGajwhlm8vA59g3l6eLyADmCUslgp7k,1701
2
2
  pysmt/__main__.py,sha256=rR-MV1QtLYqtVoJyY3m5B5Iz-lua0-5o6YSB0W4lKy8,1085
3
3
  pysmt/configuration.py,sha256=Iq_46QZ9z_jpBMk76euJWTqGEwHad2qyiEDPix5sXsA,4538
4
4
  pysmt/constants.py,sha256=pulb6NvROY_X8BePeyyX8T9MJLB79HZ_1FUYSlZ7Jfg,5769
@@ -22,7 +22,7 @@ pysmt/typing.py,sha256=aI8ZKEin4J2XLAHsY5fW1Pt4hZvlBlArxM4nrrmBas4,19550
22
22
  pysmt/utils.py,sha256=_dSgl45k-u9cMXSyR672GBJcKMKdtl6xSTjqXKTSfcs,2906
23
23
  pysmt/cmd/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
24
24
  pysmt/cmd/check_version.py,sha256=DCS6pHVuQm9J_vfSSDDGxtvrV6P1mEhQK-IUjacDh3s,2895
25
- pysmt/cmd/install.py,sha256=HK0I51_4Sjf_igi-v8dW7Q_-CVnAkvAKJsIpI6OQ9tI,10468
25
+ pysmt/cmd/install.py,sha256=-PT8N0nbl9fkd0LLQ1LMdHy1szzsGVimGdmuogH3xcc,10467
26
26
  pysmt/cmd/shell.py,sha256=1H5NJ9St879-U3EDizq_5l34vKPUJr-wi3MyBy164Sc,6594
27
27
  pysmt/cmd/installers/__init__.py,sha256=fEAD4FUh0Hjv7u-o9dc5nYMjzPUAzR8bWo8DSgUQjq4,1438
28
28
  pysmt/cmd/installers/base.py,sha256=agHbXV4ILfW2my8bjFLoRPmK9Jq8fPz9aESPGbPLu-g,13201
@@ -41,7 +41,7 @@ pysmt/optimization/msat.py,sha256=yj5-vqxQFJnK3zjVlYpxemZ2BWG-6IrCTDKvjl94xNY,93
41
41
  pysmt/optimization/optimizer.py,sha256=nt7x9YCULbS5wVg2IPWV6ZKnZGRQjDk5yGPYiz7QdmY,29607
42
42
  pysmt/optimization/optimsat.py,sha256=hRqhPcssuUzXnTeEEv8taFcRI5nE7gU8drwDIC0NtFk,11040
43
43
  pysmt/optimization/yices.py,sha256=Ly48G5JpnOhJBkd25Vg21jGcCjLEeEQUrWsG2Xxl_KI,931
44
- pysmt/optimization/z3.py,sha256=Y_yEP2TpaVVA4czNGUv6p7wFknMsX3CT4BnvdFaxZLQ,7376
44
+ pysmt/optimization/z3.py,sha256=oruI7J_4NmtmiinGcyzooKE-Ny61Tf-sMxjc4kSoTEI,7479
45
45
  pysmt/smtlib/__init__.py,sha256=JXBHtcb4Lv-Sb8whc9JuGbRH2EBLWwtLUh3PL9HhNE8,650
46
46
  pysmt/smtlib/annotations.py,sha256=UTl_nnBikMGKzdpW5N17yIpvx-_8HZmo8hxXIKsm7Wo,4596
47
47
  pysmt/smtlib/commands.py,sha256=hwWnXrzZxJmKtkIitHRtuin01WDUErT0VERR9h45t2A,2277
@@ -59,7 +59,7 @@ pysmt/solvers/cvcfour.py,sha256=W8Afm8J7co87Vwt4L80kIoNaPcA3eBLwEnwAw5CcoHg,2579
59
59
  pysmt/solvers/dynmsat.py,sha256=bJokwHoxKWmQGqw9nQerRDb33d5c66Sa91jUYiZXwY0,2124
60
60
  pysmt/solvers/eager.py,sha256=E2wWhRVWe6sVxW2YOwPDhZ8O53uKNuPKwLIvsRsWFPA,3681
61
61
  pysmt/solvers/interpolation.py,sha256=6AO1wMkEKSkptuC4aXlNEO8Be1K2oW3W_er2XGc_aEA,2066
62
- pysmt/solvers/msat.py,sha256=jWnPOlwkTfWqLc3vxy50nfEqLEWI1JTUCcaTBmmaQss,64511
62
+ pysmt/solvers/msat.py,sha256=FOxqzFcrY_PrjordGk5Y9GDj53x3_lFN7H1DdEXrIGw,65442
63
63
  pysmt/solvers/options.py,sha256=7iFnYXs4XYc7h2u3s0umL-gnEARNLRg_SN_jsxZXZQ8,4518
64
64
  pysmt/solvers/pico.py,sha256=y31QT7ZQVMeKjXc7g4DZrpc1LTzbhCLyE0zyOLd-BsE,10680
65
65
  pysmt/solvers/portfolio.py,sha256=GFKR2S8FoANzZJWUkYVqWEJG7sw04RYgSnwaKJNWuUs,10092
@@ -67,7 +67,7 @@ pysmt/solvers/qelim.py,sha256=iEQ9PE9IPFA6dxqSMHFp3aIyDCTiZyIlSAduh0txrAg,5451
67
67
  pysmt/solvers/smtlib.py,sha256=daJkKBtTMHLIoQt77dhT8Qh8P6eFBO9mF4C6tialtBc,9924
68
68
  pysmt/solvers/solver.py,sha256=d49iRy3I1Vk0--_0DirjUyalM8MdH6-ymcrPU6a5RZw,22046
69
69
  pysmt/solvers/yices.py,sha256=uG08Q9iqctXk-2rDP6H5OO88FE_ml83K0k5j8irpbcg,25910
70
- pysmt/solvers/z3.py,sha256=hiCfZfJzsmludprQamHCaeb4SSPDVaL1oyuAH9UNU8s,45417
70
+ pysmt/solvers/z3.py,sha256=pTtGBtZcAFM4377G07zt6I7a4j6NclfStG_XkeuXr-Y,45953
71
71
  pysmt/test/__init__.py,sha256=LEFbVYw4X45sgEI4_ax55g-6G5Y7kj6CLaJr1TQr4ks,5750
72
72
  pysmt/test/examples.py,sha256=fogqgP2qEpvaOswVFYRr4Q8o6TKoCLPW9460SL9HVvo,40756
73
73
  pysmt/test/omt_examples.py,sha256=LdL43fLaHiR72Cng_2st4UaYf2ueoZgStcvhccy-RdI,10338
@@ -81,6 +81,7 @@ pysmt/test/test_cnf.py,sha256=iDb5OJeKxE7xP9molEa3TFtDtan8eAUF5gtDZMFZJn4,4620
81
81
  pysmt/test/test_configuration.py,sha256=qlY1K2ap4BMoPmbANg2y3391ndr7EophNd_UZNAOUko,3661
82
82
  pysmt/test/test_constants.py,sha256=vdjjtAOw5oQg57Bl5tllslnVWBHuRq3Zk33F1xDsBtA,4664
83
83
  pysmt/test/test_cvc_quantifiers.py,sha256=a40NDyPKNynVpqq9M5pDTR8qFL_EumR8whw8escxP4I,1850
84
+ pysmt/test/test_doc_snippets.py,sha256=y3dXAduT6PNyT_XQOczwKIV5ymeGzqj3JxCTfQmi0sI,2720
84
85
  pysmt/test/test_dwf.py,sha256=_spseUblkyG0w2ttthUvm_gab2PqnjqCsnRHlH1Q2aE,5015
85
86
  pysmt/test/test_eager_model.py,sha256=hF9V8wQYXVeyW2Bo4sACa98xeJtfOMYjMvjWMHQaGag,3662
86
87
  pysmt/test/test_env.py,sha256=g98aqMU2dlPW2hQmWy8DxCLfm06upMic5mU91MGX_PQ,8758
@@ -111,7 +112,7 @@ pysmt/test/test_solving.py,sha256=pf5ZitNQrVAT2VSn-ZstHNromomL6OxPKBJMdyZzdLk,25
111
112
  pysmt/test/test_sorts.py,sha256=erfInyPH91WVB8JBUYLteTo5X5skKKP3vEXdUUKC-YE,6033
112
113
  pysmt/test/test_string.py,sha256=Y6VBfkLNKuePo8-HIzcwBH3eaYj0i-k1Y8tpFyw03zw,8096
113
114
  pysmt/test/test_typechecker.py,sha256=S2O8HjN_bLN6sz86TnsWqpRtxHk2VcVsGDoRZCcQnzE,7309
114
- pysmt/test/test_unsat_cores.py,sha256=AOkwSD8m8aOL6yWGd-NQqFSVDpAkWhep-dBJCus29NY,8331
115
+ pysmt/test/test_unsat_cores.py,sha256=rWORETwkEkLdaYaPLy4hBCUVcsIlYDFAR1Ajc3QeG0w,9310
115
116
  pysmt/test/test_walker_ext.py,sha256=j7mp46QoD3f-TD4zdqHM2EF40zBCizpV3t7z2f0_CeY,3595
116
117
  pysmt/test/test_walkers.py,sha256=EuudGwgGErl5np7Enf8g-RTWLqE3oyzbAvhKo5hx4KU,10284
117
118
  pysmt/test/configs/config1.ini,sha256=MAXPN6VVW-S7jpWmglMPN5a3JYgorTqKAF6cmfohMpo,224
@@ -143,10 +144,10 @@ pysmt/walkers/dag.py,sha256=hw9qUfadQTpihX685YQobfxKv9XA84ffiA8XRMUQEfU,5694
143
144
  pysmt/walkers/generic.py,sha256=2oMr_MDr7FswSlyx2ulbJ9ke5FsTCKABURnCsMeg4fc,5093
144
145
  pysmt/walkers/identitydag.py,sha256=EAxSneEW91Z8GphlkbMPsPdlac7_FDcVj-_6_aunU2s,10902
145
146
  pysmt/walkers/tree.py,sha256=1vquhaChRMSG_pvbz16wqKOFnsQAkzLvjh_xbB3dg5c,2730
146
- pysmt-0.9.7.dev477.dist-info/licenses/LICENSE,sha256=z8d0m5b2O9McPEK1xHG_dWgUBT6EfBDz6wA0F7xSPTA,11358
147
- pysmt-0.9.7.dev477.dist-info/licenses/NOTICE,sha256=Ns-Jsa6nbqZUiTEEAM6HqioSZIxQ2RCJzxoBlWQaUfc,601
148
- pysmt-0.9.7.dev477.dist-info/METADATA,sha256=tdxWAclomTF5eGcgBisQL5Q0BhBBG3B9Sbjd_jSQmK0,1774
149
- pysmt-0.9.7.dev477.dist-info/WHEEL,sha256=4YBfCYNH4wlLpv3pzq1hbEuIlXA4WJabKLFurZ7eTL0,109
150
- pysmt-0.9.7.dev477.dist-info/entry_points.txt,sha256=gDc1XM0xTJJMDGC_nXd0kfbX-Omjke9Dn9F3awMLYIU,57
151
- pysmt-0.9.7.dev477.dist-info/top_level.txt,sha256=NwHQbpTaZMEvjIUdC0bvvj-WUyULe-nt-opK3YQNRMk,6
152
- pysmt-0.9.7.dev477.dist-info/RECORD,,
147
+ pysmt-0.9.7.dev485.dist-info/licenses/LICENSE,sha256=z8d0m5b2O9McPEK1xHG_dWgUBT6EfBDz6wA0F7xSPTA,11358
148
+ pysmt-0.9.7.dev485.dist-info/licenses/NOTICE,sha256=Ns-Jsa6nbqZUiTEEAM6HqioSZIxQ2RCJzxoBlWQaUfc,601
149
+ pysmt-0.9.7.dev485.dist-info/METADATA,sha256=oY0W4dADbjmGgO9xwljRC_pXSAXQq1KmOeH4xAjXQk4,1774
150
+ pysmt-0.9.7.dev485.dist-info/WHEEL,sha256=4YBfCYNH4wlLpv3pzq1hbEuIlXA4WJabKLFurZ7eTL0,109
151
+ pysmt-0.9.7.dev485.dist-info/entry_points.txt,sha256=gDc1XM0xTJJMDGC_nXd0kfbX-Omjke9Dn9F3awMLYIU,57
152
+ pysmt-0.9.7.dev485.dist-info/top_level.txt,sha256=NwHQbpTaZMEvjIUdC0bvvj-WUyULe-nt-opK3YQNRMk,6
153
+ pysmt-0.9.7.dev485.dist-info/RECORD,,