@stevenvo780/st-lang 4.13.0 → 4.14.0

package/dist/tests/reasoning/model-checking/model-checking.test.js

@@ -0,0 +1,222 @@
+"use strict";
+// ============================================================
+// ST Model Checking — Tests
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const model_checking_1 = require("../../../reasoning/model-checking");
+// ── Helpers de fixtures ──────────────────────────────────────
+/** Cadena lineal 0 → 1 → 2 → ... → n-1 (sin sucesores en n-1). */
+function chainSpace(n) {
+    return {
+        initial: [0],
+        successors: (s) => (s + 1 < n ? [s + 1] : []),
+        labels: (s) => new Set([`s${s}`]),
+        equals: (a, b) => a === b,
+        hash: (s) => `${s}`,
+    };
+}
+/** Contador cíclico mod n: 0 → 1 → ... → n-1 → 0 → ... */
+function cyclicCounterSpace(n) {
+    return {
+        initial: [0],
+        successors: (s) => [(s + 1) % n],
+        labels: (s) => new Set([`s${s}`]),
+        equals: (a, b) => a === b,
+        hash: (s) => `${s}`,
+    };
+}
+/** Doble bucle disjunto: 0 → 1 → 0  y  0 → 2 → 3 → 2 (uno con p, otro sin p). */
+function branchedLoopSpace() {
+    return {
+        initial: [0],
+        successors: (s) => {
+            if (s === 0)
+                return [1, 2];
+            if (s === 1)
+                return [0];
+            if (s === 2)
+                return [3];
+            if (s === 3)
+                return [2];
+            return [];
+        },
+        labels: () => new Set(),
+        equals: (a, b) => a === b,
+        hash: (s) => `${s}`,
+    };
+}
+// ── Reachability ─────────────────────────────────────────────
+(0, vitest_1.describe)('model-checking — reachability', () => {
+    (0, vitest_1.it)('cadena lineal n=10 alcanza 10 estados', () => {
+        const r = (0, model_checking_1.reachableStates)(chainSpace(10));
+        (0, vitest_1.expect)(r.explored).toBe(10);
+        (0, vitest_1.expect)(r.states.length).toBe(10);
+        (0, vitest_1.expect)(r.truncated).toBe(false);
+    });
+    (0, vitest_1.it)('respeta maxStates y marca truncated', () => {
+        const r = (0, model_checking_1.reachableStates)(chainSpace(1000), { maxStates: 50 });
+        (0, vitest_1.expect)(r.explored).toBeLessThanOrEqual(50);
+        (0, vitest_1.expect)(r.truncated).toBe(true);
+    });
+    (0, vitest_1.it)('contador cíclico n=7 alcanza exactamente 7 estados', () => {
+        const r = (0, model_checking_1.reachableStates)(cyclicCounterSpace(7));
+        (0, vitest_1.expect)(r.explored).toBe(7);
+        (0, vitest_1.expect)(r.truncated).toBe(false);
+    });
+});
+// ── Safety / Invariantes ─────────────────────────────────────
+(0, vitest_1.describe)('model-checking — safety', () => {
+    (0, vitest_1.it)('safety holds: cadena n=10, predicado s<10', () => {
+        const r = (0, model_checking_1.checkSafety)(chainSpace(10), (s) => s < 10);
+        (0, vitest_1.expect)(r.safe).toBe(true);
+        (0, vitest_1.expect)(r.trace).toBeUndefined();
+    });
+    (0, vitest_1.it)('safety violation detected con traza completa', () => {
+        const r = (0, model_checking_1.checkSafety)(chainSpace(10), (s) => s < 5);
+        (0, vitest_1.expect)(r.safe).toBe(false);
+        (0, vitest_1.expect)(r.violatingState).toBe(5);
+        (0, vitest_1.expect)(r.trace).toBeDefined();
+        const trace = r.trace;
+        (0, vitest_1.expect)(trace[0]).toBe(0);
+        (0, vitest_1.expect)(trace[trace.length - 1]).toBe(5);
+        // La traza debe ser un camino real: pasos sucesivos +1.
+        for (let i = 1; i < trace.length; i += 1) {
+            (0, vitest_1.expect)(trace[i]).toBe(trace[i - 1] + 1);
+        }
+    });
+    (0, vitest_1.it)('invariant holds en chain cuando es trivialmente verdadero', () => {
+        const r = (0, model_checking_1.checkInvariant)(chainSpace(20), () => true);
+        (0, vitest_1.expect)(r.safe).toBe(true);
+    });
+    (0, vitest_1.it)('safety detecta violación en estado inicial', () => {
+        const r = (0, model_checking_1.checkSafety)(chainSpace(3), (s) => s !== 0);
+        (0, vitest_1.expect)(r.safe).toBe(false);
+        (0, vitest_1.expect)(r.violatingState).toBe(0);
+        (0, vitest_1.expect)(r.trace).toEqual([0]);
+    });
+});
+// ── BMC ──────────────────────────────────────────────────────
+(0, vitest_1.describe)('model-checking — bounded model checking', () => {
+    (0, vitest_1.it)('bmc depth=5 encuentra contraejemplo en chain con p:s<3', () => {
+        const r = (0, model_checking_1.bmc)(chainSpace(100), (s) => s < 3, 5);
+        (0, vitest_1.expect)(r.safe).toBe(false);
+        (0, vitest_1.expect)(r.violatingState).toBe(3);
+        const trace = r.trace;
+        (0, vitest_1.expect)(trace[0]).toBe(0);
+        (0, vitest_1.expect)(trace[trace.length - 1]).toBe(3);
+    });
+    (0, vitest_1.it)('bmc depth=2 NO encuentra contraejemplo más profundo', () => {
+        // El primer s con s>=5 es 5, profundidad 5; con depth=2 no lo ve.
+        const r = (0, model_checking_1.bmc)(chainSpace(100), (s) => s < 5, 2);
+        (0, vitest_1.expect)(r.safe).toBe(true);
+    });
+    (0, vitest_1.it)('bmc depth=0 solo evalúa estados iniciales', () => {
+        const r = (0, model_checking_1.bmc)(chainSpace(10), (s) => s !== 0, 0);
+        (0, vitest_1.expect)(r.safe).toBe(false);
+        (0, vitest_1.expect)(r.violatingState).toBe(0);
+    });
+});
+// ── Liveness: GF p (always eventually) ──────────────────────
+(0, vitest_1.describe)('model-checking — GF p (always eventually)', () => {
+    (0, vitest_1.it)('GF p holds en contador cíclico donde p={s==3}', () => {
+        const r = (0, model_checking_1.checkAlwaysEventually)(cyclicCounterSpace(5), (s) => s === 3);
+        (0, vitest_1.expect)(r.holds).toBe(true);
+    });
+    (0, vitest_1.it)('GF p falla cuando hay SCC accesible sin p', () => {
+        // branchedLoop: SCC {2,3} no contiene p; SCC {0,1} sí contiene p.
+        // GF p exige que toda SCC accesible contenga p.
+        const r = (0, model_checking_1.checkAlwaysEventually)(branchedLoopSpace(), (s) => s === 0 || s === 1);
+        (0, vitest_1.expect)(r.holds).toBe(false);
+        (0, vitest_1.expect)(r.lasso).toBeDefined();
+        const lasso = r.lasso;
+        // El loop debe estar en {2,3}, sin estados con p.
+        for (const s of lasso.loop) {
+            (0, vitest_1.expect)(s === 2 || s === 3).toBe(true);
+        }
+    });
+});
+// ── Liveness: FG p (eventually always) ──────────────────────
+(0, vitest_1.describe)('model-checking — FG p (eventually always)', () => {
+    (0, vitest_1.it)('FG p holds si hay ciclo donde p siempre vale', () => {
+        // En cyclicCounter(5), tomamos p=true en TODOS los estados.
+        const r = (0, model_checking_1.checkEventuallyAlways)(cyclicCounterSpace(5), () => true);
+        (0, vitest_1.expect)(r.holds).toBe(true);
+        (0, vitest_1.expect)(r.lasso).toBeDefined();
+    });
+    (0, vitest_1.it)('FG p NO holds si no hay ciclo enteramente en p', () => {
+        // branchedLoop: p={s==0}; no hay ciclo enteramente en {0} (el ciclo es 0↔1).
+        const r = (0, model_checking_1.checkEventuallyAlways)(branchedLoopSpace(), (s) => s === 0);
+        (0, vitest_1.expect)(r.holds).toBe(false);
+    });
+});
+// ── Deadlock ────────────────────────────────────────────────
+(0, vitest_1.describe)('model-checking — deadlock', () => {
+    (0, vitest_1.it)('chain tiene deadlock en el último estado', () => {
+        const r = (0, model_checking_1.hasDeadlock)(chainSpace(5));
+        (0, vitest_1.expect)(r.deadlocked).toBe(true);
+        (0, vitest_1.expect)(r.state).toBe(4);
+        const trace = r.trace;
+        (0, vitest_1.expect)(trace[0]).toBe(0);
+        (0, vitest_1.expect)(trace[trace.length - 1]).toBe(4);
+    });
+    (0, vitest_1.it)('contador cíclico no tiene deadlock', () => {
+        const r = (0, model_checking_1.hasDeadlock)(cyclicCounterSpace(5));
+        (0, vitest_1.expect)(r.deadlocked).toBe(false);
+    });
+});
+// ── Ejemplos clásicos ───────────────────────────────────────
+(0, vitest_1.describe)('model-checking — mutex Peterson-like', () => {
+    (0, vitest_1.it)('reachable states es finito y razonable', () => {
+        const space = (0, model_checking_1.mutualExclusionSpace)();
+        const r = (0, model_checking_1.reachableStates)(space);
+        (0, vitest_1.expect)(r.explored).toBeGreaterThan(0);
+        (0, vitest_1.expect)(r.truncated).toBe(false);
+    });
+    (0, vitest_1.it)('mutex: NUNCA ambos procesos en critical simultáneamente', () => {
+        const space = (0, model_checking_1.mutualExclusionSpace)();
+        const r = (0, model_checking_1.checkSafety)(space, (s) => !(s.p1 === 'critical' && s.p2 === 'critical'));
+        (0, vitest_1.expect)(r.safe).toBe(true);
+    });
+    (0, vitest_1.it)('mutex: detecta violación con predicado inverso (control)', () => {
+        // Como control, comprobamos que SÍ existe algún estado con p1==critical.
+        // Si invertimos el invariant (p1 nunca critical), debe fallar.
+        const space = (0, model_checking_1.mutualExclusionSpace)();
+        const r = (0, model_checking_1.checkSafety)(space, (s) => s.p1 !== 'critical');
+        (0, vitest_1.expect)(r.safe).toBe(false);
+        (0, vitest_1.expect)(r.violatingState?.p1).toBe('critical');
+    });
+});
+(0, vitest_1.describe)('model-checking — dining philosophers', () => {
+    (0, vitest_1.it)('n=2 alcanza un conjunto finito y no se cuelga', () => {
+        const space = (0, model_checking_1.diningPhilosophersSpace)(2);
+        const r = (0, model_checking_1.reachableStates)(space, { maxStates: 1000 });
+        (0, vitest_1.expect)(r.explored).toBeGreaterThan(0);
+        (0, vitest_1.expect)(r.truncated).toBe(false);
+    });
+    (0, vitest_1.it)('n=2: dos filósofos pueden comer pero no ambos a la vez (comparten ambos tenedores)', () => {
+        // Con n=2: hay solo 2 tenedores. left(0)=0,right(0)=1; left(1)=1,right(1)=0.
+        // Ambos comparten todos los tenedores → no pueden comer simultáneamente.
+        const space = (0, model_checking_1.diningPhilosophersSpace)(2);
+        const r = (0, model_checking_1.checkSafety)(space, (s) => !(s.phils[0] === 'eating' && s.phils[1] === 'eating'));
+        (0, vitest_1.expect)(r.safe).toBe(true);
+    });
+});
+(0, vitest_1.describe)('model-checking — reader-writer', () => {
+    (0, vitest_1.it)('nunca hay readers y writer simultáneamente', () => {
+        const space = (0, model_checking_1.readerWriterSpace)(3);
+        const r = (0, model_checking_1.checkSafety)(space, (s) => !(s.writer && s.readers > 0));
+        (0, vitest_1.expect)(r.safe).toBe(true);
+    });
+    (0, vitest_1.it)('writer no coexiste con otro writer (mutex de escritor)', () => {
+        // El modelo solo tiene un flag writer boolean, así que estructural.
+        const space = (0, model_checking_1.readerWriterSpace)(2);
+        const r = (0, model_checking_1.reachableStates)(space);
+        for (const s of r.states) {
+            // Con writer=true, readers debe ser 0.
+            if (s.writer)
+                (0, vitest_1.expect)(s.readers).toBe(0);
+        }
+    });
+});
+//# sourceMappingURL=model-checking.test.js.map

package/dist/tests/reasoning/model-checking/model-checking.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"model-checking.test.js","sourceRoot":"","sources":["../../../../src/tests/reasoning/model-checking/model-checking.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,4BAA4B;AAC5B,+DAA+D;;AAE/D,mCAA8C;AAC9C,sEAY2C;AAE3C,gEAAgE;AAEhE,kEAAkE;AAClE,SAAS,UAAU,CAAC,CAAS;IAC3B,OAAO;QACL,OAAO,EAAE,CAAC,CAAC,CAAC;QACZ,UAAU,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7C,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,GAAG,CAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACzC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC;QACzB,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE;KACpB,CAAC;AACJ,CAAC;AAED,0DAA0D;AAC1D,SAAS,kBAAkB,CAAC,CAAS;IACnC,OAAO;QACL,OAAO,EAAE,CAAC,CAAC,CAAC;QACZ,UAAU,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAChC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,GAAG,CAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACzC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC;QACzB,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE;KACpB,CAAC;AACJ,CAAC;AAED,iFAAiF;AACjF,SAAS,iBAAiB;IACxB,OAAO;QACL,OAAO,EAAE,CAAC,CAAC,CAAC;QACZ,UAAU,EAAE,CAAC,CAAC,EAAE,EAAE;YAChB,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3B,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,CAAC,CAAC,CAAC,CAAC;YACxB,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,MAAM,EAAE,GAAG,EAAE,CAAC,IAAI,GAAG,EAAU;QAC/B,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC;QACzB,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE;KACpB,CAAC;AACJ,CAAC;AAED,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,+BAA+B,EAAE,GAAG,EAAE;IAC7C,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,CAAC,GAAG,IAAA,gCAAe,EAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1C,IAAA,eAAM,EAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,CAAC,GAAG,IAAA,gCAAe,EAAC,UAAU,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,CAAC,GAAG,IAAA,gCAAe,EAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,yBAAyB,EAAE,GAAG,EAAE;IACvC,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,CAAC,GAAG,IAAA,4BAAW,EAAC,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QACrD,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,aAAa,EAAE,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,CAAC,GAAG,IAAA,4BAAW,EAAC,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACpD,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,CAAC,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,CAAC,CAAC,KAAiB,CAAC;QAClC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxC,wDAAwD;QACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACzC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,MAAM,CAAC,GAAG,IAAA,+BAAc,EAAC,UAAU,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QACrD,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,CAAC,GAAG,IAAA,4BAAW,EAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QACrD,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,CAAC,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,yCAAyC,EAAE,GAAG,EAAE;IACvD,IAAA,WAAE,EAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,MAAM,CAAC,GAAG,IAAA,oBAAG,EAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAChD,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,CAAC,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,KAAK,GAAG,CAAC,CAAC,KAAiB,CAAC;QAClC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,kEAAkE;QAClE,MAAM,CAAC,GAAG,IAAA,oBAAG,EAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAChD,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,CAAC,GAAG,IAAA,oBAAG,EAAC,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,CAAC,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,2CAA2C,EAAE,GAAG,EAAE;IACzD,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,CAAC,GAAG,IAAA,sCAAqB,EAAC,kBAAkB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QACvE,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,kEAAkE;QAClE,gDAAgD;QAChD,MAAM,CAAC,GAAG,IAAA,sCAAqB,EAAC,iBAAiB,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QAChF,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,CAAC,CAAC,KAA2C,CAAC;QAC5D,kDAAkD;QAClD,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC;YAC3B,IAAA,eAAM,EAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxC,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,2CAA2C,EAAE,GAAG,EAAE;IACzD,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,4DAA4D;QAC5D,MAAM,CAAC,GAAG,IAAA,sCAAqB,EAAC,kBAAkB,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QACnE,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,6EAA6E;QAC7E,MAAM,CAAC,GAAG,IAAA,sCAAqB,EAAC,iBAAiB,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QACrE,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,2BAA2B,EAAE,GAAG,EAAE;IACzC,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,CAAC,GAAG,IAAA,4BAAW,EAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,CAAC,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,KAAK,GAAG,CAAC,CAAC,KAAiB,CAAC;QAClC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,CAAC,GAAG,IAAA,4BAAW,EAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,CAAC,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,sCAAsC,EAAE,GAAG,EAAE;IACpD,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,KAAK,GAAG,IAAA,qCAAoB,GAAE,CAAC;QACrC,MAAM,CAAC,GAAG,IAAA,gCAAe,EAAC,KAAK,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,KAAK,GAAG,IAAA,qCAAoB,GAAE,CAAC;QACrC,MAAM,CAAC,GAAG,IAAA,4BAAW,EAAC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,UAAU,IAAI,CAAC,CAAC,EAAE,KAAK,UAAU,CAAC,CAAC,CAAC;QACnF,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,yEAAyE;QACzE,+DAA+D;QAC/D,MAAM,KAAK,GAAG,IAAA,qCAAoB,GAAE,CAAC;QACrC,MAAM,CAAC,GAAG,IAAA,4BAAW,EAAC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,UAAU,CAAC,CAAC;QACzD,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,CAAC,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,sCAAsC,EAAE,GAAG,EAAE;IACpD,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,KAAK,GAAG,IAAA,wCAAuB,EAAC,CAAC,CAAC,CAAC;QACzC,MAAM,CAAC,GAAG,IAAA,gCAAe,EAAC,KAAK,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QACtD,IAAA,eAAM,EAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oFAAoF,EAAE,GAAG,EAAE;QAC5F,6EAA6E;QAC7E,yEAAyE;QACzE,MAAM,KAAK,GAAG,IAAA,wCAAuB,EAAC,CAAC,CAAC,CAAC;QACzC,MAAM,CAAC,GAAG,IAAA,4BAAW,EAAC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC;QAC3F,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,gCAAgC,EAAE,GAAG,EAAE;IAC9C,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,KAAK,GAAG,IAAA,kCAAiB,EAAC,CAAC,CAAC,CAAC;QACnC,MAAM,CAAC,GAAG,IAAA,4BAAW,EAAC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC;QAClE,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,oEAAoE;QACpE,MAAM,KAAK,GAAG,IAAA,kCAAiB,EAAC,CAAC,CAAC,CAAC;QACnC,MAAM,CAAC,GAAG,IAAA,gCAAe,EAAC,KAAK,CAAC,CAAC;QACjC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;YACzB,uCAAuC;YACvC,IAAI,CAAC,CAAC,MAAM;gBAAE,IAAA,eAAM,EAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/reasoning/separation-logic/separation-logic.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=separation-logic.test.d.ts.map

package/dist/tests/reasoning/separation-logic/separation-logic.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"separation-logic.test.d.ts","sourceRoot":"","sources":["../../../../src/tests/reasoning/separation-logic/separation-logic.test.ts"],"names":[],"mappings":""}

package/dist/tests/reasoning/separation-logic/separation-logic.test.js

@@ -0,0 +1,311 @@
+"use strict";
+// ============================================================
+// Separation Logic — Tests
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const separation_logic_1 = require("../../../reasoning/separation-logic");
+(0, vitest_1.describe)('separation-logic — heap basics', () => {
+    (0, vitest_1.it)('newHeap es vacío y heapEquals lo confirma', () => {
+        const h = (0, separation_logic_1.newHeap)();
+        (0, vitest_1.expect)(h.size()).toBe(0);
+        (0, vitest_1.expect)(h.domain()).toEqual([]);
+        (0, vitest_1.expect)((0, separation_logic_1.heapEquals)(h, (0, separation_logic_1.newHeap)())).toBe(true);
+    });
+    (0, vitest_1.it)('fromMap crea heap con las entradas dadas e immutabilidad estructural', () => {
+        const h = (0, separation_logic_1.fromMap)([
+            [1, (0, separation_logic_1.intVal)(42)],
+            [3, (0, separation_logic_1.nullVal)()],
+        ]);
+        (0, vitest_1.expect)(h.size()).toBe(2);
+        (0, vitest_1.expect)(h.domain()).toEqual([1, 3]);
+        const v = h.read(1);
+        (0, vitest_1.expect)(v).toBeDefined();
+        (0, vitest_1.expect)((0, separation_logic_1.valueEquals)(v, (0, separation_logic_1.intVal)(42))).toBe(true);
+    });
+    (0, vitest_1.it)('write/delete devuelven nuevos heaps sin mutar el original', () => {
+        const h0 = (0, separation_logic_1.fromMap)([[1, (0, separation_logic_1.intVal)(1)]]);
+        const h1 = h0.write(2, (0, separation_logic_1.intVal)(2));
+        const h2 = h1.delete(1);
+        (0, vitest_1.expect)(h0.size()).toBe(1);
+        (0, vitest_1.expect)(h1.size()).toBe(2);
+        (0, vitest_1.expect)(h2.size()).toBe(1);
+        (0, vitest_1.expect)(h2.has(1)).toBe(false);
+        (0, vitest_1.expect)(h2.has(2)).toBe(true);
+    });
+    (0, vitest_1.it)('disjoint es simétrico y detecta colisiones', () => {
+        const h1 = (0, separation_logic_1.fromMap)([[1, (0, separation_logic_1.intVal)(1)]]);
+        const h2 = (0, separation_logic_1.fromMap)([[2, (0, separation_logic_1.intVal)(2)]]);
+        const h3 = (0, separation_logic_1.fromMap)([[1, (0, separation_logic_1.intVal)(99)]]);
+        (0, vitest_1.expect)((0, separation_logic_1.disjoint)(h1, h2)).toBe(true);
+        (0, vitest_1.expect)((0, separation_logic_1.disjoint)(h2, h1)).toBe(true);
+        (0, vitest_1.expect)((0, separation_logic_1.disjoint)(h1, h3)).toBe(false);
+    });
+    (0, vitest_1.it)('combine produce unión disjunta y devuelve null si hay colisión', () => {
+        const h1 = (0, separation_logic_1.fromMap)([[1, (0, separation_logic_1.intVal)(1)]]);
+        const h2 = (0, separation_logic_1.fromMap)([[2, (0, separation_logic_1.intVal)(2)]]);
+        const merged = (0, separation_logic_1.combine)(h1, h2);
+        (0, vitest_1.expect)(merged).not.toBeNull();
+        (0, vitest_1.expect)(merged.size()).toBe(2);
+        (0, vitest_1.expect)((0, separation_logic_1.combine)(h1, h1)).toBeNull();
+    });
+});
+(0, vitest_1.describe)('separation-logic — semántica de fórmulas', () => {
+    const val = {};
+    (0, vitest_1.it)('emp es verdadero sólo en heap vacío', () => {
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)((0, separation_logic_1.emp)(), (0, separation_logic_1.newHeap)(), val)).toBe(true);
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)((0, separation_logic_1.emp)(), (0, separation_logic_1.fromMap)([[1, (0, separation_logic_1.intVal)(1)]]), val)).toBe(false);
+    });
+    (0, vitest_1.it)('pointsTo true sólo en heap con exactamente esa celda', () => {
+        const h = (0, separation_logic_1.fromMap)([[5, (0, separation_logic_1.intVal)(7)]]);
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)((0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(5), (0, separation_logic_1.intVal)(7)), h, val)).toBe(true);
+        // Valor distinto
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)((0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(5), (0, separation_logic_1.intVal)(8)), h, val)).toBe(false);
+        // Heap con más de una celda — pointsTo NO es satisfecho (es exacto)
+        const h2 = (0, separation_logic_1.fromMap)([
+            [5, (0, separation_logic_1.intVal)(7)],
+            [6, (0, separation_logic_1.intVal)(7)],
+        ]);
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)((0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(5), (0, separation_logic_1.intVal)(7)), h2, val)).toBe(false);
+        // pointsTo con loc no-addr no tiene sentido
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)((0, separation_logic_1.pointsTo)((0, separation_logic_1.intVal)(5), (0, separation_logic_1.intVal)(7)), h, val)).toBe(false);
+    });
+    (0, vitest_1.it)('star: dos pointsTo disjuntos satisfacen su conjunción separadora', () => {
+        const h = (0, separation_logic_1.fromMap)([
+            [1, (0, separation_logic_1.intVal)(10)],
+            [2, (0, separation_logic_1.intVal)(20)],
+        ]);
+        const f = (0, separation_logic_1.star)((0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.intVal)(10)), (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(2), (0, separation_logic_1.intVal)(20)));
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)(f, h, val)).toBe(true);
+        // Si la fórmula menciona una sola celda y el heap tiene dos, la
+        // conjunción separadora no se satisface salvo con emp
+        const f2 = (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.intVal)(10));
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)(f2, h, val)).toBe(false);
+        // Pero star con emp recupera la equivalencia esperada
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)((0, separation_logic_1.star)(f2, (0, separation_logic_1.emp)()), (0, separation_logic_1.fromMap)([[1, (0, separation_logic_1.intVal)(10)]]), val)).toBe(true);
+    });
+    (0, vitest_1.it)('star: NO se satisface si la misma celda aparece en ambos operandos (no disjoint)', () => {
+        const h = (0, separation_logic_1.fromMap)([[1, (0, separation_logic_1.intVal)(10)]]);
+        const f = (0, separation_logic_1.star)((0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.intVal)(10)), (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.intVal)(10)));
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)(f, h, val)).toBe(false);
+    });
+    (0, vitest_1.it)('and, or, implies, not se comportan clásicamente sobre fórmulas SL', () => {
+        const h = (0, separation_logic_1.fromMap)([[1, (0, separation_logic_1.intVal)(5)]]);
+        const pX = (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.intVal)(5));
+        const pY = (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.intVal)(99));
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)((0, separation_logic_1.andF)(pX, pX), h, val)).toBe(true);
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)((0, separation_logic_1.andF)(pX, pY), h, val)).toBe(false);
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)((0, separation_logic_1.orF)(pX, pY), h, val)).toBe(true);
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)((0, separation_logic_1.notF)(pY), h, val)).toBe(true);
+    });
+    (0, vitest_1.it)('exists/forall sobre dominio finito observable', () => {
+        const h = (0, separation_logic_1.fromMap)([
+            [1, (0, separation_logic_1.intVal)(10)],
+            [2, (0, separation_logic_1.intVal)(10)],
+        ]);
+        // ∃v. (1 ↦ v * 2 ↦ v)  — existe v=10
+        const f = (0, separation_logic_1.existsF)('v', (0, separation_logic_1.star)((0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(1), { kind: 'int', value: 10 }), (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(2), { kind: 'int', value: 10 })));
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)(f, h, val)).toBe(true);
+        // ∀v. emp — falso en heap no vacío
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)((0, separation_logic_1.forallF)('v', (0, separation_logic_1.emp)()), h, val)).toBe(false);
+    });
+    (0, vitest_1.it)('pure: predicado lógico sobre la valuación', () => {
+        const v = { x: (0, separation_logic_1.intVal)(5) };
+        const f = (0, separation_logic_1.pure)('x > 0', (vv) => vv.x?.kind === 'int' && vv.x.value > 0);
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)(f, (0, separation_logic_1.newHeap)(), v)).toBe(true);
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)(f, (0, separation_logic_1.newHeap)(), { x: (0, separation_logic_1.intVal)(-1) })).toBe(false);
+    });
+});
+(0, vitest_1.describe)('separation-logic — splits', () => {
+    (0, vitest_1.it)('un heap de n celdas tiene 2^n particiones', () => {
+        const h = (0, separation_logic_1.fromMap)([
+            [1, (0, separation_logic_1.intVal)(1)],
+            [2, (0, separation_logic_1.intVal)(2)],
+            [3, (0, separation_logic_1.intVal)(3)],
+        ]);
+        (0, vitest_1.expect)((0, separation_logic_1.splits)(h).length).toBe(8);
+        // Cada split es disjoint y se recombina al original
+        for (const { h1, h2 } of (0, separation_logic_1.splits)(h)) {
+            (0, vitest_1.expect)((0, separation_logic_1.disjoint)(h1, h2)).toBe(true);
+            const merged = (0, separation_logic_1.combine)(h1, h2);
+            (0, vitest_1.expect)(merged).not.toBeNull();
+            (0, vitest_1.expect)((0, separation_logic_1.heapEquals)(merged, h)).toBe(true);
+        }
+    });
+});
+(0, vitest_1.describe)('separation-logic — comandos / triplas / frame rule', () => {
+    (0, vitest_1.it)('alloc: {emp} x := cons(v) {x ↦ v}', () => {
+        const triple = {
+            pre: (0, separation_logic_1.emp)(),
+            cmd: separation_logic_1.Cmd.alloc('x', (0, separation_logic_1.intVal)(42)),
+            post: (0, separation_logic_1.existsF)('x', (0, separation_logic_1.pointsTo)({ kind: 'addr', loc: 1 }, (0, separation_logic_1.intVal)(42))),
+        };
+        // Verificar manualmente sobre heap vacío
+        const result = (0, separation_logic_1.checkTriple)({
+            pre: (0, separation_logic_1.emp)(),
+            cmd: triple.cmd,
+            post: (0, separation_logic_1.pointsTo)({ kind: 'addr', loc: 1 }, (0, separation_logic_1.intVal)(42)),
+        }, { candidates: [{ heap: (0, separation_logic_1.newHeap)(), val: {} }], samples: 0 });
+        (0, vitest_1.expect)(result.valid).toBe(true);
+        (0, vitest_1.expect)(result.modelsChecked).toBeGreaterThan(0);
+    });
+    (0, vitest_1.it)('store: {x ↦ -} [x] ← v {x ↦ v}', () => {
+        const candidates = [
+            { heap: (0, separation_logic_1.fromMap)([[1, (0, separation_logic_1.intVal)(0)]]), val: { x: (0, separation_logic_1.addrVal)(1) } },
+            { heap: (0, separation_logic_1.fromMap)([[1, (0, separation_logic_1.intVal)(99)]]), val: { x: (0, separation_logic_1.addrVal)(1) } },
+        ];
+        const triple = {
+            pre: (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.intVal)(0)),
+            cmd: separation_logic_1.Cmd.store('x', (0, separation_logic_1.intVal)(7)),
+            post: (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.intVal)(7)),
+        };
+        const result = (0, separation_logic_1.checkTriple)(triple, { candidates, samples: 0 });
+        (0, vitest_1.expect)(result.valid).toBe(true);
+    });
+    (0, vitest_1.it)('load: {x ↦ v} y := [x] {x ↦ v ∧ y = v}  — se verifica sobre modelo concreto', () => {
+        const heap = (0, separation_logic_1.fromMap)([[3, (0, separation_logic_1.intVal)(11)]]);
+        const val = { x: (0, separation_logic_1.addrVal)(3) };
+        const cmd = separation_logic_1.Cmd.load('y', 'x');
+        // Verificación manual del axioma
+        const result = (0, separation_logic_1.checkTriple)({
+            pre: (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(3), (0, separation_logic_1.intVal)(11)),
+            cmd,
+            post: (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(3), (0, separation_logic_1.intVal)(11)),
+        }, { candidates: [{ heap, val }], samples: 0 });
+        (0, vitest_1.expect)(result.valid).toBe(true);
+    });
+    (0, vitest_1.it)('free: {x ↦ v} free(x) {emp}', () => {
+        const heap = (0, separation_logic_1.fromMap)([[2, (0, separation_logic_1.intVal)(5)]]);
+        const val = { x: (0, separation_logic_1.addrVal)(2) };
+        const result = (0, separation_logic_1.checkTriple)({
+            pre: (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(2), (0, separation_logic_1.intVal)(5)),
+            cmd: separation_logic_1.Cmd.free('x'),
+            post: (0, separation_logic_1.emp)(),
+        }, { candidates: [{ heap, val }], samples: 0 });
+        (0, vitest_1.expect)(result.valid).toBe(true);
+    });
+    (0, vitest_1.it)('frame rule: {P} c {Q} extiende a {P * R} c {Q * R} preservando disjunción', () => {
+        // {1 ↦ 0} store(x, 7) {1 ↦ 7}   donde x = &1
+        const base = {
+            pre: (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.intVal)(0)),
+            cmd: separation_logic_1.Cmd.store('x', (0, separation_logic_1.intVal)(7)),
+            post: (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.intVal)(7)),
+        };
+        const frameFormula = (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(2), (0, separation_logic_1.intVal)(100));
+        const framed = (0, separation_logic_1.frame)(base, frameFormula);
+        (0, vitest_1.expect)(framed.pre.kind).toBe('star');
+        (0, vitest_1.expect)(framed.post.kind).toBe('star');
+        const heap = (0, separation_logic_1.fromMap)([
+            [1, (0, separation_logic_1.intVal)(0)],
+            [2, (0, separation_logic_1.intVal)(100)],
+        ]);
+        const val = { x: (0, separation_logic_1.addrVal)(1) };
+        const result = (0, separation_logic_1.checkTriple)(framed, {
+            candidates: [{ heap, val }],
+            samples: 0,
+        });
+        (0, vitest_1.expect)(result.valid).toBe(true);
+    });
+    (0, vitest_1.it)('checkTriple detecta contraejemplo cuando la postcondición miente', () => {
+        const result = (0, separation_logic_1.checkTriple)({
+            pre: (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.intVal)(0)),
+            cmd: separation_logic_1.Cmd.store('x', (0, separation_logic_1.intVal)(7)),
+            post: (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.intVal)(99)), // mentira: dijo 99
+        }, {
+            candidates: [{ heap: (0, separation_logic_1.fromMap)([[1, (0, separation_logic_1.intVal)(0)]]), val: { x: (0, separation_logic_1.addrVal)(1) } }],
+            samples: 0,
+        });
+        (0, vitest_1.expect)(result.valid).toBe(false);
+        (0, vitest_1.expect)(result.counterexample).toBeDefined();
+    });
+    (0, vitest_1.it)('store sobre celda libre produce memory fault (no es valid en post)', () => {
+        const result = (0, separation_logic_1.checkTriple)({
+            pre: (0, separation_logic_1.emp)(),
+            cmd: separation_logic_1.Cmd.store('x', (0, separation_logic_1.intVal)(7)),
+            post: (0, separation_logic_1.emp)(),
+        }, {
+            candidates: [{ heap: (0, separation_logic_1.newHeap)(), val: { x: (0, separation_logic_1.addrVal)(1) } }],
+            samples: 0,
+        });
+        (0, vitest_1.expect)(result.valid).toBe(false);
+        (0, vitest_1.expect)(result.counterexample?.reason).toMatch(/fault/);
+    });
+});
+(0, vitest_1.describe)('separation-logic — predicados inductivos', () => {
+    (0, vitest_1.it)('isListSegment: ls(x, null) sobre lista de 3 nodos', () => {
+        // 1 → 2 → 3 → null
+        const heap = (0, separation_logic_1.fromMap)([
+            [1, (0, separation_logic_1.addrVal)(2)],
+            [2, (0, separation_logic_1.addrVal)(3)],
+            [3, (0, separation_logic_1.nullVal)()],
+        ]);
+        (0, vitest_1.expect)((0, separation_logic_1.isListSegment)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.nullVal)(), heap)).toBe(true);
+        // ls(x, x) sobre heap vacío
+        (0, vitest_1.expect)((0, separation_logic_1.isListSegment)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.addrVal)(1), (0, separation_logic_1.newHeap)())).toBe(true);
+        // Heap no vacío y start = end → falso (ls requiere emp)
+        (0, vitest_1.expect)((0, separation_logic_1.isListSegment)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.addrVal)(1), heap)).toBe(false);
+        // Ciclo: 1 → 2 → 1
+        const cyclic = (0, separation_logic_1.fromMap)([
+            [1, (0, separation_logic_1.addrVal)(2)],
+            [2, (0, separation_logic_1.addrVal)(1)],
+        ]);
+        (0, vitest_1.expect)((0, separation_logic_1.isListSegment)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.nullVal)(), cyclic)).toBe(false);
+    });
+    (0, vitest_1.it)('listSegment(x, null) bajo satisfiesShape sobre heap de lista', () => {
+        const heap = (0, separation_logic_1.fromMap)([
+            [1, (0, separation_logic_1.addrVal)(2)],
+            [2, (0, separation_logic_1.nullVal)()],
+        ]);
+        const val = { x: (0, separation_logic_1.addrVal)(1) };
+        const f = (0, separation_logic_1.listSegment)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.nullVal)());
+        (0, vitest_1.expect)((0, separation_logic_1.satisfiesShape)(f, heap, val)).toBe(true);
+        // El printer respeta la notación ls(...)
+        (0, vitest_1.expect)((0, separation_logic_1.formulaToString)(f)).toMatch(/ls\(/);
+    });
+    (0, vitest_1.it)('isTree: árbol binario con 3 nodos', () => {
+        //      &1
+        //     /   \
+        //   &10   null
+        //   / \
+        // null null
+        const heap = (0, separation_logic_1.fromMap)([
+            [1, (0, separation_logic_1.addrVal)(10)],
+            [2, (0, separation_logic_1.nullVal)()],
+            [10, (0, separation_logic_1.nullVal)()],
+            [11, (0, separation_logic_1.nullVal)()],
+        ]);
+        (0, vitest_1.expect)((0, separation_logic_1.isTree)((0, separation_logic_1.addrVal)(1), heap)).toBe(true);
+        (0, vitest_1.expect)((0, separation_logic_1.isTree)((0, separation_logic_1.nullVal)(), (0, separation_logic_1.newHeap)())).toBe(true);
+    });
+    (0, vitest_1.it)('tree(...) via satisfiesShape detecta árboles válidos', () => {
+        const heap = (0, separation_logic_1.fromMap)([
+            [1, (0, separation_logic_1.nullVal)()],
+            [2, (0, separation_logic_1.nullVal)()],
+        ]);
+        const f = (0, separation_logic_1.tree)((0, separation_logic_1.addrVal)(1));
+        (0, vitest_1.expect)((0, separation_logic_1.satisfiesShape)(f, heap, {})).toBe(true);
+        (0, vitest_1.expect)((0, separation_logic_1.formulaToString)(f)).toMatch(/tree\(/);
+        // Árbol que comparte nodos no es árbol
+        const cyclic = (0, separation_logic_1.fromMap)([
+            [1, (0, separation_logic_1.addrVal)(1)],
+            [2, (0, separation_logic_1.addrVal)(1)],
+        ]);
+        (0, vitest_1.expect)((0, separation_logic_1.satisfiesShape)(f, cyclic, {})).toBe(false);
+    });
+});
+(0, vitest_1.describe)('separation-logic — magic wand', () => {
+    (0, vitest_1.it)('P -* P es verdadero en heap vacío (frame de uno mismo)', () => {
+        // emp ⊨ (emp -* emp) trivialmente
+        const f = (0, separation_logic_1.magicWand)((0, separation_logic_1.emp)(), (0, separation_logic_1.emp)());
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)(f, (0, separation_logic_1.newHeap)(), {})).toBe(true);
+    });
+    (0, vitest_1.it)('h ⊨ (P -* Q) implica que extender h con P satisface Q', () => {
+        // Heap: 1 ↦ 5
+        // Fórmula: (2 ↦ 7) -* ((1 ↦ 5) * (2 ↦ 7))
+        // Cualquier extensión que cumpla 2 ↦ 7 produce el resultado esperado.
+        const h = (0, separation_logic_1.fromMap)([[1, (0, separation_logic_1.intVal)(5)]]);
+        const f = (0, separation_logic_1.magicWand)((0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(2), (0, separation_logic_1.intVal)(7)), (0, separation_logic_1.star)((0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.intVal)(5)), (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(2), (0, separation_logic_1.intVal)(7))));
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)(f, h, {})).toBe(true);
+    });
+});
+//# sourceMappingURL=separation-logic.test.js.map

package/dist/tests/reasoning/separation-logic/separation-logic.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"separation-logic.test.js","sourceRoot":"","sources":["../../../../src/tests/reasoning/separation-logic/separation-logic.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,2BAA2B;AAC3B,+DAA+D;;AAE/D,mCAA8C;AAC9C,0EAgC6C;AAE7C,IAAA,iBAAQ,EAAC,gCAAgC,EAAE,GAAG,EAAE;IAC9C,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,CAAC,GAAG,IAAA,0BAAO,GAAE,CAAC;QACpB,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,IAAA,6BAAU,EAAC,CAAC,EAAE,IAAA,0BAAO,GAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sEAAsE,EAAE,GAAG,EAAE;QAC9E,MAAM,CAAC,GAAG,IAAA,0BAAO,EAAC;YAChB,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC;YACf,CAAC,CAAC,EAAE,IAAA,0BAAO,GAAE,CAAC;SACf,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACnC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpB,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;QACxB,IAAA,eAAM,EAAC,IAAA,8BAAW,EAAC,CAAE,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,MAAM,EAAE,GAAG,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,EAAE,GAAG,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,EAAE,GAAG,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,EAAE,GAAG,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,IAAA,2BAAQ,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,IAAA,2BAAQ,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,IAAA,2BAAQ,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,MAAM,EAAE,GAAG,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,EAAE,GAAG,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,MAAM,GAAG,IAAA,0BAAO,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC9B,IAAA,eAAM,EAAC,MAAO,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,IAAA,0BAAO,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IACrC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,0CAA0C,EAAE,GAAG,EAAE;IACxD,MAAM,GAAG,GAAgB,EAAE,CAAC;IAE5B,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAA,sBAAG,GAAE,EAAE,IAAA,0BAAO,GAAE,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpD,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAA,sBAAG,GAAE,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACvE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,CAAC,GAAG,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtE,iBAAiB;QACjB,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvE,oEAAoE;QACpE,MAAM,EAAE,GAAG,IAAA,0BAAO,EAAC;YACjB,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;YACd,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;SACf,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxE,4CAA4C;QAC5C,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAA,2BAAQ,EAAC,IAAA,yBAAM,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,MAAM,CAAC,GAAG,IAAA,0BAAO,EAAC;YAChB,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC;YACf,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC;SAChB,CAAC,CAAC;QACH,MAAM,CAAC,GAAG,IAAA,uBAAI,EAAC,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC,EAAE,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACnF,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxC,gEAAgE;QAChE,sDAAsD;QACtD,MAAM,EAAE,GAAG,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1C,sDAAsD;QACtD,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAA,uBAAI,EAAC,EAAE,EAAE,IAAA,sBAAG,GAAE,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjF,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kFAAkF,EAAE,GAAG,EAAE;QAC1F,MAAM,CAAC,GAAG,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,CAAC,GAAG,IAAA,uBAAI,EAAC,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC,EAAE,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACnF,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mEAAmE,EAAE,GAAG,EAAE;QAC3E,MAAM,CAAC,GAAG,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,EAAE,GAAG,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAA,uBAAI,EAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAA,uBAAI,EAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpD,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAA,sBAAG,EAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClD,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAA,uBAAI,EAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,CAAC,GAAG,IAAA,0BAAO,EAAC;YAChB,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC;YACf,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC;SAChB,CAAC,CAAC;QACH,qCAAqC;QACrC,MAAM,CAAC,GAAG,IAAA,0BAAO,EACf,GAAG,EACH,IAAA,uBAAI,EACF,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,EAChD,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CACjD,CACF,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAExC,mCAAmC;QACnC,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAA,0BAAO,EAAC,GAAG,EAAE,IAAA,sBAAG,GAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,CAAC,GAAgB,EAAE,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,IAAA,uBAAI,EAAC,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACxE,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,CAAC,EAAE,IAAA,0BAAO,GAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,CAAC,EAAE,IAAA,0BAAO,GAAE,EAAE,EAAE,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,2BAA2B,EAAE,GAAG,EAAE;IACzC,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,CAAC,GAAG,IAAA,0BAAO,EAAC;YAChB,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;YACd,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;YACd,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;SACf,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,oDAAoD;QACpD,KAAK,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,IAAA,yBAAM,EAAC,CAAC,CAAC,EAAE,CAAC;YACnC,IAAA,eAAM,EAAC,IAAA,2BAAQ,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpC,MAAM,MAAM,GAAG,IAAA,0BAAO,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC/B,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;YAC9B,IAAA,eAAM,EAAC,IAAA,6BAAU,EAAC,MAAO,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,oDAAoD,EAAE,GAAG,EAAE;IAClE,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,MAAM,GAAG;YACb,GAAG,EAAE,IAAA,sBAAG,GAAE;YACV,GAAG,EAAE,sBAAG,CAAC,KAAK,CAAC,GAAG,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC;YAC/B,IAAI,EAAE,IAAA,0BAAO,EAAC,GAAG,EAAE,IAAA,2BAAQ,EAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC,CAAC;SACnE,CAAC;QACF,yCAAyC;QACzC,MAAM,MAAM,GAAG,IAAA,8BAAW,EACxB;YACE,GAAG,EAAE,IAAA,sBAAG,GAAE;YACV,GAAG,EAAE,MAAM,CAAC,GAAG;YACf,IAAI,EAAE,IAAA,2BAAQ,EAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC;SACrD,EACD,EAAE,UAAU,EAAE,CAAC,EAAE,IAAI,EAAE,IAAA,0BAAO,GAAE,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAC3D,CAAC;QACF,IAAA,eAAM,EAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,MAAM,CAAC,aAAa,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,UAAU,GAAG;YACjB,EAAE,IAAI,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,EAAE;YAC3D,EAAE,IAAI,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,EAAE;SAC7D,CAAC;QACF,MAAM,MAAM,GAAG;YACb,GAAG,EAAE,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;YACpC,GAAG,EAAE,sBAAG,CAAC,KAAK,CAAC,GAAG,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;YAC9B,IAAI,EAAE,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;SACtC,CAAC;QACF,MAAM,MAAM,GAAG,IAAA,8BAAW,EAAC,MAAM,EAAE,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6EAA6E,EAAE,GAAG,EAAE;QACrF,MAAM,IAAI,GAAG,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,MAAM,GAAG,GAAgB,EAAE,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,CAAC;QAC3C,MAAM,GAAG,GAAG,sBAAG,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC/B,iCAAiC;QACjC,MAAM,MAAM,GAAG,IAAA,8BAAW,EACxB;YACE,GAAG,EAAE,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC;YACrC,GAAG;YACH,IAAI,EAAE,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC;SACvC,EACD,EAAE,UAAU,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAC5C,CAAC;QACF,IAAA,eAAM,EAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,MAAM,IAAI,GAAG,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvC,MAAM,GAAG,GAAgB,EAAE,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,CAAC;QAC3C,MAAM,MAAM,GAAG,IAAA,8BAAW,EACxB;YACE,GAAG,EAAE,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;YACpC,GAAG,EAAE,sBAAG,CAAC,IAAI,CAAC,GAAG,CAAC;YAClB,IAAI,EAAE,IAAA,sBAAG,GAAE;SACZ,EACD,EAAE,UAAU,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAC5C,CAAC;QACF,IAAA,eAAM,EAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2EAA2E,EAAE,GAAG,EAAE;QACnF,6CAA6C;QAC7C,MAAM,IAAI,GAAG;YACX,GAAG,EAAE,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;YACpC,GAAG,EAAE,sBAAG,CAAC,KAAK,CAAC,GAAG,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;YAC9B,IAAI,EAAE,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;SACtC,CAAC;QACF,MAAM,YAAY,GAAG,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,GAAG,CAAC,CAAC,CAAC;QACvD,MAAM,MAAM,GAAG,IAAA,wBAAK,EAAC,IAAI,EAAE,YAAY,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAEtC,MAAM,IAAI,GAAG,IAAA,0BAAO,EAAC;YACnB,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;YACd,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,GAAG,CAAC,CAAC;SACjB,CAAC,CAAC;QACH,MAAM,GAAG,GAAgB,EAAE,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,CAAC;QAC3C,MAAM,MAAM,GAAG,IAAA,8BAAW,EAAC,MAAM,EAAE;YACjC,UAAU,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;YAC3B,OAAO,EAAE,CAAC;SACX,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,MAAM,MAAM,GAAG,IAAA,8BAAW,EACxB;YACE,GAAG,EAAE,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;YACpC,GAAG,EAAE,sBAAG,CAAC,KAAK,CAAC,GAAG,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;YAC9B,IAAI,EAAE,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC,EAAE,mBAAmB;SAC5D,EACD;YACE,UAAU,EAAE,CAAC,EAAE,IAAI,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,EAAE,CAAC;YACzE,OAAO,EAAE,CAAC;SACX,CACF,CAAC;QACF,IAAA,eAAM,EAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,MAAM,CAAC,cAAc,CAAC,CAAC,WAAW,EAAE,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,MAAM,MAAM,GAAG,IAAA,8BAAW,EACxB;YACE,GAAG,EAAE,IAAA,sBAAG,GAAE;YACV,GAAG,EAAE,sBAAG,CAAC,KAAK,CAAC,GAAG,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;YAC9B,IAAI,EAAE,IAAA,sBAAG,GAAE;SACZ,EACD;YACE,UAAU,EAAE,CAAC,EAAE,IAAI,EAAE,IAAA,0BAAO,GAAE,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,EAAE,CAAC;YACzD,OAAO,EAAE,CAAC;SACX,CACF,CAAC;QACF,IAAA,eAAM,EAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,MAAM,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,0CAA0C,EAAE,GAAG,EAAE;IACxD,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,mBAAmB;QACnB,MAAM,IAAI,GAAG,IAAA,0BAAO,EAAC;YACnB,CAAC,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC;YACf,CAAC,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC;YACf,CAAC,CAAC,EAAE,IAAA,0BAAO,GAAE,CAAC;SACf,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,IAAA,gCAAa,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,0BAAO,GAAE,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9D,4BAA4B;QAC5B,IAAA,eAAM,EAAC,IAAA,gCAAa,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,0BAAO,GAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpE,wDAAwD;QACxD,IAAA,eAAM,EAAC,IAAA,gCAAa,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChE,mBAAmB;QACnB,MAAM,MAAM,GAAG,IAAA,0BAAO,EAAC;YACrB,CAAC,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC;YACf,CAAC,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC;SAChB,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,IAAA,gCAAa,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,0BAAO,GAAE,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,IAAI,GAAG,IAAA,0BAAO,EAAC;YACnB,CAAC,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC;YACf,CAAC,CAAC,EAAE,IAAA,0BAAO,GAAE,CAAC;SACf,CAAC,CAAC;QACH,MAAM,GAAG,GAAgB,EAAE,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,CAAC;QAC3C,MAAM,CAAC,GAAG,IAAA,8BAAW,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,0BAAO,GAAE,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,IAAA,iCAAc,EAAC,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChD,yCAAyC;QACzC,IAAA,eAAM,EAAC,IAAA,kCAAe,EAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,UAAU;QACV,YAAY;QACZ,eAAe;QACf,QAAQ;QACR,YAAY;QACZ,MAAM,IAAI,GAAG,IAAA,0BAAO,EAAC;YACnB,CAAC,CAAC,EAAE,IAAA,0BAAO,EAAC,EAAE,CAAC,CAAC;YAChB,CAAC,CAAC,EAAE,IAAA,0BAAO,GAAE,CAAC;YACd,CAAC,EAAE,EAAE,IAAA,0BAAO,GAAE,CAAC;YACf,CAAC,EAAE,EAAE,IAAA,0BAAO,GAAE,CAAC;SAChB,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,IAAA,yBAAM,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,IAAA,yBAAM,EAAC,IAAA,0BAAO,GAAE,EAAE,IAAA,0BAAO,GAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,IAAI,GAAG,IAAA,0BAAO,EAAC;YACnB,CAAC,CAAC,EAAE,IAAA,0BAAO,GAAE,CAAC;YACd,CAAC,CAAC,EAAE,IAAA,0BAAO,GAAE,CAAC;SACf,CAAC,CAAC;QACH,MAAM,CAAC,GAAG,IAAA,uBAAI,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,IAAA,iCAAc,EAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAA,eAAM,EAAC,IAAA,kCAAe,EAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAC7C,uCAAuC;QACvC,MAAM,MAAM,GAAG,IAAA,0BAAO,EAAC;YACrB,CAAC,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC;YACf,CAAC,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC;SAChB,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,IAAA,iCAAc,EAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,+BAA+B,EAAE,GAAG,EAAE;IAC7C,IAAA,WAAE,EAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,kCAAkC;QAClC,MAAM,CAAC,GAAG,IAAA,4BAAS,EAAC,IAAA,sBAAG,GAAE,EAAE,IAAA,sBAAG,GAAE,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,CAAC,EAAE,IAAA,0BAAO,GAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,cAAc;QACd,0CAA0C;QAC1C,sEAAsE;QACtE,MAAM,CAAC,GAAG,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,CAAC,GAAG,IAAA,4BAAS,EACjB,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,EAC/B,IAAA,uBAAI,EAAC,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CACvE,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/reasoning/universal-algebra/universal-algebra.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=universal-algebra.test.d.ts.map

package/dist/tests/reasoning/universal-algebra/universal-algebra.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"universal-algebra.test.d.ts","sourceRoot":"","sources":["../../../../src/tests/reasoning/universal-algebra/universal-algebra.test.ts"],"names":[],"mappings":""}