def __init__(self, cfr, model):
'''
:param cfr: The Z3 solver.
:type cfr: :class:`~common.Z3Instance`
'''
self.cfr = cfr
self.model = model
self.tree = SimpleTree()
self.pickledInstance = []
def __init__(self, cfr, model):
'''
:param cfr: The Z3 solver.
:type cfr: :class:`~common.Z3Instance`
'''
self.cfr = cfr
self.model = model
self.tree = SimpleTree()
self.pickledInstance = []
class PrintHierarchy(VisitorTemplate.VisitorTemplate):
'''
:var cfr: (:class:`~common.Z3Instance`) The Z3 solver.
'''
def __init__(self, cfr, model):
'''
:param cfr: The Z3 solver.
:type cfr: :class:`~common.Z3Instance`
'''
self.cfr = cfr
self.model = model
self.tree = SimpleTree()
self.pickledInstance = []
def findEndRef(self, node):
while True:
ref = self.tree.findParentInList(node, self.tree.refs)
if ref:
ref = ref[1][0]
(sort, val) = ref
if isinstance(sort, PrimitiveType):
return str(ref[1])
else:
if sort.subs:
for i in sort.subs:
if i.indexInSuper <= int(str(val)) and int(str(val)) < i.indexInSuper + i.numInstances:
ref = str(i.instances[int(str(val)) - i.indexInSuper])
else:
ref = str(sort.instances[int(str(val))])
return removePrefix(ref)
node = self.tree.findParentInList(node, self.tree.abstractRefs)
if not node:
return None
else:
(_, node) = node
def get_pickled(self):
return '\n'.join(self.pickledInstance)
def show_inheritance(self, sort):
'''
Displays the super clafer. Useful for ClaferIDE.
'''
if Options.SHOW_INHERITANCE:
if sort.superSort:
sup = str(sort.superSort)[:-5]
else:
sup = "clafer"
return " : " + sup + " "
else:
return ""
def instance_print(self, s):
if Options.CORES == 1:
print(s)
else:
self.pickledInstance.append(s)
def recursivePrint(self, node, level, thisIsAbstract=False):
(sort, instance) = node
indent = Options.INDENTATION * level
abs_ref = self.tree.findParentInList(node, self.tree.abstractRefs)
if not thisIsAbstract:
nodeStr = removePrefix(str(instance))
currRef = self.findEndRef(node)
if currRef:
ref = " = " + str(currRef)
else:
ref = ""
self.instance_print(indent + nodeStr + self.show_inheritance(sort) + ref)
if abs_ref:
(_, real_abs_ref) = abs_ref
self.recursivePrint(real_abs_ref, level, True)
(_, children) = self.tree.findParentInList(node, self.tree.nodes)
for i in children:
self.recursivePrint(i, level + 1)
def printTree(self):
for i in self.tree.roots:
self.recursivePrint(i, 0)
pass
def claferVisit(self, element):
if not self.cfr.isUsed(str(element)):
return
sort = self.cfr.cfr_sorts[element.uid]
if sort.parent:
parent = sort.parent.element.uid
else:
parent = None
for j in range(sort.numInstances):
isOn = str(self.model.eval(sort.instances[j].var)) != str(sort.parentInstances)
if isOn:
if not parent and not element.isAbstract:
self.tree.addRoot((sort,sort.instances[j]))
parentInstance = None
if parent:
parentInstance = (sort.parent, sort.parent.instances[int(str(self.model.eval(sort.instances[j].var)))])
else:
parentInstance = None
if element.isAbstract:
for k in sort.subs:
if not self.cfr.isUsed(str(k.element)):
continue
if k.indexInSuper <= j and j < k.indexInSuper + k.numInstances:
self.tree.addAbstractRef((k, k.instances[j - k.indexInSuper]), (sort, sort.instances[j]))
self.tree.addNode((sort, sort.instances[j]), parentInstance)
if sort.refSort:
if isinstance(sort.refSort, PrimitiveType) and (sort.refSort == "integer" or sort.refSort == "string" or sort.refSort == "real"):
if not sort.refs[j].var:
self.tree.addRef((sort, sort.instances[j]),(sort.refSort, "Unrestricted"))
else:
self.tree.addRef((sort, sort.instances[j]),(sort.refSort, self.model.eval(sort.refs[j].var)))
else:
self.tree.addRef((sort, sort.instances[j]),(sort.refSort, self.model.eval(sort.refs[j].var)))
for i in element.elements:
visitors.Visitor.visit(self, i)
class PrintHierarchy(VisitorTemplate.VisitorTemplate):
'''
:var cfr: (:class:`~common.Z3Instance`) The Z3 solver.
'''
def __init__(self, cfr, model):
'''
:param cfr: The Z3 solver.
:type cfr: :class:`~common.Z3Instance`
'''
self.cfr = cfr
self.model = model
self.tree = SimpleTree()
self.pickledInstance = []
def findEndRef(self, node):
while True:
ref = self.tree.findParentInList(node, self.tree.refs)
if ref:
ref = ref[1][0]
(sort, val) = ref
if isinstance(sort, PrimitiveType):
return str(ref[1])
else:
if sort.subs:
for i in sort.subs:
if i.indexInSuper <= int(str(val)) and int(str(
val)) < i.indexInSuper + i.numInstances:
ref = str(i.instances[int(str(val)) -
i.indexInSuper])
else:
ref = str(sort.instances[int(str(val))])
return removePrefix(ref)
node = self.tree.findParentInList(node, self.tree.abstractRefs)
if not node:
return None
else:
(_, node) = node
def get_pickled(self):
return '\n'.join(self.pickledInstance)
def show_inheritance(self, sort):
'''
Displays the super clafer. Useful for ClaferIDE.
'''
if Options.SHOW_INHERITANCE:
if sort.superSort:
sup = str(sort.superSort)[:-5]
else:
sup = "clafer"
return " : " + sup + " "
else:
return ""
def instance_print(self, s):
if Options.CORES == 1:
print(s)
else:
self.pickledInstance.append(s)
def recursivePrint(self, node, level, thisIsAbstract=False):
(sort, instance) = node
indent = Options.INDENTATION * level
abs_ref = self.tree.findParentInList(node, self.tree.abstractRefs)
if not thisIsAbstract:
nodeStr = removePrefix(str(instance))
currRef = self.findEndRef(node)
if currRef:
ref = " = " + str(currRef)
else:
ref = ""
self.instance_print(indent + nodeStr +
self.show_inheritance(sort) + ref)
if abs_ref:
(_, real_abs_ref) = abs_ref
self.recursivePrint(real_abs_ref, level, True)
(_, children) = self.tree.findParentInList(node, self.tree.nodes)
for i in children:
self.recursivePrint(i, level + 1)
def printTree(self):
for i in self.tree.roots:
self.recursivePrint(i, 0)
pass
def claferVisit(self, element):
if not self.cfr.isUsed(str(element)):
return
sort = self.cfr.cfr_sorts[element.uid]
if sort.parent:
parent = sort.parent.element.uid
else:
parent = None
for j in range(sort.numInstances):
isOn = str(self.model.eval(sort.instances[j].var)) != str(
sort.parentInstances)
if isOn:
if not parent and not element.isAbstract:
self.tree.addRoot((sort, sort.instances[j]))
parentInstance = None
if parent:
parentInstance = (sort.parent, sort.parent.instances[int(
str(self.model.eval(sort.instances[j].var)))])
else:
parentInstance = None
if element.isAbstract:
for k in sort.subs:
if not self.cfr.isUsed(str(k.element)):
continue
if k.indexInSuper <= j and j < k.indexInSuper + k.numInstances:
self.tree.addAbstractRef(
(k, k.instances[j - k.indexInSuper]),
(sort, sort.instances[j]))
self.tree.addNode((sort, sort.instances[j]), parentInstance)
if sort.refSort:
if isinstance(
sort.refSort,
PrimitiveType) and (sort.refSort == "integer"
or sort.refSort == "string"
or sort.refSort == "real"):
if not sort.refs[j].var:
self.tree.addRef((sort, sort.instances[j]),
(sort.refSort, "Unrestricted"))
else:
self.tree.addRef(
(sort, sort.instances[j]),
(sort.refSort, self.model.eval(
sort.refs[j].var)))
else:
self.tree.addRef(
(sort, sort.instances[j]),
(sort.refSort, self.model.eval(sort.refs[j].var)))
for i in element.elements:
visitors.Visitor.visit(self, i)
