@stevenvo780/st-lang 4.1.0 → 4.3.0

package/dist/tests/bisimulation/paige-tarjan.test.js

@@ -0,0 +1,254 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const bisimulation_1 = require("../../runtime/bisimulation");
+function labels(...names) {
+    return new Set(names);
+}
+(0, vitest_1.describe)('Bisimulation — Paige-Tarjan partition refinement', () => {
+    (0, vitest_1.it)('LTS lineal a→b→c con label X discrimina los tres estados', () => {
+        // a -t-> b -t-> c ; sólo c tiene label X.
+        const lts = {
+            states: ['a', 'b', 'c'],
+            transitions: [
+                ['a', 't', 'b'],
+                ['b', 't', 'c'],
+            ],
+            labelling: { c: labels('X') },
+        };
+        const r = (0, bisimulation_1.paigeTarjan)(lts);
+        (0, vitest_1.expect)(r.numBlocks).toBe(3);
+        (0, vitest_1.expect)(r.partition.get('a')).not.toBe(r.partition.get('b'));
+        (0, vitest_1.expect)(r.partition.get('b')).not.toBe(r.partition.get('c'));
+        (0, vitest_1.expect)(r.partition.get('a')).not.toBe(r.partition.get('c'));
+    });
+    (0, vitest_1.it)('dos estados con misma estructura colapsan en el mismo bloque', () => {
+        // s1 y s2 son hojas sin transiciones y con el mismo labelling.
+        const lts = {
+            states: ['root', 's1', 's2'],
+            transitions: [
+                ['root', 'a', 's1'],
+                ['root', 'a', 's2'],
+            ],
+            labelling: { s1: labels('p'), s2: labels('p') },
+        };
+        const r = (0, bisimulation_1.paigeTarjan)(lts);
+        (0, vitest_1.expect)(r.partition.get('s1')).toBe(r.partition.get('s2'));
+        (0, vitest_1.expect)(r.partition.get('root')).not.toBe(r.partition.get('s1'));
+    });
+    (0, vitest_1.it)('areBisimilar reporta true sii los estados están en el mismo bloque', () => {
+        const lts = {
+            states: ['x', 'y', 'z'],
+            transitions: [
+                ['x', 'a', 'x'],
+                ['y', 'a', 'y'],
+            ],
+            labelling: { x: labels('p'), y: labels('p'), z: labels('q') },
+        };
+        (0, vitest_1.expect)((0, bisimulation_1.areBisimilar)(lts, 'x', 'y')).toBe(true);
+        (0, vitest_1.expect)((0, bisimulation_1.areBisimilar)(lts, 'x', 'z')).toBe(false);
+    });
+    (0, vitest_1.it)('areBisimilar lanza si el estado no existe', () => {
+        const lts = { states: ['a'], transitions: [] };
+        (0, vitest_1.expect)(() => (0, bisimulation_1.areBisimilar)(lts, 'a', 'missing')).toThrow();
+    });
+    (0, vitest_1.it)('LTS sin labelling: todos los estados parten del mismo bloque', () => {
+        // 4 estados aislados sin transiciones ni labelling → un único bloque.
+        const lts = {
+            states: ['a', 'b', 'c', 'd'],
+            transitions: [],
+        };
+        const r = (0, bisimulation_1.paigeTarjan)(lts);
+        (0, vitest_1.expect)(r.numBlocks).toBe(1);
+    });
+    (0, vitest_1.it)('estados con distinto fan-out de acciones se separan', () => {
+        // a tiene salida 'x', b no.
+        const lts = {
+            states: ['a', 'b', 't'],
+            transitions: [['a', 'x', 't']],
+        };
+        const r = (0, bisimulation_1.paigeTarjan)(lts);
+        (0, vitest_1.expect)(r.partition.get('a')).not.toBe(r.partition.get('b'));
+    });
+    (0, vitest_1.it)('estados con misma acción pero a bloques distintos se separan', () => {
+        // s -a-> goal (label G), t -a-> sink (sin label).
+        const lts = {
+            states: ['s', 't', 'goal', 'sink'],
+            transitions: [
+                ['s', 'a', 'goal'],
+                ['t', 'a', 'sink'],
+            ],
+            labelling: { goal: labels('G') },
+        };
+        const r = (0, bisimulation_1.paigeTarjan)(lts);
+        (0, vitest_1.expect)(r.partition.get('s')).not.toBe(r.partition.get('t'));
+    });
+});
+(0, vitest_1.describe)('Bisimulation — quotientLTS', () => {
+    (0, vitest_1.it)('quotient reduce el número de estados cuando hay redundancia', () => {
+        // Tres hojas equivalentes.
+        const lts = {
+            states: ['root', 'l1', 'l2', 'l3'],
+            transitions: [
+                ['root', 'a', 'l1'],
+                ['root', 'a', 'l2'],
+                ['root', 'a', 'l3'],
+            ],
+        };
+        const q = (0, bisimulation_1.quotientLTS)(lts);
+        (0, vitest_1.expect)(q.states.length).toBeLessThan(lts.states.length);
+        // Debe ser exactamente 2: { root }, { l1, l2, l3 }.
+        (0, vitest_1.expect)(q.states.length).toBe(2);
+    });
+    (0, vitest_1.it)('quotient deduplica transiciones equivalentes', () => {
+        const lts = {
+            states: ['s1', 's2', 't1', 't2'],
+            transitions: [
+                ['s1', 'a', 't1'],
+                ['s2', 'a', 't2'],
+            ],
+            labelling: { s1: labels('S'), s2: labels('S'), t1: labels('T'), t2: labels('T') },
+        };
+        const q = (0, bisimulation_1.quotientLTS)(lts);
+        // 2 bloques: {s1, s2}, {t1, t2}; una sola arista a.
+        (0, vitest_1.expect)(q.states.length).toBe(2);
+        (0, vitest_1.expect)(q.transitions.length).toBe(1);
+    });
+    (0, vitest_1.it)('quotient preserva labelling en los bloques', () => {
+        const lts = {
+            states: ['a', 'b'],
+            transitions: [],
+            labelling: { a: labels('P'), b: labels('P') },
+        };
+        const q = (0, bisimulation_1.quotientLTS)(lts);
+        (0, vitest_1.expect)(q.states.length).toBe(1);
+        const repr = q.states[0];
+        (0, vitest_1.expect)(q.labelling?.[repr]?.has('P')).toBe(true);
+    });
+});
+(0, vitest_1.describe)('Bisimulation — strongBisimulation entre dos LTS', () => {
+    (0, vitest_1.it)('dos LTS isomorfos son fuertemente bisimilares', () => {
+        const l1 = {
+            states: ['a', 'b'],
+            transitions: [['a', 'x', 'b']],
+            labelling: { a: labels('P'), b: labels('Q') },
+        };
+        const l2 = {
+            states: ['p', 'q'],
+            transitions: [['p', 'x', 'q']],
+            labelling: { p: labels('P'), q: labels('Q') },
+        };
+        (0, vitest_1.expect)((0, bisimulation_1.strongBisimulation)(l1, l2)).toBe(true);
+    });
+    (0, vitest_1.it)('dos LTS con distinto labelling NO son bisimilares', () => {
+        const l1 = {
+            states: ['a'],
+            transitions: [],
+            labelling: { a: labels('P') },
+        };
+        const l2 = {
+            states: ['b'],
+            transitions: [],
+            labelling: { b: labels('Q') },
+        };
+        (0, vitest_1.expect)((0, bisimulation_1.strongBisimulation)(l1, l2)).toBe(false);
+    });
+    (0, vitest_1.it)('LTS con distinto fan-out NO es bisimilar', () => {
+        // L1 tiene una transición a; L2 no tiene transiciones.
+        const l1 = {
+            states: ['a', 'b'],
+            transitions: [['a', 'x', 'b']],
+        };
+        const l2 = {
+            states: ['p', 'q'],
+            transitions: [],
+        };
+        (0, vitest_1.expect)((0, bisimulation_1.strongBisimulation)(l1, l2)).toBe(false);
+    });
+});
+(0, vitest_1.describe)('Bisimulation — weakBisimulation (τ-transitions ocultas)', () => {
+    (0, vitest_1.it)('τ-loops invisibles identifican estados τ-equivalentes', () => {
+        // s -τ-> s' -a-> t  vs  u -a-> t. Bajo bisimulación débil, s y u son
+        // equivalentes (el τ desaparece bajo ⇒).
+        const lts = {
+            states: ['s', 's2', 'u', 't'],
+            transitions: [
+                ['s', 'τ', 's2'],
+                ['s2', 'a', 't'],
+                ['u', 'a', 't'],
+            ],
+        };
+        const r = (0, bisimulation_1.weakBisimulation)(lts, 'τ');
+        // s y u deben caer en el mismo bloque vía bisimulación débil.
+        (0, vitest_1.expect)(r.partition.get('s')).toBe(r.partition.get('u'));
+    });
+    (0, vitest_1.it)('weak bisimulation no identifica estados con labelling distinto', () => {
+        const lts = {
+            states: ['s', 't'],
+            transitions: [['s', 'τ', 't']],
+            labelling: { s: labels('P'), t: labels('Q') },
+        };
+        const r = (0, bisimulation_1.weakBisimulation)(lts, 'τ');
+        (0, vitest_1.expect)(r.partition.get('s')).not.toBe(r.partition.get('t'));
+    });
+});
+(0, vitest_1.describe)('Bisimulation — performance / escalabilidad', () => {
+    (0, vitest_1.it)('LTS 100 estados determinista termina <500ms', () => {
+        // Cadena lineal 100 estados: s0 -a-> s1 -a-> ... -a-> s99.
+        // Ningún estado tiene labelling explícito → tras refinar quedan 100 bloques
+        // porque el "futuro" de cada uno es estructuralmente distinto.
+        const n = 100;
+        const states = [];
+        const transitions = [];
+        for (let i = 0; i < n; i++)
+            states.push(`s${i}`);
+        for (let i = 0; i < n - 1; i++)
+            transitions.push([`s${i}`, 'a', `s${i + 1}`]);
+        const lts = { states, transitions };
+        const t0 = Date.now();
+        const r = (0, bisimulation_1.paigeTarjan)(lts);
+        const elapsed = Date.now() - t0;
+        (0, vitest_1.expect)(elapsed).toBeLessThan(500);
+        // En la cadena lineal sin labelling, cada estado se separa por su
+        // longitud de camino restante → n bloques.
+        (0, vitest_1.expect)(r.numBlocks).toBe(n);
+    });
+    (0, vitest_1.it)('100 estados duplicados (dos copias idénticas) colapsan a la mitad', () => {
+        // Dos cadenas paralelas independientes con etiquetas equivalentes.
+        const n = 50;
+        const states = [];
+        const transitions = [];
+        const labelling = {};
+        for (let i = 0; i < n; i++) {
+            states.push(`a${i}`);
+            states.push(`b${i}`);
+            labelling[`a${i}`] = labels(`L${i}`);
+            labelling[`b${i}`] = labels(`L${i}`);
+        }
+        for (let i = 0; i < n - 1; i++) {
+            transitions.push([`a${i}`, 'x', `a${i + 1}`]);
+            transitions.push([`b${i}`, 'x', `b${i + 1}`]);
+        }
+        const lts = { states, transitions, labelling };
+        const r = (0, bisimulation_1.paigeTarjan)(lts);
+        // Cada par (ai, bi) debe colapsar → n bloques en lugar de 2n.
+        (0, vitest_1.expect)(r.numBlocks).toBe(n);
+    });
+});
+(0, vitest_1.describe)('Bisimulation — validación de entradas', () => {
+    (0, vitest_1.it)('lanza si una transición sale de un estado desconocido', () => {
+        const lts = {
+            states: ['a'],
+            transitions: [['ghost', 'x', 'a']],
+        };
+        (0, vitest_1.expect)(() => (0, bisimulation_1.paigeTarjan)(lts)).toThrow(/desconocido/);
+    });
+    (0, vitest_1.it)('lanza si una transición llega a un estado desconocido', () => {
+        const lts = {
+            states: ['a'],
+            transitions: [['a', 'x', 'ghost']],
+        };
+        (0, vitest_1.expect)(() => (0, bisimulation_1.paigeTarjan)(lts)).toThrow(/desconocido/);
+    });
+});
+//# sourceMappingURL=paige-tarjan.test.js.map

package/dist/tests/bisimulation/paige-tarjan.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"paige-tarjan.test.js","sourceRoot":"","sources":["../../../src/tests/bisimulation/paige-tarjan.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,6DAMoC;AAGpC,SAAS,MAAM,CAAC,GAAG,KAAe;IAChC,OAAO,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;AACxB,CAAC;AAED,IAAA,iBAAQ,EAAC,kDAAkD,EAAE,GAAG,EAAE;IAChE,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,0CAA0C;QAC1C,MAAM,GAAG,GAAQ;YACf,MAAM,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;YACvB,WAAW,EAAE;gBACX,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;gBACf,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;aAChB;YACD,SAAS,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE;SAC9B,CAAC;QACF,MAAM,CAAC,GAAG,IAAA,0BAAW,EAAC,GAAG,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5D,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5D,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,+DAA+D;QAC/D,MAAM,GAAG,GAAQ;YACf,MAAM,EAAE,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC;YAC5B,WAAW,EAAE;gBACX,CAAC,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC;gBACnB,CAAC,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC;aACpB;YACD,SAAS,EAAE,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE;SAChD,CAAC;QACF,MAAM,CAAC,GAAG,IAAA,0BAAW,EAAC,GAAG,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QAC1D,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,MAAM,GAAG,GAAQ;YACf,MAAM,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;YACvB,WAAW,EAAE;gBACX,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;gBACf,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;aAChB;YACD,SAAS,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE;SAC9D,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,2BAAY,EAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAA,eAAM,EAAC,IAAA,2BAAY,EAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,GAAG,GAAQ,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC;QACpD,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,2BAAY,EAAC,GAAG,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAC5D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,sEAAsE;QACtE,MAAM,GAAG,GAAQ;YACf,MAAM,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;YAC5B,WAAW,EAAE,EAAE;SAChB,CAAC;QACF,MAAM,CAAC,GAAG,IAAA,0BAAW,EAAC,GAAG,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,4BAA4B;QAC5B,MAAM,GAAG,GAAQ;YACf,MAAM,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;YACvB,WAAW,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;SAC/B,CAAC;QACF,MAAM,CAAC,GAAG,IAAA,0BAAW,EAAC,GAAG,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,kDAAkD;QAClD,MAAM,GAAG,GAAQ;YACf,MAAM,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,CAAC;YAClC,WAAW,EAAE;gBACX,CAAC,GAAG,EAAE,GAAG,EAAE,MAAM,CAAC;gBAClB,CAAC,GAAG,EAAE,GAAG,EAAE,MAAM,CAAC;aACnB;YACD,SAAS,EAAE,EAAE,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE;SACjC,CAAC;QACF,MAAM,CAAC,GAAG,IAAA,0BAAW,EAAC,GAAG,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,4BAA4B,EAAE,GAAG,EAAE;IAC1C,IAAA,WAAE,EAAC,6DAA6D,EAAE,GAAG,EAAE;QACrE,2BAA2B;QAC3B,MAAM,GAAG,GAAQ;YACf,MAAM,EAAE,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC;YAClC,WAAW,EAAE;gBACX,CAAC,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC;gBACnB,CAAC,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC;gBACnB,CAAC,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC;aACpB;SACF,CAAC;QACF,MAAM,CAAC,GAAG,IAAA,0BAAW,EAAC,GAAG,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACxD,oDAAoD;QACpD,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,GAAG,GAAQ;YACf,MAAM,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC;YAChC,WAAW,EAAE;gBACX,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC;gBACjB,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC;aAClB;YACD,SAAS,EAAE,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE;SAClF,CAAC;QACF,MAAM,CAAC,GAAG,IAAA,0BAAW,EAAC,GAAG,CAAC,CAAC;QAC3B,oDAAoD;QACpD,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,GAAG,GAAQ;YACf,MAAM,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;YAClB,WAAW,EAAE,EAAE;YACf,SAAS,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE;SAC9C,CAAC;QACF,MAAM,CAAC,GAAG,IAAA,0BAAW,EAAC,GAAG,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,iDAAiD,EAAE,GAAG,EAAE;IAC/D,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,EAAE,GAAQ;YACd,MAAM,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;YAClB,WAAW,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YAC9B,SAAS,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE;SAC9C,CAAC;QACF,MAAM,EAAE,GAAQ;YACd,MAAM,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;YAClB,WAAW,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YAC9B,SAAS,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE;SAC9C,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,iCAAkB,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,EAAE,GAAQ;YACd,MAAM,EAAE,CAAC,GAAG,CAAC;YACb,WAAW,EAAE,EAAE;YACf,SAAS,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE;SAC9B,CAAC;QACF,MAAM,EAAE,GAAQ;YACd,MAAM,EAAE,CAAC,GAAG,CAAC;YACb,WAAW,EAAE,EAAE;YACf,SAAS,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE;SAC9B,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,iCAAkB,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,uDAAuD;QACvD,MAAM,EAAE,GAAQ;YACd,MAAM,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;YAClB,WAAW,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;SAC/B,CAAC;QACF,MAAM,EAAE,GAAQ;YACd,MAAM,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;YAClB,WAAW,EAAE,EAAE;SAChB,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,iCAAkB,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,yDAAyD,EAAE,GAAG,EAAE;IACvE,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,qEAAqE;QACrE,yCAAyC;QACzC,MAAM,GAAG,GAAQ;YACf,MAAM,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC;YAC7B,WAAW,EAAE;gBACX,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC;gBAChB,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC;gBAChB,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;aAChB;SACF,CAAC;QACF,MAAM,CAAC,GAAG,IAAA,+BAAgB,EAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACrC,8DAA8D;QAC9D,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,MAAM,GAAG,GAAQ;YACf,MAAM,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;YAClB,WAAW,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YAC9B,SAAS,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE;SAC9C,CAAC;QACF,MAAM,CAAC,GAAG,IAAA,+BAAgB,EAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,4CAA4C,EAAE,GAAG,EAAE;IAC1D,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,2DAA2D;QAC3D,4EAA4E;QAC5E,+DAA+D;QAC/D,MAAM,CAAC,GAAG,GAAG,CAAC;QACd,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,WAAW,GAAoC,EAAE,CAAC;QACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,WAAW,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAE9E,MAAM,GAAG,GAAQ,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;QACzC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACtB,MAAM,CAAC,GAAG,IAAA,0BAAW,EAAC,GAAG,CAAC,CAAC;QAC3B,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;QAChC,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;QAClC,kEAAkE;QAClE,2CAA2C;QAC3C,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mEAAmE,EAAE,GAAG,EAAE;QAC3E,mEAAmE;QACnE,MAAM,CAAC,GAAG,EAAE,CAAC;QACb,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,WAAW,GAAoC,EAAE,CAAC;QACxD,MAAM,SAAS,GAAgC,EAAE,CAAC;QAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACrB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACrB,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACrC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACvC,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,WAAW,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9C,WAAW,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAChD,CAAC;QACD,MAAM,GAAG,GAAQ,EAAE,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,CAAC;QACpD,MAAM,CAAC,GAAG,IAAA,0BAAW,EAAC,GAAG,CAAC,CAAC;QAC3B,8DAA8D;QAC9D,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,uCAAuC,EAAE,GAAG,EAAE;IACrD,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,GAAG,GAAQ;YACf,MAAM,EAAE,CAAC,GAAG,CAAC;YACb,WAAW,EAAE,CAAC,CAAC,OAAO,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;SACnC,CAAC;QACF,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,0BAAW,EAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,GAAG,GAAQ;YACf,MAAM,EAAE,CAAC,GAAG,CAAC;YACb,WAAW,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;SACnC,CAAC;QACF,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,0BAAW,EAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/countermodel-min/minimize.test.d.ts

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

package/dist/tests/countermodel-min/minimize.test.d.ts.map

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

package/dist/tests/countermodel-min/minimize.test.js

@@ -0,0 +1,241 @@
+"use strict";
+// ============================================================
+// ST Countermodel Minimization — Tests
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const countermodel_min_1 = require("../../runtime/countermodel-min");
+// ── Helpers de fórmula ────────────────────────────────────────
+function atom(name) {
+    return { kind: 'atom', name };
+}
+function and(a, b) {
+    return { kind: 'and', args: [a, b] };
+}
+function or(a, b) {
+    return { kind: 'or', args: [a, b] };
+}
+function not(f) {
+    return { kind: 'not', args: [f] };
+}
+// ── Evaluador propositional clásico ──────────────────────────
+/**
+ * Evalúa una fórmula clásica bajo una asignación total. Cualquier
+ * variable faltante se trata como `false` (no debería pasar en los
+ * tests bien formados).
+ */
+function evalClassical(f, asg) {
+    switch (f.kind) {
+        case 'true':
+            return true;
+        case 'false':
+            return false;
+        case 'atom':
+            return Boolean(asg[f.name]);
+        case 'not':
+            return !evalClassical(f.args[0], asg);
+        case 'and':
+            return evalClassical(f.args[0], asg) && evalClassical(f.args[1], asg);
+        case 'or':
+            return evalClassical(f.args[0], asg) || evalClassical(f.args[1], asg);
+        case 'implies':
+            return !evalClassical(f.args[0], asg) || evalClassical(f.args[1], asg);
+        case 'biconditional':
+            return evalClassical(f.args[0], asg) === evalClassical(f.args[1], asg);
+        default:
+            throw new Error(`evalClassical: kind no soportado: ${f.kind}`);
+    }
+}
+/** Wrapper que cumple la firma esperada por `minimizeCountermodel`. */
+function evaluator(f) {
+    return (asg) => evalClassical(f, asg);
+}
+const ALGORITHMS = ['one-at-a-time', 'binary-search', 'delta-debug'];
+// ── Caso 1: P ∧ Q falsada con {P:T, Q:F, R:T, S:F} ───────────
+(0, vitest_1.describe)('minimizeCountermodel — P ∧ Q', () => {
+    const formula = and(atom('P'), atom('Q'));
+    const fullCounter = { P: true, Q: false, R: true, S: false };
+    vitest_1.it.each(ALGORITHMS)('reduce a {Q:F} con %s', (algorithm) => {
+        const min = (0, countermodel_min_1.minimizeCountermodel)(formula, fullCounter, evaluator(formula), {
+            algorithm,
+        });
+        (0, vitest_1.expect)(min.size).toBe(1);
+        (0, vitest_1.expect)(min.assignments).toEqual({ Q: false });
+        (0, vitest_1.expect)(min.removed.sort()).toEqual(['P', 'R', 'S']);
+    });
+});
+// ── Caso 2: ¬P falsada con {P:T, Q:T, R:F} ───────────────────
+(0, vitest_1.describe)('minimizeCountermodel — ¬P', () => {
+    const formula = not(atom('P'));
+    const fullCounter = { P: true, Q: true, R: false };
+    vitest_1.it.each(ALGORITHMS)('reduce a {P:T} con %s', (algorithm) => {
+        const min = (0, countermodel_min_1.minimizeCountermodel)(formula, fullCounter, evaluator(formula), {
+            algorithm,
+        });
+        (0, vitest_1.expect)(min.size).toBe(1);
+        (0, vitest_1.expect)(min.assignments).toEqual({ P: true });
+        (0, vitest_1.expect)(min.removed.sort()).toEqual(['Q', 'R']);
+    });
+});
+// ── Caso 3: P ∨ Q falsada con {P:F, Q:F, R:F, S:T} ───────────
+(0, vitest_1.describe)('minimizeCountermodel — P ∨ Q', () => {
+    const formula = or(atom('P'), atom('Q'));
+    const fullCounter = { P: false, Q: false, R: false, S: true };
+    vitest_1.it.each(ALGORITHMS)('reduce a {P:F, Q:F} con %s', (algorithm) => {
+        const min = (0, countermodel_min_1.minimizeCountermodel)(formula, fullCounter, evaluator(formula), {
+            algorithm,
+        });
+        (0, vitest_1.expect)(min.size).toBe(2);
+        (0, vitest_1.expect)(min.assignments).toEqual({ P: false, Q: false });
+        (0, vitest_1.expect)(min.removed.sort()).toEqual(['R', 'S']);
+    });
+});
+// ── Caso 4: fórmula con 50 vars, sólo 5 son necesarias ───────
+(0, vitest_1.describe)('minimizeCountermodel — escalabilidad (50 vars, 5 necesarias)', () => {
+    // Fórmula: v00 ∨ v01 ∨ v02 ∨ v03 ∨ v04.
+    // Para falsificarla TODAS las 5 disyuntas deben ser false.
+    // Asignamos las 50 variables a false → falsifica.
+    // Minimal counter-witness debería ser exactamente {v00..v04 a F}.
+    const target = or(or(or(atom('v00'), atom('v01')), or(atom('v02'), atom('v03'))), atom('v04'));
+    const fullCounter = {};
+    for (let i = 0; i < 50; i++) {
+        const key = `v${i.toString().padStart(2, '0')}`;
+        fullCounter[key] = false;
+    }
+    vitest_1.it.each(ALGORITHMS)('reduce a las 5 disyuntas (%s)', (algorithm) => {
+        const min = (0, countermodel_min_1.minimizeCountermodel)(target, fullCounter, evaluator(target), {
+            algorithm,
+        });
+        (0, vitest_1.expect)(min.size).toBe(5);
+        (0, vitest_1.expect)(min.assignments).toEqual({
+            v00: false,
+            v01: false,
+            v02: false,
+            v03: false,
+            v04: false,
+        });
+        (0, vitest_1.expect)(min.removed.length).toBe(45);
+    });
+});
+// ── Caso 5: determinismo (mismo input ⇒ mismo output) ────────
+(0, vitest_1.describe)('minimizeCountermodel — determinismo', () => {
+    const formula = and(or(atom('A'), atom('B')), not(atom('C')));
+    // Asignación que falsifica: A=F, B=F (cualquiera de las dos cláusulas
+    // ya está rota). C es irrelevante.
+    const fullCounter = { A: false, B: false, C: true, D: true, E: false };
+    vitest_1.it.each(ALGORITHMS)('mismo input produce mismo output con %s', (algorithm) => {
+        const run1 = (0, countermodel_min_1.minimizeCountermodel)(formula, fullCounter, evaluator(formula), {
+            algorithm,
+        });
+        const run2 = (0, countermodel_min_1.minimizeCountermodel)(formula, fullCounter, evaluator(formula), {
+            algorithm,
+        });
+        const run3 = (0, countermodel_min_1.minimizeCountermodel)(formula, fullCounter, evaluator(formula), {
+            algorithm,
+        });
+        (0, vitest_1.expect)(run1.assignments).toEqual(run2.assignments);
+        (0, vitest_1.expect)(run2.assignments).toEqual(run3.assignments);
+        (0, vitest_1.expect)(run1.removed).toEqual(run2.removed);
+        (0, vitest_1.expect)(run1.size).toBe(run2.size);
+    });
+});
+// ── Caso 6: contramodelo ya mínimo no se modifica ────────────
+(0, vitest_1.describe)('minimizeCountermodel — ya mínimo', () => {
+    const formula = atom('P');
+    // P=F falsifica la fórmula. Es ya mínimo.
+    const fullCounter = { P: false };
+    vitest_1.it.each(ALGORITHMS)('respeta contramodelo trivial con %s', (algorithm) => {
+        const min = (0, countermodel_min_1.minimizeCountermodel)(formula, fullCounter, evaluator(formula), {
+            algorithm,
+        });
+        (0, vitest_1.expect)(min.size).toBe(1);
+        (0, vitest_1.expect)(min.assignments).toEqual({ P: false });
+        (0, vitest_1.expect)(min.removed).toEqual([]);
+    });
+});
+// ── Caso 7: no es contramodelo real (sanity check) ───────────
+(0, vitest_1.describe)('minimizeCountermodel — input no falsifica', () => {
+    (0, vitest_1.it)('devuelve el contramodelo intacto si el input NO falsifica', () => {
+        const formula = or(atom('P'), atom('Q'));
+        // P=T,Q=F evalúa a true → la fórmula es válida bajo esta asig, NO
+        // es contramodelo. El minimizador debe devolverlo sin tocar.
+        const fullCounter = { P: true, Q: false, R: true };
+        const min = (0, countermodel_min_1.minimizeCountermodel)(formula, fullCounter, evaluator(formula));
+        (0, vitest_1.expect)(min.size).toBe(3);
+        (0, vitest_1.expect)(min.assignments).toEqual({ P: true, Q: false, R: true });
+        (0, vitest_1.expect)(min.removed).toEqual([]);
+    });
+});
+// ── Caso 8: maxSteps acota iteraciones ────────────────────────
+(0, vitest_1.describe)('minimizeCountermodel — maxSteps', () => {
+    (0, vitest_1.it)('respeta maxSteps y devuelve algo razonable', () => {
+        const formula = and(atom('P'), atom('Q'));
+        const fullCounter = { P: true, Q: false, R: true, S: false };
+        const min = (0, countermodel_min_1.minimizeCountermodel)(formula, fullCounter, evaluator(formula), {
+            algorithm: 'one-at-a-time',
+            maxSteps: 3,
+        });
+        // Con sólo 3 pasos quizá no logre minimizar del todo, pero las
+        // assignments resultantes siguen siendo un superset válido del
+        // contramodelo.
+        (0, vitest_1.expect)(min.iterations).toBeLessThanOrEqual(20); // holgura: cleanup pass puede sumar
+        (0, vitest_1.expect)(min.size).toBeLessThanOrEqual(4);
+        (0, vitest_1.expect)(min.size).toBeGreaterThanOrEqual(1);
+    });
+});
+// ── Caso 9: implies — falsa con A=T,B=F ──────────────────────
+(0, vitest_1.describe)('minimizeCountermodel — implicación', () => {
+    // A → B falsa sii A=T, B=F. C es irrelevante.
+    const formula = { kind: 'implies', args: [atom('A'), atom('B')] };
+    const fullCounter = { A: true, B: false, C: true };
+    vitest_1.it.each(ALGORITHMS)('reduce a {A:T, B:F} con %s', (algorithm) => {
+        const min = (0, countermodel_min_1.minimizeCountermodel)(formula, fullCounter, evaluator(formula), {
+            algorithm,
+        });
+        (0, vitest_1.expect)(min.size).toBe(2);
+        (0, vitest_1.expect)(min.assignments).toEqual({ A: true, B: false });
+        (0, vitest_1.expect)(min.removed).toEqual(['C']);
+    });
+});
+// ── Caso 10: tres conjunción donde sólo una variable falsa basta ─
+(0, vitest_1.describe)('minimizeCountermodel — múltiples conjuntos viables', () => {
+    // P ∧ Q ∧ R. Si TODAS están en false, basta una sola variable en
+    // false para falsificar — pero el algoritmo greedy 1-flip va sacando
+    // variables en orden y el "extreme flip" termina seleccionando una
+    // sola (deterministicamente).
+    const formula = and(and(atom('P'), atom('Q')), atom('R'));
+    const fullCounter = { P: false, Q: false, R: false, S: true };
+    vitest_1.it.each(ALGORITHMS)('reduce a 1 variable con %s', (algorithm) => {
+        const min = (0, countermodel_min_1.minimizeCountermodel)(formula, fullCounter, evaluator(formula), {
+            algorithm,
+        });
+        (0, vitest_1.expect)(min.size).toBe(1);
+        // El algoritmo selecciona exactamente UNA variable de {P,Q,R}.
+        const kept = Object.keys(min.assignments);
+        (0, vitest_1.expect)(kept).toHaveLength(1);
+        (0, vitest_1.expect)(['P', 'Q', 'R']).toContain(kept[0]);
+        (0, vitest_1.expect)(min.assignments[kept[0]]).toBe(false);
+    });
+});
+// ── Caso 11: iteraciones reportadas son > 0 ──────────────────
+(0, vitest_1.describe)('minimizeCountermodel — métricas', () => {
+    (0, vitest_1.it)('reporta iterations y removed coherentes', () => {
+        const formula = and(atom('P'), atom('Q'));
+        const fullCounter = { P: true, Q: false, R: true, S: false };
+        const min = (0, countermodel_min_1.minimizeCountermodel)(formula, fullCounter, evaluator(formula));
+        (0, vitest_1.expect)(min.iterations).toBeGreaterThan(0);
+        (0, vitest_1.expect)(min.removed.length + min.size).toBe(Object.keys(fullCounter).length);
+    });
+});
+// ── Caso 12: salida final ordenada alfabéticamente ───────────
+(0, vitest_1.describe)('minimizeCountermodel — orden estable', () => {
+    (0, vitest_1.it)('removed está ordenado alfabéticamente', () => {
+        const formula = and(atom('zeta'), atom('alpha'));
+        const fullCounter = { zeta: false, alpha: true, mu: true, beta: false };
+        const min = (0, countermodel_min_1.minimizeCountermodel)(formula, fullCounter, evaluator(formula));
+        // zeta=false ya falsifica la conjunción
+        const sortedRemoved = [...min.removed].sort();
+        (0, vitest_1.expect)(min.removed).toEqual(sortedRemoved);
+    });
+});
+//# sourceMappingURL=minimize.test.js.map

package/dist/tests/countermodel-min/minimize.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"minimize.test.js","sourceRoot":"","sources":["../../../src/tests/countermodel-min/minimize.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,uCAAuC;AACvC,+DAA+D;;AAE/D,mCAA8C;AAC9C,qEAGwC;AAGxC,iEAAiE;AAEjE,SAAS,IAAI,CAAC,IAAY;IACxB,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;AAChC,CAAC;AACD,SAAS,GAAG,CAAC,CAAU,EAAE,CAAU;IACjC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;AACvC,CAAC;AACD,SAAS,EAAE,CAAC,CAAU,EAAE,CAAU;IAChC,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;AACtC,CAAC;AACD,SAAS,GAAG,CAAC,CAAU;IACrB,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;AACpC,CAAC;AAED,gEAAgE;AAEhE;;;;GAIG;AACH,SAAS,aAAa,CAAC,CAAU,EAAE,GAA4B;IAC7D,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,MAAM;YACT,OAAO,IAAI,CAAC;QACd,KAAK,OAAO;YACV,OAAO,KAAK,CAAC;QACf,KAAK,MAAM;YACT,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC;QAC/B,KAAK,KAAK;YACR,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACzC,KAAK,KAAK;YACR,OAAO,aAAa,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAC1E,KAAK,IAAI;YACP,OAAO,aAAa,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAC1E,KAAK,SAAS;YACZ,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAC3E,KAAK,eAAe;YAClB,OAAO,aAAa,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,aAAa,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAC3E;YACE,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IACnE,CAAC;AACH,CAAC;AAED,uEAAuE;AACvE,SAAS,SAAS,CAAC,CAAU;IAC3B,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AACxC,CAAC;AAED,MAAM,UAAU,GAA+B,CAAC,eAAe,EAAE,eAAe,EAAE,aAAa,CAAC,CAAC;AAEjG,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,8BAA8B,EAAE,GAAG,EAAE;IAC5C,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1C,MAAM,WAAW,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC;IAE7D,WAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,uBAAuB,EAAE,CAAC,SAAS,EAAE,EAAE;QACzD,MAAM,GAAG,GAAG,IAAA,uCAAoB,EAAC,OAAO,EAAE,WAAW,EAAE,SAAS,CAAC,OAAO,CAAC,EAAE;YACzE,SAAS;SACV,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,2BAA2B,EAAE,GAAG,EAAE;IACzC,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/B,MAAM,WAAW,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC;IAEnD,WAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,uBAAuB,EAAE,CAAC,SAAS,EAAE,EAAE;QACzD,MAAM,GAAG,GAAG,IAAA,uCAAoB,EAAC,OAAO,EAAE,WAAW,EAAE,SAAS,CAAC,OAAO,CAAC,EAAE;YACzE,SAAS;SACV,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,8BAA8B,EAAE,GAAG,EAAE;IAC5C,MAAM,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IACzC,MAAM,WAAW,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC;IAE9D,WAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,4BAA4B,EAAE,CAAC,SAAS,EAAE,EAAE;QAC9D,MAAM,GAAG,GAAG,IAAA,uCAAoB,EAAC,OAAO,EAAE,WAAW,EAAE,SAAS,CAAC,OAAO,CAAC,EAAE;YACzE,SAAS;SACV,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;QACxD,IAAA,eAAM,EAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,8DAA8D,EAAE,GAAG,EAAE;IAC5E,wCAAwC;IACxC,2DAA2D;IAC3D,kDAAkD;IAClD,kEAAkE;IAClE,MAAM,MAAM,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAE/F,MAAM,WAAW,GAA4B,EAAE,CAAC;IAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;QAChD,WAAW,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;IAC3B,CAAC;IAED,WAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,+BAA+B,EAAE,CAAC,SAAS,EAAE,EAAE;QACjE,MAAM,GAAG,GAAG,IAAA,uCAAoB,EAAC,MAAM,EAAE,WAAW,EAAE,SAAS,CAAC,MAAM,CAAC,EAAE;YACvE,SAAS;SACV,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,OAAO,CAAC;YAC9B,GAAG,EAAE,KAAK;YACV,GAAG,EAAE,KAAK;YACV,GAAG,EAAE,KAAK;YACV,GAAG,EAAE,KAAK;YACV,GAAG,EAAE,KAAK;SACX,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,qCAAqC,EAAE,GAAG,EAAE;IACnD,MAAM,OAAO,GAAG,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC9D,sEAAsE;IACtE,mCAAmC;IACnC,MAAM,WAAW,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC;IAEvE,WAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,yCAAyC,EAAE,CAAC,SAAS,EAAE,EAAE;QAC3E,MAAM,IAAI,GAAG,IAAA,uCAAoB,EAAC,OAAO,EAAE,WAAW,EAAE,SAAS,CAAC,OAAO,CAAC,EAAE;YAC1E,SAAS;SACV,CAAC,CAAC;QACH,MAAM,IAAI,GAAG,IAAA,uCAAoB,EAAC,OAAO,EAAE,WAAW,EAAE,SAAS,CAAC,OAAO,CAAC,EAAE;YAC1E,SAAS;SACV,CAAC,CAAC;QACH,MAAM,IAAI,GAAG,IAAA,uCAAoB,EAAC,OAAO,EAAE,WAAW,EAAE,SAAS,CAAC,OAAO,CAAC,EAAE;YAC1E,SAAS;SACV,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,IAAI,CAAC,WAAW,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,IAAI,CAAC,WAAW,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,IAAI,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,kCAAkC,EAAE,GAAG,EAAE;IAChD,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IAC1B,0CAA0C;IAC1C,MAAM,WAAW,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC;IAEjC,WAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,qCAAqC,EAAE,CAAC,SAAS,EAAE,EAAE;QACvE,MAAM,GAAG,GAAG,IAAA,uCAAoB,EAAC,OAAO,EAAE,WAAW,EAAE,SAAS,CAAC,OAAO,CAAC,EAAE;YACzE,SAAS;SACV,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,GAAG,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,2CAA2C,EAAE,GAAG,EAAE;IACzD,IAAA,WAAE,EAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,MAAM,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACzC,kEAAkE;QAClE,6DAA6D;QAC7D,MAAM,WAAW,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC;QACnD,MAAM,GAAG,GAAG,IAAA,uCAAoB,EAAC,OAAO,EAAE,WAAW,EAAE,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC;QAC3E,IAAA,eAAM,EAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC;QAChE,IAAA,eAAM,EAAC,GAAG,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,iEAAiE;AAEjE,IAAA,iBAAQ,EAAC,iCAAiC,EAAE,GAAG,EAAE;IAC/C,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1C,MAAM,WAAW,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC;QAC7D,MAAM,GAAG,GAAG,IAAA,uCAAoB,EAAC,OAAO,EAAE,WAAW,EAAE,SAAS,CAAC,OAAO,CAAC,EAAE;YACzE,SAAS,EAAE,eAAe;YAC1B,QAAQ,EAAE,CAAC;SACZ,CAAC,CAAC;QACH,+DAA+D;QAC/D,+DAA+D;QAC/D,gBAAgB;QAChB,IAAA,eAAM,EAAC,GAAG,CAAC,UAAU,CAAC,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC,CAAC,oCAAoC;QACpF,IAAA,eAAM,EAAC,GAAG,CAAC,IAAI,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,GAAG,CAAC,IAAI,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,oCAAoC,EAAE,GAAG,EAAE;IAClD,8CAA8C;IAC9C,MAAM,OAAO,GAAY,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;IAC3E,MAAM,WAAW,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC;IAEnD,WAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,4BAA4B,EAAE,CAAC,SAAS,EAAE,EAAE;QAC9D,MAAM,GAAG,GAAG,IAAA,uCAAoB,EAAC,OAAO,EAAE,WAAW,EAAE,SAAS,CAAC,OAAO,CAAC,EAAE;YACzE,SAAS;SACV,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;QACvD,IAAA,eAAM,EAAC,GAAG,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,oEAAoE;AAEpE,IAAA,iBAAQ,EAAC,oDAAoD,EAAE,GAAG,EAAE;IAClE,iEAAiE;IACjE,qEAAqE;IACrE,mEAAmE;IACnE,8BAA8B;IAC9B,MAAM,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1D,MAAM,WAAW,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC;IAE9D,WAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,4BAA4B,EAAE,CAAC,SAAS,EAAE,EAAE;QAC9D,MAAM,GAAG,GAAG,IAAA,uCAAoB,EAAC,OAAO,EAAE,WAAW,EAAE,SAAS,CAAC,OAAO,CAAC,EAAE;YACzE,SAAS;SACV,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,+DAA+D;QAC/D,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAC1C,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,iCAAiC,EAAE,GAAG,EAAE;IAC/C,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1C,MAAM,WAAW,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC;QAC7D,MAAM,GAAG,GAAG,IAAA,uCAAoB,EAAC,OAAO,EAAE,WAAW,EAAE,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC;QAC3E,IAAA,eAAM,EAAC,GAAG,CAAC,UAAU,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC1C,IAAA,eAAM,EAAC,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,CAAC;IAC9E,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,sCAAsC,EAAE,GAAG,EAAE;IACpD,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;QACjD,MAAM,WAAW,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;QACxE,MAAM,GAAG,GAAG,IAAA,uCAAoB,EAAC,OAAO,EAAE,WAAW,EAAE,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC;QAC3E,wCAAwC;QACxC,MAAM,aAAa,GAAG,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;QAC9C,IAAA,eAAM,EAAC,GAAG,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/ctl/check.test.d.ts

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

package/dist/tests/ctl/check.test.d.ts.map

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