diff options
| author | ericmarin <maarin.eric@gmail.com> | 2026-06-20 13:30:33 +0200 |
|---|---|---|
| committer | ericmarin <maarin.eric@gmail.com> | 2026-06-25 20:22:18 +0200 |
| commit | ed622e662cbefc4c16b425666388641e97921ebc (patch) | |
| tree | 8d525b8740418dc6446d002fc7350c0e3b4da232 | |
| parent | d85de781b4a825fe0d1217e1e8ae5ec81dd70202 (diff) | |
| download | vein-master.tar.gz vein-master.zip | |
| -rw-r--r-- | README.md | 2 | ||||
| -rw-r--r-- | docs/proof.md | 565 | ||||
| -rw-r--r-- | examples/double_integrator/double_integrator_pretrain_inv.onnx | bin | 0 -> 12584 bytes | |||
| -rw-r--r-- | examples/pendulum/pendulum_pretrain_con.onnx | bin | 0 -> 6106 bytes | |||
| -rw-r--r-- | vein.py | 270 | ||||
| -rw-r--r-- | verify_example.py | 17 |
6 files changed, 114 insertions, 740 deletions
@@ -6,8 +6,6 @@ Requires my [fork of Inpla](https://github.com/eric-marin/inpla). - **make** the executable - Copy the **inpla** executable in **vein/** -[Soundness proof](./docs/proof.md) - ## License This project is licensed under the GNU Affero General Public License v3.0 - see the [LICENSE](LICENSE) file for details. diff --git a/docs/proof.md b/docs/proof.md deleted file mode 100644 index 99c88aa..0000000 --- a/docs/proof.md +++ /dev/null @@ -1,565 +0,0 @@ -# Soundness Proof -## Mathematical Definitions -\sim&space;out\Rightarrow&space;out=q*x+r&space;) -\sim&space;out\Rightarrow&space;out=k&space;) -\sim&space;a\Rightarrow&space;out=a+b&space;) -\sim&space;b\Rightarrow&space;out=q*x+(r+b)) -\sim&space;b\Rightarrow&space;out=k+b&space;) -\sim&space;a\Rightarrow&space;out=a*b&space;) -\sim&space;b\Rightarrow&space;out=q*b*x+r*b&space;) -\sim&space;b\Rightarrow&space;out=k*b&space;) -\sim&space;x\Rightarrow&space;out=\text{IF}\;(x>0)\;\text{THEN}\;x\;\text{ELSE}\;0) -\sim&space;x\Rightarrow&space;out=x&space;) - -## Soundness of Translation -### ReLU -ONNX ReLU node is defined as: - - -The translation defines the interactions: -) - -By definition this interaction is equal to: -\;\text{THEN}\;x_i\;\text{ELSE}\;0) - -### Gemm -ONNX Gemm node is defined as: - - -The translation defines the interactions: -)) -,...),v_n)\sim&space;Concrete(\beta*c_i)) - -By definition this interaction is equal to: - - - -By grouping the operations we get: - - -### Identiry / Flatten / Reshape / Squeeze / Unsqueeze -Just identity mapping because wires represent a single element and they are not structured as Tensors. - - -### MatMul -Equal to Gemm with ,  and . - -### Add -ONNX Add node is defined as: - - -The translation defines the interactions: -\sim&space;a_i) - -By definition this interaction is equal to: - - -By grouping the operations we get: - - -### Sub -ONNX Sub node is defined as: - - -The translation defines the interactions: -\sim&space;a_i) -)\sim&space;b_i) - -By definition this interaction is equal to: - - - -By grouping the operations we get: - - -### Slice -ONNX Slice is defined as: -}) - -The translations creates a wiring analog to the above definition: -}) - -## Soundness of Interaction Rules -### Materialize -The Materialize agent transforms a Linear agent into a tree of explicit mathematical operations -that are used as final representation for the solver. -In the Python module the terms are defined as: -```python -def TermAdd(a, b): - return a + b -def TermMul(a, b): - return a * b -def TermReLU(x): - return z3.If(x > 0, x, 0) -``` - -#### Linear >< Materialize -><Materialize(out)\Rightarrow&space;(1),(2),(3),(4),(5)) - -LHS: -\sim&space;wire) -\sim&space;wire) - - - - -##### Case 1: -,x\sim&space;Eraser) - -RHS: - - -EQUIVALENCE: - - -##### Case 2: - - -RHS: - - - -EQUIVALENCE: - - -##### Case 3: -)) - -RHS: - - -EQUIVALENCE: - - -##### Case 4: -,x)) - -RHS: - - -EQUIVALENCE: - - -##### Case 5: -,x),Concrete(r))) - -RHS: - - -EQUIVALENCE: - - -#### Concrete >< Materialize -><Materialize(out)\Rightarrow&space;out\sim&space;Concrete(k)) - -LHS: -\sim&space;wire) -\sim&space;wire) - - - - -RHS: - - -EQUIVALENCE: - - -### Add -#### Linear >< Add -><Add(out,b)\Rightarrow&space;b\sim&space;AddCheckLinear(out,x,q,r)) - -LHS: -\sim&space;wire) -\sim&space;wire) - - - - -RHS: -) - -EQUIVALENCE: -\Rightarrow&space;q*x+(r+b)=q*x+(r+b)) - -#### Concrete >< Add -><Add(out,b)\Rightarrow&space;(1),(2)) - -LHS: -\sim&space;wire) -\sim&space;wire) - - - - -##### Case 1: - - -RHS: - - -EQUIVALENCE: - - -##### Case 2: -) - -RHS: - - -EQUIVALENCE: - - -#### Linear >< AddCheckLinear -><AddCheckLinear(out,x,q,r)\Rightarrow&space;(1),(2),(3),(4)) - -LHS: -\sim&space;wire) -\sim&space;wire) - -) -) - -##### Case 1: -,x\sim&space;Eraser,y\sim&space;Eraser) - -RHS: - - -EQUIVALENCE: -=0\Rightarrow&space;0=0) - -##### Case 2: -,y\sim&space;Eraser) - -RHS: - - -EQUIVALENCE: -=q*x+r\Rightarrow&space;q*x+r=q*x+r) - -##### Case 3: -,x\sim&space;Eraser) - -RHS: - - -EQUIVALENCE: -=s*y+t\Rightarrow&space;s*y+t=s*y+t) - -##### Case 4: -\sim&space;Materialize(out_x),Linear(y,s,t)\sim&space;Materialize(out_y),out\sim&space;Linear(TermAdd(out_x,out_y),1,0)) - -RHS: -\sim&space;wire_1) -\sim&space;wire_1) - - -\sim&space;wire_2) -\sim&space;wire_2) - - -+0) -Because `TermAdd(a, b)` is defined as `a+b`: -+0) - -EQUIVALENCE: -=1*(q*x+r+s*y+t)+0\Rightarrow&space;q*x+r+s*y+t=q*x+r+s*y+t) - -#### Concrete >< AddCheckLinear -><AddCheckLinear(out,x,q,r)\Rightarrow&space;out\sim&space;Linear(x,q,r+j)) - -LHS: -\sim&space;wire) -\sim&space;wire) - -) -) - -RHS: -) - -EQUIVALENCE: -=q*x+(r+j)) - -#### Linear >< AddCheckConcrete -><AddCheckConcrete(out,k)\Rightarrow&space;out\sim&space;Linear(y,s,t+k)) - -LHS: -\sim&space;wire) -\sim&space;wire) - - - - -RHS: -) - -EQUIVALENCE: -\Rightarrow&space;s*y+(t+k)=s*y+(t+k)) - -#### Concrete >< AddCheckConcrete -><AddCheckConcrete(out,k)\Rightarrow&space;(1),(2)) - -LHS: -\sim&space;wire) -\sim&space;wire) - - - - -##### Case 1: -) - -RHS: - - -EQUIVALENCE: - - -##### Case 2: -) - -RHS: - - -EQUIVALENCE: - - -### Mul -#### Linear >< Mul -><Mul(out,b)\Rightarrow&space;b\sim&space;MulCheckLinear(out,x,q,r)) - -LHS: -\sim&space;wire) -\sim&space;wire) - - -*b) - -RHS: - - -EQUIVALENCE: -*b=q*b*x+r*b\Rightarrow&space;q*b*x+r*b=q*b*x+r*b) - -#### Concrete >< Mul -><Mul(out,b)\Rightarrow&space;(1),(2),(3)) - -LHS: -\sim&space;wire) -\sim&space;wire) - - - - -##### Case 1: -,b\sim&space;Eraser) - -RHS: - - -EQUIVALENCE: - - -##### Case 2: - - -RHS: - - -EQUIVALENCE: - - -##### Case 3: -) - -RHS: - - -EQUIVALENCE: - - -#### Linear >< MulCheckLinear -><MulCheckLinear(out,x,q,r)\Rightarrow&space;(1),(2)) - -LHS: -\sim&space;wire) -\sim&space;wire) - - -*x+r*(s*y+t)) - -##### Case 1: -\lor(s,t=0)\Rightarrow&space;x\sim&space;Eraser,y\sim&space;Eraser,out\sim&space;Concrete(0)) - -RHS: - - -EQUIVALENCE: -*x+0*(s*y+t)=0\Rightarrow&space;0=0) - -*x+r*(0*y+0)=0\Rightarrow&space;0=0) - -##### Case 2: -\sim&space;Materialize(out_x),Linear(y,s,t)\sim&space;Materialize(out_y),out\sim&space;Linear(TermMul(out_x,out_y),1,0)) - -RHS: -\sim&space;wire_1) -\sim&space;wire_1) - - -\sim&space;wire_2) -\sim&space;wire_2) - - -+0) -Because `TermMul(a, b)` is defined as `a*b`: -*(s*y+t)+0) - -EQUIVALENCE: -*x+r*(s*y+t)=1*(q*x+r)*(s*y+t)\Rightarrow&space;q*(s*y+t)*x+r*(s*y+t)=(q*x+r)*(s*y+t)\Rightarrow&space;q*(s*y+t)*x+r*(s*y+t)=q*(s*y+t)*x+r*(s*y+t)) - - -#### Concrete >< MulCheckLinear -><MulCheckLinear(out,x,q,r)\Rightarrow&space;out\sim&space;Linear(x,q*j,r*j)) - -LHS: -\sim&space;wire) -\sim&space;wire) - - - - -RHS: - - -EQUIVALENCE: - - -#### Linear >< MulCheckConcrete -><MulCheckConcrete(out,k)\Rightarrow&space;out\sim&space;Linear(y,s*k,t*k)) - -LHS: -\sim&space;wire) -\sim&space;wire) - - -) - -RHS: - - -EQUIVALENCE: -=s*k*y+t*k\Rightarrow&space;s*k*y+t*k=s*k*y+t*k) - - -#### Concrete >< MulCheckConcrete -><MulCheckConcrete(out,k)\Rightarrow&space;(1),(2),(3)) - -LHS: -\sim&space;wire) -\sim&space;wire) - - - - -##### Case 1: -) - -RHS: - - -EQUIVALENCE: - - -##### Case 2: -) - -RHS: - - -EQUIVALENCE: - - -##### Case 3: -) - -RHS: - - -EQUIVALENCE: - - -### ReLU -#### Linear >< ReLU -><ReLU(out)\Rightarrow&space;Linear(x,q,r)\sim&space;Materialize(out_x),out\sim&space;Linear(TermReLU(out_x),1,0)) - -LHS: -\sim&space;wire) -\sim&space;wire) - - ->0\;\text{THEN}\;(q*x+r)\;\text{ELSE}\;0) - -RHS: -\sim&space;wire) -\sim&space;wire) - - -+0) -Because `TermReLU(x)` is defined as `z3.If(x > 0, x, 0)`: ->0\;\text{THEN}\;(q*x+r)\;\text{ELSE}\;0)+0) - -EQUIVALENCE: ->0\;\text{THEN}\;(q*x+r)\;\text{ELSE}\;0=1*(\text{IF}\;(q*x+r)>0\;\text{THEN}\;(q*x+r)\;\text{ELSE}\;0)+0\Rightarrow\text{IF}\;(q*x+r)>0\;\text{THEN}\;(q*x+r)\;\text{ELSE}\;0=\text{IF}\;(q*x+r)>0\;\text{THEN}\;(q*x+r)\;\text{ELSE}\;0) - - -#### Concrete >< ReLU -><ReLU(out)\Rightarrow&space;(1),(2)) - -LHS: -\sim&space;wire) -\sim&space;wire) - - - - -##### Case 1: -) - -RHS: - - -EQUIVALENCE: - - -##### Case 2: -) - -RHS: - - -EQUIVALENCE: - - -## Soundness of Reduction -Let  be the Interaction Net translated from a Neural Network . Let  be the state of the net -after  reduction steps. Then ![forall n in N, [IN_n] = [NN]](https://latex.codecogs.com/svg.image?\inline&space;\forall&space;n\in\mathbb{N},[\mathrm{IN_n}]=[\mathrm{NN}]). - -### Proof by Induction -- Base Case (): By the [Soundness of Translation](#soundness-of-translation), the initial net  is constructed such that -its semantics ![[IN_0]](https://latex.codecogs.com/svg.image?\inline&space;[\mathrm{IN_0}]) exactly match the mathematical definition of the ONNX nodes in . -- Induction Step (): Assume ![[IN_n] = [NN]](https://latex.codecogs.com/svg.image?\inline&space;[\mathrm{IN_n}]=[\mathrm{NN}]). If  is in normal form, the proof is complete. -Otherwise, there exists an active pair  that reduces . -By the [Soundness of Interaction Rules](#soundness-of-interaction-rules), the mathematical definition is preserved after any reduction step, -it follows that ![[IN_{n+1}] = [IN_n]](https://latex.codecogs.com/svg.image?\inline&space;[\mathrm{IN_{n+1}}]=[\mathrm{IN_n}]). By the inductive hypothesis, ![[IN_{n+1}] = [NN]](https://latex.codecogs.com/svg.image?\inline&space;[\mathrm{IN_{n+1}}]=[\mathrm{NN}]). - -By the principle of mathematical induction, the Interaction Net remains semantically equivalent to the original -Neural Network at every step of the reduction process. - -Since Interaction Nets are confluent, the reduced mathematical expression is unique regardless -of order in which rules are applied. diff --git a/examples/double_integrator/double_integrator_pretrain_inv.onnx b/examples/double_integrator/double_integrator_pretrain_inv.onnx Binary files differnew file mode 100644 index 0000000..5fd201c --- /dev/null +++ b/examples/double_integrator/double_integrator_pretrain_inv.onnx diff --git a/examples/pendulum/pendulum_pretrain_con.onnx b/examples/pendulum/pendulum_pretrain_con.onnx Binary files differnew file mode 100644 index 0000000..1157a33 --- /dev/null +++ b/examples/pendulum/pendulum_pretrain_con.onnx @@ -13,7 +13,6 @@ # If not, see <https://www.gnu.org/licenses/>. import z3 -import re import numpy as np import subprocess import onnx @@ -23,6 +22,9 @@ from typing import List, Dict, Optional import os import tempfile import hashlib +from itertools import count +import re +import ast sat = z3.sat unsat = z3.unsat @@ -65,7 +67,7 @@ rules = """ | (q == 1) && (r == 0) => out ~ x | (q == 1) && (r != 0) => out ~ TermAdd(x, TermConcrete(r)) | (q != 0) && (r == 0) => out ~ TermMul(TermConcrete(q), x) - | _ => out ~ TermAdd(TermMul(Concrete(q), x), TermConcrete(r)); + | _ => out ~ TermAdd(TermMul(TermConcrete(q), x), TermConcrete(r)); Concrete(float k) >< Materialize(out) => out ~ (*L)TermConcrete(k); """ @@ -74,14 +76,6 @@ _CACHE = {} def inpla_export(model: onnx.ModelProto, bounds: Optional[Dict[str, List[float]]] = None) -> str: # TODO: Add Range agent _ = bounds - class NameGen: - def __init__(self, prefix="v"): - self.counter = 0 - self.prefix = prefix - def next(self) -> str: - name = f"{self.prefix}{self.counter}" - self.counter += 1 - return name def get_initializers(graph) -> Dict[str, np.ndarray]: initializers = {} @@ -92,81 +86,77 @@ def inpla_export(model: onnx.ModelProto, bounds: Optional[Dict[str, List[float]] def get_attrs(node) -> Dict: return {attr.name: onnx.helper.get_attribute_value(attr) for attr in node.attribute} - def get_dim(name): - for i in list(graph.input) + list(graph.output) + list(graph.value_info): - if i.name == name: return i.type.tensor_type.shape.dim[-1].dim_value - return None + graph, initializers = model.graph, get_initializers(model.graph) + counter = count() + wire_gen = lambda: f"w{next(counter)}" + interactions: Dict[str, List[List[str]]] = {} + dims = {i.name: i.type.tensor_type.shape.dim[-1].dim_value for i in list(graph.input) + list(graph.output) + list(graph.value_info)} + script = [] def balanced_fanout(agent_name: str, terms: List[str]) -> str: if not terms: return "Eraser" if len(terms) == 1: return terms[0] - nodes = terms - while len(nodes) > 1: + while len(terms) > 1: next_level = [] - for i in range(0, len(nodes), 2): - if i + 1 < len(nodes): - in_w = wire_gen.next() - script.append(f"{in_w} ~ {agent_name}({nodes[i]}, {nodes[i+1]});") + for i in range(0, len(terms), 2): + if i + 1 < len(terms): + in_w = wire_gen() + script.append(f"{in_w} ~ {agent_name}({terms[i]}, {terms[i+1]});") next_level.append(in_w) else: - next_level.append(nodes[i]) - nodes = next_level - return nodes[0] + next_level.append(terms[i]) + terms = next_level + return terms[0] def balanced_fanin(agent_name: str, terms: List[str]) -> str: if not terms: return "Eraser" if len(terms) == 1: return terms[0] - nodes = terms - while len(nodes) > 1: + while len(terms) > 1: next_level = [] - for i in range(0, len(nodes), 2): - if i + 1 < len(nodes): - res_w = wire_gen.next() - script.append(f"{nodes[i]} ~ {agent_name}({res_w}, {nodes[i+1]});") + for i in range(0, len(terms), 2): + if i + 1 < len(terms): + res_w = wire_gen() + script.append(f"{terms[i]} ~ {agent_name}({res_w}, {terms[i+1]});") next_level.append(res_w) else: - next_level.append(nodes[i]) - nodes = next_level - return nodes[0] - - def op_gemm(node, override_attrs=None): - attrs = override_attrs if override_attrs is not None else get_attrs(node) - - W = initializers[node.input[1]] - if not attrs.get("transB", 0): W = W.T - out_dim, in_dim = W.shape - - B = initializers[node.input[2]] if len(node.input) > 2 else np.zeros(out_dim) - alpha, beta = attrs.get("alpha", 1.0), attrs.get("beta", 1.0) - - if node.input[0] not in interactions: - interactions[node.input[0]] = [[] for _ in range(in_dim)] - - out_terms = interactions.get(node.output[0]) or [[f"Materialize(result{j})"] for j in range(out_dim)] - + next_level.append(terms[i]) + terms = next_level + return terms[0] + + def gemm(Y, A, B, C, alpha, beta, _, transB): + weights = initializers[B] + if transB == 0: + weights = weights.T + out_dim, in_dim = weights.shape + biases = initializers[C] if C is not None else None + if A not in interactions: + interactions[A] = [[] for _ in range(in_dim)] + out_terms = interactions.get(Y) or [[f"Materialize(result{j})"] for j in range(out_dim)] for j in range(out_dim): sink = balanced_fanout("Dup", out_terms[j]) neuron_terms = [] for i in range(in_dim): - weight = float(alpha * W[j, i]) + weight = float(alpha * weights[j, i]) if weight != 0: - v = wire_gen.next() - interactions[node.input[0]][i].append(f"Mul({v}, Concrete({weight}))") + v = wire_gen() + interactions[A][i].append(f"Mul({v}, Concrete({weight}))") neuron_terms.append(v) - - bias_val = float(beta * B[j]) - if bias_val != 0 or not neuron_terms: - neuron_terms.append(f"Concrete({bias_val})") - + bias = float(beta * biases[j]) if biases is not None else 0.0 + if bias != 0 or len(neuron_terms) == 0: + neuron_terms.append(f"Concrete({bias})") root = balanced_fanin("Add", neuron_terms) script.append(f"{root} ~ {sink};") + def op_gemm(node): + attrs = get_attrs(node) + gemm(node.output[0], node.input[0], node.input[1], node.input[2], attrs.get("alpha", 1.0), attrs.get("beta", 1.0), attrs.get("transA", 0), attrs.get("transB", 0)) + def op_matmul(node): - op_gemm(node, override_attrs={"alpha": 1.0, "beta": 0.0, "transB": 0}) + gemm(node.output[0], node.input[0], node.input[1], None, 1.0, 0.0, 0, 0) def op_relu(node): - out_name, in_name = node.output[0], node.input[0] - dim = get_dim(out_name) or 1 + in_name, out_name = node.input[0], node.output[0] + dim = dims.get(out_name) or 1 if in_name not in interactions: interactions[in_name] = [[] for _ in range(dim)] @@ -175,24 +165,20 @@ def inpla_export(model: onnx.ModelProto, bounds: Optional[Dict[str, List[float]] for i in range(dim): sink = balanced_fanout("Dup", out_terms[i]) - v = wire_gen.next() + v = wire_gen() interactions[in_name][i].append(f"ReLU({v})") script.append(f"{v} ~ {sink};") - def op_flatten(node): - op_identity(node) - - def op_reshape(node): - op_identity(node) - def op_add(node): - out_name = node.output[0] in_a, in_b = node.input[0], node.input[1] + out_name = node.output[0] - dim = get_dim(out_name) or get_dim(in_a) or get_dim(in_b) or 1 + dim = dims.get(out_name) or dims.get(in_a) or dims.get(in_b) or 1 - if in_a not in interactions: interactions[in_a] = [[] for _ in range(dim)] - if in_b not in interactions: interactions[in_b] = [[] for _ in range(dim)] + if in_a not in interactions: + interactions[in_a] = [[] for _ in range(dim)] + if in_b not in interactions: + interactions[in_b] = [[] for _ in range(dim)] out_terms = interactions.get(out_name) or [[f"Materialize(result{j})"] for j in range(dim)] @@ -208,24 +194,23 @@ def inpla_export(model: onnx.ModelProto, bounds: Optional[Dict[str, List[float]] val = float(a_const.flatten()[i % a_const.size]) interactions[in_b][i].append(f"Add({sink}, Concrete({val}))") else: - v_b = wire_gen.next() + v_b = wire_gen() interactions[in_a][i].append(f"Add({sink}, {v_b})") interactions[in_b][i].append(f"{v_b}") def op_sub(node): - out_name = node.output[0] in_a, in_b = node.input[0], node.input[1] + out_name = node.output[0] - dim = get_dim(out_name) or get_dim(in_a) or get_dim(in_b) or 1 + dim = dims.get(out_name) or dims.get(in_a) or dims.get(in_b) or 1 - if out_name not in interactions: - interactions[out_name] = [[f"Materialize(result{i})"] for i in range(dim)] + if in_a not in interactions: + interactions[in_a] = [[] for _ in range(dim)] + if in_b not in interactions: + interactions[in_b] = [[] for _ in range(dim)] out_terms = interactions.get(out_name) or [[f"Materialize(result{j})"] for j in range(dim)] - if in_a not in interactions: interactions[in_a] = [[] for _ in range(dim)] - if in_b not in interactions: interactions[in_b] = [[] for _ in range(dim)] - b_const = initializers.get(in_b) a_const = initializers.get(in_a) @@ -236,47 +221,29 @@ def inpla_export(model: onnx.ModelProto, bounds: Optional[Dict[str, List[float]] interactions[in_a][i].append(f"Add({sink}, Concrete({-val}))") elif a_const is not None: val = float(a_const.flatten()[i % a_const.size]) - v_b = wire_gen.next() interactions[in_b][i].append(f"Mul(Add({sink}, Concrete({val})), Concrete(-1.0))") else: - v_b = wire_gen.next() + v_b = wire_gen() interactions[in_a][i].append(f"Add({sink}, {v_b})") interactions[in_b][i].append(f"Mul({v_b}, Concrete(-1.0))") - def op_slice(node): - in_name, out_name = node.input[0], node.output[0] - if out_name in interactions: - starts = initializers.get(node.input[1]) - steps = initializers.get(node.input[4]) if len(node.input) > 4 else None - - start = int(starts.flatten()[0]) if starts is not None else 0 - step = int(steps.flatten()[0]) if steps is not None else 1 - - in_dim = get_dim(in_name) or 1 - if in_name not in interactions: - interactions[in_name] = [[] for _ in range(in_dim)] - - for i, terms in enumerate(interactions[out_name]): - input_index = start + (i * step) - if input_index < in_dim: - interactions[in_name][input_index].extend(terms) - def op_squeeze(node): op_identity(node) def op_unsqueeze(node): op_identity(node) + def op_flatten(node): + op_identity(node) + + def op_reshape(node): + op_identity(node) + def op_identity(node): in_name, out_name = node.input[0], node.output[0] if out_name in interactions: interactions[in_name] = interactions[out_name] - - graph, initializers = model.graph, get_initializers(model.graph) - wire_gen = NameGen("w") - interactions: Dict[str, List[List[str]]] = {} - script = [] ops = { "Gemm": op_gemm, "Relu": op_relu, @@ -285,7 +252,6 @@ def inpla_export(model: onnx.ModelProto, bounds: Optional[Dict[str, List[float]] "MatMul": op_matmul, "Add": op_add, "Sub": op_sub, - "Slice": op_slice, "Squeeze": op_squeeze, "Unsqueeze": op_unsqueeze, "Identity": op_identity @@ -293,7 +259,7 @@ def inpla_export(model: onnx.ModelProto, bounds: Optional[Dict[str, List[float]] if graph.output: out = graph.output[0].name - dim = get_dim(out) + dim = dims.get(out) if dim: interactions[out] = [[f"Materialize(result{i})"] for i in range(dim)] @@ -304,10 +270,11 @@ def inpla_export(model: onnx.ModelProto, bounds: Optional[Dict[str, List[float]] raise RuntimeError(f"Unsupported ONNX operator: {node.op_type}") if graph.input: - input = "input" if "input" in interactions else graph.input[0].name - for i, terms in enumerate(interactions[input]): - sink = balanced_fanout("Dup", terms) - script.append(f"{sink} ~ Linear(TermSymbolic(X_{i}), 1.0, 0.0);") + for input in graph.input: + if input.name in interactions: + for i, terms in enumerate(interactions[input.name]): + sink = balanced_fanout("Dup", terms) + script.append(f"{sink} ~ Linear(TermSymbolic(X_{i}), 1.0, 0.0);") result_lines = [f"result{i};" for i in range(len(interactions.get(graph.output[0].name, [])))] return "\n".join(script + result_lines) @@ -345,60 +312,35 @@ def z3_evaluate(model: str, X: dict): 'TermReLU': TermReLU } - def tokenize(s): - i = 0 - n = len(s) - while i < n: - c = s[i] - if c in '(),': - yield c - i += 1 - elif c.isspace(): - i += 1 - else: - start = i - while i < n and s[i] not in '(), ' and not s[i].isspace(): - i += 1 - yield s[start:i] - - def iterative_eval(tokens_gen): - stack = [[]] - for token in tokens_gen: - if token == '(': - stack.append([]) - elif token == ')': - args = stack.pop() - func_name = stack[-1].pop() - func = context.get(func_name) - if not func: raise ValueError(f"Unknown: {func_name}") - stack[-1].append(func(*args)) - elif token == ',': - continue - else: - if token in context: - stack[-1].append(token) - else: - try: - stack[-1].append(float(token)) - except ValueError: - stack[-1].append(token) - return stack[0][0] - exprs = [] + allowed_calls = set(context.keys()) + allowed_nodes = (ast.Expression, ast.Call, ast.Name, ast.Load, ast.Constant, ast.UnaryOp, ast.USub) + model = re.sub(r'X_\d+', lambda m: f'"{m.group(0)}"', model) for line in model.splitlines(): - line = line.strip() - exprs.append(iterative_eval(tokenize(line))) + line = line.strip().rstrip(';') + if not line: + continue + tree = ast.parse(line, mode="eval") + for node in ast.walk(tree): + if not isinstance(node, allowed_nodes): + raise ValueError(f"Disallowed syntax: {type(node).__name__}") + if isinstance(node, ast.Call): + if not isinstance(node.func, ast.Name) or node.func.id not in allowed_calls: + raise ValueError("Disallowed function call") + if isinstance(node, ast.Constant) and not isinstance(node.value, (int, float, str)): + raise ValueError(f"Only numeric constants and string names allowed") + exprs.append(eval(compile(tree, "<model>", "eval"), {"__builtins__": {}}, context)) return exprs -def net(model: onnx.ModelProto, bounds: Optional[Dict[str, List[float]]] = None): +def net(model: onnx.ModelProto, X, bounds: Optional[Dict[str, List[float]]] = None): model_hash = hashlib.sha256(model.SerializeToString()).hexdigest() - bounds_key = tuple(sorted((k, tuple(v)) for k, v in bounds.items())) if bounds else None - cache_key = (model_hash, bounds_key) + # bounds_key = tuple(sorted((k, tuple(v)) for k, v in bounds.items())) if bounds else None + # cache_key = (model_hash, bounds_key) + cache_key = model_hash if cache_key not in _CACHE: exported = inpla_export(model, bounds) reduced = inpla_run(exported) - X = {} evaluated = z3_evaluate(reduced, X) _CACHE[cache_key] = evaluated @@ -408,19 +350,20 @@ def net(model: onnx.ModelProto, bounds: Optional[Dict[str, List[float]]] = None) class Solver(z3.Solver): def __init__(self, *args, **kwargs): super().__init__(*args, **kwargs) - self.bounds: Dict[str, List[float]] = {} + # self.bounds: Dict[str, List[float]] = {} self.pending_nets: List[onnx.ModelProto] = [] + self.X = {} def load_smtlib(self, file_path: str): with open(file_path, "r") as f: content = f.read() - for match in re.finditer(r"\(assert\s+\((>=|<=)\s+(X_\d+)\s+([-+]?\d*\.?\d+(?:[eE][-+]?\d+)?)\)\)", content): - op, var, val = match.groups() - val = float(val) - if var not in self.bounds: self.bounds[var] = [float('-inf'), float('inf')] - if op == ">=": self.bounds[var][0] = val - else: self.bounds[var][1] = val + # for match in re.finditer(r"\(assert\s+\((>=|<=)\s+(X_\d+)\s+([-+]?\d*\.?\d+(?:[eE][-+]?\d+)?)\)\)", content): + # op, var, val = match.groups() + # val = float(val) + # if var not in self.bounds: self.bounds[var] = [float('-inf'), float('inf')] + # if op == ">=": self.bounds[var][0] = val + # else: self.bounds[var][1] = val assertions = z3.parse_smt2_string(content) self.add(assertions) @@ -433,9 +376,10 @@ class Solver(z3.Solver): def _process_nets(self): y_count = 0 for model in self.pending_nets: - z3_outputs = net(model, bounds=self.bounds) + z3_outputs = net(model, self.X) + if z3_outputs: - for _, out_expr in enumerate(z3_outputs): + for out_expr in z3_outputs: y_var = z3.Real(f"Y_{y_count}") self.add(y_var == out_expr) y_count += 1 diff --git a/verify_example.py b/verify_example.py index a6e8839..92641c8 100644 --- a/verify_example.py +++ b/verify_example.py @@ -13,22 +13,19 @@ def check_property(onnx_a, onnx_b, smtlib): result = solver.check() if result == vein.unsat: - print("VERIFIED (UNSAT): The networks are equivalent under this property.", end="\n\n") + print("VERIFIED (UNSAT): The networks are equivalent under this property.\n") elif result == vein.sat: - print("FAILED (SAT): The networks are NOT equivalent.") - print("Counter-example input:") - print(solver.model(), end="\n\n") + print(f"FAILED (SAT): The networks are NOT equivalent.\nCounter-example input:\n{solver.model()}\n") # m = solver.model() # sorted_symbols = sorted([s for s in m.decls() if s.name().startswith("X_")], key=lambda s: s.name()) # for s in sorted_symbols: # print(f" {s.name()} = {m[s]}") else: - print("UNKNOWN", end="\n\n") + print("UNKNOWN\n") if __name__ == "__main__": if len(sys.argv) <= 1: - print("Net not provided") - print("Available Nets: 'xor', 'mnist', 'iris', 'acasxu', 'pendulum', 'double_integrator'") + print("Net not provided\nAvailable Nets: 'xor', 'mnist', 'iris', 'acasxu', 'pendulum', 'double_integrator'") sys.exit() match sys.argv[1]: @@ -57,13 +54,13 @@ if __name__ == "__main__": epsilon = "./examples/ACASXU/ACASXU_epsilon.smtlib" argmax = "./examples/ACASXU/ACASXU_argmax.smtlib" case "pendulum": - net_a = "./examples/pendulum/pendulum_finetune_con.onnx" + net_a = "./examples/pendulum/pendulum_pretrain_con.onnx" net_b = "./examples/pendulum/pendulum_finetune_con.onnx" strict = "./examples/pendulum/pendulum_strict.smtlib" epsilon = "./examples/pendulum/pendulum_epsilon.smtlib" argmax = "./examples/pendulum/pendulum_argmax.smtlib" case "double_integrator": - net_a = "./examples/double_integrator/double_integrator_finetune_inv.onnx" + net_a = "./examples/double_integrator/double_integrator_pretrain_inv.onnx" net_b = "./examples/double_integrator/double_integrator_finetune_inv.onnx" strict = "./examples/double_integrator/double_integrator_strict.smtlib" epsilon = "./examples/double_integrator/double_integrator_epsilon.smtlib" @@ -72,7 +69,7 @@ if __name__ == "__main__": print("Available Nets: 'xor', 'mnist', 'iris', 'acasxu', 'pendulum', 'double_integrator'") sys.exit() - print(f"=== Comparing {net_a} and {net_b} ===", end="\n\n") + print(f"=== Comparing {net_a} and {net_b} ===\n") check_property(net_a, net_b, strict) check_property(net_a, net_b, epsilon) |