tla-ts 0.0.3-dev.949cce6 → 0.0.3-dev.974cfcb
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/transfer.cjs +6 -6
- package/dist/transfer.js +6 -6
- package/package.json +1 -1
- package/src/live-check.ts +47 -13
package/dist/transfer.cjs
CHANGED
|
@@ -407,15 +407,15 @@ _CheckName(name) ==
|
|
|
407
407
|
_PrintCounts == PrintT(_Counts)
|
|
408
408
|
=============================================================================
|
|
409
409
|
`]]),Su=/* @__PURE__ */ new Map([[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])]]),Cu=(e,t)=>e.every(e=>Qt(e,t)),wu=ft([!1,!0]),Tu=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return _t(Tu(e,t,r),Tu(e,r,n))},Eu=[`\\cup`,`\\cap`,`\\`],Du=e=>typeof e==`object`&&e.kind===`MixedSet`,Ou=e=>e.kind===`Interval`?B(e).elements:e.elements,ku=(e,t,n)=>{let r=Ou(t);if(e!==`\\cup`){let t=e===`\\cap`;return pt(r.filter(e=>Qt(e,n)===t))}if(r.length===0)return n;if(!de(n))return{kind:`SetOperation`,operator:e,left:t,right:n};let i=B(n).elements.filter(e=>!Qt(e,t));return pt([...r,...i])},Au=[Yn(`TRUE`,!0),Yn(`FALSE`,!1),Yn(`BOOLEAN`,wu),Yn(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),Qn(`=`,ut),Qn(`#`,(e,t)=>!ut(e,t)),K(`~`,1,e=>!Vn(e,0,`~`)),K(`<=>`,2,e=>Vn(e,0,`<=>`)===Vn(e,1,`<=>`)),K(`/\\`,2,e=>Vn(e,0,`/\\`)&&Vn(e,1,`/\\`)),K(`\\/`,2,e=>Vn(e,0,`\\/`)||Vn(e,1,`\\/`)),K(`=>`,2,e=>!Vn(e,0,`=>`)||Vn(e,1,`=>`)),K(`\\in`,2,e=>Qt(G(e,0,`\\in`),G(e,1,`\\in`))),K(`\\notin`,2,e=>!Qt(G(e,0,`\\notin`),G(e,1,`\\notin`))),K(`\\subseteq`,2,e=>{let t=Hn(e,0,`\\subseteq`),n=Hn(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&z(t.base)?Cu(B(t.base).elements,n.base):Cu(B(t).elements,n)}),...Eu.map(e=>K(e,2,t=>{let n=Hn(t,0,e),r=Hn(t,1,e);return de(n)&&de(r)&&!Du(n)&&!Du(r)?e===`\\cup`&&V(n)?r:(e===`\\cup`?_t:e===`\\cap`?gt:ht)(B(n),B(r)):de(n)?ku(e,n,r):e!==`\\`&&de(r)?ku(e,r,n):{kind:`SetOperation`,operator:e,left:n,right:r}})),K(`SUBSET`,1,e=>({kind:`Subset`,base:Hn(e,0,`SUBSET`)})),K(`UNION`,1,e=>{let t=Hn(e,0,`UNION`),n=Qe(t)?t.elements.filter(Qe):[];if(!Qe(t)||n.length!==t.elements.length)return{kind:`Union`,base:t};if(Du(t)||n.some(Du)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{Qt(t,e)||e.elements.push(t)})),pt(e.elements)}return n.length===0?mt:Tu(n.map(B),0,n.length)}),K(`DOMAIN`,1,e=>{let t=G(e,0,`DOMAIN`);if(!M(t))throw new u(`DOMAIN expects a function but received ${U(t)}`);return sn(t)})],ju=lr(`DotDot`,`IntervalValue`,2),Mu=lr(`Neg`,`IntValue`,1),Nu=[Yn(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),ur(`+`,`Plus`,(e,t)=>e+t),ur(`-`,`Minus`,(e,t)=>e-t),ur(`*`,`Times`,(e,t)=>e*t),ur(`^`,`Expt`,(e,t)=>{if(t<0)throw new d(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new d(`0^0 is undefined.`);return e**t}),ur(`\\div`,`Divide`,(e,t)=>{if(t===0)throw new d(`The second argument of \\div is 0.`);let n=Math.floor(e/t);if($n(n))throw er(`${e} \\div ${t}`);return n}),ur(`%`,`Mod`,(e,t)=>{if(t<=0)throw new d(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),fr(`<`,(e,t)=>e<t),fr(`>`,(e,t)=>e>t),fr(`<=`,(e,t)=>e<=t),fr(`>=`,(e,t)=>e>=t),K(`..`,2,e=>({kind:`Interval`,low:cr(G(e,0,`..`),ju),high:cr(G(e,1,`..`),ju)}))],Pu=[Yn(`Int`,{kind:`InfiniteSet`,name:`Int`}),K(`-.`,1,e=>{let t=cr(G(e,0,`-`),Mu);if($n(-t))throw er(`-${t}`);return-t})],Fu=(e,t,n)=>{let r=G(e,t,n),i=Yt(r);if(!i)throw new d(`${n}\n${U(r)}`);return i},Iu=(e,t,n)=>{let r=G(e,t,n);return typeof r==`string`?r:Fu(e,t,n)},Lu=(e,t,n)=>typeof e==`string`?Ee(e.slice(t,n)):R(e.slice(t,n)),Ru=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,zu=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Bu=(e,t)=>{let n=Su.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?sr(e,t):e}):t},Vu=Bu(`Sequences`,[K(`Seq`,1,e=>({kind:`SequenceSet`,base:G(e,0,`Seq`)})),K(`Len`,1,e=>Iu(e,0,Ru(``,`Len`)).length),K(`\\o`,2,e=>{let t=Iu(e,0,zu(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=Fu(e,1,zu(`t \\o s`,`sequence`));return R([...t,...n])}let n=G(e,1,`\\o`);if(typeof n!=`string`)throw new d(`${zu(`t \\o s`,`string`)}\n${U(n)}`);return Ee(t+n)}),K(`Append`,2,e=>R([...Fu(e,0,zu(`Append(s, v)`,`sequence`)),G(e,1,`Append`)])),K(`Head`,1,e=>{let t=Fu(e,0,Ru(``,`Head`));if(t.length===0)throw new d(`Attempted to apply Head to the empty sequence.`);return t[0]}),K(`Tail`,1,e=>{let t=Iu(e,0,Ru(``,`Tail`));if(t.length===0)throw new d(`Attempted to apply Tail to the empty sequence.`);return Lu(t,1)}),K(`SubSeq`,3,e=>{let t=Iu(e,0,Ru(`first `,`SubSeq`)),n=Bn(e,1,`SubSeq`),r=Bn(e,2,`SubSeq`);if(n>r)return Lu(t,0,0);let i=n<1?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new d(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${U(G(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return Lu(t,n-1,r)}),Xn(`SelectSeq`,2,e=>{let t=Jn(e,1,`SelectSeq`);return R(Fu(e,0,Ru(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new d(`The second argument of SelectSeq should be a operator, but instead it is:\n${U(n)}`);return n}))})]),Hu=Bu(`FiniteSets`,[K(`IsFiniteSet`,1,e=>{let t=G(e,0,`IsFiniteSet`);if(j(t))return qt(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new u(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${U(t)}\nis a finite set.`:`Attempted to check if the ${fe(t)} ${U(t)} is a finite set.`)}),K(`Cardinality`,1,e=>{let t=G(e,0,`Cardinality`);if(!j(t)||typeof t==`object`&&(t.kind===`InfiniteSet`||t.kind===`SequenceSet`))throw new d(`Attempted to compute cardinality of the value\n${U(t)}`);return Gt(t)})]),Uu=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]],[`Sequences`,[`Naturals`]],[`FiniteSets`,[`Naturals`,`Sequences`]],[`TLC`,[`Naturals`,`Sequences`,`FiniteSets`]],[`Randomization`,[`Naturals`,`FiniteSets`,`Sequences`]],[`_Possible`,[`TLC`,`TLCExt`,`Naturals`,`Sequences`,`FiniteSets`,`Integers`]],[`Json`,[`Sequences`,`FiniteSets`,`TLC`,`Naturals`]],[`Bags`,[`Naturals`]],[`TLCExt`,[`TLC`,`Integers`,`Naturals`,`Sequences`,`FiniteSets`]]]),Wu=(e,t,n,r)=>{switch(e){case`Naturals`:return{extends:[],operators:Nu};case`Integers`:return{extends:[`Naturals`],operators:Pu};case`Sequences`:return{extends:[],operators:Vu};case`FiniteSets`:return{extends:[],operators:Hu};case`TLC`:return{extends:[],operators:Bu(`TLC`,hu(t,n))};case`Randomization`:return{extends:[],operators:Kl(n)};case`_Possible`:return{extends:[],operators:su(t,n)};case`Json`:return{extends:[],operators:Bl(r)};case`Bags`:return{extends:[],operators:yl};case`TLCExt`:return{extends:[],operators:ou(t,n)};default:return}},Gu=`$subexpression`,Ku=(e,t)=>new c(`${e} at line ${t.line}, column ${t.column}`),qu=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Ju=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,Yu=e=>{switch(e.kind){case`Apply`:return e.args;case`And`:case`Or`:return e.operands;case`If`:return[e.condition,e.consequent,e.alternative];case`Tuple`:case`SetEnumeration`:return e.elements;case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`FunctionApplication`:return[e.function,e.args.length===1?e.args[0]:{kind:`Tuple`,elements:e.args,location:e.location}];case`FieldAccess`:return[e.record,{kind:`String`,value:e.field,location:e.location}];case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`FunctionSet`:return[e.domain,e.range];case`Product`:return e.factors;case`Except`:return[e.function];default:return}},Xu=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Lr(e.bounds),body:e.body,sets:qu(e.bounds)};case`SetMap`:return{names:Lr(e.bounds),body:e.expression,sets:qu(e.bounds)};case`SetFilter`:return{names:Ir(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Ir(e.pattern),body:e.body,sets:e.set?[e.set]:[]};case`UnboundedQuantifier`:case`Lambda`:return{names:e.kind===`Lambda`?e.params:e.names,body:e.body,sets:[]};default:return}},Zu=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Zu(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of In(e)){let e=Zu(r,t,n);if(e)return e}},Qu=(e,t,n)=>e.length===0&&n.length>0?n.splice(0,t):e,$u=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),ed=(e,t)=>{let n=e.location,r=$u(t,e.lets,n);if(e.params.length===0)return r;if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw Ku(`Selected an operator with operator parameters as an argument`,n);return{kind:`Lambda`,params:e.params.map(e=>e.name),body:r,location:n}}if(e.args.length!==e.params.length)throw Ku(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:Gu,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:Gu,args:e.args,location:n,resolution:Er},location:n}},td=(e,t)=>{let n=t.location,r=e.kind===`Operator`?e.params.map((e,n)=>({name:`${e.name}$${t.params.length+n}`,arity:e.arity})):[],i=r.map(e=>({kind:`Identifier`,name:e.name,location:n,resolution:Er})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Er}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Er};return ed({...t,params:[...t.params,...r]},a)},nd=(e,t,n,r)=>{let i={params:[],args:[],lets:[],location:n},a={index:0,current:void 0},o=i=>{let o=[],s=[];for(;a.index<e.length;){let c=e[a.index];if(c.kind!==`Name`)throw Ku(`Expected an operator name`,n);o.push(c.name),s.push(...c.args);let l=o.join(`!`),u=i?i.find(e=>yi(e)===l):t(l);if(u)return{definition:u,args:Qu(s,jr(u),r)};a.index++}throw Ku(`Unknown operator ${o.join(`!`)}`,n)},s=t=>{let r=o(t),s=r.definition,c=jr(s),l=a.index===e.length-1;if(r.args.length!==c&&r.args.length!==0)throw Ku(`The operator ${s.name} requires ${c} arguments`,n);if(l)return{definition:s,args:r.args};if(s.kind!==`Operator`)throw Ku(`Cannot select a subexpression of ${s.name}`,n);i.params.push(...s.params),i.args.push(...r.args),a.current=s.body,a.index++},c=()=>{for(;a.index<e.length;){let t=e[a.index];if(t.kind!==`Name`)return;let o=a.current&&Zu(a.current,t.name,[]);if(!o)throw Ku(`Cannot find label ${t.name}`,n);i.lets.push(...o.lets),i.params.push(...o.label.params.map(e=>({name:e,arity:0}))),i.args.push(...Qu(t.args,o.label.params.length,r)),a.current=o.label.body,a.index++}},l=t=>{let o=a.current;if(!o)throw Ku(`Subexpression selection failed`,n);if(t.kind===`Colon`)return;if(o.kind===`Label`){a.current=o.body,l(t);return}if(o.kind===`Let`){if(t.kind!==`Operand`||Ju(t.operand,1)!==0)throw Ku(`A LET/IN expression has only one operand`,n);i.lets.push(o.definitions),a.current=o.body;return}let s=Xu(o);if(s&&(t.kind===`Bound`||t.kind===`At`)){i.params.push(...s.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&i.args.push(...Qu(t.args,s.names.length,r)),a.current=s.body;return}if(o.kind===`Case`&&t.kind===`Operand`){let r=[...o.arms,...o.other?[{condition:void 0,body:o.other}]:[]],i=r[Ju(t.operand,r.length)],s=e[a.index+1];if(!i||s?.kind!==`Operand`)throw Ku(`A subexpression of CASE must have the form !i!j`,n);a.index++;let c=Ju(s.operand,2),l=c===0?i.condition:c===1?i.body:void 0;if(!l)throw Ku(`Nonexistent CASE operand`,n);a.current=l;return}if(t.kind!==`Operand`)throw Ku(`Unexpected subexpression selector`,n);let c=s?s.sets:Yu(o),u=c?.[Ju(t.operand,c.length)];if(!u)throw Ku(`Nonexistent operand specified by the selector`,n);a.current=u},u=s(void 0);if(u)return td(u.definition,{...i,args:u.args});for(c();a.index<e.length;){let t=e[a.index];if(t.kind===`Name`){for(;a.current?.kind===`Label`;)a.current=a.current.body;if(a.current?.kind!==`Let`)throw Ku(`A name selector here must be from a LET clause`,n);i.lets.push(a.current.definitions);let e=s(a.current.definitions);if(e)return td(e.definition,{...i,args:[...i.args,...e.args]});c()}else l(t),a.index++}if(!a.current)throw Ku(`Subexpression selection failed`,n);return ed(i,a.current)},rd=(e,t)=>{if(!e.includes(`!`)||t(e))return;let n=e.split(`!`),r=n.findIndex((e,r)=>t(n.slice(0,r+1).join(`!`)));if(r!==-1)return[{kind:`Name`,name:n.slice(0,r+1).join(`!`),args:[]},...n.slice(r+1).map(e=>({kind:`Name`,name:e,args:[]}))]},id=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||In(e).some(id),ad=(e,t)=>{if(!id(e))return e;if(e.kind===`Let`){let n=n=>e.definitions.find(e=>e.name===n)??t(n);return Si(e,e=>ad(e,n))}let n=Si(e,e=>ad(e,t));if(n.kind===`Subexpression`)return nd(n.selectors,t,n.location,[]);let r=n.kind===`Identifier`?n.name:n.kind===`Apply`?n.operator:``,i=rd(r,t);if(!i)return n;let a=n.kind===`Apply`?[...n.args]:[],o=nd(i,t,n.location,a);if(a.length>0)throw Ku(`Too many arguments for ${r}`,n.location);return o},od=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},sd=(e,t)=>{let n=od(t.definitions);return{...e,substitutions:e.substitutions.map(e=>({name:e.name,expression:ad(e.expression,n)}))}},cd=(e,t)=>{let n=od([...t,...e.definitions]);return e.definitions.some(e=>id(e.body))||e.assumptions.some(e=>id(e.expression))?{...e,definitions:e.definitions.map(e=>xi(e,e=>ad(e,n))),assumptions:e.assumptions.map(e=>({...e,expression:ad(e.expression,n)}))}:e},ld=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),ud=(e,t)=>`${e}${t}`,dd=(e,t,n)=>`${e}${t}${n}`,fd=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},pd=(e,t,n)=>`${e},${t},${n}`,md=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),hd=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),gd=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),_d=(e,t,n,r)=>({...md(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),vd=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,yd=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,bd=new Map([[`=`,0,[2,2],[1,1]],[`#`,0,[2,2],[1,1]],[`\\in`,0,[2,2],[1,1]],[`\\notin`,0,[2,2],[1,1]],[`\\subseteq`,0,[2,2],[1,1]],[`\\cup`,0,[2,2],[1,1]],[`\\cap`,0,[2,2],[1,1]],[`\\`,0,[2,2],[1,1]],[`=>`,0,[3,3],[1,1]],[`<=>`,0,[3,3],[1,1]],[`/\\`,0,[3,3],[1,1]],[`\\/`,0,[3,3],[1,1]],[`~`,0,[3],[1]],[`SUBSET`,0,[2],[1]],[`UNION`,0,[2],[1]],[`DOMAIN`,0,[2],[1]],[`~>`,3,[3,3],[0,0]],[`-+->`,3,[3,3],[0,0]],[`\\cdot`,2,[2,2],[0,0]],[`TRUE`,0,[],[]],[`FALSE`,0,[],[]],[`BOOLEAN`,0,[],[]],[`STRING`,0,[],[]]].map(([e,t,n,r])=>[e,{..._d(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),xd=_d(`$Set`,0,[2],[1]),Sd=_d(`$Junction`,0,[3],[1]),Cd=_d(`$Choose`,0,[2],[1]),wd=_d(`$Function`,0,[3],[1]),Td=_d(`$FcnApply`,0,[2,2],[1,1]),Ed=_d(`$RcdSelect`,0,[2,0],[1,1]),Dd=_d(`'`,2,[1],[0]),Od=_d(`ENABLED`,1,[2],[0]),kd=_d(`[]`,3,[3],[0]),Ad=_d(`$SquareAct`,2,[2,1],[0,0]),jd=_d(`$WF`,3,[1,2],[0,0]),Md=_d(`$TemporalExists`,3,[3],[0]),Nd=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Pd=e=>e.map(e=>({name:e,arity:0})),Fd=(e,t)=>new c(`${e} at line ${t.line}, column ${t.column}`),Id=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Ld=e=>e.kind!==`Let`&&e.kind!==`Label`,Rd=e=>{let t=/* @__PURE__ */ new Map,n=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:_(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i)return{kind:`Defined`,levels:_(i,/* @__PURE__ */ new Map)};let a=bd.get(t)??ld.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=md(Math.max(t,...n.map(e=>e.data.level)));return r.params.add(e),n.forEach((t,n)=>{t.data.params.forEach(t=>{r.params.add(t),r.argParams.add(dd(e,n,t))}),t.data.constraints.forEach((e,t)=>hd(r.constraints,t,e)),gd(r.argConstraints,ud(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>gd(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},i=(e,t,n=[],r=[])=>{let i=e=>r.includes(e);if(t.forEach((t,n)=>{if(!(t.operator||t.declared)&&t.data.level>vd(e,n))throw new c(`Level error in applying operator ${e.name}: The level of argument ${n+1} exceeds the maximum level allowed by the operator.`)}),n.some(e=>e.level>2))throw new c(`Level error in applying operator ${e.name}: The level of the range for a bounded variable exceeds the maximum level allowed by the operator.`);let a=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},o=(t,n,r)=>e.conditions.has(pd(t,n,r)),s=md(Math.max(e.level,...t.filter((t,n)=>yd(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>s.params.add(e)),t.forEach((t,n)=>{yd(e,n)===1&&t.data.params.forEach(e=>s.params.add(e))}),n.forEach(e=>e.params.forEach(e=>s.params.add(e))),r.forEach(e=>s.params.delete(e)),e.constraints.forEach((e,t)=>hd(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||hd(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>hd(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||hd(s.constraints,t,vd(e,n))})),t.forEach((e,n)=>{let r=e.operator;r&&t.forEach((e,t)=>r.formals.forEach((i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>hd(s.constraints,e,vd(r,a)))}))}),e.argParams.forEach(e=>{let t=fd(e),n=a(t.operator)?.operator;n&&hd(s.constraints,t.param,vd(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>gd(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>gd(s.argConstraints,ud(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&gd(s.argConstraints,ud(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=fd(e),n=a(t.operator);n&&gd(s.argConstraints,ud(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(fd(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=fd(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(dd(n.declared.name,t.index,t.param));else{let n=a(t.param);if(!n){s.argParams.add(e);return}n.data.params.forEach(e=>s.argParams.add(dd(t.operator,t.index,e)))}}),t.forEach((e,n)=>{let r=e.declared;r&&t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>s.argParams.add(dd(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=g(`LAMBDA`,Pd(e.params),e.body,t);return{data:n,operator:n}}let r=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(r!==void 0){let i=n(r,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{data:i.levels,operator:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=md();return e.params.add(r),{data:e,declared:{name:r,arity:i.arity}}}}return{data:m(e,t)}},o=(e,t)=>e.map(e=>a(e,t)),s=(e,t,n,r=[],a=[])=>{let s=Nd(n,Pd(a));return i(e,o(t,s),r.map(e=>m(e,n)),a)},l=(e,t)=>e.kind===`Declared`?r(e.name,e.level,t):i(e.levels,t),u=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw Fd(`Formula has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw Fd(`Action used where only temporal formula or state predicate allowed`,e.location);Id.has(e.operator)&&u(t,e.location)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Ld(n)&&n.kind!==r)throw Fd(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e.location)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>{let t=_(e,n);t.constraints.forEach((e,t)=>hd(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>gd(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return md();case`Identifier`:return l(n(e.name,t),[]);case`Apply`:{let r=o(e.args,t);return d(e,r),l(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return a(e,t).data;case`And`:case`Or`:{let n=o(e.operands,t);return u(n,e.location),i(Sd,n)}case`Prime`:case`Unchanged`:return s(Dd,[e.expression],t);case`Enabled`:return s(Od,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i(kd,[n])}case`If`:return s(Sd,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(Sd,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=s(Sd,[e.body],t,e.bounds.map(e=>e.set),Lr(e.bounds));if(n.level===3&&e.bounds.some(e=>m(e.set,t).level===2))throw Fd(`Action-level bound of quantified temporal formula`,e.location);return n}case`UnboundedQuantifier`:return s(e.isTemporal?Md:Sd,[e.body],t,[],e.names);case`Choose`:return s(Cd,[e.body],t,e.set?[e.set]:[],Ir(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(xd,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(xd,[e.predicate],t,[e.bound.set],Ir(e.bound.pattern));case`SetMap`:return s(xd,[e.expression],t,e.bounds.map(e=>e.set),Lr(e.bounds));case`FunctionConstruction`:return s(wd,[e.body],t,e.bounds.map(e=>e.set),Lr(e.bounds));case`Record`:return s(wd,e.fields.map(e=>e.value),t);case`RecordSet`:return s(xd,e.fields.map(e=>e.value),t);case`Except`:return s(xd,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(Td,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(xd,e.args,t)}]);case`FieldAccess`:return i(Ed,[a(e.record,t),{data:md()}]);case`BoxAction`:case`AngleAction`:return s(Ad,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(jd,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return md()}},h=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>h(e,a,n,i),o=(e,o)=>{let s=n(e,t);s.kind===`Declared`?(r&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,r||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return In(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,Nd(t,Pd(e.names))),i;default:return Si(e,(e,n)=>(a(e,r,Nd(t,Pd(n))),e)),i}},g=(e,t,n,r)=>{let i=Nd(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=h(n,i),c={...md(a.level),name:e,formals:t,nonLeibniz:new Set(t.flatMap((e,t)=>s.has(e.name)?[t]:[])),maxLevels:t.map(e=>Math.min(3,a.constraints.get(e.name)??3)),weights:t.map(e=>+!!a.params.has(e.name)),minMaxLevels:t.map(e=>Array.from({length:e.arity},(t,n)=>a.argConstraints.get(ud(e.name,n))??0)),conditions:new Set(t.flatMap((e,n)=>t.flatMap((t,r)=>Array.from({length:e.arity},(e,t)=>t).filter(n=>a.argParams.has(dd(e.name,n,t.name))).map(e=>pd(n,r,e)))))};return a.params.forEach(e=>{o(e)||c.params.add(e)}),a.constraints.forEach((e,t)=>{o(t)||c.constraints.set(t,e)}),a.argConstraints.forEach((e,t)=>{o(fd(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=fd(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},_=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...md(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=g(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:_,toOperand:a}},zd=(e,t,n)=>{let r=new Map(t);e.assumptions.forEach(e=>{e.kind===`NewSymbol`?(e.set&&n.analyze(e.set,r),r.set(e.name,{kind:`Formal`,arity:e.arity})):e.kind===`AssumeProve`?zd(e,r,n):n.analyze(e,r)}),n.analyze(e.conclusion,r)},Bd=(e,t)=>{let n=Rd(t);e.definitions.filter(e=>!e.name.includes(`!`)).forEach(e=>n.analyzeDefinition(e,/* @__PURE__ */ new Map)),e.assumptions.forEach(e=>n.analyze(e.expression,/* @__PURE__ */ new Map)),e.theorems.forEach(e=>e.statement.kind===`AssumeProve`?zd(e.statement,/* @__PURE__ */ new Map,n):n.analyze(e.statement,/* @__PURE__ */ new Map))},Vd=(e,t)=>e.maxLevels[t]??3,Hd=(e,t)=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=Rd({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return n.set(e,a),a},i=/* @__PURE__ */ new Map,a=e=>{let n=i.get(e);if(n)return n;let a=t(e),o=r(e),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>hd(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>hd(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>gd(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=fd(e);t(n.operator,n.param)&&c.argParams.add(e)})};return s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n))),a.assumptions.forEach(e=>l(o.analyze(e,/* @__PURE__ */ new Map),()=>!0)),i.set(e,c),c},o=/* @__PURE__ */ new Set;if(e.forEach(e=>{let n=`at line ${e.location.line}, column ${e.location.column}`,i=e=>o.add(`${e} ${n}`),s=t(e.module),c=a(e.module),l=r(e.instancer),u=/* @__PURE__ */ new Map;e.lets.forEach(e=>u.set(e.name,{kind:`Let`,definition:e,scope:u}));let d=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(t=>{let n=e.substitutions.get(t.name);if(!n)return[];if(t.arity===0){let e=l.analyze(n,u);return[{...t,level:e.level,operator:void 0,isLeibniz:!0}]}let r=l.toOperand(n,u);return[{...t,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),f=(t,n)=>`Level error in instantiating module '${e.module}': the level of the expression or operator substituted for '${t}' must be at most ${n}`;d.forEach(t=>{!c.isConstant&&t.level>t.maximumLevel&&i(f(t.name,t.maximumLevel)),t.isLeibniz||i(`Error in instantiating module '${e.module}': a non-Leibniz operator substituted for '${t.name}'`)}),d.forEach(t=>{let n=c.constraints.get(t.name);n!==void 0&&t.level>n&&i(f(t.name,n));let r=t.operator;r&&Array.from({length:t.arity},(n,a)=>{let o=c.argConstraints.get(ud(t.name,a));o!==void 0&&Vd(r,a)<o&&i(`Level error in instantiating module '${e.module}': the level of the argument ${a+1} of the operator ${r.name} must be at least ${o}`)})}),c.argParams.forEach(t=>{let n=fd(t),r=d.find(e=>e.name===n.operator)?.operator,a=d.find(e=>e.name===n.param);if(!r||!a)return;let o=Vd(r,n.index);a.level>o&&i(`Level error when instantiating module '${e.module}': the level of the argument ${n.index} of the operator ${n.operator}' must be at most ${o}`)})}),o.size>0)throw new c([...o].join(`
|
|
410
|
-
`))},Ud=t=>{switch(t.kind){case`Number`:try{return pe(t.value)}catch(t){throw n(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return Pe(t.name);case`Set`:return ft(t.elements.map(Ud))}},Wd=e=>[...e.constants,...e.variables.map(e=>({name:e,arity:0}))],Gd=e=>new c(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),Kd=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:Er},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),qd=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>U(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new u(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&Le(t,r)})});if(t)return t[1];throw new u(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:U(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},Jd=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||In(e).some(e=>Jd(e,t)),Yd=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(ji(e),n.get(e)??n.size)),n},Xd=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),Zd=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Ka(e);if(e.kind===`Number`&&!Io(e.value))throw qa(e);Zd(e.kind===`Let`?[...In(e),...Xd(e.instances??[])]:In(e))}),Qd=(e,t)=>{let n=hc(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=new Map(Au.map(e=>[e.name,e])),s=/* @__PURE__ */ new Map,d=Xc(e.checkDeadlock,t.seed),f=/* @__PURE__ */ new Map,p=/* @__PURE__ */ new Map,m=[],h=/* @__PURE__ */ new Map,g=[],_=[],v=(e,t)=>g.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),y={value:0},ee=e=>`${e}#${y.value++}`,b=[],x=/* @__PURE__ */ new Map,te=e=>{let n=s.get(e);if(n)return n;let r=Wu(e,t.print,d,t.files);if(!r)return;let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>te(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(e=>{o.set(e.name,e),i.set(e.name,{key:e.name,arity:e.arity})}),s.set(e,i),i},ne=e=>{let t=te(e);return t&&v(e,Uu.get(e)??[]),t},re=e=>(Zd([...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...Xd(e.instances)]),e.modules.forEach(re),e);re(n);let S=(e,n)=>{let r=t.loadModule?.(e)??Is.get(e)??pc(t.source,e);if(r===void 0)throw new c(`Cannot find source file for module ${e} imported in module ${n}.`);let i=hc(r);if(i.name!==e)throw new c(`File name '${e}' does not match the name '${i.name}' of the top level module it contains.`);return re(i)},ie=e=>{let t=_.indexOf(e.name);if(t!==-1)throw new c(`Circular dependency among .tla files; dependency cycle is: ${[..._.slice(t),e.name].map(e=>`${e}.tla`).join(` --> `)}`);let n=/* @__PURE__ */ new Set,r=[];_.push(e.name),g.push(n);let i=se(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r});g.pop(),_.pop();let a=r.find(e=>n.has(e.name));if(a)throw Gd(a);return{linked:i,closure:n}},C=(e,t)=>{let n=f.get(e);if(n)return v(e,h.get(e)??[]),n;let r=ie(S(e,t));return f.set(e,r.linked),h.set(e,r.closure),v(e,r.closure),r.linked},ae=(e,t,n,o,s)=>{let c=s?void 0:ne(e.module);if(c)return e.name===void 0?c:new Map([...c].map(([t,n])=>[`${e.name}!${t}`,n]));let l=s??C(e.module,t.name),u=Wd(l),d=`#${y.value++}`,f=new Map(e.params.map(e=>[e.name,`${e.name}${d}`])),p=fi(sd(e,t),u,t,n);b.push({module:e.module,instancer:t.name,lets:[],substitutions:p,location:e.location});let m=Ui({params:e.params.map(e=>({...e,name:`${e.name}${d}`})),substitutions:new Map([...p].map(([e,t])=>[e,gi(t,f)])),variables:new Set(l.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(n,s,c)=>{let l=ee(`${s}@${t.name}`);return r.set(l,c(l)),i.set(l,!o),a.set(l,{source:n,prefix:e.params.length}),l},createName:ee}),h=new Set(u.map(e=>e.name)),g=/* @__PURE__ */ new Map;return l.exported.forEach((t,n)=>{if(h.has(n))return;if(e.name===void 0){let r=m.getKey(t.key);u.length>0&&x.set(r,{name:n,location:e.location}),g.set(n,{key:r,arity:t.arity});return}let r=m.getQualifiedKey(t.key);u.length>0&&x.set(r,{name:`${e.name}!${n}`,location:e.location}),g.set(`${e.name}!${n}`,{key:r,arity:t.arity+e.params.length})}),g},w=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:Er})),oe=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:w(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),T=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),E=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=T(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:w(r,n),location:n}}},D=(e,t,n,a)=>{let o=e.location,s=a?void 0:ne(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=T(n.arity);return oe(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=a??C(e.module,n),l=`#${y.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=Wd(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};b.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:o});let p=new Set(e.params.map(e=>e.name)),m=e=>Jd(f(e),p),h=d.map(t=>{let n=E(f(t),t,o);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:o}}),g=[],_=Ui({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:w(e.params,o),location:o,resolution:Er}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:Er}])),variables:new Set(c.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:Kd(a,i)),i},createName:ee}),v=new Set(d.map(e=>e.name)),x=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),i=T(n.arity),a=[...e.params,...i];return oe(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...g,...x]},O=e=>[...e].flatMap(([e,t])=>{let n=r.get(t.key);return n?[{...n,name:e}]:[]}),se=(e,a)=>{let o=Ws(e,t.loadClass?.(e.name)),s=new Map([...Au.map(e=>[e.name,{key:e.name,arity:e.arity}]),...a.symbols]),c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=[],d=[...o.constants],f=o.variables.map(e=>e.name),h=o.variables.map(e=>e.location),g=(e,t)=>e.forEach((e,n)=>{s.set(n,e),t&&c.set(n,e)});o.extends.forEach(e=>{let t=a.modules.get(e),n=t?void 0:ne(e);if(n){g(n,!0);return}let r=t??C(e,o.name);d.push(...r.constants.filter(e=>d.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{f.includes(e)||(f.push(e),h.push(r.variableLocations[t]))}),g(r.exported,!0),r.modules.forEach((e,t)=>l.set(t,e)),u.push(r)}),o.constants.forEach(e=>c.set(e.name,{key:e.name,arity:e.arity,declaration:`Constant`})),o.variables.forEach(e=>c.set(e.name,{key:e.name,arity:0,declaration:`Variable`}));let _=d.length===0&&f.length===0,v=e=>o===n?e.name:`${e.name}@${a.id}`,y=/* @__PURE__ */ new Map,ee=e=>({imported:s,importedAt:y,definitions:new Map(e.definitions.map(e=>[e.name,e])),getKey:v}),b=()=>new Map([...a.modules,...l]),x=e=>new Map([...s,...[...o.constants.map(e=>({...e,kind:`Constant`})),...o.variables.map(e=>({...e,kind:`Variable`}))].filter(t=>Ar(t.location,e)).map(e=>[e.name,{key:e.name,arity:e.arity,declaration:e.kind}]),...o.definitions.filter(t=>Ar(t.location,e)).map(e=>[e.name,{key:v(e),arity:jr(e)}])]),te=e=>{let t=b();if(t.has(e.name))throw Gd(e);a.nested.push(e);let n=se(e,{id:`${a.id}/${e.name}`,symbols:x(e.location),modules:t,nested:a.nested});l.set(e.name,n),p.has(e.name)||p.set(e.name,n)};[...o.instances.map(e=>({location:e.location,link:()=>{let t=ae(e,o,ee(o),_,b().get(e.module));t.forEach((t,n)=>{s.has(n)||y.set(n,e.location)}),g(t,!e.isLocal)}})),...o.modules.map(e=>({location:e.location,link:()=>te(e)}))].sort((e,t)=>Ar(e.location,t.location)?-1:1).forEach(e=>e.link()),ui(o,ee(o));let re=e=>{let t=o.instances.find(t=>t.module===e.name);return t!==void 0&&Ar(e.location,t.location)},S=e=>{let t=o.modules.find(t=>t.name===e.module);return t?re(t)?l.get(t.name):void 0:b().get(e.module)},ie=cd(qi(o,(e,t)=>D(e,t,o.name,S(e))),O(s));pi(ie,ee(ie)),ie.definitions.forEach(e=>{let t=v(e);r.set(t,e),i.set(t,!_);let n={key:t,arity:jr(e)};s.set(e.name,n),e.isLocal||c.set(e.name,n)}),Bd(ie,{constants:new Set(d.map(e=>e.name)),variables:new Set(f),getDefinition:e=>r.get(s.get(e)?.key??e)});let w={module:ie,constants:d,variables:f,variableLocations:h,visible:s,exported:c,modules:l,extended:u};return m.push(w),w},k=ie(n).linked,ce=e=>k.visible.get(e)?.key??e;k.visible.forEach((e,t)=>{let n=r.get(e.key);n&&e.key!==t&&r.set(t,n)});let le=[],ue=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>ue(e,t)),le.push(...e.module.assumptions))};ue(k,/* @__PURE__ */ new Set);let A=k.constants.map(e=>e.name),j=k.variables,de=e=>e.module===void 0?[e.name,ce(e.name)]:e.module===n.name||A.includes(e.name)?[]:[(f.get(e.module)??p.get(e.module))?.visible.get(e.name)?.key??e.name],M=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:k.constants.find(t=>t.name===e)?.arity??0},N=/* @__PURE__ */ new Map,fe=/* @__PURE__ */ new Set,pe=(e,t)=>{o.set(e,t),r.delete(e),N.delete(e),fe.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=Ud(e.value);de(e).forEach(e=>{let n=M(e);n===0?N.set(e,t):pe(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let me=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=me.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new l(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(Ud),Ud(e.value)]),me.set(t,n)}),me.forEach(e=>de(e).forEach(t=>pe(t,qd(e.name,M(t)||e.rows[0][0].length,e.rows))));let he=new Map(e.substitutions.flatMap(e=>de(e).map(t=>[t,ce(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,i=t.target;if(!A.includes(n)&&!k.visible.has(n))throw new l(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===i))throw new l(`In the configuration file, the identifier ${i} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let a=ce(i),s=r.get(a);if(!(s!==void 0||o.has(a)||N.has(a)||A.includes(i)||j.includes(i)))throw new l(`The configuration file substitutes for ${n} with the undefined identifier ${i}.`);if(s?.kind===`Operator`&&s.params.length!==(k.constants.find(e=>e.name===n)?.arity??k.visible.get(n)?.arity))throw new l(`The configuration file substitutes for ${n} with ${i} of different number of arguments.`)});let ge=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(de)),_e=(e,t)=>{if(ge.has(e))return{key:e,prefix:t};let n=a.get(e);return n&&_e(n.source,t+n.prefix)};a.forEach((e,t)=>{let n=_e(e.source,e.prefix),i=r.get(t);if(!n||!i)return;let a=i.kind===`Operator`?i.params:[],o=oe(t,n.key,a,a.slice(n.prefix),i.location);r.set(t,o),k.visible.forEach((e,n)=>{e.key===t&&n!==t&&r.set(n,o)})}),A.forEach(e=>{if(!N.has(e)&&!he.has(e)&&!fe.has(e))throw new l(`The constant ${e} is not assigned a value by the configuration`)});let ve={runtime:d,definitions:r,builtins:o,constants:N,substitutions:he,variables:j,variableIndex:Yd(j,m.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,evaluators:/* @__PURE__ */ new WeakMap};Hd(b,e=>{let t=f.get(e)??p.get(e)??k;return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>r.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),getDefinition:e=>r.get(t.visible.get(e)?.key??e)}});let ye=Rd({constants:new Set(N.keys()),variables:/* @__PURE__ */ new Set([...j,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>o.has(e))]),getDefinition:e=>$a(e,ve)}),be=e=>{try{return X(e,{environment:ve,scope:void 0,state:void 0,next:void 0}),!0}catch(e){if(e instanceof u)return!1;throw e}};return he.forEach((e,t)=>{let n=r.get(e);if(A.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&ye.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0&&!be(n.body))throw new l(`The configuration file substitutes constant ${t} with non-constant ${e}`)}),d.isStarted=!0,{environment:ve,assumptions:le,variableLocations:k.variableLocations,instanceActions:x}},$d={kind:`Boolean`,value:!0},ef={kind:`Boolean`,value:!1},tf=e=>e?$d:ef,nf=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,rf=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,Q=(e,t)=>({kind:e,body:t}),af=(e,t,n)=>({kind:e,operands:[t,n]}),of=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?of(e,t.operands).operands:[t])}),sf=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return sf(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,sf(t)),0)}},cf=e=>{switch(e.kind){case`Action`:return!0;case`Boolean`:case`State`:case`Enabled`:return!1;case`Not`:case`Always`:case`Eventually`:case`Next`:return cf(e.body);case`And`:case`Or`:return e.operands.some(cf)}},lf=/* @__PURE__ */ new WeakMap,uf={count:0},df=e=>{let t=lf.get(e);if(t!==void 0)return t;let n=(()=>{switch(e.kind){case`Boolean`:return String(e.value);case`State`:case`Enabled`:case`Action`:return`#${uf.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(df).join(`,`)})`;default:return`${e.kind}(${df(e.body)})`}})();return lf.set(e,n),n},ff=(e,t)=>e===t||df(e)===df(t),pf=(e,t)=>{let n=df(t);return e.some(e=>e===t||df(e)===n)},mf=e=>e===`And`?`Or`:`And`,hf=(e,t)=>{switch(e.kind){case`Boolean`:return t?tf(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?Q(`Not`,e):e;case`Not`:return hf(e.body,!t);case`And`:case`Or`:return of(t?mf(e.kind):e.kind,e.operands.map(e=>hf(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return Q(n,hf(e.body,t))}}},gf=e=>{switch(e.kind){case`Boolean`:return tf(!e.value);case`Not`:return e.body;case`And`:case`Or`:return of(mf(e.kind),e.operands.map(gf));case`Always`:return Q(`Eventually`,gf(e.body));case`Eventually`:return Q(`Always`,gf(e.body));default:return Q(`Not`,e)}},_f=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=_f(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return tf(t)}return n.length===0?tf(!t):n.length===1?n[0]:of(e.kind,n)}case`Not`:{let t=_f(e.body);return t.kind===`Boolean`?tf(!t.value):Q(`Not`,t)}case`Always`:case`Eventually`:{let t=_f(e.body);return Q(e.kind,t.kind===e.kind?t.body:t)}default:return e}},vf=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,yf=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=yf(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new u(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form`);t.push(e)}}if(n.value===1)return{kind:`And`,operands:t};let r=Array.from({length:n.value},()=>[]),i={groups:1,repeat:n.value};for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}i.repeat/=e.operands.length;let t={value:0};for(let n=0;n<i.groups;n++)for(let n of e.operands)for(let e=0;e<i.repeat;e++)r[t.value++].push(n);i.groups*=e.operands.length}return{kind:`Or`,operands:r.map(e=>of(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=yf(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=vf(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:of(`Or`,t);n.push(Q(`Always`,Q(`Eventually`,e)))}return of(`Or`,n)}case`Not`:return nf(e.body)?e:yf(gf(e.body));default:return e}},bf=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?bf(e.operands[0]):of(e.kind,e.operands.map(bf));case`Not`:return e.body.kind===`Not`?bf(e.body.body):Q(`Not`,bf(e.body));case`Always`:case`Eventually`:case`Next`:return Q(e.kind,bf(e.body));default:return e}},xf=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return xf(e.operands[0]);let t=Math.floor(e.operands.length/2);return af(e.kind,xf(of(e.kind,e.operands.slice(0,t))),xf(of(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return Q(e.kind,xf(e.body));default:return e}},Sf=(e,t)=>{e.kind===`Eventually`&&!pf(t,e)&&t.push(e),`body`in e&&Sf(e.body,t),`operands`in e&&e.operands.forEach(e=>Sf(e,t))},Cf=e=>{let t=e.filter(rf),n=e.flatMap(e=>e.kind===`Not`&&rf(e.body)?[e.body]:[]);return!t.some(e=>pf(n,e))},wf=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,Q(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new u(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Tf=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:Q(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Ef=(e,t,n)=>e.flatMap(e=>{let r=Tf(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Df=e=>[...new Set(e.map(df))].sort().join(`|`),Of=(e,t)=>{let n=new Set(t.map(Df));return[...e.filter(e=>!n.has(Df(e))),...t]},kf=e=>{let t=wf(e),n=Ef(t,`Always`,`And`),r=Ef(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Tf(t,`Eventually`,`Or`);if(n&&!(pf(e,n.first)||pf(e,n.second)))return Of(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(pf(e,t.first)||pf(e,t.second))&&!pf(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Cf(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Tf(t[e],`Always`,`And`);n&&(pf(t,n.first)||t.push(n.first),pf(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)pf(t,e.first)&&pf(t,e.second)&&!pf(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!Cf(t)?[]:i(t)};return a(e)},Af=e=>({particle:e,successors:[],statePredicates:e.filter(e=>sf(e)<=1)}),jf=e=>{let t=kf([e]).map(Af),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Df(e.particle);r.has(n)||r.set(n,t)});for(let e=0;e<t.length;e++){let n=t[e].particle.flatMap(e=>e.kind===`Next`?[e.body]:[]);for(let i of kf(n)){let n=Df(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Af(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Mf=(e,t)=>!pf(e,t)||pf(e,t.body),Nf=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&sf(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=vf(e);if(n){let e=sf(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(cf(e))throw new u(`TLC cannot handle the temporal formula: actions may only appear as []<>A or <>[]A`);t.formulas.push(e)},Pf=(e,t)=>{let n=e.findIndex(e=>ff(e,t));return n===-1?(e.push(t),e.length-1):n},Ff=e=>{let t=yf(_f(hf(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=bf(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Nf(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:of(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:ff(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&xf(e.formula),n=[];t&&Sf(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Pf(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Pf(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Pf(i,e))}));return{tableau:t&&jf(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},If=/* @__PURE__ */ new Set([`~>`,`-+->`]),Lf=/* @__PURE__ */ new WeakMap,Rf=/* @__PURE__ */ new WeakSet,zf=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Bf=e=>new u(`TLC cannot handle the temporal formula at ${Ra(e)}`),$=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=Ja(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return $(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?$(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=$a(e,n);if(t)return Vf(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);return r?+!!r.isStateLevel:void 0},o=(e,t)=>r.has(e)?0:W(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return Si(e,(e,a)=>(i.value=Math.max(i.value,$(e,t,n,a.length===0?r:/* @__PURE__ */ new Set([...r,...a]))),e)),i.value};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:s(e);case`Identifier`:return o(e.name,e);case`OperatorReference`:return o(e.operator,e);case`Apply`:return If.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Vf=(e,t)=>{let n=Lf.get(e);if(n!==void 0)return n;Lf.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max($(e.body,void 0,t),...r.map(e=>$(e.set,void 0,t)));return Lf.set(e,i),i},Hf=`Temporal formula is a tautology (its negation is unsatisfiable).`,Uf=(t,r,i,a,o=``,s=/* @__PURE__ */ new Set)=>{let c=(e,t,n=o,r=s)=>Uf(e,t,i,a,n,r);if(t.kind===`And`)return t.operands.flatMap(e=>c(e,r,Ba(e)));if(t.kind===`Label`)return c(t.body,r);if(t.kind===`Let`)return c(t.body,Wf(t,r,i));if(t.kind===`Identifier`){let e=W(t)?Ja(r,t.name):void 0;if(e?.kind===`Thunk`)return c(e.expression,e.scope);let n=i.constants.has(t.name)?void 0:$a(t.name,i);if(!e&&n?.kind===`Operator`&&n.params.length===0&&Vf(n,i)>0){if(s.has(n))throw new l(`The definition of ${t.name} refers to itself`);return c(n.body,void 0,t.name,/* @__PURE__ */ new Set([...s,n]))}}let d=zf(i,r);if(t.kind===`Apply`&&(e=>a||$(e,r,i)===3)(t)){let e=bo(t,d),n=W(t)?void 0:$a(t.operator,i);if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive)return c(e.body,Mo(e,t.args,d),t.operator)}if(a&&t.kind===`Forall`&&t.bounds.every(e=>$(e.set,r,i)===0)){let r=[],i={count:0};if(io(t.bounds,d,e=>(i.count++,r.push(...c(t.body,e,Ba(t.body))),!1)),i.count===0)throw n(new u(Hf),e.livenessEvaluationFailure);return r}return[{expression:t,scope:r,name:o}]},Wf=(e,t,n)=>{let r=Po(e.definitions,zf(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Rf.add(e.binding);return r},Gf=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),Kf=(e,t,n)=>{let r=(e,t,r)=>{let i=r===0?$(e,t,n):r;if(i===0){let r=X(e,zf(n,t));if(typeof r!=`boolean`)throw new u(`TLC expected a boolean in the temporal formula at ${Ra(e)}`);return tf(r)}return i===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},i={depth:0},a=(e,t,n,a)=>{if(i.depth>=100)throw new u(`TLC overflowed the stack while expanding the temporal formula at ${Ra(n)}`);i.depth++;let o=c(e,t);i.depth--;let s=sf(o);return s>2?o:r(n,a,s)},o=(e,t)=>{let r=e.kind===`Identifier`?e.name:e.operator,i=zf(n,t),o=W(e)||$a(r,n)===void 0?Ja(t,r):void 0;if(o?.kind===`Thunk`&&Rf.has(o))return a(o.expression,o.scope,e,t);let s=o?.kind===`Operator`?o.operator:o?void 0:W(e)?xo(r,i):vo(r,n);if(s?.kind!==`Closure`)throw Bf(e);let c=e.kind===`Apply`?e.args:[];return a(s.body,Mo(s,c,i),e,t)},s=(e,t)=>{if(!e.bounds.every(e=>$(e.set,t,n)===0))throw Bf(e);let i=[];io(e.bounds,zf(n,t),t=>(i.push(c(e.body,t)),!1));let a=e.kind===`Forall`;if(i.length===0)return tf(a);let o=of(a?`And`:`Or`,i),s=sf(o);return s>2?o:r(e,t,s)},c=(e,t)=>{let i=$(e,t,n);if(i<=2)return r(e,t,i);switch(e.kind){case`Label`:return c(e.body,t);case`Let`:return c(e.body,Wf(e,t,n));case`Identifier`:return o(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?Q(`Always`,af(`Or`,Q(`Not`,c(n[0],t)),Q(`Eventually`,c(n[1],t)))):e.operator===`~`&&!W(e)?Q(`Not`,c(n[0],t)):e.operator===`=>`?af(`Or`,Q(`Not`,c(n[0],t)),c(n[1],t)):o(e,t)}case`And`:case`Or`:return of(e.kind,e.operands.map(e=>c(e,t)));case`Forall`:case`Exists`:return s(e,t);case`If`:{if($(e.condition,t,n)===0){let r=X(e.condition,zf(n,t));if(typeof r==`boolean`)return c(r?e.consequent:e.alternative,t)}let r=c(e.condition,t);return af(`Or`,af(`And`,r,c(e.consequent,t)),af(`And`,Q(`Not`,r),c(e.alternative,t)))}case`Always`:case`Eventually`:return Q(e.kind,c(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=Gf(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=Q(`Not`,r),a={kind:`Action`,expression:e.action,unchanged:{kind:`Unchanged`,expression:e.subscript,location:n.location},scope:t,enabled:r};return e.kind===`WeakFairness`?Q(`Always`,Q(`Eventually`,af(`Or`,i,a))):af(`Or`,Q(`Eventually`,Q(`Always`,i)),Q(`Always`,Q(`Eventually`,a)))}default:throw Bf(e)}};return c(e,t)},qf=(e,t,n,r,i)=>{let a=e=>qf(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a={environment:r,scope:e.scope,state:t,next:void 0},o=e.kind===`State`?Qa(X(e.expression,a),`a temporal property predicate`):Na(e.step,a);return i.set(e,o),o}case`Action`:{if(e.enabled&&i.get(e.enabled)===!1)return!1;let a={environment:r,scope:e.scope,state:t,next:n};return e.unchanged&&Qa(X(e.unchanged,a),`a subscript`)?!1:Qa(X(e.expression,a),`an action predicate`)}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return qf(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new u(`TLC cannot evaluate a temporal formula in a single step`)}},Jf=(e,t,n,r,i)=>{let a=e=>e+1<t.length?e+1:n,o=e=>t.map((e,t)=>t).filter(t=>t>=Math.min(e,n)),s=(e,a=r)=>Jf(e,t,n,a,i);switch(e.kind){case`Not`:return!s(e.body);case`And`:return e.operands.every(e=>s(e));case`Or`:return e.operands.some(e=>s(e));case`Next`:return s(e.body,a(r));case`Always`:return o(r).every(t=>s(e.body,t));case`Eventually`:return o(r).some(t=>s(e.body,t));default:return qf(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Yf=(e,t)=>e.every((e,n)=>ze(e,t[n])),Xf=e=>e.filter((t,n)=>n===0||e[n-1]!==t),Zf=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.successors.push([]),e.offsets.push(-1),e.nodeStates.length-1),Qf=(e,t)=>e.offsets[t]!==-1,$f=(e,t,n)=>e.results.bytes[e.offsets[t]+n]===1,ep=2**53-1,tp=(e,t,n,r)=>{if(e.length===0)return;let i=t.map(e=>Kf(e.expression,e.scope,n)),a=e.map(e=>Q(`Not`,Kf(e.expression,e.scope,n))),o=a.length===1?a[0]:of(`Or`,a),s=i.length===0?o:of(`And`,[...i,o]),c=Ff(s);if(c.length===0)throw new u(Hf);let l=/* @__PURE__ */ new Map,d=c.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=df(e),n=l.get(t)??l.size;return l.set(t,n),n}),nodeStates:[],nodeTableaux:[],successors:[],offsets:[],results:{bytes:/* @__PURE__ */ new Uint8Array(1024),length:0},initial:[],nodeIds:/* @__PURE__ */ new Map,nodesByState:/* @__PURE__ */ new Map,isDone:[],errorNode:void 0})),f={multiplier:1},p=!Ko(n),m={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},h=e=>{let t=m.states.get(e)??/* @__PURE__ */ new Map;return m.states.set(e,t),t},g=(e,t)=>{n.runtime.setLivenessSource(e);let r=t();return n.runtime.setLivenessSource(void 0),r},_=(e,t)=>qf(e,t,void 0,n,p?h(t):/* @__PURE__ */ new Map),v=(e,t,n)=>g(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!_(e,n))),y=(e,t,r,i)=>g(t,()=>{let t=e.solution.actionChecks;if(!p)return Uint8Array.from(t,e=>+!!qf(e,r,i,n,/* @__PURE__ */ new Map));let a=h(r),o=m.actions.get(r)??/* @__PURE__ */ new Map;m.actions.set(r,o);let s=o.get(i)??new Int8Array(l.size).fill(-1);return o.set(i,s),Uint8Array.from(e.actionIds,(e,o)=>(s[e]===-1&&(s[e]=+!!qf(t[o],r,i,n,a)),s[e]))}),ee=(e,t,n,r)=>g(n,()=>e.nodes[t].statePredicates.every(e=>_(e,r))),b=(e,t)=>{let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},x=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),te=(e,t,n)=>e.solution.tableau?e.nodeIds.get(t*e.solution.tableau.nodes.length+n):t,ne=(e,t,n)=>{let r=Zf(e,t,n);e.nodeIds.set(t*(e.solution.tableau?.nodes.length??1)+n,r);let i=e.nodesByState.get(t);return i?i.push(r):e.nodesByState.set(t,[r]),r},re=(e,t,n,r)=>{let i=e.solution.actionChecks.length,a=e.results,o=a.length;if(a.length+=r.length+n.length*i,a.length>a.bytes.length){let e=new Uint8Array(Math.max(2*a.bytes.length,a.length));e.set(a.bytes),a.bytes=e}a.bytes.set(r,o),n.forEach((e,t)=>a.bytes.set(e,o+r.length+t*i)),e.offsets[t]=o,e.successors[t]=e.successors[t].slice()},S=(e,t,n)=>{let i={slots:Array.from({length:16*f.multiplier}),count:0},a=(e,t)=>{for(let n=(r.getFingerprint(t.index)&2147483647)%e.length;;n=(n+1)%e.length){let r=e[n];if(r===void 0)return e[n]=t,!0;if(r.index===t.index&&Yf(r.state,t.state))return!1}},o=e=>{if(i.count>=i.slots.length>>1){let e=i.slots;i.slots=Array.from({length:2*e.length+1});for(let t of e)t&&a(i.slots,t)}a(i.slots,e)&&i.count++};return n.forEach(o),o({index:e,state:t}),i.slots.length>16*f.multiplier&&f.multiplier++,i.slots.filter(e=>e!==void 0)},ie=(e,t,n,i,a)=>{let o=v(e,i,n),s=t.nodes[e.nodeTableaux[a]],c=[],l=e.successors[a],u=s.successors.length>0?y(e,i,n,n):/* @__PURE__ */ new Uint8Array;for(let r of s.successors){if(!ee(t,r,i,n))continue;if(b(t,r)&&e.errorNode===void 0&&x(e)){e.errorNode=a;return}let o=te(e,i,r);if(o!==void 0&&l.includes(o))continue;let s=o??ne(e,i,r);l.push(s),c.push(u),o===void 0&&ie(e,t,n,i,s)}for(let a of r.getSuccessors(n)){let r=y(e,i,n,a.state),o=e.isDone[a.index]===!0;for(let n of s.successors){if(!ee(t,n,i,a.state))continue;let s=te(e,a.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??ne(e,a.index,n);l.push(u),c.push(r),s===void 0&&o&&ie(e,t,a.state,a.index,u)}}l.length>0&&re(e,a,c,o)},C=(e,t,n,r,i,a)=>{let o=t.nodes.map((e,r)=>n.map(e=>ee(t,r,a,e.state)));e.isDone[a]=!0;for(let s of(e.nodesByState.get(a)??[]).slice()){let a=e.successors[s],c=[];n.forEach((n,i)=>{let l=e.isDone[n.index]===!0;for(let u of t.nodes[e.nodeTableaux[s]].successors){if(!o[u][i])continue;let s=te(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??ne(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&ie(e,t,n.state,n.index,d)}}),re(e,s,c,i)}if(e.errorNode!==void 0)return Xf(w(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},ae=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)Zf(e,e.nodeStates.length,-1);let a=e.successors[i],o=[];t.forEach((t,r)=>{Qf(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),re(e,i,o,r)},w=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)Qf(e,t)&&(r.push(t),n.set(t,-1));for(let i=0;i<r.length;i++){let a=r[i];for(let i of e.successors[a])if(!(i===a&&e.solution.tableau)){if(i===t){let e=[t];for(let t=a;t!==-1;t=n.get(t)??-1)e.push(t);return e}Qf(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new u(`Couldn't re-create liveness trace (path) starting at: ${t}`)},oe=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=n.stateChecks.length,a=(t,n,a)=>e.results.bytes[e.offsets[t]+i+n*r+a]===1,o=(e,n)=>t.eventuallyAlways.every(t=>a(e,n,t)),s=new Float64Array(e.nodeStates.length).fill(-1),c=e.initial.filter(t=>Qf(e,t)),l=[],d=t=>{let n=e.successors[t].indexOf(t);return n!==-1&&o(t,n)},f=(t,r)=>n.tableau!==void 0&&Mf(n.tableau.nodes[e.nodeTableaux[t]].particle,r),p=r=>{let i=l.pop()??r;if(i===r&&!d(i)){s[i]=ep;return}let c=/* @__PURE__ */ new Set,u=/* @__PURE__ */ new Map;for(let t=i;;t=l.pop()??r){c.add(t);let n=u.get(e.nodeStates[t]);if(n?n.push(t):u.set(e.nodeStates[t],[t]),s[t]=ep,t===r)break}let p=t.infinitelyOftenStates.every(t=>[...c].some(n=>$f(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...c].some(n=>e.successors[n].some((e,r)=>c.has(e)&&o(n,r)&&a(n,r,t)))),g=n.promises.every(e=>[...c].some(t=>f(t,e)));if(p&&h&&g)return m(r,c,u)},m=(r,i,s)=>{let c=Xf(w(e,r).reverse().map(t=>e.nodeStates[t])),l=[],d=/* @__PURE__ */ new Set([r]),p=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),g=n.promises.map(()=>!1),_={count:p.length+m.length+g.length},v={node:r},y=e=>i.has(e),ee=e=>{l.push(v.node),v.node=e};for(;_.count>0;){let r=_.count;for(;t.infinitelyOftenStates.forEach((t,n)=>{!p[n]&&$f(e,v.node,t)&&(p[n]=!0,_.count--)}),n.promises.forEach((e,t)=>{!g[t]&&f(v.node,e)&&(g[t]=!0,_.count--)}),!(_.count<=0);){let n={last:-1,unvisited:-1},i=_.count;if(e.successors[v.node].some((r,c)=>{if(s.has(e.nodeStates[r])){if(!y(r)||!o(v.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&a(v.node,c,e)&&(m[t]=!0,_.count--)})}return _.count<i?(ee(r),d.clear(),!0):(y(r)&&!d.has(r)&&(n.unvisited=r),!1)}))break;if(_.count<r){ee(n.last),d.clear();break}for(;n.unvisited===-1;){let t=l.pop();if(t===void 0)throw new u(`TLC failed to build the counterexample of a liveness property`);v.node=t,n.unvisited=e.successors[t].find(e=>y(e)&&!d.has(e))??-1}ee(n.unvisited),d.add(n.unvisited)}}let b=h(r,v.node,s,o);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];b[b.length-1]!==n&&b.push(n)}let x=c[c.length-1];return b[b.length-1]===x&&b.pop(),{prefix:c.slice(0,-1),cycle:[x,...b.reverse()]}},h=(t,n,r,i)=>{if(n===t)return[];let a=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([a]),c=[];for(let n=a,l=-1,d=0;;d++){for(let u of r.get(n)??[])for(let[d,f]of e.successors[u].entries()){if(f===u||!i(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==a;)e.push(t),t=r,r=o.get(t)??-1;return e.push(a),e}let p=e.nodeStates[f];r.has(p)&&!s.has(p)&&(s.add(p),c.push([p,n]))}o.set(n,l);let f=c[d];if(f===void 0)throw new u(`TLC failed to build the counterexample of a liveness property`);n=f[0],l=f[1]}};for(let t=0;t<c.length;t++){let n=[c[t],-1,0],r={link:0};for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),a=n.pop()??0;if(i===-42){if(s[a]===t){let e=p(a);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(s[a]!==-1){n.push(Math.min(t,s[a]));continue}s[a]=r.link,n.push(t,a,-42),l.push(a);let u={value:r.link++};e.successors[a].forEach((t,r)=>{Qf(e,t)&&(o(a,r)?s[t]===-1?n.push(t,-1):u.value=Math.min(u.value,s[t]):s[t]===-1&&c.push(t))}),n.push(u.value)}}};return{addInitialState:(e,t)=>{m.states.clear(),m.actions.clear();for(let n of d){let r=n.solution.tableau;if(!r)n.initial.push(e);else for(let i=0;i<r.initialCount;i++)ee(r,i,void 0,t)&&n.initial.push(te(n,e,i)??ne(n,e,i))}},addState:(e,t,n)=>{m.states.clear(),m.actions.clear();let r=S(e,t,n);for(let n of d){let i=r.map(r=>y(n,e,t,r.state)),a=v(n,e,t),o=n.solution.tableau,s=o?C(n,o,r,i,a,e):ae(n,r,i,a,e);if(s)return s}},findViolation:()=>{for(let e of d)for(let t of e.solution.models){let n=oe(e,t);if(n)return n}},getViolatedProperties:(t,r)=>[...new Set(e.filter((e,i)=>!Jf(a[i].body,t,r,0,n)).map(e=>e.name))]}},np=`UnnamedAction`,rp={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},ip=e=>{let t=e.range??rp;return Ot([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},ap=e=>{let t=[[`name`,e.name],[`location`,ip(e.location)]];return e.parameters.length===0?Ot(t):Ot([...t,[`context`,Ot(e.parameters)],[`parameters`,R(e.parameters.map(e=>e[0]))]])},op=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),sp=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),cp=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,lp=e=>e.kind===`Apply`?e.args:[],up=(e,t,n)=>{let r=cp(e);if(r===void 0)return;if(W(e)){let e=Ja(t,r);return e?.kind===`Operator`&&e.operator.kind===`Closure`?e.operator:void 0}if(n.constants.has(r)||n.variableIndex.has(r))return;let i=vo(r,n);return i?.kind===`Closure`?i:void 0},dp=(e,t)=>{try{return X(e,sp(t,void 0)),!0}catch(e){if(e instanceof s)return!1;throw e}},fp=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&to(e,t)&&dp(e.body,t),pp=(e,t)=>{let n=$a(e.name,t);return n?.body===e.body&&fp(n,t)},mp=(e,t)=>{if(e.kind!==`Identifier`||!W(e))return;let n=Ja(t,e.name);return n?.kind===`Thunk`?n:void 0},hp=(e,t)=>(e?.params??[]).flatMap(e=>{let n=Ja(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),gp=(e,t)=>{try{return e()}catch(e){if(e instanceof s)return t();throw e}},_p=(e,t,n,r,i)=>{let a=lp(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return!r||a.length===0?[{...e,parameters:[],expression:t,scope:n}]:a.some(e=>$(e,n,i)!==0)?o():gp(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),X(e,sp(i,n))]),expression:t,scope:n}],o)},vp=(e,t,n,r,i)=>{let a=()=>({name:n?.name??np,location:e.location,parameters:hp(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return vp(e.body,Po(e.definitions,sp(r,t)),n,r,i);case`Label`:return vp(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>vp(e,t,n,r,i));case`Exists`:return gp(()=>{let o=[];return io(e.bounds,sp(r,t),t=>(o.push(...vp(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=W(e)?void 0:i.get(cp(e)??``),s=up(e,t,r);if(o)return _p(o,e,t,s,r);if(!s)return[a()];let c=lp(e),l=()=>[{name:s.name,location:e.location,parameters:[],expression:e,scope:t}];return pp(s,r)||c.some(e=>$(e,t,r)!==0)?l():gp(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:X(n,sp(r,t))},parent:e}),s.scope);return vp(s.body,e,s,r,i)},l)},yp=(e,t,n,r,i)=>{let a=(e,t)=>yp(e,t,n,r,i);if(e.kind===`Let`){a(e.body,Po(e.definitions,sp(n,t)));return}let o=mp(e,t);if(o){a(o.expression,o.scope);return}let s=up(e,t,n);if(s&&pp(s,n))return;if(s&&s.params.length===0){if($(s.body,s.scope,n)===1){r.inits.push(op(s.name,s.body));return}a(s.body,s.scope);return}if(s&&e.kind===`Apply`&&s.params.length===e.args.length){a(s.body,Mo(s,e.args,sp(n,t)));return}if(e.kind===`And`){e.operands.forEach(e=>a(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t});return}r.temporals.push(op(np,e));return}let c=$(e,t,n);c<=1?r.inits.push(op(np,e)):c===3&&r.temporals.push(op(np,e))},bp=(e,t,n,r,i)=>{let a=(t,n)=>bp(e,t,n,r,i);if(t.kind===`Let`){a(t.body,Po(t.definitions,sp(r,n)));return}let o=mp(t,n);if(o){a(o.expression,o.scope);return}let s=up(t,n,r);if(s&&pp(s,r))return;if(s&&s.params.length===lp(t).length){a(s.body,t.kind===`Apply`?Mo(s,t.args,sp(r,n)):s.scope);return}if(t.kind===`Forall`&&gp(()=>(io(t.bounds,sp(r,n),e=>(a(t.body,e),!1)),!0),()=>!1))return;if(t.kind===`And`){t.operands.forEach(e=>a(e,n));return}if(t.kind===`Always`){let a=t.expression;a.kind===`BoxAction`?i.impliedActions.push(op(e,a)):$(a,n,r)<2?i.invariants.push(op(e,a)):i.impliedTemporals.push(op(e,t));return}let c=$(t,n,r);c<=1?i.impliedInits.push(op(e,t)):c===3&&i.impliedTemporals.push(op(e,t))},xp=(e,t)=>{let n=$a(e,t);return n?.kind===`Operator`&&!fp(n,t)?n:void 0},Sp=e=>Ot([[`name`,e.name],[`location`,ip(e.location)]]),Cp=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:xp(e.specification,t);a&&(yp(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...vp(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:vo(e.init,t);o?.kind===`Closure`&&r.inits.push(op(e.init??``,o.body));let s=e.next===void 0?void 0:vo(e.next,t);return s?.kind===`Closure`&&r.actions.push(...vp(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=xp(e,t);n&&r.invariants.push(op(e,n.body))}),e.properties.forEach(e=>{let n=xp(e,t);n&&bp(e,n.body,void 0,t,r)}),r},wp=(e,t,n)=>Cp(e,t,n).actions,Tp=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>U(e[1])).join(`,`)})`,Ep=e=>`${e.name===np?`Action`:e.name}${Tp(e)} ${za(e.location.range??rp)}`,Dp=e=>`${e.name}${Tp(e)}`,Op=(e,t,n,r)=>{let i=Cp(e,t,r),a=e=>ft(e.map(ap)),o=e=>ft(e.flatMap(e=>{let n=xp(e,t);return n?[Sp(n)]:[]}));return Ot([[`inits`,a(i.inits)],[`actions`,a(i.actions)],[`temporals`,a(i.temporals)],[`invariants`,a(i.invariants)],[`impliedinits`,a(i.impliedInits)],[`impliedactions`,a(i.impliedActions)],[`impliedtemporals`,a(i.impliedTemporals)],[`variables`,ft(t.variables.map((e,t)=>Ot([[`name`,e],[`location`,ip(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},kp=`paired12`,Ap=(e,t=16)=>e<=t*.75?t:Ap(e,t*2),jp=(e,t)=>{let n=Ap(e.length)-1,r=e=>{let r=t(e);return(r^r>>>16)&n};return e.map((e,t)=>({key:e,position:t,bucket:r(e)})).sort((e,t)=>e.bucket-t.bucket||e.position-t.position).map(e=>e.key)},Mp=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),Np=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),Pp=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),Fp=e=>Pp(e).replaceAll(`
|
|
411
|
-
`,`\\n`),
|
|
410
|
+
`))},Ud=t=>{switch(t.kind){case`Number`:try{return pe(t.value)}catch(t){throw n(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return Pe(t.name);case`Set`:return ft(t.elements.map(Ud))}},Wd=e=>[...e.constants,...e.variables.map(e=>({name:e,arity:0}))],Gd=e=>new c(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),Kd=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:Er},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),qd=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>U(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new u(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&Le(t,r)})});if(t)return t[1];throw new u(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:U(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},Jd=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||In(e).some(e=>Jd(e,t)),Yd=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(ji(e),n.get(e)??n.size)),n},Xd=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),Zd=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Ka(e);if(e.kind===`Number`&&!Io(e.value))throw qa(e);Zd(e.kind===`Let`?[...In(e),...Xd(e.instances??[])]:In(e))}),Qd=(e,t)=>{let n=hc(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=new Map(Au.map(e=>[e.name,e])),s=/* @__PURE__ */ new Map,d=Xc(e.checkDeadlock,t.seed),f=/* @__PURE__ */ new Map,p=/* @__PURE__ */ new Map,m=[],h=/* @__PURE__ */ new Map,g=[],_=[],v=(e,t)=>g.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),y={value:0},ee=e=>`${e}#${y.value++}`,b=[],x=/* @__PURE__ */ new Map,te=e=>{let n=s.get(e);if(n)return n;let r=Wu(e,t.print,d,t.files);if(!r)return;let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>te(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(e=>{o.set(e.name,e),i.set(e.name,{key:e.name,arity:e.arity})}),s.set(e,i),i},ne=e=>{let t=te(e);return t&&v(e,Uu.get(e)??[]),t},re=e=>(Zd([...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...Xd(e.instances)]),e.modules.forEach(re),e);re(n);let S=(e,n)=>{let r=t.loadModule?.(e)??Is.get(e)??pc(t.source,e);if(r===void 0)throw new c(`Cannot find source file for module ${e} imported in module ${n}.`);let i=hc(r);if(i.name!==e)throw new c(`File name '${e}' does not match the name '${i.name}' of the top level module it contains.`);return re(i)},ie=e=>{let t=_.indexOf(e.name);if(t!==-1)throw new c(`Circular dependency among .tla files; dependency cycle is: ${[..._.slice(t),e.name].map(e=>`${e}.tla`).join(` --> `)}`);let n=/* @__PURE__ */ new Set,r=[];_.push(e.name),g.push(n);let i=se(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r});g.pop(),_.pop();let a=r.find(e=>n.has(e.name));if(a)throw Gd(a);return{linked:i,closure:n}},C=(e,t)=>{let n=f.get(e);if(n)return v(e,h.get(e)??[]),n;let r=ie(S(e,t));return f.set(e,r.linked),h.set(e,r.closure),v(e,r.closure),r.linked},ae=(e,t,n,o,s)=>{let c=s?void 0:ne(e.module);if(c)return e.name===void 0?c:new Map([...c].map(([t,n])=>[`${e.name}!${t}`,n]));let l=s??C(e.module,t.name),u=Wd(l),d=`#${y.value++}`,f=new Map(e.params.map(e=>[e.name,`${e.name}${d}`])),p=fi(sd(e,t),u,t,n);b.push({module:e.module,instancer:t.name,lets:[],substitutions:p,location:e.location});let m=Ui({params:e.params.map(e=>({...e,name:`${e.name}${d}`})),substitutions:new Map([...p].map(([e,t])=>[e,gi(t,f)])),variables:new Set(l.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(n,s,c)=>{let l=ee(`${s}@${t.name}`);return r.set(l,c(l)),i.set(l,!o),a.set(l,{source:n,prefix:e.params.length}),l},createName:ee}),h=new Set(u.map(e=>e.name)),g=/* @__PURE__ */ new Map;return l.exported.forEach((t,n)=>{if(h.has(n))return;if(e.name===void 0){let r=m.getKey(t.key);u.length>0&&x.set(r,{name:n,location:e.location}),g.set(n,{key:r,arity:t.arity});return}let r=m.getQualifiedKey(t.key);u.length>0&&x.set(r,{name:`${e.name}!${n}`,location:e.location}),g.set(`${e.name}!${n}`,{key:r,arity:t.arity+e.params.length})}),g},w=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:Er})),oe=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:w(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),T=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),E=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=T(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:w(r,n),location:n}}},D=(e,t,n,a)=>{let o=e.location,s=a?void 0:ne(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=T(n.arity);return oe(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=a??C(e.module,n),l=`#${y.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=Wd(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};b.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:o});let p=new Set(e.params.map(e=>e.name)),m=e=>Jd(f(e),p),h=d.map(t=>{let n=E(f(t),t,o);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:o}}),g=[],_=Ui({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:w(e.params,o),location:o,resolution:Er}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:Er}])),variables:new Set(c.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:Kd(a,i)),i},createName:ee}),v=new Set(d.map(e=>e.name)),x=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),i=T(n.arity),a=[...e.params,...i];return oe(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...g,...x]},O=e=>[...e].flatMap(([e,t])=>{let n=r.get(t.key);return n?[{...n,name:e}]:[]}),se=(e,a)=>{let o=Ws(e,t.loadClass?.(e.name)),s=new Map([...Au.map(e=>[e.name,{key:e.name,arity:e.arity}]),...a.symbols]),c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=[],d=[...o.constants],f=o.variables.map(e=>e.name),h=o.variables.map(e=>e.location),g=(e,t)=>e.forEach((e,n)=>{s.set(n,e),t&&c.set(n,e)});o.extends.forEach(e=>{let t=a.modules.get(e),n=t?void 0:ne(e);if(n){g(n,!0);return}let r=t??C(e,o.name);d.push(...r.constants.filter(e=>d.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{f.includes(e)||(f.push(e),h.push(r.variableLocations[t]))}),g(r.exported,!0),r.modules.forEach((e,t)=>l.set(t,e)),u.push(r)}),o.constants.forEach(e=>c.set(e.name,{key:e.name,arity:e.arity,declaration:`Constant`})),o.variables.forEach(e=>c.set(e.name,{key:e.name,arity:0,declaration:`Variable`}));let _=d.length===0&&f.length===0,v=e=>o===n?e.name:`${e.name}@${a.id}`,y=/* @__PURE__ */ new Map,ee=e=>({imported:s,importedAt:y,definitions:new Map(e.definitions.map(e=>[e.name,e])),getKey:v}),b=()=>new Map([...a.modules,...l]),x=e=>new Map([...s,...[...o.constants.map(e=>({...e,kind:`Constant`})),...o.variables.map(e=>({...e,kind:`Variable`}))].filter(t=>Ar(t.location,e)).map(e=>[e.name,{key:e.name,arity:e.arity,declaration:e.kind}]),...o.definitions.filter(t=>Ar(t.location,e)).map(e=>[e.name,{key:v(e),arity:jr(e)}])]),te=e=>{let t=b();if(t.has(e.name))throw Gd(e);a.nested.push(e);let n=se(e,{id:`${a.id}/${e.name}`,symbols:x(e.location),modules:t,nested:a.nested});l.set(e.name,n),p.has(e.name)||p.set(e.name,n)};[...o.instances.map(e=>({location:e.location,link:()=>{let t=ae(e,o,ee(o),_,b().get(e.module));t.forEach((t,n)=>{s.has(n)||y.set(n,e.location)}),g(t,!e.isLocal)}})),...o.modules.map(e=>({location:e.location,link:()=>te(e)}))].sort((e,t)=>Ar(e.location,t.location)?-1:1).forEach(e=>e.link()),ui(o,ee(o));let re=e=>{let t=o.instances.find(t=>t.module===e.name);return t!==void 0&&Ar(e.location,t.location)},S=e=>{let t=o.modules.find(t=>t.name===e.module);return t?re(t)?l.get(t.name):void 0:b().get(e.module)},ie=cd(qi(o,(e,t)=>D(e,t,o.name,S(e))),O(s));pi(ie,ee(ie)),ie.definitions.forEach(e=>{let t=v(e);r.set(t,e),i.set(t,!_);let n={key:t,arity:jr(e)};s.set(e.name,n),e.isLocal||c.set(e.name,n)}),Bd(ie,{constants:new Set(d.map(e=>e.name)),variables:new Set(f),getDefinition:e=>r.get(s.get(e)?.key??e)});let w={module:ie,constants:d,variables:f,variableLocations:h,visible:s,exported:c,modules:l,extended:u};return m.push(w),w},k=ie(n).linked,ce=e=>k.visible.get(e)?.key??e;k.visible.forEach((e,t)=>{let n=r.get(e.key);n&&e.key!==t&&r.set(t,n)});let le=[],ue=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>ue(e,t)),le.push(...e.module.assumptions))};ue(k,/* @__PURE__ */ new Set);let A=k.constants.map(e=>e.name),j=k.variables,de=e=>e.module===void 0?[e.name,ce(e.name)]:e.module===n.name||A.includes(e.name)?[]:[(f.get(e.module)??p.get(e.module))?.visible.get(e.name)?.key??e.name],M=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:k.constants.find(t=>t.name===e)?.arity??0},N=/* @__PURE__ */ new Map,fe=/* @__PURE__ */ new Set,pe=(e,t)=>{o.set(e,t),r.delete(e),N.delete(e),fe.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=Ud(e.value);de(e).forEach(e=>{let n=M(e);n===0?N.set(e,t):pe(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let me=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=me.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new l(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(Ud),Ud(e.value)]),me.set(t,n)}),me.forEach(e=>de(e).forEach(t=>pe(t,qd(e.name,M(t)||e.rows[0][0].length,e.rows))));let he=new Map(e.substitutions.flatMap(e=>de(e).map(t=>[t,ce(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,i=t.target;if(!A.includes(n)&&!k.visible.has(n))throw new l(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===i))throw new l(`In the configuration file, the identifier ${i} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let a=ce(i),s=r.get(a);if(!(s!==void 0||o.has(a)||N.has(a)||A.includes(i)||j.includes(i)))throw new l(`The configuration file substitutes for ${n} with the undefined identifier ${i}.`);if(s?.kind===`Operator`&&s.params.length!==(k.constants.find(e=>e.name===n)?.arity??k.visible.get(n)?.arity))throw new l(`The configuration file substitutes for ${n} with ${i} of different number of arguments.`)});let ge=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(de)),_e=(e,t)=>{if(ge.has(e))return{key:e,prefix:t};let n=a.get(e);return n&&_e(n.source,t+n.prefix)};a.forEach((e,t)=>{let n=_e(e.source,e.prefix),i=r.get(t);if(!n||!i)return;let a=i.kind===`Operator`?i.params:[],o=oe(t,n.key,a,a.slice(n.prefix),i.location);r.set(t,o),k.visible.forEach((e,n)=>{e.key===t&&n!==t&&r.set(n,o)})}),A.forEach(e=>{if(!N.has(e)&&!he.has(e)&&!fe.has(e))throw new l(`The constant ${e} is not assigned a value by the configuration`)});let ve={runtime:d,definitions:r,builtins:o,constants:N,substitutions:he,variables:j,variableIndex:Yd(j,m.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,evaluators:/* @__PURE__ */ new WeakMap};Hd(b,e=>{let t=f.get(e)??p.get(e)??k;return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>r.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),getDefinition:e=>r.get(t.visible.get(e)?.key??e)}});let ye=Rd({constants:new Set(N.keys()),variables:/* @__PURE__ */ new Set([...j,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>o.has(e))]),getDefinition:e=>$a(e,ve)}),be=e=>{try{return X(e,{environment:ve,scope:void 0,state:void 0,next:void 0}),!0}catch(e){if(e instanceof u)return!1;throw e}};return he.forEach((e,t)=>{let n=r.get(e);if(A.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&ye.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0&&!be(n.body))throw new l(`The configuration file substitutes constant ${t} with non-constant ${e}`)}),d.isStarted=!0,{environment:ve,assumptions:le,variableLocations:k.variableLocations,instanceActions:x}},$d={kind:`Boolean`,value:!0},ef={kind:`Boolean`,value:!1},tf=e=>e?$d:ef,nf=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,rf=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,Q=(e,t)=>({kind:e,body:t}),af=(e,t,n)=>({kind:e,operands:[t,n]}),of=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?of(e,t.operands).operands:[t])}),sf=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return sf(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,sf(t)),0)}},cf=e=>{switch(e.kind){case`Action`:return!0;case`Boolean`:case`State`:case`Enabled`:return!1;case`Not`:case`Always`:case`Eventually`:case`Next`:return cf(e.body);case`And`:case`Or`:return e.operands.some(cf)}},lf=/* @__PURE__ */ new WeakMap,uf={count:0},df=e=>{let t=lf.get(e);if(t!==void 0)return t;let n=(()=>{switch(e.kind){case`Boolean`:return String(e.value);case`State`:case`Enabled`:case`Action`:return`#${uf.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(df).join(`,`)})`;default:return`${e.kind}(${df(e.body)})`}})();return lf.set(e,n),n},ff=(e,t)=>e===t||df(e)===df(t),pf=(e,t)=>{let n=df(t);return e.some(e=>e===t||df(e)===n)},mf=e=>e===`And`?`Or`:`And`,hf=(e,t)=>{switch(e.kind){case`Boolean`:return t?tf(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?Q(`Not`,e):e;case`Not`:return hf(e.body,!t);case`And`:case`Or`:return of(t?mf(e.kind):e.kind,e.operands.map(e=>hf(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return Q(n,hf(e.body,t))}}},gf=e=>{switch(e.kind){case`Boolean`:return tf(!e.value);case`Not`:return e.body;case`And`:case`Or`:return of(mf(e.kind),e.operands.map(gf));case`Always`:return Q(`Eventually`,gf(e.body));case`Eventually`:return Q(`Always`,gf(e.body));default:return Q(`Not`,e)}},_f=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=_f(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return tf(t)}return n.length===0?tf(!t):n.length===1?n[0]:of(e.kind,n)}case`Not`:{let t=_f(e.body);return t.kind===`Boolean`?tf(!t.value):Q(`Not`,t)}case`Always`:case`Eventually`:{let t=_f(e.body);return Q(e.kind,t.kind===e.kind?t.body:t)}default:return e}},vf=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,yf=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=yf(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new u(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form`);t.push(e)}}if(n.value===1)return{kind:`And`,operands:t};let r=Array.from({length:n.value},()=>[]),i={groups:1,repeat:n.value};for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}i.repeat/=e.operands.length;let t={value:0};for(let n=0;n<i.groups;n++)for(let n of e.operands)for(let e=0;e<i.repeat;e++)r[t.value++].push(n);i.groups*=e.operands.length}return{kind:`Or`,operands:r.map(e=>of(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=yf(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=vf(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:of(`Or`,t);n.push(Q(`Always`,Q(`Eventually`,e)))}return of(`Or`,n)}case`Not`:return nf(e.body)?e:yf(gf(e.body));default:return e}},bf=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?bf(e.operands[0]):of(e.kind,e.operands.map(bf));case`Not`:return e.body.kind===`Not`?bf(e.body.body):Q(`Not`,bf(e.body));case`Always`:case`Eventually`:case`Next`:return Q(e.kind,bf(e.body));default:return e}},xf=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return xf(e.operands[0]);let t=Math.floor(e.operands.length/2);return af(e.kind,xf(of(e.kind,e.operands.slice(0,t))),xf(of(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return Q(e.kind,xf(e.body));default:return e}},Sf=(e,t)=>{e.kind===`Eventually`&&!pf(t,e)&&t.push(e),`body`in e&&Sf(e.body,t),`operands`in e&&e.operands.forEach(e=>Sf(e,t))},Cf=e=>{let t=e.filter(rf),n=e.flatMap(e=>e.kind===`Not`&&rf(e.body)?[e.body]:[]);return!t.some(e=>pf(n,e))},wf=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,Q(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new u(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Tf=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:Q(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Ef=(e,t,n)=>e.flatMap(e=>{let r=Tf(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Df=e=>[...new Set(e.map(df))].sort().join(`|`),Of=(e,t)=>{let n=new Set(t.map(Df));return[...e.filter(e=>!n.has(Df(e))),...t]},kf=e=>{let t=wf(e),n=Ef(t,`Always`,`And`),r=Ef(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Tf(t,`Eventually`,`Or`);if(n&&!(pf(e,n.first)||pf(e,n.second)))return Of(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(pf(e,t.first)||pf(e,t.second))&&!pf(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Cf(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Tf(t[e],`Always`,`And`);n&&(pf(t,n.first)||t.push(n.first),pf(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)pf(t,e.first)&&pf(t,e.second)&&!pf(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!Cf(t)?[]:i(t)};return a(e)},Af=e=>({particle:e,successors:[],statePredicates:e.filter(e=>sf(e)<=1)}),jf=e=>{let t=kf([e]).map(Af),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Df(e.particle);r.has(n)||r.set(n,t)});for(let e=0;e<t.length;e++){let n=t[e].particle.flatMap(e=>e.kind===`Next`?[e.body]:[]);for(let i of kf(n)){let n=Df(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Af(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Mf=(e,t)=>!pf(e,t)||pf(e,t.body),Nf=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&sf(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=vf(e);if(n){let e=sf(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(cf(e))throw new u(`TLC cannot handle the temporal formula: actions may only appear as []<>A or <>[]A`);t.formulas.push(e)},Pf=(e,t)=>{let n=e.findIndex(e=>ff(e,t));return n===-1?(e.push(t),e.length-1):n},Ff=e=>{let t=yf(_f(hf(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=bf(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Nf(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:of(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:ff(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&xf(e.formula),n=[];t&&Sf(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Pf(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Pf(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Pf(i,e))}));return{tableau:t&&jf(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},If=/* @__PURE__ */ new Set([`~>`,`-+->`]),Lf=/* @__PURE__ */ new WeakMap,Rf=/* @__PURE__ */ new WeakSet,zf=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Bf=e=>new u(`TLC cannot handle the temporal formula at ${Ra(e)}`),$=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=Ja(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return $(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?$(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=$a(e,n);if(t)return Vf(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);return r?+!!r.isStateLevel:void 0},o=(e,t)=>r.has(e)?0:W(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return Si(e,(e,a)=>(i.value=Math.max(i.value,$(e,t,n,a.length===0?r:/* @__PURE__ */ new Set([...r,...a]))),e)),i.value};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:s(e);case`Identifier`:return o(e.name,e);case`OperatorReference`:return o(e.operator,e);case`Apply`:return If.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Vf=(e,t)=>{let n=Lf.get(e);if(n!==void 0)return n;Lf.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max($(e.body,void 0,t),...r.map(e=>$(e.set,void 0,t)));return Lf.set(e,i),i},Hf=`Temporal formula is a tautology (its negation is unsatisfiable).`,Uf=(t,r,i,a,o=``,s=/* @__PURE__ */ new Set)=>{let c=(e,t,n=o,r=s)=>Uf(e,t,i,a,n,r);if(t.kind===`And`)return t.operands.flatMap(e=>c(e,r,Ba(e)));if(t.kind===`Label`)return c(t.body,r);if(t.kind===`Let`)return c(t.body,Wf(t,r,i));if(t.kind===`Identifier`){let e=W(t)?Ja(r,t.name):void 0;if(e?.kind===`Thunk`)return c(e.expression,e.scope);let n=i.constants.has(t.name)?void 0:$a(t.name,i);if(!e&&n?.kind===`Operator`&&n.params.length===0&&Vf(n,i)>0){if(s.has(n))throw new l(`The definition of ${t.name} refers to itself`);return c(n.body,void 0,t.name,/* @__PURE__ */ new Set([...s,n]))}}let d=zf(i,r);if(t.kind===`Apply`&&(e=>a||$(e,r,i)===3)(t)){let e=bo(t,d),n=W(t)?void 0:$a(t.operator,i);if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive)return c(e.body,Mo(e,t.args,d),t.operator)}if(a&&t.kind===`Forall`&&t.bounds.every(e=>$(e.set,r,i)===0)){let r=[],i={count:0};if(io(t.bounds,d,e=>(i.count++,r.push(...c(t.body,e,Ba(t.body))),!1)),i.count===0)throw n(new u(Hf),e.livenessEvaluationFailure);return r}return[{expression:t,scope:r,name:o}]},Wf=(e,t,n)=>{let r=Po(e.definitions,zf(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Rf.add(e.binding);return r},Gf=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),Kf=(e,t,n)=>{let r=(e,t,r)=>{let i=r===0?$(e,t,n):r;if(i===0){let r=X(e,zf(n,t));if(typeof r!=`boolean`)throw new u(`TLC expected a boolean in the temporal formula at ${Ra(e)}`);return tf(r)}return i===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},i={depth:0},a=(e,t,n,a)=>{if(i.depth>=100)throw new u(`TLC overflowed the stack while expanding the temporal formula at ${Ra(n)}`);i.depth++;let o=c(e,t);i.depth--;let s=sf(o);return s>2?o:r(n,a,s)},o=(e,t)=>{let r=e.kind===`Identifier`?e.name:e.operator,i=zf(n,t),o=W(e)||$a(r,n)===void 0?Ja(t,r):void 0;if(o?.kind===`Thunk`&&Rf.has(o))return a(o.expression,o.scope,e,t);let s=o?.kind===`Operator`?o.operator:o?void 0:W(e)?xo(r,i):vo(r,n);if(s?.kind!==`Closure`)throw Bf(e);let c=e.kind===`Apply`?e.args:[];return a(s.body,Mo(s,c,i),e,t)},s=(e,t)=>{if(!e.bounds.every(e=>$(e.set,t,n)===0))throw Bf(e);let i=[];io(e.bounds,zf(n,t),t=>(i.push(c(e.body,t)),!1));let a=e.kind===`Forall`;if(i.length===0)return tf(a);let o=of(a?`And`:`Or`,i),s=sf(o);return s>2?o:r(e,t,s)},c=(e,t)=>{let i=$(e,t,n);if(i<=2)return r(e,t,i);switch(e.kind){case`Label`:return c(e.body,t);case`Let`:return c(e.body,Wf(e,t,n));case`Identifier`:return o(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?Q(`Always`,af(`Or`,Q(`Not`,c(n[0],t)),Q(`Eventually`,c(n[1],t)))):e.operator===`~`&&!W(e)?Q(`Not`,c(n[0],t)):e.operator===`=>`?af(`Or`,Q(`Not`,c(n[0],t)),c(n[1],t)):o(e,t)}case`And`:case`Or`:return of(e.kind,e.operands.map(e=>c(e,t)));case`Forall`:case`Exists`:return s(e,t);case`If`:{if($(e.condition,t,n)===0){let r=X(e.condition,zf(n,t));if(typeof r==`boolean`)return c(r?e.consequent:e.alternative,t)}let r=c(e.condition,t);return af(`Or`,af(`And`,r,c(e.consequent,t)),af(`And`,Q(`Not`,r),c(e.alternative,t)))}case`Always`:case`Eventually`:return Q(e.kind,c(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=Gf(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=Q(`Not`,r),a={kind:`Action`,expression:e.action,unchanged:{kind:`Unchanged`,expression:e.subscript,location:n.location},scope:t,enabled:r};return e.kind===`WeakFairness`?Q(`Always`,Q(`Eventually`,af(`Or`,i,a))):af(`Or`,Q(`Eventually`,Q(`Always`,i)),Q(`Always`,Q(`Eventually`,a)))}default:throw Bf(e)}};return c(e,t)},qf=(e,t,n,r,i)=>{let a=e=>qf(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a={environment:r,scope:e.scope,state:t,next:void 0},o=e.kind===`State`?Qa(X(e.expression,a),`a temporal property predicate`):Na(e.step,a);return i.set(e,o),o}case`Action`:{if(e.enabled&&i.get(e.enabled)===!1)return!1;let a={environment:r,scope:e.scope,state:t,next:n};return e.unchanged&&Qa(X(e.unchanged,a),`a subscript`)?!1:Qa(X(e.expression,a),`an action predicate`)}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return qf(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new u(`TLC cannot evaluate a temporal formula in a single step`)}},Jf=(e,t,n,r,i)=>{let a=e=>e+1<t.length?e+1:n,o=e=>t.map((e,t)=>t).filter(t=>t>=Math.min(e,n)),s=(e,a=r)=>Jf(e,t,n,a,i);switch(e.kind){case`Not`:return!s(e.body);case`And`:return e.operands.every(e=>s(e));case`Or`:return e.operands.some(e=>s(e));case`Next`:return s(e.body,a(r));case`Always`:return o(r).every(t=>s(e.body,t));case`Eventually`:return o(r).some(t=>s(e.body,t));default:return qf(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Yf=(e,t)=>e.every((e,n)=>ze(e,t[n])),Xf=e=>e.filter((t,n)=>n===0||e[n-1]!==t),Zf=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.successors.push([]),e.offsets.push(-1),e.nodeStates.length-1),Qf=(e,t,n)=>{let r=e.slots.length/3-1,i=Math.imul(Math.imul(t,2654435761)^n,2246822507)>>>e.shift;for(let a=i;;a=a+1&r){let r=a*3,i=e.slots[r];if(i===0||i===t+1&&e.slots[r+1]===n)return r}},$f=(e,t)=>e.offsets[t]!==-1,ep=(e,t,n)=>e.results.bytes[e.offsets[t]+n]===1,tp=2**53-1,np=(e,t,n,r)=>{if(e.length===0)return;let i=t.map(e=>Kf(e.expression,e.scope,n)),a=e.map(e=>Q(`Not`,Kf(e.expression,e.scope,n))),o=a.length===1?a[0]:of(`Or`,a),s=i.length===0?o:of(`And`,[...i,o]),c=Ff(s);if(c.length===0)throw new u(Hf);let l=/* @__PURE__ */ new Map,d=c.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=df(e),n=l.get(t)??l.size;return l.set(t,n),n}),nodeStates:[],nodeTableaux:[],successors:[],offsets:[],results:{bytes:/* @__PURE__ */ new Uint8Array(1024),length:0},initial:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],errorNode:void 0})),f={multiplier:1},p=!Ko(n),m={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},h=e=>{let t=m.states.get(e)??/* @__PURE__ */ new Map;return m.states.set(e,t),t},g=(e,t)=>{n.runtime.setLivenessSource(e);let r=t();return n.runtime.setLivenessSource(void 0),r},_=(e,t)=>qf(e,t,void 0,n,p?h(t):/* @__PURE__ */ new Map),v=(e,t,n)=>g(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!_(e,n))),y=(e,t,r,i)=>g(t,()=>{let t=e.solution.actionChecks;if(!p)return Uint8Array.from(t,e=>+!!qf(e,r,i,n,/* @__PURE__ */ new Map));let a=h(r),o=m.actions.get(r)??/* @__PURE__ */ new Map;m.actions.set(r,o);let s=o.get(i)??new Int8Array(l.size).fill(-1);return o.set(i,s),Uint8Array.from(e.actionIds,(e,o)=>(s[e]===-1&&(s[e]=+!!qf(t[o],r,i,n,a)),s[e]))}),ee=(e,t,n,r)=>g(n,()=>e.nodes[t].statePredicates.every(e=>_(e,r))),b=(e,t)=>{let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},x=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),te=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=Qf(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},ne=(e,t,n)=>{let r=Zf(e,t,n),i=e.nodeIds;if(++i.size*2>i.slots.length/3){let e=i.slots;i.slots=new Int32Array(e.length*2),i.shift--;for(let t=0;t<e.length;t+=3)e[t]!==0&&i.slots.set(e.subarray(t,t+3),Qf(i,e[t]-1,e[t+1]))}return i.slots.set([t+1,n,r],Qf(i,t,n)),r},re=(e,t,n)=>t.nodes.flatMap((t,r)=>te(e,n,r)??[]).sort((e,t)=>e-t),S=(e,t,n,r)=>{let i=e.solution.actionChecks.length,a=e.results,o=a.length;if(a.length+=r.length+n.length*i,a.length>a.bytes.length){let e=new Uint8Array(Math.max(2*a.bytes.length,a.length));e.set(a.bytes),a.bytes=e}a.bytes.set(r,o),n.forEach((e,t)=>a.bytes.set(e,o+r.length+t*i)),e.offsets[t]=o,e.successors[t]=e.successors[t].slice()},ie=(e,t,n)=>{let i={slots:Array.from({length:16*f.multiplier}),count:0},a=(e,t)=>{for(let n=(r.getFingerprint(t.index)&2147483647)%e.length;;n=(n+1)%e.length){let r=e[n];if(r===void 0)return e[n]=t,!0;if(r.index===t.index&&Yf(r.state,t.state))return!1}},o=e=>{if(i.count>=i.slots.length>>1){let e=i.slots;i.slots=Array.from({length:2*e.length+1});for(let t of e)t&&a(i.slots,t)}a(i.slots,e)&&i.count++};return n.forEach(o),o({index:e,state:t}),i.slots.length>16*f.multiplier&&f.multiplier++,i.slots.filter(e=>e!==void 0)},C=(e,t,n,i,a)=>{let o=v(e,i,n),s=t.nodes[e.nodeTableaux[a]],c=[],l=e.successors[a],u=s.successors.length>0?y(e,i,n,n):/* @__PURE__ */ new Uint8Array;for(let r of s.successors){if(!ee(t,r,i,n))continue;if(b(t,r)&&e.errorNode===void 0&&x(e)){e.errorNode=a;return}let o=te(e,i,r);if(o!==void 0&&l.includes(o))continue;let s=o??ne(e,i,r);l.push(s),c.push(u),o===void 0&&C(e,t,n,i,s)}for(let a of r.getSuccessors(n)){let r=y(e,i,n,a.state),o=e.isDone[a.index]===!0;for(let n of s.successors){if(!ee(t,n,i,a.state))continue;let s=te(e,a.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??ne(e,a.index,n);l.push(u),c.push(r),s===void 0&&o&&C(e,t,a.state,a.index,u)}}l.length>0&&S(e,a,c,o)},ae=(e,t,n,r,i,a)=>{let o=t.nodes.map((e,r)=>n.map(e=>ee(t,r,a,e.state)));e.isDone[a]=!0;for(let s of re(e,t,a)){let a=e.successors[s],c=[];n.forEach((n,i)=>{let l=e.isDone[n.index]===!0;for(let u of t.nodes[e.nodeTableaux[s]].successors){if(!o[u][i])continue;let s=te(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??ne(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&C(e,t,n.state,n.index,d)}}),S(e,s,c,i)}if(e.errorNode!==void 0)return Xf(oe(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},w=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)Zf(e,e.nodeStates.length,-1);let a=e.successors[i],o=[];t.forEach((t,r)=>{$f(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),S(e,i,o,r)},oe=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)$f(e,t)&&(r.push(t),n.set(t,-1));for(let i=0;i<r.length;i++){let a=r[i];for(let i of e.successors[a])if(!(i===a&&e.solution.tableau)){if(i===t){let e=[t];for(let t=a;t!==-1;t=n.get(t)??-1)e.push(t);return e}$f(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new u(`Couldn't re-create liveness trace (path) starting at: ${t}`)},T=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=n.stateChecks.length,a=(t,n,a)=>e.results.bytes[e.offsets[t]+i+n*r+a]===1,o=(e,n)=>t.eventuallyAlways.every(t=>a(e,n,t)),s=new Float64Array(e.nodeStates.length).fill(-1),c=e.initial.filter(t=>$f(e,t)),l=[],d=t=>{let n=e.successors[t].indexOf(t);return n!==-1&&o(t,n)},f=(t,r)=>n.tableau!==void 0&&Mf(n.tableau.nodes[e.nodeTableaux[t]].particle,r),p=r=>{let i=l.pop()??r;if(i===r&&!d(i)){s[i]=tp;return}let c=/* @__PURE__ */ new Set,u=/* @__PURE__ */ new Map;for(let t=i;;t=l.pop()??r){c.add(t);let n=u.get(e.nodeStates[t]);if(n?n.push(t):u.set(e.nodeStates[t],[t]),s[t]=tp,t===r)break}let p=t.infinitelyOftenStates.every(t=>[...c].some(n=>ep(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...c].some(n=>e.successors[n].some((e,r)=>c.has(e)&&o(n,r)&&a(n,r,t)))),g=n.promises.every(e=>[...c].some(t=>f(t,e)));if(p&&h&&g)return m(r,c,u)},m=(r,i,s)=>{let c=Xf(oe(e,r).reverse().map(t=>e.nodeStates[t])),l=[],d=/* @__PURE__ */ new Set([r]),p=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),g=n.promises.map(()=>!1),_={count:p.length+m.length+g.length},v={node:r},y=e=>i.has(e),ee=e=>{l.push(v.node),v.node=e};for(;_.count>0;){let r=_.count;for(;t.infinitelyOftenStates.forEach((t,n)=>{!p[n]&&ep(e,v.node,t)&&(p[n]=!0,_.count--)}),n.promises.forEach((e,t)=>{!g[t]&&f(v.node,e)&&(g[t]=!0,_.count--)}),!(_.count<=0);){let n={last:-1,unvisited:-1},i=_.count;if(e.successors[v.node].some((r,c)=>{if(s.has(e.nodeStates[r])){if(!y(r)||!o(v.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&a(v.node,c,e)&&(m[t]=!0,_.count--)})}return _.count<i?(ee(r),d.clear(),!0):(y(r)&&!d.has(r)&&(n.unvisited=r),!1)}))break;if(_.count<r){ee(n.last),d.clear();break}for(;n.unvisited===-1;){let t=l.pop();if(t===void 0)throw new u(`TLC failed to build the counterexample of a liveness property`);v.node=t,n.unvisited=e.successors[t].find(e=>y(e)&&!d.has(e))??-1}ee(n.unvisited),d.add(n.unvisited)}}let b=h(r,v.node,s,o);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];b[b.length-1]!==n&&b.push(n)}let x=c[c.length-1];return b[b.length-1]===x&&b.pop(),{prefix:c.slice(0,-1),cycle:[x,...b.reverse()]}},h=(t,n,r,i)=>{if(n===t)return[];let a=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([a]),c=[];for(let n=a,l=-1,d=0;;d++){for(let u of r.get(n)??[])for(let[d,f]of e.successors[u].entries()){if(f===u||!i(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==a;)e.push(t),t=r,r=o.get(t)??-1;return e.push(a),e}let p=e.nodeStates[f];r.has(p)&&!s.has(p)&&(s.add(p),c.push([p,n]))}o.set(n,l);let f=c[d];if(f===void 0)throw new u(`TLC failed to build the counterexample of a liveness property`);n=f[0],l=f[1]}};for(let t=0;t<c.length;t++){let n=[c[t],-1,0],r={link:0};for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),a=n.pop()??0;if(i===-42){if(s[a]===t){let e=p(a);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(s[a]!==-1){n.push(Math.min(t,s[a]));continue}s[a]=r.link,n.push(t,a,-42),l.push(a);let u={value:r.link++};e.successors[a].forEach((t,r)=>{$f(e,t)&&(o(a,r)?s[t]===-1?n.push(t,-1):u.value=Math.min(u.value,s[t]):s[t]===-1&&c.push(t))}),n.push(u.value)}}};return{addInitialState:(e,t)=>{m.states.clear(),m.actions.clear();for(let n of d){let r=n.solution.tableau;if(!r)n.initial.push(e);else for(let i=0;i<r.initialCount;i++)ee(r,i,void 0,t)&&n.initial.push(te(n,e,i)??ne(n,e,i))}},addState:(e,t,n)=>{m.states.clear(),m.actions.clear();let r=ie(e,t,n);for(let n of d){let i=r.map(r=>y(n,e,t,r.state)),a=v(n,e,t),o=n.solution.tableau,s=o?ae(n,o,r,i,a,e):w(n,r,i,a,e);if(s)return s}},findViolation:()=>{for(let e of d)for(let t of e.solution.models){let n=T(e,t);if(n)return n}},getViolatedProperties:(t,r)=>[...new Set(e.filter((e,i)=>!Jf(a[i].body,t,r,0,n)).map(e=>e.name))]}},rp=`UnnamedAction`,ip={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},ap=e=>{let t=e.range??ip;return Ot([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},op=e=>{let t=[[`name`,e.name],[`location`,ap(e.location)]];return e.parameters.length===0?Ot(t):Ot([...t,[`context`,Ot(e.parameters)],[`parameters`,R(e.parameters.map(e=>e[0]))]])},sp=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),cp=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),lp=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,up=e=>e.kind===`Apply`?e.args:[],dp=(e,t,n)=>{let r=lp(e);if(r===void 0)return;if(W(e)){let e=Ja(t,r);return e?.kind===`Operator`&&e.operator.kind===`Closure`?e.operator:void 0}if(n.constants.has(r)||n.variableIndex.has(r))return;let i=vo(r,n);return i?.kind===`Closure`?i:void 0},fp=(e,t)=>{try{return X(e,cp(t,void 0)),!0}catch(e){if(e instanceof s)return!1;throw e}},pp=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&to(e,t)&&fp(e.body,t),mp=(e,t)=>{let n=$a(e.name,t);return n?.body===e.body&&pp(n,t)},hp=(e,t)=>{if(e.kind!==`Identifier`||!W(e))return;let n=Ja(t,e.name);return n?.kind===`Thunk`?n:void 0},gp=(e,t)=>(e?.params??[]).flatMap(e=>{let n=Ja(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),_p=(e,t)=>{try{return e()}catch(e){if(e instanceof s)return t();throw e}},vp=(e,t,n,r,i)=>{let a=up(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return!r||a.length===0?[{...e,parameters:[],expression:t,scope:n}]:a.some(e=>$(e,n,i)!==0)?o():_p(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),X(e,cp(i,n))]),expression:t,scope:n}],o)},yp=(e,t,n,r,i)=>{let a=()=>({name:n?.name??rp,location:e.location,parameters:gp(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return yp(e.body,Po(e.definitions,cp(r,t)),n,r,i);case`Label`:return yp(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>yp(e,t,n,r,i));case`Exists`:return _p(()=>{let o=[];return io(e.bounds,cp(r,t),t=>(o.push(...yp(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=W(e)?void 0:i.get(lp(e)??``),s=dp(e,t,r);if(o)return vp(o,e,t,s,r);if(!s)return[a()];let c=up(e),l=()=>[{name:s.name,location:e.location,parameters:[],expression:e,scope:t}];return mp(s,r)||c.some(e=>$(e,t,r)!==0)?l():_p(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:X(n,cp(r,t))},parent:e}),s.scope);return yp(s.body,e,s,r,i)},l)},bp=(e,t,n,r,i)=>{let a=(e,t)=>bp(e,t,n,r,i);if(e.kind===`Let`){a(e.body,Po(e.definitions,cp(n,t)));return}let o=hp(e,t);if(o){a(o.expression,o.scope);return}let s=dp(e,t,n);if(s&&mp(s,n))return;if(s&&s.params.length===0){if($(s.body,s.scope,n)===1){r.inits.push(sp(s.name,s.body));return}a(s.body,s.scope);return}if(s&&e.kind===`Apply`&&s.params.length===e.args.length){a(s.body,Mo(s,e.args,cp(n,t)));return}if(e.kind===`And`){e.operands.forEach(e=>a(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t});return}r.temporals.push(sp(rp,e));return}let c=$(e,t,n);c<=1?r.inits.push(sp(rp,e)):c===3&&r.temporals.push(sp(rp,e))},xp=(e,t,n,r,i)=>{let a=(t,n)=>xp(e,t,n,r,i);if(t.kind===`Let`){a(t.body,Po(t.definitions,cp(r,n)));return}let o=hp(t,n);if(o){a(o.expression,o.scope);return}let s=dp(t,n,r);if(s&&mp(s,r))return;if(s&&s.params.length===up(t).length){a(s.body,t.kind===`Apply`?Mo(s,t.args,cp(r,n)):s.scope);return}if(t.kind===`Forall`&&_p(()=>(io(t.bounds,cp(r,n),e=>(a(t.body,e),!1)),!0),()=>!1))return;if(t.kind===`And`){t.operands.forEach(e=>a(e,n));return}if(t.kind===`Always`){let a=t.expression;a.kind===`BoxAction`?i.impliedActions.push(sp(e,a)):$(a,n,r)<2?i.invariants.push(sp(e,a)):i.impliedTemporals.push(sp(e,t));return}let c=$(t,n,r);c<=1?i.impliedInits.push(sp(e,t)):c===3&&i.impliedTemporals.push(sp(e,t))},Sp=(e,t)=>{let n=$a(e,t);return n?.kind===`Operator`&&!pp(n,t)?n:void 0},Cp=e=>Ot([[`name`,e.name],[`location`,ap(e.location)]]),wp=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:Sp(e.specification,t);a&&(bp(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...yp(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:vo(e.init,t);o?.kind===`Closure`&&r.inits.push(sp(e.init??``,o.body));let s=e.next===void 0?void 0:vo(e.next,t);return s?.kind===`Closure`&&r.actions.push(...yp(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=Sp(e,t);n&&r.invariants.push(sp(e,n.body))}),e.properties.forEach(e=>{let n=Sp(e,t);n&&xp(e,n.body,void 0,t,r)}),r},Tp=(e,t,n)=>wp(e,t,n).actions,Ep=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>U(e[1])).join(`,`)})`,Dp=e=>`${e.name===rp?`Action`:e.name}${Ep(e)} ${za(e.location.range??ip)}`,Op=e=>`${e.name}${Ep(e)}`,kp=(e,t,n,r)=>{let i=wp(e,t,r),a=e=>ft(e.map(op)),o=e=>ft(e.flatMap(e=>{let n=Sp(e,t);return n?[Cp(n)]:[]}));return Ot([[`inits`,a(i.inits)],[`actions`,a(i.actions)],[`temporals`,a(i.temporals)],[`invariants`,a(i.invariants)],[`impliedinits`,a(i.impliedInits)],[`impliedactions`,a(i.impliedActions)],[`impliedtemporals`,a(i.impliedTemporals)],[`variables`,ft(t.variables.map((e,t)=>Ot([[`name`,e],[`location`,ap(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},Ap=`paired12`,jp=(e,t=16)=>e<=t*.75?t:jp(e,t*2),Mp=(e,t)=>{let n=jp(e.length)-1,r=e=>{let r=t(e);return(r^r>>>16)&n};return e.map((e,t)=>({key:e,position:t,bucket:r(e)})).sort((e,t)=>e.bucket-t.bucket||e.position-t.position).map(e=>e.key)},Np=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),Pp=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),Fp=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),Ip=e=>Fp(e).replaceAll(`
|
|
411
|
+
`,`\\n`),Lp=(e,t)=>{let n=[],r=e=>n.push(`State ${n.length+1}:\n${e.getText()}\n`);return{writeInitialState:r,writeSuccessor:(e,t,n)=>{n||r(t)},close:()=>t?.(e.path,n.join(``))}},Rp=(e,t)=>{let n=[`strict digraph DiskGraph {
|
|
412
412
|
`,`node [shape=box,style=rounded]
|
|
413
|
-
`,e.colorize?`edge [colorscheme="${
|
|
413
|
+
`,e.colorize?`edge [colorscheme="${Ap}"]\n`:``,`nodesep=0.35;
|
|
414
414
|
`,`subgraph cluster_graph {
|
|
415
415
|
`,`color="white";
|
|
416
416
|
`],r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=r.get(e.level)??/* @__PURE__ */ new Set;r.set(e.level,t.add(e.fingerprint))},o=e=>{if(!e)return 1;let t=i.get(e.name)??i.size+2;return i.set(e.name,t),t},s=()=>[`subgraph cluster_legend {graph[style=bold];label = "Next State Actions" style="solid"
|
|
417
|
-
`,`node [ labeljust="l",colorscheme="${
|
|
418
|
-
`,e.colorize&&i.size>1?s():``,`}`].join(``),l=()=>{e.snapshot&&t?.(e.path.replaceAll(`.dot`,`_snapshot.dot`),n.join(``)+c())};return{writeInitialState:e=>{n.push(`${e.fingerprint} [label="${Fp(e.getLabel())}",style = filled]\n`),a(e),l()},writeSuccessor:(t,r,i,s)=>{let c=e.colorize?String(o(s)):`black`,u=e.actionLabels&&s?Pp(s.signature):``;n.push(`${t.fingerprint} -> ${r.fingerprint} [label="${u}",color="${c}",fontcolor="${c}"];\n`),i||n.push(`${r.fingerprint} [label="${Fp(r.getLabel())}",tooltip="${Fp(r.getText())}"];\n`),a(t),l()},close:()=>t?.(e.path,n.join(``)+c())}},Rp=(e,t)=>e.dot?Lp(e,t):Ip(e,t),zp=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),Bp=(e,t)=>{let n=/* @__PURE__ */ new Map;return(/* @__PURE__ */ new Set([...e.keys(),...t.keys()])).forEach(r=>{let i=e.get(r),a=i?t.get(i.name)??i:t.get(r);a&&a.name!==r&&n.set(r,a)}),n},Vp=(e,t)=>{if(!M(e))throw new l(`The symmetry values of ${t} must be functions`);let n=H(e),r=/* @__PURE__ */ new Map;return n.domain.forEach((e,t)=>{let i=n.range[t];if(!N(e)||!N(i))throw new l(`Symmetry function must have model values as domain and range`);e.name!==i.name&&r.set(e.name,i)}),r},Hp=(e,t)=>{let n=t.definitions.get(e);if(n?.kind!==`Operator`||n.params.length>0)throw new l(`The symmetry function ${e} must specify a set of permutations`);let r=X(n.body,{environment:t,scope:void 0,state:void 0,next:void 0});if(!j(r)||!z(r))throw new l(`The symmetry operator must specify a set of functions`);let i=B(r).elements.map(t=>Vp(t,e));if(n.body.kind===`Apply`&&n.body.args.length>=i.length)return[];let a=/* @__PURE__ */ new Map;i.forEach(e=>{e.size>0&&a.set(zp(e),e)});let o=[...a.values()],s={start:0};for(;s.start<a.size;){let e=[...a.values()],t=e.length;o.forEach(n=>e.slice(s.start,t).forEach(e=>{let t=Bp(n,e),r=zp(t);t.size>0&&!a.has(r)&&a.set(r,t)})),s.start=t}let c=Math.max(256,Math.floor(4194304/a.size));return[...a.values()].map(e=>({images:e,cache:/* @__PURE__ */ new WeakMap,cacheSize:0,cacheLimit:c}))},Up=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=Kp(r,t);if(i===r)continue;let a=e.slice(0,n);a.push(i);for(let r=n+1;r<e.length;r++)a.push(Kp(e[r],t));return a}},Wp=(e,t)=>{let n=[],r=[];for(let i of e){let e=Kp(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(L);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(L(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},Gp=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,Kp=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=Gp(e);if(n===0||n>64)return qp(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=qp(e,t),a=i!==e&&ze(i,e)?e:i;return t.cacheSize>=t.cacheLimit&&(t.cache=/* @__PURE__ */ new WeakMap,t.cacheSize=0),t.cache.set(e,a),t.cacheSize++,a},qp=(e,t)=>{let n=e.kind;if(n===`Set`){let n=Wp(e.elements,t);return n?Fe(n):e}if(n===`Function`||n===`LazyFunction`&&z(e.domain)){let n=H(e),r=Up(n.domain,t),i=Up(n.range,t)??n.range;if(r){let e=vt(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Ie(n.domain,e.range):e}return i===n.range?n:Ie(n.domain,i)}if(n===`Interval`||!j(e)||!z(e))return e;let r=B(e),i=Up(r.elements,t);return i?ft(i):r},Jp=(e,t,n)=>{for(let r=t.length;r<e.length;r++)t.push(Kp(e[r],n));return t},Yp=(e,t,n,r)=>{let i=[];for(let a=0;a<e.length;a++){let o=r?r[a]:a,s=Kp(e[o],n),c=L(s,t[o]);if(c>0)return;if(r||i.push(s),c<0)return r?e.map(e=>Kp(e,n)):Jp(e,i,n)}},Xp=(e,t,n)=>t.reduce((t,r)=>Yp(e,t,r,n)??t,e),Zp=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],Qp=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),$p=new Map(_u.flatMap(e=>e.map(t=>[t,e[0]]))),em=e=>$p.get(e)??e,tm=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},nm=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(tm(e.name)&2147483647)%t,i=()=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let i=e.buckets.length-1;i>=0;i--)for(let a of e.buckets[i])n[r(a,t)].unshift(a);e.buckets=n,e.threshold=Math.floor(t*.75)};return{put:a=>{t.has(a.key)||(n.length>=e.threshold&&i(),e.buckets[r(a,e.buckets.length)].unshift(a),t.add(a.key),n.push(a))},inserted:n,enumerate:()=>e.buckets.toReversed().flat()}},rm=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),im=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:em(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:em(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=e.findIndex((e,n)=>n>t&&e.text===`)`);return{name:n.text,end:i+1}},am=(e,t)=>{let n=[];for(let r=t;;){let t=im(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},om=e=>({line:e.line,column:e.column}),sm=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(a.text===`EXTENDS`){let n=am(e,t+1);s.extends.push(...n),n.forEach(e=>r.add(e))}else a.text===`INSTANCE`&&e[t+1]?.kind===`Identifier`&&s.instances.push(e[t+1].text)}return{references:s,end:e.length}};return i(0,t??``).references},cm=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,lm={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},um=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&cm(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&cm(e[n+1],e[n+2])?n+=cm(e[n+2],e[n+3])?3:2:(r.text!==`MODULE`||e[n-1]?.kind!==`Separator`)&&t.push(r.kind===`String`?`"${r.text.replace(/[\\"\n\t\r\f]/g,e=>lm[e])}"`:r.text)}return t},dm=e=>{let t=/* @__PURE__ */ new Map,n=[];return e.forEach((r,i)=>{r.kind===`Separator`&&e[i+1]?.text===`MODULE`&&n.push({name:e[i+2].text,start:i});let a=r.kind===`ModuleEnd`?n.pop():void 0;a&&!t.has(a.name)&&t.set(a.name,{start:a.start,end:i+1})}),t},fm=(e,t)=>e.find(e=>e.name===t)??e.map(e=>fm(e.modules,t)).find(Boolean),pm=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=i=>{let a=n.get(i??``);if(a)return a;let o=i===void 0?e:xu.get(i)??t?.(i)??pc(e,i),s=o===void 0?[]:oe(o),c=dm(s),l=c.get(s[2]?.text??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=hc(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>fm(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},mm=(e,t)=>{let n=pm(e,t),r=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],o=(e,n)=>{let i=am(t,e+1);r.push({location:om(t[e]),apply:e=>i.forEach(t=>e.put(rm(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,a)=>{let l=e.start+a,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;r.push({location:om(u),apply:t=>t.put(rm(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&o(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&o(l,`variable`),u.text===`RECURSIVE`&&am(t,l+1).every(e=>s.has(e))&&o(l,`definition`),Qp.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(om(u)),r.push({location:om(u),apply:e=>e.put(rm(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{i.push(e.location);let t=e.name;t!==void 0&&r.push({location:e.location,apply:e=>e.put(rm(t,`theorem`,!1))})});let l=e=>i.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=em(e.name);r.push({location:e.location,apply:n=>n.put(rm(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=a(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...i,...o].forEach(n=>{n.isLocal||t.put(rm(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(rm(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>Ar(e.location,t.location)?-1:+!!Ar(t.location,e.location))},i=/* @__PURE__ */ new Map,a=e=>{let t=i.get(e??``);if(t)return t;let o=nm();i.set(e??``,o),gu.toReversed().forEach(e=>o.put(rm(e,`builtin`,!1)));let s=n(e);return s.getModule().extends.forEach(e=>a(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),r(s).forEach(e=>e.apply(o)),o};return a(void 0).enumerate().filter(e=>e.kind===`variable`).map(e=>e.name).reverse()},hm=(e,t,n)=>{let r=pm(e,n),i=/* @__PURE__ */ new Set,a=e=>{i.add(e)},o=e=>{e.kind===`ModelValue`&&a(e.name),e.kind===`String`&&a(e.value),e.kind===`Set`&&e.elements.forEach(o)};t.constants.forEach(e=>{e.args?.forEach(o),o(e.value)}),vu.forEach(a);let s=e=>{let t=r(e);return t.tokens.slice(t.start,t.end)},c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=e=>{let t=l.get(e);if(t)return t;let n=sm(s(e),e,c);return l.set(e,n),n},d=e=>c.get(e)??u(e),f=/* @__PURE__ */ new Set,p=(e,t)=>c.has(t)||f.has(`${e.key}>${t}`),m=(e,t,n)=>{let r=[...e.extends.map(d),...e.instances.filter(t=>p(e,t)).map(d),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},h=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!p(n,e));return i===void 0?m(n,r,t):[n,i]};return t},g=h(e=>e.extends),_=h(e=>e.instances),v=/* @__PURE__ */ new Set([void 0]),y=/* @__PURE__ */ new Map;um(s(void 0)).forEach((e,t)=>{t===3&&bu.forEach(a),a(e)});let ee=u(void 0);for(;;){let e=g(ee,/* @__PURE__ */ new Set)??_(ee,/* @__PURE__ */ new Set);if(!e)break;let[t,n]=e;f.add(`${t.key}>${n}`),y.set(t.unit,[...y.get(t.unit)??[],n]),!v.has(n)&&(v.add(n),um(s(n)).forEach(a))}Zp.forEach(a);let b=/* @__PURE__ */ new Set,x=e=>{if(b.has(e))return;b.add(e);let t=y.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(x),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return x(void 0),yu.forEach(a),[...i]},gm=(e,t)=>e*((t-e)/2**64),_m=e=>e.includes(`.`)?e:`${e}.0`,vm=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return _m(String(e));let[n,r]=e.toExponential().split(`e`);return`${_m(n)}E${r.replace(`+`,``)}`},ym=e=>e!==void 0&&e>=`0`&&e<=`9`,bm=e=>{if(e===0)return`0.0`;let t=vm(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;ym(t[n.next]);)n.result+=t[n.next++],n.digits++;if(n.next===t.length)return n.result;if(t[n.next]!==`.`)return t;if(n.next++,n.digits>=2)for(;ym(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;ym(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(ym(t[n.next])&&Number(t[n.next])>=5&&(n.result=xm(n.result));ym(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},xm=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${xm(r)}.`:n===`9`?`${xm(r)}0`:`${r}${Number(n)+1}`},Sm=e=>{let t={value:0};for(;10n**BigInt(t.value+1)<e*10n;)t.value++;let n=10n**BigInt(t.value+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t.value+1}`)},Cm=(e,t,n)=>{if(gm(e,t)<1e-10)return;let r=n().sort(),i=new Int32Array(r.buffer),a={narrow:1/0,wide:9223372036854775807n};for(let e=1;e<r.length;e++){let t=i[2*e+1],n=i[2*e-1];if(t<0!=n<0)continue;let o=t-n;if(o<=1048576){let t=o*4294967296+(i[2*e]>>>0)-(i[2*e-2]>>>0);a.narrow=Math.min(a.narrow,t)}else{let t=r[e]-r[e-1];t<a.wide&&(a.wide=t)}}if(a.narrow===1/0)return a.wide;let o=BigInt(a.narrow);return o<a.wide?o:a.wide},wm=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a={count:0},o=n.find(t=>(a.count+=e[t],a.count>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},Tm={line:0,column:0},Em=`Failed to recover the initial state from its fingerprint.`,Dm=`Failed to recover the next state from its fingerprint.`,Om=e=>({kind:`Identifier`,name:e,location:Tm}),km=/* @__PURE__ */ new Set([`name`,`property`]),Am=(e,t,n)=>{let r=$a(t,n);if(!r)throw new l(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new l(km.has(e)?`TLC requires ${t} not to take any argument.`:`TLC requires ${e} not to take any argument, but one was given: ${t}`);return r},jm=(e,t,n)=>{let r=Am(e,t,n);if(to(r,n))throw new l(`The ${e} ${t} cannot be a constant.`);return r},Mm=(e,t,n)=>{if(to(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return X(Om(e),Zm(n,void 0,void 0))}catch(e){if(e instanceof u)return;throw e}},Nm=(e,t,n)=>{let r=Am(e,t,n),i=Mm(t,r,n);if(i!==void 0&&i!==!0)throw new l(`The ${e} of ${t} is equal to ${U(i)}`);return i===void 0?r:void 0},Pm=(e,t)=>{let n=Rd({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>$a(e,t)});return e.flatMap(e=>{let r=Nm(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2)throw new l(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${i.params.size===0?``:`
|
|
417
|
+
`,`node [ labeljust="l",colorscheme="${Ap}",style=filled,shape=record ]\n`,...Mp([...i.keys()],Pp).map(e=>`${e.replaceAll(`!`,`:`)} [label="${e}",fillcolor=${i.get(e)}]\n`),`}`].join(``),c=()=>[...Mp([...r],e=>e[0]).map(e=>`{rank = same; ${Mp([...e[1]],Np).map(e=>`${e};`).join(``)}}\n`),`}
|
|
418
|
+
`,e.colorize&&i.size>1?s():``,`}`].join(``),l=()=>{e.snapshot&&t?.(e.path.replaceAll(`.dot`,`_snapshot.dot`),n.join(``)+c())};return{writeInitialState:e=>{n.push(`${e.fingerprint} [label="${Ip(e.getLabel())}",style = filled]\n`),a(e),l()},writeSuccessor:(t,r,i,s)=>{let c=e.colorize?String(o(s)):`black`,u=e.actionLabels&&s?Fp(s.signature):``;n.push(`${t.fingerprint} -> ${r.fingerprint} [label="${u}",color="${c}",fontcolor="${c}"];\n`),i||n.push(`${r.fingerprint} [label="${Ip(r.getLabel())}",tooltip="${Ip(r.getText())}"];\n`),a(t),l()},close:()=>t?.(e.path,n.join(``)+c())}},zp=(e,t)=>e.dot?Rp(e,t):Lp(e,t),Bp=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),Vp=(e,t)=>{let n=/* @__PURE__ */ new Map;return(/* @__PURE__ */ new Set([...e.keys(),...t.keys()])).forEach(r=>{let i=e.get(r),a=i?t.get(i.name)??i:t.get(r);a&&a.name!==r&&n.set(r,a)}),n},Hp=(e,t)=>{if(!M(e))throw new l(`The symmetry values of ${t} must be functions`);let n=H(e),r=/* @__PURE__ */ new Map;return n.domain.forEach((e,t)=>{let i=n.range[t];if(!N(e)||!N(i))throw new l(`Symmetry function must have model values as domain and range`);e.name!==i.name&&r.set(e.name,i)}),r},Up=(e,t)=>{let n=t.definitions.get(e);if(n?.kind!==`Operator`||n.params.length>0)throw new l(`The symmetry function ${e} must specify a set of permutations`);let r=X(n.body,{environment:t,scope:void 0,state:void 0,next:void 0});if(!j(r)||!z(r))throw new l(`The symmetry operator must specify a set of functions`);let i=B(r).elements.map(t=>Hp(t,e));if(n.body.kind===`Apply`&&n.body.args.length>=i.length)return[];let a=/* @__PURE__ */ new Map;i.forEach(e=>{e.size>0&&a.set(Bp(e),e)});let o=[...a.values()],s={start:0};for(;s.start<a.size;){let e=[...a.values()],t=e.length;o.forEach(n=>e.slice(s.start,t).forEach(e=>{let t=Vp(n,e),r=Bp(t);t.size>0&&!a.has(r)&&a.set(r,t)})),s.start=t}let c=Math.max(256,Math.floor(4194304/a.size));return[...a.values()].map(e=>({images:e,cache:/* @__PURE__ */ new WeakMap,cacheSize:0,cacheLimit:c}))},Wp=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=qp(r,t);if(i===r)continue;let a=e.slice(0,n);a.push(i);for(let r=n+1;r<e.length;r++)a.push(qp(e[r],t));return a}},Gp=(e,t)=>{let n=[],r=[];for(let i of e){let e=qp(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(L);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(L(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},Kp=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,qp=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=Kp(e);if(n===0||n>64)return Jp(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=Jp(e,t),a=i!==e&&ze(i,e)?e:i;return t.cacheSize>=t.cacheLimit&&(t.cache=/* @__PURE__ */ new WeakMap,t.cacheSize=0),t.cache.set(e,a),t.cacheSize++,a},Jp=(e,t)=>{let n=e.kind;if(n===`Set`){let n=Gp(e.elements,t);return n?Fe(n):e}if(n===`Function`||n===`LazyFunction`&&z(e.domain)){let n=H(e),r=Wp(n.domain,t),i=Wp(n.range,t)??n.range;if(r){let e=vt(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Ie(n.domain,e.range):e}return i===n.range?n:Ie(n.domain,i)}if(n===`Interval`||!j(e)||!z(e))return e;let r=B(e),i=Wp(r.elements,t);return i?ft(i):r},Yp=(e,t,n)=>{for(let r=t.length;r<e.length;r++)t.push(qp(e[r],n));return t},Xp=(e,t,n,r)=>{let i=[];for(let a=0;a<e.length;a++){let o=r?r[a]:a,s=qp(e[o],n),c=L(s,t[o]);if(c>0)return;if(r||i.push(s),c<0)return r?e.map(e=>qp(e,n)):Yp(e,i,n)}},Zp=(e,t,n)=>t.reduce((t,r)=>Xp(e,t,r,n)??t,e),Qp=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],$p=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),em=new Map(_u.flatMap(e=>e.map(t=>[t,e[0]]))),tm=e=>em.get(e)??e,nm=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},rm=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(nm(e.name)&2147483647)%t,i=()=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let i=e.buckets.length-1;i>=0;i--)for(let a of e.buckets[i])n[r(a,t)].unshift(a);e.buckets=n,e.threshold=Math.floor(t*.75)};return{put:a=>{t.has(a.key)||(n.length>=e.threshold&&i(),e.buckets[r(a,e.buckets.length)].unshift(a),t.add(a.key),n.push(a))},inserted:n,enumerate:()=>e.buckets.toReversed().flat()}},im=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),am=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:tm(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:tm(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=e.findIndex((e,n)=>n>t&&e.text===`)`);return{name:n.text,end:i+1}},om=(e,t)=>{let n=[];for(let r=t;;){let t=am(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},sm=e=>({line:e.line,column:e.column}),cm=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(a.text===`EXTENDS`){let n=om(e,t+1);s.extends.push(...n),n.forEach(e=>r.add(e))}else a.text===`INSTANCE`&&e[t+1]?.kind===`Identifier`&&s.instances.push(e[t+1].text)}return{references:s,end:e.length}};return i(0,t??``).references},lm=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,um={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},dm=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&lm(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&lm(e[n+1],e[n+2])?n+=lm(e[n+2],e[n+3])?3:2:(r.text!==`MODULE`||e[n-1]?.kind!==`Separator`)&&t.push(r.kind===`String`?`"${r.text.replace(/[\\"\n\t\r\f]/g,e=>um[e])}"`:r.text)}return t},fm=e=>{let t=/* @__PURE__ */ new Map,n=[];return e.forEach((r,i)=>{r.kind===`Separator`&&e[i+1]?.text===`MODULE`&&n.push({name:e[i+2].text,start:i});let a=r.kind===`ModuleEnd`?n.pop():void 0;a&&!t.has(a.name)&&t.set(a.name,{start:a.start,end:i+1})}),t},pm=(e,t)=>e.find(e=>e.name===t)??e.map(e=>pm(e.modules,t)).find(Boolean),mm=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=i=>{let a=n.get(i??``);if(a)return a;let o=i===void 0?e:xu.get(i)??t?.(i)??pc(e,i),s=o===void 0?[]:oe(o),c=fm(s),l=c.get(s[2]?.text??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=hc(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>pm(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},hm=(e,t)=>{let n=mm(e,t),r=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],o=(e,n)=>{let i=om(t,e+1);r.push({location:sm(t[e]),apply:e=>i.forEach(t=>e.put(im(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,a)=>{let l=e.start+a,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;r.push({location:sm(u),apply:t=>t.put(im(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&o(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&o(l,`variable`),u.text===`RECURSIVE`&&om(t,l+1).every(e=>s.has(e))&&o(l,`definition`),$p.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(sm(u)),r.push({location:sm(u),apply:e=>e.put(im(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{i.push(e.location);let t=e.name;t!==void 0&&r.push({location:e.location,apply:e=>e.put(im(t,`theorem`,!1))})});let l=e=>i.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=tm(e.name);r.push({location:e.location,apply:n=>n.put(im(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=a(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...i,...o].forEach(n=>{n.isLocal||t.put(im(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(im(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>Ar(e.location,t.location)?-1:+!!Ar(t.location,e.location))},i=/* @__PURE__ */ new Map,a=e=>{let t=i.get(e??``);if(t)return t;let o=rm();i.set(e??``,o),gu.toReversed().forEach(e=>o.put(im(e,`builtin`,!1)));let s=n(e);return s.getModule().extends.forEach(e=>a(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),r(s).forEach(e=>e.apply(o)),o};return a(void 0).enumerate().filter(e=>e.kind===`variable`).map(e=>e.name).reverse()},gm=(e,t,n)=>{let r=mm(e,n),i=/* @__PURE__ */ new Set,a=e=>{i.add(e)},o=e=>{e.kind===`ModelValue`&&a(e.name),e.kind===`String`&&a(e.value),e.kind===`Set`&&e.elements.forEach(o)};t.constants.forEach(e=>{e.args?.forEach(o),o(e.value)}),vu.forEach(a);let s=e=>{let t=r(e);return t.tokens.slice(t.start,t.end)},c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=e=>{let t=l.get(e);if(t)return t;let n=cm(s(e),e,c);return l.set(e,n),n},d=e=>c.get(e)??u(e),f=/* @__PURE__ */ new Set,p=(e,t)=>c.has(t)||f.has(`${e.key}>${t}`),m=(e,t,n)=>{let r=[...e.extends.map(d),...e.instances.filter(t=>p(e,t)).map(d),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},h=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!p(n,e));return i===void 0?m(n,r,t):[n,i]};return t},g=h(e=>e.extends),_=h(e=>e.instances),v=/* @__PURE__ */ new Set([void 0]),y=/* @__PURE__ */ new Map;dm(s(void 0)).forEach((e,t)=>{t===3&&bu.forEach(a),a(e)});let ee=u(void 0);for(;;){let e=g(ee,/* @__PURE__ */ new Set)??_(ee,/* @__PURE__ */ new Set);if(!e)break;let[t,n]=e;f.add(`${t.key}>${n}`),y.set(t.unit,[...y.get(t.unit)??[],n]),!v.has(n)&&(v.add(n),dm(s(n)).forEach(a))}Qp.forEach(a);let b=/* @__PURE__ */ new Set,x=e=>{if(b.has(e))return;b.add(e);let t=y.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(x),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return x(void 0),yu.forEach(a),[...i]},_m=(e,t)=>e*((t-e)/2**64),vm=e=>e.includes(`.`)?e:`${e}.0`,ym=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return vm(String(e));let[n,r]=e.toExponential().split(`e`);return`${vm(n)}E${r.replace(`+`,``)}`},bm=e=>e!==void 0&&e>=`0`&&e<=`9`,xm=e=>{if(e===0)return`0.0`;let t=ym(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;bm(t[n.next]);)n.result+=t[n.next++],n.digits++;if(n.next===t.length)return n.result;if(t[n.next]!==`.`)return t;if(n.next++,n.digits>=2)for(;bm(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;bm(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(bm(t[n.next])&&Number(t[n.next])>=5&&(n.result=Sm(n.result));bm(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},Sm=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${Sm(r)}.`:n===`9`?`${Sm(r)}0`:`${r}${Number(n)+1}`},Cm=e=>{let t={value:0};for(;10n**BigInt(t.value+1)<e*10n;)t.value++;let n=10n**BigInt(t.value+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t.value+1}`)},wm=(e,t,n)=>{if(_m(e,t)<1e-10)return;let r=n().sort(),i=new Int32Array(r.buffer),a={narrow:1/0,wide:9223372036854775807n};for(let e=1;e<r.length;e++){let t=i[2*e+1],n=i[2*e-1];if(t<0!=n<0)continue;let o=t-n;if(o<=1048576){let t=o*4294967296+(i[2*e]>>>0)-(i[2*e-2]>>>0);a.narrow=Math.min(a.narrow,t)}else{let t=r[e]-r[e-1];t<a.wide&&(a.wide=t)}}if(a.narrow===1/0)return a.wide;let o=BigInt(a.narrow);return o<a.wide?o:a.wide},Tm=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a={count:0},o=n.find(t=>(a.count+=e[t],a.count>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},Em={line:0,column:0},Dm=`Failed to recover the initial state from its fingerprint.`,Om=`Failed to recover the next state from its fingerprint.`,km=e=>({kind:`Identifier`,name:e,location:Em}),Am=/* @__PURE__ */ new Set([`name`,`property`]),jm=(e,t,n)=>{let r=$a(t,n);if(!r)throw new l(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new l(Am.has(e)?`TLC requires ${t} not to take any argument.`:`TLC requires ${e} not to take any argument, but one was given: ${t}`);return r},Mm=(e,t,n)=>{let r=jm(e,t,n);if(to(r,n))throw new l(`The ${e} ${t} cannot be a constant.`);return r},Nm=(e,t,n)=>{if(to(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return X(km(e),Qm(n,void 0,void 0))}catch(e){if(e instanceof u)return;throw e}},Pm=(e,t,n)=>{let r=jm(e,t,n),i=Nm(t,r,n);if(i!==void 0&&i!==!0)throw new l(`The ${e} of ${t} is equal to ${U(i)}`);return i===void 0?r:void 0},Fm=(e,t)=>{let n=Rd({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>$a(e,t)});return e.flatMap(e=>{let r=Pm(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2)throw new l(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${i.params.size===0?``:`
|
|
419
419
|
Note that a bug can cause TLC to incorrectly report this error.
|
|
420
420
|
If you believe your TLA+ or PlusCal specification to be correct,
|
|
421
|
-
please check if this bug described in LevelNode.java starting at line 590ff affects you.`}`);return[{name:e,expression:Om(e),scope:void 0}]})},Fm=(e,t)=>{if(!M(e))return;let n=H(e);if(!n.domain.every(e=>typeof e==`string`))return;let r=n.domain.map((e,t)=>[String(e),n.range[t]]);return Object.fromEntries(r.sort((e,n)=>t.indexOf(e[0])-t.indexOf(n[0])))},Im=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Im(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=$a(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Im(n.body,t)}return[e]},Lm=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||$(r,e.scope,t)>0)return!1;let i=X(r,Zm(t,void 0,void 0,e.scope));if(i===!1)throw new l(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new l(`The operator ${r.name}, which equals ${U(i)},\ncannot be used as a ${n}`);return!0},Rm=(t,r)=>{if(t.specification===void 0){let e=(e,t)=>{if(e===void 0)return;let n=Am(t,e,r).body,i=Om(e);if(n.kind!==`Number`&&n.kind!==`String`&&$(i,void 0,r)===0)throw new l(`The ${t} ${e} cannot be a constant.`);return i};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[]}}let i=[],a=[],o=[],s=Am(`name`,t.specification,r),c=Mm(t.specification,s,r);if(c!==void 0)throw new l(`The value of ${t.specification} is equal to ${U(c)}`);if(Uf(s.body,void 0,r,!1).forEach(s=>{let c=s.expression;if(Lm(s,r,`spec`))return;if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw n(new l(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){a.push({expression:c.expression.action,scope:s.scope});return}if(c.kind===`Always`&&$(c.expression,s.scope,r)<2)throw new l(`TLC cannot handle []P in the specification ${t.specification} when P is a state predicate`);let u=$(c,s.scope,r);if(u===3)o.push(s);else{if(u===2)throw new l(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);i.push(s)}}),a.length>1)throw new l(`The specification ${t.specification} must contain at most one [][Next]_vars`);let u=[...i,...a],d=e=>`$specification${e}`,f=u.reduce((e,t,n)=>t.scope===void 0?e:{name:d(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0},parent:e},void 0),p=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:d(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:i.length===0?void 0:{kind:`And`,operands:i.map(p),location:Tm},next:a.length===0?void 0:p(a[0],i.length),scope:f,temporals:o}},zm=(e,t)=>{let n={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let r=Nm(`property`,e,t);r&&Uf(r.body,void 0,t,!0,e).forEach(r=>{let i=r.expression;if(Lm(r,t,`property`))return;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){n.actionProperties.push({name:r.name,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:r.scope});return}if(i.kind===`Always`&&$(i.expression,r.scope,t)<=1){let e=i.expression;n.invariants.push({name:e.kind===`Identifier`?e.name:r.name,expression:e,scope:r.scope});return}let a=$(i,r.scope,t);if(a<2)n.initialPredicates.push({name:r.name,expression:i,scope:r.scope});else{if(a===2)throw new l(`The property ${e} is an action-level formula`);n.liveness.push({name:e,expression:i,scope:r.scope})}})}),n},Bm=(e,t,n)=>t.flatMap(t=>Nm(e,t,n)?[{name:t,expression:Om(t),scope:void 0}]:[]),Vm=(e,t)=>{let n=$a(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},Hm=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new l(`_POSSIBLE lists ${n} more than once`);jm(`possible`,n,t);let i=Om(n);if($(i,void 0,t)===3)throw new l(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:n,expression:i,scope:void 0}}),Um=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||W(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},Wm=(e,t)=>e.flatMap(e=>Im(e.expression,t).map(n=>{let r=e.scope===void 0?Fs(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:Um(n,r,t)}})),Gm=(e,t,n)=>{let r=e.variables;if(!n||!r)return!1;for(let e=0;e<r.length;e++)if(t[r[e]]!==n[r[e]])return!1;return!0},Km=/[\u0100-\uffff]/,qm=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),Jm=e=>e.kind===`String`?Km.test(e.value):e.kind===`Set`&&e.elements.some(Jm),Ym=e=>e.kind===`String`&&Km.test(e.value)||e.kind===`Apply`&&qm.has(e.operator)||In(e).some(Ym),Xm=(e,t)=>e.constants.some(e=>Jm(e.value)||(e.args??[]).some(Jm))||[...t.definitions.values()].some(e=>Ym(e.body)||e.kind===`Function`&&e.bounds.some(e=>Ym(e.set))),Zm=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),Qm=(e,t,n)=>Qa(X(e,t),n),$m=(e,t,n=eh)=>{let r=X(e,t);if(typeof r!=`boolean`)throw new u(n(e,t.environment));return r},eh=(e,t)=>{let n=e.kind===`Identifier`?$a(e.name,t):void 0,r=n?.kind===`Operator`?n.body:e,i=n?.kind===`Operator`?n.bodyRange:void 0;return`TLC expected a boolean value, but did not find one. ${r.kind===`Number`?r.text??String(r.value):i?za(i):Ba(r)}`},th=()=>{},nh=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=Qm(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),rh=(e,t,n)=>{try{return Qm(e,Zm(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof u)return{message:e.message};throw e}},ih=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=rh(n.expression,t,`an assumption`);if(e)return{name:Ba(n.expression),trace:[],message:e.message}}},ah=(t,r,i)=>{let a=Pm(t.invariants,r),s=Rm(t,r),c=zm(t,r),u=Wm([...a,...c.invariants],r),d=u.length>0||c.actionProperties.length>0||c.liveness.length>0;if(s.init===void 0&&(d||c.initialPredicates.length>0||r.variables.length>0))throw new l(`The configuration file did not specify the initial state predicate.`);if(s.next===void 0&&d)throw new l(`The configuration file did not specify the next state predicate.`);let f=Wm(Bm(`constraint`,t.constraints,r),r),p=Bm(`action constraint`,t.actionConstraints,r);t.rlReward!==void 0&&Am(`rlreward`,t.rlReward,r),t.periodic!==void 0&&Am(`periodic`,t.periodic,r);let m=Hm(t.possible,r);if(r.variables.length===0)return;let h=t.symmetry===void 0?[]:Hp(t.symmetry,r);t.view!==void 0&&Am(`view function`,t.view,r);let g=t.view===void 0?void 0:{name:t.view,expression:Om(t.view),scope:void 0},_=c.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Tm};return{...e,unchanged:t}}),v=e=>$(e.expression,void 0,r)>=2,y=m.filter(e=>!v(e)),ee=m.filter(v),b=r.runtime,x={indices:void 0},te=()=>{if(x.indices)return x.indices;let e=i(),t=t=>{let n=e.indexOf(r.variables[t]);return n===-1?r.variables.length:n};return x.indices=r.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),x.indices},ne=h.length>0?te():void 0,re=(e,t)=>X(e,Zm(r,t,void 0)),S=e=>{let t=te(),n=h.length===0?e:Xp(e,h,t);return Mc(g===void 0?t.map(e=>n[e]):[re(g.expression,n)])},ie=Xm(t,r);b.getFingerprint=S;let C=()=>{let e=m.find(e=>!b.possibleCounts.get(e.name));if(!e)return;let t=Vm(e.name,r),n=t?` at ${za(t)}`:``;return{name:e.name,message:`The _POSSIBLE predicate ${e.name}${n} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:A(U(Zc(b),!0))}};return{properties:c,spec:s,isSymmetric:h.length>0,getTlcOrder:te,getStoredFingerprints:(e,t)=>{if(g!==void 0||ie)return BigInt64Array.from(e,S);let n=new BigInt64Array(t.length),r=Fc(te(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(ie)return[String(S(e))];let t=h.length===0?e:Xp(e,h,ne);return g===void 0?t:[re(g.expression,t)]},findViolatedInvariant:(t,i)=>u.find(a=>{if(Gm(a,t,i))return!1;try{let e=Zm(r,t,void 0,a.scope),n=a.membership;return i&&n?!$t(t[n.variable],i[n.variable],X(n.set,e)):!$m(a.expression,e)}catch(t){throw i?sh(n(t,e.safetyEvaluationFailure),`Evaluating invariant ${a.name} failed.`):t}}),satisfiesConstraints:(e,t)=>f.every(n=>Gm(n,e,t)||$m(n.expression,Zm(r,e,void 0))),findFailedInitialPredicate:e=>c.initialPredicates.find(t=>!$m(t.expression,Zm(r,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>_.find(n=>{try{return!$m(n.action,Zm(r,e,t,n.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Ba(n.box)}`)&&!Qm(n.unchanged,Zm(r,e,t,n.scope),`a subscript`)}catch(e){throw sh(oh(e),`Evaluating action property ${n.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>p.every(n=>$m(n.expression,Zm(r,e,t),e=>`${o}${eh(e,r)}`)),trackStatePossible:y.length===0?th:e=>nh(y,b,Zm(r,e,void 0)),trackActionPossible:ee.length===0?th:(e,t)=>nh(ee,b,Zm(r,e,t)),findUnwitnessedPossible:C,findPostconditionViolation:()=>{let e=C();if(e)return e;for(let e of t.postconditions){let t=rh(Om(e),r,`a postcondition`);if(t)return{name:e,message:t.message??`Postcondition ${e} is false.`}}}}},oh=e=>e instanceof d?n(e,e.exitCode):e,sh=(e,t)=>e instanceof u?n(new u(`${t}\n${e.message}`,e),h(e)):e,ch=e=>{let t=e.dump&&Rp(e.dump,e.writeFile),n=lh(e,t);return t?.close(),n},lh=(e,t)=>{let n=typeof e.config==`string`?O(e.config):e.config,r=e.onPrint??console.log,i={isMuted:!1},o=e=>{i.isMuted||r(e)},s=e=>{i.isMuted=!0;let t=e();return i.isMuted=!1,t};Te(hm(e.source,n,e.loadModule));let c=Qd(n,{source:e.source,loadModule:e.loadModule,loadClass:e.loadClass,print:o,files:{readFile:e.readFile,writeFile:e.writeFile},seed:e.seed}),f=c.environment,p=f.runtime;p.pause=e.onPause??(()=>{}),p.getSpecification=()=>Op(n,f,c.variableLocations,c.instanceActions);let m={depth:0},g=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:p.generatedStates,distinctStates:p.distinctStates,queuedStates:p.queueSize,depth:p.generatedStates===0?0:Math.max(m.depth,1),outDegrees:void 0,fingerprintDistance:void 0}),_=Array.from({length:32},()=>0),v={newStates:0},y=()=>Math.min(v.newStates,31),ee=()=>_.map((e,t)=>t===y()?e+1:e),b=()=>({...g(`success`),outDegrees:[..._],fingerprintDistance:Cm(p.distinctStates,p.generatedStates,()=>x?x.getStoredFingerprints(E,D):BigInt64Array.from(E,p.getFingerprint))}),x=ah(n,f,()=>mm(e.source,e.loadModule)),te=ih(c.assumptions,f);if(te)return g(`assumption-violation`,te);if(!x)return b();let ne=n.postconditions.length>0||n.possible.length>0,re=(e,t,n)=>{if(ne){let e=t.loopStart;p.counterExample=eu(t.trace,e===void 0||!n?void 0:{start:e,action:n()})}let r=x.findUnwitnessedPossible();return r||x.findPostconditionViolation(),g(e,r?{...t,unwitnessed:r}:t)},S=x.spec,ie=x.getFingerprintState,C={value:void 0},ae=n.view!==void 0||n.symmetry!==void 0,w=[],oe=a(()=>tp(x.properties.liveness,S.temporals,f,{getFingerprint:e=>w[e]??=Number(BigInt.asIntN(32,p.getFingerprint(E[e]))),getSuccessors:e=>{let t=[];return S.next===void 0||Ia(S.next,e,f,n=>{if(ue(n.state),!(x.satisfiesConstraints(n.state,e)&&x.satisfiesActionConstraints(e,n.state)))return!1;let r=ie(n.state),i=Ce(xe(r),r);return t.push({index:i,state:n.state}),!1},S.scope),t}})),T=x.isSymmetric||oe!==void 0,E=[],D=[],se=[],k=[],ce=[],le={slots:new Int32Array(1<<17),size:0,shift:16},ue=Fn(),A=e=>Object.fromEntries(x.getTlcOrder().map(t=>[f.variables[t],e[t]])),j=(e,t,n,r)=>(p.getLevel=()=>n+1,p.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),de(e,t[n].state,(t[n+1]??t[r??n]).state)),de=(e,t,n)=>{try{let r=jm(`alias`,e,f).body,i=X(Om(e),Zm(f,t,n)),a=r.kind===`Record`?r.fields.map(e=>e.name):[];return Fm(i,a)??A(t)}catch(e){if(!(e instanceof l||e instanceof u))throw e;return{...A(t),_ALIASEvalError:e.message}}},M=(e,t,r)=>{C.value??=wp(n,f,c.instanceActions);let i={...F};Object.assign(F,{index:e,isExpanding:!0,candidate:void 0});let a=ie(r),o=C.value.find(e=>La(e.expression,t,f,e.scope).some(e=>Se(ie(e.state),a)));return Object.assign(F,i),o&&Ep(o)},N=(e,t,r)=>{let i=n.alias,a=s(()=>(e.length>1&&Go(f)&&fe(),e.map((n,r)=>r===0||n.action===`Stuttering`?void 0:M(t[r-1],e[r-1].state,n.state))));return e.map((t,n)=>({action:t.action,label:a[n],state:i===void 0?A(t.state):j(i,e,n,r)}))},fe=()=>S.init===void 0?[]:Fa(S.init,f,S.scope),pe=e=>S.next===void 0?[]:La(S.next,e,f,S.scope),me=(e,t)=>Se(ie(e),D[t]),he=(e,t)=>pe(e).find(e=>me(e.state,t)),ge=(e,t)=>{let n=ae||Go(f)?fe().find(t=>me(t,e[0])):E[e[0]];if(!n)throw new u(Em);let r=[{state:n,action:void 0}];for(let n=1;n<e.length;n++){let i=r[n-1].state;if(e[n-1]===e[n]){r.push({state:i,action:`Stuttering`});continue}let a=he(i,e[n]);if(!a)throw new u(t);r.push(a)}return r},_e=(e,t)=>{let n=[];for(let t=e;t!==-1;t=se[t])n.unshift(t);let r=ae&&n.length>1?ge(n,Em):n.map(e=>({state:E[e],action:k[e]}));if(!t)return N(r,n);let i=ae?pe(E[e]).find(e=>Se(e.state,t.state))?.action:t.action;return N([...r,{state:t.state,action:i}],n)},ve=e=>se[e]===-1?[{action:void 0,label:void 0,state:A(E[e])}]:_e(e),ye=(e,t,n,r)=>{if(!(e instanceof u))throw e;return{...g(`error`,void 0,{message:e.message,trace:t,initialState:n&&!(e instanceof d)?A(n):void 0,exitCode:h(e)}),outDegrees:r}},be=(e,t)=>{let n=ge(e,Dm),r=n[n.length-1].state;if(ae&&t!==void 0&&t!==e.length-1&&he(r,e[t])===void 0)throw new u(Dm);return n},xe=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=dn(t,gn(e[n]));return t&1073741823},Se=(e,t)=>{for(let n=0;n<t.length;n++)if(!ze(e[n],t[n]))return!1;return!0},P=e=>Math.imul(e,2654435761)>>>le.shift<<1,Ce=(e,t)=>{let n=le.slots.length-1;for(let r=P(e);;r=r+2&n){let n=le.slots[r+1];if(n===0)return-1;if(le.slots[r]===e&&Se(D[n-1],t))return n-1}},we=(e,t)=>{let n=le.slots.length-1,r=P(e);for(;le.slots[r+1]!==0;)r=r+2&n;le.slots[r]=e,le.slots[r+1]=t},Ee=(e,t)=>{if(le.size++,le.size*4>le.slots.length){let e=le.slots;le.slots=new Int32Array(e.length*2),le.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&we(e[t],e[t+1])}we(e,t+1)},De=e=>{p.distinctStates=E.length+1,m.depth=Math.max(m.depth,e),p.diameter=Math.max(p.diameter,e)},Oe=(e,t,n,r)=>{let i=n===-1?1:ce[n]+1;E.push(e),D.push(t),se.push(n),k.push(r),ce.push(i)},F={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,livenessSource:-1},I=e=>e===-1?[]:[...I(se[e]),E[e]];p.isSeen=e=>{let t=ie(e);return Ce(xe(t),t)!==-1},p.getBehavior=e=>{let t=e===F.candidate?-1:E.indexOf(e);return t===-1?[...I(F.index),e]:I(t)},p.getCurrentState=()=>F.index===-1?void 0:E[F.index],p.setLivenessSource=e=>{F.livenessSource=e??-1},p.getLevel=e=>{let t=F.livenessSource;return t===-1?e===F.candidate?F.candidateLevel:F.index===-1?0:e===E[F.index]?ce[F.index]:F.isExpanding?ce[F.index]+1:0:e===E[t]?ce[t]:ce[t]+1};let ke=(e,t)=>({fingerprint:BigInt.asIntN(64,p.getFingerprint(e)),level:t,getLabel:()=>Nn(n.alias===void 0?A(e):de(n.alias,e,void 0)),getText:()=>Nn(A(e))}),Ae=e=>{ue(e),p.generatedStates++,p.initialStates++,F.candidate=e,F.candidateLevel=1;let n=ie(e),r=xe(n),i=x.satisfiesConstraints(e);if(i&&x.trackStatePossible(e),i&&Ce(r,n)!==-1)return;i&&(De(1),p.queueSize++,oe?.addInitialState(E.length,e),t?.writeInitialState(ke(e,1)));let a=x.findViolatedInvariant(e);if(a)return re(`invariant-violation`,{name:a.name,trace:N([{action:void 0,state:e}],[])});let o=x.findFailedInitialPredicate(e);if(o)return re(`liveness-violation`,{name:o.name,trace:N([{action:void 0,state:e}],[])});i&&(Ee(r,E.length),Oe(e,n,-1,void 0))},je=(e,n,r,i,a)=>{let o=E[e];p.generatedStates++,F.candidate=n.state,F.candidateLevel=ce[e]+1,T&&ue(n.state);let s=ie(n.state),c=xe(s),l=Ce(c,s),u=x.satisfiesConstraints(n.state,o);u&&x.trackStatePossible(n.state);let d=u&&x.satisfiesActionConstraints(o,n.state);d&&x.trackActionPossible(o,n.state);let f=d?l:-1;if(i&&d&&t?.writeSuccessor(i,ke(n.state,ce[e]+1),f!==-1,a&&{name:a.name,signature:Dp(a)}),f!==-1&&oe){let e=E[f],t=e.every((e,t)=>e===n.state[t]);r.push({index:f,state:t?e:n.state})}let m=d&&f===-1;if(m&&(De(ce[e]+1),v.newStates++),f===-1)try{let t=x.findViolatedInvariant(n.state,o);if(t)return re(`invariant-violation`,{name:t.name,trace:_e(e,n)})}catch(t){return ye(t,_e(e,n),void 0,ee())}let h=x.findViolatedActionProperty(o,n.state);if(h)return re(`liveness-violation`,{name:h.name,trace:_e(e,n)});m&&(T||ue(n.state),Ee(c,E.length),oe&&r.push({index:E.length,state:n.state}),Oe(n.state,s,e,n.action),p.queueSize++)},Me={result:void 0};if(S.init!==void 0)try{Pa(S.init,f,e=>{try{Me.result=Ae(e)}catch(t){Me.result=ye(t,[],e)}return Me.result!==void 0},S.scope)}catch(e){return ye(e,[])}if(Me.result)return Me.result;let L=S.next;if(L===void 0){if(E.length>0)throw new u(`No next state actions defined to generate successor states from.`);return b()}let Ne=!!(e.dump?.dot&&(e.dump.actionLabels||e.dump.colorize)),Pe=(e,t)=>{if(!Ne)return Ia(L,e,f,e=>t(e,void 0),S.scope);C.value??=wp(n,f,c.instanceActions);let r={isStopped:!1};return C.value.reduce((n,i)=>r.isStopped?n:n+Ia(i.expression,e,f,e=>(r.isStopped=t(e,i),r.isStopped),i.scope),0)},Fe=e=>{let r=E[e],i=[],a=t&&ke(r,ce[e]),o=Pe(r,(t,n)=>{try{Me.result=je(e,t,i,a,n)}catch(n){Me.result=ye(n,_e(e,t))}return Me.result!==void 0});if(F.isExpanding=!1,Me.result)return Me.result;if(o===0&&n.checkDeadlock)return re(`deadlock`,{name:`deadlock`,trace:ve(e)});try{let t=oe?.addState(e,r,i);if(!oe||!t)return;let n=be(t),a=oe.getViolatedProperties(n.map(e=>e.state),n.length-1);return re(`property-violation`,{name:a[0],properties:a,trace:N(n,t)})}catch(t){return ye(t,ve(e),void 0,ee())}},Ie=(e,t)=>{let n=[...t.prefix,...t.cycle],r=t.prefix.length,i=be(n,r),a=N(i,n,r),o=e.getViolatedProperties(i.map(e=>e.state),r),c=n[r],l=n[n.length-1],u=i[i.length-1].state,d=c===l?void 0:s(()=>M(l,u,E[c]));return re(`liveness-violation`,{name:o[0],properties:o,trace:a,loopStart:r,loopLabel:d},()=>c===l?a[a.length-1].action:he(u,c)?.action)},Le=oe!==void 0&&e.livenessCheck!==`final`,Re=performance.now(),Be={at:Re+3e3,size:1,time:0},Ve=e=>{let t=performance.now();if(Be.at=t+6e4,!((e-Be.size)/Be.size>.1)||Be.time>(t-Re)*.2)return;Be.size=e;let n=oe?.findViolation();return Be.time+=performance.now()-t,n};for(let e=0;e<E.length&&!p.isStopped;e++){F.index=e,F.candidate=void 0,p.queueSize=E.length-e-1,F.isExpanding=!0;try{Me.result=Fe(e)}catch(t){Me.result=ye(oh(t),ve(e))}if(Me.result)return Me.result;if(_[y()]++,v.newStates=0,Le&&performance.now()>=Be.at){let t=Ve(e+1);if(oe&&t)return Ie(oe,t)}}F.index=-1,F.candidate=void 0;let He=oe?.findViolation();if(oe&&He)return Ie(oe,He);let Ue=x.findPostconditionViolation();return Ue?g(`postcondition-violation`,{...Ue,trace:[]}):b()},uh=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},dh=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^gn(e[t]),16777619),r=Math.imul(r^Cn(e[t]),1540483477);t[0]=uh(n)||1,t[1]=uh(r)},fh=()=>{let e={slots:/* @__PURE__ */ new Int32Array(8192),used:0},t=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},n=()=>{let n=e.slots,r=new Int32Array(n.length*2);for(let e=0;e<n.length;e+=2){if(n[e]===0)continue;let i=t(r,n[e],n[e+1]);r[i*2]=n[e],r[i*2+1]=n[e+1]}e.slots=r};return{insert:(r,i)=>{e.used*4>=e.slots.length&&n();let a=t(e.slots,r,i);return e.slots[a*2]!==r&&(e.slots[a*2]=r,e.slots[a*2+1]=i,e.used++,!0)}}},ph=(e,t)=>{let n=e.length-1;for(let r=Number(t>>32n)&n;;r=r+1&n){let n=Atomics.load(e,r);if(n===t)return!1;if(n!==0n)continue;let i=Atomics.compareExchange(e,r,0n,t);if(i===0n)return!0;if(i===t)return!1}},mh=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),hh=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return ph(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},gh=e=>Atomics.load(e.used,0)*2>=e.slots.length,_h=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&ph(t,n);return{slots:t,used:e.used}},vh=()=>{let e={words:/* @__PURE__ */ new Int32Array(1024),length:0,count:0},t=[],n=/* @__PURE__ */ new Map,r=t=>{if(e.length===e.words.length){let t=new Int32Array(e.words.length*2);t.set(e.words),e.words=t}e.words[e.length++]=t},i=e=>{let i=n.get(e);if(i!==void 0)return r(i);n.set(e,t.length),r(t.length),t.push(e)},a=e=>{if(typeof e==`boolean`)return r(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(r(2),r(e),!0);if(typeof e==`string`)return r(3),i(e),!0;if(e.kind===`ModelValue`)return r(4),i(e.name),!0;if(e.kind===`Set`)return r(5),r(e.elements.length),e.elements.every(a);if(e.kind===`Function`){let t=on(e.domain);return t?(r(7),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(e.domain.length),e.domain.every(a)&&e.range.every(a))}return!1};return{encode:t=>{let n=e.length;return t.every(a)?(e.count++,!0):(e.length=n,!1)},finish:()=>({words:e.words.slice(0,e.length),strings:t,count:e.count})}},yh=e=>t=>{let n=t.words,r={index:0},i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r.index++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r.index++];if(e===3)return t.strings[n[r.index++]];if(e===4)return Pe(t.strings[n[r.index++]]);if(e===7){let e=n[r.index++],t=n[r.index++],a=Et({kind:`Interval`,low:e,high:e+t-1});return Ie(a,i(t))}let a=n[r.index++];if(e===5)return Fe(i(a));let o=i(a);return Ie(o,i(a))};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return O}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return e}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return Fa}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return U}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return Nn}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return f}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return c}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return m}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return l}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return s}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return De}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return u}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return p}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return Go}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Fn}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return hm}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return _h}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return hc}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return dh}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return ih}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return bm}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return wm}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return gm}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return mh}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return oe}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return Te}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return ch}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return Cm}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return vh}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return hh}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return Sm}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return fh}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return gh}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return yh}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return ah}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return mm}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return La}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return gc}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return Qd}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return h}});
|
|
421
|
+
please check if this bug described in LevelNode.java starting at line 590ff affects you.`}`);return[{name:e,expression:km(e),scope:void 0}]})},Im=(e,t)=>{if(!M(e))return;let n=H(e);if(!n.domain.every(e=>typeof e==`string`))return;let r=n.domain.map((e,t)=>[String(e),n.range[t]]);return Object.fromEntries(r.sort((e,n)=>t.indexOf(e[0])-t.indexOf(n[0])))},Lm=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Lm(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=$a(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Lm(n.body,t)}return[e]},Rm=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||$(r,e.scope,t)>0)return!1;let i=X(r,Qm(t,void 0,void 0,e.scope));if(i===!1)throw new l(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new l(`The operator ${r.name}, which equals ${U(i)},\ncannot be used as a ${n}`);return!0},zm=(t,r)=>{if(t.specification===void 0){let e=(e,t)=>{if(e===void 0)return;let n=jm(t,e,r).body,i=km(e);if(n.kind!==`Number`&&n.kind!==`String`&&$(i,void 0,r)===0)throw new l(`The ${t} ${e} cannot be a constant.`);return i};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[]}}let i=[],a=[],o=[],s=jm(`name`,t.specification,r),c=Nm(t.specification,s,r);if(c!==void 0)throw new l(`The value of ${t.specification} is equal to ${U(c)}`);if(Uf(s.body,void 0,r,!1).forEach(s=>{let c=s.expression;if(Rm(s,r,`spec`))return;if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw n(new l(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){a.push({expression:c.expression.action,scope:s.scope});return}if(c.kind===`Always`&&$(c.expression,s.scope,r)<2)throw new l(`TLC cannot handle []P in the specification ${t.specification} when P is a state predicate`);let u=$(c,s.scope,r);if(u===3)o.push(s);else{if(u===2)throw new l(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);i.push(s)}}),a.length>1)throw new l(`The specification ${t.specification} must contain at most one [][Next]_vars`);let u=[...i,...a],d=e=>`$specification${e}`,f=u.reduce((e,t,n)=>t.scope===void 0?e:{name:d(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0},parent:e},void 0),p=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:d(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:i.length===0?void 0:{kind:`And`,operands:i.map(p),location:Em},next:a.length===0?void 0:p(a[0],i.length),scope:f,temporals:o}},Bm=(e,t)=>{let n={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let r=Pm(`property`,e,t);r&&Uf(r.body,void 0,t,!0,e).forEach(r=>{let i=r.expression;if(Rm(r,t,`property`))return;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){n.actionProperties.push({name:r.name,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:r.scope});return}if(i.kind===`Always`&&$(i.expression,r.scope,t)<=1){let e=i.expression;n.invariants.push({name:e.kind===`Identifier`?e.name:r.name,expression:e,scope:r.scope});return}let a=$(i,r.scope,t);if(a<2)n.initialPredicates.push({name:r.name,expression:i,scope:r.scope});else{if(a===2)throw new l(`The property ${e} is an action-level formula`);n.liveness.push({name:e,expression:i,scope:r.scope})}})}),n},Vm=(e,t,n)=>t.flatMap(t=>Pm(e,t,n)?[{name:t,expression:km(t),scope:void 0}]:[]),Hm=(e,t)=>{let n=$a(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},Um=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new l(`_POSSIBLE lists ${n} more than once`);Mm(`possible`,n,t);let i=km(n);if($(i,void 0,t)===3)throw new l(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:n,expression:i,scope:void 0}}),Wm=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||W(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},Gm=(e,t)=>e.flatMap(e=>Lm(e.expression,t).map(n=>{let r=e.scope===void 0?Fs(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:Wm(n,r,t)}})),Km=(e,t,n)=>{let r=e.variables;if(!n||!r)return!1;for(let e=0;e<r.length;e++)if(t[r[e]]!==n[r[e]])return!1;return!0},qm=/[\u0100-\uffff]/,Jm=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),Ym=e=>e.kind===`String`?qm.test(e.value):e.kind===`Set`&&e.elements.some(Ym),Xm=e=>e.kind===`String`&&qm.test(e.value)||e.kind===`Apply`&&Jm.has(e.operator)||In(e).some(Xm),Zm=(e,t)=>e.constants.some(e=>Ym(e.value)||(e.args??[]).some(Ym))||[...t.definitions.values()].some(e=>Xm(e.body)||e.kind===`Function`&&e.bounds.some(e=>Xm(e.set))),Qm=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),$m=(e,t,n)=>Qa(X(e,t),n),eh=(e,t,n=th)=>{let r=X(e,t);if(typeof r!=`boolean`)throw new u(n(e,t.environment));return r},th=(e,t)=>{let n=e.kind===`Identifier`?$a(e.name,t):void 0,r=n?.kind===`Operator`?n.body:e,i=n?.kind===`Operator`?n.bodyRange:void 0;return`TLC expected a boolean value, but did not find one. ${r.kind===`Number`?r.text??String(r.value):i?za(i):Ba(r)}`},nh=()=>{},rh=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=$m(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),ih=(e,t,n)=>{try{return $m(e,Qm(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof u)return{message:e.message};throw e}},ah=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=ih(n.expression,t,`an assumption`);if(e)return{name:Ba(n.expression),trace:[],message:e.message}}},oh=(t,r,i)=>{let a=Fm(t.invariants,r),s=zm(t,r),c=Bm(t,r),u=Gm([...a,...c.invariants],r),d=u.length>0||c.actionProperties.length>0||c.liveness.length>0;if(s.init===void 0&&(d||c.initialPredicates.length>0||r.variables.length>0))throw new l(`The configuration file did not specify the initial state predicate.`);if(s.next===void 0&&d)throw new l(`The configuration file did not specify the next state predicate.`);let f=Gm(Vm(`constraint`,t.constraints,r),r),p=Vm(`action constraint`,t.actionConstraints,r);t.rlReward!==void 0&&jm(`rlreward`,t.rlReward,r),t.periodic!==void 0&&jm(`periodic`,t.periodic,r);let m=Um(t.possible,r);if(r.variables.length===0)return;let h=t.symmetry===void 0?[]:Up(t.symmetry,r);t.view!==void 0&&jm(`view function`,t.view,r);let g=t.view===void 0?void 0:{name:t.view,expression:km(t.view),scope:void 0},_=c.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Em};return{...e,unchanged:t}}),v=e=>$(e.expression,void 0,r)>=2,y=m.filter(e=>!v(e)),ee=m.filter(v),b=r.runtime,x={indices:void 0},te=()=>{if(x.indices)return x.indices;let e=i(),t=t=>{let n=e.indexOf(r.variables[t]);return n===-1?r.variables.length:n};return x.indices=r.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),x.indices},ne=h.length>0?te():void 0,re=(e,t)=>X(e,Qm(r,t,void 0)),S=e=>{let t=te(),n=h.length===0?e:Zp(e,h,t);return Mc(g===void 0?t.map(e=>n[e]):[re(g.expression,n)])},ie=Zm(t,r);b.getFingerprint=S;let C=()=>{let e=m.find(e=>!b.possibleCounts.get(e.name));if(!e)return;let t=Hm(e.name,r),n=t?` at ${za(t)}`:``;return{name:e.name,message:`The _POSSIBLE predicate ${e.name}${n} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:A(U(Zc(b),!0))}};return{properties:c,spec:s,isSymmetric:h.length>0,getTlcOrder:te,getStoredFingerprints:(e,t)=>{if(g!==void 0||ie)return BigInt64Array.from(e,S);let n=new BigInt64Array(t.length),r=Fc(te(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(ie)return[String(S(e))];let t=h.length===0?e:Zp(e,h,ne);return g===void 0?t:[re(g.expression,t)]},findViolatedInvariant:(t,i)=>u.find(a=>{if(Km(a,t,i))return!1;try{let e=Qm(r,t,void 0,a.scope),n=a.membership;return i&&n?!$t(t[n.variable],i[n.variable],X(n.set,e)):!eh(a.expression,e)}catch(t){throw i?ch(n(t,e.safetyEvaluationFailure),`Evaluating invariant ${a.name} failed.`):t}}),satisfiesConstraints:(e,t)=>f.every(n=>Km(n,e,t)||eh(n.expression,Qm(r,e,void 0))),findFailedInitialPredicate:e=>c.initialPredicates.find(t=>!eh(t.expression,Qm(r,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>_.find(n=>{try{return!eh(n.action,Qm(r,e,t,n.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Ba(n.box)}`)&&!$m(n.unchanged,Qm(r,e,t,n.scope),`a subscript`)}catch(e){throw ch(sh(e),`Evaluating action property ${n.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>p.every(n=>eh(n.expression,Qm(r,e,t),e=>`${o}${th(e,r)}`)),trackStatePossible:y.length===0?nh:e=>rh(y,b,Qm(r,e,void 0)),trackActionPossible:ee.length===0?nh:(e,t)=>rh(ee,b,Qm(r,e,t)),findUnwitnessedPossible:C,findPostconditionViolation:()=>{let e=C();if(e)return e;for(let e of t.postconditions){let t=ih(km(e),r,`a postcondition`);if(t)return{name:e,message:t.message??`Postcondition ${e} is false.`}}}}},sh=e=>e instanceof d?n(e,e.exitCode):e,ch=(e,t)=>e instanceof u?n(new u(`${t}\n${e.message}`,e),h(e)):e,lh=e=>{let t=e.dump&&zp(e.dump,e.writeFile),n=uh(e,t);return t?.close(),n},uh=(e,t)=>{let n=typeof e.config==`string`?O(e.config):e.config,r=e.onPrint??console.log,i={isMuted:!1},o=e=>{i.isMuted||r(e)},s=e=>{i.isMuted=!0;let t=e();return i.isMuted=!1,t};Te(gm(e.source,n,e.loadModule));let c=Qd(n,{source:e.source,loadModule:e.loadModule,loadClass:e.loadClass,print:o,files:{readFile:e.readFile,writeFile:e.writeFile},seed:e.seed}),f=c.environment,p=f.runtime;p.pause=e.onPause??(()=>{}),p.getSpecification=()=>kp(n,f,c.variableLocations,c.instanceActions);let m={depth:0},g=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:p.generatedStates,distinctStates:p.distinctStates,queuedStates:p.queueSize,depth:p.generatedStates===0?0:Math.max(m.depth,1),outDegrees:void 0,fingerprintDistance:void 0}),_=Array.from({length:32},()=>0),v={newStates:0},y=()=>Math.min(v.newStates,31),ee=()=>_.map((e,t)=>t===y()?e+1:e),b=()=>({...g(`success`),outDegrees:[..._],fingerprintDistance:wm(p.distinctStates,p.generatedStates,()=>x?x.getStoredFingerprints(E,D):BigInt64Array.from(E,p.getFingerprint))}),x=oh(n,f,()=>hm(e.source,e.loadModule)),te=ah(c.assumptions,f);if(te)return g(`assumption-violation`,te);if(!x)return b();let ne=n.postconditions.length>0||n.possible.length>0,re=(e,t,n)=>{if(ne){let e=t.loopStart;p.counterExample=eu(t.trace,e===void 0||!n?void 0:{start:e,action:n()})}let r=x.findUnwitnessedPossible();return r||x.findPostconditionViolation(),g(e,r?{...t,unwitnessed:r}:t)},S=x.spec,ie=x.getFingerprintState,C={value:void 0},ae=n.view!==void 0||n.symmetry!==void 0,w=[],oe=a(()=>np(x.properties.liveness,S.temporals,f,{getFingerprint:e=>w[e]??=Number(BigInt.asIntN(32,p.getFingerprint(E[e]))),getSuccessors:e=>{let t=[];return S.next===void 0||Ia(S.next,e,f,n=>{if(ue(n.state),!(x.satisfiesConstraints(n.state,e)&&x.satisfiesActionConstraints(e,n.state)))return!1;let r=ie(n.state),i=Ce(xe(r),r);return t.push({index:i,state:n.state}),!1},S.scope),t}})),T=x.isSymmetric||oe!==void 0,E=[],D=[],se=[],k=[],ce=[],le={slots:new Int32Array(1<<17),size:0,shift:16},ue=Fn(),A=e=>Object.fromEntries(x.getTlcOrder().map(t=>[f.variables[t],e[t]])),j=(e,t,n,r)=>(p.getLevel=()=>n+1,p.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),de(e,t[n].state,(t[n+1]??t[r??n]).state)),de=(e,t,n)=>{try{let r=Mm(`alias`,e,f).body,i=X(km(e),Qm(f,t,n)),a=r.kind===`Record`?r.fields.map(e=>e.name):[];return Im(i,a)??A(t)}catch(e){if(!(e instanceof l||e instanceof u))throw e;return{...A(t),_ALIASEvalError:e.message}}},M=(e,t,r)=>{C.value??=Tp(n,f,c.instanceActions);let i={...F};Object.assign(F,{index:e,isExpanding:!0,candidate:void 0});let a=ie(r),o=C.value.find(e=>La(e.expression,t,f,e.scope).some(e=>Se(ie(e.state),a)));return Object.assign(F,i),o&&Dp(o)},N=(e,t,r)=>{let i=n.alias,a=s(()=>(e.length>1&&Go(f)&&fe(),e.map((n,r)=>r===0||n.action===`Stuttering`?void 0:M(t[r-1],e[r-1].state,n.state))));return e.map((t,n)=>({action:t.action,label:a[n],state:i===void 0?A(t.state):j(i,e,n,r)}))},fe=()=>S.init===void 0?[]:Fa(S.init,f,S.scope),pe=e=>S.next===void 0?[]:La(S.next,e,f,S.scope),me=(e,t)=>Se(ie(e),D[t]),he=(e,t)=>pe(e).find(e=>me(e.state,t)),ge=(e,t)=>{let n=ae||Go(f)?fe().find(t=>me(t,e[0])):E[e[0]];if(!n)throw new u(Dm);let r=[{state:n,action:void 0}];for(let n=1;n<e.length;n++){let i=r[n-1].state;if(e[n-1]===e[n]){r.push({state:i,action:`Stuttering`});continue}let a=he(i,e[n]);if(!a)throw new u(t);r.push(a)}return r},_e=(e,t)=>{let n=[];for(let t=e;t!==-1;t=se[t])n.unshift(t);let r=ae&&n.length>1?ge(n,Dm):n.map(e=>({state:E[e],action:k[e]}));if(!t)return N(r,n);let i=ae?pe(E[e]).find(e=>Se(e.state,t.state))?.action:t.action;return N([...r,{state:t.state,action:i}],n)},ve=e=>se[e]===-1?[{action:void 0,label:void 0,state:A(E[e])}]:_e(e),ye=(e,t,n,r)=>{if(!(e instanceof u))throw e;return{...g(`error`,void 0,{message:e.message,trace:t,initialState:n&&!(e instanceof d)?A(n):void 0,exitCode:h(e)}),outDegrees:r}},be=(e,t)=>{let n=ge(e,Om),r=n[n.length-1].state;if(ae&&t!==void 0&&t!==e.length-1&&he(r,e[t])===void 0)throw new u(Om);return n},xe=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=dn(t,gn(e[n]));return t&1073741823},Se=(e,t)=>{for(let n=0;n<t.length;n++)if(!ze(e[n],t[n]))return!1;return!0},P=e=>Math.imul(e,2654435761)>>>le.shift<<1,Ce=(e,t)=>{let n=le.slots.length-1;for(let r=P(e);;r=r+2&n){let n=le.slots[r+1];if(n===0)return-1;if(le.slots[r]===e&&Se(D[n-1],t))return n-1}},we=(e,t)=>{let n=le.slots.length-1,r=P(e);for(;le.slots[r+1]!==0;)r=r+2&n;le.slots[r]=e,le.slots[r+1]=t},Ee=(e,t)=>{if(le.size++,le.size*4>le.slots.length){let e=le.slots;le.slots=new Int32Array(e.length*2),le.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&we(e[t],e[t+1])}we(e,t+1)},De=e=>{p.distinctStates=E.length+1,m.depth=Math.max(m.depth,e),p.diameter=Math.max(p.diameter,e)},Oe=(e,t,n,r)=>{let i=n===-1?1:ce[n]+1;E.push(e),D.push(t),se.push(n),k.push(r),ce.push(i)},F={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,livenessSource:-1},I=e=>e===-1?[]:[...I(se[e]),E[e]];p.isSeen=e=>{let t=ie(e);return Ce(xe(t),t)!==-1},p.getBehavior=e=>{let t=e===F.candidate?-1:E.indexOf(e);return t===-1?[...I(F.index),e]:I(t)},p.getCurrentState=()=>F.index===-1?void 0:E[F.index],p.setLivenessSource=e=>{F.livenessSource=e??-1},p.getLevel=e=>{let t=F.livenessSource;return t===-1?e===F.candidate?F.candidateLevel:F.index===-1?0:e===E[F.index]?ce[F.index]:F.isExpanding?ce[F.index]+1:0:e===E[t]?ce[t]:ce[t]+1};let ke=(e,t)=>({fingerprint:BigInt.asIntN(64,p.getFingerprint(e)),level:t,getLabel:()=>Nn(n.alias===void 0?A(e):de(n.alias,e,void 0)),getText:()=>Nn(A(e))}),Ae=e=>{ue(e),p.generatedStates++,p.initialStates++,F.candidate=e,F.candidateLevel=1;let n=ie(e),r=xe(n),i=x.satisfiesConstraints(e);if(i&&x.trackStatePossible(e),i&&Ce(r,n)!==-1)return;i&&(De(1),p.queueSize++,oe?.addInitialState(E.length,e),t?.writeInitialState(ke(e,1)));let a=x.findViolatedInvariant(e);if(a)return re(`invariant-violation`,{name:a.name,trace:N([{action:void 0,state:e}],[])});let o=x.findFailedInitialPredicate(e);if(o)return re(`liveness-violation`,{name:o.name,trace:N([{action:void 0,state:e}],[])});i&&(Ee(r,E.length),Oe(e,n,-1,void 0))},je=(e,n,r,i,a)=>{let o=E[e];p.generatedStates++,F.candidate=n.state,F.candidateLevel=ce[e]+1,T&&ue(n.state);let s=ie(n.state),c=xe(s),l=Ce(c,s),u=x.satisfiesConstraints(n.state,o);u&&x.trackStatePossible(n.state);let d=u&&x.satisfiesActionConstraints(o,n.state);d&&x.trackActionPossible(o,n.state);let f=d?l:-1;if(i&&d&&t?.writeSuccessor(i,ke(n.state,ce[e]+1),f!==-1,a&&{name:a.name,signature:Op(a)}),f!==-1&&oe){let e=E[f],t=e.every((e,t)=>e===n.state[t]);r.push({index:f,state:t?e:n.state})}let m=d&&f===-1;if(m&&(De(ce[e]+1),v.newStates++),f===-1)try{let t=x.findViolatedInvariant(n.state,o);if(t)return re(`invariant-violation`,{name:t.name,trace:_e(e,n)})}catch(t){return ye(t,_e(e,n),void 0,ee())}let h=x.findViolatedActionProperty(o,n.state);if(h)return re(`liveness-violation`,{name:h.name,trace:_e(e,n)});m&&(T||ue(n.state),Ee(c,E.length),oe&&r.push({index:E.length,state:n.state}),Oe(n.state,s,e,n.action),p.queueSize++)},Me={result:void 0};if(S.init!==void 0)try{Pa(S.init,f,e=>{try{Me.result=Ae(e)}catch(t){Me.result=ye(t,[],e)}return Me.result!==void 0},S.scope)}catch(e){return ye(e,[])}if(Me.result)return Me.result;let L=S.next;if(L===void 0){if(E.length>0)throw new u(`No next state actions defined to generate successor states from.`);return b()}let Ne=!!(e.dump?.dot&&(e.dump.actionLabels||e.dump.colorize)),Pe=(e,t)=>{if(!Ne)return Ia(L,e,f,e=>t(e,void 0),S.scope);C.value??=Tp(n,f,c.instanceActions);let r={isStopped:!1};return C.value.reduce((n,i)=>r.isStopped?n:n+Ia(i.expression,e,f,e=>(r.isStopped=t(e,i),r.isStopped),i.scope),0)},Fe=e=>{let r=E[e],i=[],a=t&&ke(r,ce[e]),o=Pe(r,(t,n)=>{try{Me.result=je(e,t,i,a,n)}catch(n){Me.result=ye(n,_e(e,t))}return Me.result!==void 0});if(F.isExpanding=!1,Me.result)return Me.result;if(o===0&&n.checkDeadlock)return re(`deadlock`,{name:`deadlock`,trace:ve(e)});try{let t=oe?.addState(e,r,i);if(!oe||!t)return;let n=be(t),a=oe.getViolatedProperties(n.map(e=>e.state),n.length-1);return re(`property-violation`,{name:a[0],properties:a,trace:N(n,t)})}catch(t){return ye(t,ve(e),void 0,ee())}},Ie=(e,t)=>{let n=[...t.prefix,...t.cycle],r=t.prefix.length,i=be(n,r),a=N(i,n,r),o=e.getViolatedProperties(i.map(e=>e.state),r),c=n[r],l=n[n.length-1],u=i[i.length-1].state,d=c===l?void 0:s(()=>M(l,u,E[c]));return re(`liveness-violation`,{name:o[0],properties:o,trace:a,loopStart:r,loopLabel:d},()=>c===l?a[a.length-1].action:he(u,c)?.action)},Le=oe!==void 0&&e.livenessCheck!==`final`,Re=performance.now(),Be={at:Re+3e3,size:1,time:0},Ve=e=>{let t=performance.now();if(Be.at=t+6e4,!((e-Be.size)/Be.size>.1)||Be.time>(t-Re)*.2)return;Be.size=e;let n=oe?.findViolation();return Be.time+=performance.now()-t,n};for(let e=0;e<E.length&&!p.isStopped;e++){F.index=e,F.candidate=void 0,p.queueSize=E.length-e-1,F.isExpanding=!0;try{Me.result=Fe(e)}catch(t){Me.result=ye(sh(t),ve(e))}if(Me.result)return Me.result;if(_[y()]++,v.newStates=0,Le&&performance.now()>=Be.at){let t=Ve(e+1);if(oe&&t)return Ie(oe,t)}}F.index=-1,F.candidate=void 0;let He=oe?.findViolation();if(oe&&He)return Ie(oe,He);let Ue=x.findPostconditionViolation();return Ue?g(`postcondition-violation`,{...Ue,trace:[]}):b()},dh=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},fh=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^gn(e[t]),16777619),r=Math.imul(r^Cn(e[t]),1540483477);t[0]=dh(n)||1,t[1]=dh(r)},ph=()=>{let e={slots:/* @__PURE__ */ new Int32Array(8192),used:0},t=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},n=()=>{let n=e.slots,r=new Int32Array(n.length*2);for(let e=0;e<n.length;e+=2){if(n[e]===0)continue;let i=t(r,n[e],n[e+1]);r[i*2]=n[e],r[i*2+1]=n[e+1]}e.slots=r};return{insert:(r,i)=>{e.used*4>=e.slots.length&&n();let a=t(e.slots,r,i);return e.slots[a*2]!==r&&(e.slots[a*2]=r,e.slots[a*2+1]=i,e.used++,!0)}}},mh=(e,t)=>{let n=e.length-1;for(let r=Number(t>>32n)&n;;r=r+1&n){let n=Atomics.load(e,r);if(n===t)return!1;if(n!==0n)continue;let i=Atomics.compareExchange(e,r,0n,t);if(i===0n)return!0;if(i===t)return!1}},hh=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),gh=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return mh(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},_h=e=>Atomics.load(e.used,0)*2>=e.slots.length,vh=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&mh(t,n);return{slots:t,used:e.used}},yh=()=>{let e={words:/* @__PURE__ */ new Int32Array(1024),length:0,count:0},t=[],n=/* @__PURE__ */ new Map,r=t=>{if(e.length===e.words.length){let t=new Int32Array(e.words.length*2);t.set(e.words),e.words=t}e.words[e.length++]=t},i=e=>{let i=n.get(e);if(i!==void 0)return r(i);n.set(e,t.length),r(t.length),t.push(e)},a=e=>{if(typeof e==`boolean`)return r(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(r(2),r(e),!0);if(typeof e==`string`)return r(3),i(e),!0;if(e.kind===`ModelValue`)return r(4),i(e.name),!0;if(e.kind===`Set`)return r(5),r(e.elements.length),e.elements.every(a);if(e.kind===`Function`){let t=on(e.domain);return t?(r(7),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(e.domain.length),e.domain.every(a)&&e.range.every(a))}return!1};return{encode:t=>{let n=e.length;return t.every(a)?(e.count++,!0):(e.length=n,!1)},finish:()=>({words:e.words.slice(0,e.length),strings:t,count:e.count})}},bh=e=>t=>{let n=t.words,r={index:0},i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r.index++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r.index++];if(e===3)return t.strings[n[r.index++]];if(e===4)return Pe(t.strings[n[r.index++]]);if(e===7){let e=n[r.index++],t=n[r.index++],a=Et({kind:`Interval`,low:e,high:e+t-1});return Ie(a,i(t))}let a=n[r.index++];if(e===5)return Fe(i(a));let o=i(a);return Ie(o,i(a))};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};Object.defineProperty(exports,"A",{enumerable:!0,get:function(){return O}}),Object.defineProperty(exports,"B",{enumerable:!0,get:function(){return e}}),Object.defineProperty(exports,"C",{enumerable:!0,get:function(){return Fa}}),Object.defineProperty(exports,"D",{enumerable:!0,get:function(){return U}}),Object.defineProperty(exports,"E",{enumerable:!0,get:function(){return Nn}}),Object.defineProperty(exports,"F",{enumerable:!0,get:function(){return f}}),Object.defineProperty(exports,"I",{enumerable:!0,get:function(){return c}}),Object.defineProperty(exports,"L",{enumerable:!0,get:function(){return m}}),Object.defineProperty(exports,"M",{enumerable:!0,get:function(){return l}}),Object.defineProperty(exports,"N",{enumerable:!0,get:function(){return s}}),Object.defineProperty(exports,"O",{enumerable:!0,get:function(){return De}}),Object.defineProperty(exports,"P",{enumerable:!0,get:function(){return u}}),Object.defineProperty(exports,"R",{enumerable:!0,get:function(){return p}}),Object.defineProperty(exports,"S",{enumerable:!0,get:function(){return Go}}),Object.defineProperty(exports,"T",{enumerable:!0,get:function(){return Fn}}),Object.defineProperty(exports,"_",{enumerable:!0,get:function(){return gm}}),Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return vh}}),Object.defineProperty(exports,"b",{enumerable:!0,get:function(){return hc}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return fh}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return ah}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return xm}}),Object.defineProperty(exports,"g",{enumerable:!0,get:function(){return Tm}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return _m}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return hh}}),Object.defineProperty(exports,"j",{enumerable:!0,get:function(){return oe}}),Object.defineProperty(exports,"k",{enumerable:!0,get:function(){return Te}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return lh}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return wm}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return yh}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return gh}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return Cm}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return ph}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return _h}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return bh}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return oh}}),Object.defineProperty(exports,"v",{enumerable:!0,get:function(){return hm}}),Object.defineProperty(exports,"w",{enumerable:!0,get:function(){return La}}),Object.defineProperty(exports,"x",{enumerable:!0,get:function(){return gc}}),Object.defineProperty(exports,"y",{enumerable:!0,get:function(){return Qd}}),Object.defineProperty(exports,"z",{enumerable:!0,get:function(){return h}});
|
package/dist/transfer.js
CHANGED
|
@@ -407,15 +407,15 @@ _CheckName(name) ==
|
|
|
407
407
|
_PrintCounts == PrintT(_Counts)
|
|
408
408
|
=============================================================================
|
|
409
409
|
`]]),Su=/* @__PURE__ */ new Map([[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])]]),Cu=(e,t)=>e.every(e=>Qt(e,t)),wu=ft([!1,!0]),Tu=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return _t(Tu(e,t,r),Tu(e,r,n))},Eu=[`\\cup`,`\\cap`,`\\`],Du=e=>typeof e==`object`&&e.kind===`MixedSet`,Ou=e=>e.kind===`Interval`?B(e).elements:e.elements,ku=(e,t,n)=>{let r=Ou(t);if(e!==`\\cup`){let t=e===`\\cap`;return pt(r.filter(e=>Qt(e,n)===t))}if(r.length===0)return n;if(!de(n))return{kind:`SetOperation`,operator:e,left:t,right:n};let i=B(n).elements.filter(e=>!Qt(e,t));return pt([...r,...i])},Au=[Yn(`TRUE`,!0),Yn(`FALSE`,!1),Yn(`BOOLEAN`,wu),Yn(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),Qn(`=`,ut),Qn(`#`,(e,t)=>!ut(e,t)),K(`~`,1,e=>!Vn(e,0,`~`)),K(`<=>`,2,e=>Vn(e,0,`<=>`)===Vn(e,1,`<=>`)),K(`/\\`,2,e=>Vn(e,0,`/\\`)&&Vn(e,1,`/\\`)),K(`\\/`,2,e=>Vn(e,0,`\\/`)||Vn(e,1,`\\/`)),K(`=>`,2,e=>!Vn(e,0,`=>`)||Vn(e,1,`=>`)),K(`\\in`,2,e=>Qt(G(e,0,`\\in`),G(e,1,`\\in`))),K(`\\notin`,2,e=>!Qt(G(e,0,`\\notin`),G(e,1,`\\notin`))),K(`\\subseteq`,2,e=>{let t=Hn(e,0,`\\subseteq`),n=Hn(e,1,`\\subseteq`);return typeof t==`object`&&t.kind===`Subset`&&typeof n==`object`&&n.kind===`Subset`&&z(t.base)?Cu(B(t.base).elements,n.base):Cu(B(t).elements,n)}),...Eu.map(e=>K(e,2,t=>{let n=Hn(t,0,e),r=Hn(t,1,e);return de(n)&&de(r)&&!Du(n)&&!Du(r)?e===`\\cup`&&V(n)?r:(e===`\\cup`?_t:e===`\\cap`?gt:ht)(B(n),B(r)):de(n)?ku(e,n,r):e!==`\\`&&de(r)?ku(e,r,n):{kind:`SetOperation`,operator:e,left:n,right:r}})),K(`SUBSET`,1,e=>({kind:`Subset`,base:Hn(e,0,`SUBSET`)})),K(`UNION`,1,e=>{let t=Hn(e,0,`UNION`),n=Qe(t)?t.elements.filter(Qe):[];if(!Qe(t)||n.length!==t.elements.length)return{kind:`Union`,base:t};if(Du(t)||n.some(Du)){let e={kind:`MixedSet`,elements:[]};return n.forEach(t=>t.elements.forEach(t=>{Qt(t,e)||e.elements.push(t)})),pt(e.elements)}return n.length===0?mt:Tu(n.map(B),0,n.length)}),K(`DOMAIN`,1,e=>{let t=G(e,0,`DOMAIN`);if(!M(t))throw new u(`DOMAIN expects a function but received ${U(t)}`);return sn(t)})],ju=lr(`DotDot`,`IntervalValue`,2),Mu=lr(`Neg`,`IntValue`,1),Nu=[Yn(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),ur(`+`,`Plus`,(e,t)=>e+t),ur(`-`,`Minus`,(e,t)=>e-t),ur(`*`,`Times`,(e,t)=>e*t),ur(`^`,`Expt`,(e,t)=>{if(t<0)throw new d(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new d(`0^0 is undefined.`);return e**t}),ur(`\\div`,`Divide`,(e,t)=>{if(t===0)throw new d(`The second argument of \\div is 0.`);let n=Math.floor(e/t);if($n(n))throw er(`${e} \\div ${t}`);return n}),ur(`%`,`Mod`,(e,t)=>{if(t<=0)throw new d(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),fr(`<`,(e,t)=>e<t),fr(`>`,(e,t)=>e>t),fr(`<=`,(e,t)=>e<=t),fr(`>=`,(e,t)=>e>=t),K(`..`,2,e=>({kind:`Interval`,low:cr(G(e,0,`..`),ju),high:cr(G(e,1,`..`),ju)}))],Pu=[Yn(`Int`,{kind:`InfiniteSet`,name:`Int`}),K(`-.`,1,e=>{let t=cr(G(e,0,`-`),Mu);if($n(-t))throw er(`-${t}`);return-t})],Fu=(e,t,n)=>{let r=G(e,t,n),i=Yt(r);if(!i)throw new d(`${n}\n${U(r)}`);return i},Iu=(e,t,n)=>{let r=G(e,t,n);return typeof r==`string`?r:Fu(e,t,n)},Lu=(e,t,n)=>typeof e==`string`?Ee(e.slice(t,n)):R(e.slice(t,n)),Ru=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,zu=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Bu=(e,t)=>{let n=Su.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?sr(e,t):e}):t},Vu=Bu(`Sequences`,[K(`Seq`,1,e=>({kind:`SequenceSet`,base:G(e,0,`Seq`)})),K(`Len`,1,e=>Iu(e,0,Ru(``,`Len`)).length),K(`\\o`,2,e=>{let t=Iu(e,0,zu(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=Fu(e,1,zu(`t \\o s`,`sequence`));return R([...t,...n])}let n=G(e,1,`\\o`);if(typeof n!=`string`)throw new d(`${zu(`t \\o s`,`string`)}\n${U(n)}`);return Ee(t+n)}),K(`Append`,2,e=>R([...Fu(e,0,zu(`Append(s, v)`,`sequence`)),G(e,1,`Append`)])),K(`Head`,1,e=>{let t=Fu(e,0,Ru(``,`Head`));if(t.length===0)throw new d(`Attempted to apply Head to the empty sequence.`);return t[0]}),K(`Tail`,1,e=>{let t=Iu(e,0,Ru(``,`Tail`));if(t.length===0)throw new d(`Attempted to apply Tail to the empty sequence.`);return Lu(t,1)}),K(`SubSeq`,3,e=>{let t=Iu(e,0,Ru(`first `,`SubSeq`)),n=Bn(e,1,`SubSeq`),r=Bn(e,2,`SubSeq`);if(n>r)return Lu(t,0,0);let i=n<1?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new d(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${U(G(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return Lu(t,n-1,r)}),Xn(`SelectSeq`,2,e=>{let t=Jn(e,1,`SelectSeq`);return R(Fu(e,0,Ru(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new d(`The second argument of SelectSeq should be a operator, but instead it is:\n${U(n)}`);return n}))})]),Hu=Bu(`FiniteSets`,[K(`IsFiniteSet`,1,e=>{let t=G(e,0,`IsFiniteSet`);if(j(t))return qt(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new u(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${U(t)}\nis a finite set.`:`Attempted to check if the ${fe(t)} ${U(t)} is a finite set.`)}),K(`Cardinality`,1,e=>{let t=G(e,0,`Cardinality`);if(!j(t)||typeof t==`object`&&(t.kind===`InfiniteSet`||t.kind===`SequenceSet`))throw new d(`Attempted to compute cardinality of the value\n${U(t)}`);return Gt(t)})]),Uu=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]],[`Sequences`,[`Naturals`]],[`FiniteSets`,[`Naturals`,`Sequences`]],[`TLC`,[`Naturals`,`Sequences`,`FiniteSets`]],[`Randomization`,[`Naturals`,`FiniteSets`,`Sequences`]],[`_Possible`,[`TLC`,`TLCExt`,`Naturals`,`Sequences`,`FiniteSets`,`Integers`]],[`Json`,[`Sequences`,`FiniteSets`,`TLC`,`Naturals`]],[`Bags`,[`Naturals`]],[`TLCExt`,[`TLC`,`Integers`,`Naturals`,`Sequences`,`FiniteSets`]]]),Wu=(e,t,n,r)=>{switch(e){case`Naturals`:return{extends:[],operators:Nu};case`Integers`:return{extends:[`Naturals`],operators:Pu};case`Sequences`:return{extends:[],operators:Vu};case`FiniteSets`:return{extends:[],operators:Hu};case`TLC`:return{extends:[],operators:Bu(`TLC`,hu(t,n))};case`Randomization`:return{extends:[],operators:Kl(n)};case`_Possible`:return{extends:[],operators:su(t,n)};case`Json`:return{extends:[],operators:Bl(r)};case`Bags`:return{extends:[],operators:yl};case`TLCExt`:return{extends:[],operators:ou(t,n)};default:return}},Gu=`$subexpression`,Ku=(e,t)=>new c(`${e} at line ${t.line}, column ${t.column}`),qu=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Ju=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,Yu=e=>{switch(e.kind){case`Apply`:return e.args;case`And`:case`Or`:return e.operands;case`If`:return[e.condition,e.consequent,e.alternative];case`Tuple`:case`SetEnumeration`:return e.elements;case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`FunctionApplication`:return[e.function,e.args.length===1?e.args[0]:{kind:`Tuple`,elements:e.args,location:e.location}];case`FieldAccess`:return[e.record,{kind:`String`,value:e.field,location:e.location}];case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`FunctionSet`:return[e.domain,e.range];case`Product`:return e.factors;case`Except`:return[e.function];default:return}},Xu=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Lr(e.bounds),body:e.body,sets:qu(e.bounds)};case`SetMap`:return{names:Lr(e.bounds),body:e.expression,sets:qu(e.bounds)};case`SetFilter`:return{names:Ir(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:Ir(e.pattern),body:e.body,sets:e.set?[e.set]:[]};case`UnboundedQuantifier`:case`Lambda`:return{names:e.kind===`Lambda`?e.params:e.names,body:e.body,sets:[]};default:return}},Zu=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return Zu(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of In(e)){let e=Zu(r,t,n);if(e)return e}},Qu=(e,t,n)=>e.length===0&&n.length>0?n.splice(0,t):e,$u=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),ed=(e,t)=>{let n=e.location,r=$u(t,e.lets,n);if(e.params.length===0)return r;if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw Ku(`Selected an operator with operator parameters as an argument`,n);return{kind:`Lambda`,params:e.params.map(e=>e.name),body:r,location:n}}if(e.args.length!==e.params.length)throw Ku(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:Gu,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:Gu,args:e.args,location:n,resolution:Er},location:n}},td=(e,t)=>{let n=t.location,r=e.kind===`Operator`?e.params.map((e,n)=>({name:`${e.name}$${t.params.length+n}`,arity:e.arity})):[],i=r.map(e=>({kind:`Identifier`,name:e.name,location:n,resolution:Er})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Er}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Er};return ed({...t,params:[...t.params,...r]},a)},nd=(e,t,n,r)=>{let i={params:[],args:[],lets:[],location:n},a={index:0,current:void 0},o=i=>{let o=[],s=[];for(;a.index<e.length;){let c=e[a.index];if(c.kind!==`Name`)throw Ku(`Expected an operator name`,n);o.push(c.name),s.push(...c.args);let l=o.join(`!`),u=i?i.find(e=>yi(e)===l):t(l);if(u)return{definition:u,args:Qu(s,jr(u),r)};a.index++}throw Ku(`Unknown operator ${o.join(`!`)}`,n)},s=t=>{let r=o(t),s=r.definition,c=jr(s),l=a.index===e.length-1;if(r.args.length!==c&&r.args.length!==0)throw Ku(`The operator ${s.name} requires ${c} arguments`,n);if(l)return{definition:s,args:r.args};if(s.kind!==`Operator`)throw Ku(`Cannot select a subexpression of ${s.name}`,n);i.params.push(...s.params),i.args.push(...r.args),a.current=s.body,a.index++},c=()=>{for(;a.index<e.length;){let t=e[a.index];if(t.kind!==`Name`)return;let o=a.current&&Zu(a.current,t.name,[]);if(!o)throw Ku(`Cannot find label ${t.name}`,n);i.lets.push(...o.lets),i.params.push(...o.label.params.map(e=>({name:e,arity:0}))),i.args.push(...Qu(t.args,o.label.params.length,r)),a.current=o.label.body,a.index++}},l=t=>{let o=a.current;if(!o)throw Ku(`Subexpression selection failed`,n);if(t.kind===`Colon`)return;if(o.kind===`Label`){a.current=o.body,l(t);return}if(o.kind===`Let`){if(t.kind!==`Operand`||Ju(t.operand,1)!==0)throw Ku(`A LET/IN expression has only one operand`,n);i.lets.push(o.definitions),a.current=o.body;return}let s=Xu(o);if(s&&(t.kind===`Bound`||t.kind===`At`)){i.params.push(...s.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&i.args.push(...Qu(t.args,s.names.length,r)),a.current=s.body;return}if(o.kind===`Case`&&t.kind===`Operand`){let r=[...o.arms,...o.other?[{condition:void 0,body:o.other}]:[]],i=r[Ju(t.operand,r.length)],s=e[a.index+1];if(!i||s?.kind!==`Operand`)throw Ku(`A subexpression of CASE must have the form !i!j`,n);a.index++;let c=Ju(s.operand,2),l=c===0?i.condition:c===1?i.body:void 0;if(!l)throw Ku(`Nonexistent CASE operand`,n);a.current=l;return}if(t.kind!==`Operand`)throw Ku(`Unexpected subexpression selector`,n);let c=s?s.sets:Yu(o),u=c?.[Ju(t.operand,c.length)];if(!u)throw Ku(`Nonexistent operand specified by the selector`,n);a.current=u},u=s(void 0);if(u)return td(u.definition,{...i,args:u.args});for(c();a.index<e.length;){let t=e[a.index];if(t.kind===`Name`){for(;a.current?.kind===`Label`;)a.current=a.current.body;if(a.current?.kind!==`Let`)throw Ku(`A name selector here must be from a LET clause`,n);i.lets.push(a.current.definitions);let e=s(a.current.definitions);if(e)return td(e.definition,{...i,args:[...i.args,...e.args]});c()}else l(t),a.index++}if(!a.current)throw Ku(`Subexpression selection failed`,n);return ed(i,a.current)},rd=(e,t)=>{if(!e.includes(`!`)||t(e))return;let n=e.split(`!`),r=n.findIndex((e,r)=>t(n.slice(0,r+1).join(`!`)));if(r!==-1)return[{kind:`Name`,name:n.slice(0,r+1).join(`!`),args:[]},...n.slice(r+1).map(e=>({kind:`Name`,name:e,args:[]}))]},id=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||In(e).some(id),ad=(e,t)=>{if(!id(e))return e;if(e.kind===`Let`){let n=n=>e.definitions.find(e=>e.name===n)??t(n);return Si(e,e=>ad(e,n))}let n=Si(e,e=>ad(e,t));if(n.kind===`Subexpression`)return nd(n.selectors,t,n.location,[]);let r=n.kind===`Identifier`?n.name:n.kind===`Apply`?n.operator:``,i=rd(r,t);if(!i)return n;let a=n.kind===`Apply`?[...n.args]:[],o=nd(i,t,n.location,a);if(a.length>0)throw Ku(`Too many arguments for ${r}`,n.location);return o},od=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},sd=(e,t)=>{let n=od(t.definitions);return{...e,substitutions:e.substitutions.map(e=>({name:e.name,expression:ad(e.expression,n)}))}},cd=(e,t)=>{let n=od([...t,...e.definitions]);return e.definitions.some(e=>id(e.body))||e.assumptions.some(e=>id(e.expression))?{...e,definitions:e.definitions.map(e=>xi(e,e=>ad(e,n))),assumptions:e.assumptions.map(e=>({...e,expression:ad(e.expression,n)}))}:e},ld=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),ud=(e,t)=>`${e}${t}`,dd=(e,t,n)=>`${e}${t}${n}`,fd=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},pd=(e,t,n)=>`${e},${t},${n}`,md=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),hd=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),gd=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),_d=(e,t,n,r)=>({...md(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),vd=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,yd=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,bd=new Map([[`=`,0,[2,2],[1,1]],[`#`,0,[2,2],[1,1]],[`\\in`,0,[2,2],[1,1]],[`\\notin`,0,[2,2],[1,1]],[`\\subseteq`,0,[2,2],[1,1]],[`\\cup`,0,[2,2],[1,1]],[`\\cap`,0,[2,2],[1,1]],[`\\`,0,[2,2],[1,1]],[`=>`,0,[3,3],[1,1]],[`<=>`,0,[3,3],[1,1]],[`/\\`,0,[3,3],[1,1]],[`\\/`,0,[3,3],[1,1]],[`~`,0,[3],[1]],[`SUBSET`,0,[2],[1]],[`UNION`,0,[2],[1]],[`DOMAIN`,0,[2],[1]],[`~>`,3,[3,3],[0,0]],[`-+->`,3,[3,3],[0,0]],[`\\cdot`,2,[2,2],[0,0]],[`TRUE`,0,[],[]],[`FALSE`,0,[],[]],[`BOOLEAN`,0,[],[]],[`STRING`,0,[],[]]].map(([e,t,n,r])=>[e,{..._d(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),xd=_d(`$Set`,0,[2],[1]),Sd=_d(`$Junction`,0,[3],[1]),Cd=_d(`$Choose`,0,[2],[1]),wd=_d(`$Function`,0,[3],[1]),Td=_d(`$FcnApply`,0,[2,2],[1,1]),Ed=_d(`$RcdSelect`,0,[2,0],[1,1]),Dd=_d(`'`,2,[1],[0]),Od=_d(`ENABLED`,1,[2],[0]),kd=_d(`[]`,3,[3],[0]),Ad=_d(`$SquareAct`,2,[2,1],[0,0]),jd=_d(`$WF`,3,[1,2],[0,0]),Md=_d(`$TemporalExists`,3,[3],[0]),Nd=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Pd=e=>e.map(e=>({name:e,arity:0})),Fd=(e,t)=>new c(`${e} at line ${t.line}, column ${t.column}`),Id=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Ld=e=>e.kind!==`Let`&&e.kind!==`Label`,Rd=e=>{let t=/* @__PURE__ */ new Map,n=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:_(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i)return{kind:`Defined`,levels:_(i,/* @__PURE__ */ new Map)};let a=bd.get(t)??ld.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},r=(e,t,n)=>{let r=md(Math.max(t,...n.map(e=>e.data.level)));return r.params.add(e),n.forEach((t,n)=>{t.data.params.forEach(t=>{r.params.add(t),r.argParams.add(dd(e,n,t))}),t.data.constraints.forEach((e,t)=>hd(r.constraints,t,e)),gd(r.argConstraints,ud(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>gd(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},i=(e,t,n=[],r=[])=>{let i=e=>r.includes(e);if(t.forEach((t,n)=>{if(!(t.operator||t.declared)&&t.data.level>vd(e,n))throw new c(`Level error in applying operator ${e.name}: The level of argument ${n+1} exceeds the maximum level allowed by the operator.`)}),n.some(e=>e.level>2))throw new c(`Level error in applying operator ${e.name}: The level of the range for a bounded variable exceeds the maximum level allowed by the operator.`);let a=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},o=(t,n,r)=>e.conditions.has(pd(t,n,r)),s=md(Math.max(e.level,...t.filter((t,n)=>yd(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>s.params.add(e)),t.forEach((t,n)=>{yd(e,n)===1&&t.data.params.forEach(e=>s.params.add(e))}),n.forEach(e=>e.params.forEach(e=>s.params.add(e))),r.forEach(e=>s.params.delete(e)),e.constraints.forEach((e,t)=>hd(s.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{i(t)||hd(s.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>hd(s.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{i(t)||hd(s.constraints,t,vd(e,n))})),t.forEach((e,n)=>{let r=e.operator;r&&t.forEach((e,t)=>r.formals.forEach((i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>hd(s.constraints,e,vd(r,a)))}))}),e.argParams.forEach(e=>{let t=fd(e),n=a(t.operator)?.operator;n&&hd(s.constraints,t.param,vd(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>gd(s.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>gd(s.argConstraints,ud(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{o(r,t,a)&&gd(s.argConstraints,ud(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=fd(e),n=a(t.operator);n&&gd(s.argConstraints,ud(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{i(fd(e).param)||s.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>s.argParams.add(e))),e.argParams.forEach(e=>{let t=fd(e),n=a(t.operator);if(n)n.declared&&s.argParams.add(dd(n.declared.name,t.index,t.param));else{let n=a(t.param);if(!n){s.argParams.add(e);return}n.data.params.forEach(e=>s.argParams.add(dd(t.operator,t.index,e)))}}),t.forEach((e,n)=>{let r=e.declared;r&&t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{o(n,t,a)&&e.data.params.forEach(e=>s.argParams.add(dd(r.name,a,e)))}))}),s},a=(e,t)=>{if(e.kind===`Lambda`){let n=g(`LAMBDA`,Pd(e.params),e.body,t);return{data:n,operator:n}}let r=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(r!==void 0){let i=n(r,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{data:i.levels,operator:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=md();return e.params.add(r),{data:e,declared:{name:r,arity:i.arity}}}}return{data:m(e,t)}},o=(e,t)=>e.map(e=>a(e,t)),s=(e,t,n,r=[],a=[])=>{let s=Nd(n,Pd(a));return i(e,o(t,s),r.map(e=>m(e,n)),a)},l=(e,t)=>e.kind===`Declared`?r(e.name,e.level,t):i(e.levels,t),u=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw Fd(`Formula has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw Fd(`Action used where only temporal formula or state predicate allowed`,e.location);Id.has(e.operator)&&u(t,e.location)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Ld(n)&&n.kind!==r)throw Fd(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e.location)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>{let t=_(e,n);t.constraints.forEach((e,t)=>hd(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>gd(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return md();case`Identifier`:return l(n(e.name,t),[]);case`Apply`:{let r=o(e.args,t);return d(e,r),l(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return a(e,t).data;case`And`:case`Or`:{let n=o(e.operands,t);return u(n,e.location),i(Sd,n)}case`Prime`:case`Unchanged`:return s(Dd,[e.expression],t);case`Enabled`:return s(Od,[e.expression],t);case`Always`:case`Eventually`:{let n=a(e.expression,t);return f(e,n.data.level),i(kd,[n])}case`If`:return s(Sd,[e.condition,e.consequent,e.alternative],t);case`Case`:return s(Sd,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=s(Sd,[e.body],t,e.bounds.map(e=>e.set),Lr(e.bounds));if(n.level===3&&e.bounds.some(e=>m(e.set,t).level===2))throw Fd(`Action-level bound of quantified temporal formula`,e.location);return n}case`UnboundedQuantifier`:return s(e.isTemporal?Md:Sd,[e.body],t,[],e.names);case`Choose`:return s(Cd,[e.body],t,e.set?[e.set]:[],Ir(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return s(xd,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return s(xd,[e.predicate],t,[e.bound.set],Ir(e.bound.pattern));case`SetMap`:return s(xd,[e.expression],t,e.bounds.map(e=>e.set),Lr(e.bounds));case`FunctionConstruction`:return s(wd,[e.body],t,e.bounds.map(e=>e.set),Lr(e.bounds));case`Record`:return s(wd,e.fields.map(e=>e.value),t);case`RecordSet`:return s(xd,e.fields.map(e=>e.value),t);case`Except`:return s(xd,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return i(Td,[a(e.function,t),e.args.length===1?a(e.args[0],t):{data:s(xd,e.args,t)}]);case`FieldAccess`:return i(Ed,[a(e.record,t),{data:md()}]);case`BoxAction`:case`AngleAction`:return s(Ad,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return s(jd,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return md()}},h=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>h(e,a,n,i),o=(e,o)=>{let s=n(e,t);s.kind===`Declared`?(r&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,r||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return In(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,Nd(t,Pd(e.names))),i;default:return Si(e,(e,n)=>(a(e,r,Nd(t,Pd(n))),e)),i}},g=(e,t,n,r)=>{let i=Nd(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=h(n,i),c={...md(a.level),name:e,formals:t,nonLeibniz:new Set(t.flatMap((e,t)=>s.has(e.name)?[t]:[])),maxLevels:t.map(e=>Math.min(3,a.constraints.get(e.name)??3)),weights:t.map(e=>+!!a.params.has(e.name)),minMaxLevels:t.map(e=>Array.from({length:e.arity},(t,n)=>a.argConstraints.get(ud(e.name,n))??0)),conditions:new Set(t.flatMap((e,n)=>t.flatMap((t,r)=>Array.from({length:e.arity},(e,t)=>t).filter(n=>a.argParams.has(dd(e.name,n,t.name))).map(e=>pd(n,r,e)))))};return a.params.forEach(e=>{o(e)||c.params.add(e)}),a.constraints.forEach((e,t)=>{o(t)||c.constraints.set(t,e)}),a.argConstraints.forEach((e,t)=>{o(fd(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=fd(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},_=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...md(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=g(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:_,toOperand:a}},zd=(e,t,n)=>{let r=new Map(t);e.assumptions.forEach(e=>{e.kind===`NewSymbol`?(e.set&&n.analyze(e.set,r),r.set(e.name,{kind:`Formal`,arity:e.arity})):e.kind===`AssumeProve`?zd(e,r,n):n.analyze(e,r)}),n.analyze(e.conclusion,r)},Bd=(e,t)=>{let n=Rd(t);e.definitions.filter(e=>!e.name.includes(`!`)).forEach(e=>n.analyzeDefinition(e,/* @__PURE__ */ new Map)),e.assumptions.forEach(e=>n.analyze(e.expression,/* @__PURE__ */ new Map)),e.theorems.forEach(e=>e.statement.kind===`AssumeProve`?zd(e.statement,/* @__PURE__ */ new Map,n):n.analyze(e.statement,/* @__PURE__ */ new Map))},Vd=(e,t)=>e.maxLevels[t]??3,Hd=(e,t)=>{let n=/* @__PURE__ */ new Map,r=e=>{let r=n.get(e);if(r)return r;let i=t(e),a=Rd({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return n.set(e,a),a},i=/* @__PURE__ */ new Map,a=e=>{let n=i.get(e);if(n)return n;let a=t(e),o=r(e),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>hd(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>hd(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>gd(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=fd(e);t(n.operator,n.param)&&c.argParams.add(e)})};return s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n))),a.assumptions.forEach(e=>l(o.analyze(e,/* @__PURE__ */ new Map),()=>!0)),i.set(e,c),c},o=/* @__PURE__ */ new Set;if(e.forEach(e=>{let n=`at line ${e.location.line}, column ${e.location.column}`,i=e=>o.add(`${e} ${n}`),s=t(e.module),c=a(e.module),l=r(e.instancer),u=/* @__PURE__ */ new Map;e.lets.forEach(e=>u.set(e.name,{kind:`Let`,definition:e,scope:u}));let d=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(t=>{let n=e.substitutions.get(t.name);if(!n)return[];if(t.arity===0){let e=l.analyze(n,u);return[{...t,level:e.level,operator:void 0,isLeibniz:!0}]}let r=l.toOperand(n,u);return[{...t,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),f=(t,n)=>`Level error in instantiating module '${e.module}': the level of the expression or operator substituted for '${t}' must be at most ${n}`;d.forEach(t=>{!c.isConstant&&t.level>t.maximumLevel&&i(f(t.name,t.maximumLevel)),t.isLeibniz||i(`Error in instantiating module '${e.module}': a non-Leibniz operator substituted for '${t.name}'`)}),d.forEach(t=>{let n=c.constraints.get(t.name);n!==void 0&&t.level>n&&i(f(t.name,n));let r=t.operator;r&&Array.from({length:t.arity},(n,a)=>{let o=c.argConstraints.get(ud(t.name,a));o!==void 0&&Vd(r,a)<o&&i(`Level error in instantiating module '${e.module}': the level of the argument ${a+1} of the operator ${r.name} must be at least ${o}`)})}),c.argParams.forEach(t=>{let n=fd(t),r=d.find(e=>e.name===n.operator)?.operator,a=d.find(e=>e.name===n.param);if(!r||!a)return;let o=Vd(r,n.index);a.level>o&&i(`Level error when instantiating module '${e.module}': the level of the argument ${n.index} of the operator ${n.operator}' must be at most ${o}`)})}),o.size>0)throw new c([...o].join(`
|
|
410
|
-
`))},Ud=t=>{switch(t.kind){case`Number`:try{return pe(t.value)}catch(t){throw n(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return Pe(t.name);case`Set`:return ft(t.elements.map(Ud))}},Wd=e=>[...e.constants,...e.variables.map(e=>({name:e,arity:0}))],Gd=e=>new c(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),Kd=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:Er},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),qd=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>U(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new u(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&Le(t,r)})});if(t)return t[1];throw new u(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:U(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},Jd=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||In(e).some(e=>Jd(e,t)),Yd=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(ji(e),n.get(e)??n.size)),n},Xd=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),Zd=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Ka(e);if(e.kind===`Number`&&!Io(e.value))throw qa(e);Zd(e.kind===`Let`?[...In(e),...Xd(e.instances??[])]:In(e))}),Qd=(e,t)=>{let n=hc(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=new Map(Au.map(e=>[e.name,e])),s=/* @__PURE__ */ new Map,d=Xc(e.checkDeadlock,t.seed),f=/* @__PURE__ */ new Map,p=/* @__PURE__ */ new Map,m=[],h=/* @__PURE__ */ new Map,g=[],_=[],v=(e,t)=>g.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),y={value:0},ee=e=>`${e}#${y.value++}`,b=[],x=/* @__PURE__ */ new Map,te=e=>{let n=s.get(e);if(n)return n;let r=Wu(e,t.print,d,t.files);if(!r)return;let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>te(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(e=>{o.set(e.name,e),i.set(e.name,{key:e.name,arity:e.arity})}),s.set(e,i),i},ne=e=>{let t=te(e);return t&&v(e,Uu.get(e)??[]),t},re=e=>(Zd([...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...Xd(e.instances)]),e.modules.forEach(re),e);re(n);let S=(e,n)=>{let r=t.loadModule?.(e)??Is.get(e)??pc(t.source,e);if(r===void 0)throw new c(`Cannot find source file for module ${e} imported in module ${n}.`);let i=hc(r);if(i.name!==e)throw new c(`File name '${e}' does not match the name '${i.name}' of the top level module it contains.`);return re(i)},ie=e=>{let t=_.indexOf(e.name);if(t!==-1)throw new c(`Circular dependency among .tla files; dependency cycle is: ${[..._.slice(t),e.name].map(e=>`${e}.tla`).join(` --> `)}`);let n=/* @__PURE__ */ new Set,r=[];_.push(e.name),g.push(n);let i=se(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r});g.pop(),_.pop();let a=r.find(e=>n.has(e.name));if(a)throw Gd(a);return{linked:i,closure:n}},C=(e,t)=>{let n=f.get(e);if(n)return v(e,h.get(e)??[]),n;let r=ie(S(e,t));return f.set(e,r.linked),h.set(e,r.closure),v(e,r.closure),r.linked},ae=(e,t,n,o,s)=>{let c=s?void 0:ne(e.module);if(c)return e.name===void 0?c:new Map([...c].map(([t,n])=>[`${e.name}!${t}`,n]));let l=s??C(e.module,t.name),u=Wd(l),d=`#${y.value++}`,f=new Map(e.params.map(e=>[e.name,`${e.name}${d}`])),p=fi(sd(e,t),u,t,n);b.push({module:e.module,instancer:t.name,lets:[],substitutions:p,location:e.location});let m=Ui({params:e.params.map(e=>({...e,name:`${e.name}${d}`})),substitutions:new Map([...p].map(([e,t])=>[e,gi(t,f)])),variables:new Set(l.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(n,s,c)=>{let l=ee(`${s}@${t.name}`);return r.set(l,c(l)),i.set(l,!o),a.set(l,{source:n,prefix:e.params.length}),l},createName:ee}),h=new Set(u.map(e=>e.name)),g=/* @__PURE__ */ new Map;return l.exported.forEach((t,n)=>{if(h.has(n))return;if(e.name===void 0){let r=m.getKey(t.key);u.length>0&&x.set(r,{name:n,location:e.location}),g.set(n,{key:r,arity:t.arity});return}let r=m.getQualifiedKey(t.key);u.length>0&&x.set(r,{name:`${e.name}!${n}`,location:e.location}),g.set(`${e.name}!${n}`,{key:r,arity:t.arity+e.params.length})}),g},w=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:Er})),oe=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:w(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),T=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),E=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=T(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:w(r,n),location:n}}},D=(e,t,n,a)=>{let o=e.location,s=a?void 0:ne(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=T(n.arity);return oe(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=a??C(e.module,n),l=`#${y.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=Wd(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};b.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:o});let p=new Set(e.params.map(e=>e.name)),m=e=>Jd(f(e),p),h=d.map(t=>{let n=E(f(t),t,o);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:o}}),g=[],_=Ui({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:w(e.params,o),location:o,resolution:Er}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:Er}])),variables:new Set(c.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:Kd(a,i)),i},createName:ee}),v=new Set(d.map(e=>e.name)),x=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),i=T(n.arity),a=[...e.params,...i];return oe(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...g,...x]},O=e=>[...e].flatMap(([e,t])=>{let n=r.get(t.key);return n?[{...n,name:e}]:[]}),se=(e,a)=>{let o=Ws(e,t.loadClass?.(e.name)),s=new Map([...Au.map(e=>[e.name,{key:e.name,arity:e.arity}]),...a.symbols]),c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=[],d=[...o.constants],f=o.variables.map(e=>e.name),h=o.variables.map(e=>e.location),g=(e,t)=>e.forEach((e,n)=>{s.set(n,e),t&&c.set(n,e)});o.extends.forEach(e=>{let t=a.modules.get(e),n=t?void 0:ne(e);if(n){g(n,!0);return}let r=t??C(e,o.name);d.push(...r.constants.filter(e=>d.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{f.includes(e)||(f.push(e),h.push(r.variableLocations[t]))}),g(r.exported,!0),r.modules.forEach((e,t)=>l.set(t,e)),u.push(r)}),o.constants.forEach(e=>c.set(e.name,{key:e.name,arity:e.arity,declaration:`Constant`})),o.variables.forEach(e=>c.set(e.name,{key:e.name,arity:0,declaration:`Variable`}));let _=d.length===0&&f.length===0,v=e=>o===n?e.name:`${e.name}@${a.id}`,y=/* @__PURE__ */ new Map,ee=e=>({imported:s,importedAt:y,definitions:new Map(e.definitions.map(e=>[e.name,e])),getKey:v}),b=()=>new Map([...a.modules,...l]),x=e=>new Map([...s,...[...o.constants.map(e=>({...e,kind:`Constant`})),...o.variables.map(e=>({...e,kind:`Variable`}))].filter(t=>Ar(t.location,e)).map(e=>[e.name,{key:e.name,arity:e.arity,declaration:e.kind}]),...o.definitions.filter(t=>Ar(t.location,e)).map(e=>[e.name,{key:v(e),arity:jr(e)}])]),te=e=>{let t=b();if(t.has(e.name))throw Gd(e);a.nested.push(e);let n=se(e,{id:`${a.id}/${e.name}`,symbols:x(e.location),modules:t,nested:a.nested});l.set(e.name,n),p.has(e.name)||p.set(e.name,n)};[...o.instances.map(e=>({location:e.location,link:()=>{let t=ae(e,o,ee(o),_,b().get(e.module));t.forEach((t,n)=>{s.has(n)||y.set(n,e.location)}),g(t,!e.isLocal)}})),...o.modules.map(e=>({location:e.location,link:()=>te(e)}))].sort((e,t)=>Ar(e.location,t.location)?-1:1).forEach(e=>e.link()),ui(o,ee(o));let re=e=>{let t=o.instances.find(t=>t.module===e.name);return t!==void 0&&Ar(e.location,t.location)},S=e=>{let t=o.modules.find(t=>t.name===e.module);return t?re(t)?l.get(t.name):void 0:b().get(e.module)},ie=cd(qi(o,(e,t)=>D(e,t,o.name,S(e))),O(s));pi(ie,ee(ie)),ie.definitions.forEach(e=>{let t=v(e);r.set(t,e),i.set(t,!_);let n={key:t,arity:jr(e)};s.set(e.name,n),e.isLocal||c.set(e.name,n)}),Bd(ie,{constants:new Set(d.map(e=>e.name)),variables:new Set(f),getDefinition:e=>r.get(s.get(e)?.key??e)});let w={module:ie,constants:d,variables:f,variableLocations:h,visible:s,exported:c,modules:l,extended:u};return m.push(w),w},k=ie(n).linked,ce=e=>k.visible.get(e)?.key??e;k.visible.forEach((e,t)=>{let n=r.get(e.key);n&&e.key!==t&&r.set(t,n)});let le=[],ue=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>ue(e,t)),le.push(...e.module.assumptions))};ue(k,/* @__PURE__ */ new Set);let A=k.constants.map(e=>e.name),j=k.variables,de=e=>e.module===void 0?[e.name,ce(e.name)]:e.module===n.name||A.includes(e.name)?[]:[(f.get(e.module)??p.get(e.module))?.visible.get(e.name)?.key??e.name],M=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:k.constants.find(t=>t.name===e)?.arity??0},N=/* @__PURE__ */ new Map,fe=/* @__PURE__ */ new Set,pe=(e,t)=>{o.set(e,t),r.delete(e),N.delete(e),fe.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=Ud(e.value);de(e).forEach(e=>{let n=M(e);n===0?N.set(e,t):pe(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let me=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=me.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new l(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(Ud),Ud(e.value)]),me.set(t,n)}),me.forEach(e=>de(e).forEach(t=>pe(t,qd(e.name,M(t)||e.rows[0][0].length,e.rows))));let he=new Map(e.substitutions.flatMap(e=>de(e).map(t=>[t,ce(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,i=t.target;if(!A.includes(n)&&!k.visible.has(n))throw new l(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===i))throw new l(`In the configuration file, the identifier ${i} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let a=ce(i),s=r.get(a);if(!(s!==void 0||o.has(a)||N.has(a)||A.includes(i)||j.includes(i)))throw new l(`The configuration file substitutes for ${n} with the undefined identifier ${i}.`);if(s?.kind===`Operator`&&s.params.length!==(k.constants.find(e=>e.name===n)?.arity??k.visible.get(n)?.arity))throw new l(`The configuration file substitutes for ${n} with ${i} of different number of arguments.`)});let ge=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(de)),_e=(e,t)=>{if(ge.has(e))return{key:e,prefix:t};let n=a.get(e);return n&&_e(n.source,t+n.prefix)};a.forEach((e,t)=>{let n=_e(e.source,e.prefix),i=r.get(t);if(!n||!i)return;let a=i.kind===`Operator`?i.params:[],o=oe(t,n.key,a,a.slice(n.prefix),i.location);r.set(t,o),k.visible.forEach((e,n)=>{e.key===t&&n!==t&&r.set(n,o)})}),A.forEach(e=>{if(!N.has(e)&&!he.has(e)&&!fe.has(e))throw new l(`The constant ${e} is not assigned a value by the configuration`)});let ve={runtime:d,definitions:r,builtins:o,constants:N,substitutions:he,variables:j,variableIndex:Yd(j,m.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,evaluators:/* @__PURE__ */ new WeakMap};Hd(b,e=>{let t=f.get(e)??p.get(e)??k;return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>r.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),getDefinition:e=>r.get(t.visible.get(e)?.key??e)}});let ye=Rd({constants:new Set(N.keys()),variables:/* @__PURE__ */ new Set([...j,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>o.has(e))]),getDefinition:e=>$a(e,ve)}),be=e=>{try{return X(e,{environment:ve,scope:void 0,state:void 0,next:void 0}),!0}catch(e){if(e instanceof u)return!1;throw e}};return he.forEach((e,t)=>{let n=r.get(e);if(A.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&ye.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0&&!be(n.body))throw new l(`The configuration file substitutes constant ${t} with non-constant ${e}`)}),d.isStarted=!0,{environment:ve,assumptions:le,variableLocations:k.variableLocations,instanceActions:x}},$d={kind:`Boolean`,value:!0},ef={kind:`Boolean`,value:!1},tf=e=>e?$d:ef,nf=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,rf=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,Q=(e,t)=>({kind:e,body:t}),af=(e,t,n)=>({kind:e,operands:[t,n]}),of=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?of(e,t.operands).operands:[t])}),sf=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return sf(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,sf(t)),0)}},cf=e=>{switch(e.kind){case`Action`:return!0;case`Boolean`:case`State`:case`Enabled`:return!1;case`Not`:case`Always`:case`Eventually`:case`Next`:return cf(e.body);case`And`:case`Or`:return e.operands.some(cf)}},lf=/* @__PURE__ */ new WeakMap,uf={count:0},df=e=>{let t=lf.get(e);if(t!==void 0)return t;let n=(()=>{switch(e.kind){case`Boolean`:return String(e.value);case`State`:case`Enabled`:case`Action`:return`#${uf.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(df).join(`,`)})`;default:return`${e.kind}(${df(e.body)})`}})();return lf.set(e,n),n},ff=(e,t)=>e===t||df(e)===df(t),pf=(e,t)=>{let n=df(t);return e.some(e=>e===t||df(e)===n)},mf=e=>e===`And`?`Or`:`And`,hf=(e,t)=>{switch(e.kind){case`Boolean`:return t?tf(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?Q(`Not`,e):e;case`Not`:return hf(e.body,!t);case`And`:case`Or`:return of(t?mf(e.kind):e.kind,e.operands.map(e=>hf(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return Q(n,hf(e.body,t))}}},gf=e=>{switch(e.kind){case`Boolean`:return tf(!e.value);case`Not`:return e.body;case`And`:case`Or`:return of(mf(e.kind),e.operands.map(gf));case`Always`:return Q(`Eventually`,gf(e.body));case`Eventually`:return Q(`Always`,gf(e.body));default:return Q(`Not`,e)}},_f=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=_f(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return tf(t)}return n.length===0?tf(!t):n.length===1?n[0]:of(e.kind,n)}case`Not`:{let t=_f(e.body);return t.kind===`Boolean`?tf(!t.value):Q(`Not`,t)}case`Always`:case`Eventually`:{let t=_f(e.body);return Q(e.kind,t.kind===e.kind?t.body:t)}default:return e}},vf=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,yf=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=yf(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new u(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form`);t.push(e)}}if(n.value===1)return{kind:`And`,operands:t};let r=Array.from({length:n.value},()=>[]),i={groups:1,repeat:n.value};for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}i.repeat/=e.operands.length;let t={value:0};for(let n=0;n<i.groups;n++)for(let n of e.operands)for(let e=0;e<i.repeat;e++)r[t.value++].push(n);i.groups*=e.operands.length}return{kind:`Or`,operands:r.map(e=>of(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=yf(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=vf(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:of(`Or`,t);n.push(Q(`Always`,Q(`Eventually`,e)))}return of(`Or`,n)}case`Not`:return nf(e.body)?e:yf(gf(e.body));default:return e}},bf=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?bf(e.operands[0]):of(e.kind,e.operands.map(bf));case`Not`:return e.body.kind===`Not`?bf(e.body.body):Q(`Not`,bf(e.body));case`Always`:case`Eventually`:case`Next`:return Q(e.kind,bf(e.body));default:return e}},xf=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return xf(e.operands[0]);let t=Math.floor(e.operands.length/2);return af(e.kind,xf(of(e.kind,e.operands.slice(0,t))),xf(of(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return Q(e.kind,xf(e.body));default:return e}},Sf=(e,t)=>{e.kind===`Eventually`&&!pf(t,e)&&t.push(e),`body`in e&&Sf(e.body,t),`operands`in e&&e.operands.forEach(e=>Sf(e,t))},Cf=e=>{let t=e.filter(rf),n=e.flatMap(e=>e.kind===`Not`&&rf(e.body)?[e.body]:[]);return!t.some(e=>pf(n,e))},wf=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,Q(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new u(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Tf=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:Q(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Ef=(e,t,n)=>e.flatMap(e=>{let r=Tf(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Df=e=>[...new Set(e.map(df))].sort().join(`|`),Of=(e,t)=>{let n=new Set(t.map(Df));return[...e.filter(e=>!n.has(Df(e))),...t]},kf=e=>{let t=wf(e),n=Ef(t,`Always`,`And`),r=Ef(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Tf(t,`Eventually`,`Or`);if(n&&!(pf(e,n.first)||pf(e,n.second)))return Of(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(pf(e,t.first)||pf(e,t.second))&&!pf(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Cf(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Tf(t[e],`Always`,`And`);n&&(pf(t,n.first)||t.push(n.first),pf(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)pf(t,e.first)&&pf(t,e.second)&&!pf(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!Cf(t)?[]:i(t)};return a(e)},Af=e=>({particle:e,successors:[],statePredicates:e.filter(e=>sf(e)<=1)}),jf=e=>{let t=kf([e]).map(Af),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Df(e.particle);r.has(n)||r.set(n,t)});for(let e=0;e<t.length;e++){let n=t[e].particle.flatMap(e=>e.kind===`Next`?[e.body]:[]);for(let i of kf(n)){let n=Df(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Af(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Mf=(e,t)=>!pf(e,t)||pf(e,t.body),Nf=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&sf(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=vf(e);if(n){let e=sf(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(cf(e))throw new u(`TLC cannot handle the temporal formula: actions may only appear as []<>A or <>[]A`);t.formulas.push(e)},Pf=(e,t)=>{let n=e.findIndex(e=>ff(e,t));return n===-1?(e.push(t),e.length-1):n},Ff=e=>{let t=yf(_f(hf(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=bf(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Nf(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:of(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:ff(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&xf(e.formula),n=[];t&&Sf(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Pf(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Pf(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Pf(i,e))}));return{tableau:t&&jf(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},If=/* @__PURE__ */ new Set([`~>`,`-+->`]),Lf=/* @__PURE__ */ new WeakMap,Rf=/* @__PURE__ */ new WeakSet,zf=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Bf=e=>new u(`TLC cannot handle the temporal formula at ${Ra(e)}`),$=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=Ja(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return $(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?$(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=$a(e,n);if(t)return Vf(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);return r?+!!r.isStateLevel:void 0},o=(e,t)=>r.has(e)?0:W(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return Si(e,(e,a)=>(i.value=Math.max(i.value,$(e,t,n,a.length===0?r:/* @__PURE__ */ new Set([...r,...a]))),e)),i.value};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:s(e);case`Identifier`:return o(e.name,e);case`OperatorReference`:return o(e.operator,e);case`Apply`:return If.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Vf=(e,t)=>{let n=Lf.get(e);if(n!==void 0)return n;Lf.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max($(e.body,void 0,t),...r.map(e=>$(e.set,void 0,t)));return Lf.set(e,i),i},Hf=`Temporal formula is a tautology (its negation is unsatisfiable).`,Uf=(t,r,i,a,o=``,s=/* @__PURE__ */ new Set)=>{let c=(e,t,n=o,r=s)=>Uf(e,t,i,a,n,r);if(t.kind===`And`)return t.operands.flatMap(e=>c(e,r,Ba(e)));if(t.kind===`Label`)return c(t.body,r);if(t.kind===`Let`)return c(t.body,Wf(t,r,i));if(t.kind===`Identifier`){let e=W(t)?Ja(r,t.name):void 0;if(e?.kind===`Thunk`)return c(e.expression,e.scope);let n=i.constants.has(t.name)?void 0:$a(t.name,i);if(!e&&n?.kind===`Operator`&&n.params.length===0&&Vf(n,i)>0){if(s.has(n))throw new l(`The definition of ${t.name} refers to itself`);return c(n.body,void 0,t.name,/* @__PURE__ */ new Set([...s,n]))}}let d=zf(i,r);if(t.kind===`Apply`&&(e=>a||$(e,r,i)===3)(t)){let e=bo(t,d),n=W(t)?void 0:$a(t.operator,i);if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive)return c(e.body,Mo(e,t.args,d),t.operator)}if(a&&t.kind===`Forall`&&t.bounds.every(e=>$(e.set,r,i)===0)){let r=[],i={count:0};if(io(t.bounds,d,e=>(i.count++,r.push(...c(t.body,e,Ba(t.body))),!1)),i.count===0)throw n(new u(Hf),e.livenessEvaluationFailure);return r}return[{expression:t,scope:r,name:o}]},Wf=(e,t,n)=>{let r=Po(e.definitions,zf(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Rf.add(e.binding);return r},Gf=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),Kf=(e,t,n)=>{let r=(e,t,r)=>{let i=r===0?$(e,t,n):r;if(i===0){let r=X(e,zf(n,t));if(typeof r!=`boolean`)throw new u(`TLC expected a boolean in the temporal formula at ${Ra(e)}`);return tf(r)}return i===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},i={depth:0},a=(e,t,n,a)=>{if(i.depth>=100)throw new u(`TLC overflowed the stack while expanding the temporal formula at ${Ra(n)}`);i.depth++;let o=c(e,t);i.depth--;let s=sf(o);return s>2?o:r(n,a,s)},o=(e,t)=>{let r=e.kind===`Identifier`?e.name:e.operator,i=zf(n,t),o=W(e)||$a(r,n)===void 0?Ja(t,r):void 0;if(o?.kind===`Thunk`&&Rf.has(o))return a(o.expression,o.scope,e,t);let s=o?.kind===`Operator`?o.operator:o?void 0:W(e)?xo(r,i):vo(r,n);if(s?.kind!==`Closure`)throw Bf(e);let c=e.kind===`Apply`?e.args:[];return a(s.body,Mo(s,c,i),e,t)},s=(e,t)=>{if(!e.bounds.every(e=>$(e.set,t,n)===0))throw Bf(e);let i=[];io(e.bounds,zf(n,t),t=>(i.push(c(e.body,t)),!1));let a=e.kind===`Forall`;if(i.length===0)return tf(a);let o=of(a?`And`:`Or`,i),s=sf(o);return s>2?o:r(e,t,s)},c=(e,t)=>{let i=$(e,t,n);if(i<=2)return r(e,t,i);switch(e.kind){case`Label`:return c(e.body,t);case`Let`:return c(e.body,Wf(e,t,n));case`Identifier`:return o(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?Q(`Always`,af(`Or`,Q(`Not`,c(n[0],t)),Q(`Eventually`,c(n[1],t)))):e.operator===`~`&&!W(e)?Q(`Not`,c(n[0],t)):e.operator===`=>`?af(`Or`,Q(`Not`,c(n[0],t)),c(n[1],t)):o(e,t)}case`And`:case`Or`:return of(e.kind,e.operands.map(e=>c(e,t)));case`Forall`:case`Exists`:return s(e,t);case`If`:{if($(e.condition,t,n)===0){let r=X(e.condition,zf(n,t));if(typeof r==`boolean`)return c(r?e.consequent:e.alternative,t)}let r=c(e.condition,t);return af(`Or`,af(`And`,r,c(e.consequent,t)),af(`And`,Q(`Not`,r),c(e.alternative,t)))}case`Always`:case`Eventually`:return Q(e.kind,c(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=Gf(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=Q(`Not`,r),a={kind:`Action`,expression:e.action,unchanged:{kind:`Unchanged`,expression:e.subscript,location:n.location},scope:t,enabled:r};return e.kind===`WeakFairness`?Q(`Always`,Q(`Eventually`,af(`Or`,i,a))):af(`Or`,Q(`Eventually`,Q(`Always`,i)),Q(`Always`,Q(`Eventually`,a)))}default:throw Bf(e)}};return c(e,t)},qf=(e,t,n,r,i)=>{let a=e=>qf(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a={environment:r,scope:e.scope,state:t,next:void 0},o=e.kind===`State`?Qa(X(e.expression,a),`a temporal property predicate`):Na(e.step,a);return i.set(e,o),o}case`Action`:{if(e.enabled&&i.get(e.enabled)===!1)return!1;let a={environment:r,scope:e.scope,state:t,next:n};return e.unchanged&&Qa(X(e.unchanged,a),`a subscript`)?!1:Qa(X(e.expression,a),`an action predicate`)}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return qf(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new u(`TLC cannot evaluate a temporal formula in a single step`)}},Jf=(e,t,n,r,i)=>{let a=e=>e+1<t.length?e+1:n,o=e=>t.map((e,t)=>t).filter(t=>t>=Math.min(e,n)),s=(e,a=r)=>Jf(e,t,n,a,i);switch(e.kind){case`Not`:return!s(e.body);case`And`:return e.operands.every(e=>s(e));case`Or`:return e.operands.some(e=>s(e));case`Next`:return s(e.body,a(r));case`Always`:return o(r).every(t=>s(e.body,t));case`Eventually`:return o(r).some(t=>s(e.body,t));default:return qf(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Yf=(e,t)=>e.every((e,n)=>ze(e,t[n])),Xf=e=>e.filter((t,n)=>n===0||e[n-1]!==t),Zf=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.successors.push([]),e.offsets.push(-1),e.nodeStates.length-1),Qf=(e,t)=>e.offsets[t]!==-1,$f=(e,t,n)=>e.results.bytes[e.offsets[t]+n]===1,ep=2**53-1,tp=(e,t,n,r)=>{if(e.length===0)return;let i=t.map(e=>Kf(e.expression,e.scope,n)),a=e.map(e=>Q(`Not`,Kf(e.expression,e.scope,n))),o=a.length===1?a[0]:of(`Or`,a),s=i.length===0?o:of(`And`,[...i,o]),c=Ff(s);if(c.length===0)throw new u(Hf);let l=/* @__PURE__ */ new Map,d=c.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=df(e),n=l.get(t)??l.size;return l.set(t,n),n}),nodeStates:[],nodeTableaux:[],successors:[],offsets:[],results:{bytes:/* @__PURE__ */ new Uint8Array(1024),length:0},initial:[],nodeIds:/* @__PURE__ */ new Map,nodesByState:/* @__PURE__ */ new Map,isDone:[],errorNode:void 0})),f={multiplier:1},p=!Ko(n),m={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},h=e=>{let t=m.states.get(e)??/* @__PURE__ */ new Map;return m.states.set(e,t),t},g=(e,t)=>{n.runtime.setLivenessSource(e);let r=t();return n.runtime.setLivenessSource(void 0),r},_=(e,t)=>qf(e,t,void 0,n,p?h(t):/* @__PURE__ */ new Map),v=(e,t,n)=>g(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!_(e,n))),y=(e,t,r,i)=>g(t,()=>{let t=e.solution.actionChecks;if(!p)return Uint8Array.from(t,e=>+!!qf(e,r,i,n,/* @__PURE__ */ new Map));let a=h(r),o=m.actions.get(r)??/* @__PURE__ */ new Map;m.actions.set(r,o);let s=o.get(i)??new Int8Array(l.size).fill(-1);return o.set(i,s),Uint8Array.from(e.actionIds,(e,o)=>(s[e]===-1&&(s[e]=+!!qf(t[o],r,i,n,a)),s[e]))}),ee=(e,t,n,r)=>g(n,()=>e.nodes[t].statePredicates.every(e=>_(e,r))),b=(e,t)=>{let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},x=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),te=(e,t,n)=>e.solution.tableau?e.nodeIds.get(t*e.solution.tableau.nodes.length+n):t,ne=(e,t,n)=>{let r=Zf(e,t,n);e.nodeIds.set(t*(e.solution.tableau?.nodes.length??1)+n,r);let i=e.nodesByState.get(t);return i?i.push(r):e.nodesByState.set(t,[r]),r},re=(e,t,n,r)=>{let i=e.solution.actionChecks.length,a=e.results,o=a.length;if(a.length+=r.length+n.length*i,a.length>a.bytes.length){let e=new Uint8Array(Math.max(2*a.bytes.length,a.length));e.set(a.bytes),a.bytes=e}a.bytes.set(r,o),n.forEach((e,t)=>a.bytes.set(e,o+r.length+t*i)),e.offsets[t]=o,e.successors[t]=e.successors[t].slice()},S=(e,t,n)=>{let i={slots:Array.from({length:16*f.multiplier}),count:0},a=(e,t)=>{for(let n=(r.getFingerprint(t.index)&2147483647)%e.length;;n=(n+1)%e.length){let r=e[n];if(r===void 0)return e[n]=t,!0;if(r.index===t.index&&Yf(r.state,t.state))return!1}},o=e=>{if(i.count>=i.slots.length>>1){let e=i.slots;i.slots=Array.from({length:2*e.length+1});for(let t of e)t&&a(i.slots,t)}a(i.slots,e)&&i.count++};return n.forEach(o),o({index:e,state:t}),i.slots.length>16*f.multiplier&&f.multiplier++,i.slots.filter(e=>e!==void 0)},ie=(e,t,n,i,a)=>{let o=v(e,i,n),s=t.nodes[e.nodeTableaux[a]],c=[],l=e.successors[a],u=s.successors.length>0?y(e,i,n,n):/* @__PURE__ */ new Uint8Array;for(let r of s.successors){if(!ee(t,r,i,n))continue;if(b(t,r)&&e.errorNode===void 0&&x(e)){e.errorNode=a;return}let o=te(e,i,r);if(o!==void 0&&l.includes(o))continue;let s=o??ne(e,i,r);l.push(s),c.push(u),o===void 0&&ie(e,t,n,i,s)}for(let a of r.getSuccessors(n)){let r=y(e,i,n,a.state),o=e.isDone[a.index]===!0;for(let n of s.successors){if(!ee(t,n,i,a.state))continue;let s=te(e,a.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??ne(e,a.index,n);l.push(u),c.push(r),s===void 0&&o&&ie(e,t,a.state,a.index,u)}}l.length>0&&re(e,a,c,o)},C=(e,t,n,r,i,a)=>{let o=t.nodes.map((e,r)=>n.map(e=>ee(t,r,a,e.state)));e.isDone[a]=!0;for(let s of(e.nodesByState.get(a)??[]).slice()){let a=e.successors[s],c=[];n.forEach((n,i)=>{let l=e.isDone[n.index]===!0;for(let u of t.nodes[e.nodeTableaux[s]].successors){if(!o[u][i])continue;let s=te(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??ne(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&ie(e,t,n.state,n.index,d)}}),re(e,s,c,i)}if(e.errorNode!==void 0)return Xf(w(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},ae=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)Zf(e,e.nodeStates.length,-1);let a=e.successors[i],o=[];t.forEach((t,r)=>{Qf(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),re(e,i,o,r)},w=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)Qf(e,t)&&(r.push(t),n.set(t,-1));for(let i=0;i<r.length;i++){let a=r[i];for(let i of e.successors[a])if(!(i===a&&e.solution.tableau)){if(i===t){let e=[t];for(let t=a;t!==-1;t=n.get(t)??-1)e.push(t);return e}Qf(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new u(`Couldn't re-create liveness trace (path) starting at: ${t}`)},oe=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=n.stateChecks.length,a=(t,n,a)=>e.results.bytes[e.offsets[t]+i+n*r+a]===1,o=(e,n)=>t.eventuallyAlways.every(t=>a(e,n,t)),s=new Float64Array(e.nodeStates.length).fill(-1),c=e.initial.filter(t=>Qf(e,t)),l=[],d=t=>{let n=e.successors[t].indexOf(t);return n!==-1&&o(t,n)},f=(t,r)=>n.tableau!==void 0&&Mf(n.tableau.nodes[e.nodeTableaux[t]].particle,r),p=r=>{let i=l.pop()??r;if(i===r&&!d(i)){s[i]=ep;return}let c=/* @__PURE__ */ new Set,u=/* @__PURE__ */ new Map;for(let t=i;;t=l.pop()??r){c.add(t);let n=u.get(e.nodeStates[t]);if(n?n.push(t):u.set(e.nodeStates[t],[t]),s[t]=ep,t===r)break}let p=t.infinitelyOftenStates.every(t=>[...c].some(n=>$f(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...c].some(n=>e.successors[n].some((e,r)=>c.has(e)&&o(n,r)&&a(n,r,t)))),g=n.promises.every(e=>[...c].some(t=>f(t,e)));if(p&&h&&g)return m(r,c,u)},m=(r,i,s)=>{let c=Xf(w(e,r).reverse().map(t=>e.nodeStates[t])),l=[],d=/* @__PURE__ */ new Set([r]),p=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),g=n.promises.map(()=>!1),_={count:p.length+m.length+g.length},v={node:r},y=e=>i.has(e),ee=e=>{l.push(v.node),v.node=e};for(;_.count>0;){let r=_.count;for(;t.infinitelyOftenStates.forEach((t,n)=>{!p[n]&&$f(e,v.node,t)&&(p[n]=!0,_.count--)}),n.promises.forEach((e,t)=>{!g[t]&&f(v.node,e)&&(g[t]=!0,_.count--)}),!(_.count<=0);){let n={last:-1,unvisited:-1},i=_.count;if(e.successors[v.node].some((r,c)=>{if(s.has(e.nodeStates[r])){if(!y(r)||!o(v.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&a(v.node,c,e)&&(m[t]=!0,_.count--)})}return _.count<i?(ee(r),d.clear(),!0):(y(r)&&!d.has(r)&&(n.unvisited=r),!1)}))break;if(_.count<r){ee(n.last),d.clear();break}for(;n.unvisited===-1;){let t=l.pop();if(t===void 0)throw new u(`TLC failed to build the counterexample of a liveness property`);v.node=t,n.unvisited=e.successors[t].find(e=>y(e)&&!d.has(e))??-1}ee(n.unvisited),d.add(n.unvisited)}}let b=h(r,v.node,s,o);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];b[b.length-1]!==n&&b.push(n)}let x=c[c.length-1];return b[b.length-1]===x&&b.pop(),{prefix:c.slice(0,-1),cycle:[x,...b.reverse()]}},h=(t,n,r,i)=>{if(n===t)return[];let a=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([a]),c=[];for(let n=a,l=-1,d=0;;d++){for(let u of r.get(n)??[])for(let[d,f]of e.successors[u].entries()){if(f===u||!i(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==a;)e.push(t),t=r,r=o.get(t)??-1;return e.push(a),e}let p=e.nodeStates[f];r.has(p)&&!s.has(p)&&(s.add(p),c.push([p,n]))}o.set(n,l);let f=c[d];if(f===void 0)throw new u(`TLC failed to build the counterexample of a liveness property`);n=f[0],l=f[1]}};for(let t=0;t<c.length;t++){let n=[c[t],-1,0],r={link:0};for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),a=n.pop()??0;if(i===-42){if(s[a]===t){let e=p(a);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(s[a]!==-1){n.push(Math.min(t,s[a]));continue}s[a]=r.link,n.push(t,a,-42),l.push(a);let u={value:r.link++};e.successors[a].forEach((t,r)=>{Qf(e,t)&&(o(a,r)?s[t]===-1?n.push(t,-1):u.value=Math.min(u.value,s[t]):s[t]===-1&&c.push(t))}),n.push(u.value)}}};return{addInitialState:(e,t)=>{m.states.clear(),m.actions.clear();for(let n of d){let r=n.solution.tableau;if(!r)n.initial.push(e);else for(let i=0;i<r.initialCount;i++)ee(r,i,void 0,t)&&n.initial.push(te(n,e,i)??ne(n,e,i))}},addState:(e,t,n)=>{m.states.clear(),m.actions.clear();let r=S(e,t,n);for(let n of d){let i=r.map(r=>y(n,e,t,r.state)),a=v(n,e,t),o=n.solution.tableau,s=o?C(n,o,r,i,a,e):ae(n,r,i,a,e);if(s)return s}},findViolation:()=>{for(let e of d)for(let t of e.solution.models){let n=oe(e,t);if(n)return n}},getViolatedProperties:(t,r)=>[...new Set(e.filter((e,i)=>!Jf(a[i].body,t,r,0,n)).map(e=>e.name))]}},np=`UnnamedAction`,rp={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},ip=e=>{let t=e.range??rp;return Ot([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},ap=e=>{let t=[[`name`,e.name],[`location`,ip(e.location)]];return e.parameters.length===0?Ot(t):Ot([...t,[`context`,Ot(e.parameters)],[`parameters`,R(e.parameters.map(e=>e[0]))]])},op=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),sp=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),cp=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,lp=e=>e.kind===`Apply`?e.args:[],up=(e,t,n)=>{let r=cp(e);if(r===void 0)return;if(W(e)){let e=Ja(t,r);return e?.kind===`Operator`&&e.operator.kind===`Closure`?e.operator:void 0}if(n.constants.has(r)||n.variableIndex.has(r))return;let i=vo(r,n);return i?.kind===`Closure`?i:void 0},dp=(e,t)=>{try{return X(e,sp(t,void 0)),!0}catch(e){if(e instanceof s)return!1;throw e}},fp=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&to(e,t)&&dp(e.body,t),pp=(e,t)=>{let n=$a(e.name,t);return n?.body===e.body&&fp(n,t)},mp=(e,t)=>{if(e.kind!==`Identifier`||!W(e))return;let n=Ja(t,e.name);return n?.kind===`Thunk`?n:void 0},hp=(e,t)=>(e?.params??[]).flatMap(e=>{let n=Ja(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),gp=(e,t)=>{try{return e()}catch(e){if(e instanceof s)return t();throw e}},_p=(e,t,n,r,i)=>{let a=lp(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return!r||a.length===0?[{...e,parameters:[],expression:t,scope:n}]:a.some(e=>$(e,n,i)!==0)?o():gp(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),X(e,sp(i,n))]),expression:t,scope:n}],o)},vp=(e,t,n,r,i)=>{let a=()=>({name:n?.name??np,location:e.location,parameters:hp(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return vp(e.body,Po(e.definitions,sp(r,t)),n,r,i);case`Label`:return vp(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>vp(e,t,n,r,i));case`Exists`:return gp(()=>{let o=[];return io(e.bounds,sp(r,t),t=>(o.push(...vp(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=W(e)?void 0:i.get(cp(e)??``),s=up(e,t,r);if(o)return _p(o,e,t,s,r);if(!s)return[a()];let c=lp(e),l=()=>[{name:s.name,location:e.location,parameters:[],expression:e,scope:t}];return pp(s,r)||c.some(e=>$(e,t,r)!==0)?l():gp(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:X(n,sp(r,t))},parent:e}),s.scope);return vp(s.body,e,s,r,i)},l)},yp=(e,t,n,r,i)=>{let a=(e,t)=>yp(e,t,n,r,i);if(e.kind===`Let`){a(e.body,Po(e.definitions,sp(n,t)));return}let o=mp(e,t);if(o){a(o.expression,o.scope);return}let s=up(e,t,n);if(s&&pp(s,n))return;if(s&&s.params.length===0){if($(s.body,s.scope,n)===1){r.inits.push(op(s.name,s.body));return}a(s.body,s.scope);return}if(s&&e.kind===`Apply`&&s.params.length===e.args.length){a(s.body,Mo(s,e.args,sp(n,t)));return}if(e.kind===`And`){e.operands.forEach(e=>a(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t});return}r.temporals.push(op(np,e));return}let c=$(e,t,n);c<=1?r.inits.push(op(np,e)):c===3&&r.temporals.push(op(np,e))},bp=(e,t,n,r,i)=>{let a=(t,n)=>bp(e,t,n,r,i);if(t.kind===`Let`){a(t.body,Po(t.definitions,sp(r,n)));return}let o=mp(t,n);if(o){a(o.expression,o.scope);return}let s=up(t,n,r);if(s&&pp(s,r))return;if(s&&s.params.length===lp(t).length){a(s.body,t.kind===`Apply`?Mo(s,t.args,sp(r,n)):s.scope);return}if(t.kind===`Forall`&&gp(()=>(io(t.bounds,sp(r,n),e=>(a(t.body,e),!1)),!0),()=>!1))return;if(t.kind===`And`){t.operands.forEach(e=>a(e,n));return}if(t.kind===`Always`){let a=t.expression;a.kind===`BoxAction`?i.impliedActions.push(op(e,a)):$(a,n,r)<2?i.invariants.push(op(e,a)):i.impliedTemporals.push(op(e,t));return}let c=$(t,n,r);c<=1?i.impliedInits.push(op(e,t)):c===3&&i.impliedTemporals.push(op(e,t))},xp=(e,t)=>{let n=$a(e,t);return n?.kind===`Operator`&&!fp(n,t)?n:void 0},Sp=e=>Ot([[`name`,e.name],[`location`,ip(e.location)]]),Cp=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:xp(e.specification,t);a&&(yp(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...vp(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:vo(e.init,t);o?.kind===`Closure`&&r.inits.push(op(e.init??``,o.body));let s=e.next===void 0?void 0:vo(e.next,t);return s?.kind===`Closure`&&r.actions.push(...vp(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=xp(e,t);n&&r.invariants.push(op(e,n.body))}),e.properties.forEach(e=>{let n=xp(e,t);n&&bp(e,n.body,void 0,t,r)}),r},wp=(e,t,n)=>Cp(e,t,n).actions,Tp=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>U(e[1])).join(`,`)})`,Ep=e=>`${e.name===np?`Action`:e.name}${Tp(e)} ${za(e.location.range??rp)}`,Dp=e=>`${e.name}${Tp(e)}`,Op=(e,t,n,r)=>{let i=Cp(e,t,r),a=e=>ft(e.map(ap)),o=e=>ft(e.flatMap(e=>{let n=xp(e,t);return n?[Sp(n)]:[]}));return Ot([[`inits`,a(i.inits)],[`actions`,a(i.actions)],[`temporals`,a(i.temporals)],[`invariants`,a(i.invariants)],[`impliedinits`,a(i.impliedInits)],[`impliedactions`,a(i.impliedActions)],[`impliedtemporals`,a(i.impliedTemporals)],[`variables`,ft(t.variables.map((e,t)=>Ot([[`name`,e],[`location`,ip(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},kp=`paired12`,Ap=(e,t=16)=>e<=t*.75?t:Ap(e,t*2),jp=(e,t)=>{let n=Ap(e.length)-1,r=e=>{let r=t(e);return(r^r>>>16)&n};return e.map((e,t)=>({key:e,position:t,bucket:r(e)})).sort((e,t)=>e.bucket-t.bucket||e.position-t.position).map(e=>e.key)},Mp=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),Np=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),Pp=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),Fp=e=>Pp(e).replaceAll(`
|
|
411
|
-
`,`\\n`),
|
|
410
|
+
`))},Ud=t=>{switch(t.kind){case`Number`:try{return pe(t.value)}catch(t){throw n(t,e.error)}case`String`:case`Boolean`:return t.value;case`ModelValue`:return Pe(t.name);case`Set`:return ft(t.elements.map(Ud))}},Wd=e=>[...e.constants,...e.variables.map(e=>({name:e,arity:0}))],Gd=e=>new c(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),Kd=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:{kind:`Identifier`,name:e.name,location:e.location,resolution:Er},location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),qd=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>U(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new u(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&Le(t,r)})});if(t)return t[1];throw new u(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:U(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},Jd=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||In(e).some(e=>Jd(e,t)),Yd=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(ji(e),n.get(e)??n.size)),n},Xd=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),Zd=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Ka(e);if(e.kind===`Number`&&!Io(e.value))throw qa(e);Zd(e.kind===`Let`?[...In(e),...Xd(e.instances??[])]:In(e))}),Qd=(e,t)=>{let n=hc(t.source),r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=new Map(Au.map(e=>[e.name,e])),s=/* @__PURE__ */ new Map,d=Xc(e.checkDeadlock,t.seed),f=/* @__PURE__ */ new Map,p=/* @__PURE__ */ new Map,m=[],h=/* @__PURE__ */ new Map,g=[],_=[],v=(e,t)=>g.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),y={value:0},ee=e=>`${e}#${y.value++}`,b=[],x=/* @__PURE__ */ new Map,te=e=>{let n=s.get(e);if(n)return n;let r=Wu(e,t.print,d,t.files);if(!r)return;let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>te(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(e=>{o.set(e.name,e),i.set(e.name,{key:e.name,arity:e.arity})}),s.set(e,i),i},ne=e=>{let t=te(e);return t&&v(e,Uu.get(e)??[]),t},re=e=>(Zd([...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...Xd(e.instances)]),e.modules.forEach(re),e);re(n);let S=(e,n)=>{let r=t.loadModule?.(e)??Is.get(e)??pc(t.source,e);if(r===void 0)throw new c(`Cannot find source file for module ${e} imported in module ${n}.`);let i=hc(r);if(i.name!==e)throw new c(`File name '${e}' does not match the name '${i.name}' of the top level module it contains.`);return re(i)},ie=e=>{let t=_.indexOf(e.name);if(t!==-1)throw new c(`Circular dependency among .tla files; dependency cycle is: ${[..._.slice(t),e.name].map(e=>`${e}.tla`).join(` --> `)}`);let n=/* @__PURE__ */ new Set,r=[];_.push(e.name),g.push(n);let i=se(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r});g.pop(),_.pop();let a=r.find(e=>n.has(e.name));if(a)throw Gd(a);return{linked:i,closure:n}},C=(e,t)=>{let n=f.get(e);if(n)return v(e,h.get(e)??[]),n;let r=ie(S(e,t));return f.set(e,r.linked),h.set(e,r.closure),v(e,r.closure),r.linked},ae=(e,t,n,o,s)=>{let c=s?void 0:ne(e.module);if(c)return e.name===void 0?c:new Map([...c].map(([t,n])=>[`${e.name}!${t}`,n]));let l=s??C(e.module,t.name),u=Wd(l),d=`#${y.value++}`,f=new Map(e.params.map(e=>[e.name,`${e.name}${d}`])),p=fi(sd(e,t),u,t,n);b.push({module:e.module,instancer:t.name,lets:[],substitutions:p,location:e.location});let m=Ui({params:e.params.map(e=>({...e,name:`${e.name}${d}`})),substitutions:new Map([...p].map(([e,t])=>[e,gi(t,f)])),variables:new Set(l.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(n,s,c)=>{let l=ee(`${s}@${t.name}`);return r.set(l,c(l)),i.set(l,!o),a.set(l,{source:n,prefix:e.params.length}),l},createName:ee}),h=new Set(u.map(e=>e.name)),g=/* @__PURE__ */ new Map;return l.exported.forEach((t,n)=>{if(h.has(n))return;if(e.name===void 0){let r=m.getKey(t.key);u.length>0&&x.set(r,{name:n,location:e.location}),g.set(n,{key:r,arity:t.arity});return}let r=m.getQualifiedKey(t.key);u.length>0&&x.set(r,{name:`${e.name}!${n}`,location:e.location}),g.set(`${e.name}!${n}`,{key:r,arity:t.arity+e.params.length})}),g},w=(e,t)=>e.map(e=>({kind:`Identifier`,name:e.name,location:t,resolution:Er})),oe=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:w(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),T=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),E=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=T(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:w(r,n),location:n}}},D=(e,t,n,a)=>{let o=e.location,s=a?void 0:ne(e.module);if(s)return e.name===void 0?[]:[...s].map(([t,n])=>{let r=T(n.arity);return oe(`${e.name}!${t}`,n.key,[...e.params,...r],r,o)});let c=a??C(e.module,n),l=`#${y.value++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=Wd(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};b.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:o});let p=new Set(e.params.map(e=>e.name)),m=e=>Jd(f(e),p),h=d.map(t=>{let n=E(f(t),t,o);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:o}}),g=[],_=Ui({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:w(e.params,o),location:o,resolution:Er}:{kind:`Identifier`,name:`${t.name}${l}`,location:o,resolution:Er}])),variables:new Set(c.variables),getDefinition:e=>r.get(e),isParameterized:e=>i.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:Kd(a,i)),i},createName:ee}),v=new Set(d.map(e=>e.name)),x=[...c.exported].filter(([e])=>!v.has(e)).map(([t,n])=>{let r=_.getKey(n.key),i=T(n.arity),a=[...e.params,...i];return oe(e.name===void 0?t:`${e.name}!${t}`,r,a,r===n.key?i:a,o)});return[...h,...g,...x]},O=e=>[...e].flatMap(([e,t])=>{let n=r.get(t.key);return n?[{...n,name:e}]:[]}),se=(e,a)=>{let o=Ws(e,t.loadClass?.(e.name)),s=new Map([...Au.map(e=>[e.name,{key:e.name,arity:e.arity}]),...a.symbols]),c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=[],d=[...o.constants],f=o.variables.map(e=>e.name),h=o.variables.map(e=>e.location),g=(e,t)=>e.forEach((e,n)=>{s.set(n,e),t&&c.set(n,e)});o.extends.forEach(e=>{let t=a.modules.get(e),n=t?void 0:ne(e);if(n){g(n,!0);return}let r=t??C(e,o.name);d.push(...r.constants.filter(e=>d.every(t=>t.name!==e.name))),r.variables.forEach((e,t)=>{f.includes(e)||(f.push(e),h.push(r.variableLocations[t]))}),g(r.exported,!0),r.modules.forEach((e,t)=>l.set(t,e)),u.push(r)}),o.constants.forEach(e=>c.set(e.name,{key:e.name,arity:e.arity,declaration:`Constant`})),o.variables.forEach(e=>c.set(e.name,{key:e.name,arity:0,declaration:`Variable`}));let _=d.length===0&&f.length===0,v=e=>o===n?e.name:`${e.name}@${a.id}`,y=/* @__PURE__ */ new Map,ee=e=>({imported:s,importedAt:y,definitions:new Map(e.definitions.map(e=>[e.name,e])),getKey:v}),b=()=>new Map([...a.modules,...l]),x=e=>new Map([...s,...[...o.constants.map(e=>({...e,kind:`Constant`})),...o.variables.map(e=>({...e,kind:`Variable`}))].filter(t=>Ar(t.location,e)).map(e=>[e.name,{key:e.name,arity:e.arity,declaration:e.kind}]),...o.definitions.filter(t=>Ar(t.location,e)).map(e=>[e.name,{key:v(e),arity:jr(e)}])]),te=e=>{let t=b();if(t.has(e.name))throw Gd(e);a.nested.push(e);let n=se(e,{id:`${a.id}/${e.name}`,symbols:x(e.location),modules:t,nested:a.nested});l.set(e.name,n),p.has(e.name)||p.set(e.name,n)};[...o.instances.map(e=>({location:e.location,link:()=>{let t=ae(e,o,ee(o),_,b().get(e.module));t.forEach((t,n)=>{s.has(n)||y.set(n,e.location)}),g(t,!e.isLocal)}})),...o.modules.map(e=>({location:e.location,link:()=>te(e)}))].sort((e,t)=>Ar(e.location,t.location)?-1:1).forEach(e=>e.link()),ui(o,ee(o));let re=e=>{let t=o.instances.find(t=>t.module===e.name);return t!==void 0&&Ar(e.location,t.location)},S=e=>{let t=o.modules.find(t=>t.name===e.module);return t?re(t)?l.get(t.name):void 0:b().get(e.module)},ie=cd(qi(o,(e,t)=>D(e,t,o.name,S(e))),O(s));pi(ie,ee(ie)),ie.definitions.forEach(e=>{let t=v(e);r.set(t,e),i.set(t,!_);let n={key:t,arity:jr(e)};s.set(e.name,n),e.isLocal||c.set(e.name,n)}),Bd(ie,{constants:new Set(d.map(e=>e.name)),variables:new Set(f),getDefinition:e=>r.get(s.get(e)?.key??e)});let w={module:ie,constants:d,variables:f,variableLocations:h,visible:s,exported:c,modules:l,extended:u};return m.push(w),w},k=ie(n).linked,ce=e=>k.visible.get(e)?.key??e;k.visible.forEach((e,t)=>{let n=r.get(e.key);n&&e.key!==t&&r.set(t,n)});let le=[],ue=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>ue(e,t)),le.push(...e.module.assumptions))};ue(k,/* @__PURE__ */ new Set);let A=k.constants.map(e=>e.name),j=k.variables,de=e=>e.module===void 0?[e.name,ce(e.name)]:e.module===n.name||A.includes(e.name)?[]:[(f.get(e.module)??p.get(e.module))?.visible.get(e.name)?.key??e.name],M=e=>{let t=r.get(e);return t?.kind===`Operator`?t.params.length:k.constants.find(t=>t.name===e)?.arity??0},N=/* @__PURE__ */ new Map,fe=/* @__PURE__ */ new Set,pe=(e,t)=>{o.set(e,t),r.delete(e),N.delete(e),fe.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=Ud(e.value);de(e).forEach(e=>{let n=M(e);n===0?N.set(e,t):pe(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let me=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=me.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new l(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(Ud),Ud(e.value)]),me.set(t,n)}),me.forEach(e=>de(e).forEach(t=>pe(t,qd(e.name,M(t)||e.rows[0][0].length,e.rows))));let he=new Map(e.substitutions.flatMap(e=>de(e).map(t=>[t,ce(e.target)])));e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,i=t.target;if(!A.includes(n)&&!k.visible.has(n))throw new l(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===i))throw new l(`In the configuration file, the identifier ${i} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);let a=ce(i),s=r.get(a);if(!(s!==void 0||o.has(a)||N.has(a)||A.includes(i)||j.includes(i)))throw new l(`The configuration file substitutes for ${n} with the undefined identifier ${i}.`);if(s?.kind===`Operator`&&s.params.length!==(k.constants.find(e=>e.name===n)?.arity??k.visible.get(n)?.arity))throw new l(`The configuration file substitutes for ${n} with ${i} of different number of arguments.`)});let ge=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(de)),_e=(e,t)=>{if(ge.has(e))return{key:e,prefix:t};let n=a.get(e);return n&&_e(n.source,t+n.prefix)};a.forEach((e,t)=>{let n=_e(e.source,e.prefix),i=r.get(t);if(!n||!i)return;let a=i.kind===`Operator`?i.params:[],o=oe(t,n.key,a,a.slice(n.prefix),i.location);r.set(t,o),k.visible.forEach((e,n)=>{e.key===t&&n!==t&&r.set(n,o)})}),A.forEach(e=>{if(!N.has(e)&&!he.has(e)&&!fe.has(e))throw new l(`The constant ${e} is not assigned a value by the configuration`)});let ve={runtime:d,definitions:r,builtins:o,constants:N,substitutions:he,variables:j,variableIndex:Yd(j,m.flatMap(e=>e.module.variables.map(e=>e.name))),definitionValues:/* @__PURE__ */ new Map,constantLevels:/* @__PURE__ */ new Map,evaluators:/* @__PURE__ */ new WeakMap};Hd(b,e=>{let t=f.get(e)??p.get(e)??k;return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>r.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),getDefinition:e=>r.get(t.visible.get(e)?.key??e)}});let ye=Rd({constants:new Set(N.keys()),variables:/* @__PURE__ */ new Set([...j,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>o.has(e))]),getDefinition:e=>$a(e,ve)}),be=e=>{try{return X(e,{environment:ve,scope:void 0,state:void 0,next:void 0}),!0}catch(e){if(e instanceof u)return!1;throw e}};return he.forEach((e,t)=>{let n=r.get(e);if(A.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&ye.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0&&!be(n.body))throw new l(`The configuration file substitutes constant ${t} with non-constant ${e}`)}),d.isStarted=!0,{environment:ve,assumptions:le,variableLocations:k.variableLocations,instanceActions:x}},$d={kind:`Boolean`,value:!0},ef={kind:`Boolean`,value:!1},tf=e=>e?$d:ef,nf=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,rf=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,Q=(e,t)=>({kind:e,body:t}),af=(e,t,n)=>({kind:e,operands:[t,n]}),of=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?of(e,t.operands).operands:[t])}),sf=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return sf(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,sf(t)),0)}},cf=e=>{switch(e.kind){case`Action`:return!0;case`Boolean`:case`State`:case`Enabled`:return!1;case`Not`:case`Always`:case`Eventually`:case`Next`:return cf(e.body);case`And`:case`Or`:return e.operands.some(cf)}},lf=/* @__PURE__ */ new WeakMap,uf={count:0},df=e=>{let t=lf.get(e);if(t!==void 0)return t;let n=(()=>{switch(e.kind){case`Boolean`:return String(e.value);case`State`:case`Enabled`:case`Action`:return`#${uf.count++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(df).join(`,`)})`;default:return`${e.kind}(${df(e.body)})`}})();return lf.set(e,n),n},ff=(e,t)=>e===t||df(e)===df(t),pf=(e,t)=>{let n=df(t);return e.some(e=>e===t||df(e)===n)},mf=e=>e===`And`?`Or`:`And`,hf=(e,t)=>{switch(e.kind){case`Boolean`:return t?tf(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?Q(`Not`,e):e;case`Not`:return hf(e.body,!t);case`And`:case`Or`:return of(t?mf(e.kind):e.kind,e.operands.map(e=>hf(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return Q(n,hf(e.body,t))}}},gf=e=>{switch(e.kind){case`Boolean`:return tf(!e.value);case`Not`:return e.body;case`And`:case`Or`:return of(mf(e.kind),e.operands.map(gf));case`Always`:return Q(`Eventually`,gf(e.body));case`Eventually`:return Q(`Always`,gf(e.body));default:return Q(`Not`,e)}},_f=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=_f(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return tf(t)}return n.length===0?tf(!t):n.length===1?n[0]:of(e.kind,n)}case`Not`:{let t=_f(e.body);return t.kind===`Boolean`?tf(!t.value):Q(`Not`,t)}case`Always`:case`Eventually`:{let t=_f(e.body);return Q(e.kind,t.kind===e.kind?t.body:t)}default:return e}},vf=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,yf=e=>{switch(e.kind){case`And`:{let t=[],n={value:1};for(let r of e.operands){let e=yf(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n.value*=e.operands.length,n.value>2147483647))throw new u(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form`);t.push(e)}}if(n.value===1)return{kind:`And`,operands:t};let r=Array.from({length:n.value},()=>[]),i={groups:1,repeat:n.value};for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}i.repeat/=e.operands.length;let t={value:0};for(let n=0;n<i.groups;n++)for(let n of e.operands)for(let e=0;e<i.repeat;e++)r[t.value++].push(n);i.groups*=e.operands.length}return{kind:`Or`,operands:r.map(e=>of(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=yf(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=vf(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:of(`Or`,t);n.push(Q(`Always`,Q(`Eventually`,e)))}return of(`Or`,n)}case`Not`:return nf(e.body)?e:yf(gf(e.body));default:return e}},bf=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?bf(e.operands[0]):of(e.kind,e.operands.map(bf));case`Not`:return e.body.kind===`Not`?bf(e.body.body):Q(`Not`,bf(e.body));case`Always`:case`Eventually`:case`Next`:return Q(e.kind,bf(e.body));default:return e}},xf=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return xf(e.operands[0]);let t=Math.floor(e.operands.length/2);return af(e.kind,xf(of(e.kind,e.operands.slice(0,t))),xf(of(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return Q(e.kind,xf(e.body));default:return e}},Sf=(e,t)=>{e.kind===`Eventually`&&!pf(t,e)&&t.push(e),`body`in e&&Sf(e.body,t),`operands`in e&&e.operands.forEach(e=>Sf(e,t))},Cf=e=>{let t=e.filter(rf),n=e.flatMap(e=>e.kind===`Not`&&rf(e.body)?[e.body]:[]);return!t.some(e=>pf(n,e))},wf=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,Q(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new u(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},Tf=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:Q(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Ef=(e,t,n)=>e.flatMap(e=>{let r=Tf(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Df=e=>[...new Set(e.map(df))].sort().join(`|`),Of=(e,t)=>{let n=new Set(t.map(Df));return[...e.filter(e=>!n.has(Df(e))),...t]},kf=e=>{let t=wf(e),n=Ef(t,`Always`,`And`),r=Ef(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=Tf(t,`Eventually`,`Or`);if(n&&!(pf(e,n.first)||pf(e,n.second)))return Of(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(pf(e,t.first)||pf(e,t.second))&&!pf(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!Cf(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=Tf(t[e],`Always`,`And`);n&&(pf(t,n.first)||t.push(n.first),pf(t,n.second)||t.push(n.second))}let r={isChanged:!0};for(;r.isChanged;){r.isChanged=!1;for(let e of n)pf(t,e.first)&&pf(t,e.second)&&!pf(t,e.whole)&&(t.push(e.whole),r.isChanged=!0)}return t.length>e.length&&!Cf(t)?[]:i(t)};return a(e)},Af=e=>({particle:e,successors:[],statePredicates:e.filter(e=>sf(e)<=1)}),jf=e=>{let t=kf([e]).map(Af),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Df(e.particle);r.has(n)||r.set(n,t)});for(let e=0;e<t.length;e++){let n=t[e].particle.flatMap(e=>e.kind===`Next`?[e.body]:[]);for(let i of kf(n)){let n=Df(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Af(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Mf=(e,t)=>!pf(e,t)||pf(e,t.body),Nf=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&sf(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=vf(e);if(n){let e=sf(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(cf(e))throw new u(`TLC cannot handle the temporal formula: actions may only appear as []<>A or <>[]A`);t.formulas.push(e)},Pf=(e,t)=>{let n=e.findIndex(e=>ff(e,t));return n===-1?(e.push(t),e.length-1):n},Ff=e=>{let t=yf(_f(hf(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=bf(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])Nf(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:of(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:ff(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&xf(e.formula),n=[];t&&Sf(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Pf(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Pf(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Pf(i,e))}));return{tableau:t&&jf(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},If=/* @__PURE__ */ new Set([`~>`,`-+->`]),Lf=/* @__PURE__ */ new WeakMap,Rf=/* @__PURE__ */ new WeakSet,zf=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Bf=e=>new u(`TLC cannot handle the temporal formula at ${Ra(e)}`),$=(e,t,n,r=/* @__PURE__ */ new Set)=>{let i=e=>{let r=Ja(t,e);if(!r)return;if(r.kind===`Value`)return 0;if(r.kind===`Thunk`)return $(r.expression,r.scope,n);let i=r.operator;return i.kind===`Closure`?$(i.body,i.scope,n):0},a=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=$a(e,n);if(t)return Vf(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);return r?+!!r.isStateLevel:void 0},o=(e,t)=>r.has(e)?0:W(t)?i(e)??a(e)??0:a(e)??i(e)??0,s=e=>{let i={value:0};return Si(e,(e,a)=>(i.value=Math.max(i.value,$(e,t,n,a.length===0?r:/* @__PURE__ */ new Set([...r,...a]))),e)),i.value};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:s(e);case`Identifier`:return o(e.name,e);case`OperatorReference`:return o(e.operator,e);case`Apply`:return If.has(e.operator)?3:e.operator===`\\cdot`?2:Math.max(o(e.operator,e),s(e));default:return s(e)}},Vf=(e,t)=>{let n=Lf.get(e);if(n!==void 0)return n;Lf.set(e,0);let r=e.kind===`Function`?e.bounds:[],i=Math.max($(e.body,void 0,t),...r.map(e=>$(e.set,void 0,t)));return Lf.set(e,i),i},Hf=`Temporal formula is a tautology (its negation is unsatisfiable).`,Uf=(t,r,i,a,o=``,s=/* @__PURE__ */ new Set)=>{let c=(e,t,n=o,r=s)=>Uf(e,t,i,a,n,r);if(t.kind===`And`)return t.operands.flatMap(e=>c(e,r,Ba(e)));if(t.kind===`Label`)return c(t.body,r);if(t.kind===`Let`)return c(t.body,Wf(t,r,i));if(t.kind===`Identifier`){let e=W(t)?Ja(r,t.name):void 0;if(e?.kind===`Thunk`)return c(e.expression,e.scope);let n=i.constants.has(t.name)?void 0:$a(t.name,i);if(!e&&n?.kind===`Operator`&&n.params.length===0&&Vf(n,i)>0){if(s.has(n))throw new l(`The definition of ${t.name} refers to itself`);return c(n.body,void 0,t.name,/* @__PURE__ */ new Set([...s,n]))}}let d=zf(i,r);if(t.kind===`Apply`&&(e=>a||$(e,r,i)===3)(t)){let e=bo(t,d),n=W(t)?void 0:$a(t.operator,i);if(e?.kind===`Closure`&&e.params.length===t.args.length&&!n?.isRecursive)return c(e.body,Mo(e,t.args,d),t.operator)}if(a&&t.kind===`Forall`&&t.bounds.every(e=>$(e.set,r,i)===0)){let r=[],i={count:0};if(io(t.bounds,d,e=>(i.count++,r.push(...c(t.body,e,Ba(t.body))),!1)),i.count===0)throw n(new u(Hf),e.livenessEvaluationFailure);return r}return[{expression:t,scope:r,name:o}]},Wf=(e,t,n)=>{let r=Po(e.definitions,zf(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Rf.add(e.binding);return r},Gf=(e,t)=>({kind:`AngleAction`,action:e,subscript:t,location:e.location}),Kf=(e,t,n)=>{let r=(e,t,r)=>{let i=r===0?$(e,t,n):r;if(i===0){let r=X(e,zf(n,t));if(typeof r!=`boolean`)throw new u(`TLC expected a boolean in the temporal formula at ${Ra(e)}`);return tf(r)}return i===1?{kind:`State`,expression:e,scope:t}:{kind:`Action`,expression:e,unchanged:void 0,scope:t}},i={depth:0},a=(e,t,n,a)=>{if(i.depth>=100)throw new u(`TLC overflowed the stack while expanding the temporal formula at ${Ra(n)}`);i.depth++;let o=c(e,t);i.depth--;let s=sf(o);return s>2?o:r(n,a,s)},o=(e,t)=>{let r=e.kind===`Identifier`?e.name:e.operator,i=zf(n,t),o=W(e)||$a(r,n)===void 0?Ja(t,r):void 0;if(o?.kind===`Thunk`&&Rf.has(o))return a(o.expression,o.scope,e,t);let s=o?.kind===`Operator`?o.operator:o?void 0:W(e)?xo(r,i):vo(r,n);if(s?.kind!==`Closure`)throw Bf(e);let c=e.kind===`Apply`?e.args:[];return a(s.body,Mo(s,c,i),e,t)},s=(e,t)=>{if(!e.bounds.every(e=>$(e.set,t,n)===0))throw Bf(e);let i=[];io(e.bounds,zf(n,t),t=>(i.push(c(e.body,t)),!1));let a=e.kind===`Forall`;if(i.length===0)return tf(a);let o=of(a?`And`:`Or`,i),s=sf(o);return s>2?o:r(e,t,s)},c=(e,t)=>{let i=$(e,t,n);if(i<=2)return r(e,t,i);switch(e.kind){case`Label`:return c(e.body,t);case`Let`:return c(e.body,Wf(e,t,n));case`Identifier`:return o(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?Q(`Always`,af(`Or`,Q(`Not`,c(n[0],t)),Q(`Eventually`,c(n[1],t)))):e.operator===`~`&&!W(e)?Q(`Not`,c(n[0],t)):e.operator===`=>`?af(`Or`,Q(`Not`,c(n[0],t)),c(n[1],t)):o(e,t)}case`And`:case`Or`:return of(e.kind,e.operands.map(e=>c(e,t)));case`Forall`:case`Exists`:return s(e,t);case`If`:{if($(e.condition,t,n)===0){let r=X(e.condition,zf(n,t));if(typeof r==`boolean`)return c(r?e.consequent:e.alternative,t)}let r=c(e.condition,t);return af(`Or`,af(`And`,r,c(e.consequent,t)),af(`And`,Q(`Not`,r),c(e.alternative,t)))}case`Always`:case`Eventually`:return Q(e.kind,c(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n=Gf(e.action,e.subscript),r={kind:`Enabled`,step:e.enabled??n,scope:t},i=Q(`Not`,r),a={kind:`Action`,expression:e.action,unchanged:{kind:`Unchanged`,expression:e.subscript,location:n.location},scope:t,enabled:r};return e.kind===`WeakFairness`?Q(`Always`,Q(`Eventually`,af(`Or`,i,a))):af(`Or`,Q(`Eventually`,Q(`Always`,i)),Q(`Always`,Q(`Eventually`,a)))}default:throw Bf(e)}};return c(e,t)},qf=(e,t,n,r,i)=>{let a=e=>qf(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a={environment:r,scope:e.scope,state:t,next:void 0},o=e.kind===`State`?Qa(X(e.expression,a),`a temporal property predicate`):Na(e.step,a);return i.set(e,o),o}case`Action`:{if(e.enabled&&i.get(e.enabled)===!1)return!1;let a={environment:r,scope:e.scope,state:t,next:n};return e.unchanged&&Qa(X(e.unchanged,a),`a subscript`)?!1:Qa(X(e.expression,a),`an action predicate`)}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return qf(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new u(`TLC cannot evaluate a temporal formula in a single step`)}},Jf=(e,t,n,r,i)=>{let a=e=>e+1<t.length?e+1:n,o=e=>t.map((e,t)=>t).filter(t=>t>=Math.min(e,n)),s=(e,a=r)=>Jf(e,t,n,a,i);switch(e.kind){case`Not`:return!s(e.body);case`And`:return e.operands.every(e=>s(e));case`Or`:return e.operands.some(e=>s(e));case`Next`:return s(e.body,a(r));case`Always`:return o(r).every(t=>s(e.body,t));case`Eventually`:return o(r).some(t=>s(e.body,t));default:return qf(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},Yf=(e,t)=>e.every((e,n)=>ze(e,t[n])),Xf=e=>e.filter((t,n)=>n===0||e[n-1]!==t),Zf=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.successors.push([]),e.offsets.push(-1),e.nodeStates.length-1),Qf=(e,t,n)=>{let r=e.slots.length/3-1,i=Math.imul(Math.imul(t,2654435761)^n,2246822507)>>>e.shift;for(let a=i;;a=a+1&r){let r=a*3,i=e.slots[r];if(i===0||i===t+1&&e.slots[r+1]===n)return r}},$f=(e,t)=>e.offsets[t]!==-1,ep=(e,t,n)=>e.results.bytes[e.offsets[t]+n]===1,tp=2**53-1,np=(e,t,n,r)=>{if(e.length===0)return;let i=t.map(e=>Kf(e.expression,e.scope,n)),a=e.map(e=>Q(`Not`,Kf(e.expression,e.scope,n))),o=a.length===1?a[0]:of(`Or`,a),s=i.length===0?o:of(`And`,[...i,o]),c=Ff(s);if(c.length===0)throw new u(Hf);let l=/* @__PURE__ */ new Map,d=c.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=df(e),n=l.get(t)??l.size;return l.set(t,n),n}),nodeStates:[],nodeTableaux:[],successors:[],offsets:[],results:{bytes:/* @__PURE__ */ new Uint8Array(1024),length:0},initial:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],errorNode:void 0})),f={multiplier:1},p=!Ko(n),m={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},h=e=>{let t=m.states.get(e)??/* @__PURE__ */ new Map;return m.states.set(e,t),t},g=(e,t)=>{n.runtime.setLivenessSource(e);let r=t();return n.runtime.setLivenessSource(void 0),r},_=(e,t)=>qf(e,t,void 0,n,p?h(t):/* @__PURE__ */ new Map),v=(e,t,n)=>g(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!_(e,n))),y=(e,t,r,i)=>g(t,()=>{let t=e.solution.actionChecks;if(!p)return Uint8Array.from(t,e=>+!!qf(e,r,i,n,/* @__PURE__ */ new Map));let a=h(r),o=m.actions.get(r)??/* @__PURE__ */ new Map;m.actions.set(r,o);let s=o.get(i)??new Int8Array(l.size).fill(-1);return o.set(i,s),Uint8Array.from(e.actionIds,(e,o)=>(s[e]===-1&&(s[e]=+!!qf(t[o],r,i,n,a)),s[e]))}),ee=(e,t,n,r)=>g(n,()=>e.nodes[t].statePredicates.every(e=>_(e,r))),b=(e,t)=>{let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},x=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),te=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=Qf(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},ne=(e,t,n)=>{let r=Zf(e,t,n),i=e.nodeIds;if(++i.size*2>i.slots.length/3){let e=i.slots;i.slots=new Int32Array(e.length*2),i.shift--;for(let t=0;t<e.length;t+=3)e[t]!==0&&i.slots.set(e.subarray(t,t+3),Qf(i,e[t]-1,e[t+1]))}return i.slots.set([t+1,n,r],Qf(i,t,n)),r},re=(e,t,n)=>t.nodes.flatMap((t,r)=>te(e,n,r)??[]).sort((e,t)=>e-t),S=(e,t,n,r)=>{let i=e.solution.actionChecks.length,a=e.results,o=a.length;if(a.length+=r.length+n.length*i,a.length>a.bytes.length){let e=new Uint8Array(Math.max(2*a.bytes.length,a.length));e.set(a.bytes),a.bytes=e}a.bytes.set(r,o),n.forEach((e,t)=>a.bytes.set(e,o+r.length+t*i)),e.offsets[t]=o,e.successors[t]=e.successors[t].slice()},ie=(e,t,n)=>{let i={slots:Array.from({length:16*f.multiplier}),count:0},a=(e,t)=>{for(let n=(r.getFingerprint(t.index)&2147483647)%e.length;;n=(n+1)%e.length){let r=e[n];if(r===void 0)return e[n]=t,!0;if(r.index===t.index&&Yf(r.state,t.state))return!1}},o=e=>{if(i.count>=i.slots.length>>1){let e=i.slots;i.slots=Array.from({length:2*e.length+1});for(let t of e)t&&a(i.slots,t)}a(i.slots,e)&&i.count++};return n.forEach(o),o({index:e,state:t}),i.slots.length>16*f.multiplier&&f.multiplier++,i.slots.filter(e=>e!==void 0)},C=(e,t,n,i,a)=>{let o=v(e,i,n),s=t.nodes[e.nodeTableaux[a]],c=[],l=e.successors[a],u=s.successors.length>0?y(e,i,n,n):/* @__PURE__ */ new Uint8Array;for(let r of s.successors){if(!ee(t,r,i,n))continue;if(b(t,r)&&e.errorNode===void 0&&x(e)){e.errorNode=a;return}let o=te(e,i,r);if(o!==void 0&&l.includes(o))continue;let s=o??ne(e,i,r);l.push(s),c.push(u),o===void 0&&C(e,t,n,i,s)}for(let a of r.getSuccessors(n)){let r=y(e,i,n,a.state),o=e.isDone[a.index]===!0;for(let n of s.successors){if(!ee(t,n,i,a.state))continue;let s=te(e,a.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??ne(e,a.index,n);l.push(u),c.push(r),s===void 0&&o&&C(e,t,a.state,a.index,u)}}l.length>0&&S(e,a,c,o)},ae=(e,t,n,r,i,a)=>{let o=t.nodes.map((e,r)=>n.map(e=>ee(t,r,a,e.state)));e.isDone[a]=!0;for(let s of re(e,t,a)){let a=e.successors[s],c=[];n.forEach((n,i)=>{let l=e.isDone[n.index]===!0;for(let u of t.nodes[e.nodeTableaux[s]].successors){if(!o[u][i])continue;let s=te(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??ne(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&C(e,t,n.state,n.index,d)}}),S(e,s,c,i)}if(e.errorNode!==void 0)return Xf(oe(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},w=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)Zf(e,e.nodeStates.length,-1);let a=e.successors[i],o=[];t.forEach((t,r)=>{$f(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),S(e,i,o,r)},oe=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)$f(e,t)&&(r.push(t),n.set(t,-1));for(let i=0;i<r.length;i++){let a=r[i];for(let i of e.successors[a])if(!(i===a&&e.solution.tableau)){if(i===t){let e=[t];for(let t=a;t!==-1;t=n.get(t)??-1)e.push(t);return e}$f(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new u(`Couldn't re-create liveness trace (path) starting at: ${t}`)},T=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=n.stateChecks.length,a=(t,n,a)=>e.results.bytes[e.offsets[t]+i+n*r+a]===1,o=(e,n)=>t.eventuallyAlways.every(t=>a(e,n,t)),s=new Float64Array(e.nodeStates.length).fill(-1),c=e.initial.filter(t=>$f(e,t)),l=[],d=t=>{let n=e.successors[t].indexOf(t);return n!==-1&&o(t,n)},f=(t,r)=>n.tableau!==void 0&&Mf(n.tableau.nodes[e.nodeTableaux[t]].particle,r),p=r=>{let i=l.pop()??r;if(i===r&&!d(i)){s[i]=tp;return}let c=/* @__PURE__ */ new Set,u=/* @__PURE__ */ new Map;for(let t=i;;t=l.pop()??r){c.add(t);let n=u.get(e.nodeStates[t]);if(n?n.push(t):u.set(e.nodeStates[t],[t]),s[t]=tp,t===r)break}let p=t.infinitelyOftenStates.every(t=>[...c].some(n=>ep(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...c].some(n=>e.successors[n].some((e,r)=>c.has(e)&&o(n,r)&&a(n,r,t)))),g=n.promises.every(e=>[...c].some(t=>f(t,e)));if(p&&h&&g)return m(r,c,u)},m=(r,i,s)=>{let c=Xf(oe(e,r).reverse().map(t=>e.nodeStates[t])),l=[],d=/* @__PURE__ */ new Set([r]),p=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),g=n.promises.map(()=>!1),_={count:p.length+m.length+g.length},v={node:r},y=e=>i.has(e),ee=e=>{l.push(v.node),v.node=e};for(;_.count>0;){let r=_.count;for(;t.infinitelyOftenStates.forEach((t,n)=>{!p[n]&&ep(e,v.node,t)&&(p[n]=!0,_.count--)}),n.promises.forEach((e,t)=>{!g[t]&&f(v.node,e)&&(g[t]=!0,_.count--)}),!(_.count<=0);){let n={last:-1,unvisited:-1},i=_.count;if(e.successors[v.node].some((r,c)=>{if(s.has(e.nodeStates[r])){if(!y(r)||!o(v.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&a(v.node,c,e)&&(m[t]=!0,_.count--)})}return _.count<i?(ee(r),d.clear(),!0):(y(r)&&!d.has(r)&&(n.unvisited=r),!1)}))break;if(_.count<r){ee(n.last),d.clear();break}for(;n.unvisited===-1;){let t=l.pop();if(t===void 0)throw new u(`TLC failed to build the counterexample of a liveness property`);v.node=t,n.unvisited=e.successors[t].find(e=>y(e)&&!d.has(e))??-1}ee(n.unvisited),d.add(n.unvisited)}}let b=h(r,v.node,s,o);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];b[b.length-1]!==n&&b.push(n)}let x=c[c.length-1];return b[b.length-1]===x&&b.pop(),{prefix:c.slice(0,-1),cycle:[x,...b.reverse()]}},h=(t,n,r,i)=>{if(n===t)return[];let a=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([a]),c=[];for(let n=a,l=-1,d=0;;d++){for(let u of r.get(n)??[])for(let[d,f]of e.successors[u].entries()){if(f===u||!i(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==a;)e.push(t),t=r,r=o.get(t)??-1;return e.push(a),e}let p=e.nodeStates[f];r.has(p)&&!s.has(p)&&(s.add(p),c.push([p,n]))}o.set(n,l);let f=c[d];if(f===void 0)throw new u(`TLC failed to build the counterexample of a liveness property`);n=f[0],l=f[1]}};for(let t=0;t<c.length;t++){let n=[c[t],-1,0],r={link:0};for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),a=n.pop()??0;if(i===-42){if(s[a]===t){let e=p(a);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(s[a]!==-1){n.push(Math.min(t,s[a]));continue}s[a]=r.link,n.push(t,a,-42),l.push(a);let u={value:r.link++};e.successors[a].forEach((t,r)=>{$f(e,t)&&(o(a,r)?s[t]===-1?n.push(t,-1):u.value=Math.min(u.value,s[t]):s[t]===-1&&c.push(t))}),n.push(u.value)}}};return{addInitialState:(e,t)=>{m.states.clear(),m.actions.clear();for(let n of d){let r=n.solution.tableau;if(!r)n.initial.push(e);else for(let i=0;i<r.initialCount;i++)ee(r,i,void 0,t)&&n.initial.push(te(n,e,i)??ne(n,e,i))}},addState:(e,t,n)=>{m.states.clear(),m.actions.clear();let r=ie(e,t,n);for(let n of d){let i=r.map(r=>y(n,e,t,r.state)),a=v(n,e,t),o=n.solution.tableau,s=o?ae(n,o,r,i,a,e):w(n,r,i,a,e);if(s)return s}},findViolation:()=>{for(let e of d)for(let t of e.solution.models){let n=T(e,t);if(n)return n}},getViolatedProperties:(t,r)=>[...new Set(e.filter((e,i)=>!Jf(a[i].body,t,r,0,n)).map(e=>e.name))]}},rp=`UnnamedAction`,ip={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},ap=e=>{let t=e.range??ip;return Ot([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},op=e=>{let t=[[`name`,e.name],[`location`,ap(e.location)]];return e.parameters.length===0?Ot(t):Ot([...t,[`context`,Ot(e.parameters)],[`parameters`,R(e.parameters.map(e=>e[0]))]])},sp=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),cp=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),lp=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,up=e=>e.kind===`Apply`?e.args:[],dp=(e,t,n)=>{let r=lp(e);if(r===void 0)return;if(W(e)){let e=Ja(t,r);return e?.kind===`Operator`&&e.operator.kind===`Closure`?e.operator:void 0}if(n.constants.has(r)||n.variableIndex.has(r))return;let i=vo(r,n);return i?.kind===`Closure`?i:void 0},fp=(e,t)=>{try{return X(e,cp(t,void 0)),!0}catch(e){if(e instanceof s)return!1;throw e}},pp=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&to(e,t)&&fp(e.body,t),mp=(e,t)=>{let n=$a(e.name,t);return n?.body===e.body&&pp(n,t)},hp=(e,t)=>{if(e.kind!==`Identifier`||!W(e))return;let n=Ja(t,e.name);return n?.kind===`Thunk`?n:void 0},gp=(e,t)=>(e?.params??[]).flatMap(e=>{let n=Ja(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),_p=(e,t)=>{try{return e()}catch(e){if(e instanceof s)return t();throw e}},vp=(e,t,n,r,i)=>{let a=up(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return!r||a.length===0?[{...e,parameters:[],expression:t,scope:n}]:a.some(e=>$(e,n,i)!==0)?o():_p(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),X(e,cp(i,n))]),expression:t,scope:n}],o)},yp=(e,t,n,r,i)=>{let a=()=>({name:n?.name??rp,location:e.location,parameters:gp(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return yp(e.body,Po(e.definitions,cp(r,t)),n,r,i);case`Label`:return yp(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>yp(e,t,n,r,i));case`Exists`:return _p(()=>{let o=[];return io(e.bounds,cp(r,t),t=>(o.push(...yp(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=W(e)?void 0:i.get(lp(e)??``),s=dp(e,t,r);if(o)return vp(o,e,t,s,r);if(!s)return[a()];let c=up(e),l=()=>[{name:s.name,location:e.location,parameters:[],expression:e,scope:t}];return mp(s,r)||c.some(e=>$(e,t,r)!==0)?l():_p(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:X(n,cp(r,t))},parent:e}),s.scope);return yp(s.body,e,s,r,i)},l)},bp=(e,t,n,r,i)=>{let a=(e,t)=>bp(e,t,n,r,i);if(e.kind===`Let`){a(e.body,Po(e.definitions,cp(n,t)));return}let o=hp(e,t);if(o){a(o.expression,o.scope);return}let s=dp(e,t,n);if(s&&mp(s,n))return;if(s&&s.params.length===0){if($(s.body,s.scope,n)===1){r.inits.push(sp(s.name,s.body));return}a(s.body,s.scope);return}if(s&&e.kind===`Apply`&&s.params.length===e.args.length){a(s.body,Mo(s,e.args,cp(n,t)));return}if(e.kind===`And`){e.operands.forEach(e=>a(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t});return}r.temporals.push(sp(rp,e));return}let c=$(e,t,n);c<=1?r.inits.push(sp(rp,e)):c===3&&r.temporals.push(sp(rp,e))},xp=(e,t,n,r,i)=>{let a=(t,n)=>xp(e,t,n,r,i);if(t.kind===`Let`){a(t.body,Po(t.definitions,cp(r,n)));return}let o=hp(t,n);if(o){a(o.expression,o.scope);return}let s=dp(t,n,r);if(s&&mp(s,r))return;if(s&&s.params.length===up(t).length){a(s.body,t.kind===`Apply`?Mo(s,t.args,cp(r,n)):s.scope);return}if(t.kind===`Forall`&&_p(()=>(io(t.bounds,cp(r,n),e=>(a(t.body,e),!1)),!0),()=>!1))return;if(t.kind===`And`){t.operands.forEach(e=>a(e,n));return}if(t.kind===`Always`){let a=t.expression;a.kind===`BoxAction`?i.impliedActions.push(sp(e,a)):$(a,n,r)<2?i.invariants.push(sp(e,a)):i.impliedTemporals.push(sp(e,t));return}let c=$(t,n,r);c<=1?i.impliedInits.push(sp(e,t)):c===3&&i.impliedTemporals.push(sp(e,t))},Sp=(e,t)=>{let n=$a(e,t);return n?.kind===`Operator`&&!pp(n,t)?n:void 0},Cp=e=>Ot([[`name`,e.name],[`location`,ap(e.location)]]),wp=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:Sp(e.specification,t);a&&(bp(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...yp(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:vo(e.init,t);o?.kind===`Closure`&&r.inits.push(sp(e.init??``,o.body));let s=e.next===void 0?void 0:vo(e.next,t);return s?.kind===`Closure`&&r.actions.push(...yp(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=Sp(e,t);n&&r.invariants.push(sp(e,n.body))}),e.properties.forEach(e=>{let n=Sp(e,t);n&&xp(e,n.body,void 0,t,r)}),r},Tp=(e,t,n)=>wp(e,t,n).actions,Ep=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>U(e[1])).join(`,`)})`,Dp=e=>`${e.name===rp?`Action`:e.name}${Ep(e)} ${za(e.location.range??ip)}`,Op=e=>`${e.name}${Ep(e)}`,kp=(e,t,n,r)=>{let i=wp(e,t,r),a=e=>ft(e.map(op)),o=e=>ft(e.flatMap(e=>{let n=Sp(e,t);return n?[Cp(n)]:[]}));return Ot([[`inits`,a(i.inits)],[`actions`,a(i.actions)],[`temporals`,a(i.temporals)],[`invariants`,a(i.invariants)],[`impliedinits`,a(i.impliedInits)],[`impliedactions`,a(i.impliedActions)],[`impliedtemporals`,a(i.impliedTemporals)],[`variables`,ft(t.variables.map((e,t)=>Ot([[`name`,e],[`location`,ap(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},Ap=`paired12`,jp=(e,t=16)=>e<=t*.75?t:jp(e,t*2),Mp=(e,t)=>{let n=jp(e.length)-1,r=e=>{let r=t(e);return(r^r>>>16)&n};return e.map((e,t)=>({key:e,position:t,bucket:r(e)})).sort((e,t)=>e.bucket-t.bucket||e.position-t.position).map(e=>e.key)},Np=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),Pp=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),Fp=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),Ip=e=>Fp(e).replaceAll(`
|
|
411
|
+
`,`\\n`),Lp=(e,t)=>{let n=[],r=e=>n.push(`State ${n.length+1}:\n${e.getText()}\n`);return{writeInitialState:r,writeSuccessor:(e,t,n)=>{n||r(t)},close:()=>t?.(e.path,n.join(``))}},Rp=(e,t)=>{let n=[`strict digraph DiskGraph {
|
|
412
412
|
`,`node [shape=box,style=rounded]
|
|
413
|
-
`,e.colorize?`edge [colorscheme="${
|
|
413
|
+
`,e.colorize?`edge [colorscheme="${Ap}"]\n`:``,`nodesep=0.35;
|
|
414
414
|
`,`subgraph cluster_graph {
|
|
415
415
|
`,`color="white";
|
|
416
416
|
`],r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=r.get(e.level)??/* @__PURE__ */ new Set;r.set(e.level,t.add(e.fingerprint))},o=e=>{if(!e)return 1;let t=i.get(e.name)??i.size+2;return i.set(e.name,t),t},s=()=>[`subgraph cluster_legend {graph[style=bold];label = "Next State Actions" style="solid"
|
|
417
|
-
`,`node [ labeljust="l",colorscheme="${
|
|
418
|
-
`,e.colorize&&i.size>1?s():``,`}`].join(``),l=()=>{e.snapshot&&t?.(e.path.replaceAll(`.dot`,`_snapshot.dot`),n.join(``)+c())};return{writeInitialState:e=>{n.push(`${e.fingerprint} [label="${Fp(e.getLabel())}",style = filled]\n`),a(e),l()},writeSuccessor:(t,r,i,s)=>{let c=e.colorize?String(o(s)):`black`,u=e.actionLabels&&s?Pp(s.signature):``;n.push(`${t.fingerprint} -> ${r.fingerprint} [label="${u}",color="${c}",fontcolor="${c}"];\n`),i||n.push(`${r.fingerprint} [label="${Fp(r.getLabel())}",tooltip="${Fp(r.getText())}"];\n`),a(t),l()},close:()=>t?.(e.path,n.join(``)+c())}},Rp=(e,t)=>e.dot?Lp(e,t):Ip(e,t),zp=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),Bp=(e,t)=>{let n=/* @__PURE__ */ new Map;return(/* @__PURE__ */ new Set([...e.keys(),...t.keys()])).forEach(r=>{let i=e.get(r),a=i?t.get(i.name)??i:t.get(r);a&&a.name!==r&&n.set(r,a)}),n},Vp=(e,t)=>{if(!M(e))throw new l(`The symmetry values of ${t} must be functions`);let n=H(e),r=/* @__PURE__ */ new Map;return n.domain.forEach((e,t)=>{let i=n.range[t];if(!N(e)||!N(i))throw new l(`Symmetry function must have model values as domain and range`);e.name!==i.name&&r.set(e.name,i)}),r},Hp=(e,t)=>{let n=t.definitions.get(e);if(n?.kind!==`Operator`||n.params.length>0)throw new l(`The symmetry function ${e} must specify a set of permutations`);let r=X(n.body,{environment:t,scope:void 0,state:void 0,next:void 0});if(!j(r)||!z(r))throw new l(`The symmetry operator must specify a set of functions`);let i=B(r).elements.map(t=>Vp(t,e));if(n.body.kind===`Apply`&&n.body.args.length>=i.length)return[];let a=/* @__PURE__ */ new Map;i.forEach(e=>{e.size>0&&a.set(zp(e),e)});let o=[...a.values()],s={start:0};for(;s.start<a.size;){let e=[...a.values()],t=e.length;o.forEach(n=>e.slice(s.start,t).forEach(e=>{let t=Bp(n,e),r=zp(t);t.size>0&&!a.has(r)&&a.set(r,t)})),s.start=t}let c=Math.max(256,Math.floor(4194304/a.size));return[...a.values()].map(e=>({images:e,cache:/* @__PURE__ */ new WeakMap,cacheSize:0,cacheLimit:c}))},Up=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=Kp(r,t);if(i===r)continue;let a=e.slice(0,n);a.push(i);for(let r=n+1;r<e.length;r++)a.push(Kp(e[r],t));return a}},Wp=(e,t)=>{let n=[],r=[];for(let i of e){let e=Kp(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(L);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(L(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},Gp=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,Kp=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=Gp(e);if(n===0||n>64)return qp(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=qp(e,t),a=i!==e&&ze(i,e)?e:i;return t.cacheSize>=t.cacheLimit&&(t.cache=/* @__PURE__ */ new WeakMap,t.cacheSize=0),t.cache.set(e,a),t.cacheSize++,a},qp=(e,t)=>{let n=e.kind;if(n===`Set`){let n=Wp(e.elements,t);return n?Fe(n):e}if(n===`Function`||n===`LazyFunction`&&z(e.domain)){let n=H(e),r=Up(n.domain,t),i=Up(n.range,t)??n.range;if(r){let e=vt(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Ie(n.domain,e.range):e}return i===n.range?n:Ie(n.domain,i)}if(n===`Interval`||!j(e)||!z(e))return e;let r=B(e),i=Up(r.elements,t);return i?ft(i):r},Jp=(e,t,n)=>{for(let r=t.length;r<e.length;r++)t.push(Kp(e[r],n));return t},Yp=(e,t,n,r)=>{let i=[];for(let a=0;a<e.length;a++){let o=r?r[a]:a,s=Kp(e[o],n),c=L(s,t[o]);if(c>0)return;if(r||i.push(s),c<0)return r?e.map(e=>Kp(e,n)):Jp(e,i,n)}},Xp=(e,t,n)=>t.reduce((t,r)=>Yp(e,t,r,n)??t,e),Zp=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],Qp=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),$p=new Map(_u.flatMap(e=>e.map(t=>[t,e[0]]))),em=e=>$p.get(e)??e,tm=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},nm=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(tm(e.name)&2147483647)%t,i=()=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let i=e.buckets.length-1;i>=0;i--)for(let a of e.buckets[i])n[r(a,t)].unshift(a);e.buckets=n,e.threshold=Math.floor(t*.75)};return{put:a=>{t.has(a.key)||(n.length>=e.threshold&&i(),e.buckets[r(a,e.buckets.length)].unshift(a),t.add(a.key),n.push(a))},inserted:n,enumerate:()=>e.buckets.toReversed().flat()}},rm=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),im=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:em(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:em(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=e.findIndex((e,n)=>n>t&&e.text===`)`);return{name:n.text,end:i+1}},am=(e,t)=>{let n=[];for(let r=t;;){let t=im(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},om=e=>({line:e.line,column:e.column}),sm=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(a.text===`EXTENDS`){let n=am(e,t+1);s.extends.push(...n),n.forEach(e=>r.add(e))}else a.text===`INSTANCE`&&e[t+1]?.kind===`Identifier`&&s.instances.push(e[t+1].text)}return{references:s,end:e.length}};return i(0,t??``).references},cm=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,lm={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},um=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&cm(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&cm(e[n+1],e[n+2])?n+=cm(e[n+2],e[n+3])?3:2:(r.text!==`MODULE`||e[n-1]?.kind!==`Separator`)&&t.push(r.kind===`String`?`"${r.text.replace(/[\\"\n\t\r\f]/g,e=>lm[e])}"`:r.text)}return t},dm=e=>{let t=/* @__PURE__ */ new Map,n=[];return e.forEach((r,i)=>{r.kind===`Separator`&&e[i+1]?.text===`MODULE`&&n.push({name:e[i+2].text,start:i});let a=r.kind===`ModuleEnd`?n.pop():void 0;a&&!t.has(a.name)&&t.set(a.name,{start:a.start,end:i+1})}),t},fm=(e,t)=>e.find(e=>e.name===t)??e.map(e=>fm(e.modules,t)).find(Boolean),pm=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=i=>{let a=n.get(i??``);if(a)return a;let o=i===void 0?e:xu.get(i)??t?.(i)??pc(e,i),s=o===void 0?[]:oe(o),c=dm(s),l=c.get(s[2]?.text??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=hc(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>fm(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},mm=(e,t)=>{let n=pm(e,t),r=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],o=(e,n)=>{let i=am(t,e+1);r.push({location:om(t[e]),apply:e=>i.forEach(t=>e.put(rm(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,a)=>{let l=e.start+a,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;r.push({location:om(u),apply:t=>t.put(rm(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&o(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&o(l,`variable`),u.text===`RECURSIVE`&&am(t,l+1).every(e=>s.has(e))&&o(l,`definition`),Qp.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(om(u)),r.push({location:om(u),apply:e=>e.put(rm(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{i.push(e.location);let t=e.name;t!==void 0&&r.push({location:e.location,apply:e=>e.put(rm(t,`theorem`,!1))})});let l=e=>i.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=em(e.name);r.push({location:e.location,apply:n=>n.put(rm(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=a(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...i,...o].forEach(n=>{n.isLocal||t.put(rm(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(rm(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>Ar(e.location,t.location)?-1:+!!Ar(t.location,e.location))},i=/* @__PURE__ */ new Map,a=e=>{let t=i.get(e??``);if(t)return t;let o=nm();i.set(e??``,o),gu.toReversed().forEach(e=>o.put(rm(e,`builtin`,!1)));let s=n(e);return s.getModule().extends.forEach(e=>a(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),r(s).forEach(e=>e.apply(o)),o};return a(void 0).enumerate().filter(e=>e.kind===`variable`).map(e=>e.name).reverse()},hm=(e,t,n)=>{let r=pm(e,n),i=/* @__PURE__ */ new Set,a=e=>{i.add(e)},o=e=>{e.kind===`ModelValue`&&a(e.name),e.kind===`String`&&a(e.value),e.kind===`Set`&&e.elements.forEach(o)};t.constants.forEach(e=>{e.args?.forEach(o),o(e.value)}),vu.forEach(a);let s=e=>{let t=r(e);return t.tokens.slice(t.start,t.end)},c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=e=>{let t=l.get(e);if(t)return t;let n=sm(s(e),e,c);return l.set(e,n),n},d=e=>c.get(e)??u(e),f=/* @__PURE__ */ new Set,p=(e,t)=>c.has(t)||f.has(`${e.key}>${t}`),m=(e,t,n)=>{let r=[...e.extends.map(d),...e.instances.filter(t=>p(e,t)).map(d),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},h=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!p(n,e));return i===void 0?m(n,r,t):[n,i]};return t},g=h(e=>e.extends),_=h(e=>e.instances),v=/* @__PURE__ */ new Set([void 0]),y=/* @__PURE__ */ new Map;um(s(void 0)).forEach((e,t)=>{t===3&&bu.forEach(a),a(e)});let ee=u(void 0);for(;;){let e=g(ee,/* @__PURE__ */ new Set)??_(ee,/* @__PURE__ */ new Set);if(!e)break;let[t,n]=e;f.add(`${t.key}>${n}`),y.set(t.unit,[...y.get(t.unit)??[],n]),!v.has(n)&&(v.add(n),um(s(n)).forEach(a))}Zp.forEach(a);let b=/* @__PURE__ */ new Set,x=e=>{if(b.has(e))return;b.add(e);let t=y.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(x),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return x(void 0),yu.forEach(a),[...i]},gm=(e,t)=>e*((t-e)/2**64),_m=e=>e.includes(`.`)?e:`${e}.0`,vm=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return _m(String(e));let[n,r]=e.toExponential().split(`e`);return`${_m(n)}E${r.replace(`+`,``)}`},ym=e=>e!==void 0&&e>=`0`&&e<=`9`,bm=e=>{if(e===0)return`0.0`;let t=vm(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;ym(t[n.next]);)n.result+=t[n.next++],n.digits++;if(n.next===t.length)return n.result;if(t[n.next]!==`.`)return t;if(n.next++,n.digits>=2)for(;ym(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;ym(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(ym(t[n.next])&&Number(t[n.next])>=5&&(n.result=xm(n.result));ym(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},xm=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${xm(r)}.`:n===`9`?`${xm(r)}0`:`${r}${Number(n)+1}`},Sm=e=>{let t={value:0};for(;10n**BigInt(t.value+1)<e*10n;)t.value++;let n=10n**BigInt(t.value+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t.value+1}`)},Cm=(e,t,n)=>{if(gm(e,t)<1e-10)return;let r=n().sort(),i=new Int32Array(r.buffer),a={narrow:1/0,wide:9223372036854775807n};for(let e=1;e<r.length;e++){let t=i[2*e+1],n=i[2*e-1];if(t<0!=n<0)continue;let o=t-n;if(o<=1048576){let t=o*4294967296+(i[2*e]>>>0)-(i[2*e-2]>>>0);a.narrow=Math.min(a.narrow,t)}else{let t=r[e]-r[e-1];t<a.wide&&(a.wide=t)}}if(a.narrow===1/0)return a.wide;let o=BigInt(a.narrow);return o<a.wide?o:a.wide},wm=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a={count:0},o=n.find(t=>(a.count+=e[t],a.count>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},Tm={line:0,column:0},Em=`Failed to recover the initial state from its fingerprint.`,Dm=`Failed to recover the next state from its fingerprint.`,Om=e=>({kind:`Identifier`,name:e,location:Tm}),km=/* @__PURE__ */ new Set([`name`,`property`]),Am=(e,t,n)=>{let r=$a(t,n);if(!r)throw new l(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new l(km.has(e)?`TLC requires ${t} not to take any argument.`:`TLC requires ${e} not to take any argument, but one was given: ${t}`);return r},jm=(e,t,n)=>{let r=Am(e,t,n);if(to(r,n))throw new l(`The ${e} ${t} cannot be a constant.`);return r},Mm=(e,t,n)=>{if(to(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return X(Om(e),Zm(n,void 0,void 0))}catch(e){if(e instanceof u)return;throw e}},Nm=(e,t,n)=>{let r=Am(e,t,n),i=Mm(t,r,n);if(i!==void 0&&i!==!0)throw new l(`The ${e} of ${t} is equal to ${U(i)}`);return i===void 0?r:void 0},Pm=(e,t)=>{let n=Rd({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>$a(e,t)});return e.flatMap(e=>{let r=Nm(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2)throw new l(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${i.params.size===0?``:`
|
|
417
|
+
`,`node [ labeljust="l",colorscheme="${Ap}",style=filled,shape=record ]\n`,...Mp([...i.keys()],Pp).map(e=>`${e.replaceAll(`!`,`:`)} [label="${e}",fillcolor=${i.get(e)}]\n`),`}`].join(``),c=()=>[...Mp([...r],e=>e[0]).map(e=>`{rank = same; ${Mp([...e[1]],Np).map(e=>`${e};`).join(``)}}\n`),`}
|
|
418
|
+
`,e.colorize&&i.size>1?s():``,`}`].join(``),l=()=>{e.snapshot&&t?.(e.path.replaceAll(`.dot`,`_snapshot.dot`),n.join(``)+c())};return{writeInitialState:e=>{n.push(`${e.fingerprint} [label="${Ip(e.getLabel())}",style = filled]\n`),a(e),l()},writeSuccessor:(t,r,i,s)=>{let c=e.colorize?String(o(s)):`black`,u=e.actionLabels&&s?Fp(s.signature):``;n.push(`${t.fingerprint} -> ${r.fingerprint} [label="${u}",color="${c}",fontcolor="${c}"];\n`),i||n.push(`${r.fingerprint} [label="${Ip(r.getLabel())}",tooltip="${Ip(r.getText())}"];\n`),a(t),l()},close:()=>t?.(e.path,n.join(``)+c())}},zp=(e,t)=>e.dot?Rp(e,t):Lp(e,t),Bp=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),Vp=(e,t)=>{let n=/* @__PURE__ */ new Map;return(/* @__PURE__ */ new Set([...e.keys(),...t.keys()])).forEach(r=>{let i=e.get(r),a=i?t.get(i.name)??i:t.get(r);a&&a.name!==r&&n.set(r,a)}),n},Hp=(e,t)=>{if(!M(e))throw new l(`The symmetry values of ${t} must be functions`);let n=H(e),r=/* @__PURE__ */ new Map;return n.domain.forEach((e,t)=>{let i=n.range[t];if(!N(e)||!N(i))throw new l(`Symmetry function must have model values as domain and range`);e.name!==i.name&&r.set(e.name,i)}),r},Up=(e,t)=>{let n=t.definitions.get(e);if(n?.kind!==`Operator`||n.params.length>0)throw new l(`The symmetry function ${e} must specify a set of permutations`);let r=X(n.body,{environment:t,scope:void 0,state:void 0,next:void 0});if(!j(r)||!z(r))throw new l(`The symmetry operator must specify a set of functions`);let i=B(r).elements.map(t=>Hp(t,e));if(n.body.kind===`Apply`&&n.body.args.length>=i.length)return[];let a=/* @__PURE__ */ new Map;i.forEach(e=>{e.size>0&&a.set(Bp(e),e)});let o=[...a.values()],s={start:0};for(;s.start<a.size;){let e=[...a.values()],t=e.length;o.forEach(n=>e.slice(s.start,t).forEach(e=>{let t=Vp(n,e),r=Bp(t);t.size>0&&!a.has(r)&&a.set(r,t)})),s.start=t}let c=Math.max(256,Math.floor(4194304/a.size));return[...a.values()].map(e=>({images:e,cache:/* @__PURE__ */ new WeakMap,cacheSize:0,cacheLimit:c}))},Wp=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=qp(r,t);if(i===r)continue;let a=e.slice(0,n);a.push(i);for(let r=n+1;r<e.length;r++)a.push(qp(e[r],t));return a}},Gp=(e,t)=>{let n=[],r=[];for(let i of e){let e=qp(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(L);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(L(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},Kp=e=>e.kind===`Set`?e.elements.length:e.kind===`Function`?e.domain.length:0,qp=(e,t)=>{if(typeof e!=`object`)return e;if(e.kind===`ModelValue`)return t.images.get(e.name)??e;let n=Kp(e);if(n===0||n>64)return Jp(e,t);let r=t.cache.get(e);if(r!==void 0)return r;let i=Jp(e,t),a=i!==e&&ze(i,e)?e:i;return t.cacheSize>=t.cacheLimit&&(t.cache=/* @__PURE__ */ new WeakMap,t.cacheSize=0),t.cache.set(e,a),t.cacheSize++,a},Jp=(e,t)=>{let n=e.kind;if(n===`Set`){let n=Gp(e.elements,t);return n?Fe(n):e}if(n===`Function`||n===`LazyFunction`&&z(e.domain)){let n=H(e),r=Wp(n.domain,t),i=Wp(n.range,t)??n.range;if(r){let e=vt(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Ie(n.domain,e.range):e}return i===n.range?n:Ie(n.domain,i)}if(n===`Interval`||!j(e)||!z(e))return e;let r=B(e),i=Wp(r.elements,t);return i?ft(i):r},Yp=(e,t,n)=>{for(let r=t.length;r<e.length;r++)t.push(qp(e[r],n));return t},Xp=(e,t,n,r)=>{let i=[];for(let a=0;a<e.length;a++){let o=r?r[a]:a,s=qp(e[o],n),c=L(s,t[o]);if(c>0)return;if(r||i.push(s),c<0)return r?e.map(e=>qp(e,n)):Yp(e,i,n)}},Zp=(e,t,n)=>t.reduce((t,r)=>Xp(e,t,r,n)??t,e),Qp=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],$p=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),em=new Map(_u.flatMap(e=>e.map(t=>[t,e[0]]))),tm=e=>em.get(e)??e,nm=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},rm=()=>{let e={buckets:Array.from({length:11},()=>[]),threshold:8},t=/* @__PURE__ */ new Set,n=[],r=(e,t)=>(nm(e.name)&2147483647)%t,i=()=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let i=e.buckets.length-1;i>=0;i--)for(let a of e.buckets[i])n[r(a,t)].unshift(a);e.buckets=n,e.threshold=Math.floor(t*.75)};return{put:a=>{t.has(a.key)||(n.length>=e.threshold&&i(),e.buckets[r(a,e.buckets.length)].unshift(a),t.add(a.key),n.push(a))},inserted:n,enumerate:()=>e.buckets.toReversed().flat()}},im=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,kind:t,isLocal:n}),am=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:tm(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:tm(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=e.findIndex((e,n)=>n>t&&e.text===`)`);return{name:n.text,end:i+1}},om=(e,t)=>{let n=[];for(let r=t;;){let t=am(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},sm=e=>({line:e.line,column:e.column}),cm=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(a.text===`EXTENDS`){let n=om(e,t+1);s.extends.push(...n),n.forEach(e=>r.add(e))}else a.text===`INSTANCE`&&e[t+1]?.kind===`Identifier`&&s.instances.push(e[t+1].text)}return{references:s,end:e.length}};return i(0,t??``).references},lm=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,um={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},dm=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&lm(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&lm(e[n+1],e[n+2])?n+=lm(e[n+2],e[n+3])?3:2:(r.text!==`MODULE`||e[n-1]?.kind!==`Separator`)&&t.push(r.kind===`String`?`"${r.text.replace(/[\\"\n\t\r\f]/g,e=>um[e])}"`:r.text)}return t},fm=e=>{let t=/* @__PURE__ */ new Map,n=[];return e.forEach((r,i)=>{r.kind===`Separator`&&e[i+1]?.text===`MODULE`&&n.push({name:e[i+2].text,start:i});let a=r.kind===`ModuleEnd`?n.pop():void 0;a&&!t.has(a.name)&&t.set(a.name,{start:a.start,end:i+1})}),t},pm=(e,t)=>e.find(e=>e.name===t)??e.map(e=>pm(e.modules,t)).find(Boolean),mm=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=i=>{let a=n.get(i??``);if(a)return a;let o=i===void 0?e:xu.get(i)??t?.(i)??pc(e,i),s=o===void 0?[]:oe(o),c=fm(s),l=c.get(s[2]?.text??``)??{start:0,end:0},u={module:void 0},d={tokens:s,...l,getModule:()=>u.module??=hc(o??``)};return n.set(i??``,d),c.forEach((e,t)=>{e.start===l.start||r.has(t)||r.set(t,{tokens:s,...e,getModule:()=>pm(d.getModule().modules,t)??d.getModule()})}),d};return i(void 0),e=>(e===void 0?void 0:r.get(e))??i(e)},hm=(e,t)=>{let n=mm(e,t),r=e=>{let t=e.tokens,n=e.getModule(),r=[],i=[],o=(e,n)=>{let i=om(t,e+1);r.push({location:sm(t[e]),apply:e=>i.forEach(t=>e.put(im(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c={value:0};t.slice(e.start,e.end).forEach((n,a)=>{let l=e.start+a,u=t[l];if(u.kind===`Separator`&&t[l+1]?.text===`MODULE`){if(c.value++,c.value===2){let e=t[l+2].text;r.push({location:sm(u),apply:t=>t.put(im(e,`module`,!1))})}}else u.kind===`ModuleEnd`&&c.value--,c.value===1&&u.kind===`Keyword`&&((u.text===`CONSTANT`||u.text===`CONSTANTS`)&&o(l,`constant`),(u.text===`VARIABLE`||u.text===`VARIABLES`)&&o(l,`variable`),u.text===`RECURSIVE`&&om(t,l+1).every(e=>s.has(e))&&o(l,`definition`),$p.has(u.text)&&t[l+1]?.kind===`Identifier`&&t[l+2]?.text===`==`&&(i.push(sm(u)),r.push({location:sm(u),apply:e=>e.put(im(t[l+1].text,`theorem`,!1))})))}),n.assumptions.forEach(e=>{i.push(e.location);let t=e.name;t!==void 0&&r.push({location:e.location,apply:e=>e.put(im(t,`theorem`,!1))})});let l=e=>i.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(l(e.location))return;let t=tm(e.name);r.push({location:e.location,apply:n=>n.put(im(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{r.push({location:e.location,apply:t=>{let n=a(e.module).enumerate(),r=e.name===void 0?``:`${e.name}!`,i=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...i,...o].forEach(n=>{n.isLocal||t.put(im(`${r}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(im(e.name,`definition`,e.isLocal))}})}),r.sort((e,t)=>Ar(e.location,t.location)?-1:+!!Ar(t.location,e.location))},i=/* @__PURE__ */ new Map,a=e=>{let t=i.get(e??``);if(t)return t;let o=rm();i.set(e??``,o),gu.toReversed().forEach(e=>o.put(im(e,`builtin`,!1)));let s=n(e);return s.getModule().extends.forEach(e=>a(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),r(s).forEach(e=>e.apply(o)),o};return a(void 0).enumerate().filter(e=>e.kind===`variable`).map(e=>e.name).reverse()},gm=(e,t,n)=>{let r=mm(e,n),i=/* @__PURE__ */ new Set,a=e=>{i.add(e)},o=e=>{e.kind===`ModelValue`&&a(e.name),e.kind===`String`&&a(e.value),e.kind===`Set`&&e.elements.forEach(o)};t.constants.forEach(e=>{e.args?.forEach(o),o(e.value)}),vu.forEach(a);let s=e=>{let t=r(e);return t.tokens.slice(t.start,t.end)},c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Map,u=e=>{let t=l.get(e);if(t)return t;let n=cm(s(e),e,c);return l.set(e,n),n},d=e=>c.get(e)??u(e),f=/* @__PURE__ */ new Set,p=(e,t)=>c.has(t)||f.has(`${e.key}>${t}`),m=(e,t,n)=>{let r=[...e.extends.map(d),...e.instances.filter(t=>p(e,t)).map(d),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},h=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!p(n,e));return i===void 0?m(n,r,t):[n,i]};return t},g=h(e=>e.extends),_=h(e=>e.instances),v=/* @__PURE__ */ new Set([void 0]),y=/* @__PURE__ */ new Map;dm(s(void 0)).forEach((e,t)=>{t===3&&bu.forEach(a),a(e)});let ee=u(void 0);for(;;){let e=g(ee,/* @__PURE__ */ new Set)??_(ee,/* @__PURE__ */ new Set);if(!e)break;let[t,n]=e;f.add(`${t.key}>${n}`),y.set(t.unit,[...y.get(t.unit)??[],n]),!v.has(n)&&(v.add(n),dm(s(n)).forEach(a))}Qp.forEach(a);let b=/* @__PURE__ */ new Set,x=e=>{if(b.has(e))return;b.add(e);let t=y.get(e)??[],n=u(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(x),s(e).forEach(e=>{e.kind===`String`&&a(e.text)})};return x(void 0),yu.forEach(a),[...i]},_m=(e,t)=>e*((t-e)/2**64),vm=e=>e.includes(`.`)?e:`${e}.0`,ym=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return vm(String(e));let[n,r]=e.toExponential().split(`e`);return`${vm(n)}E${r.replace(`+`,``)}`},bm=e=>e!==void 0&&e>=`0`&&e<=`9`,xm=e=>{if(e===0)return`0.0`;let t=ym(e),n={next:0,digits:0,result:``};for(;t[n.next]===`0`;)n.next++;for(;bm(t[n.next]);)n.result+=t[n.next++],n.digits++;if(n.next===t.length)return n.result;if(t[n.next]!==`.`)return t;if(n.next++,n.digits>=2)for(;bm(t[n.next]);)n.next++;else{if(n.result+=`.`,n.digits===0)for(;t[n.next]===`0`;)n.result+=t[n.next++];for(;bm(t[n.next])&&n.digits<2;)n.result+=t[n.next++],n.digits++;for(bm(t[n.next])&&Number(t[n.next])>=5&&(n.result=Sm(n.result));bm(t[n.next]);)n.next++}return n.next>=t.length?n.result:t[n.next]===`E`?`${n.result}${t.slice(n.next)}`:t},Sm=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${Sm(r)}.`:n===`9`?`${Sm(r)}0`:`${r}${Number(n)+1}`},Cm=e=>{let t={value:0};for(;10n**BigInt(t.value+1)<e*10n;)t.value++;let n=10n**BigInt(t.value+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t.value+1}`)},wm=(e,t,n)=>{if(_m(e,t)<1e-10)return;let r=n().sort(),i=new Int32Array(r.buffer),a={narrow:1/0,wide:9223372036854775807n};for(let e=1;e<r.length;e++){let t=i[2*e+1],n=i[2*e-1];if(t<0!=n<0)continue;let o=t-n;if(o<=1048576){let t=o*4294967296+(i[2*e]>>>0)-(i[2*e-2]>>>0);a.narrow=Math.min(a.narrow,t)}else{let t=r[e]-r[e-1];t<a.wide&&(a.wide=t)}}if(a.narrow===1/0)return a.wide;let o=BigInt(a.narrow);return o<a.wide?o:a.wide},Tm=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a={count:0},o=n.find(t=>(a.count+=e[t],a.count>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},Em={line:0,column:0},Dm=`Failed to recover the initial state from its fingerprint.`,Om=`Failed to recover the next state from its fingerprint.`,km=e=>({kind:`Identifier`,name:e,location:Em}),Am=/* @__PURE__ */ new Set([`name`,`property`]),jm=(e,t,n)=>{let r=$a(t,n);if(!r)throw new l(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new l(Am.has(e)?`TLC requires ${t} not to take any argument.`:`TLC requires ${e} not to take any argument, but one was given: ${t}`);return r},Mm=(e,t,n)=>{let r=jm(e,t,n);if(to(r,n))throw new l(`The ${e} ${t} cannot be a constant.`);return r},Nm=(e,t,n)=>{if(to(t,n)&&t.body.kind!==`Number`&&t.body.kind!==`String`)try{return X(km(e),Qm(n,void 0,void 0))}catch(e){if(e instanceof u)return;throw e}},Pm=(e,t,n)=>{let r=jm(e,t,n),i=Nm(t,r,n);if(i!==void 0&&i!==!0)throw new l(`The ${e} of ${t} is equal to ${U(i)}`);return i===void 0?r:void 0},Fm=(e,t)=>{let n=Rd({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>$a(e,t)});return e.flatMap(e=>{let r=Pm(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2)throw new l(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${i.params.size===0?``:`
|
|
419
419
|
Note that a bug can cause TLC to incorrectly report this error.
|
|
420
420
|
If you believe your TLA+ or PlusCal specification to be correct,
|
|
421
|
-
please check if this bug described in LevelNode.java starting at line 590ff affects you.`}`);return[{name:e,expression:Om(e),scope:void 0}]})},Fm=(e,t)=>{if(!M(e))return;let n=H(e);if(!n.domain.every(e=>typeof e==`string`))return;let r=n.domain.map((e,t)=>[String(e),n.range[t]]);return Object.fromEntries(r.sort((e,n)=>t.indexOf(e[0])-t.indexOf(n[0])))},Im=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Im(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=$a(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Im(n.body,t)}return[e]},Lm=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||$(r,e.scope,t)>0)return!1;let i=X(r,Zm(t,void 0,void 0,e.scope));if(i===!1)throw new l(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new l(`The operator ${r.name}, which equals ${U(i)},\ncannot be used as a ${n}`);return!0},Rm=(t,r)=>{if(t.specification===void 0){let e=(e,t)=>{if(e===void 0)return;let n=Am(t,e,r).body,i=Om(e);if(n.kind!==`Number`&&n.kind!==`String`&&$(i,void 0,r)===0)throw new l(`The ${t} ${e} cannot be a constant.`);return i};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[]}}let i=[],a=[],o=[],s=Am(`name`,t.specification,r),c=Mm(t.specification,s,r);if(c!==void 0)throw new l(`The value of ${t.specification} is equal to ${U(c)}`);if(Uf(s.body,void 0,r,!1).forEach(s=>{let c=s.expression;if(Lm(s,r,`spec`))return;if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw n(new l(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){a.push({expression:c.expression.action,scope:s.scope});return}if(c.kind===`Always`&&$(c.expression,s.scope,r)<2)throw new l(`TLC cannot handle []P in the specification ${t.specification} when P is a state predicate`);let u=$(c,s.scope,r);if(u===3)o.push(s);else{if(u===2)throw new l(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);i.push(s)}}),a.length>1)throw new l(`The specification ${t.specification} must contain at most one [][Next]_vars`);let u=[...i,...a],d=e=>`$specification${e}`,f=u.reduce((e,t,n)=>t.scope===void 0?e:{name:d(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0},parent:e},void 0),p=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:d(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:i.length===0?void 0:{kind:`And`,operands:i.map(p),location:Tm},next:a.length===0?void 0:p(a[0],i.length),scope:f,temporals:o}},zm=(e,t)=>{let n={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let r=Nm(`property`,e,t);r&&Uf(r.body,void 0,t,!0,e).forEach(r=>{let i=r.expression;if(Lm(r,t,`property`))return;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){n.actionProperties.push({name:r.name,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:r.scope});return}if(i.kind===`Always`&&$(i.expression,r.scope,t)<=1){let e=i.expression;n.invariants.push({name:e.kind===`Identifier`?e.name:r.name,expression:e,scope:r.scope});return}let a=$(i,r.scope,t);if(a<2)n.initialPredicates.push({name:r.name,expression:i,scope:r.scope});else{if(a===2)throw new l(`The property ${e} is an action-level formula`);n.liveness.push({name:e,expression:i,scope:r.scope})}})}),n},Bm=(e,t,n)=>t.flatMap(t=>Nm(e,t,n)?[{name:t,expression:Om(t),scope:void 0}]:[]),Vm=(e,t)=>{let n=$a(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},Hm=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new l(`_POSSIBLE lists ${n} more than once`);jm(`possible`,n,t);let i=Om(n);if($(i,void 0,t)===3)throw new l(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:n,expression:i,scope:void 0}}),Um=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||W(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},Wm=(e,t)=>e.flatMap(e=>Im(e.expression,t).map(n=>{let r=e.scope===void 0?Fs(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:Um(n,r,t)}})),Gm=(e,t,n)=>{let r=e.variables;if(!n||!r)return!1;for(let e=0;e<r.length;e++)if(t[r[e]]!==n[r[e]])return!1;return!0},Km=/[\u0100-\uffff]/,qm=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),Jm=e=>e.kind===`String`?Km.test(e.value):e.kind===`Set`&&e.elements.some(Jm),Ym=e=>e.kind===`String`&&Km.test(e.value)||e.kind===`Apply`&&qm.has(e.operator)||In(e).some(Ym),Xm=(e,t)=>e.constants.some(e=>Jm(e.value)||(e.args??[]).some(Jm))||[...t.definitions.values()].some(e=>Ym(e.body)||e.kind===`Function`&&e.bounds.some(e=>Ym(e.set))),Zm=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),Qm=(e,t,n)=>Qa(X(e,t),n),$m=(e,t,n=eh)=>{let r=X(e,t);if(typeof r!=`boolean`)throw new u(n(e,t.environment));return r},eh=(e,t)=>{let n=e.kind===`Identifier`?$a(e.name,t):void 0,r=n?.kind===`Operator`?n.body:e,i=n?.kind===`Operator`?n.bodyRange:void 0;return`TLC expected a boolean value, but did not find one. ${r.kind===`Number`?r.text??String(r.value):i?za(i):Ba(r)}`},th=()=>{},nh=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=Qm(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),rh=(e,t,n)=>{try{return Qm(e,Zm(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof u)return{message:e.message};throw e}},ih=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=rh(n.expression,t,`an assumption`);if(e)return{name:Ba(n.expression),trace:[],message:e.message}}},ah=(t,r,i)=>{let a=Pm(t.invariants,r),s=Rm(t,r),c=zm(t,r),u=Wm([...a,...c.invariants],r),d=u.length>0||c.actionProperties.length>0||c.liveness.length>0;if(s.init===void 0&&(d||c.initialPredicates.length>0||r.variables.length>0))throw new l(`The configuration file did not specify the initial state predicate.`);if(s.next===void 0&&d)throw new l(`The configuration file did not specify the next state predicate.`);let f=Wm(Bm(`constraint`,t.constraints,r),r),p=Bm(`action constraint`,t.actionConstraints,r);t.rlReward!==void 0&&Am(`rlreward`,t.rlReward,r),t.periodic!==void 0&&Am(`periodic`,t.periodic,r);let m=Hm(t.possible,r);if(r.variables.length===0)return;let h=t.symmetry===void 0?[]:Hp(t.symmetry,r);t.view!==void 0&&Am(`view function`,t.view,r);let g=t.view===void 0?void 0:{name:t.view,expression:Om(t.view),scope:void 0},_=c.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Tm};return{...e,unchanged:t}}),v=e=>$(e.expression,void 0,r)>=2,y=m.filter(e=>!v(e)),ee=m.filter(v),b=r.runtime,x={indices:void 0},te=()=>{if(x.indices)return x.indices;let e=i(),t=t=>{let n=e.indexOf(r.variables[t]);return n===-1?r.variables.length:n};return x.indices=r.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),x.indices},ne=h.length>0?te():void 0,re=(e,t)=>X(e,Zm(r,t,void 0)),S=e=>{let t=te(),n=h.length===0?e:Xp(e,h,t);return Mc(g===void 0?t.map(e=>n[e]):[re(g.expression,n)])},ie=Xm(t,r);b.getFingerprint=S;let C=()=>{let e=m.find(e=>!b.possibleCounts.get(e.name));if(!e)return;let t=Vm(e.name,r),n=t?` at ${za(t)}`:``;return{name:e.name,message:`The _POSSIBLE predicate ${e.name}${n} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:A(U(Zc(b),!0))}};return{properties:c,spec:s,isSymmetric:h.length>0,getTlcOrder:te,getStoredFingerprints:(e,t)=>{if(g!==void 0||ie)return BigInt64Array.from(e,S);let n=new BigInt64Array(t.length),r=Fc(te(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(ie)return[String(S(e))];let t=h.length===0?e:Xp(e,h,ne);return g===void 0?t:[re(g.expression,t)]},findViolatedInvariant:(t,i)=>u.find(a=>{if(Gm(a,t,i))return!1;try{let e=Zm(r,t,void 0,a.scope),n=a.membership;return i&&n?!$t(t[n.variable],i[n.variable],X(n.set,e)):!$m(a.expression,e)}catch(t){throw i?sh(n(t,e.safetyEvaluationFailure),`Evaluating invariant ${a.name} failed.`):t}}),satisfiesConstraints:(e,t)=>f.every(n=>Gm(n,e,t)||$m(n.expression,Zm(r,e,void 0))),findFailedInitialPredicate:e=>c.initialPredicates.find(t=>!$m(t.expression,Zm(r,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>_.find(n=>{try{return!$m(n.action,Zm(r,e,t,n.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Ba(n.box)}`)&&!Qm(n.unchanged,Zm(r,e,t,n.scope),`a subscript`)}catch(e){throw sh(oh(e),`Evaluating action property ${n.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>p.every(n=>$m(n.expression,Zm(r,e,t),e=>`${o}${eh(e,r)}`)),trackStatePossible:y.length===0?th:e=>nh(y,b,Zm(r,e,void 0)),trackActionPossible:ee.length===0?th:(e,t)=>nh(ee,b,Zm(r,e,t)),findUnwitnessedPossible:C,findPostconditionViolation:()=>{let e=C();if(e)return e;for(let e of t.postconditions){let t=rh(Om(e),r,`a postcondition`);if(t)return{name:e,message:t.message??`Postcondition ${e} is false.`}}}}},oh=e=>e instanceof d?n(e,e.exitCode):e,sh=(e,t)=>e instanceof u?n(new u(`${t}\n${e.message}`,e),h(e)):e,ch=e=>{let t=e.dump&&Rp(e.dump,e.writeFile),n=lh(e,t);return t?.close(),n},lh=(e,t)=>{let n=typeof e.config==`string`?O(e.config):e.config,r=e.onPrint??console.log,i={isMuted:!1},o=e=>{i.isMuted||r(e)},s=e=>{i.isMuted=!0;let t=e();return i.isMuted=!1,t};Te(hm(e.source,n,e.loadModule));let c=Qd(n,{source:e.source,loadModule:e.loadModule,loadClass:e.loadClass,print:o,files:{readFile:e.readFile,writeFile:e.writeFile},seed:e.seed}),f=c.environment,p=f.runtime;p.pause=e.onPause??(()=>{}),p.getSpecification=()=>Op(n,f,c.variableLocations,c.instanceActions);let m={depth:0},g=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:p.generatedStates,distinctStates:p.distinctStates,queuedStates:p.queueSize,depth:p.generatedStates===0?0:Math.max(m.depth,1),outDegrees:void 0,fingerprintDistance:void 0}),_=Array.from({length:32},()=>0),v={newStates:0},y=()=>Math.min(v.newStates,31),ee=()=>_.map((e,t)=>t===y()?e+1:e),b=()=>({...g(`success`),outDegrees:[..._],fingerprintDistance:Cm(p.distinctStates,p.generatedStates,()=>x?x.getStoredFingerprints(E,D):BigInt64Array.from(E,p.getFingerprint))}),x=ah(n,f,()=>mm(e.source,e.loadModule)),te=ih(c.assumptions,f);if(te)return g(`assumption-violation`,te);if(!x)return b();let ne=n.postconditions.length>0||n.possible.length>0,re=(e,t,n)=>{if(ne){let e=t.loopStart;p.counterExample=eu(t.trace,e===void 0||!n?void 0:{start:e,action:n()})}let r=x.findUnwitnessedPossible();return r||x.findPostconditionViolation(),g(e,r?{...t,unwitnessed:r}:t)},S=x.spec,ie=x.getFingerprintState,C={value:void 0},ae=n.view!==void 0||n.symmetry!==void 0,w=[],oe=a(()=>tp(x.properties.liveness,S.temporals,f,{getFingerprint:e=>w[e]??=Number(BigInt.asIntN(32,p.getFingerprint(E[e]))),getSuccessors:e=>{let t=[];return S.next===void 0||Ia(S.next,e,f,n=>{if(ue(n.state),!(x.satisfiesConstraints(n.state,e)&&x.satisfiesActionConstraints(e,n.state)))return!1;let r=ie(n.state),i=Ce(xe(r),r);return t.push({index:i,state:n.state}),!1},S.scope),t}})),T=x.isSymmetric||oe!==void 0,E=[],D=[],se=[],k=[],ce=[],le={slots:new Int32Array(1<<17),size:0,shift:16},ue=Fn(),A=e=>Object.fromEntries(x.getTlcOrder().map(t=>[f.variables[t],e[t]])),j=(e,t,n,r)=>(p.getLevel=()=>n+1,p.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),de(e,t[n].state,(t[n+1]??t[r??n]).state)),de=(e,t,n)=>{try{let r=jm(`alias`,e,f).body,i=X(Om(e),Zm(f,t,n)),a=r.kind===`Record`?r.fields.map(e=>e.name):[];return Fm(i,a)??A(t)}catch(e){if(!(e instanceof l||e instanceof u))throw e;return{...A(t),_ALIASEvalError:e.message}}},M=(e,t,r)=>{C.value??=wp(n,f,c.instanceActions);let i={...F};Object.assign(F,{index:e,isExpanding:!0,candidate:void 0});let a=ie(r),o=C.value.find(e=>La(e.expression,t,f,e.scope).some(e=>Se(ie(e.state),a)));return Object.assign(F,i),o&&Ep(o)},N=(e,t,r)=>{let i=n.alias,a=s(()=>(e.length>1&&Go(f)&&fe(),e.map((n,r)=>r===0||n.action===`Stuttering`?void 0:M(t[r-1],e[r-1].state,n.state))));return e.map((t,n)=>({action:t.action,label:a[n],state:i===void 0?A(t.state):j(i,e,n,r)}))},fe=()=>S.init===void 0?[]:Fa(S.init,f,S.scope),pe=e=>S.next===void 0?[]:La(S.next,e,f,S.scope),me=(e,t)=>Se(ie(e),D[t]),he=(e,t)=>pe(e).find(e=>me(e.state,t)),ge=(e,t)=>{let n=ae||Go(f)?fe().find(t=>me(t,e[0])):E[e[0]];if(!n)throw new u(Em);let r=[{state:n,action:void 0}];for(let n=1;n<e.length;n++){let i=r[n-1].state;if(e[n-1]===e[n]){r.push({state:i,action:`Stuttering`});continue}let a=he(i,e[n]);if(!a)throw new u(t);r.push(a)}return r},_e=(e,t)=>{let n=[];for(let t=e;t!==-1;t=se[t])n.unshift(t);let r=ae&&n.length>1?ge(n,Em):n.map(e=>({state:E[e],action:k[e]}));if(!t)return N(r,n);let i=ae?pe(E[e]).find(e=>Se(e.state,t.state))?.action:t.action;return N([...r,{state:t.state,action:i}],n)},ve=e=>se[e]===-1?[{action:void 0,label:void 0,state:A(E[e])}]:_e(e),ye=(e,t,n,r)=>{if(!(e instanceof u))throw e;return{...g(`error`,void 0,{message:e.message,trace:t,initialState:n&&!(e instanceof d)?A(n):void 0,exitCode:h(e)}),outDegrees:r}},be=(e,t)=>{let n=ge(e,Dm),r=n[n.length-1].state;if(ae&&t!==void 0&&t!==e.length-1&&he(r,e[t])===void 0)throw new u(Dm);return n},xe=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=dn(t,gn(e[n]));return t&1073741823},Se=(e,t)=>{for(let n=0;n<t.length;n++)if(!ze(e[n],t[n]))return!1;return!0},P=e=>Math.imul(e,2654435761)>>>le.shift<<1,Ce=(e,t)=>{let n=le.slots.length-1;for(let r=P(e);;r=r+2&n){let n=le.slots[r+1];if(n===0)return-1;if(le.slots[r]===e&&Se(D[n-1],t))return n-1}},we=(e,t)=>{let n=le.slots.length-1,r=P(e);for(;le.slots[r+1]!==0;)r=r+2&n;le.slots[r]=e,le.slots[r+1]=t},Ee=(e,t)=>{if(le.size++,le.size*4>le.slots.length){let e=le.slots;le.slots=new Int32Array(e.length*2),le.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&we(e[t],e[t+1])}we(e,t+1)},De=e=>{p.distinctStates=E.length+1,m.depth=Math.max(m.depth,e),p.diameter=Math.max(p.diameter,e)},Oe=(e,t,n,r)=>{let i=n===-1?1:ce[n]+1;E.push(e),D.push(t),se.push(n),k.push(r),ce.push(i)},F={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,livenessSource:-1},I=e=>e===-1?[]:[...I(se[e]),E[e]];p.isSeen=e=>{let t=ie(e);return Ce(xe(t),t)!==-1},p.getBehavior=e=>{let t=e===F.candidate?-1:E.indexOf(e);return t===-1?[...I(F.index),e]:I(t)},p.getCurrentState=()=>F.index===-1?void 0:E[F.index],p.setLivenessSource=e=>{F.livenessSource=e??-1},p.getLevel=e=>{let t=F.livenessSource;return t===-1?e===F.candidate?F.candidateLevel:F.index===-1?0:e===E[F.index]?ce[F.index]:F.isExpanding?ce[F.index]+1:0:e===E[t]?ce[t]:ce[t]+1};let ke=(e,t)=>({fingerprint:BigInt.asIntN(64,p.getFingerprint(e)),level:t,getLabel:()=>Nn(n.alias===void 0?A(e):de(n.alias,e,void 0)),getText:()=>Nn(A(e))}),Ae=e=>{ue(e),p.generatedStates++,p.initialStates++,F.candidate=e,F.candidateLevel=1;let n=ie(e),r=xe(n),i=x.satisfiesConstraints(e);if(i&&x.trackStatePossible(e),i&&Ce(r,n)!==-1)return;i&&(De(1),p.queueSize++,oe?.addInitialState(E.length,e),t?.writeInitialState(ke(e,1)));let a=x.findViolatedInvariant(e);if(a)return re(`invariant-violation`,{name:a.name,trace:N([{action:void 0,state:e}],[])});let o=x.findFailedInitialPredicate(e);if(o)return re(`liveness-violation`,{name:o.name,trace:N([{action:void 0,state:e}],[])});i&&(Ee(r,E.length),Oe(e,n,-1,void 0))},je=(e,n,r,i,a)=>{let o=E[e];p.generatedStates++,F.candidate=n.state,F.candidateLevel=ce[e]+1,T&&ue(n.state);let s=ie(n.state),c=xe(s),l=Ce(c,s),u=x.satisfiesConstraints(n.state,o);u&&x.trackStatePossible(n.state);let d=u&&x.satisfiesActionConstraints(o,n.state);d&&x.trackActionPossible(o,n.state);let f=d?l:-1;if(i&&d&&t?.writeSuccessor(i,ke(n.state,ce[e]+1),f!==-1,a&&{name:a.name,signature:Dp(a)}),f!==-1&&oe){let e=E[f],t=e.every((e,t)=>e===n.state[t]);r.push({index:f,state:t?e:n.state})}let m=d&&f===-1;if(m&&(De(ce[e]+1),v.newStates++),f===-1)try{let t=x.findViolatedInvariant(n.state,o);if(t)return re(`invariant-violation`,{name:t.name,trace:_e(e,n)})}catch(t){return ye(t,_e(e,n),void 0,ee())}let h=x.findViolatedActionProperty(o,n.state);if(h)return re(`liveness-violation`,{name:h.name,trace:_e(e,n)});m&&(T||ue(n.state),Ee(c,E.length),oe&&r.push({index:E.length,state:n.state}),Oe(n.state,s,e,n.action),p.queueSize++)},Me={result:void 0};if(S.init!==void 0)try{Pa(S.init,f,e=>{try{Me.result=Ae(e)}catch(t){Me.result=ye(t,[],e)}return Me.result!==void 0},S.scope)}catch(e){return ye(e,[])}if(Me.result)return Me.result;let L=S.next;if(L===void 0){if(E.length>0)throw new u(`No next state actions defined to generate successor states from.`);return b()}let Ne=!!(e.dump?.dot&&(e.dump.actionLabels||e.dump.colorize)),Pe=(e,t)=>{if(!Ne)return Ia(L,e,f,e=>t(e,void 0),S.scope);C.value??=wp(n,f,c.instanceActions);let r={isStopped:!1};return C.value.reduce((n,i)=>r.isStopped?n:n+Ia(i.expression,e,f,e=>(r.isStopped=t(e,i),r.isStopped),i.scope),0)},Fe=e=>{let r=E[e],i=[],a=t&&ke(r,ce[e]),o=Pe(r,(t,n)=>{try{Me.result=je(e,t,i,a,n)}catch(n){Me.result=ye(n,_e(e,t))}return Me.result!==void 0});if(F.isExpanding=!1,Me.result)return Me.result;if(o===0&&n.checkDeadlock)return re(`deadlock`,{name:`deadlock`,trace:ve(e)});try{let t=oe?.addState(e,r,i);if(!oe||!t)return;let n=be(t),a=oe.getViolatedProperties(n.map(e=>e.state),n.length-1);return re(`property-violation`,{name:a[0],properties:a,trace:N(n,t)})}catch(t){return ye(t,ve(e),void 0,ee())}},Ie=(e,t)=>{let n=[...t.prefix,...t.cycle],r=t.prefix.length,i=be(n,r),a=N(i,n,r),o=e.getViolatedProperties(i.map(e=>e.state),r),c=n[r],l=n[n.length-1],u=i[i.length-1].state,d=c===l?void 0:s(()=>M(l,u,E[c]));return re(`liveness-violation`,{name:o[0],properties:o,trace:a,loopStart:r,loopLabel:d},()=>c===l?a[a.length-1].action:he(u,c)?.action)},Le=oe!==void 0&&e.livenessCheck!==`final`,Re=performance.now(),Be={at:Re+3e3,size:1,time:0},Ve=e=>{let t=performance.now();if(Be.at=t+6e4,!((e-Be.size)/Be.size>.1)||Be.time>(t-Re)*.2)return;Be.size=e;let n=oe?.findViolation();return Be.time+=performance.now()-t,n};for(let e=0;e<E.length&&!p.isStopped;e++){F.index=e,F.candidate=void 0,p.queueSize=E.length-e-1,F.isExpanding=!0;try{Me.result=Fe(e)}catch(t){Me.result=ye(oh(t),ve(e))}if(Me.result)return Me.result;if(_[y()]++,v.newStates=0,Le&&performance.now()>=Be.at){let t=Ve(e+1);if(oe&&t)return Ie(oe,t)}}F.index=-1,F.candidate=void 0;let He=oe?.findViolation();if(oe&&He)return Ie(oe,He);let Ue=x.findPostconditionViolation();return Ue?g(`postcondition-violation`,{...Ue,trace:[]}):b()},uh=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},dh=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^gn(e[t]),16777619),r=Math.imul(r^Cn(e[t]),1540483477);t[0]=uh(n)||1,t[1]=uh(r)},fh=()=>{let e={slots:/* @__PURE__ */ new Int32Array(8192),used:0},t=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},n=()=>{let n=e.slots,r=new Int32Array(n.length*2);for(let e=0;e<n.length;e+=2){if(n[e]===0)continue;let i=t(r,n[e],n[e+1]);r[i*2]=n[e],r[i*2+1]=n[e+1]}e.slots=r};return{insert:(r,i)=>{e.used*4>=e.slots.length&&n();let a=t(e.slots,r,i);return e.slots[a*2]!==r&&(e.slots[a*2]=r,e.slots[a*2+1]=i,e.used++,!0)}}},ph=(e,t)=>{let n=e.length-1;for(let r=Number(t>>32n)&n;;r=r+1&n){let n=Atomics.load(e,r);if(n===t)return!1;if(n!==0n)continue;let i=Atomics.compareExchange(e,r,0n,t);if(i===0n)return!0;if(i===t)return!1}},mh=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),hh=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return ph(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},gh=e=>Atomics.load(e.used,0)*2>=e.slots.length,_h=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&ph(t,n);return{slots:t,used:e.used}},vh=()=>{let e={words:/* @__PURE__ */ new Int32Array(1024),length:0,count:0},t=[],n=/* @__PURE__ */ new Map,r=t=>{if(e.length===e.words.length){let t=new Int32Array(e.words.length*2);t.set(e.words),e.words=t}e.words[e.length++]=t},i=e=>{let i=n.get(e);if(i!==void 0)return r(i);n.set(e,t.length),r(t.length),t.push(e)},a=e=>{if(typeof e==`boolean`)return r(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(r(2),r(e),!0);if(typeof e==`string`)return r(3),i(e),!0;if(e.kind===`ModelValue`)return r(4),i(e.name),!0;if(e.kind===`Set`)return r(5),r(e.elements.length),e.elements.every(a);if(e.kind===`Function`){let t=on(e.domain);return t?(r(7),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(e.domain.length),e.domain.every(a)&&e.range.every(a))}return!1};return{encode:t=>{let n=e.length;return t.every(a)?(e.count++,!0):(e.length=n,!1)},finish:()=>({words:e.words.slice(0,e.length),strings:t,count:e.count})}},yh=e=>t=>{let n=t.words,r={index:0},i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r.index++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r.index++];if(e===3)return t.strings[n[r.index++]];if(e===4)return Pe(t.strings[n[r.index++]]);if(e===7){let e=n[r.index++],t=n[r.index++],a=Et({kind:`Interval`,low:e,high:e+t-1});return Ie(a,i(t))}let a=n[r.index++];if(e===5)return Fe(i(a));let o=i(a);return Ie(o,i(a))};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{O as A,e as B,Fa as C,U as D,Nn as E,f as F,c as I,m as L,l as M,s as N,De as O,u as P,p as R,Go as S,Fn as T,hm as _,_h as a,hc as b,dh as c,ih as d,bm as f,wm as g,gm as h,mh as i,oe as j,Te as k,ch as l,Cm as m,vh as n,hh as o,Sm as p,fh as r,gh as s,yh as t,ah as u,mm as v,La as w,gc as x,Qd as y,h as z};
|
|
421
|
+
please check if this bug described in LevelNode.java starting at line 590ff affects you.`}`);return[{name:e,expression:km(e),scope:void 0}]})},Im=(e,t)=>{if(!M(e))return;let n=H(e);if(!n.domain.every(e=>typeof e==`string`))return;let r=n.domain.map((e,t)=>[String(e),n.range[t]]);return Object.fromEntries(r.sort((e,n)=>t.indexOf(e[0])-t.indexOf(n[0])))},Lm=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>Lm(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=$a(e.name,t);if(n?.kind===`Operator`&&n.params.length===0)return Lm(n.body,t)}return[e]},Rm=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||$(r,e.scope,t)>0)return!1;let i=X(r,Qm(t,void 0,void 0,e.scope));if(i===!1)throw new l(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new l(`The operator ${r.name}, which equals ${U(i)},\ncannot be used as a ${n}`);return!0},zm=(t,r)=>{if(t.specification===void 0){let e=(e,t)=>{if(e===void 0)return;let n=jm(t,e,r).body,i=km(e);if(n.kind!==`Number`&&n.kind!==`String`&&$(i,void 0,r)===0)throw new l(`The ${t} ${e} cannot be a constant.`);return i};return{init:e(t.init,`initial predicate`),next:e(t.next,`next state action`),scope:void 0,temporals:[]}}let i=[],a=[],o=[],s=jm(`name`,t.specification,r),c=Nm(t.specification,s,r);if(c!==void 0)throw new l(`The value of ${t.specification} is equal to ${U(c)}`);if(Uf(s.body,void 0,r,!1).forEach(s=>{let c=s.expression;if(Rm(s,r,`spec`))return;if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw n(new l(`TLC does not support temporal existential, nor universal, quantification over state variables.`),e.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){a.push({expression:c.expression.action,scope:s.scope});return}if(c.kind===`Always`&&$(c.expression,s.scope,r)<2)throw new l(`TLC cannot handle []P in the specification ${t.specification} when P is a state predicate`);let u=$(c,s.scope,r);if(u===3)o.push(s);else{if(u===2)throw new l(`TLC cannot handle the action-level conjunct of the specification ${t.specification}`);i.push(s)}}),a.length>1)throw new l(`The specification ${t.specification} must contain at most one [][Next]_vars`);let u=[...i,...a],d=e=>`$specification${e}`,f=u.reduce((e,t,n)=>t.scope===void 0?e:{name:d(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0},parent:e},void 0),p=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:d(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:i.length===0?void 0:{kind:`And`,operands:i.map(p),location:Em},next:a.length===0?void 0:p(a[0],i.length),scope:f,temporals:o}},Bm=(e,t)=>{let n={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let r=Pm(`property`,e,t);r&&Uf(r.body,void 0,t,!0,e).forEach(r=>{let i=r.expression;if(Rm(r,t,`property`))return;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){n.actionProperties.push({name:r.name,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:r.scope});return}if(i.kind===`Always`&&$(i.expression,r.scope,t)<=1){let e=i.expression;n.invariants.push({name:e.kind===`Identifier`?e.name:r.name,expression:e,scope:r.scope});return}let a=$(i,r.scope,t);if(a<2)n.initialPredicates.push({name:r.name,expression:i,scope:r.scope});else{if(a===2)throw new l(`The property ${e} is an action-level formula`);n.liveness.push({name:e,expression:i,scope:r.scope})}})}),n},Vm=(e,t,n)=>t.flatMap(t=>Pm(e,t,n)?[{name:t,expression:km(t),scope:void 0}]:[]),Hm=(e,t)=>{let n=$a(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},Um=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new l(`_POSSIBLE lists ${n} more than once`);Mm(`possible`,n,t);let i=km(n);if($(i,void 0,t)===3)throw new l(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:n,expression:i,scope:void 0}}),Wm=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||W(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},Gm=(e,t)=>e.flatMap(e=>Lm(e.expression,t).map(n=>{let r=e.scope===void 0?Fs(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:Wm(n,r,t)}})),Km=(e,t,n)=>{let r=e.variables;if(!n||!r)return!1;for(let e=0;e<r.length;e++)if(t[r[e]]!==n[r[e]])return!1;return!0},qm=/[\u0100-\uffff]/,Jm=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),Ym=e=>e.kind===`String`?qm.test(e.value):e.kind===`Set`&&e.elements.some(Ym),Xm=e=>e.kind===`String`&&qm.test(e.value)||e.kind===`Apply`&&Jm.has(e.operator)||In(e).some(Xm),Zm=(e,t)=>e.constants.some(e=>Ym(e.value)||(e.args??[]).some(Ym))||[...t.definitions.values()].some(e=>Xm(e.body)||e.kind===`Function`&&e.bounds.some(e=>Xm(e.set))),Qm=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),$m=(e,t,n)=>Qa(X(e,t),n),eh=(e,t,n=th)=>{let r=X(e,t);if(typeof r!=`boolean`)throw new u(n(e,t.environment));return r},th=(e,t)=>{let n=e.kind===`Identifier`?$a(e.name,t):void 0,r=n?.kind===`Operator`?n.body:e,i=n?.kind===`Operator`?n.bodyRange:void 0;return`TLC expected a boolean value, but did not find one. ${r.kind===`Number`?r.text??String(r.value):i?za(i):Ba(r)}`},nh=()=>{},rh=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=$m(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),ih=(e,t,n)=>{try{return $m(e,Qm(t,void 0,void 0),n)?void 0:{message:void 0}}catch(e){if(e instanceof u)return{message:e.message};throw e}},ah=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=ih(n.expression,t,`an assumption`);if(e)return{name:Ba(n.expression),trace:[],message:e.message}}},oh=(t,r,i)=>{let a=Fm(t.invariants,r),s=zm(t,r),c=Bm(t,r),u=Gm([...a,...c.invariants],r),d=u.length>0||c.actionProperties.length>0||c.liveness.length>0;if(s.init===void 0&&(d||c.initialPredicates.length>0||r.variables.length>0))throw new l(`The configuration file did not specify the initial state predicate.`);if(s.next===void 0&&d)throw new l(`The configuration file did not specify the next state predicate.`);let f=Gm(Vm(`constraint`,t.constraints,r),r),p=Vm(`action constraint`,t.actionConstraints,r);t.rlReward!==void 0&&jm(`rlreward`,t.rlReward,r),t.periodic!==void 0&&jm(`periodic`,t.periodic,r);let m=Um(t.possible,r);if(r.variables.length===0)return;let h=t.symmetry===void 0?[]:Up(t.symmetry,r);t.view!==void 0&&jm(`view function`,t.view,r);let g=t.view===void 0?void 0:{name:t.view,expression:km(t.view),scope:void 0},_=c.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:Em};return{...e,unchanged:t}}),v=e=>$(e.expression,void 0,r)>=2,y=m.filter(e=>!v(e)),ee=m.filter(v),b=r.runtime,x={indices:void 0},te=()=>{if(x.indices)return x.indices;let e=i(),t=t=>{let n=e.indexOf(r.variables[t]);return n===-1?r.variables.length:n};return x.indices=r.variables.map((e,t)=>t).sort((e,n)=>t(e)-t(n)),x.indices},ne=h.length>0?te():void 0,re=(e,t)=>X(e,Qm(r,t,void 0)),S=e=>{let t=te(),n=h.length===0?e:Zp(e,h,t);return Mc(g===void 0?t.map(e=>n[e]):[re(g.expression,n)])},ie=Zm(t,r);b.getFingerprint=S;let C=()=>{let e=m.find(e=>!b.possibleCounts.get(e.name));if(!e)return;let t=Hm(e.name,r),n=t?` at ${za(t)}`:``;return{name:e.name,message:`The _POSSIBLE predicate ${e.name}${n} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:A(U(Zc(b),!0))}};return{properties:c,spec:s,isSymmetric:h.length>0,getTlcOrder:te,getStoredFingerprints:(e,t)=>{if(g!==void 0||ie)return BigInt64Array.from(e,S);let n=new BigInt64Array(t.length),r=Fc(te(),new Int32Array(n.buffer));return t.forEach(r),n},getFingerprintState:e=>{if(ie)return[String(S(e))];let t=h.length===0?e:Zp(e,h,ne);return g===void 0?t:[re(g.expression,t)]},findViolatedInvariant:(t,i)=>u.find(a=>{if(Km(a,t,i))return!1;try{let e=Qm(r,t,void 0,a.scope),n=a.membership;return i&&n?!$t(t[n.variable],i[n.variable],X(n.set,e)):!eh(a.expression,e)}catch(t){throw i?ch(n(t,e.safetyEvaluationFailure),`Evaluating invariant ${a.name} failed.`):t}}),satisfiesConstraints:(e,t)=>f.every(n=>Km(n,e,t)||eh(n.expression,Qm(r,e,void 0))),findFailedInitialPredicate:e=>c.initialPredicates.find(t=>!eh(t.expression,Qm(r,e,void 0,t.scope))),findViolatedActionProperty:(e,t)=>_.find(n=>{try{return!eh(n.action,Qm(r,e,t,n.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Ba(n.box)}`)&&!$m(n.unchanged,Qm(r,e,t,n.scope),`a subscript`)}catch(e){throw ch(sh(e),`Evaluating action property ${n.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>p.every(n=>eh(n.expression,Qm(r,e,t),e=>`${o}${th(e,r)}`)),trackStatePossible:y.length===0?nh:e=>rh(y,b,Qm(r,e,void 0)),trackActionPossible:ee.length===0?nh:(e,t)=>rh(ee,b,Qm(r,e,t)),findUnwitnessedPossible:C,findPostconditionViolation:()=>{let e=C();if(e)return e;for(let e of t.postconditions){let t=ih(km(e),r,`a postcondition`);if(t)return{name:e,message:t.message??`Postcondition ${e} is false.`}}}}},sh=e=>e instanceof d?n(e,e.exitCode):e,ch=(e,t)=>e instanceof u?n(new u(`${t}\n${e.message}`,e),h(e)):e,lh=e=>{let t=e.dump&&zp(e.dump,e.writeFile),n=uh(e,t);return t?.close(),n},uh=(e,t)=>{let n=typeof e.config==`string`?O(e.config):e.config,r=e.onPrint??console.log,i={isMuted:!1},o=e=>{i.isMuted||r(e)},s=e=>{i.isMuted=!0;let t=e();return i.isMuted=!1,t};Te(gm(e.source,n,e.loadModule));let c=Qd(n,{source:e.source,loadModule:e.loadModule,loadClass:e.loadClass,print:o,files:{readFile:e.readFile,writeFile:e.writeFile},seed:e.seed}),f=c.environment,p=f.runtime;p.pause=e.onPause??(()=>{}),p.getSpecification=()=>kp(n,f,c.variableLocations,c.instanceActions);let m={depth:0},g=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:p.generatedStates,distinctStates:p.distinctStates,queuedStates:p.queueSize,depth:p.generatedStates===0?0:Math.max(m.depth,1),outDegrees:void 0,fingerprintDistance:void 0}),_=Array.from({length:32},()=>0),v={newStates:0},y=()=>Math.min(v.newStates,31),ee=()=>_.map((e,t)=>t===y()?e+1:e),b=()=>({...g(`success`),outDegrees:[..._],fingerprintDistance:wm(p.distinctStates,p.generatedStates,()=>x?x.getStoredFingerprints(E,D):BigInt64Array.from(E,p.getFingerprint))}),x=oh(n,f,()=>hm(e.source,e.loadModule)),te=ah(c.assumptions,f);if(te)return g(`assumption-violation`,te);if(!x)return b();let ne=n.postconditions.length>0||n.possible.length>0,re=(e,t,n)=>{if(ne){let e=t.loopStart;p.counterExample=eu(t.trace,e===void 0||!n?void 0:{start:e,action:n()})}let r=x.findUnwitnessedPossible();return r||x.findPostconditionViolation(),g(e,r?{...t,unwitnessed:r}:t)},S=x.spec,ie=x.getFingerprintState,C={value:void 0},ae=n.view!==void 0||n.symmetry!==void 0,w=[],oe=a(()=>np(x.properties.liveness,S.temporals,f,{getFingerprint:e=>w[e]??=Number(BigInt.asIntN(32,p.getFingerprint(E[e]))),getSuccessors:e=>{let t=[];return S.next===void 0||Ia(S.next,e,f,n=>{if(ue(n.state),!(x.satisfiesConstraints(n.state,e)&&x.satisfiesActionConstraints(e,n.state)))return!1;let r=ie(n.state),i=Ce(xe(r),r);return t.push({index:i,state:n.state}),!1},S.scope),t}})),T=x.isSymmetric||oe!==void 0,E=[],D=[],se=[],k=[],ce=[],le={slots:new Int32Array(1<<17),size:0,shift:16},ue=Fn(),A=e=>Object.fromEntries(x.getTlcOrder().map(t=>[f.variables[t],e[t]])),j=(e,t,n,r)=>(p.getLevel=()=>n+1,p.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),de(e,t[n].state,(t[n+1]??t[r??n]).state)),de=(e,t,n)=>{try{let r=Mm(`alias`,e,f).body,i=X(km(e),Qm(f,t,n)),a=r.kind===`Record`?r.fields.map(e=>e.name):[];return Im(i,a)??A(t)}catch(e){if(!(e instanceof l||e instanceof u))throw e;return{...A(t),_ALIASEvalError:e.message}}},M=(e,t,r)=>{C.value??=Tp(n,f,c.instanceActions);let i={...F};Object.assign(F,{index:e,isExpanding:!0,candidate:void 0});let a=ie(r),o=C.value.find(e=>La(e.expression,t,f,e.scope).some(e=>Se(ie(e.state),a)));return Object.assign(F,i),o&&Dp(o)},N=(e,t,r)=>{let i=n.alias,a=s(()=>(e.length>1&&Go(f)&&fe(),e.map((n,r)=>r===0||n.action===`Stuttering`?void 0:M(t[r-1],e[r-1].state,n.state))));return e.map((t,n)=>({action:t.action,label:a[n],state:i===void 0?A(t.state):j(i,e,n,r)}))},fe=()=>S.init===void 0?[]:Fa(S.init,f,S.scope),pe=e=>S.next===void 0?[]:La(S.next,e,f,S.scope),me=(e,t)=>Se(ie(e),D[t]),he=(e,t)=>pe(e).find(e=>me(e.state,t)),ge=(e,t)=>{let n=ae||Go(f)?fe().find(t=>me(t,e[0])):E[e[0]];if(!n)throw new u(Dm);let r=[{state:n,action:void 0}];for(let n=1;n<e.length;n++){let i=r[n-1].state;if(e[n-1]===e[n]){r.push({state:i,action:`Stuttering`});continue}let a=he(i,e[n]);if(!a)throw new u(t);r.push(a)}return r},_e=(e,t)=>{let n=[];for(let t=e;t!==-1;t=se[t])n.unshift(t);let r=ae&&n.length>1?ge(n,Dm):n.map(e=>({state:E[e],action:k[e]}));if(!t)return N(r,n);let i=ae?pe(E[e]).find(e=>Se(e.state,t.state))?.action:t.action;return N([...r,{state:t.state,action:i}],n)},ve=e=>se[e]===-1?[{action:void 0,label:void 0,state:A(E[e])}]:_e(e),ye=(e,t,n,r)=>{if(!(e instanceof u))throw e;return{...g(`error`,void 0,{message:e.message,trace:t,initialState:n&&!(e instanceof d)?A(n):void 0,exitCode:h(e)}),outDegrees:r}},be=(e,t)=>{let n=ge(e,Om),r=n[n.length-1].state;if(ae&&t!==void 0&&t!==e.length-1&&he(r,e[t])===void 0)throw new u(Om);return n},xe=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=dn(t,gn(e[n]));return t&1073741823},Se=(e,t)=>{for(let n=0;n<t.length;n++)if(!ze(e[n],t[n]))return!1;return!0},P=e=>Math.imul(e,2654435761)>>>le.shift<<1,Ce=(e,t)=>{let n=le.slots.length-1;for(let r=P(e);;r=r+2&n){let n=le.slots[r+1];if(n===0)return-1;if(le.slots[r]===e&&Se(D[n-1],t))return n-1}},we=(e,t)=>{let n=le.slots.length-1,r=P(e);for(;le.slots[r+1]!==0;)r=r+2&n;le.slots[r]=e,le.slots[r+1]=t},Ee=(e,t)=>{if(le.size++,le.size*4>le.slots.length){let e=le.slots;le.slots=new Int32Array(e.length*2),le.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&we(e[t],e[t+1])}we(e,t+1)},De=e=>{p.distinctStates=E.length+1,m.depth=Math.max(m.depth,e),p.diameter=Math.max(p.diameter,e)},Oe=(e,t,n,r)=>{let i=n===-1?1:ce[n]+1;E.push(e),D.push(t),se.push(n),k.push(r),ce.push(i)},F={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,livenessSource:-1},I=e=>e===-1?[]:[...I(se[e]),E[e]];p.isSeen=e=>{let t=ie(e);return Ce(xe(t),t)!==-1},p.getBehavior=e=>{let t=e===F.candidate?-1:E.indexOf(e);return t===-1?[...I(F.index),e]:I(t)},p.getCurrentState=()=>F.index===-1?void 0:E[F.index],p.setLivenessSource=e=>{F.livenessSource=e??-1},p.getLevel=e=>{let t=F.livenessSource;return t===-1?e===F.candidate?F.candidateLevel:F.index===-1?0:e===E[F.index]?ce[F.index]:F.isExpanding?ce[F.index]+1:0:e===E[t]?ce[t]:ce[t]+1};let ke=(e,t)=>({fingerprint:BigInt.asIntN(64,p.getFingerprint(e)),level:t,getLabel:()=>Nn(n.alias===void 0?A(e):de(n.alias,e,void 0)),getText:()=>Nn(A(e))}),Ae=e=>{ue(e),p.generatedStates++,p.initialStates++,F.candidate=e,F.candidateLevel=1;let n=ie(e),r=xe(n),i=x.satisfiesConstraints(e);if(i&&x.trackStatePossible(e),i&&Ce(r,n)!==-1)return;i&&(De(1),p.queueSize++,oe?.addInitialState(E.length,e),t?.writeInitialState(ke(e,1)));let a=x.findViolatedInvariant(e);if(a)return re(`invariant-violation`,{name:a.name,trace:N([{action:void 0,state:e}],[])});let o=x.findFailedInitialPredicate(e);if(o)return re(`liveness-violation`,{name:o.name,trace:N([{action:void 0,state:e}],[])});i&&(Ee(r,E.length),Oe(e,n,-1,void 0))},je=(e,n,r,i,a)=>{let o=E[e];p.generatedStates++,F.candidate=n.state,F.candidateLevel=ce[e]+1,T&&ue(n.state);let s=ie(n.state),c=xe(s),l=Ce(c,s),u=x.satisfiesConstraints(n.state,o);u&&x.trackStatePossible(n.state);let d=u&&x.satisfiesActionConstraints(o,n.state);d&&x.trackActionPossible(o,n.state);let f=d?l:-1;if(i&&d&&t?.writeSuccessor(i,ke(n.state,ce[e]+1),f!==-1,a&&{name:a.name,signature:Op(a)}),f!==-1&&oe){let e=E[f],t=e.every((e,t)=>e===n.state[t]);r.push({index:f,state:t?e:n.state})}let m=d&&f===-1;if(m&&(De(ce[e]+1),v.newStates++),f===-1)try{let t=x.findViolatedInvariant(n.state,o);if(t)return re(`invariant-violation`,{name:t.name,trace:_e(e,n)})}catch(t){return ye(t,_e(e,n),void 0,ee())}let h=x.findViolatedActionProperty(o,n.state);if(h)return re(`liveness-violation`,{name:h.name,trace:_e(e,n)});m&&(T||ue(n.state),Ee(c,E.length),oe&&r.push({index:E.length,state:n.state}),Oe(n.state,s,e,n.action),p.queueSize++)},Me={result:void 0};if(S.init!==void 0)try{Pa(S.init,f,e=>{try{Me.result=Ae(e)}catch(t){Me.result=ye(t,[],e)}return Me.result!==void 0},S.scope)}catch(e){return ye(e,[])}if(Me.result)return Me.result;let L=S.next;if(L===void 0){if(E.length>0)throw new u(`No next state actions defined to generate successor states from.`);return b()}let Ne=!!(e.dump?.dot&&(e.dump.actionLabels||e.dump.colorize)),Pe=(e,t)=>{if(!Ne)return Ia(L,e,f,e=>t(e,void 0),S.scope);C.value??=Tp(n,f,c.instanceActions);let r={isStopped:!1};return C.value.reduce((n,i)=>r.isStopped?n:n+Ia(i.expression,e,f,e=>(r.isStopped=t(e,i),r.isStopped),i.scope),0)},Fe=e=>{let r=E[e],i=[],a=t&&ke(r,ce[e]),o=Pe(r,(t,n)=>{try{Me.result=je(e,t,i,a,n)}catch(n){Me.result=ye(n,_e(e,t))}return Me.result!==void 0});if(F.isExpanding=!1,Me.result)return Me.result;if(o===0&&n.checkDeadlock)return re(`deadlock`,{name:`deadlock`,trace:ve(e)});try{let t=oe?.addState(e,r,i);if(!oe||!t)return;let n=be(t),a=oe.getViolatedProperties(n.map(e=>e.state),n.length-1);return re(`property-violation`,{name:a[0],properties:a,trace:N(n,t)})}catch(t){return ye(t,ve(e),void 0,ee())}},Ie=(e,t)=>{let n=[...t.prefix,...t.cycle],r=t.prefix.length,i=be(n,r),a=N(i,n,r),o=e.getViolatedProperties(i.map(e=>e.state),r),c=n[r],l=n[n.length-1],u=i[i.length-1].state,d=c===l?void 0:s(()=>M(l,u,E[c]));return re(`liveness-violation`,{name:o[0],properties:o,trace:a,loopStart:r,loopLabel:d},()=>c===l?a[a.length-1].action:he(u,c)?.action)},Le=oe!==void 0&&e.livenessCheck!==`final`,Re=performance.now(),Be={at:Re+3e3,size:1,time:0},Ve=e=>{let t=performance.now();if(Be.at=t+6e4,!((e-Be.size)/Be.size>.1)||Be.time>(t-Re)*.2)return;Be.size=e;let n=oe?.findViolation();return Be.time+=performance.now()-t,n};for(let e=0;e<E.length&&!p.isStopped;e++){F.index=e,F.candidate=void 0,p.queueSize=E.length-e-1,F.isExpanding=!0;try{Me.result=Fe(e)}catch(t){Me.result=ye(sh(t),ve(e))}if(Me.result)return Me.result;if(_[y()]++,v.newStates=0,Le&&performance.now()>=Be.at){let t=Ve(e+1);if(oe&&t)return Ie(oe,t)}}F.index=-1,F.candidate=void 0;let He=oe?.findViolation();if(oe&&He)return Ie(oe,He);let Ue=x.findPostconditionViolation();return Ue?g(`postcondition-violation`,{...Ue,trace:[]}):b()},dh=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},fh=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^gn(e[t]),16777619),r=Math.imul(r^Cn(e[t]),1540483477);t[0]=dh(n)||1,t[1]=dh(r)},ph=()=>{let e={slots:/* @__PURE__ */ new Int32Array(8192),used:0},t=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},n=()=>{let n=e.slots,r=new Int32Array(n.length*2);for(let e=0;e<n.length;e+=2){if(n[e]===0)continue;let i=t(r,n[e],n[e+1]);r[i*2]=n[e],r[i*2+1]=n[e+1]}e.slots=r};return{insert:(r,i)=>{e.used*4>=e.slots.length&&n();let a=t(e.slots,r,i);return e.slots[a*2]!==r&&(e.slots[a*2]=r,e.slots[a*2+1]=i,e.used++,!0)}}},mh=(e,t)=>{let n=e.length-1;for(let r=Number(t>>32n)&n;;r=r+1&n){let n=Atomics.load(e,r);if(n===t)return!1;if(n!==0n)continue;let i=Atomics.compareExchange(e,r,0n,t);if(i===0n)return!0;if(i===t)return!1}},hh=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),gh=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return mh(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},_h=e=>Atomics.load(e.used,0)*2>=e.slots.length,vh=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&mh(t,n);return{slots:t,used:e.used}},yh=()=>{let e={words:/* @__PURE__ */ new Int32Array(1024),length:0,count:0},t=[],n=/* @__PURE__ */ new Map,r=t=>{if(e.length===e.words.length){let t=new Int32Array(e.words.length*2);t.set(e.words),e.words=t}e.words[e.length++]=t},i=e=>{let i=n.get(e);if(i!==void 0)return r(i);n.set(e,t.length),r(t.length),t.push(e)},a=e=>{if(typeof e==`boolean`)return r(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(r(2),r(e),!0);if(typeof e==`string`)return r(3),i(e),!0;if(e.kind===`ModelValue`)return r(4),i(e.name),!0;if(e.kind===`Set`)return r(5),r(e.elements.length),e.elements.every(a);if(e.kind===`Function`){let t=on(e.domain);return t?(r(7),r(t.low),r(e.range.length),e.range.every(a)):(r(6),r(e.domain.length),e.domain.every(a)&&e.range.every(a))}return!1};return{encode:t=>{let n=e.length;return t.every(a)?(e.count++,!0):(e.length=n,!1)},finish:()=>({words:e.words.slice(0,e.length),strings:t,count:e.count})}},bh=e=>t=>{let n=t.words,r={index:0},i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r.index++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r.index++];if(e===3)return t.strings[n[r.index++]];if(e===4)return Pe(t.strings[n[r.index++]]);if(e===7){let e=n[r.index++],t=n[r.index++],a=Et({kind:`Interval`,low:e,high:e+t-1});return Ie(a,i(t))}let a=n[r.index++];if(e===5)return Fe(i(a));let o=i(a);return Ie(o,i(a))};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{O as A,e as B,Fa as C,U as D,Nn as E,f as F,c as I,m as L,l as M,s as N,De as O,u as P,p as R,Go as S,Fn as T,gm as _,vh as a,hc as b,fh as c,ah as d,xm as f,Tm as g,_m as h,hh as i,oe as j,Te as k,lh as l,wm as m,yh as n,gh as o,Cm as p,ph as r,_h as s,bh as t,oh as u,hm as v,La as w,gc as x,Qd as y,h as z};
|
package/package.json
CHANGED
package/src/live-check.ts
CHANGED
|
@@ -55,8 +55,7 @@ interface Check {
|
|
|
55
55
|
offsets: number[];
|
|
56
56
|
results: { bytes: Uint8Array; length: number };
|
|
57
57
|
initial: number[];
|
|
58
|
-
nodeIds:
|
|
59
|
-
nodesByState: Map<number, number[]>;
|
|
58
|
+
nodeIds: NodeTable;
|
|
60
59
|
isDone: boolean[];
|
|
61
60
|
errorNode: number | undefined;
|
|
62
61
|
}
|
|
@@ -76,6 +75,25 @@ const pushNode = (check: Check, state: number, tableauNode: number) => {
|
|
|
76
75
|
return check.nodeStates.length - 1;
|
|
77
76
|
};
|
|
78
77
|
|
|
78
|
+
// A Map holds at most 2^24 entries, so each tableau node of a state finds its node in an
|
|
79
|
+
// open-addressing table of (state plus one, tableau node, node) triples.
|
|
80
|
+
interface NodeTable {
|
|
81
|
+
slots: Int32Array;
|
|
82
|
+
size: number;
|
|
83
|
+
shift: number;
|
|
84
|
+
}
|
|
85
|
+
|
|
86
|
+
const getNodeSlot = (table: NodeTable, state: number, tableauNode: number) => {
|
|
87
|
+
const mask = table.slots.length / 3 - 1;
|
|
88
|
+
const hash = Math.imul(Math.imul(state, 0x9e3779b1) ^ tableauNode, 0x85ebca6b) >>> table.shift;
|
|
89
|
+
for (let index = hash; ; index = (index + 1) & mask) {
|
|
90
|
+
const slot = index * 3;
|
|
91
|
+
const stored = table.slots[slot];
|
|
92
|
+
if (stored === 0 || (stored === state + 1 && table.slots[slot + 1] === tableauNode))
|
|
93
|
+
return slot;
|
|
94
|
+
}
|
|
95
|
+
};
|
|
96
|
+
|
|
79
97
|
const isWritten = (check: Check, node: number) => check.offsets[node] !== -1;
|
|
80
98
|
|
|
81
99
|
const getStateResult = (check: Check, node: number, position: number) =>
|
|
@@ -124,8 +142,7 @@ export const createLivenessChecker = (
|
|
|
124
142
|
offsets: [],
|
|
125
143
|
results: { bytes: new Uint8Array(1024), length: 0 },
|
|
126
144
|
initial: [],
|
|
127
|
-
nodeIds: new
|
|
128
|
-
nodesByState: new Map(),
|
|
145
|
+
nodeIds: { slots: new Int32Array(3 << 10), size: 0, shift: 22 },
|
|
129
146
|
isDone: [],
|
|
130
147
|
errorNode: undefined,
|
|
131
148
|
}));
|
|
@@ -211,18 +228,35 @@ export const createLivenessChecker = (
|
|
|
211
228
|
model.infinitelyOftenActions.length === 0,
|
|
212
229
|
);
|
|
213
230
|
|
|
214
|
-
const getNodeId = (check: Check, state: number, tableauNode: number) =>
|
|
215
|
-
check.solution.tableau
|
|
216
|
-
|
|
217
|
-
|
|
231
|
+
const getNodeId = (check: Check, state: number, tableauNode: number) => {
|
|
232
|
+
if (!check.solution.tableau) return state;
|
|
233
|
+
const slots = check.nodeIds.slots;
|
|
234
|
+
const slot = getNodeSlot(check.nodeIds, state, tableauNode);
|
|
235
|
+
return slots[slot] === 0 ? undefined : slots[slot + 2];
|
|
236
|
+
};
|
|
218
237
|
const recordNode = (check: Check, state: number, tableauNode: number) => {
|
|
219
238
|
const node = pushNode(check, state, tableauNode);
|
|
220
|
-
|
|
221
|
-
|
|
222
|
-
|
|
223
|
-
|
|
239
|
+
const table = check.nodeIds;
|
|
240
|
+
if (++table.size * 2 > table.slots.length / 3) {
|
|
241
|
+
const old = table.slots;
|
|
242
|
+
table.slots = new Int32Array(old.length * 2);
|
|
243
|
+
table.shift--;
|
|
244
|
+
for (let slot = 0; slot < old.length; slot += 3) {
|
|
245
|
+
if (old[slot] !== 0)
|
|
246
|
+
table.slots.set(
|
|
247
|
+
old.subarray(slot, slot + 3),
|
|
248
|
+
getNodeSlot(table, old[slot] - 1, old[slot + 1]),
|
|
249
|
+
);
|
|
250
|
+
}
|
|
251
|
+
}
|
|
252
|
+
table.slots.set([state + 1, tableauNode, node], getNodeSlot(table, state, tableauNode));
|
|
224
253
|
return node;
|
|
225
254
|
};
|
|
255
|
+
// A state's nodes in the order they were recorded, which is the order of their ids.
|
|
256
|
+
const getStateNodes = (check: Check, tableau: Tableau, state: number) =>
|
|
257
|
+
tableau.nodes
|
|
258
|
+
.flatMap((_, tableauNode) => getNodeId(check, state, tableauNode) ?? [])
|
|
259
|
+
.sort((left, right) => left - right);
|
|
226
260
|
const writeNode = (
|
|
227
261
|
check: Check,
|
|
228
262
|
node: number,
|
|
@@ -346,7 +380,7 @@ export const createLivenessChecker = (
|
|
|
346
380
|
);
|
|
347
381
|
check.isDone[index] = true;
|
|
348
382
|
// TLC expands the nodes recorded before the loop, not the ones the loop records.
|
|
349
|
-
for (const node of (check
|
|
383
|
+
for (const node of getStateNodes(check, tableau, index)) {
|
|
350
384
|
const successors = check.successors[node];
|
|
351
385
|
const actions: Uint8Array[] = [];
|
|
352
386
|
set.forEach((successor, position) => {
|