@ohtaman/washi 0.4.0 → 0.6.0

package/dist/browser/solvers/z3.js

@@ -22,355 +22,237 @@ var e = Object.create, t = Object.defineProperty, n = Object.getOwnPropertyDescr
 }, u = (n, r, o) => (o = n == null ? {} : e(i(n)), l(r || !n || !n.__esModule || !a.call(n, "default") ? t(o, "default", {
 	value: n,
 	enumerable: !0
-}) : o, n)), d = (e) => a.call(e, "module.exports") ? e["module.exports"] : l(t({}, "__esModule", { value: !0 }), e), f = 0, p = class {
+}) : o, n)), d = (e) => a.call(e, "module.exports") ? e["module.exports"] : l(t({}, "__esModule", { value: !0 }), e), f = 0, p = class e {
+	kind = "constraint";
+	id;
+	_lhs;
+	_sense;
+	_rhs;
+	_name;
+	hasExplicitName;
+	ownerModel = null;
+	slack = null;
+	dual = null;
+	addTerm(e, t) {
+		return t === 0 ? this : (this._lhs.addTerm(e, t), this.ownerModel?.notifyMutation?.(), this);
+	}
+	setTerm(e, t) {
+		return this._lhs.setTerm(e, t), this.ownerModel?.notifyMutation?.(), this;
+	}
+	constructor(e, t, n, r) {
+		this.id = ++f, this._lhs = e, this._sense = t, this._rhs = n;
+		let i = typeof r == "string" ? r.trim() : void 0;
+		i && i.length > 0 ? (this._name = i, this.hasExplicitName = !0) : (this._name = `c_${this.id}`, this.hasExplicitName = !1);
+	}
+	get lhs() {
+		return this._lhs;
+	}
+	set lhs(e) {
+		this._lhs !== e && (this._lhs = e, this.ownerModel?.notifyMutation?.());
+	}
+	get sense() {
+		return this._sense;
+	}
+	set sense(e) {
+		this._sense !== e && (this._sense = e, this.ownerModel?.notifyMutation?.());
+	}
+	get rhs() {
+		return this._rhs;
+	}
+	set rhs(e) {
+		Object.is(this._rhs, e) || (this._rhs = e, this.ownerModel?.notifyMutation?.());
+	}
+	get name() {
+		return this._name;
+	}
+	set name(e) {
+		this._name !== e && (this._name = e, this.ownerModel?.notifyMutation?.()), this.hasExplicitName = !0;
+	}
+	_assignModelName(e, t) {
+		this._name = e, this.hasExplicitName = t;
+	}
 	and(e) {
-		return new h("and", [this, e]);
+		return new v("and", [this, e]);
 	}
 	or(e) {
-		return new h("or", [this, e]);
+		return new v("or", [this, e]);
 	}
 	implies(e) {
-		return new h("implies", [this, e]);
+		return new v("implies", [this, e]);
 	}
 	xor(e) {
-		return new h("xor", [this, e]);
+		return new v("xor", [this, e]);
 	}
 	not() {
-		return new h("not", [this]);
+		return new v("not", [this]);
 	}
-}, m = class extends p {
-	id;
-	name;
-	value = null;
-	constructor(e) {
-		super(), this.id = ++f, this.name = e || `p_${this.id}`;
+	add(e) {
+		throw Error("Cannot perform arithmetic on a Constraint: expected a number, Var, LinExpr, or QuadExpr.");
 	}
-	toString() {
-		return this.name;
+	sub(e) {
+		throw Error("Cannot perform arithmetic on a Constraint: expected a number, Var, LinExpr, or QuadExpr.");
 	}
-}, h = class extends p {
-	op;
-	children;
-	constructor(e, t) {
-		super(), this.op = e, this.children = t;
+	mul(e) {
+		throw Error("Cannot perform arithmetic on a Constraint: expected a number, Var, LinExpr, or QuadExpr.");
 	}
-	toString() {
-		return this.op === "not" ? `not(${this.children[0].toString()})` : `(${this.children.map((e) => e.toString()).join(` ${this.op} `)})`;
+	div(e) {
+		throw Error("Cannot perform arithmetic on a Constraint: expected a number, Var, LinExpr, or QuadExpr.");
 	}
-}, g = 0, _ = class {
-	id;
-	lhs;
-	sense;
-	rhs;
-	name;
-	slack = null;
-	dual = null;
-	constructor(e, t, n, r) {
-		this.id = ++g, this.lhs = e, this.sense = t, this.rhs = n, this.name = r || `c_${this.id}`;
+	neg() {
+		throw Error("Cannot perform arithmetic on a Constraint: expected a number, Var, LinExpr, or QuadExpr.");
+	}
+	le(e, t) {
+		throw Error("Cannot compare a Constraint in (<=): expected a number, Var, or LinExpr.");
+	}
+	ge(e, t) {
+		throw Error("Cannot compare a Constraint in (>=): expected a number, Var, or LinExpr.");
+	}
+	eq(e, t) {
+		throw Error("Cannot compare a Constraint in (==): expected a number, Var, or LinExpr.");
+	}
+	get value() {
+		throw Error("Cannot read numeric value of a Constraint: expected a Var, LinExpr, or QuadExpr.");
+	}
+	get constant() {
+		throw Error("Cannot read numeric constant of a Constraint: expected a LinExpr or QuadExpr.");
 	}
+	clone() {
+		return new e(this._lhs.clone(), this._sense, this._rhs, this.hasExplicitName ? this._name : void 0);
+	}
+	toString() {
+		let e = this.sense === "==" ? "=" : this.sense;
+		return `${this.name}: ${this.lhs.toString()} ${e} ${this.rhs}`;
+	}
+}, m = 0;
+function h(e, t) {
+	if (e instanceof g || e instanceof p) return e;
+	throw typeof e == "object" && e && ("terms" in e || "quadTerms" in e) ? Error(`Cannot use an arithmetic expression without a comparison operator (<=, >=, ==) in logical operator "${t}". Use a comparison constraint such as expr\`\${x} <= 10\` or a BoolVar/BoolExpr.`) : typeof e == "object" && e && "id" in e && "name" in e && "lb" in e && "ub" in e && !("sense" in e) ? Error(`Invalid operand passed to logical operator "${t}": expected a BoolVar, BoolExpr, or Constraint, but received numeric variable "${e.name}". Use m.bool() for propositional variables, add a comparison such as expr\`\${x} == 1\`, or use m.indicator(binVar, constraint) for 0-1 Big-M indicator constraints.`) : Error(`Invalid operand passed to logical operator "${t}": expected a BoolVar, BoolExpr, or Constraint.`);
+}
+var g = class {
 	and(e) {
-		return new h("and", [this, e]);
+		return new v("and", [this, h(e, "and")]);
 	}
 	or(e) {
-		return new h("or", [this, e]);
+		return new v("or", [this, h(e, "or")]);
 	}
 	implies(e) {
-		return new h("implies", [this, e]);
+		return new v("implies", [this, h(e, "implies")]);
 	}
 	xor(e) {
-		return new h("xor", [this, e]);
+		return new v("xor", [this, h(e, "xor")]);
 	}
 	not() {
-		return new h("not", [this]);
+		return new v("not", [this]);
+	}
+}, _ = class extends g {
+	id;
+	name;
+	value = null;
+	constructor(e) {
+		super(), this.id = ++m, this.name = e || `p_${this.id}`;
 	}
 	toString() {
-		let e = this.sense === "==" ? "=" : this.sense;
-		return `${this.name}: ${this.lhs.toString()} ${e} ${this.rhs}`;
+		return this.name;
+	}
+}, v = class extends g {
+	op;
+	children;
+	constructor(e, t) {
+		super(), this.op = e, this.children = t.map((t) => h(t, e));
 	}
-}, ee = Symbol.for("washi.solverRegistry"), v = globalThis;
-v[ee] || (v[ee] = /* @__PURE__ */ new Map());
-var te = v[ee];
-function ne(e, t) {
-	te.set(e.toLowerCase(), t);
+	toString() {
+		return this.op === "not" ? `not(${this.children[0].toString()})` : `(${this.children.map((e) => e.toString()).join(` ${this.op} `)})`;
+	}
+};
+//#endregion
+//#region src/modeler/lp-writer.ts
+function y(e) {
+	return typeof e == "object" && !!e && typeof e.lpString == "string" && e.nameToVar instanceof Map && e.nameToConstraint instanceof Map;
+}
+//#endregion
+//#region src/modeler/solvers/registry.ts
+var ee = Symbol.for("washi.solverRegistry"), te = globalThis;
+te[ee] || (te[ee] = /* @__PURE__ */ new Map());
+var b = te[ee];
+function x(e, t) {
+	b.set(e.toLowerCase(), t);
 }
 //#endregion
 //#region \0washi-browser-z3-assets
-var y = import.meta.url;
-function b(e) {
-	if (!y) throw Error("[WaSHI] Load the browser IIFE using an external script src, or use the browser ESM build.");
-	return new URL(e, y).href;
+var ne = import.meta.url;
+function re(e) {
+	if (!ne) throw Error("[WaSHI] Load the browser IIFE using an external script src, or use the browser ESM build.");
+	return new URL(e, ne).href;
 }
-function re() {
+function ie() {
 	return {
-		jsUrl: b("z3-built.js"),
-		wasmUrl: b("z3-built.wasm")
+		jsUrl: re("z3-built.js"),
+		wasmUrl: re("z3-built.wasm")
 	};
 }
 //#endregion
-//#region node_modules/async-mutex/index.mjs
-var ie = /* @__PURE__ */ c({
-	E_ALREADY_LOCKED: () => ce,
-	E_CANCELED: () => le,
-	E_TIMEOUT: () => se,
-	Mutex: () => S,
-	Semaphore: () => x,
-	tryAcquire: () => oe,
-	withTimeout: () => ae
+//#region node_modules/tslib/tslib.es6.mjs
+var ae = /* @__PURE__ */ c({
+	__addDisposableResource: () => Oe,
+	__assign: () => Me,
+	__asyncDelegator: () => xe,
+	__asyncGenerator: () => be,
+	__asyncValues: () => Se,
+	__await: () => ye,
+	__awaiter: () => fe,
+	__classPrivateFieldGet: () => Te,
+	__classPrivateFieldIn: () => De,
+	__classPrivateFieldSet: () => Ee,
+	__createBinding: () => Ne,
+	__decorate: () => ce,
+	__disposeResources: () => ke,
+	__esDecorate: () => ue,
+	__exportStar: () => pe,
+	__extends: () => oe,
+	__generator: () => T,
+	__importDefault: () => we,
+	__importStar: () => Ce,
+	__makeTemplateObject: () => E,
+	__metadata: () => w,
+	__param: () => le,
+	__propKey: () => S,
+	__read: () => he,
+	__rest: () => se,
+	__rewriteRelativeImportExtension: () => Ae,
+	__runInitializers: () => de,
+	__setFunctionName: () => C,
+	__spread: () => ge,
+	__spreadArray: () => ve,
+	__spreadArrays: () => _e,
+	__values: () => me,
+	default: () => Le
 });
-function ae(e, t, n = se) {
-	return {
-		acquire: () => new Promise((r, i) => C(this, void 0, void 0, function* () {
-			let a = !1, o = setTimeout(() => {
-				a = !0, i(n);
-			}, t);
-			try {
-				let t = yield e.acquire();
-				a ? (Array.isArray(t) ? t[1] : t)() : (clearTimeout(o), r(t));
-			} catch (e) {
-				a || (clearTimeout(o), i(e));
-			}
-		})),
-		runExclusive(e) {
-			return C(this, void 0, void 0, function* () {
-				let t = () => void 0;
-				try {
-					let n = yield this.acquire();
-					return Array.isArray(n) ? (t = n[1], yield e(n[0])) : (t = n, yield e());
-				} finally {
-					t();
-				}
-			});
-		},
-		release() {
-			e.release();
-		},
-		cancel() {
-			return e.cancel();
-		},
-		waitForUnlock: () => e.waitForUnlock(),
-		isLocked: () => e.isLocked()
-	};
-}
-function oe(e, t = ce) {
-	return ae(e, 0, t);
-}
-var se, ce, le, ue, x, de, S, C, w = o((() => {
-	se = /* @__PURE__ */ Error("timeout while waiting for mutex to become available"), ce = /* @__PURE__ */ Error("mutex already locked"), le = /* @__PURE__ */ Error("request for lock canceled"), ue = function(e, t, n, r) {
-		function i(e) {
-			return e instanceof n ? e : new n(function(t) {
-				t(e);
-			});
-		}
-		return new (n ||= Promise)(function(n, a) {
-			function o(e) {
-				try {
-					c(r.next(e));
-				} catch (e) {
-					a(e);
-				}
-			}
-			function s(e) {
-				try {
-					c(r.throw(e));
-				} catch (e) {
-					a(e);
-				}
-			}
-			function c(e) {
-				e.done ? n(e.value) : i(e.value).then(o, s);
-			}
-			c((r = r.apply(e, t || [])).next());
-		});
-	}, x = class {
-		constructor(e, t = le) {
-			if (this._maxConcurrency = e, this._cancelError = t, this._queue = [], this._waiters = [], e <= 0) throw Error("semaphore must be initialized to a positive value");
-			this._value = e;
-		}
-		acquire() {
-			let e = this.isLocked(), t = new Promise((e, t) => this._queue.push({
-				resolve: e,
-				reject: t
-			}));
-			return e || this._dispatch(), t;
-		}
-		runExclusive(e) {
-			return ue(this, void 0, void 0, function* () {
-				let [t, n] = yield this.acquire();
-				try {
-					return yield e(t);
-				} finally {
-					n();
-				}
-			});
-		}
-		waitForUnlock() {
-			return ue(this, void 0, void 0, function* () {
-				return this.isLocked() ? new Promise((e) => this._waiters.push({ resolve: e })) : Promise.resolve();
-			});
-		}
-		isLocked() {
-			return this._value <= 0;
-		}
-		release() {
-			if (this._maxConcurrency > 1) throw Error("this method is unavailable on semaphores with concurrency > 1; use the scoped release returned by acquire instead");
-			if (this._currentReleaser) {
-				let e = this._currentReleaser;
-				this._currentReleaser = void 0, e();
-			}
-		}
-		cancel() {
-			this._queue.forEach((e) => e.reject(this._cancelError)), this._queue = [];
-		}
-		_dispatch() {
-			let e = this._queue.shift();
-			if (!e) return;
-			let t = !1;
-			this._currentReleaser = () => {
-				t || (t = !0, this._value++, this._resolveWaiters(), this._dispatch());
-			}, e.resolve([this._value--, this._currentReleaser]);
-		}
-		_resolveWaiters() {
-			this._waiters.forEach((e) => e.resolve()), this._waiters = [];
-		}
-	}, de = function(e, t, n, r) {
-		function i(e) {
-			return e instanceof n ? e : new n(function(t) {
-				t(e);
-			});
-		}
-		return new (n ||= Promise)(function(n, a) {
-			function o(e) {
-				try {
-					c(r.next(e));
-				} catch (e) {
-					a(e);
-				}
-			}
-			function s(e) {
-				try {
-					c(r.throw(e));
-				} catch (e) {
-					a(e);
-				}
-			}
-			function c(e) {
-				e.done ? n(e.value) : i(e.value).then(o, s);
-			}
-			c((r = r.apply(e, t || [])).next());
-		});
-	}, S = class {
-		constructor(e) {
-			this._semaphore = new x(1, e);
-		}
-		acquire() {
-			return de(this, void 0, void 0, function* () {
-				let [, e] = yield this._semaphore.acquire();
-				return e;
-			});
-		}
-		runExclusive(e) {
-			return this._semaphore.runExclusive(() => e());
-		}
-		isLocked() {
-			return this._semaphore.isLocked();
-		}
-		waitForUnlock() {
-			return this._semaphore.waitForUnlock();
-		}
-		release() {
-			this._semaphore.release();
-		}
-		cancel() {
-			return this._semaphore.cancel();
-		}
-	}, C = function(e, t, n, r) {
-		function i(e) {
-			return e instanceof n ? e : new n(function(t) {
-				t(e);
-			});
-		}
-		return new (n ||= Promise)(function(n, a) {
-			function o(e) {
-				try {
-					c(r.next(e));
-				} catch (e) {
-					a(e);
-				}
-			}
-			function s(e) {
-				try {
-					c(r.throw(e));
-				} catch (e) {
-					a(e);
-				}
-			}
-			function c(e) {
-				e.done ? n(e.value) : i(e.value).then(o, s);
-			}
-			c((r = r.apply(e, t || [])).next());
-		});
-	};
-})), fe = /* @__PURE__ */ c({
-	__addDisposableResource: () => Le,
-	__assign: () => Be,
-	__asyncDelegator: () => ke,
-	__asyncGenerator: () => Oe,
-	__asyncValues: () => Ae,
-	__await: () => De,
-	__awaiter: () => be,
-	__classPrivateFieldGet: () => Pe,
-	__classPrivateFieldIn: () => Ie,
-	__classPrivateFieldSet: () => Fe,
-	__createBinding: () => k,
-	__decorate: () => pe,
-	__disposeResources: () => Re,
-	__esDecorate: () => he,
-	__exportStar: () => D,
-	__extends: () => T,
-	__generator: () => xe,
-	__importDefault: () => Ne,
-	__importStar: () => Me,
-	__makeTemplateObject: () => je,
-	__metadata: () => ye,
-	__param: () => me,
-	__propKey: () => _e,
-	__read: () => Ce,
-	__rest: () => E,
-	__rewriteRelativeImportExtension: () => O,
-	__runInitializers: () => ge,
-	__setFunctionName: () => ve,
-	__spread: () => we,
-	__spreadArray: () => Ee,
-	__spreadArrays: () => Te,
-	__values: () => Se,
-	default: () => We
-});
-function T(e, t) {
+function oe(e, t) {
 	if (typeof t != "function" && t !== null) throw TypeError("Class extends value " + String(t) + " is not a constructor or null");
-	ze(e, t);
+	je(e, t);
 	function n() {
 		this.constructor = e;
 	}
 	e.prototype = t === null ? Object.create(t) : (n.prototype = t.prototype, new n());
 }
-function E(e, t) {
+function se(e, t) {
 	var n = {};
 	for (var r in e) Object.prototype.hasOwnProperty.call(e, r) && t.indexOf(r) < 0 && (n[r] = e[r]);
 	if (e != null && typeof Object.getOwnPropertySymbols == "function") for (var i = 0, r = Object.getOwnPropertySymbols(e); i < r.length; i++) t.indexOf(r[i]) < 0 && Object.prototype.propertyIsEnumerable.call(e, r[i]) && (n[r[i]] = e[r[i]]);
 	return n;
 }
-function pe(e, t, n, r) {
+function ce(e, t, n, r) {
 	var i = arguments.length, a = i < 3 ? t : r === null ? r = Object.getOwnPropertyDescriptor(t, n) : r, o;
 	if (typeof Reflect == "object" && typeof Reflect.decorate == "function") a = Reflect.decorate(e, t, n, r);
 	else for (var s = e.length - 1; s >= 0; s--) (o = e[s]) && (a = (i < 3 ? o(a) : i > 3 ? o(t, n, a) : o(t, n)) || a);
 	return i > 3 && a && Object.defineProperty(t, n, a), a;
 }
-function me(e, t) {
+function le(e, t) {
 	return function(n, r) {
 		t(n, r, e);
 	};
 }
-function he(e, t, n, r, i, a) {
+function ue(e, t, n, r, i, a) {
 	function o(e) {
 		if (e !== void 0 && typeof e != "function") throw TypeError("Function expected");
 		return e;
@@ -395,23 +277,23 @@ function he(e, t, n, r, i, a) {
 	}
 	l && Object.defineProperty(l, r.name, u), f = !0;
 }
-function ge(e, t, n) {
+function de(e, t, n) {
 	for (var r = arguments.length > 2, i = 0; i < t.length; i++) n = r ? t[i].call(e, n) : t[i].call(e);
 	return r ? n : void 0;
 }
-function _e(e) {
+function S(e) {
 	return typeof e == "symbol" ? e : `${e}`;
 }
-function ve(e, t, n) {
+function C(e, t, n) {
 	return typeof t == "symbol" && (t = t.description ? `[${t.description}]` : ""), Object.defineProperty(e, "name", {
 		configurable: !0,
 		value: n ? `${n} ${t}` : t
 	});
 }
-function ye(e, t) {
+function w(e, t) {
 	if (typeof Reflect == "object" && typeof Reflect.metadata == "function") return Reflect.metadata(e, t);
 }
-function be(e, t, n, r) {
+function fe(e, t, n, r) {
 	function i(e) {
 		return e instanceof n ? e : new n(function(t) {
 			t(e);
@@ -438,7 +320,7 @@ function be(e, t, n, r) {
 		c((r = r.apply(e, t || [])).next());
 	});
 }
-function xe(e, t) {
+function T(e, t) {
 	var n = {
 		label: 0,
 		sent: function() {
@@ -508,10 +390,10 @@ function xe(e, t) {
 		};
 	}
 }
-function D(e, t) {
-	for (var n in e) n !== "default" && !Object.prototype.hasOwnProperty.call(t, n) && k(t, e, n);
+function pe(e, t) {
+	for (var n in e) n !== "default" && !Object.prototype.hasOwnProperty.call(t, n) && Ne(t, e, n);
 }
-function Se(e) {
+function me(e) {
 	var t = typeof Symbol == "function" && Symbol.iterator, n = t && e[t], r = 0;
 	if (n) return n.call(e);
 	if (e && typeof e.length == "number") return { next: function() {
@@ -522,7 +404,7 @@ function Se(e) {
 	} };
 	throw TypeError(t ? "Object is not iterable." : "Symbol.iterator is not defined.");
 }
-function Ce(e, t) {
+function he(e, t) {
 	var n = typeof Symbol == "function" && e[Symbol.iterator];
 	if (!n) return e;
 	var r = n.call(e), i, a = [], o;
@@ -539,23 +421,23 @@ function Ce(e, t) {
 	}
 	return a;
 }
-function we() {
-	for (var e = [], t = 0; t < arguments.length; t++) e = e.concat(Ce(arguments[t]));
+function ge() {
+	for (var e = [], t = 0; t < arguments.length; t++) e = e.concat(he(arguments[t]));
 	return e;
 }
-function Te() {
+function _e() {
 	for (var e = 0, t = 0, n = arguments.length; t < n; t++) e += arguments[t].length;
 	for (var r = Array(e), i = 0, t = 0; t < n; t++) for (var a = arguments[t], o = 0, s = a.length; o < s; o++, i++) r[i] = a[o];
 	return r;
 }
-function Ee(e, t, n) {
+function ve(e, t, n) {
 	if (n || arguments.length === 2) for (var r = 0, i = t.length, a; r < i; r++) (a || !(r in t)) && (a ||= Array.prototype.slice.call(t, 0, r), a[r] = t[r]);
 	return e.concat(a || Array.prototype.slice.call(t));
 }
-function De(e) {
-	return this instanceof De ? (this.v = e, this) : new De(e);
+function ye(e) {
+	return this instanceof ye ? (this.v = e, this) : new ye(e);
 }
-function Oe(e, t, n) {
+function be(e, t, n) {
 	if (!Symbol.asyncIterator) throw TypeError("Symbol.asyncIterator is not defined.");
 	var r = n.apply(e, t || []), i, a = [];
 	return i = Object.create((typeof AsyncIterator == "function" ? AsyncIterator : Object).prototype), s("next"), s("throw"), s("return", o), i[Symbol.asyncIterator] = function() {
@@ -586,7 +468,7 @@ function Oe(e, t, n) {
 		}
 	}
 	function l(e) {
-		e.value instanceof De ? Promise.resolve(e.value.v).then(u, d) : f(a[0][2], e);
+		e.value instanceof ye ? Promise.resolve(e.value.v).then(u, d) : f(a[0][2], e);
 	}
 	function u(e) {
 		c("next", e);
@@ -598,7 +480,7 @@ function Oe(e, t, n) {
 		e(t), a.shift(), a.length && c(a[0][0], a[0][1]);
 	}
 }
-function ke(e) {
+function xe(e) {
 	var t = {}, n;
 	return r("next"), r("throw", function(e) {
 		throw e;
@@ -608,16 +490,16 @@ function ke(e) {
 	function r(r, i) {
 		t[r] = e[r] ? function(t) {
 			return (n = !n) ? {
-				value: De(e[r](t)),
+				value: ye(e[r](t)),
 				done: !1
 			} : i ? i(t) : t;
 		} : i;
 	}
 }
-function Ae(e) {
+function Se(e) {
 	if (!Symbol.asyncIterator) throw TypeError("Symbol.asyncIterator is not defined.");
 	var t = e[Symbol.asyncIterator], n;
-	return t ? t.call(e) : (e = typeof Se == "function" ? Se(e) : e[Symbol.iterator](), n = {}, r("next"), r("throw"), r("return"), n[Symbol.asyncIterator] = function() {
+	return t ? t.call(e) : (e = typeof me == "function" ? me(e) : e[Symbol.iterator](), n = {}, r("next"), r("throw"), r("return"), n[Symbol.asyncIterator] = function() {
 		return this;
 	}, n);
 	function r(t) {
@@ -636,34 +518,34 @@ function Ae(e) {
 		}, t);
 	}
 }
-function je(e, t) {
+function E(e, t) {
 	return Object.defineProperty ? Object.defineProperty(e, "raw", { value: t }) : e.raw = t, e;
 }
-function Me(e) {
+function Ce(e) {
 	if (e && e.__esModule) return e;
 	var t = {};
-	if (e != null) for (var n = He(e), r = 0; r < n.length; r++) n[r] !== "default" && k(t, e, n[r]);
-	return Ve(t, e), t;
+	if (e != null) for (var n = Fe(e), r = 0; r < n.length; r++) n[r] !== "default" && Ne(t, e, n[r]);
+	return Pe(t, e), t;
 }
-function Ne(e) {
+function we(e) {
 	return e && e.__esModule ? e : { default: e };
 }
-function Pe(e, t, n, r) {
+function Te(e, t, n, r) {
 	if (n === "a" && !r) throw TypeError("Private accessor was defined without a getter");
 	if (typeof t == "function" ? e !== t || !r : !t.has(e)) throw TypeError("Cannot read private member from an object whose class did not declare it");
 	return n === "m" ? r : n === "a" ? r.call(e) : r ? r.value : t.get(e);
 }
-function Fe(e, t, n, r, i) {
+function Ee(e, t, n, r, i) {
 	if (r === "m") throw TypeError("Private method is not writable");
 	if (r === "a" && !i) throw TypeError("Private accessor was defined without a setter");
 	if (typeof t == "function" ? e !== t || !i : !t.has(e)) throw TypeError("Cannot write private member to an object whose class did not declare it");
 	return r === "a" ? i.call(e, n) : i ? i.value = n : t.set(e, n), n;
 }
-function Ie(e, t) {
+function De(e, t) {
 	if (t === null || typeof t != "object" && typeof t != "function") throw TypeError("Cannot use 'in' operator on non-object");
 	return typeof e == "function" ? t === e : e.has(t);
 }
-function Le(e, t, n) {
+function Oe(e, t, n) {
 	if (t != null) {
 		if (typeof t != "object" && typeof t != "function") throw TypeError("Object expected.");
 		var r, i;
@@ -690,9 +572,9 @@ function Le(e, t, n) {
 	} else n && e.stack.push({ async: !0 });
 	return t;
 }
-function Re(e) {
+function ke(e) {
 	function t(t) {
-		e.error = e.hasError ? new Ue(t, e.error, "An error was suppressed during disposal.") : t, e.hasError = !0;
+		e.error = e.hasError ? new Ie(t, e.error, "An error was suppressed during disposal.") : t, e.hasError = !0;
 	}
 	var n, r = 0;
 	function i() {
@@ -712,24 +594,24 @@ function Re(e) {
 	}
 	return i();
 }
-function O(e, t) {
+function Ae(e, t) {
 	return typeof e == "string" && /^\.\.?\//.test(e) ? e.replace(/\.(tsx)$|((?:\.d)?)((?:\.[^./]+?)?)\.([cm]?)ts$/i, function(e, n, r, i, a) {
 		return n ? t ? ".jsx" : ".js" : r && (!i || !a) ? e : r + i + "." + a.toLowerCase() + "js";
 	}) : e;
 }
-var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
-	ze = function(e, t) {
-		return ze = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function(e, t) {
+var je, Me, Ne, Pe, Fe, Ie, Le, Re = o((() => {
+	je = function(e, t) {
+		return je = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function(e, t) {
 			e.__proto__ = t;
 		} || function(e, t) {
 			for (var n in t) Object.prototype.hasOwnProperty.call(t, n) && (e[n] = t[n]);
-		}, ze(e, t);
-	}, Be = function() {
-		return Be = Object.assign || function(e) {
+		}, je(e, t);
+	}, Me = function() {
+		return Me = Object.assign || function(e) {
 			for (var t, n = 1, r = arguments.length; n < r; n++) for (var i in t = arguments[n], t) Object.prototype.hasOwnProperty.call(t, i) && (e[i] = t[i]);
 			return e;
-		}, Be.apply(this, arguments);
-	}, k = Object.create ? (function(e, t, n, r) {
+		}, Me.apply(this, arguments);
+	}, Ne = Object.create ? (function(e, t, n, r) {
 		r === void 0 && (r = n);
 		var i = Object.getOwnPropertyDescriptor(t, n);
 		(!i || ("get" in i ? !t.__esModule : i.writable || i.configurable)) && (i = {
@@ -740,61 +622,61 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 		}), Object.defineProperty(e, r, i);
 	}) : (function(e, t, n, r) {
 		r === void 0 && (r = n), e[r] = t[n];
-	}), Ve = Object.create ? (function(e, t) {
+	}), Pe = Object.create ? (function(e, t) {
 		Object.defineProperty(e, "default", {
 			enumerable: !0,
 			value: t
 		});
 	}) : function(e, t) {
 		e.default = t;
-	}, He = function(e) {
-		return He = Object.getOwnPropertyNames || function(e) {
+	}, Fe = function(e) {
+		return Fe = Object.getOwnPropertyNames || function(e) {
 			var t = [];
 			for (var n in e) Object.prototype.hasOwnProperty.call(e, n) && (t[t.length] = n);
 			return t;
-		}, He(e);
-	}, Ue = typeof SuppressedError == "function" ? SuppressedError : function(e, t, n) {
+		}, Fe(e);
+	}, Ie = typeof SuppressedError == "function" ? SuppressedError : function(e, t, n) {
 		var r = Error(n);
 		return r.name = "SuppressedError", r.error = e, r.suppressed = t, r;
-	}, We = {
-		__extends: T,
-		__assign: Be,
-		__rest: E,
-		__decorate: pe,
-		__param: me,
-		__esDecorate: he,
-		__runInitializers: ge,
-		__propKey: _e,
-		__setFunctionName: ve,
-		__metadata: ye,
-		__awaiter: be,
-		__generator: xe,
-		__createBinding: k,
-		__exportStar: D,
-		__values: Se,
-		__read: Ce,
-		__spread: we,
-		__spreadArrays: Te,
-		__spreadArray: Ee,
-		__await: De,
-		__asyncGenerator: Oe,
-		__asyncDelegator: ke,
-		__asyncValues: Ae,
-		__makeTemplateObject: je,
-		__importStar: Me,
-		__importDefault: Ne,
-		__classPrivateFieldGet: Pe,
-		__classPrivateFieldSet: Fe,
-		__classPrivateFieldIn: Ie,
-		__addDisposableResource: Le,
-		__disposeResources: Re,
-		__rewriteRelativeImportExtension: O
+	}, Le = {
+		__extends: oe,
+		__assign: Me,
+		__rest: se,
+		__decorate: ce,
+		__param: le,
+		__esDecorate: ue,
+		__runInitializers: de,
+		__propKey: S,
+		__setFunctionName: C,
+		__metadata: w,
+		__awaiter: fe,
+		__generator: T,
+		__createBinding: Ne,
+		__exportStar: pe,
+		__values: me,
+		__read: he,
+		__spread: ge,
+		__spreadArrays: _e,
+		__spreadArray: ve,
+		__await: ye,
+		__asyncGenerator: be,
+		__asyncDelegator: xe,
+		__asyncValues: Se,
+		__makeTemplateObject: E,
+		__importStar: Ce,
+		__importDefault: we,
+		__classPrivateFieldGet: Te,
+		__classPrivateFieldSet: Ee,
+		__classPrivateFieldIn: De,
+		__addDisposableResource: Oe,
+		__disposeResources: ke,
+		__rewriteRelativeImportExtension: Ae
 	};
-})), A = /* @__PURE__ */ s(((e) => {
+})), ze = /* @__PURE__ */ s(((e) => {
 	Object.defineProperty(e, "__esModule", { value: !0 }), e.E_CANCELED = e.E_ALREADY_LOCKED = e.E_TIMEOUT = void 0, e.E_TIMEOUT = /* @__PURE__ */ Error("timeout while waiting for mutex to become available"), e.E_ALREADY_LOCKED = /* @__PURE__ */ Error("mutex already locked"), e.E_CANCELED = /* @__PURE__ */ Error("request for lock canceled");
-})), Ke = /* @__PURE__ */ s(((e) => {
+})), D = /* @__PURE__ */ s(((e) => {
 	Object.defineProperty(e, "__esModule", { value: !0 });
-	var t = (Ge(), d(fe)), n = A();
+	var t = (Re(), d(ae)), n = ze();
 	e.default = function() {
 		function e(e, t) {
 			if (t === void 0 && (t = n.E_CANCELED), this._maxConcurrency = e, this._cancelError = t, this._queue = [], this._waiters = [], e <= 0) throw Error("semaphore must be initialized to a positive value");
@@ -863,9 +745,9 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 			}), this._waiters = [];
 		}, e;
 	}();
-})), qe = /* @__PURE__ */ s(((e) => {
+})), Be = /* @__PURE__ */ s(((e) => {
 	Object.defineProperty(e, "__esModule", { value: !0 });
-	var t = (Ge(), d(fe)), n = Ke();
+	var t = (Re(), d(ae)), n = D();
 	e.default = function() {
 		function e(e) {
 			this._semaphore = new n.default(1, e);
@@ -894,9 +776,9 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 			return this._semaphore.cancel();
 		}, e;
 	}();
-})), Je = /* @__PURE__ */ s(((e) => {
+})), Ve = /* @__PURE__ */ s(((e) => {
 	Object.defineProperty(e, "__esModule", { value: !0 }), e.withTimeout = void 0;
-	var t = (Ge(), d(fe)), n = A();
+	var t = (Re(), d(ae)), n = ze();
 	function r(e, r, i) {
 		var a = this;
 		return i === void 0 && (i = n.E_TIMEOUT), {
@@ -961,44 +843,44 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 		};
 	}
 	e.withTimeout = r;
-})), Ye = /* @__PURE__ */ s(((e) => {
+})), O = /* @__PURE__ */ s(((e) => {
 	Object.defineProperty(e, "__esModule", { value: !0 }), e.tryAcquire = void 0;
-	var t = A(), n = Je();
+	var t = ze(), n = Ve();
 	function r(e, r) {
 		return r === void 0 && (r = t.E_ALREADY_LOCKED), (0, n.withTimeout)(e, 0, r);
 	}
 	e.tryAcquire = r;
-})), Xe = /* @__PURE__ */ s(((e) => {
+})), He = /* @__PURE__ */ s(((e) => {
 	Object.defineProperty(e, "__esModule", { value: !0 }), e.tryAcquire = e.withTimeout = e.Semaphore = e.Mutex = void 0;
-	var t = (Ge(), d(fe)), n = qe();
+	var t = (Re(), d(ae)), n = Be();
 	Object.defineProperty(e, "Mutex", {
 		enumerable: !0,
 		get: function() {
 			return n.default;
 		}
 	});
-	var r = Ke();
+	var r = D();
 	Object.defineProperty(e, "Semaphore", {
 		enumerable: !0,
 		get: function() {
 			return r.default;
 		}
 	});
-	var i = Je();
+	var i = Ve();
 	Object.defineProperty(e, "withTimeout", {
 		enumerable: !0,
 		get: function() {
 			return i.withTimeout;
 		}
 	});
-	var a = Ye();
+	var a = O();
 	Object.defineProperty(e, "tryAcquire", {
 		enumerable: !0,
 		get: function() {
 			return a.tryAcquire;
 		}
-	}), (0, t.__exportStar)(A(), e);
-})), j = /* @__PURE__ */ s(((e) => {
+	}), (0, t.__exportStar)(ze(), e);
+})), Ue = /* @__PURE__ */ s(((e) => {
 	Object.defineProperty(e, "__esModule", { value: !0 }), e.Z3_goal_prec = e.Z3_error_code = e.Z3_ast_print_mode = e.Z3_param_kind = e.Z3_decl_kind = e.Z3_ast_kind = e.Z3_sort_kind = e.Z3_parameter_kind = e.Z3_symbol_kind = e.Z3_lbool = void 0;
 	var t;
 	(function(e) {
@@ -1040,7 +922,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 	(function(e) {
 		e[e.Z3_GOAL_PRECISE = 0] = "Z3_GOAL_PRECISE", e[e.Z3_GOAL_UNDER = 1] = "Z3_GOAL_UNDER", e[e.Z3_GOAL_OVER = 2] = "Z3_GOAL_OVER", e[e.Z3_GOAL_UNDER_OVER = 3] = "Z3_GOAL_UNDER_OVER";
 	})(u || (e.Z3_goal_prec = u = {}));
-})), Ze = /* @__PURE__ */ s(((e) => {
+})), We = /* @__PURE__ */ s(((e) => {
 	Object.defineProperty(e, "__esModule", { value: !0 }), e.init = t;
 	async function t(e, t = {}) {
 		let n = await e(t);
@@ -3977,7 +3859,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 			}
 		};
 	}
-})), Qe = /* @__PURE__ */ s(((e) => {
+})), Ge = /* @__PURE__ */ s(((e) => {
 	var t = e && e.__createBinding || (Object.create ? (function(e, t, n, r) {
 		r === void 0 && (r = n);
 		var i = Object.getOwnPropertyDescriptor(t, n);
@@ -3992,14 +3874,14 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 	})), n = e && e.__exportStar || function(e, n) {
 		for (var r in e) r !== "default" && !Object.prototype.hasOwnProperty.call(n, r) && t(n, e, r);
 	};
-	Object.defineProperty(e, "__esModule", { value: !0 }), n(j(), e), n(Ze(), e);
-})), $e = /* @__PURE__ */ s(((e) => {
+	Object.defineProperty(e, "__esModule", { value: !0 }), n(Ue(), e), n(We(), e);
+})), Ke = /* @__PURE__ */ s(((e) => {
 	Object.defineProperty(e, "__esModule", { value: !0 }), e.Z3AssertionError = e.Z3Error = void 0;
 	var t = class extends Error {};
 	e.Z3Error = t, e.Z3AssertionError = class extends t {};
-})), et = /* @__PURE__ */ s(((e) => {
+})), qe = /* @__PURE__ */ s(((e) => {
 	Object.defineProperty(e, "__esModule", { value: !0 }), e.assertExhaustive = n, e.assert = r, e.allSatisfy = i;
-	var t = $e();
+	var t = Ke();
 	function n(e) {
 		throw Error("Unexpected code execution detected, should be caught at compile time");
 	}
@@ -4011,9 +3893,9 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 		for (let r of e) if (n = !0, !t(r)) return !1;
 		return n === !0 || null;
 	}
-})), tt = /* @__PURE__ */ s(((e) => {
+})), Je = /* @__PURE__ */ s(((e) => {
 	Object.defineProperty(e, "__esModule", { value: !0 }), e.createApi = c;
-	var t = Xe(), n = Qe(), r = $e(), i = et(), a = 17, o = new t.Mutex();
+	var t = He(), n = Ge(), r = Ke(), i = qe(), a = 17, o = new t.Mutex();
 	function s(e) {
 		let t = e !== null && (typeof e == "object" || typeof e == "function") && e.numerator !== null && (typeof e.numerator == "number" || typeof e.numerator == "bigint") && e.denominator !== null && (typeof e.denominator == "number" || typeof e.denominator == "bigint");
 		return t && (0, i.assert)((typeof e.numerator != "number" || Number.isSafeInteger(e.numerator)) && (typeof e.denominator != "number" || Number.isSafeInteger(e.denominator)), "Fraction numerator and denominator must be integers"), t;
@@ -4048,10 +3930,10 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 		function _() {
 			e.global_param_reset_all();
 		}
-		function ee(t) {
+		function v(t) {
 			return e.global_param_get(t);
 		}
-		function v(l, u) {
+		function y(l, u) {
 			let d = e.mk_config();
 			u != null && Object.entries(u).forEach(([t, n]) => g(e.set_param_value(d, t, n.toString())));
 			let f = e.mk_context_rc(d);
@@ -4071,7 +3953,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 			function _(t) {
 				return g(typeof t == "number" ? e.mk_int_symbol(f, t) : e.mk_string_symbol(f, t));
 			}
-			function v(t) {
+			function y(t) {
 				let r = g(e.get_symbol_kind(f, t));
 				switch (r) {
 					case n.Z3_symbol_kind.Z3_INT_SYMBOL: return e.get_symbol_int(f, t);
@@ -4079,18 +3961,18 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					default: (0, i.assertExhaustive)(r);
 				}
 			}
-			function te(t, n) {
+			function ee(t, n) {
 				let r = e.mk_params(f);
 				return e.params_inc_ref(f, r), typeof n == "boolean" ? e.params_set_bool(f, r, _(t), n) : typeof n == "number" ? g(Number.isInteger(n) ? e.params_set_uint(f, r, _(t), n) : e.params_set_double(f, r, _(t), n)) : typeof n == "string" && g(e.params_set_symbol(f, r, _(t), _(n))), r;
 			}
-			function ne(t) {
+			function te(t) {
 				switch (g(e.get_ast_kind(f, t))) {
-					case n.Z3_ast_kind.Z3_SORT_AST: return y(t);
+					case n.Z3_ast_kind.Z3_SORT_AST: return b(t);
 					case n.Z3_ast_kind.Z3_FUNC_DECL_AST: return new B(t);
-					default: return b(t);
+					default: return x(t);
 				}
 			}
-			function y(t) {
+			function b(t) {
 				switch (g(e.get_sort_kind(f, t))) {
 					case n.Z3_sort_kind.Z3_BOOL_SORT: return new sr(t);
 					case n.Z3_sort_kind.Z3_INT_SORT:
@@ -4104,7 +3986,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					default: return e.is_finite_set_sort(f, t) ? new Fr(t) : new z(t);
 				}
 			}
-			function b(t) {
+			function x(t) {
 				let r = g(e.get_ast_kind(f, t));
 				if (r === n.Z3_ast_kind.Z3_QUANTIFIER_AST) return e.is_lambda(f, t) ? new Hr(t) : new Vr(t);
 				switch (g(e.get_sort_kind(f, e.get_sort(f, t)))) {
@@ -4120,39 +4002,39 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					default: return e.is_finite_set_sort(f, e.get_sort(f, t)) ? new Z(t) : new V(t);
 				}
 			}
-			function re(e) {
+			function ne(e) {
 				let t = [];
-				for (let n of e) Je(n) ? t.push(...n.values()) : t.push(n);
+				for (let n of e) Xe(n) ? t.push(...n.values()) : t.push(n);
 				return t;
 			}
-			function ie(e) {
-				return A(e) ? e : new cr(e);
+			function re(e) {
+				return qe(e) ? e : new cr(e);
 			}
-			function ae(e, t) {
+			function ie(e, t) {
 				(0, i.assert)(t.length > 0, "At least one argument expected");
-				let n = ie(t[0]);
-				for (let r = 1; r < t.length; r++) n = new cr(g(e(f, n.ptr, ie(t[r]).ptr)));
+				let n = re(t[0]);
+				for (let r = 1; r < t.length; r++) n = new cr(g(e(f, n.ptr, re(t[r]).ptr)));
 				return n;
 			}
-			function oe() {
+			function ae() {
 				g(e.interrupt(f));
 			}
-			function se(t) {
+			function oe(t) {
 				e.set_ast_print_mode(f, t);
 			}
-			function ce(e) {
+			function se(e) {
 				let t = e instanceof nr;
 				return t && p(e), t;
 			}
-			function le(e) {
+			function ce(e) {
 				let t = e instanceof Qn;
 				return t && p(e), t;
 			}
-			function ue(e) {
+			function le(e) {
 				let t = e instanceof z;
 				return t && p(e), t;
 			}
-			function x(e) {
+			function ue(e) {
 				let t = e instanceof B;
 				return t && p(e), t;
 			}
@@ -4178,182 +4060,182 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 			function T(e, t) {
 				return w(e) && S(e) && e.decl().kind() === t;
 			}
-			function E(e) {
+			function pe(e) {
 				let t = e instanceof V && e.sort.kind() === n.Z3_sort_kind.Z3_BOOL_SORT;
 				return t && p(e), t;
 			}
-			function pe(e) {
+			function me(e) {
 				return T(e, n.Z3_decl_kind.Z3_OP_TRUE);
 			}
-			function me(e) {
+			function he(e) {
 				return T(e, n.Z3_decl_kind.Z3_OP_FALSE);
 			}
-			function he(e) {
+			function ge(e) {
 				return T(e, n.Z3_decl_kind.Z3_OP_AND);
 			}
-			function ge(e) {
+			function _e(e) {
 				return T(e, n.Z3_decl_kind.Z3_OP_OR);
 			}
-			function _e(e) {
+			function ve(e) {
 				return T(e, n.Z3_decl_kind.Z3_OP_IMPLIES);
 			}
-			function ve(e) {
+			function ye(e) {
 				return T(e, n.Z3_decl_kind.Z3_OP_NOT);
 			}
-			function ye(e) {
+			function be(e) {
 				return T(e, n.Z3_decl_kind.Z3_OP_EQ);
 			}
-			function be(e) {
+			function xe(e) {
 				return T(e, n.Z3_decl_kind.Z3_OP_DISTINCT);
 			}
-			function xe(e) {
+			function Se(e) {
 				let t = e instanceof Br;
 				return t && p(e), t;
 			}
-			function D(e) {
+			function E(e) {
 				let t = e instanceof W;
 				return t && p(e), t;
 			}
-			function Se(e) {
+			function Ce(e) {
 				let t = e instanceof hr;
 				return t && p(e), t;
 			}
-			function Ce(e) {
-				return D(e) && Te(e.sort);
-			}
 			function we(e) {
-				let t = e instanceof Cr;
-				return t && p(e), t;
+				return E(e) && Ee(e.sort);
 			}
 			function Te(e) {
-				return ue(e) && e.kind() === n.Z3_sort_kind.Z3_INT_SORT;
+				let t = e instanceof Cr;
+				return t && p(e), t;
 			}
 			function Ee(e) {
-				return D(e) && Oe(e.sort);
+				return le(e) && e.kind() === n.Z3_sort_kind.Z3_INT_SORT;
 			}
 			function De(e) {
-				let t = e instanceof wr;
-				return t && p(e), t;
+				return E(e) && ke(e.sort);
 			}
 			function Oe(e) {
-				return ue(e) && e.kind() === n.Z3_sort_kind.Z3_REAL_SORT;
+				let t = e instanceof wr;
+				return t && p(e), t;
 			}
 			function ke(e) {
+				return le(e) && e.kind() === n.Z3_sort_kind.Z3_REAL_SORT;
+			}
+			function Ae(e) {
 				let t = e instanceof G;
 				return t && p(e), t;
 			}
-			function Ae(e) {
+			function je(e) {
 				let t = e instanceof Tr;
 				return t && p(e), t;
 			}
-			function je(e) {
+			function Me(e) {
 				let t = e instanceof K;
 				return t && p(e), t;
 			}
-			function Me(e) {
+			function Ne(e) {
 				let t = e instanceof Er;
 				return t && p(e), t;
 			}
-			function Ne(e) {
+			function Pe(e) {
 				let t = e instanceof Nr;
 				return t && p(e), t;
 			}
-			function Pe(e) {
+			function Fe(e) {
 				let t = e instanceof Pr;
 				return t && p(e), t;
 			}
-			function Fe(e) {
+			function Ie(e) {
 				return T(e, n.Z3_decl_kind.Z3_OP_CONST_ARRAY);
 			}
-			function Ie(e) {
+			function Le(e) {
 				let t = e instanceof Dr;
 				return t && p(e), t;
 			}
-			function Le(e) {
+			function Re(e) {
 				let t = e instanceof Or;
 				return t && p(e), t;
 			}
-			function Re(e) {
+			function ze(e) {
 				let t = e instanceof kr;
 				return t && p(e), t;
 			}
-			function O(e) {
+			function D(e) {
 				let t = e instanceof q;
 				return t && p(e), t;
 			}
-			function ze(e) {
+			function Be(e) {
 				let t = e instanceof Ar;
 				return t && p(e), t;
 			}
-			function Be(e) {
+			function Ve(e) {
 				let t = e instanceof jr;
 				return t && p(e), t;
 			}
-			function k(e) {
+			function O(e) {
 				let t = e instanceof J;
 				return t && p(e), t;
 			}
-			function Ve(e) {
+			function He(e) {
 				let t = e instanceof Y;
 				return t && p(e), t;
 			}
-			function He(e) {
-				return Be(e) && e.isString();
-			}
 			function Ue(e) {
-				return k(e) && e.isString();
+				return Ve(e) && e.isString();
 			}
 			function We(e) {
+				return O(e) && e.isString();
+			}
+			function Ge(e) {
 				let t = e instanceof Fr;
 				return t && p(e), t;
 			}
-			function Ge(e) {
+			function Ke(e) {
 				let t = e instanceof Z;
 				return t && p(e), t;
 			}
-			function A(e) {
+			function qe(e) {
 				let t = e instanceof cr;
 				return t && p(e), t;
 			}
-			function Ke(e) {
+			function Je(e) {
 				let t = e instanceof U;
 				return t && p(e), t;
 			}
-			function qe(e) {
+			function Ye(e) {
 				let t = e instanceof lr;
 				return t && p(e), t;
 			}
-			function Je(e) {
+			function Xe(e) {
 				let t = e instanceof Q;
 				return t && p(e), t;
 			}
-			function Ye(e, t) {
+			function Ze(e, t) {
 				return e.eqIdentity(t);
 			}
-			function Xe(t) {
+			function Qe(t) {
 				return (0, i.assert)(fe(t), "Z3 bound variable expected"), e.get_index_value(f, t.ast);
 			}
-			function j(e) {
-				if (typeof e == "boolean") return M.val(e);
+			function k(e) {
+				if (typeof e == "boolean") return j.val(e);
 				if (typeof e == "number") {
 					if (!Number.isFinite(e)) throw Error(`cannot represent infinity/NaN (got ${e})`);
-					return Math.floor(e) === e ? N.val(e) : P.val(e);
+					return Math.floor(e) === e ? M.val(e) : N.val(e);
 				}
-				if (s(e)) return P.val(e);
-				if (typeof e == "bigint") return N.val(e);
+				if (s(e)) return N.val(e);
+				if (typeof e == "bigint") return M.val(e);
 				if (w(e)) return e;
 				(0, i.assert)(!1);
 			}
-			async function Ze(...e) {
+			async function $e(...e) {
 				let t = new $.Solver();
 				t.add(...e);
 				let n = await t.check();
 				return n === "sat" ? t.model() : n;
 			}
-			async function Qe(t) {
-				return b(g(await e.simplify(f, t.ast)));
+			async function et(t) {
+				return x(g(await e.simplify(f, t.ast)));
 			}
-			let $e = { declare: (t) => new z(e.mk_uninterpreted_sort(f, _(t))) }, et = {
+			let A = { declare: (t) => new z(e.mk_uninterpreted_sort(f, _(t))) }, tt = {
 				declare: (t, ...n) => {
 					let r = n.length - 1, i = n[r];
 					p(i);
@@ -4368,7 +4250,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					for (let e = 0; e < n; e++) p(t[e]), i.push(t[e].ptr);
 					return new B(e.mk_fresh_func_decl(f, "f", i, r.ptr));
 				}
-			}, tt = {
+			}, nt = {
 				declare: (t, ...n) => {
 					let r = n.length - 1, i = n[r];
 					p(i);
@@ -4379,40 +4261,40 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 				addDefinition: (t, n, r) => {
 					p(t, ...n, r), g(e.add_rec_def(f, t.ptr, n.map((e) => e.ast), r.ast));
 				}
-			}, M = {
+			}, j = {
 				sort: () => new sr(e.mk_bool_sort(f)),
-				const: (t) => new H(e.mk_const(f, _(t), M.sort().ptr)),
-				consts: (e) => (typeof e == "string" && (e = e.split(" ")), e.map((e) => M.const(e))),
+				const: (t) => new H(e.mk_const(f, _(t), j.sort().ptr)),
+				consts: (e) => (typeof e == "string" && (e = e.split(" ")), e.map((e) => j.const(e))),
 				vector: (e, t) => {
 					let n = [];
-					for (let r = 0; r < t; r++) n.push(M.const(`${e}__${r}`));
+					for (let r = 0; r < t; r++) n.push(j.const(`${e}__${r}`));
 					return n;
 				},
-				fresh: (t = "b") => new H(e.mk_fresh_const(f, t, M.sort().ptr)),
+				fresh: (t = "b") => new H(e.mk_fresh_const(f, t, j.sort().ptr)),
 				val: (t) => t ? new H(e.mk_true(f)) : new H(e.mk_false(f))
-			}, N = {
+			}, M = {
 				sort: () => new hr(e.mk_int_sort(f)),
-				const: (t) => new W(e.mk_const(f, _(t), N.sort().ptr)),
-				consts: (e) => (typeof e == "string" && (e = e.split(" ")), e.map((e) => N.const(e))),
+				const: (t) => new W(e.mk_const(f, _(t), M.sort().ptr)),
+				consts: (e) => (typeof e == "string" && (e = e.split(" ")), e.map((e) => M.const(e))),
 				vector: (e, t) => {
 					let n = [];
-					for (let r = 0; r < t; r++) n.push(N.const(`${e}__${r}`));
+					for (let r = 0; r < t; r++) n.push(M.const(`${e}__${r}`));
 					return n;
 				},
-				fresh: (t = "x") => new W(e.mk_fresh_const(f, t, N.sort().ptr)),
-				val: (t) => ((0, i.assert)(typeof t == "bigint" || typeof t == "string" || Number.isSafeInteger(t)), new Cr(g(e.mk_numeral(f, t.toString(), N.sort().ptr))))
-			}, P = {
+				fresh: (t = "x") => new W(e.mk_fresh_const(f, t, M.sort().ptr)),
+				val: (t) => ((0, i.assert)(typeof t == "bigint" || typeof t == "string" || Number.isSafeInteger(t)), new Cr(g(e.mk_numeral(f, t.toString(), M.sort().ptr))))
+			}, N = {
 				sort: () => new hr(e.mk_real_sort(f)),
-				const: (t) => new W(g(e.mk_const(f, _(t), P.sort().ptr))),
-				consts: (e) => (typeof e == "string" && (e = e.split(" ")), e.map((e) => P.const(e))),
+				const: (t) => new W(g(e.mk_const(f, _(t), N.sort().ptr))),
+				consts: (e) => (typeof e == "string" && (e = e.split(" ")), e.map((e) => N.const(e))),
 				vector: (e, t) => {
 					let n = [];
-					for (let r = 0; r < t; r++) n.push(P.const(`${e}__${r}`));
+					for (let r = 0; r < t; r++) n.push(N.const(`${e}__${r}`));
 					return n;
 				},
-				fresh: (t = "b") => new W(e.mk_fresh_const(f, t, P.sort().ptr)),
-				val: (t) => (s(t) && (t = `${t.numerator}/${t.denominator}`), new wr(e.mk_numeral(f, t.toString(), P.sort().ptr)))
-			}, nt = Object.assign((e) => new G(e), {
+				fresh: (t = "b") => new W(e.mk_fresh_const(f, t, N.sort().ptr)),
+				val: (t) => (s(t) && (t = `${t.numerator}/${t.denominator}`), new wr(e.mk_numeral(f, t.toString(), N.sort().ptr)))
+			}, rt = Object.assign((e) => new G(e), {
 				pi: () => new G(g(e.rcf_mk_pi(f))),
 				e: () => new G(g(e.rcf_mk_e(f))),
 				infinitesimal: () => new G(g(e.rcf_mk_infinitesimal(f))),
@@ -4422,20 +4304,20 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					for (let e = 0; e < r; e++) o.push(new G(a[e]));
 					return o;
 				}
-			}), F = {
+			}), P = {
 				sort(t) {
 					return (0, i.assert)(Number.isSafeInteger(t), "number of bits must be an integer"), new Tr(e.mk_bv_sort(f, t));
 				},
 				const(t, n) {
-					return new K(g(e.mk_const(f, _(t), Ae(n) ? n.ptr : F.sort(n).ptr)));
+					return new K(g(e.mk_const(f, _(t), je(n) ? n.ptr : P.sort(n).ptr)));
 				},
 				consts(e, t) {
-					return typeof e == "string" && (e = e.split(" ")), e.map((e) => F.const(e, t));
+					return typeof e == "string" && (e = e.split(" ")), e.map((e) => P.const(e, t));
 				},
 				val(t, n) {
-					return t === !0 ? F.val(1, n) : t === !1 ? F.val(0, n) : new Er(g(e.mk_numeral(f, t.toString(), Ae(n) ? n.ptr : F.sort(n).ptr)));
+					return t === !0 ? P.val(1, n) : t === !1 ? P.val(0, n) : new Er(g(e.mk_numeral(f, t.toString(), je(n) ? n.ptr : P.sort(n).ptr)));
 				}
-			}, I = {
+			}, F = {
 				sort(t, n) {
 					return (0, i.assert)(Number.isSafeInteger(t) && t > 0, "ebits must be a positive integer"), (0, i.assert)(Number.isSafeInteger(n) && n > 0, "sbits must be a positive integer"), new kr(e.mk_fpa_sort(f, t, n));
 				},
@@ -4455,7 +4337,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					return new q(g(e.mk_const(f, _(t), n.ptr)));
 				},
 				consts(e, t) {
-					return typeof e == "string" && (e = e.split(" ")), e.map((e) => I.const(e, t));
+					return typeof e == "string" && (e = e.split(" ")), e.map((e) => F.const(e, t));
 				},
 				val(t, n) {
 					return new Ar(g(e.mk_fpa_numeral_double(f, t, n.ptr)));
@@ -4469,7 +4351,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 				zero(t, n = !1) {
 					return new Ar(g(e.mk_fpa_zero(f, t.ptr, n)));
 				}
-			}, rt = {
+			}, it = {
 				sort() {
 					return new Dr(e.mk_fpa_rounding_mode_sort(f));
 				},
@@ -4488,46 +4370,46 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 				RTZ() {
 					return new Or(g(e.mk_fpa_rtz(f)));
 				}
-			}, L = {
+			}, I = {
 				sort() {
 					return new jr(e.mk_string_sort(f));
 				},
 				const(t) {
-					return new J(g(e.mk_const(f, _(t), L.sort().ptr)));
+					return new J(g(e.mk_const(f, _(t), I.sort().ptr)));
 				},
 				consts(e) {
-					return typeof e == "string" && (e = e.split(" ")), e.map((e) => L.const(e));
+					return typeof e == "string" && (e = e.split(" ")), e.map((e) => I.const(e));
 				},
 				val(t) {
 					return new J(g(e.mk_string(f, t)));
 				},
 				fromCode(t) {
-					let n = D(t) ? t : N.val(t);
+					let n = E(t) ? t : M.val(t);
 					return new J(g(e.mk_string_from_code(f, n.ast)));
 				},
 				fromInt(t) {
-					let n = D(t) ? t : N.val(t);
+					let n = E(t) ? t : M.val(t);
 					return new J(g(e.mk_int_to_str(f, n.ast)));
 				}
-			}, it = {
+			}, at = {
 				sort(t) {
 					return new jr(e.mk_seq_sort(f, t.ptr));
 				},
 				empty(t) {
-					return new J(g(e.mk_seq_empty(f, it.sort(t).ptr)));
+					return new J(g(e.mk_seq_empty(f, at.sort(t).ptr)));
 				},
 				unit(t) {
 					return new J(g(e.mk_seq_unit(f, t.ast)));
 				}
-			}, at = {
+			}, ot = {
 				sort(t) {
 					return new Mr(e.mk_re_sort(f, t.ptr));
 				},
 				toRe(t) {
-					let n = k(t) ? t : L.val(t);
+					let n = O(t) ? t : I.val(t);
 					return new Y(g(e.mk_seq_to_re(f, n.ast)));
 				}
-			}, ot = {
+			}, L = {
 				sort(...t) {
 					let n = t.length - 1, r = t[n], i = t[0];
 					if (n === 1) return new Nr(e.mk_array_sort(f, i.ptr, r.ptr));
@@ -4535,10 +4417,10 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					return new Nr(e.mk_array_sort_n(f, a.map((e) => e.ptr), r.ptr));
 				},
 				const(t, ...n) {
-					return new Pr(g(e.mk_const(f, _(t), ot.sort(...n).ptr)));
+					return new Pr(g(e.mk_const(f, _(t), L.sort(...n).ptr)));
 				},
 				consts(e, ...t) {
-					return typeof e == "string" && (e = e.split(" ")), e.map((e) => ot.const(e, ...t));
+					return typeof e == "string" && (e = e.split(" ")), e.map((e) => L.const(e, ...t));
 				},
 				K(t, n) {
 					return new Pr(g(e.mk_const_array(f, t.ptr, n.ptr)));
@@ -4548,10 +4430,10 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 				}
 			}, st = {
 				sort(e) {
-					return ot.sort(e, M.sort());
+					return L.sort(e, j.sort());
 				},
 				const(t, n) {
-					return new X(g(e.mk_const(f, _(t), ot.sort(n, M.sort()).ptr)));
+					return new X(g(e.mk_const(f, _(t), L.sort(n, j.sort()).ptr)));
 				},
 				consts(e, t) {
 					return typeof e == "string" && (e = e.split(" ")), e.map((e) => st.const(e, t));
@@ -4595,49 +4477,49 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 				return new z(g(e.mk_type_variable(f, e.mk_string_symbol(f, t))));
 			}
 			function dt(t, n, r) {
-				return A(t) && Ke(n) && Ke(r) ? Bt(t, n, r) : ((0, i.assert)(!A(t) && !Ke(n) && !Ke(r), "Mixed expressions and goals"), typeof t == "boolean" && (t = M.val(t)), n = j(n), r = j(r), b(g(e.mk_ite(f, t.ptr, n.ast, r.ast))));
+				return qe(t) && Je(n) && Je(r) ? Bt(t, n, r) : ((0, i.assert)(!qe(t) && !Je(n) && !Je(r), "Mixed expressions and goals"), typeof t == "boolean" && (t = j.val(t)), n = k(n), r = k(r), x(g(e.mk_ite(f, t.ptr, n.ast, r.ast))));
 			}
 			function ft(...t) {
-				return (0, i.assert)(t.length > 0, "Can't make Distinct ouf of nothing"), new H(g(e.mk_distinct(f, t.map((e) => (e = j(e), p(e), e.ast)))));
+				return (0, i.assert)(t.length > 0, "Can't make Distinct ouf of nothing"), new H(g(e.mk_distinct(f, t.map((e) => (e = k(e), p(e), e.ast)))));
 			}
 			function pt(t, n) {
-				return p(n), b(g(e.mk_const(f, _(t), n.ptr)));
+				return p(n), x(g(e.mk_const(f, _(t), n.ptr)));
 			}
 			function mt(e, t) {
 				return p(t), typeof e == "string" && (e = e.split(" ")), e.map((e) => pt(e, t));
 			}
 			function ht(t, n = "c") {
-				return p(t), b(e.mk_fresh_const(t.ctx.ptr, n, t.ptr));
+				return p(t), x(e.mk_fresh_const(t.ctx.ptr, n, t.ptr));
 			}
 			function gt(t, n) {
-				return p(n), b(e.mk_bound(n.ctx.ptr, t, n.ptr));
+				return p(n), x(e.mk_bound(n.ctx.ptr, t, n.ptr));
 			}
 			function _t(t, n) {
-				return t = j(t), n = j(n), p(t, n), new H(g(e.mk_implies(f, t.ptr, n.ptr)));
+				return t = k(t), n = k(n), p(t, n), new H(g(e.mk_implies(f, t.ptr, n.ptr)));
 			}
 			function vt(t, n) {
-				return t = j(t), n = j(n), p(t, n), new H(g(e.mk_iff(f, t.ptr, n.ptr)));
+				return t = k(t), n = k(n), p(t, n), new H(g(e.mk_iff(f, t.ptr, n.ptr)));
 			}
 			function yt(e, t) {
-				return e = j(e), t = j(t), p(e, t), e.eq(t);
+				return e = k(e), t = k(t), p(e, t), e.eq(t);
 			}
 			function bt(t, n) {
-				return t = j(t), n = j(n), p(t, n), new H(g(e.mk_xor(f, t.ptr, n.ptr)));
+				return t = k(t), n = k(n), p(t, n), new H(g(e.mk_xor(f, t.ptr, n.ptr)));
 			}
 			function xt(t) {
-				return typeof t == "boolean" && (t = j(t)), p(t), A(t) ? new cr(g(e.probe_not(f, t.ptr))) : new H(g(e.mk_not(f, t.ptr)));
+				return typeof t == "boolean" && (t = k(t)), p(t), qe(t) ? new cr(g(e.probe_not(f, t.ptr))) : new H(g(e.mk_not(f, t.ptr)));
 			}
 			function St(...t) {
-				if (t.length == 1 && t[0] instanceof $.AstVector && (t = [...t[0].values()], (0, i.assert)((0, i.allSatisfy)(t, E) ?? !0, "AstVector containing not bools")), (0, i.allSatisfy)(t, A) ?? !1) return ae(e.probe_and, t);
+				if (t.length == 1 && t[0] instanceof $.AstVector && (t = [...t[0].values()], (0, i.assert)((0, i.allSatisfy)(t, pe) ?? !0, "AstVector containing not bools")), (0, i.allSatisfy)(t, qe) ?? !1) return ie(e.probe_and, t);
 				{
-					let n = t.map(j);
+					let n = t.map(k);
 					return p(...n), new H(g(e.mk_and(f, n.map((e) => e.ptr))));
 				}
 			}
 			function Ct(...t) {
-				if (t.length == 1 && t[0] instanceof $.AstVector && (t = [...t[0].values()], (0, i.assert)((0, i.allSatisfy)(t, E) ?? !0, "AstVector containing not bools")), (0, i.allSatisfy)(t, A) ?? !1) return ae(e.probe_or, t);
+				if (t.length == 1 && t[0] instanceof $.AstVector && (t = [...t[0].values()], (0, i.assert)((0, i.allSatisfy)(t, pe) ?? !0, "AstVector containing not bools")), (0, i.allSatisfy)(t, qe) ?? !1) return ie(e.probe_or, t);
 				{
-					let n = t.map(j);
+					let n = t.map(k);
 					return p(...n), new H(g(e.mk_or(f, n.map((e) => e.ptr))));
 				}
 			}
@@ -4672,25 +4554,25 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 				return new Hr(g(e.mk_lambda_const(f, t.map((e) => e.ptr), n.ptr)));
 			}
 			function Mt(t) {
-				return t = j(t), p(t), (0, i.assert)(Ce(t), "Int expression expected"), new W(g(e.mk_int2real(f, t.ast)));
+				return t = k(t), p(t), (0, i.assert)(we(t), "Int expression expected"), new W(g(e.mk_int2real(f, t.ast)));
 			}
 			function Nt(t) {
-				return w(t) || (t = P.val(t)), p(t), (0, i.assert)(Ee(t), "Real expression expected"), new W(g(e.mk_real2int(f, t.ast)));
+				return w(t) || (t = N.val(t)), p(t), (0, i.assert)(De(t), "Real expression expected"), new W(g(e.mk_real2int(f, t.ast)));
 			}
 			function Pt(t) {
-				return w(t) || (t = P.val(t)), p(t), (0, i.assert)(Ee(t), "Real expression expected"), new H(g(e.mk_is_int(f, t.ast)));
+				return w(t) || (t = N.val(t)), p(t), (0, i.assert)(De(t), "Real expression expected"), new H(g(e.mk_is_int(f, t.ast)));
 			}
 			function Ft(e) {
-				return w(e) || (e = P.val(e)), e.pow("1/2");
+				return w(e) || (e = N.val(e)), e.pow("1/2");
 			}
 			function It(e) {
-				return w(e) || (e = P.val(e)), e.pow("1/3");
+				return w(e) || (e = N.val(e)), e.pow("1/3");
 			}
 			function Lt(t, n) {
 				return p(t), new W(g(e.mk_bv2int(f, t.ast, n)));
 			}
 			function Rt(t, n) {
-				return D(t) ? (0, i.assert)(Ce(t), "parameter must be an integer") : ((0, i.assert)(typeof t != "number" || Number.isSafeInteger(t), "parameter must not have decimal places"), t = N.val(t)), new K(g(e.mk_int2bv(f, n, t.ast)));
+				return E(t) ? (0, i.assert)(we(t), "parameter must be an integer") : ((0, i.assert)(typeof t != "number" || Number.isSafeInteger(t), "parameter must not have decimal places"), t = M.val(t)), new K(g(e.mk_int2bv(f, n, t.ast)));
 			}
 			function zt(...t) {
 				return p(...t), t.reduce((t, n) => new K(g(e.mk_concat(f, t.ast, n.ast))));
@@ -4806,19 +4688,19 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 			}
 			function fn(t, ...n) {
 				let r = n.map((e, n) => t.domain_n(n).cast(e));
-				if (r.length === 1) return b(g(e.mk_select(f, t.ast, r[0].ast)));
+				if (r.length === 1) return x(g(e.mk_select(f, t.ast, r[0].ast)));
 				let i = r.map((e) => e.ast);
-				return b(g(e.mk_select_n(f, t.ast, i)));
+				return x(g(e.mk_select_n(f, t.ast, i)));
 			}
 			function pn(t, ...n) {
 				let r = n.map((e, r) => r === n.length - 1 ? t.range().cast(e) : t.domain_n(r).cast(e));
 				if (r.length <= 1) throw Error("Array store requires both index and value arguments");
-				if (r.length === 2) return b(g(e.mk_store(f, t.ast, r[0].ast, r[1].ast)));
+				if (r.length === 2) return x(g(e.mk_store(f, t.ast, r[0].ast, r[1].ast)));
 				let i = r.slice(0, r.length - 1).map((e) => e.ast);
-				return b(g(e.mk_store_n(f, t.ast, i, r[r.length - 1].ast)));
+				return x(g(e.mk_store_n(f, t.ast, i, r[r.length - 1].ast)));
 			}
 			function mn(t, n) {
-				return b(g(e.mk_array_ext(f, t.ast, n.ast)));
+				return x(g(e.mk_array_ext(f, t.ast, n.ast)));
 			}
 			function hn(...t) {
 				return new X(g(e.mk_set_union(f, t.map((e) => e.ast))));
@@ -4854,7 +4736,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 				return new H(g(e.mk_set_subset(f, t.ast, n.ast)));
 			}
 			function Tn(t, n) {
-				let r = k(t) ? t : L.val(t);
+				let r = O(t) ? t : I.val(t);
 				return new H(g(e.mk_seq_in_re(f, r.ast, n.ast)));
 			}
 			function En(...t) {
@@ -4885,7 +4767,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 				return new Y(g(e.mk_re_diff(f, t.ast, n.ast)));
 			}
 			function Pn(t, n) {
-				let r = k(t) ? t : L.val(t), i = k(n) ? n : L.val(n);
+				let r = O(t) ? t : I.val(t), i = O(n) ? n : I.val(n);
 				return new Y(g(e.mk_re_range(f, r.ast, i.ast)));
 			}
 			function Fn(t, n, r = 0) {
@@ -4982,7 +4864,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					}, this);
 				}
 				set(t, n) {
-					e.solver_set_params(f, this.ptr, te(t, n));
+					e.solver_set_params(f, this.ptr, ee(t, n));
 				}
 				push() {
 					e.solver_push(f, this.ptr);
@@ -4997,12 +4879,12 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					e.solver_reset(f, this.ptr);
 				}
 				add(...t) {
-					re(t).forEach((t) => {
+					ne(t).forEach((t) => {
 						p(t), g(e.solver_assert(f, this.ptr, t.ast));
 					});
 				}
 				addAndTrack(t, n) {
-					typeof n == "string" && (n = M.const(n)), (0, i.assert)(C(n), "Provided expression that is not a constant to addAndTrack"), g(e.solver_assert_and_track(f, this.ptr, t.ast, n.ast));
+					typeof n == "string" && (n = j.const(n)), (0, i.assert)(C(n), "Provided expression that is not a constant to addAndTrack"), g(e.solver_assert_and_track(f, this.ptr, t.ast, n.ast));
 				}
 				addSimplifier(t) {
 					p(t), g(e.solver_add_simplifier(f, this.ptr, t.ptr));
@@ -5011,7 +4893,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					return new Q(g(e.solver_get_assertions(f, this.ptr)));
 				}
 				async check(...t) {
-					let r = re(t).map((e) => (p(e), e.ast)), a = await o.runExclusive(() => g(e.solver_check_assumptions(f, this.ptr, r)));
+					let r = ne(t).map((e) => (p(e), e.ast)), a = await o.runExclusive(() => g(e.solver_check_assumptions(f, this.ptr, r)));
 					switch (a) {
 						case n.Z3_lbool.Z3_L_FALSE: return "unsat";
 						case n.Z3_lbool.Z3_L_TRUE: return "sat";
@@ -5052,7 +4934,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 				}
 				proof() {
 					let t = e.solver_get_proof(f, this.ptr);
-					return h(), t ? b(t) : null;
+					return h(), t ? x(t) : null;
 				}
 				fromString(t) {
 					e.solver_from_string(f, this.ptr, t), h();
@@ -5076,7 +4958,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 				}
 				async getConsequences(t, r) {
 					let i = new Q(), a = new Q(), s = new Q();
-					re(t).forEach((t) => {
+					ne(t).forEach((t) => {
 						p(t), e.ast_vector_push(f, i.ptr, t.ast);
 					}), r.forEach((t) => {
 						p(t), e.ast_vector_push(f, a.ptr, t.ast);
@@ -5107,13 +4989,13 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					p(t), p(n), e.solver_set_initial_value(f, this.ptr, t.ast, n.ast), h();
 				}
 				congruenceRoot(t) {
-					return p(t), b(g(e.solver_congruence_root(f, this.ptr, t.ast)));
+					return p(t), x(g(e.solver_congruence_root(f, this.ptr, t.ast)));
 				}
 				congruenceNext(t) {
-					return p(t), b(g(e.solver_congruence_next(f, this.ptr, t.ast)));
+					return p(t), x(g(e.solver_congruence_next(f, this.ptr, t.ast)));
 				}
 				congruenceExplain(t, n) {
-					return p(t), p(n), b(g(e.solver_congruence_explain(f, this.ptr, t.ast, n.ast)));
+					return p(t), p(n), x(g(e.solver_congruence_explain(f, this.ptr, t.ast, n.ast)));
 				}
 				fromFile(t) {
 					e.solver_from_file(f, this.ptr, t), h();
@@ -5125,7 +5007,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					if (!t) throw Error("registerOnClause requires the Emscripten module; pass it to createApi");
 					this._onClauseCallbackIdx.value !== null && (t.removeFunction(this._onClauseCallbackIdx.value), this._onClauseCallbackIdx.value = null);
 					let n = t.addFunction((n, r, i, a, o) => {
-						let s = r ? b(r) : null, c = [];
+						let s = r ? x(r) : null, c = [];
 						for (let e = 0; e < i; e++) c.push(t.HEAPU32[(a >> 2) + e]);
 						e(s, c, new Q(o));
 					}, "viiiii");
@@ -5142,7 +5024,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					n = t, this._ptr = n, e.optimize_inc_ref(f, n), c.register(this, () => e.optimize_dec_ref(f, n), this);
 				}
 				set(t, n) {
-					e.optimize_set_params(f, this.ptr, te(t, n));
+					e.optimize_set_params(f, this.ptr, ee(t, n));
 				}
 				push() {
 					e.optimize_push(f, this.ptr);
@@ -5151,7 +5033,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					e.optimize_pop(f, this.ptr);
 				}
 				add(...t) {
-					re(t).forEach((t) => {
+					ne(t).forEach((t) => {
 						p(t), g(e.optimize_assert(f, this.ptr, t.ast));
 					});
 				}
@@ -5159,7 +5041,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					s(n) && (n = `${n.numerator}/${n.denominator}`), g(e.optimize_assert_soft(f, this.ptr, t.ast, n.toString(), _(r)));
 				}
 				addAndTrack(t, n) {
-					typeof n == "string" && (n = M.const(n)), (0, i.assert)(C(n), "Provided expression that is not a constant to addAndTrack"), g(e.optimize_assert_and_track(f, this.ptr, t.ast, n.ast));
+					typeof n == "string" && (n = j.const(n)), (0, i.assert)(C(n), "Provided expression that is not a constant to addAndTrack"), g(e.optimize_assert_and_track(f, this.ptr, t.ast, n.ast));
 				}
 				assertions() {
 					return new Q(g(e.optimize_get_assertions(f, this.ptr)));
@@ -5171,10 +5053,10 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					return g(e.optimize_minimize(f, this.ptr, t.ast));
 				}
 				getLower(t) {
-					return b(g(e.optimize_get_lower(f, this.ptr, t)));
+					return x(g(e.optimize_get_lower(f, this.ptr, t)));
 				}
 				getUpper(t) {
-					return b(g(e.optimize_get_upper(f, this.ptr, t)));
+					return x(g(e.optimize_get_upper(f, this.ptr, t)));
 				}
 				getLowerAsVector(t) {
 					return new Q(g(e.optimize_get_lower_as_vector(f, this.ptr, t)));
@@ -5199,7 +5081,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					return new t.Optimize(n);
 				}
 				async check(...t) {
-					let r = re(t).map((e) => (p(e), e.ast)), a = await o.runExclusive(() => g(e.optimize_check(f, this.ptr, r)));
+					let r = ne(t).map((e) => (p(e), e.ast)), a = await o.runExclusive(() => g(e.optimize_check(f, this.ptr, r)));
 					switch (a) {
 						case n.Z3_lbool.Z3_L_FALSE: return "unsat";
 						case n.Z3_lbool.Z3_L_TRUE: return "sat";
@@ -5236,7 +5118,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					n = t, this._ptr = n, e.fixedpoint_inc_ref(f, n), c.register(this, () => e.fixedpoint_dec_ref(f, n), this);
 				}
 				set(t, n) {
-					e.fixedpoint_set_params(f, this.ptr, te(t, n));
+					e.fixedpoint_set_params(f, this.ptr, ee(t, n));
 				}
 				help() {
 					return g(e.fixedpoint_get_help(f, this.ptr));
@@ -5284,7 +5166,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 				}
 				getAnswer() {
 					let t = g(e.fixedpoint_get_answer(f, this.ptr));
-					return t ? b(t) : null;
+					return t ? x(t) : null;
 				}
 				getReasonUnknown() {
 					return g(e.fixedpoint_get_reason_unknown(f, this.ptr));
@@ -5295,7 +5177,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 				getCoverDelta(t, n) {
 					p(n);
 					let r = g(e.fixedpoint_get_cover_delta(f, this.ptr, t, n.ptr));
-					return r ? b(r) : null;
+					return r ? x(r) : null;
 				}
 				addCover(t, n, r) {
 					p(n), p(r), g(e.fixedpoint_add_cover(f, this.ptr, t, n.ptr, r.ast));
@@ -5365,7 +5247,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					p(t);
 					let i = g(e.model_eval(f, this.ptr, t.ast, n));
 					if (i === null) throw new r.Z3Error("Failed to evaluate expression in the model");
-					return b(i);
+					return x(i);
 				}
 				get(t, n) {
 					if ((0, i.assert)(n === void 0 || typeof t == "number"), typeof t == "number") {
@@ -5380,15 +5262,15 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 						for (let e = t; e < n; e++) i.push(this.get(e));
 						return i;
 					}
-					if (x(t) || w(t) && C(t)) {
+					if (ue(t) || w(t) && C(t)) {
 						let e = this.getInterp(t);
 						return (0, i.assert)(e !== null), e;
 					}
-					if (ue(t)) return this.getUniverse(t);
+					if (le(t)) return this.getUniverse(t);
 					(0, i.assert)(!1, "Number, declaration or constant expected");
 				}
 				updateValue(t, n) {
-					if (p(t), p(n), w(t) && (t = t.decl()), x(t) && t.arity() !== 0 && de(n)) {
+					if (p(t), p(n), w(t) && (t = t.decl()), ue(t) && t.arity() !== 0 && de(n)) {
 						let e = this.addFuncInterp(t, n.elseValue());
 						for (let t = 0; t < n.numEntries(); t++) {
 							let r = n.entry(t), i = r.numArgs(), a = globalThis.Array.from({ length: i }, (e, t) => r.argValue(t));
@@ -5396,8 +5278,8 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 						}
 						return;
 					}
-					if (!x(t) || t.arity() !== 0) throw new r.Z3Error("Expecting 0-ary function or constant expression");
-					if (!le(n)) throw new r.Z3Error("Only func declarations can be assigned to func interpretations");
+					if (!ue(t) || t.arity() !== 0) throw new r.Z3Error("Expecting 0-ary function or constant expression");
+					if (!ce(n)) throw new r.Z3Error("Only func declarations can be assigned to func interpretations");
 					g(e.add_const_interp(f, this.ptr, t.ptr, n.ast));
 				}
 				addFuncInterp(t, n) {
@@ -5405,9 +5287,9 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					return new ar(r);
 				}
 				getInterp(t) {
-					if ((0, i.assert)(x(t) || C(t), "Declaration expected"), C(t) && ((0, i.assert)(w(t)), t = t.decl()), (0, i.assert)(x(t)), t.arity() === 0) {
+					if ((0, i.assert)(ue(t) || C(t), "Declaration expected"), C(t) && ((0, i.assert)(w(t)), t = t.decl()), (0, i.assert)(ue(t)), t.arity() === 0) {
 						let n = g(e.model_get_const_interp(f, this.ptr, t.ptr));
-						return n === null ? null : b(n);
+						return n === null ? null : x(n);
 					}
 					{
 						let n = g(e.model_get_func_interp(f, this.ptr, t.ptr));
@@ -5421,7 +5303,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					return g(e.model_get_num_sorts(f, this.ptr));
 				}
 				getSort(t) {
-					return y(g(e.model_get_sort(f, this.ptr, t)));
+					return b(g(e.model_get_sort(f, this.ptr, t)));
 				}
 				getSorts() {
 					let e = this.numSorts(), t = [];
@@ -5488,10 +5370,10 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					return g(e.func_entry_get_num_args(f, this.ptr));
 				}
 				argValue(t) {
-					return b(g(e.func_entry_get_arg(f, this.ptr, t)));
+					return x(g(e.func_entry_get_arg(f, this.ptr, t)));
 				}
 				value() {
-					return b(g(e.func_entry_get_value(f, this.ptr)));
+					return x(g(e.func_entry_get_value(f, this.ptr)));
 				}
 			}
 			class ar {
@@ -5499,7 +5381,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					this.ptr = t, this.ctx = $, e.func_interp_inc_ref(f, t), c.register(this, () => e.func_interp_dec_ref(f, t), this);
 				}
 				elseValue() {
-					return b(g(e.func_interp_get_else(f, this.ptr)));
+					return x(g(e.func_interp_get_else(f, this.ptr)));
 				}
 				numEntries() {
 					return g(e.func_interp_get_num_entries(f, this.ptr));
@@ -5530,7 +5412,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					return p(e), (0, i.assert)(e.sort.eqIdentity(e.sort), "Sort mismatch"), e;
 				}
 				name() {
-					return v(e.get_sort_name(f, this.ptr));
+					return y(e.get_sort_name(f, this.ptr));
 				}
 				eqIdentity(t) {
 					return p(t), g(e.is_eq_sort(f, this.ptr, t.ptr));
@@ -5544,16 +5426,16 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					return e.func_decl_to_ast(f, this.ptr);
 				}
 				name() {
-					return v(e.get_decl_name(f, this.ptr));
+					return y(e.get_decl_name(f, this.ptr));
 				}
 				arity() {
 					return e.get_arity(f, this.ptr);
 				}
 				domain(t) {
-					return (0, i.assert)(t < this.arity(), "Index out of bounds"), y(e.get_domain(f, this.ptr, t));
+					return (0, i.assert)(t < this.arity(), "Index out of bounds"), b(e.get_domain(f, this.ptr, t));
 				}
 				range() {
-					return y(e.get_range(f, this.ptr));
+					return b(e.get_range(f, this.ptr));
 				}
 				kind() {
 					return e.get_decl_kind(f, this.ptr);
@@ -5573,7 +5455,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 								r.push(g(e.get_decl_rational_parameter(f, this.ptr, a)));
 								break;
 							case n.Z3_parameter_kind.Z3_PARAMETER_SYMBOL:
-								r.push(v(g(e.get_decl_symbol_parameter(f, this.ptr, a))));
+								r.push(y(g(e.get_decl_symbol_parameter(f, this.ptr, a))));
 								break;
 							case n.Z3_parameter_kind.Z3_PARAMETER_SORT:
 								r.push(new z(g(e.get_decl_sort_parameter(f, this.ptr, a))));
@@ -5592,18 +5474,18 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					return r;
 				}
 				call(...t) {
-					return (0, i.assert)(t.length === this.arity(), `Incorrect number of arguments to ${this}`), b(g(e.mk_app(f, this.ptr, t.map((e, t) => this.domain(t).cast(e).ast))));
+					return (0, i.assert)(t.length === this.arity(), `Incorrect number of arguments to ${this}`), x(g(e.mk_app(f, this.ptr, t.map((e, t) => this.domain(t).cast(e).ast))));
 				}
 			}
 			class V extends Qn {
 				get sort() {
-					return y(e.get_sort(f, this.ast));
+					return b(e.get_sort(f, this.ast));
 				}
 				eq(t) {
-					return new H(g(e.mk_eq(f, this.ast, j(t).ast)));
+					return new H(g(e.mk_eq(f, this.ast, k(t).ast)));
 				}
 				neq(t) {
-					return new H(g(e.mk_distinct(f, [this, t].map((e) => j(e).ast))));
+					return new H(g(e.mk_distinct(f, [this, t].map((e) => k(e).ast))));
 				}
 				name() {
 					return this.decl().name();
@@ -5618,7 +5500,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					return (0, i.assert)(S(this), "Z3 applicaiton expected"), g(e.get_app_num_args(f, g(e.to_app(f, this.ast))));
 				}
 				arg(t) {
-					return (0, i.assert)(S(this), "Z3 applicaiton expected"), (0, i.assert)(t < this.numArgs(), `Invalid argument index - expected ${t} to be less than ${this.numArgs()}`), b(g(e.get_app_arg(f, g(e.to_app(f, this.ast)), t)));
+					return (0, i.assert)(S(this), "Z3 applicaiton expected"), (0, i.assert)(t < this.numArgs(), `Invalid argument index - expected ${t} to be less than ${this.numArgs()}`), x(g(e.get_app_arg(f, g(e.to_app(f, this.ast)), t)));
 				}
 				children() {
 					let e = this.numArgs();
@@ -5637,7 +5519,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 			}
 			class sr extends z {
 				cast(e) {
-					return typeof e == "boolean" && (e = M.val(e)), (0, i.assert)(w(e), "true, false or Z3 Boolean expression expected."), (0, i.assert)(this.eqIdentity(e.sort), "Value cannot be converted into a Z3 Boolean value"), e;
+					return typeof e == "boolean" && (e = j.val(e)), (0, i.assert)(w(e), "true, false or Z3 Boolean expression expected."), (0, i.assert)(this.eqIdentity(e.sort), "Value cannot be converted into a Z3 Boolean value"), e;
 				}
 				subsort(e) {
 					return p(e.ctx), e instanceof hr;
@@ -5683,7 +5565,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 				}
 				add(...t) {
 					for (let n of t) {
-						let t = E(n) ? n : M.val(n);
+						let t = pe(n) ? n : j.val(n);
 						p(t), e.goal_assert(f, this.ptr, t.ast);
 					}
 				}
@@ -5723,7 +5605,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 				}
 				asExpr() {
 					let e = this.size();
-					if (e === 0) return M.val(!0);
+					if (e === 0) return j.val(!0);
 					if (e === 1) return this.get(0);
 					{
 						let t = [];
@@ -5769,7 +5651,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 				}
 				async apply(t) {
 					let n;
-					E(t) ? (n = new lr(), n.add(t)) : n = t, p(n);
+					pe(t) ? (n = new lr(), n.add(t)) : n = t, p(n);
 					let r = await e.tactic_apply(f, this.ptr, n.ptr), i = new ur(g(r));
 					return new Proxy(i, dr);
 				}
@@ -5813,7 +5695,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					return e.param_descrs_size(f, this.ptr);
 				}
 				getName(t) {
-					let n = v(e.param_descrs_get_name(f, this.ptr, t));
+					let n = y(e.param_descrs_get_name(f, this.ptr, t));
 					return typeof n == "string" ? n : `${n}`;
 				}
 				getKind(t) {
@@ -5852,17 +5734,17 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 			}
 			class hr extends z {
 				cast(e) {
-					let t = Te(this) ? "IntSort" : "RealSort";
+					let t = Ee(this) ? "IntSort" : "RealSort";
 					if (w(e)) {
 						let n = e.sort;
-						if (D(e)) {
+						if (E(e)) {
 							if (this.eqIdentity(n)) return e;
-							if (Te(n) && Oe(this)) return Mt(e);
+							if (Ee(n) && ke(this)) return Mt(e);
 							(0, i.assert)(!1, "Can't cast Real to IntSort without loss");
-						} else if (E(e)) return Te(this) ? dt(e, 1, 0) : Mt(dt(e, 1, 0));
+						} else if (pe(e)) return Ee(this) ? dt(e, 1, 0) : Mt(dt(e, 1, 0));
 						(0, i.assert)(!1, `Can't cast expression to ${t}`);
 					} else {
-						if (typeof e != "boolean") return Te(this) ? ((0, i.assert)(!s(e), "Can't cast fraction to IntSort"), N.val(e)) : P.val(e);
+						if (typeof e != "boolean") return Ee(this) ? ((0, i.assert)(!s(e), "Can't cast fraction to IntSort"), M.val(e)) : N.val(e);
 						(0, i.assert)(!1, `Can't cast primitive to ${t}`);
 					}
 				}
@@ -5963,7 +5845,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					let { numerator: e, denominator: t } = this.value(), n = e / t;
 					return Number(n) + Number(e - n * t) / Number(t);
 				}
-				asDecimal(t = Number.parseInt(ee("precision") ?? a.toString())) {
+				asDecimal(t = Number.parseInt(v("precision") ?? a.toString())) {
 					return e.get_numeral_decimal_string(f, this.ast, t);
 				}
 				asString() {
@@ -6039,10 +5921,10 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					return e.get_bv_sort_size(f, this.ptr);
 				}
 				subsort(e) {
-					return Ae(e) && this.size() < e.size();
+					return je(e) && this.size() < e.size();
 				}
 				cast(e) {
-					return w(e) ? (p(e), e) : ((0, i.assert)(!s(e), "Can't convert rational to BitVec"), F.val(e, this.size()));
+					return w(e) ? (p(e), e) : ((0, i.assert)(!s(e), "Can't convert rational to BitVec"), P.val(e, this.size()));
 				}
 			}
 			class K extends V {
@@ -6193,7 +6075,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 			}
 			class Dr extends z {
 				cast(e) {
-					if (Le(e)) return p(e), e;
+					if (Re(e)) return p(e), e;
 					throw Error("Can't cast to FPRMSort");
 				}
 			}
@@ -6207,25 +6089,25 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 				}
 				cast(e) {
 					if (w(e)) return p(e), e;
-					if (typeof e == "number") return I.val(e, this);
+					if (typeof e == "number") return F.val(e, this);
 					throw Error("Can't cast to FPSort");
 				}
 			}
 			class q extends V {
 				add(t, n) {
-					let r = O(n) ? n : I.val(n, this.sort);
+					let r = D(n) ? n : F.val(n, this.sort);
 					return new q(g(e.mk_fpa_add(f, t.ast, this.ast, r.ast)));
 				}
 				sub(t, n) {
-					let r = O(n) ? n : I.val(n, this.sort);
+					let r = D(n) ? n : F.val(n, this.sort);
 					return new q(g(e.mk_fpa_sub(f, t.ast, this.ast, r.ast)));
 				}
 				mul(t, n) {
-					let r = O(n) ? n : I.val(n, this.sort);
+					let r = D(n) ? n : F.val(n, this.sort);
 					return new q(g(e.mk_fpa_mul(f, t.ast, this.ast, r.ast)));
 				}
 				div(t, n) {
-					let r = O(n) ? n : I.val(n, this.sort);
+					let r = D(n) ? n : F.val(n, this.sort);
 					return new q(g(e.mk_fpa_div(f, t.ast, this.ast, r.ast)));
 				}
 				neg() {
@@ -6238,27 +6120,27 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					return new q(g(e.mk_fpa_sqrt(f, t.ast, this.ast)));
 				}
 				rem(t) {
-					let n = O(t) ? t : I.val(t, this.sort);
+					let n = D(t) ? t : F.val(t, this.sort);
 					return new q(g(e.mk_fpa_rem(f, this.ast, n.ast)));
 				}
 				fma(t, n, r) {
-					let i = O(n) ? n : I.val(n, this.sort), a = O(r) ? r : I.val(r, this.sort);
+					let i = D(n) ? n : F.val(n, this.sort), a = D(r) ? r : F.val(r, this.sort);
 					return new q(g(e.mk_fpa_fma(f, t.ast, this.ast, i.ast, a.ast)));
 				}
 				lt(t) {
-					let n = O(t) ? t : I.val(t, this.sort);
+					let n = D(t) ? t : F.val(t, this.sort);
 					return new H(g(e.mk_fpa_lt(f, this.ast, n.ast)));
 				}
 				gt(t) {
-					let n = O(t) ? t : I.val(t, this.sort);
+					let n = D(t) ? t : F.val(t, this.sort);
 					return new H(g(e.mk_fpa_gt(f, this.ast, n.ast)));
 				}
 				le(t) {
-					let n = O(t) ? t : I.val(t, this.sort);
+					let n = D(t) ? t : F.val(t, this.sort);
 					return new H(g(e.mk_fpa_leq(f, this.ast, n.ast)));
 				}
 				ge(t) {
-					let n = O(t) ? t : I.val(t, this.sort);
+					let n = D(t) ? t : F.val(t, this.sort);
 					return new H(g(e.mk_fpa_geq(f, this.ast, n.ast)));
 				}
 				isNaN() {
@@ -6299,11 +6181,11 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					return e.is_string_sort(f, this.ptr);
 				}
 				basis() {
-					return y(g(e.get_seq_sort_basis(f, this.ptr)));
+					return b(g(e.get_seq_sort_basis(f, this.ptr)));
 				}
 				cast(e) {
-					if (k(e)) return p(e), e;
-					if (typeof e == "string") return L.val(e);
+					if (O(e)) return p(e), e;
+					if (typeof e == "string") return I.val(e);
 					throw Error("Can't cast to SeqSort");
 				}
 			}
@@ -6316,58 +6198,58 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					return e.get_string(f, this.ast);
 				}
 				concat(t) {
-					let n = k(t) ? t : L.val(t);
+					let n = O(t) ? t : I.val(t);
 					return new J(g(e.mk_seq_concat(f, [this.ast, n.ast])));
 				}
 				length() {
 					return new W(g(e.mk_seq_length(f, this.ast)));
 				}
 				at(t) {
-					let n = D(t) ? t : N.val(t);
+					let n = E(t) ? t : M.val(t);
 					return new J(g(e.mk_seq_at(f, this.ast, n.ast)));
 				}
 				nth(t) {
-					let n = D(t) ? t : N.val(t);
-					return b(g(e.mk_seq_nth(f, this.ast, n.ast)));
+					let n = E(t) ? t : M.val(t);
+					return x(g(e.mk_seq_nth(f, this.ast, n.ast)));
 				}
 				extract(t, n) {
-					let r = D(t) ? t : N.val(t), i = D(n) ? n : N.val(n);
+					let r = E(t) ? t : M.val(t), i = E(n) ? n : M.val(n);
 					return new J(g(e.mk_seq_extract(f, this.ast, r.ast, i.ast)));
 				}
 				indexOf(t, n) {
-					let r = k(t) ? t : L.val(t), i = n === void 0 ? N.val(0) : D(n) ? n : N.val(n);
+					let r = O(t) ? t : I.val(t), i = n === void 0 ? M.val(0) : E(n) ? n : M.val(n);
 					return new W(g(e.mk_seq_index(f, this.ast, r.ast, i.ast)));
 				}
 				lastIndexOf(t) {
-					let n = k(t) ? t : L.val(t);
+					let n = O(t) ? t : I.val(t);
 					return new W(g(e.mk_seq_last_index(f, this.ast, n.ast)));
 				}
 				contains(t) {
-					let n = k(t) ? t : L.val(t);
+					let n = O(t) ? t : I.val(t);
 					return new H(g(e.mk_seq_contains(f, this.ast, n.ast)));
 				}
 				prefixOf(t) {
-					let n = k(t) ? t : L.val(t);
+					let n = O(t) ? t : I.val(t);
 					return new H(g(e.mk_seq_prefix(f, this.ast, n.ast)));
 				}
 				suffixOf(t) {
-					let n = k(t) ? t : L.val(t);
+					let n = O(t) ? t : I.val(t);
 					return new H(g(e.mk_seq_suffix(f, this.ast, n.ast)));
 				}
 				replace(t, n) {
-					let r = k(t) ? t : L.val(t), i = k(n) ? n : L.val(n);
+					let r = O(t) ? t : I.val(t), i = O(n) ? n : I.val(n);
 					return new J(g(e.mk_seq_replace(f, this.ast, r.ast, i.ast)));
 				}
 				replaceAll(t, n) {
-					let r = k(t) ? t : L.val(t), i = k(n) ? n : L.val(n);
+					let r = O(t) ? t : I.val(t), i = O(n) ? n : I.val(n);
 					return new J(g(e.mk_seq_replace_all(f, this.ast, r.ast, i.ast)));
 				}
 				replaceRe(t, n) {
-					let r = k(n) ? n : L.val(n);
+					let r = O(n) ? n : I.val(n);
 					return new J(g(e.mk_seq_replace_re(f, this.ast, t.ast, r.ast)));
 				}
 				replaceReAll(t, n) {
-					let r = k(n) ? n : L.val(n);
+					let r = O(n) ? n : I.val(n);
 					return new J(g(e.mk_seq_replace_re_all(f, this.ast, t.ast, r.ast)));
 				}
 				toInt() {
@@ -6377,34 +6259,34 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					return new W(g(e.mk_string_to_code(f, this.ast)));
 				}
 				lt(t) {
-					let n = k(t) ? t : L.val(t);
+					let n = O(t) ? t : I.val(t);
 					return new H(g(e.mk_str_lt(f, this.ast, n.ast)));
 				}
 				le(t) {
-					let n = k(t) ? t : L.val(t);
+					let n = O(t) ? t : I.val(t);
 					return new H(g(e.mk_str_le(f, this.ast, n.ast)));
 				}
 				map(t) {
 					return new J(g(e.mk_seq_map(f, t.ast, this.ast)));
 				}
 				mapi(t, n) {
-					let r = D(n) ? n : N.val(n);
+					let r = E(n) ? n : M.val(n);
 					return new J(g(e.mk_seq_mapi(f, t.ast, r.ast, this.ast)));
 				}
 				foldl(t, n) {
-					return b(g(e.mk_seq_foldl(f, t.ast, n.ast, this.ast)));
+					return x(g(e.mk_seq_foldl(f, t.ast, n.ast, this.ast)));
 				}
 				foldli(t, n, r) {
-					let i = D(n) ? n : N.val(n);
-					return b(g(e.mk_seq_foldli(f, t.ast, i.ast, r.ast, this.ast)));
+					let i = E(n) ? n : M.val(n);
+					return x(g(e.mk_seq_foldli(f, t.ast, i.ast, r.ast, this.ast)));
 				}
 			}
 			class Mr extends z {
 				basis() {
-					return y(g(e.get_re_sort_basis(f, this.ptr)));
+					return b(g(e.get_re_sort_basis(f, this.ptr)));
 				}
 				cast(e) {
-					if (Ve(e)) return p(e), e;
+					if (He(e)) return p(e), e;
 					throw Error("Can't cast to ReSort");
 				}
 			}
@@ -6442,13 +6324,13 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 			}
 			class Nr extends z {
 				domain() {
-					return y(g(e.get_array_sort_domain(f, this.ptr)));
+					return b(g(e.get_array_sort_domain(f, this.ptr)));
 				}
 				domain_n(t) {
-					return y(g(e.get_array_sort_domain_n(f, this.ptr, t)));
+					return b(g(e.get_array_sort_domain_n(f, this.ptr, t)));
 				}
 				range() {
-					return y(g(e.get_array_sort_range(f, this.ptr)));
+					return b(g(e.get_array_sort_range(f, this.ptr)));
 				}
 			}
 			class Pr extends V {
@@ -6468,7 +6350,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					return pn(this, ...e);
 				}
 				default() {
-					return b(g(e.mk_array_default(f, this.ast)));
+					return x(g(e.mk_array_default(f, this.ast)));
 				}
 			}
 			class X extends V {
@@ -6502,7 +6384,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 			}
 			class Fr extends z {
 				elemSort() {
-					return y(g(e.get_finite_set_sort_basis(f, this.ptr)));
+					return b(g(e.get_finite_set_sort_basis(f, this.ptr)));
 				}
 				cast(e) {
 					return p(e), e;
@@ -6662,19 +6544,19 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					return e.get_quantifier_num_no_patterns(f, this.ast);
 				}
 				no_pattern(t) {
-					return b(g(e.get_quantifier_no_pattern_ast(f, this.ast, t)));
+					return x(g(e.get_quantifier_no_pattern_ast(f, this.ast, t)));
 				}
 				body() {
-					return b(g(e.get_quantifier_body(f, this.ast)));
+					return x(g(e.get_quantifier_body(f, this.ast)));
 				}
 				num_vars() {
 					return e.get_quantifier_num_bound(f, this.ast);
 				}
 				var_name(t) {
-					return v(e.get_quantifier_bound_name(f, this.ast, t));
+					return y(e.get_quantifier_bound_name(f, this.ast, t));
 				}
 				var_sort(t) {
-					return y(g(e.get_quantifier_bound_sort(f, this.ast, t)));
+					return b(g(e.get_quantifier_bound_sort(f, this.ast, t)));
 				}
 				children() {
 					return [this.body()];
@@ -6717,7 +6599,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					return pn(this, ...e);
 				}
 				default() {
-					return b(g(e.mk_array_default(f, this.ast)));
+					return x(g(e.mk_array_default(f, this.ast)));
 				}
 			}
 			class Q {
@@ -6743,10 +6625,10 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 				get(t, n) {
 					let r = this.length();
 					if (t < 0 && (t += r), t >= r) throw RangeError(`expected from index ${t} to be less than length ${r}`);
-					if (n === void 0) return ne(g(e.ast_vector_get(f, this.ptr, t)));
+					if (n === void 0) return te(g(e.ast_vector_get(f, this.ptr, t)));
 					if (n < 0 && (n += r), n >= r) throw RangeError(`expected to index ${n} to be less than length ${r}`);
 					let i = [];
-					for (let r = t; r < n; r++) i.push(ne(g(e.ast_vector_get(f, this.ptr, r))));
+					for (let r = t; r < n; r++) i.push(te(g(e.ast_vector_get(f, this.ptr, r))));
 					return i;
 				}
 				set(t, n) {
@@ -6788,7 +6670,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 					for (let [e, t] of this.entries()) yield t;
 				}
 				get(t) {
-					return ne(g(e.ast_map_find(f, this.ptr, t.ast)));
+					return te(g(e.ast_map_find(f, this.ptr, t.ast)));
 				}
 				set(t, n) {
 					g(e.ast_map_insert(f, this.ptr, t.ast, n.ast));
@@ -6810,22 +6692,22 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 				p(t);
 				let r = [], i = [];
 				for (let [e, t] of n) p(e), p(t), r.push(e.ast), i.push(t.ast);
-				return b(g(e.substitute(f, t.ast, r, i)));
+				return x(g(e.substitute(f, t.ast, r, i)));
 			}
 			function Gr(t, ...n) {
 				p(t);
 				let r = [];
 				for (let e of n) p(e), r.push(e.ast);
-				return b(g(e.substitute_vars(f, t.ast, r)));
+				return x(g(e.substitute_vars(f, t.ast, r)));
 			}
 			function Kr(t, ...n) {
 				p(t);
 				let r = [], i = [];
 				for (let [e, t] of n) p(e), p(t), r.push(e.ptr), i.push(t.ast);
-				return b(g(e.substitute_funs(f, t.ast, r, i)));
+				return x(g(e.substitute_funs(f, t.ast, r, i)));
 			}
 			function qr(t, n, r) {
-				return p(t), p(n), p(r), b(g(e.datatype_update_field(f, n.ptr, t.ast, r.ast)));
+				return p(t), p(n), p(r), x(g(e.datatype_update_field(f, n.ptr, t.ast, r.ast)));
 			}
 			function Jr(t) {
 				let n = new Q(g(e.parse_smtlib2_string(f, t, [], [], [], [])));
@@ -6845,76 +6727,76 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 				Simplifier: mr,
 				AstVector: Q,
 				AstMap: Ur,
-				interrupt: oe,
-				setPrintMode: se,
-				isModel: ce,
-				isAst: le,
-				isSort: ue,
-				isFuncDecl: x,
+				interrupt: ae,
+				setPrintMode: oe,
+				isModel: se,
+				isAst: ce,
+				isSort: le,
+				isFuncDecl: ue,
 				isFuncInterp: de,
 				isApp: S,
 				isConst: C,
 				isExpr: w,
 				isVar: fe,
 				isAppOf: T,
-				isBool: E,
-				isTrue: pe,
-				isFalse: me,
-				isAnd: he,
-				isOr: ge,
-				isImplies: _e,
-				isNot: ve,
-				isEq: ye,
-				isDistinct: be,
-				isQuantifier: xe,
-				isArith: D,
-				isArithSort: Se,
-				isInt: Ce,
-				isIntVal: we,
-				isIntSort: Te,
-				isReal: Ee,
-				isRealVal: De,
-				isRealSort: Oe,
-				isRCFNum: ke,
-				isBitVecSort: Ae,
-				isBitVec: je,
-				isBitVecVal: Me,
-				isFPRMSort: Ie,
-				isFPRM: Le,
-				isFPSort: Re,
-				isFP: O,
-				isFPVal: ze,
-				isSeqSort: Be,
-				isSeq: k,
-				isStringSort: He,
-				isString: Ue,
-				isFiniteSetSort: We,
-				isFiniteSet: Ge,
-				isArraySort: Ne,
-				isArray: Pe,
-				isConstArray: Fe,
-				isProbe: A,
-				isTactic: Ke,
-				isGoal: qe,
-				isAstVector: Je,
-				eqIdentity: Ye,
-				getVarIndex: Xe,
-				from: j,
-				solve: Ze,
-				Sort: $e,
-				Function: et,
-				RecFunc: tt,
-				Bool: M,
-				Int: N,
-				Real: P,
-				RCFNum: nt,
-				BitVec: F,
-				Float: I,
-				FloatRM: rt,
-				String: L,
-				Seq: it,
-				Re: at,
-				Array: ot,
+				isBool: pe,
+				isTrue: me,
+				isFalse: he,
+				isAnd: ge,
+				isOr: _e,
+				isImplies: ve,
+				isNot: ye,
+				isEq: be,
+				isDistinct: xe,
+				isQuantifier: Se,
+				isArith: E,
+				isArithSort: Ce,
+				isInt: we,
+				isIntVal: Te,
+				isIntSort: Ee,
+				isReal: De,
+				isRealVal: Oe,
+				isRealSort: ke,
+				isRCFNum: Ae,
+				isBitVecSort: je,
+				isBitVec: Me,
+				isBitVecVal: Ne,
+				isFPRMSort: Le,
+				isFPRM: Re,
+				isFPSort: ze,
+				isFP: D,
+				isFPVal: Be,
+				isSeqSort: Ve,
+				isSeq: O,
+				isStringSort: Ue,
+				isString: We,
+				isFiniteSetSort: Ge,
+				isFiniteSet: Ke,
+				isArraySort: Pe,
+				isArray: Fe,
+				isConstArray: Ie,
+				isProbe: qe,
+				isTactic: Je,
+				isGoal: Ye,
+				isAstVector: Xe,
+				eqIdentity: Ze,
+				getVarIndex: Qe,
+				from: k,
+				solve: $e,
+				Sort: A,
+				Function: tt,
+				RecFunc: nt,
+				Bool: j,
+				Int: M,
+				Real: N,
+				RCFNum: rt,
+				BitVec: P,
+				Float: F,
+				FloatRM: it,
+				String: I,
+				Seq: at,
+				Re: ot,
+				Array: L,
 				Set: st,
 				FiniteSet: ct,
 				Datatype: lt,
@@ -6987,7 +6869,7 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 				substituteVars: Gr,
 				substituteFuns: Kr,
 				updateField: qr,
-				simplify: Qe,
+				simplify: et,
 				ast_from_string: Jr,
 				SetUnion: hn,
 				SetIntersect: gn,
@@ -7037,13 +6919,13 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 			getFullVersion: p,
 			openLog: m,
 			appendLog: h,
-			getParam: ee,
+			getParam: v,
 			setParam: g,
 			resetParams: _,
-			Context: v
+			Context: y
 		};
 	}
-})), M = /* @__PURE__ */ s(((e) => {
+})), Ye = /* @__PURE__ */ s(((e) => {
 	var t = e && e.__createBinding || (Object.create ? (function(e, t, n, r) {
 		r === void 0 && (r = n);
 		var i = Object.getOwnPropertyDescriptor(t, n);
@@ -7058,8 +6940,8 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 	})), n = e && e.__exportStar || function(e, n) {
 		for (var r in e) r !== "default" && !Object.prototype.hasOwnProperty.call(n, r) && t(n, e, r);
 	};
-	Object.defineProperty(e, "__esModule", { value: !0 }), n(tt(), e), n($e(), e);
-})), N = /* @__PURE__ */ s(((e) => {
+	Object.defineProperty(e, "__esModule", { value: !0 }), n(Je(), e), n(Ke(), e);
+})), Xe = /* @__PURE__ */ s(((e) => {
 	var t = e && e.__createBinding || (Object.create ? (function(e, t, n, r) {
 		r === void 0 && (r = n);
 		var i = Object.getOwnPropertyDescriptor(t, n);
@@ -7075,8 +6957,8 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 		for (var r in e) r !== "default" && !Object.prototype.hasOwnProperty.call(n, r) && t(n, e, r);
 	};
 	Object.defineProperty(e, "__esModule", { value: !0 }), e.init = a;
-	var r = M(), i = Qe();
-	n($e(), e), n(j(), e);
+	var r = Ye(), i = Ge();
+	n(Ke(), e), n(Ue(), e);
 	async function a(e = {}) {
 		let t = globalThis.initZ3;
 		if (t === void 0) throw Error("initZ3 was not imported correctly. Please consult documentation on how to load Z3 in browser");
@@ -7086,113 +6968,98 @@ var ze, Be, k, Ve, He, Ue, We, Ge = o((() => {
 			...a
 		};
 	}
-})), P = null, nt = null, F = null, I = null, rt = /* @__PURE__ */ new Set(), L = /* @__PURE__ */ new Set(), it = /* @__PURE__ */ new Set();
-function at(e) {
-	let t = e?.Semaphore || e?.default?.Semaphore;
-	if (!t || t.__washi_hooked) return;
-	t.__washi_hooked = !0;
-	let n = t.prototype.acquire;
-	t.prototype.acquire = function(...e) {
-		return it.add(this), n.apply(this, e);
-	};
-}
-Promise.resolve().then(() => (w(), ie)).then(at).catch(() => {});
-function ot(e) {
-	for (let e of Array.from(it)) try {
-		if (typeof e.isLocked == "function" && e.isLocked()) {
-			if (typeof e.cancel == "function") try {
-				e.cancel();
-			} catch {}
-			if (typeof e.release == "function") try {
-				e.release();
-			} catch {}
-		}
+})), Ze = null, Qe = null, k = null, $e = null, et = /* @__PURE__ */ new WeakMap();
+function A(e, t) {
+	if (e.error) return;
+	let n = t instanceof Error ? t : /* @__PURE__ */ Error(`[WaSHI] Z3 internal worker error: ${typeof t == "object" && t && "message" in t ? String(t.message) : String(t)}`);
+	e.error = n;
+	for (let t of e.asyncRejects) t(n);
+	e.asyncRejects.clear(), $e === e && rt();
+	try {
+		e.instance?.em?.PThread?.terminateAllThreads();
+	} catch {}
+	e.bootstrapUrl && URL.revokeObjectURL(e.bootstrapUrl);
+	for (let t of Array.from(e.errorHandlers)) try {
+		t(n);
 	} catch {}
+	e.errorHandlers.clear();
 }
-function st(e) {
+function tt(e, t) {
 	if (!e || e.__washi_async_call_hooked) return;
 	e.__washi_async_call_hooked = !0;
-	let t = e.async_call;
-	typeof t == "function" && (e.async_call = function(e, ...n) {
-		let r, i = new Promise((e, t) => {
-			r = t, L.add(t);
+	let n = e.async_call;
+	typeof n == "function" && (e.async_call = function(e, ...r) {
+		if (t.error) return Promise.reject(t.error);
+		let i, a = new Promise((e, n) => {
+			i = n, t.asyncRejects.add(n);
 		});
-		i.catch(() => {});
+		a.catch(() => {});
 		try {
-			let a = t.call(this, e, ...n);
-			return Promise.race([a, i]).finally(() => {
-				L.delete(r);
+			let o = n.call(this, e, ...r);
+			return Promise.race([o, a]).finally(() => {
+				t.asyncRejects.delete(i);
 			});
 		} catch (e) {
-			throw L.delete(r), lt(e), e;
+			throw t.asyncRejects.delete(i), A(t, e), e;
 		}
 	});
 }
-function ct(e) {
-	return rt.add(e), () => {
-		rt.delete(e);
-	};
+function nt(e, t) {
+	let n = t ? et.get(t) : $e;
+	return n ? n.error ? (e(n.error), () => {}) : (n.errorHandlers.add(e), () => {
+		n.errorHandlers.delete(e);
+	}) : () => {};
 }
-function lt(e) {
-	let t = e instanceof Error ? e : /* @__PURE__ */ Error(`[WaSHI] Z3 internal worker error: ${e?.message || (typeof e == "string" ? e : "Worker failed to initialize or execute")}`);
-	for (let e of Array.from(L)) try {
-		e(t);
-	} catch {}
-	if (L.clear(), ot(t), nt?.em?.PThread?.terminateAllThreads) try {
-		nt.em.PThread.terminateAllThreads();
-	} catch {}
-	ft();
-	for (let e of Array.from(rt)) try {
-		e(t);
-	} catch {}
+function j(e) {
+	$e && A($e, e);
 }
-function ut(e) {
+function M(e, t) {
 	if (!e || !e.PThread || e.PThread.__washi_monitored) return;
 	e.PThread.__washi_monitored = !0;
-	let t = (e) => {
+	let n = (e) => {
 		e && (e.onerror = (e) => {
-			lt(e);
+			A(t, e);
 		}, typeof e.addEventListener == "function" && e.addEventListener("error", (e) => {
-			lt(e), typeof e.preventDefault == "function" && e.preventDefault();
+			A(t, e), typeof e.preventDefault == "function" && e.preventDefault();
 		}));
 	};
-	Array.isArray(e.PThread.unusedWorkers) && e.PThread.unusedWorkers.forEach(t), Array.isArray(e.PThread.runningWorkers) && e.PThread.runningWorkers.forEach(t);
-	let n = e.PThread.loadWasmModuleToWorker;
-	typeof n == "function" && (e.PThread.loadWasmModuleToWorker = function(e) {
+	Array.isArray(e.PThread.unusedWorkers) && e.PThread.unusedWorkers.forEach(n), Array.isArray(e.PThread.runningWorkers) && e.PThread.runningWorkers.forEach(n);
+	let r = e.PThread.loadWasmModuleToWorker;
+	typeof r == "function" && (e.PThread.loadWasmModuleToWorker = function(e) {
 		try {
-			let t = n.call(this, e);
+			let n = r.call(this, e);
 			return e.onerror = (e) => {
-				lt(e);
-			}, t;
+				A(t, e);
+			}, n;
 		} catch (e) {
-			throw lt(e), e;
+			throw A(t, e), e;
 		}
 	});
-	let r = e.PThread.allocateUnusedWorker;
-	typeof r == "function" && (e.PThread.allocateUnusedWorker = function() {
+	let i = e.PThread.allocateUnusedWorker;
+	typeof i == "function" && (e.PThread.allocateUnusedWorker = function() {
 		try {
-			r.call(this);
+			i.call(this);
 			let e = this.unusedWorkers?.[this.unusedWorkers.length - 1];
-			e && t(e);
+			e && n(e);
 		} catch (e) {
-			throw lt(e), e;
+			throw A(t, e), e;
 		}
 	});
 }
-function dt(e) {
-	e.jsUrl !== void 0 && (F = e.jsUrl), e.wasmUrl !== void 0 && (I = e.wasmUrl), ft();
+function N(e) {
+	e.jsUrl !== void 0 && (Qe = e.jsUrl), e.wasmUrl !== void 0 && (k = e.wasmUrl), rt();
 }
-function ft() {
-	P = null, nt = null;
+function rt() {
+	Ze = null, $e = null;
 }
-function pt() {
+function P() {
 	if (typeof window > "u") return;
 	let e = window.location.hostname === "localhost" || window.location.hostname === "127.0.0.1" || window.location.hostname === "[::1]";
 	if (!window.isSecureContext && !e) throw Error(`[WaSHI] Z3 solver requires a Secure Context (HTTPS or localhost). Current protocol: "${window.location.protocol}".`);
 	let t = typeof SharedArrayBuffer < "u", n = window.crossOriginIsolated === !0;
 	if (!t || !n) throw Error("[WaSHI] Z3 solver requires SharedArrayBuffer and crossOriginIsolated in browser environments.\nEnsure your server sends the following delivery headers on the document response:\n  Cross-Origin-Opener-Policy: same-origin\n  Cross-Origin-Embedder-Policy: require-corp\n(Note: Standard CORS headers alone are not sufficient, and setting 'useWorker: false' does not remove Z3's internal multithreading requirement.)");
 }
-async function mt(e, t) {
+async function F(e, t) {
 	try {
 		let n = null;
 		try {
@@ -7209,22 +7076,22 @@ async function mt(e, t) {
 		throw Error(`[WaSHI] Failed to load Z3 asset (${t}) from "${e}": ${n.message || String(n)}. Deploy local assets with correct MIME types; no CDN fallback is attempted.`, { cause: n });
 	}
 }
-function ht(e = {}) {
+function it(e = {}) {
 	if (e.z3JsUrl && e.z3WasmUrl) return {
 		jsUrl: e.z3JsUrl,
 		wasmUrl: e.z3WasmUrl
 	};
-	if (F && I) return {
-		jsUrl: e.z3JsUrl || F,
-		wasmUrl: e.z3WasmUrl || I
+	if (Qe && k) return {
+		jsUrl: e.z3JsUrl || Qe,
+		wasmUrl: e.z3WasmUrl || k
 	};
-	let t = re();
+	let t = ie();
 	return {
-		jsUrl: e.z3JsUrl || F || t.jsUrl,
-		wasmUrl: e.z3WasmUrl || I || t.wasmUrl
+		jsUrl: e.z3JsUrl || Qe || t.jsUrl,
+		wasmUrl: e.z3WasmUrl || k || t.wasmUrl
 	};
 }
-async function gt(e) {
+async function I(e) {
 	let t = globalThis;
 	if (t.global === void 0 && (t.global = t), typeof t.initZ3 == "function") return t.initZ3;
 	if (typeof document < "u") await new Promise((n, r) => {
@@ -7256,149 +7123,171 @@ async function gt(e) {
 	if (typeof t.initZ3 != "function") throw Error(`[WaSHI] Script loaded from "${e}" did not define global initZ3.`);
 	return t.initZ3;
 }
-async function _t(e = {}) {
-	if (P) return P;
-	let t = (async () => {
-		pt();
-		let { jsUrl: t, wasmUrl: n } = ht(e);
-		await mt(t, "JavaScript (z3-built.js)"), await mt(n, "WebAssembly (z3-built.wasm)"), await gt(t);
-		let r = t;
-		if (typeof window < "u" && new URL(t).origin !== window.location.origin) {
-			let e = new Blob([`importScripts(${JSON.stringify(t)});`], { type: "application/javascript" });
-			r = URL.createObjectURL(e);
+async function at(e = {}) {
+	if (Ze) return Ze;
+	let t = {
+		instance: null,
+		error: null,
+		errorHandlers: /* @__PURE__ */ new Set(),
+		asyncRejects: /* @__PURE__ */ new Set()
+	};
+	$e = t;
+	async function n(e) {
+		if (t.error) throw t.error;
+		let n = await e();
+		if (t.instance = n, et.set(n, t), t.error) {
+			try {
+				n.em?.PThread?.terminateAllThreads();
+			} catch {}
+			throw t.error;
+		}
+		return n.em && (M(n.em, t), tt(n.em, t)), n;
+	}
+	let r, i = new Promise((e, t) => {
+		r = t;
+	});
+	t.errorHandlers.add(r);
+	let a = (async () => {
+		P();
+		let { jsUrl: r, wasmUrl: i } = it(e);
+		if (await F(r, "JavaScript (z3-built.js)"), await F(i, "WebAssembly (z3-built.wasm)"), await I(r), t.error) throw t.error;
+		let a = r;
+		if (typeof window < "u" && new URL(r).origin !== window.location.origin) {
+			let e = new Blob([`importScripts(${JSON.stringify(r)});`], { type: "application/javascript" });
+			a = URL.createObjectURL(e), t.bootstrapUrl = a;
 		}
-		let i = {
-			locateFile: (e) => e.endsWith(".wasm") ? n : new URL(e, t).href,
-			mainScriptUrlOrBlob: r
+		let o = {
+			locateFile: (e) => e.endsWith(".wasm") ? i : new URL(e, r).href,
+			mainScriptUrlOrBlob: a
 		};
 		try {
-			let e = await Promise.resolve().then(() => /* @__PURE__ */ u(N(), 1));
-			try {
-				at(await Promise.resolve().then(() => (w(), ie)));
-			} catch {}
-			let t, n = await new Promise((n, r) => {
-				t = ct(r), e.init(i).then(n, r);
-			}).finally(() => t?.());
-			return nt = n, n && n.em && (ut(n.em), st(n.em)), n;
+			let e = await Promise.resolve().then(() => /* @__PURE__ */ u(Xe(), 1));
+			return await n(() => e.init(o));
 		} catch (e) {
-			throw ft(), Error(`[WaSHI] Failed to initialize Z3 in browser: ${e?.message || String(e)}`, { cause: e });
+			throw Error(`[WaSHI] Failed to initialize Z3 in browser: ${e?.message || String(e)}`, { cause: e });
 		}
-	})();
-	return t.catch(() => {
-		P === t && ft();
-	}), P = t, t;
+	})(), o = Promise.race([a, i]).finally(() => {
+		t.errorHandlers.delete(r);
+	});
+	return o.catch((e) => A(t, e)), Ze = o, o;
 }
-async function vt(e) {
-	let t = e || nt || (P ? await P.catch(() => null) : null);
-	ot();
-	for (let e of Array.from(L)) try {
-		e(/* @__PURE__ */ Error("[WaSHI] Z3 threads terminated"));
-	} catch {}
-	if (L.clear(), !t || !t.em) {
-		ft();
-		return;
-	}
-	try {
-		let { killThreads: e } = await Promise.resolve().then(() => /* @__PURE__ */ u(N(), 1));
-		typeof e == "function" ? await e(t.em) : t.em?.PThread?.terminateAllThreads && t.em.PThread.terminateAllThreads();
+async function ot(e) {
+	let t = e ? et.get(e) : $e, n = e || t?.instance;
+	if (t && A(t, /* @__PURE__ */ Error("[WaSHI] Z3 threads terminated")), n?.em) try {
+		let { killThreads: e } = await Promise.resolve().then(() => /* @__PURE__ */ u(Xe(), 1));
+		typeof e == "function" ? await e(n.em) : n.em.PThread?.terminateAllThreads();
 	} catch {
-		t.em?.PThread?.terminateAllThreads && t.em.PThread.terminateAllThreads();
-	} finally {
-		ft();
+		n.em.PThread?.terminateAllThreads();
 	}
 }
 //#endregion
 //#region src/modeler/solvers/z3/solver.ts
-var yt = class {
+function L(e, t, n) {
+	Object.defineProperty(e, t, {
+		value: n,
+		enumerable: !0,
+		writable: !0,
+		configurable: !0
+	});
+}
+var st = class {
 	name = "z3";
 	capabilities = {
 		supportsMIP: !0,
 		supportsQP: !1,
 		supportsSMT: !0,
-		supportsUnsatCore: !0
+		supportsUnsatCore: !0,
+		supportsWarmStart: !1
 	};
 	createContextTranslator(e) {
-		let t = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new Map();
-		function r(n) {
-			if (!t.has(n.name)) {
-				let r = n.type === "Continuous" || n.type === "CONTINUOUS" ? e.Real.const(n.name) : e.Int.const(n.name);
-				t.set(n.name, r);
+		let t = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Set();
+		function i(e, t) {
+			let n = e || t, i = n, a = 1;
+			for (; r.has(i);) i = `${n}__${a++}`;
+			return r.add(i), i;
+		}
+		function a(n) {
+			let r = t.get(n);
+			if (!r) {
+				let a = i(n.name, `v_${n.id ?? t.size}`);
+				r = n.type === "Continuous" || n.type === "CONTINUOUS" ? e.Real.const(a) : e.Int.const(a), t.set(n, r);
 			}
-			return t.get(n.name);
+			return r;
 		}
-		function i(t) {
-			if (!n.has(t.name)) {
-				let r = e.Bool.const(t.name);
-				n.set(t.name, r);
+		function o(t) {
+			let r = n.get(t);
+			if (!r) {
+				let a = i(t.name, `b_${t.id ?? n.size}`);
+				r = e.Bool.const(a), n.set(t, r);
 			}
-			return n.get(t.name);
+			return r;
 		}
-		function a(t) {
+		function s(t) {
 			return typeof e.isInt == "function" && e.isInt(t) ? e.ToReal(t) : t;
 		}
-		function o(t, n) {
+		function c(t, n) {
 			let r = typeof e.isInt == "function" && e.isInt(t), i = typeof e.isInt == "function" && e.isInt(n);
-			return r && i ? t.add(n) : a(t).add(a(n));
+			return r && i ? t.add(n) : s(t).add(s(n));
 		}
-		function s(t, n) {
-			return typeof e.isInt == "function" && e.isInt(t) && Number.isInteger(n) ? t.mul(e.Int.val(n)) : a(t).mul(e.Real.val(n));
+		function l(t, n) {
+			return typeof e.isInt == "function" && e.isInt(t) && Number.isInteger(n) ? t.mul(e.Int.val(n)) : s(t).mul(e.Real.val(n));
 		}
-		function c(t, n) {
+		function u(t, n) {
 			let r = typeof e.isInt == "function" && e.isInt(t), i = typeof e.isInt == "function" && e.isInt(n);
-			return r && i ? t.mul(n) : a(t).mul(a(n));
+			return r && i ? t.mul(n) : s(t).mul(s(n));
 		}
-		function l(t, n) {
+		function d(t, n) {
 			return n && Number.isInteger(t) ? e.Int.val(t) : e.Real.val(t);
 		}
-		function u(t, n, r) {
-			let i = typeof e.isInt == "function" && e.isInt(t) && Number.isInteger(r), o = i ? t : a(t), s = i ? e.Int.val(r) : e.Real.val(r);
-			return n === "<=" ? o.le(s) : n === ">=" ? o.ge(s) : o.eq(s);
+		function f(t, n, r) {
+			let i = typeof e.isInt == "function" && e.isInt(t) && Number.isInteger(r), a = i ? t : s(t), o = i ? e.Int.val(r) : e.Real.val(r);
+			return n === "<=" ? a.le(o) : n === ">=" ? a.ge(o) : a.eq(o);
 		}
-		function d(t) {
+		function m(t) {
 			let n = null;
-			if (t && t.terms) for (let [e, i] of t.terms.entries()) {
-				let t = s(r(e), i);
-				n = n === null ? t : o(n, t);
+			if (t && t.terms) for (let [e, r] of t.terms.entries()) {
+				let t = l(a(e), r);
+				n = n === null ? t : c(n, t);
 			}
-			let i = t && typeof t.constant == "number" ? t.constant : 0;
-			if (i !== 0 || n === null) {
-				let t = l(i, n === null || typeof e.isInt == "function" && e.isInt(n));
-				n = n === null ? t : o(n, t);
+			let r = t && typeof t.constant == "number" ? t.constant : 0;
+			if (r !== 0 || n === null) {
+				let t = d(r, n === null || typeof e.isInt == "function" && e.isInt(n));
+				n = n === null ? t : c(n, t);
 			}
 			return n;
 		}
-		function f(t) {
+		function h(t) {
 			let n = null;
-			if (t.linearTerms) for (let [e, i] of t.linearTerms.entries()) {
-				let t = s(r(e), i);
-				n = n === null ? t : o(n, t);
+			if (t.linearTerms) for (let [e, r] of t.linearTerms.entries()) {
+				let t = l(a(e), r);
+				n = n === null ? t : c(n, t);
 			}
 			if (t.quadTerms) for (let e of t.quadTerms.values()) {
-				let t = s(c(r(e.var1), r(e.var2)), e.coeff);
-				n = n === null ? t : o(n, t);
+				let t = l(u(a(e.var1), a(e.var2)), e.coeff);
+				n = n === null ? t : c(n, t);
 			}
-			let i = t && typeof t.constant == "number" ? t.constant : 0;
-			if (i !== 0 || n === null) {
-				let t = l(i, n === null || typeof e.isInt == "function" && e.isInt(n));
-				n = n === null ? t : o(n, t);
+			let r = t && typeof t.constant == "number" ? t.constant : 0;
+			if (r !== 0 || n === null) {
+				let t = d(r, n === null || typeof e.isInt == "function" && e.isInt(n));
+				n = n === null ? t : c(n, t);
 			}
 			return n;
 		}
-		function p(e) {
-			let t = e.lhs instanceof Object && "quadTerms" in e.lhs ? f(e.lhs) : d(e.lhs), n = typeof e.rhs == "number" ? e.rhs : 0;
-			return u(t, e.sense, n);
+		function g(e) {
+			let t = e.lhs instanceof Object && "quadTerms" in e.lhs ? h(e.lhs) : m(e.lhs), n = typeof e.rhs == "number" ? e.rhs : 0;
+			return f(t, e.sense, n);
 		}
-		function g(t) {
-			if (t instanceof m || t && typeof t == "object" && "name" in t && typeof t.id == "number" && !("op" in t) && !("lhs" in t)) return i(t);
-			if (t instanceof _ || t && typeof t == "object" && "lhs" in t && "sense" in t) return p(t);
-			if (t instanceof h || t && typeof t == "object" && "op" in t && Array.isArray(t.children)) {
+		function y(t) {
+			if (t instanceof _ || t && typeof t == "object" && "name" in t && typeof t.id == "number" && !("op" in t) && !("lhs" in t)) return o(t);
+			if (t instanceof p || t && typeof t == "object" && "lhs" in t && "sense" in t) return g(t);
+			if (t instanceof v || t && typeof t == "object" && "op" in t && Array.isArray(t.children)) {
 				let n = t;
 				switch (n.op) {
-					case "and": return e.And(...n.children.map(g));
-					case "or": return e.Or(...n.children.map(g));
-					case "not": return e.Not(g(n.children[0]));
-					case "implies": return e.Implies(g(n.children[0]), g(n.children[1]));
-					case "xor": return e.Xor(g(n.children[0]), g(n.children[1]));
+					case "and": return e.And(...n.children.map(y));
+					case "or": return e.Or(...n.children.map(y));
+					case "not": return e.Not(y(n.children[0]));
+					case "implies": return e.Implies(y(n.children[0]), y(n.children[1]));
+					case "xor": return n.children.length === 0 ? e.Bool.val(!1) : n.children.length === 1 ? y(n.children[0]) : n.children.slice(1).reduce((t, n) => e.Xor(t, y(n)), y(n.children[0]));
 					default: throw Error(`Unsupported boolean operation: ${n.op}`);
 				}
 			}
@@ -7415,60 +7304,85 @@ var yt = class {
 			return Number(t);
 		}
 		return {
-			getVarAst: r,
-			getBoolVarAst: i,
-			compareAstWithNumber: u,
-			translateLinExpr: d,
-			translateQuadExpr: f,
-			translateConstraint: p,
-			translateBoolExpr: g,
+			getVarAst: a,
+			getBoolVarAst: o,
+			compareAstWithNumber: f,
+			translateLinExpr: m,
+			translateQuadExpr: h,
+			translateConstraint: g,
+			translateBoolExpr: y,
 			parseAstValue: ee,
 			varAstMap: t,
 			boolVarAstMap: n
 		};
 	}
-	async check(e, t = {}) {
-		let { Context: n } = await _t(t), r = new n(`check_${Date.now()}_${Math.random().toString(36).substring(2, 7)}`), i = new r.Solver(), a = this.createContextTranslator(r), o = e.variables || e.vars || [], s = e.boolVars || [], c = e.constraints || [], l = e.logicalConstraints || [];
-		for (let e of o) {
-			let t = a.getVarAst(e);
-			e.lb !== -Infinity && i.add(a.compareAstWithNumber(t, ">=", e.lb)), e.ub !== Infinity && i.add(a.compareAstWithNumber(t, "<=", e.ub)), (e.type === "Binary" || e.type === "BINARY") && (i.add(a.compareAstWithNumber(t, ">=", 0)), i.add(a.compareAstWithNumber(t, "<=", 1)));
+	addVariableBounds(e, t, n) {
+		for (let r of t) {
+			let t = n.getVarAst(r);
+			r.lb !== -Infinity && e.add(n.compareAstWithNumber(t, ">=", r.lb)), r.ub !== Infinity && e.add(n.compareAstWithNumber(t, "<=", r.ub)), (r.type === "Binary" || r.type === "BINARY") && (e.add(n.compareAstWithNumber(t, ">=", 0)), e.add(n.compareAstWithNumber(t, "<=", 1)));
 		}
-		for (let e of c) {
-			let t = a.translateConstraint(e), n = r.Bool.const(e.name);
-			i.addAndTrack(t, n);
-		}
-		for (let e = 0; e < l.length; e++) {
-			let t = l[e], n = t && t.name || `lc_${e + 1}`, o = t && t.expr || t, s = a.translateBoolExpr(o), c = r.Bool.const(n);
-			i.addAndTrack(s, c);
-		}
-		let u, d;
+	}
+	async runZ3CheckWithErrorGuard(e, t) {
+		let n;
 		try {
-			let e = i.check();
-			d = await new Promise((t, n) => {
-				u = ct(n), e.then(t, n);
+			let r = e.check();
+			return await new Promise((e, i) => {
+				n = nt(i, t), r.then(e, i);
 			});
 		} finally {
-			u?.();
+			n?.();
 		}
-		let f = d.toString();
-		if (f === "sat") {
-			let e = i.model(), t = {};
-			for (let n of o) {
-				let r = a.getVarAst(n), i = e.eval(r);
-				t[n.name] = a.parseAstValue(i);
-			}
+	}
+	async check(e, t = {}) {
+		if (e?.variables?.some((e) => e.initialValue !== void 0)) throw Error(`Solver "${this.name}" does not support primal initial values (initialValue). Please use a solver with warm-start support such as HiGHS.`);
+		if (t.signal?.aborted) return {
+			status: "Unknown",
+			values: {}
+		};
+		let n = await at(t), { Context: r } = n;
+		if (t.signal?.aborted) return {
+			status: "Unknown",
+			values: {}
+		};
+		let i = new r(`check_${Date.now()}_${Math.random().toString(36).substring(2, 7)}`), a = new i.Solver(), o = this.createContextTranslator(i), s = e.variables || [], c = e.boolVars || [], l = e.constraints || [], u = e.logicalConstraints || [];
+		this.addVariableBounds(a, s, o);
+		let d = new Set(c.map((e) => e.name)), f = /* @__PURE__ */ new Map(), p = 0, m = (e) => {
+			let t = `__washi_track_${++p}`;
+			for (; d.has(t) || f.has(t);) t = `__washi_track_${++p}`;
+			let n = i.Bool.const(t);
+			return f.set(t, e), f.set(n.toString(), e), n;
+		};
+		for (let e of l) a.addAndTrack(o.translateConstraint(e), m(e.name));
+		for (let e = 0; e < u.length; e++) {
+			let t = u[e], n = "name" in t && typeof t.name == "string" ? t.name : `lc_${e + 1}`, r = "expr" in t ? t.expr : t;
+			a.addAndTrack(o.translateBoolExpr(r), m(n));
+		}
+		if (t.signal?.aborted) return {
+			status: "Unknown",
+			values: {}
+		};
+		let h = (await this.runZ3CheckWithErrorGuard(a, n)).toString();
+		if (h === "sat") {
+			let e = a.model(), t = {};
 			for (let n of s) {
-				let r = a.getBoolVarAst(n), i = e.eval(r);
-				t[n.name] = i.toString() === "true";
+				let r = o.getVarAst(n), i = e.eval(r);
+				L(t, n.name, o.parseAstValue(i));
+			}
+			for (let n of c) {
+				let r = o.getBoolVarAst(n), i = e.eval(r);
+				L(t, n.name, i.toString() === "true");
 			}
 			return {
 				status: "Sat",
 				values: t
 			};
 		}
-		if (f === "unsat") {
-			let e = i.unsatCore(), t = [], n = typeof e.length == "function" ? e.length() : e.length;
-			for (let r = 0; r < n; r++) t.push(e.get(r).toString());
+		if (h === "unsat") {
+			let e = a.unsatCore(), t = [], n = typeof e.length == "function" ? e.length() : e.length;
+			for (let r = 0; r < n; r++) {
+				let n = e.get(r).toString();
+				t.push(f.get(n) ?? n);
+			}
 			return {
 				status: "Unsat",
 				values: {},
@@ -7480,71 +7394,184 @@ var yt = class {
 			values: {}
 		};
 	}
-	async solve(e, t, n = {}) {
-		if (!(e.objective !== null && e.objective !== void 0 && ("terms" in e.objective && e.objective.terms.size > 0 || "linearTerms" in e.objective && e.objective.linearTerms.size > 0 || "quadTerms" in e.objective && e.objective.quadTerms.length > 0 || e.objective.offset && e.objective.offset !== 0))) {
-			let t = await this.check(e, n), r = {};
-			for (let [e, n] of Object.entries(t.values)) r[e] = typeof n == "boolean" ? +!!n : n;
+	async solve(e, t, n) {
+		let r = (y(t) ? n : t) ?? {};
+		if (e?.variables?.some((e) => e.initialValue !== void 0)) throw Error(`Solver "${this.name}" does not support primal initial values (initialValue). Please use a solver with warm-start support such as HiGHS.`);
+		if (r.signal?.aborted) return {
+			status: "Unknown",
+			terminationStatus: "Interrupted",
+			hasPrimalSolution: !1,
+			objectiveValue: null,
+			values: {}
+		};
+		let i = performance.now(), a = e.objective;
+		if (!(a != null && ("quadTerms" in a ? a.linearTerms.size > 0 || a.quadTerms.size > 0 : "terms" in a && a.terms.size > 0))) {
+			let t = await this.check(e, r), n = {}, o = {};
+			for (let [e, r] of Object.entries(t.values)) typeof r == "boolean" ? (L(n, e, +!!r), L(o, e, r)) : L(n, e, r);
+			let s = t.status === "Sat", c = s ? a?.constant ?? 0 : null;
+			if (r.onProgress && !r.signal?.aborted) {
+				let e = (performance.now() - i) / 1e3;
+				r.onProgress({
+					elapsedTime: e,
+					elapsedSeconds: e,
+					...typeof c == "number" && Number.isFinite(c) ? { objectiveValue: c } : {}
+				});
+			}
+			if (r.signal?.aborted) return {
+				status: s ? "Feasible" : "Unknown",
+				terminationStatus: "Interrupted",
+				hasPrimalSolution: s,
+				objectiveValue: c,
+				values: s ? n : {},
+				...s && Object.keys(o).length > 0 ? { boolValues: o } : {}
+			};
+			let l = s ? "Optimal" : t.status === "Unsat" ? "Infeasible" : t.status === "Unknown" ? "Unknown" : "Error";
 			return {
-				status: t.status === "Sat" ? "Optimal" : t.status === "Unsat" ? "Infeasible" : "Error",
-				objectiveValue: 0,
-				values: r
+				status: l,
+				terminationStatus: l,
+				hasPrimalSolution: s,
+				objectiveValue: c,
+				values: s ? n : {},
+				...s && Object.keys(o).length > 0 ? { boolValues: o } : {}
 			};
 		}
-		let { Context: r } = await _t(n), i = new r(`opt_${Date.now()}_${Math.random().toString(36).substring(2, 7)}`), a = new i.Optimize(), o = this.createContextTranslator(i), s = e.variables || e.vars || [], c = e.boolVars || [], l = e.constraints || [], u = e.logicalConstraints || [];
-		for (let e of s) {
-			let t = o.getVarAst(e);
-			e.lb !== -Infinity && a.add(o.compareAstWithNumber(t, ">=", e.lb)), e.ub !== Infinity && a.add(o.compareAstWithNumber(t, "<=", e.ub)), (e.type === "Binary" || e.type === "BINARY") && (a.add(o.compareAstWithNumber(t, ">=", 0)), a.add(o.compareAstWithNumber(t, "<=", 1)));
-		}
-		for (let e of l) {
-			let t = o.translateConstraint(e);
-			a.add(t);
-		}
-		for (let e of u) {
-			let t = e && e.expr || e, n = o.translateBoolExpr(t);
-			a.add(n);
+		let o = await at(r), { Context: s } = o;
+		if (r.signal?.aborted) return {
+			status: "Unknown",
+			terminationStatus: "Interrupted",
+			hasPrimalSolution: !1,
+			objectiveValue: null,
+			values: {}
+		};
+		let c = new s(`opt_${Date.now()}_${Math.random().toString(36).substring(2, 7)}`), l = new c.Optimize(), u = this.createContextTranslator(c), d = e.variables || [], f = e.boolVars || [], p = e.constraints || [], m = e.logicalConstraints || [];
+		this.addVariableBounds(l, d, u);
+		for (let e of p) {
+			let t = u.translateConstraint(e);
+			l.add(t);
 		}
-		let d = e.objective instanceof Object && "quadTerms" in e.objective ? o.translateQuadExpr(e.objective) : o.translateLinExpr(e.objective);
-		(e.sense || "MINIMIZE").toUpperCase() === "MAXIMIZE" ? a.maximize(d) : a.minimize(d);
-		let f, p;
-		try {
-			let e = a.check();
-			p = await new Promise((t, n) => {
-				f = ct(n), e.then(t, n);
-			});
-		} finally {
-			f?.();
+		for (let e of m) {
+			let t = "expr" in e ? e.expr : e, n = u.translateBoolExpr(t);
+			l.add(n);
 		}
-		let m = p.toString();
-		if (m === "sat") {
-			let e = a.model(), t = {};
-			for (let n of s) {
-				let r = o.getVarAst(n), i = e.eval(r);
-				t[n.name] = o.parseAstValue(i);
+		let h = "quadTerms" in a ? u.translateQuadExpr(a) : u.translateLinExpr(a), g = (e.sense || "MINIMIZE").toUpperCase(), _ = g === "MAXIMIZE" ? l.maximize(h) : l.minimize(h);
+		if (r.signal?.aborted) return {
+			status: "Unknown",
+			terminationStatus: "Interrupted",
+			hasPrimalSolution: !1,
+			objectiveValue: null,
+			values: {}
+		};
+		let v = (await this.runZ3CheckWithErrorGuard(l, o)).toString();
+		if (v === "sat") {
+			let e = l.model(), t = {}, n = {};
+			for (let n of d) {
+				let r = u.getVarAst(n), i = e.eval(r);
+				L(t, n.name, u.parseAstValue(i));
+			}
+			for (let r of f) {
+				let i = u.getBoolVarAst(r), a = e.eval(i).toString() === "true";
+				L(t, r.name, +!!a), L(n, r.name, a);
+			}
+			let a = u.parseAstValue(e.eval(h)), o = !1, s = !1;
+			try {
+				let e = g === "MAXIMIZE" ? typeof l.getUpper == "function" ? l.getUpper(_) : void 0 : typeof l.getLower == "function" ? l.getLower(_) : void 0, t = e ? e.toString() : "";
+				t.includes("oo") ? o = !0 : t.includes("epsilon") && (s = !0);
+			} catch {}
+			if (o) {
+				if (r.onProgress) {
+					let e = (performance.now() - i) / 1e3;
+					r.onProgress({
+						elapsedTime: e,
+						elapsedSeconds: e,
+						...Number.isFinite(a) ? { objectiveValue: a } : {}
+					});
+				}
+				return {
+					status: "Unbounded",
+					terminationStatus: "Unbounded",
+					hasPrimalSolution: !0,
+					objectiveValue: a,
+					values: t,
+					...Object.keys(n).length > 0 ? { boolValues: n } : {}
+				};
 			}
-			for (let n of c) {
-				let r = o.getBoolVarAst(n), i = e.eval(r);
-				t[n.name] = +(i.toString() === "true");
+			if (s) {
+				if (r.onProgress) {
+					let e = (performance.now() - i) / 1e3;
+					r.onProgress({
+						elapsedTime: e,
+						elapsedSeconds: e
+					});
+				}
+				return {
+					status: "Unknown",
+					terminationStatus: "Unknown",
+					hasPrimalSolution: !1,
+					objectiveValue: null,
+					values: {}
+				};
+			}
+			if (r.onProgress) {
+				let e = (performance.now() - i) / 1e3;
+				r.onProgress({
+					elapsedTime: e,
+					elapsedSeconds: e,
+					...Number.isFinite(a) ? { objectiveValue: a } : {}
+				});
 			}
 			return {
 				status: "Optimal",
-				objectiveValue: o.parseAstValue(e.eval(d)),
-				values: t
+				terminationStatus: "Optimal",
+				hasPrimalSolution: !0,
+				objectiveValue: a,
+				values: t,
+				...Object.keys(n).length > 0 ? { boolValues: n } : {}
 			};
 		}
-		return m === "unsat" ? {
-			status: "Infeasible",
-			objectiveValue: null,
-			values: {}
-		} : {
+		if (v === "unsat") {
+			if (r.onProgress) {
+				let e = (performance.now() - i) / 1e3;
+				r.onProgress({
+					elapsedTime: e,
+					elapsedSeconds: e
+				});
+			}
+			return {
+				status: "Infeasible",
+				terminationStatus: "Infeasible",
+				hasPrimalSolution: !1,
+				objectiveValue: null,
+				values: {}
+			};
+		}
+		if (v === "unknown") {
+			if (r.onProgress) {
+				let e = (performance.now() - i) / 1e3;
+				r.onProgress({
+					elapsedTime: e,
+					elapsedSeconds: e
+				});
+			}
+			return {
+				status: "Unknown",
+				terminationStatus: "Unknown",
+				hasPrimalSolution: !1,
+				objectiveValue: null,
+				values: {}
+			};
+		}
+		return {
 			status: "Error",
+			terminationStatus: "Error",
+			hasPrimalSolution: !1,
 			objectiveValue: null,
 			values: {}
 		};
 	}
 };
-function bt() {
-	ne("z3", () => new yt());
+function ct() {
+	x("z3", () => new st());
 }
-bt();
+ct();
 //#endregion
-export { yt as Z3Solver, gt as ensureInitZ3Loaded, vt as killZ3Threads, _t as loadZ3, lt as notifyZ3WorkerError, mt as probeAssetUrl, ct as registerZ3ErrorHandler, bt as registerZ3Solver, ft as resetZ3LoaderCache, ht as resolveZ3AssetUrls, dt as setZ3Assets, ot as unlockAllZ3Semaphores, pt as validateZ3BrowserEnvironment };
+export { st as Z3Solver, I as ensureInitZ3Loaded, ot as killZ3Threads, at as loadZ3, j as notifyZ3WorkerError, F as probeAssetUrl, nt as registerZ3ErrorHandler, ct as registerZ3Solver, rt as resetZ3LoaderCache, it as resolveZ3AssetUrls, N as setZ3Assets, P as validateZ3BrowserEnvironment };