tla-ts 0.0.10-dev.e3e5dd576 → 0.0.10-dev.e5c8dc315
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/deciders.cjs +1 -1
- package/dist/deciders.js +1 -1
- package/dist/index.cjs +1 -1
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +10 -10
- package/dist/prove.js +57 -57
- package/dist/run.cjs +26 -26
- package/dist/run.js +32 -32
- package/dist/transfer.cjs +94 -94
- package/dist/transfer.js +83 -83
- package/package.json +1 -1
- package/src/ast.ts +16 -0
- package/src/check-trace.ts +43 -42
- package/src/check.ts +2 -1
- package/src/coverage.ts +66 -18
- package/src/environment.ts +34 -30
- package/src/evaluate.ts +57 -39
- package/src/instances.ts +17 -14
- package/src/liveness.ts +4 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +3 -2
- package/src/prover/smt/solver/bit-blast-tactic.ts +1 -1
- package/src/prover/smt/solver/bv1-blast.ts +1 -1
- package/src/prover/smt/solver/card2bv.ts +1 -1
- package/src/prover/smt/solver/ctx-simplify.ts +8 -2
- package/src/prover/smt/solver/diff-neq.ts +8 -6
- package/src/prover/smt/solver/dt2bv-tactic.ts +10 -8
- package/src/prover/smt/solver/elim-uncnstr.ts +26 -20
- package/src/prover/smt/solver/eq2bv-tactic.ts +15 -6
- package/src/prover/smt/solver/fd-solver.ts +1 -1
- package/src/prover/smt/solver/fix-dl-var.ts +1 -1
- package/src/prover/smt/solver/fm-tactic.ts +9 -7
- package/src/prover/smt/solver/fpa2bv-tactic.ts +1 -1
- package/src/prover/smt/solver/lia2pb.ts +1 -1
- package/src/prover/smt/solver/nlqsat.ts +1 -0
- package/src/prover/smt/solver/normalize-bounds.ts +2 -2
- package/src/prover/smt/solver/occf.ts +1 -1
- package/src/prover/smt/solver/pb2bv-tactic.ts +9 -3
- package/src/prover/smt/solver/purify-arith.ts +51 -49
- package/src/prover/smt/solver/reduce-args.ts +2 -2
- package/src/prover/smt/solver/sat/goal2sat.ts +12 -2
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +21 -5
- package/src/prover/smt/solver/sat/sat-tactic.ts +51 -32
- package/src/prover/smt/solver/sat/sat2goal.ts +4 -3
- package/src/prover/smt/solver/smtlib-script.ts +6 -4
- package/src/prover/smt/solver/solver.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +40 -5
- package/src/prover/smt/solver/theory-lra-propagate.ts +1 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +14 -5
- package/src/resolve.ts +54 -28
- package/src/runtime.ts +14 -1
- package/src/sany/generator-proofs.ts +1 -0
- package/src/sany/selectors.ts +1 -0
- package/src/search.ts +3 -1
- package/src/simulate.ts +26 -17
- package/src/spec-description.ts +8 -2
- package/src/subexpressions.ts +138 -45
- package/src/successors.ts +13 -7
- package/src/tlc/replay.ts +80 -3
package/dist/transfer.js
CHANGED
|
@@ -16,64 +16,7 @@ import{$ as e,A as t,B as n,C as r,F as i,G as a,H as o,I as s,J as c,K as l,P a
|
|
|
16
16
|
`),o=n.index,c=a.length,l=n.index-a[a.length-1].length,u=0,d=-1,f=0,p=0,m=()=>{for((d!==l||f>o)&&(d=l,f=l,p=0);f<o;f++)p=Qe(p,e.charCodeAt(f));return Qe(p,e.charCodeAt(o))},h=(e,t,n,i)=>{let a=m();r.push({kind:e,text:t,spelling:i,line:c,column:a,endColumn:a+n-1}),o+=n},g=t=>{for(let n=0;n<t;n++)e.charCodeAt(o)===10&&(c++,l=o+1),o++},_=t=>new s(`${t} at line ${c}, column ${m()}`,void 0,{reason:t,line:c,column:m(),isEnd:o>=e.length});for(;o<e.length;){let n=e.charCodeAt(o);if(n===10||n===32||n===9||n===13){g(1);continue}if(n===92&&e.charCodeAt(o+1)===42){g(Je(e,o,e=>e!==`
|
|
17
17
|
`&&e!==`\r`)-o);continue}if(n===40&&e.charCodeAt(o+1)===42){let t=0;do{if(o>=e.length)throw _(`Unterminated comment`);e.startsWith(`(*`,o)?(t++,g(2)):e.startsWith(`*)`,o)?(t--,g(2)):g(1)}while(t>0);continue}if(n===45&&e.startsWith(`----`,o)){let t=Je(e,o,e=>e===`-`)-o,n=Je(e,o+t,e=>e===` `);e.startsWith(`MODULE`,n)&&u++,h(`Separator`,`----`,t);continue}if(n===61&&e.startsWith(`====`,o)){if(h(`ModuleEnd`,`====`,Je(e,o,e=>e===`=`)-o),u--,u<=0)break;continue}if(n===34){let t=c,n=m(),i=[];for(g(1);e.charCodeAt(o)!==34;){let t=e.charCodeAt(o);if(o>=e.length||t===10||t===13)throw _(`Unterminated string`);if(t===92){let t=e[o+1];if(t===void 0||!`ntrf\\"`.includes(t))throw _(`Invalid escape in string`);i.push(Ze[t]??t),g(2)}else i.push(e[o]),g(1)}g(1),r.push({kind:`String`,text:i.join(``),line:t,column:n,endColumn:m()-1});continue}let a=et(e,o,t);if(a>0){h(`Number`,e.slice(o,o+a),a);continue}if(Be(n,7)){let t=Ve(e,o,7),r=e.slice(o,t),a=Ve(e,o,1);if(a===t){let n=e.charCodeAt(t)===46?Ve(e,t+1,1):t,i=n>t+1,a=i?e.slice(o,n):r;h(i?`Decimal`:`Number`,a,a.length);continue}if(!/[A-Za-z]/.test(r)){let t=n===95?`_`:e.slice(o,a);h(t===`_`?`Operator`:`Number`,t,t.length);continue}if(r.startsWith(`WF_`)||r.startsWith(`SF_`)){h(`Keyword`,r.slice(0,3),3);continue}let s=i.get(r)??r;i.set(s,s),h(je.has(r)?`Keyword`:`Identifier`,s,r.length);continue}let s=e[o];if(n>=128&&Ke.has(s)){h(`Identifier`,i.get(s)??s,1),i.set(s,s);continue}if(n===60){let n=Ye(e,o,t);if(n>0){h(`Step`,e.slice(o,o+n),n);continue}}let l=Ge(e,o);if(l){let t=e.slice(o,o+l.length);h(`Operator`,l.text,l.length,t===l.text?void 0:t)}else throw _(`Unexpected character ${JSON.stringify(s)}`)}let v=m();return r.push({kind:`End`,text:``,line:c,column:v,endColumn:v}),r},nt=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],rt=/* @__PURE__ */ new Set([...nt,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),it=[`TYPE`,`TYPE_CONSTRAINT`],at=/* @__PURE__ */ new Set([...nt,...it]),ot=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],j=e=>{let t=0,n=0;do{if(t>=e.length)return;let r=e.slice(t,t+2),i=r===`(*`?1:r===`*)`?-1:0;n+=i,t+=i===0?1:2}while(n>0);return t},st=e=>{let t=[],n=0,r=1,i=0,a=(n,a)=>{t.push({kind:`Error`,text:ke(r,n-i+1,e[n],a),line:r})},o=e=>{t.push({kind:`Error`,text:ke(r+1,0,void 0,e),line:r})},s=e=>{let t=e.split(`
|
|
18
18
|
`);t.length>1&&(r+=t.length-1,i=n+e.length-t[t.length-1].length),n+=e.length};for(;n<e.length;){let i=e.slice(n),c=/^\s+/.exec(i)?.[0];if(c){s(c);continue}if(i.startsWith(`\\*`)){let e=i.indexOf(`
|
|
19
|
-
`);s(e===-1?i:i.slice(0,e));continue}if(i.startsWith(`(*`)){let e=j(i);if(e===void 0)return s(i),o(``),t;s(i.slice(0,e));continue}let l=r,u=et(e,n),d=u>0?i.slice(0,u):/^\d+(?![A-Za-z_])/.exec(i)?.[0];if(d){t.push({kind:`Number`,text:d,line:l}),s(d);continue}let f=/^[A-Za-z0-9_]+/.exec(i)?.[0];if(f){t.push({kind:`Word`,text:f,line:l}),s(f);continue}if(i.startsWith(`"`)){let r=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(i),c=r?.[0]??`"`;if(r?.[2]!==`"`)return s(c),n===e.length?o(`${c}\n`):a(n,c),t;t.push({kind:`String`,text:c,line:l}),s(c);continue}let p=qe(e,n)??Ge(e,n),m=ot.find(e=>i.startsWith(e));if(m&&m.length>=(p?.length??0))t.push({kind:`Symbol`,text:m,line:l}),s(m);else{if(!p)return a(n,``),t;t.push({kind:`Word`,text:p.text,line:l}),s(e.slice(n,n+p.length))}}return t.push({kind:`End`,text:``,line:r}),t},ct=(e,t)=>new C(`TLC found an error in the configuration file at line ${e}\n${t}`),lt=(e,t)=>ct(e,`The keyword ${t} appeared twice.`),ut=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),dt=/* @__PURE__ */ new Map([[`INVARIANT`,`invariants`],[`INVARIANTS`,`invariants`],[`PROPERTY`,`properties`],[`PROPERTIES`,`properties`],[`CONSTRAINT`,`constraints`],[`CONSTRAINTS`,`constraints`],[`ACTION_CONSTRAINT`,`actionConstraints`],[`ACTION_CONSTRAINTS`,`actionConstraints`],[`POSTCONDITION`,`postconditions`],[`POSTCONDITIONS`,`postconditions`],[`_POSSIBLE`,`possible`]]),ft=(t,n=`master`)=>{let r=n===`1.7.4`?at:rt,i=st(t),a=0,o={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],rawConstants:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},s=!1,c=/* @__PURE__ */ new Set,l=()=>{let e=i[Math.min(a++,i.length-1)];if(e.kind===`Error`)throw new C(`TLC found an error in the configuration file:\n${e.text}`);return e},u=t=>{if(t.kind===`Number`&&t.text.startsWith(`\\`))throw v(new C(`${e(`java.lang.NumberFormatException`)}For input string: "${t.text}"`),b.error);if(t.kind===`Number`)return{kind:`Number`,value:Number(t.text)};if(t.kind===`String`&&t.text.includes(`\\`))throw new C(`TLC found an error in the configuration file:\nescape sequences are not supported in strings at line ${t.line}`);if(t.kind===`String`)return{kind:`String`,value:t.text.slice(1,-1)};if(t.text===`TRUE`||t.text===`FALSE`)return{kind:`Boolean`,value:t.text===`TRUE`};if(t.text===`{`){let e=[],t=l();if(t.text!==`}`)for(;e.push(u(t)),t=l(),t.text===`,`;)t=l();if(t.text!==`}`)throw ct(t.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(t.kind!==`End`)return{kind:`ModelValue`,name:t.text};throw ct(t.line,`It was expecting a value, but did not find it.`)},d=e=>{let t=l();if(t.kind===`End`)throw ct(t.line,`Expected an identifier after ${e}[.`);let n=l();if(n.text!==`]`)throw ct(n.line,`It was expecting ], but did not find it.`);return t.text},f=(e,t)=>{let n=e.text,r=l();for(;r.text===`!`;)n=`${n}!${l().text}`,r=l();if(r.text===`<-`){if(r=l(),r.text===`[`){let e=d(`<-`),t=l();if(t.kind===`End`)throw ct(t.line,`Expected an identifier after <-[mod].`);o.substitutions.push({name:n,target:t.text,module:e});return}if(r.kind===`End`)throw ct(r.line,`Expected an identifier after <-.`);o.substitutions.push({name:n,target:r.text});return}let i=[],a=r.text===`(`;if(a){for(;i.push(u(l())),r=l(),r.text===`,`;);if(r.text!==`)`)throw ct(t,``);r=l()}if(r.text!==`=`)throw ct(r.line,`It was expecting = or <-, but did not find it.`);r=l();let s=r.text===`[`?d(`=`):void 0,c=u(s===void 0?r:l());o.constants.push({name:n,value:c,...a&&{args:i},...s!==void 0&&{module:s}})},p=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;let n=a-1;f(t,e),o.rawConstants.push(i.slice(n,a).map(e=>e.text).join(` `))}},m=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;e.push(t.text)}},h=l();for(;h.kind!==`End`;){let e=h.text,t=h.line,n=r.has(e)?ut.get(e):void 0,i=r.has(e)?dt.get(e):void 0,a=()=>{let n=l();if(n.kind===`End`)throw ct(t,`The keyword ${e} was not followed by an identifier.`);return n};if(n!==void 0){let r=a();if(o[n]!==void 0)throw lt(t,e);o[n]=r.text,h=l()}else if(i!==void 0)h=m(o[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)h=p(t);else if(e===`CHECK_DEADLOCK`){let n=a();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw ct(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(s)throw lt(t,e);s=!0,o.checkDeadlock=n.text===`TRUE`,h=l()}else{if(!r.has(e)||!it.includes(e))throw ct(t,`It was expecting a keyword, but did not find it.`);if(a(),c.has(e))throw lt(t,e);c.add(e),h=l()}}return o},pt=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],mt=e=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return[];case`Apply`:return e.args;case`Lambda`:return[e.body];case`And`:case`Or`:return e.operands;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`If`:return[e.condition,e.consequent,e.alternative];case`Case`:return[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]];case`Let`:return[...e.definitions.flatMap(pt),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`Bracket`:return e.args;case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[]);case`Selection`:return[e.expression]}},ht=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},M=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,gt=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},_t=e=>{let t=gt(e);return t^t>>>16},vt=e=>{let t=[...new Set(e)],n=2**Math.max(4,Math.ceil(Math.log2(t.length/.75)));return t.map((e,t)=>({name:e,index:t,bucket:_t(e)&n-1})).sort((e,t)=>e.bucket-t.bucket||e.index-t.index).map(e=>e.name)},yt={Set:{open:`{ `,close:` }`,pad:` `,separator:`,`,divider:``,dividerPad:``},Sequence:{open:`<< `,close:` >>`,pad:` `,separator:`,`,divider:``,dividerPad:``},Subset:{open:`SUBSET `,close:` `,pad:` `,separator:`,`,divider:``,dividerPad:``},Function:{open:`( `,close:` )`,pad:` `,separator:` @@`,divider:` :>`,dividerPad:` `},Record:{open:`[ `,close:` ]`,pad:` `,separator:`,`,divider:` |->`,dividerPad:` `}},bt=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},xt=e=>e!==void 0&&/^\p{Nd}$/u.test(e),St=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),Ct=e=>{let t=t=>{let n=Je(e,t,bt);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l=t(i);for(;l!==void 0&&e[l]!==a;){let n=o(l);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l=t(i)}if(l!==void 0)return c.last=l,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=Je(e,t,xt);if(e.startsWith(`..`,n)&&xt(e[n+2]))return{kind:`Constant`,first:t,last:Je(e,n+2,xt)-1,children:[]}},a=t=>{let n=e[t];if(n===`"`){let n=e.indexOf(`"`,t+1);return n===-1?void 0:{kind:`Constant`,first:t,last:n,children:[]}}let r=xt(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:Je(e,t+1,xt)-1,children:[]};if(St(n))return{kind:`Constant`,first:t,last:Je(e,t,St)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},N=e=>{let t=e.length===0?void 0:Ct(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=yt[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),g=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||g===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${g}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},wt={general:1e3,stackOverflow:1005,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,unchangedVariableChanged:2143,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,initialStateIncomplete:2106,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,noInitialStates:2118,errorState:2120,behaviorUpToThisPoint:2121,backToState:2122,subscriptUndetermined:2139,subscriptMissingVariable:2140,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,simulating:2188,finished:2186,traceSpecWritten:2501,traceSpecFailed:2502,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,coverageStart:2201,coverageEnd:2202,coverageValue:2221,depthFirstStats:2204,depthFirstLevel:2205,depthFirstProgress:2206,depthFirstInitGenerated:2208,simulationProgress:2209,simulationStats:2210,temporalBranches:2212,statePrint1:2216,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,noInitialStatesInModel:2256,version:2262,depthFirstModelChecking:2271,noSpecificationButProperty:2257,fairnessTautology:2258,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,coverageNext:2772,coverageInit:2773,coverageProperty:2774,coverageValueCost:2775,coverageEndOverhead:2777,coverageConstraint:2778,coverageVariable:2779,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001,moduleOverrideStdout:2e4},Tt={none:0,error:1,warning:3,state:4},Et={0:``,1:`Error: `,3:`Warning: `,4:`State `},Dt=(e,t,n,r)=>e?`@!@!@STARTMSG ${t}:${n} @!@!@\n${r}\n@!@!@ENDMSG ${t} @!@!@`:`${Et[n]}${r}`,Ot=e=>{let t=/* @__PURE__ */ new Set;return{isTool:e.isTool,isDiffTrace:e.isDiffTrace??!1,version:e.version??`master`,print:(n,r,i)=>{let a=r===Tt.warning;if(a&&e.errorCodes?.includes(n))throw new o(n,i);if(a&&e.isWarningEnabled===!1||r!==Tt.error&&e.suppressedCodes?.includes(n))return;let s=a&&!e.isTool&&t.size===0?`
|
|
20
|
-
(Use the -nowarning option to disable this warning.)`:``,c=Dt(e.isTool,n,r,`${i}${s}`);a&&t.has(c)||(a&&t.add(c),console.log(c))}}},kt=`The configuration file did not specify the initial state predicate.
|
|
21
|
-
Can also be caused by trying to run TLC on a specification from
|
|
22
|
-
a module imported with a parameterized INSTANCE statement.`,At=[[1005,S,!1],[1e3,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable%1% %2% undefined).`,!1],[1e3,`Could not find operator: %1% in module: %2%`,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
|
|
23
|
-
%1%`,!0],[2143,`The variable %1% was changed while it is specified as UNCHANGED at
|
|
24
|
-
%2%`,!1],[2144,`The EXCEPT was applied to non-existing fields of the value at
|
|
25
|
-
%1%`,!1],[2145,`TLCGet(%1%) was undefined.`,!0],[2154,`Attempted to apply the operator overridden by the Java method
|
|
26
|
-
%1%,
|
|
27
|
-
but it produced the following error:
|
|
28
|
-
%2%`,!1],[2148,`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable %1% occurring in the state formula v.
|
|
29
|
-
`,!1],[2155,`Attempted to compare %1% with the value
|
|
30
|
-
%2%`,!0],[2158,`Attempted to check if the value:
|
|
31
|
-
%1%
|
|
32
|
-
is an element of %2%.`,!0],[2157,`Attempted to apply TransitiveClosure to a set containing
|
|
33
|
-
the following value:
|
|
34
|
-
%1%`,!0],[2156,`TLC supports at most %1% model values, but model value %2% exceeds this limit.`,!1],[2156,`tla-ts can't recover a model check from the checkpoint in %1%.`,!1],[2165,`Choose can only deal with numbers up to %1%`,!1],[2169,`The %1% argument of %2% should be a %3%, but instead it is:
|
|
35
|
-
%4%`,!0],[2170,`Argument mismatch in operator application.%1%`,!1],[2171,`Parsing or semantic analysis failed.%1%`,!1],[2172,ee,!1],[2176,`Applying %1% to the following value,
|
|
36
|
-
which is not %2%:
|
|
37
|
-
%3%`,!0],[2177,`Attempted to apply BagUnion to the following set, whose
|
|
38
|
-
element is not a bag:
|
|
39
|
-
%1%`,!0],[2178,`Overflow when computing %1%`,!1],[2179,`The second argument of \\div is 0.`,!0],[2180,`0^0 is undefined.`,!0],[2181,`Attempted to compute cardinality of the value
|
|
40
|
-
%1%`,!0],[2182,`Evaluating an expression of the form %1% when s is not a %2%:
|
|
41
|
-
%3%`,!0],[2183,`The %1% argument of %2% must be in the domain of its %3% argument:
|
|
42
|
-
%4%
|
|
43
|
-
, but instead it is
|
|
44
|
-
%5%`,!0],[2184,`Attempted to apply %1% to the empty sequence.`,!0],[2115,`No next state actions defined to generate successor states from.`,!1],[2146,`The invariant %1% is not a state predicate (one with no primes or temporal operators).%2%`,!1],[2213,`TLC cannot handle the temporal formula %1%`,!1],[2214,`Temporal formulas containing actions must be of forms <>[]A or []<>A.`,!1],[2215,`TLC expected a %1% value, but did not find one. %2%`,!1],[2222,`The constant parameter %1% is not assigned a value by the configuration file.`,!1],[2223,`In the configuration file, the identifier %1% appears
|
|
45
|
-
on the right-hand side of a <- after already appearing on the
|
|
46
|
-
left-hand side of one.`,!1],[2224,`The configuration file substitutes for %1% with the undefined identifier %2%.`,!1],[2225,`The configuration file substitutes for %1% with %2% of different number of arguments.`,!1],[2226,`In the configuration file, the identifier %1% does not appear in the specification.`,!1],[2227,`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`,!1],[2228,`TLC requires %1% not to take any argument.`,!1],[2228,`TLC requires %1% not to take any argument, but one was given: %2%`,!1],[2229,`The %1% %2% specified in the configuration file
|
|
47
|
-
is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,kt,!1],[2232,`The configuration file did not specify the next state predicate.`,!1],[2233,`The %1% %2% cannot be a constant.`,!1],[2234,`The operator %1% cannot take any argument.`,!1],[2235,`The operator %1% is not defined in the spec.`,!1],[2236,`The operator %1%, which equals %2%,
|
|
48
|
-
cannot be used as a %3%`,!1],[2237,`The spec is trivially false because %1% is false.`,!1],[2238,`TLC cannot handle subscript %1%`,!1],[2239,`TLC cannot handle this conjunct of the spec:
|
|
49
|
-
%1%`,!1],[2240,`The specification contains more than one conjunct of the form [][Next]_v,
|
|
50
|
-
but TLC can handle only specifications with one next-state relation.`,!1],[2241,`The property %1% is not correctly defined.`,!1],[2242,`The arity of the operator %1% is inconsistent in the configuration file.`,!1],[2244,`TLC can't handle real numbers.
|
|
51
|
-
%1%`,!1],[2245,`In the configuration file, the module name %1% is not a module in the specification.`,!1],[2247,`In computing %1%, TLC expected a %2% expression,
|
|
52
|
-
but instead found %3%.
|
|
53
|
-
%4%`,!1],[2248,`In computing %1%, TLC expected a %2% expression,
|
|
54
|
-
but didn't find one.
|
|
55
|
-
%3%`,!1],[2260,`In computing ENABLED, TLC encountered a temporal formula (%1%).
|
|
56
|
-
%2%`,!1],[2261,`TLC encountered a temporal formula (%1%) when evaluating a predicate or action.
|
|
57
|
-
%2%`,!1],[2265,`TLC can't handle a number this big.
|
|
58
|
-
%1%`,!1],[2266,`The %1% argument of %2% should be an %3%, but instead it is:
|
|
59
|
-
%4%`,!0],[2272,`The formula %1% at %2% is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. To check that action %1% holds in *every* step of the behavior, define a temporal property: Let A be the formula at %2%; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`,!1],[2273,`The formula %1% at %2% is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. To check that action %1% holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at %2% (compare page 90 of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`,!1],[2274,`The formula %1% at %2% is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. To check that infinitely many %1% steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at %2% (compare page 91 of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`,!1],[2280,`In evaluation, the identifier %1% is either undefined or not an operator.
|
|
60
|
-
%2%`,!1],[2281,`The configuration file substitutes constant %1% with non-constant %2%%3%`,!1],[2283,`The argument of %1% should be a %2%, but instead it is:
|
|
61
|
-
%3%`,!0],[5003,`TLC found an error in the configuration file at line %1%
|
|
62
|
-
The keyword %2% was not followed by an identifier.`,!1],[5004,`TLC found an error in the configuration file at line %1%
|
|
63
|
-
The keyword %2% appeared twice.`,!1],[5005,`TLC found an error in the configuration file at line %1%
|
|
64
|
-
Expected an identifier after %2%.`,!1],[5006,`TLC found an error in the configuration file at line %1%
|
|
65
|
-
It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the configuration file:
|
|
66
|
-
%1%`,!1],[5002,`TLC found an error in the configuration file at line %1%
|
|
67
|
-
`,!1],[2250,`A state predicate was evaluated to a non-boolean value.`,!1],[2252,`Encountered an action predicate that's not a boolean.`,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]];let jt;const Mt=()=>jt??=At.map(e=>({pattern:RegExp(`^${e[1].split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e[0],isEvalException:e[2]}})),Nt=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+: ))|\nis an element of a set of \d+-tuples\.$|^In computing ENABLED, TLC encountered a temporal formula \(a (~> b|-\+-> formula)\)\./,Pt=e=>Nt.test(e)?void 0:Mt().find(t=>t.pattern.test(e))?.message,Ft=e=>e instanceof t||Pt(e.message)?.isEvalException===!0,It=/* @__PURE__ */ new Map([[1e3,`
|
|
68
|
-
: `],[2105,`failed.
|
|
69
|
-
`],[2154,`but it produced the following error:
|
|
70
|
-
`],[2171,`Parsing or semantic analysis failed.`],[2213,`:
|
|
71
|
-
`],[2281,` - specifically: `],[2405,`failed.
|
|
72
|
-
`]]),Lt=(e,t,n)=>{let r=n?It.get(e):void 0,i=r===void 0?-1:t.indexOf(r);if(r===void 0||i===-1)return t;let a=i+r.length;return`${t.slice(0,a)}${Rt(t.slice(a),n)}`},Rt=(e,t)=>{let n=t?Pt(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${Tt.none} @!@!@\n${Lt(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},zt=(e,t=2)=>String(e).padStart(t,`0`),Bt=e=>{let t=Math.floor(e/1e3)%60,n=Math.floor(e/6e4)%60,r=Math.floor(e/36e5);return e>864e5?`${Math.floor(r/24)}d ${zt(r%24)}h`:e>36e5?`${zt(r%24)}h ${zt(n)}min`:e>6e4?`${zt(n)}min ${zt(t)}s`:`${zt(t)}s`},Vt=e=>`${e.getFullYear()}-${zt(e.getMonth()+1)}-${zt(e.getDate())} ${zt(e.getHours())}:${zt(e.getMinutes())}:${zt(e.getSeconds())}`,Ht=/* @__PURE__ */ new WeakMap,Ut=(e,t,n)=>{if(!(e instanceof w))return e;let r=v(new w(`${n}\n${e.message}`,e),d(e));return Ht.set(r,{code:t,headline:n,inner:e}),r},Wt=e=>Ht.has(e),Gt=e(`util.WrongInvocationException`),Kt=l.slice(0,l.indexOf(`
|
|
73
|
-
`)),qt=`${l}tlc2.tool.EvalException: `,Jt=`${l}util.Assert$TLCRuntimeException: `,Yt=e=>Ft(e)?qt:Jt,Xt=e=>{try{return e()}catch(e){throw e instanceof w?Ft(e)?new w(`${a}${e.message}`):Pt(e.message)?e:new w(`${l}${e.message}`):e}},Zt=[qt,Jt,l,a],Qt=(e,t)=>{let r=Ht.get(e);if(r)return`${r.headline}\n${Qt(r.inner,t)}`;let i=e.message;if(e instanceof n)return i;let a=Zt.find(e=>i.startsWith(e))??``;return`${a}${Rt(i.slice(a.length),t)}`},$t=(e,t)=>{let r=Ht.get(e),a=e.message;if(r)return{code:r.code,message:a,toolMessage:Qt(e,!0)};if(e instanceof i)return{code:t?wt.stackOverflow:wt.general,message:a,toolMessage:a};if(t&&Ft(e))return{code:Pt(a)?.code??wt.general,message:a,toolMessage:a};let o=t&&!a.startsWith(Kt)&&!(e instanceof n),s=e instanceof u?Gt:l,c=o?s:``;return{code:wt.general,message:`${c}${a}`,toolMessage:`${c}${Qt(e,!0)}`}},en=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,tn=2147483647,nn=1e6;let rn=nn;const an=()=>rn,on=()=>Math.max(rn,10),sn=()=>`Attempted to construct a set with too many elements (>${rn}).`,cn=(e,t)=>{if(e.length===on())throw new u(sn());e.push(t)},ln=e=>typeof e==`object`&&e.kind===`Interval`&&e.high-e.low>=on(),un=(e,t)=>{if(Array.isArray(e))return e.forEach(t);for(let n=e.low;n<=e.high;n++)t(n)},dn=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,fn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),pn=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),mn=e=>typeof e==`object`&&e.kind===`ModelValue`,hn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),gn=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:dn(e)?`set`:`function`,_n=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648;let vn=!1;const yn=(e,t)=>(vn=!0,e.writtenKeys=t,e),bn=e=>(e.hash!==0||e.fingerprint!==0?void 0:e.writtenKeys)??e.domain,xn=e=>bn(e).map(t=>[t,e.range[e.domain.indexOf(t)]]),Sn=e=>e.domain.every(e=>typeof e==`number`)?e.domain.map((t,n)=>[t,e.range[n]]):xn(e),Cn=(e,t,n,r)=>yn(hi(e,t.map(e=>n[e])),r),wn=e=>{if(!(typeof e!=`object`||e.kind!==`Function`&&e.kind!==`Set`)&&e.hash===0&&e.fingerprint===0){if(e.kind===`Set`)return e.elements.forEach(wn);e.writtenKeys=void 0,e.range.forEach(wn)}},Tn=e=>{vn&&typeof e==`object`&&e.kind===`Function`&&(e.writtenKeys=void 0)},En=e=>e.every(e=>typeof e==`string`),Dn=(e,t)=>e.length>0&&t.length>0&&En(e)!==En(t),On=(e,t)=>{vn&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Dn(n,r)?Rr(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=er(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=i[e],n=a[e],r=typeof t==`number`&&typeof n==`number`?t-n:er(t,n);if(r!==0)return r}return 0},kn=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=er(n[e],r[e]);if(t!==0)return t}return 0},An=e=>mn(e)?e.type:void 0,jn=(e,t,n)=>{let r=An(e),i=An(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(mn(e)&&mn(t)){if(r===void 0||i===void 0||r===i)return;throw new w(`Attempted to ${a} the differently-typed model values ${N(L(e))} and ${N(L(t))}`)}throw r===void 0?new w(`Attempted to ${a} the typed model value ${N(L(t))} and the non-model value\n${N(L(e))}`):new w(`Attempted to ${a}${n?``:` the`} typed model value ${N(L(e))} and non-model value\n${N(L(t))}`)},Mn=()=>({ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0}),Nn=Mn(),Pn=e=>{Object.assign(Nn,Mn()),tr.clear();for(let t of e)Wn(t)},Fn=()=>{Nn.searchRank=Nn.size},In=()=>Nn.unorderedString;let Ln=!1;const Rn={isExpanded:!0,isViewPrinted:!1},zn=e=>{Ln=e.version===`1.7.4`,rn=e.maxSetSize??nn,Rn.isExpanded=e.isLazyValueExpanded??!0,Rn.isViewPrinted=e.isViewPrinted??!1},Bn=/* @__PURE__ */ new WeakMap,Vn=(e,t)=>(Rn.isViewPrinted&&Bn.set(e,t),e),Hn=/* @__PURE__ */ new WeakMap,Un=(e,t)=>(Hn.set(e,t),e),Wn=e=>(Nn.ranks[e]===void 0&&(Nn.ranks[e]=Nn.size++),e),Gn=e=>Nn.ranks[Wn(e)],Kn=(e,t)=>{if(e===t)return 0;let n=Nn.ranks,r=n[e],i=n[t],a=Nn.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&(Nn.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},qn=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Jn=(e,t)=>(qn(e)||qn(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Yn=(e,t)=>new w(qn(e)?`Attempted to compare overridden value ${N(L(e,!0))} with non-overridden value:\n${N(L(t))}`:`Attempted to compare ${gn(e)} ${L(e)} with ${gn(t)} ${L(t)}`),Xn=(e,n,r)=>{if(!qn(e))throw new w(`Attempted to ${r} the set ${N(L(P(e)?F(e):e,!0))} with the value:\n${N(L(n,!0))}`);if(!qn(n))throw Yn(e,n);let i=e.kind===`InfiniteSet`?e.name:void 0,a=n.kind===`InfiniteSet`?n.name:void 0;if(i!==void 0&&i===a)return 0;if(i===`Nat`&&a===`Int`||i===`Int`&&a===`Nat`)return i===`Nat`?-1:1;throw new t(`Attempted to compare ${N(L(e,!0))} with the value\n${N(L(n,!0))}`)},Zn={kind:`InfiniteSet`,name:`Any`},Qn=e=>{throw new t(`Attempted to compare ANY with the value\n${N(L(e))}`)},$n=e=>{vn&&wn(e),e===Zn&&Qn(e),typeof e==`object`&&e.kind===`LazyFunction`&&I(e)},er=(e,t)=>{if(e===t)return $n(e),0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return On(e,t);if(n===`Set`&&r===`Set`)return kn(e,t);if(n===`Interval`&&r===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.max(0,t.high-t.low+1);return n!==r||n===0?n-r:e.low-t.low}if(n===`ModelValue`&&r===`ModelValue`)return e.type!==void 0&&t.type!==void 0&&jn(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return jn(e,t,!1),n===`ModelValue`?-1:1;if(e===Zn||t===Zn)return Qn(e===Zn?t:e);if(dn(e)&&dn(t)&&Jn(e,t))return Xn(e,t,`compare`);let i=dn(e);if(i!==dn(t))throw Yn(e,t);if(n===`Interval`&&r===`Set`){let n=zi(e)-t.elements.length;if(n!==0)return n}if(n===`Set`&&r===`Interval`){let n=e.elements.length-zi(t);if(n!==0)return n}return i?kn(F(e),F(t)):On(I(e),I(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Kn(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(jn(e,t,!1),mn(e))return-1;if(mn(t))return 1;throw Yn(e,t)},tr=/* @__PURE__ */ new Map,nr=32768,rr=e=>{let t=tr.get(e);if(t)return t;if(tr.size===nr)throw new f(`TLC supports at most ${nr} model values, but model value ${e} exceeds this limit.`);let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:Gn(e),hash:va(ya(ba(e),109)),fingerprint:ka(Aa(e)^60)};return tr.set(e,n),n},ir=()=>[...tr.values()],ar=e=>({kind:`Set`,elements:e,writtenElements:void 0,isNormalized:!1,hash:0,fingerprint:0,isFingerprinted:!1}),or=e=>{let t=ar(e);return t.isNormalized=!0,t},sr=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,lambdaDomain:void 0,isFingerprinted:!1});let cr=!1;const lr=(e,t)=>(t===`lambda`&&(cr=!0),t!==void 0&&(e.functionClass=t),e),ur=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,dr=e=>lr(e,`lambda`),fr=e=>en(e)&&e.isCached===!0;let pr=!1;const mr=e=>(pr=!0,e),hr=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),gr=e=>{pr&&typeof e==`object`&&en(e)&&hr.has(e.kind)&&(e.isCached=!0)},_r=e=>{(cr||pr)&&typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&(e.isFingerprinted||(e.isFingerprinted=!0,e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(_r),e.range.forEach(_r)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(_r):dn(e)&&P(e)&&(gr(e),F(e).elements.forEach(_r))))},vr=(e,t)=>{if(gr(e),e===t)return $n(e),!0;if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&jn(e,t,!0),er(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return On(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return kn(e,t)===0;if(e.kind===`Interval`&&t.kind===`Set`&&zi(e)!==t.elements.length||e.kind===`Set`&&t.kind===`Interval`&&e.elements.length!==zi(t))return!1;if(mn(e)||mn(t))return e.kind===`LazyFunction`&&I(e),jn(e,t,!0),mn(e)&&mn(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return vr(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=Ii(e.domain),r=Ii(t.domain);if(n||r)return n===r;let i=Ii(e.range),a=Ii(t.range);return i||a?i===a:vr(e.domain,t.domain)&&vr(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(Ii(e))return Ii(t);if(Ii(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&vr(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return Ii(e)?Ii(t):!Ii(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>vr(e,t.factors[n]));let n=dn(e)&&dn(t)&&!(P(e)&&P(t));if(n&&Jn(e,t))return Xn(e,t,`check equality of`)===0;if(n){if(!qn(e)){let n=F(e);if(!qn(t))return kn(n,F(t))===0}return Fa(e)===Fa(t)}return er(e,t)===0},yr=e=>{let t=(e,t)=>{if(e===t)return!0;if(e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(!n(e[r],t[r]))return!1;return!0},n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):Fa(n)===Fa(r);return n},br=yr(!1),xr=yr(!0),Sr=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},Cr=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Oa(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||xr(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||xr(i[e],n))return i[e]}return n.kind===`Set`?Sr(n.elements,t):(Sr(n.domain,t),Sr(n.range,t)),i===void 0?e.set(r,n):Array.isArray(i)?i.push(n):e.set(r,[i,n]),n};return e=>{for(let n=0;n<e.length;n++)e[n]=t(e[n]);return e}},wr=(e,t)=>t.length===0||ur(e)===`tuple`?1:ha(t)?.low,Tr=e=>{if(!pn(e))return;let t=I(e);return{domain:t.domain,range:t.range,low:wr(e,t.domain)}},Er=e=>{if(!pn(e))return;let t=I(e);return En(t.domain)?t:void 0},Dr=(e,t,n)=>(jn(t,e,n),1),Or={number:{name:`integer`,other:`non-integer`,equality:`check equality of`},string:{name:`string`,other:`non-string`,equality:`check equality of`},boolean:{name:`boolean`,other:`non-boolean`,equality:`compare equality of`}},kr=(e,t,n)=>{let r=Or[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${N(L(e))} with ${r.other}:\n${N(L(t))}`},Ar=e=>e?`check equality of`:`compare`,jr=(e,t,n,r)=>{let i=Tr(n);if(!i){if(mn(n))return Dr(n,t,r);throw new w(`Attempted to ${Ar(r)} the function ${N(L(t))} with the value:\n${N(L(n))}`)}if(e.range.length!==i.range.length)return e.range.length-i.range.length;let a=()=>Mr(e.range,i.range,r);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&i.low!==void 0)return e.low===i.low?a():e.low-i.low;let o=e.low??i.low;if(o===void 0)return Mr(e.domain,i.domain,r)||a();let s=e.low===void 0?e.domain:i.domain;for(let t=0;t<s.length;t++){let n=s[t];if(typeof n!=`number`)throw new w(`Attempted to compare ${r?`an `:``}integer with non-integer${r||e.low!==void 0?`:`:``}\n${N(L(n))}.`);let i=e.low===void 0?n-(o+t):o+t-n;if(i!==0)return i}return a()},Mr=(e,t,n)=>{for(let r=0;r<e.length;r++){let i=Lr(e[r],t[r],n);if(i!==0)return i}return 0},Nr=(e,t,n)=>{let r=I(e);if(ur(e)===`tuple`){let i=pn(t)?Wi(t):void 0;return i?r.range.length-i.length||Mr(r.range,i,n):jr({...r,low:1},e,t,n)}if(ur(e)===`record`){let i=Er(t);if(!i){if(mn(t))return Dr(t,e,n);throw new w(`Attempted to ${Ar(n)} record:\n${N(L(e))}\nwith non-record\n${N(L(t))}`)}return r.domain.length-i.domain.length||Mr(r.domain,i.domain,n)||Mr(r.range,i.range,n)}return jr({...r,low:wr(e,r.domain)},e,t,n)},Pr=(e,t)=>qn(e)||qn(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),Fr=(e,t)=>{let n=hn(t)?t:F(t);return{elements:F(e).elements,otherElements:F(n).elements}},Ir=(e,t,n)=>{if(Pr(e,t))return n?+!vr(e,t):er(e,t);if(!hn(e))return Ir(F(e),t,n);if(!dn(t)){if(mn(t))return Dr(t,e,n);throw new w(`Attempted to ${Ar(n)} the set ${N(L(e))} with the value:\n${N(L(t))}`)}let r=Fr(e,t);return r.elements.length-r.otherElements.length||Mr(r.elements,r.otherElements,n)},Lr=(e,t,n)=>{if(typeof e!=`object`){if(typeof t==typeof e)return n?e===t?0:1:er(e,t);if(mn(t))return Dr(t,e,n);throw new w(kr(e,t,n))}return e.kind===`ModelValue`?(e.type!==void 0&&jn(e,t,n),mn(t)?n?e.name===t.name?0:1:e.rank-t.rank:-1):pn(e)?Nr(e,t,n):Ir(e,t,n)},Rr=(e,t)=>Lr(e,t,!1),zr=(e,t)=>Lr(e,t,!0)===0,Br=e=>{let t=[];for(let n of e){let e=Hr(n,t);e.isFound||t.splice(e.index,0,n)}return t},Vr=(e,t)=>{let n=Ki.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},Hr=(e,t)=>{let n=0,r=t.length;for(;n<r;){let i=n+(r-n>>1),a=Vr(e,()=>Rr(e,t[i]));if(a===0)return{index:i,isFound:!0};a<0?r=i:n=i+1}return{index:n,isFound:!1}},Ur=(e,t)=>t.some(t=>Vr(t,()=>zr(t,e))),Wr=e=>e.kind===`MixedSet`||e.isNormalized?e.elements:e.writtenElements??e.elements,Gr=e=>{typeof e==`object`&&(e.kind===`Set`&&(e.isNormalized=!0,e.elements.forEach(Gr)),e.kind===`Function`&&(e.writtenKeys=void 0,e.domain.forEach(Gr),e.range.forEach(Gr)))},Kr=e=>{if(!(typeof e!=`object`||fr(e)))switch(e.kind){case`Set`:e.isNormalized=!0;return;case`MixedSet`:F(e);return;case`FilteredSet`:case`Subset`:return Kr(e.base);case`SetOperation`:return e.operator===`\\cup`?void 0:(Kr(e.left),Kr(e.right));case`FunctionSet`:return Kr(e.domain),Kr(e.range);case`RecordSet`:return e.sets.forEach(Kr);case`ProductSet`:return e.factors.forEach(Kr)}},qr=(e,t)=>qi(vr,zr,e,t),Jr=e=>{for(let t=1;t<e.length;t++)if(er(e[t-1],e[t])>=0)return!1;return!0},Yr=e=>{for(let t=0;t<e.length;t++){let n=e[t],r=t>0?e[t-1]:void 0;if(typeof n!=`number`||typeof r==`number`&&r>=n)return!1}return!0},Xr=e=>{for(let t=1;t<e.length;t++)gr(e[t]);if(e.length<2||Jr(e))return ar(e);let t=[...e].sort(er),n=[t[0]];for(let e=1;e<t.length;e++)er(n[n.length-1],t[e])!==0&&n.push(t[e]);return ar(n)},Zr=e=>{if(Yr(e))return ar(e);let t=qi(Xr,e=>({kind:`MixedSet`,elements:e}),e,void 0);return t.kind===`Set`&&t.elements!==e&&(t.writtenElements=e),t},Qr=ar([]),$r=(e,t)=>{if(e.elements.length===0||t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&er(r[a],t)<0;)a++;a<r.length&&er(r[a],t)===0||i.push(t)}return i.length===n.length?e:ar(i)},ei=(e,t)=>{let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&er(r[a],t)<0;)a++;a<r.length&&er(r[a],t)===0&&i.push(t)}return i.length===n.length?e:ar(i)},ti=(e,t)=>{if(e.elements.length===0)return t;if(t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=[],o=0,s=0;for(;o<n.length&&s<r.length;){let e=er(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=ar(i);if(e.hash!==0&&e.hash!==Ca){let t=e.hash,n=0;for(;n<a.length;n++){let e=Oa(a[n]);if(e===Ca)break;t=t+xa(e)|0}n===a.length&&(c.hash=t)}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+ja(a[e])|0;c.fingerprint=t}return c},ni=e=>{let t=e.length<2?e:[...e].sort((e,t)=>er(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&er(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return sr(n,r)},ri=e=>{let t=ni(e);return t.domain.length!==e.length||e.every((e,n)=>e[0]===t.domain[n])?t:yn(t,e.map(e=>e[0]))},ii=[],ai=/* @__PURE__ */ new Map,oi=[],si=/* @__PURE__ */ new WeakMap,ci=e=>{let t=ii[e]??ai.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?ai.set(e,new WeakRef(n)):ii[e]=n,n},li=e=>{if(zi(e),e.low===1&&e.high>=1)return ci(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},ui=e=>e.length>0&&(e===ii[e.length]||e===ai.get(e.length)?.deref())||si.has(e),di=e=>{let t=F(e).elements;return ui(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},fi=e=>{let t=oi[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return oi[e]=n,n},pi=e=>lr(sr(ci(e.length),e),`tuple`),mi=e=>lr(ni(e),`record`),hi=(e,t)=>lr(sr(e,t),`record`),gi=e=>dn(e)&&!qn(e),_i=(e,t=!1)=>`UNION(${L(e.base,t)})`,vi=(e,t=e=>F(e).elements)=>{if(!gi(e.base))throw new w(`Attempted to enumerate the nonenumerable set:\n${_i(e)}`);return t(e.base)},yi=(e,t,n)=>{if(gi(e))return e;throw new w(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${N(L(e))}\nwhen enumerating:\n${N(_i(n))}`)},P=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return P(e.base);case`FunctionSet`:return P(e.domain)&&P(e.range)||bi(e.domain)===!0||bi(e)===!0;case`RecordSet`:return e.sets.every(P)||bi(e)===!0;case`ProductSet`:return e.factors.every(P)||bi(e)===!0;case`Union`:return P(e.base)&&(hn(e.base)?Wr(e.base):ji(e.base)).every(P);case`SetOperation`:return e.operator===`\\cup`?P(e.left)&&P(e.right):e.operator===`\\cap`?P(e.left)||P(e.right):P(e.left);default:return!1}},bi=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:return e.name===`Any`&&void 0;case`Subset`:case`SequenceSet`:return!1;case`FunctionSet`:{let t=bi(e.domain);return t===void 0?void 0:!t&&bi(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=bi(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return P(e)?F(e).elements.length===0:void 0;default:return}},xi=e=>{let t=e.reduce((e,t)=>e*t.length,1),n=[],r=e.map(()=>0);for(let i=0;i<t;i++){n.push(e.map((e,t)=>e[r[t]]));for(let t=e.length-1;t>=0&&(r[t]++,!(r[t]<e[t].length));t--)r[t]=0}return n},Si=(e,t)=>{for(let n=e.length-1;n>=0;n--)if(e[n]<t-e.length+n){e[n]++;for(let t=n+1;t<e.length;t++)e[t]=e[t-1]+1;return!0}return!1},Ci=e=>{if(typeof e!=`object`||e.kind!==`Subset`||qn(e.base))return;let t=F(e.base).elements;if(t.length<=20)return;let n=-1,r=[0],i=e=>{for(e<=n&&(n=-1);n<e;)n===-1?r=[]:Si(r,t.length)||(r=Array.from({length:r.length+1},(e,t)=>t)),n++;return ar(r.map(e=>t[e]))},a=2**t.length,o=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<a;return new Proxy([],{get:(e,t,n)=>t===`length`?a:o(t)?i(Number(t)):Reflect.get(e,t,n),has:(e,t)=>o(t)||Reflect.has(e,t)})},wi=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(ar(r.map(t=>e[t])));while(Si(r,e.length))}return t},Ti=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(qn(a))throw new w(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},Ei=(e,t=e=>F(e).elements)=>{if(typeof e!=`object`)throw new w(`Expected a set but found ${L(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return Br(e.elements);case`Interval`:{let t=li(e);return t!==ii[t.length]&&si.set(t,e),t}case`Subset`:{if(zi(e.base)===0)return wi([]);if(!dn(e.base))throw new w(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${N(L(e.base))}`);let t=F(e.base).elements;if(t.length>30)throw new w(Ri(e));return wi(t)}case`FunctionSet`:{if(!Ln&&Ii(e))return[];if(qn(e.domain))throw new w(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${N(L(e.domain))}\ncannot be enumerated.`);let n=di(e.domain);if((n.length>0||Ln)&&qn(e.range))throw new w(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${N(L(e.range))}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return xi(n.map(()=>r)).map(e=>sr(n,e))}case`RecordSet`:{if(!Ln&&Ii(e))return[];let n=Ti(e.sets,t,(t,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${N(L(t))}`);return xi(n).map(t=>mi(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!Ln&&Ii(e))return[];let n=Ti(e.factors,t,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${N(L(e))}`);return xi(n).map(pi)}case`FilteredSet`:if(!dn(e.base)||qn(e.base))throw new w(`Attempted to enumerate { x \\in S : p(x) } when S:\n${N(L(e.base))}\nis not enumerable`);return F(Zr(ji(e.base).filter(e.startPass?.(!0)??(t=>e.test(t,!1))))).elements;case`Union`:{let t=[];return vi(e).forEach((n,r)=>{let i=yi(n,r,e);if(ln(i))throw new u(sn());ji(i).forEach(e=>cn(t,e))}),F(Zr(t)).elements}case`SetOperation`:{if(e.operator===`\\cap`&&!gi(e.left)&&!gi(e.right))throw new w(`Attempted to enumerate S \\cap T when neither S:\n${N(L(e.left))}\nnor T:\n${N(L(e.right))}\nis enumerable`);if(e.operator===`\\`&&!gi(e.left))throw new w(`Attempted to enumerate S \\ T when S:\n${N(L(e.left))}\nis not enumerable.`);if(e.operator===`\\cup`)return F(Zr(Oi(e))).elements;let t=e.operator===`\\`||gi(e.left),n=t?e.left:e.right,r=t?e.right:e.left,i=[];return un(typeof n==`object`&&n.kind===`Interval`?n:ji(n),t=>{Yi(t,r)===(e.operator===`\\cap`)&&cn(i,t)}),F(Zr(i)).elements}case`InfiniteSet`:case`SequenceSet`:throw new w(`Attempted to enumerate the non-enumerable set ${L(e)}`);default:throw new w(`Expected a set but found ${L(e)}`)}},F=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return ar(Ei(e));let t=typeof e==`object`&&en(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=Ki.sets;n?.push(e);let r=Ei(e);n?.pop();let i=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?ar(r):Xr(r);return t&&(t.enumerated=i),i},Di=e=>{if(!(typeof e!=`object`||fr(e)))switch(e.kind){case`MixedSet`:F(e);return;case`FilteredSet`:return gi(e.base)||F(e),Di(e.base);case`Union`:if(!hn(e.base)&&gi(e.base))return Di(e.base);vi(e).slice(0,1).forEach(t=>Di(yi(t,0,e)));return;case`SetOperation`:e.operator===`\\`&&!gi(e.left)&&F(e),e.operator!==`\\cup`||gi(e.left)&&gi(e.right)||F(e),e.operator!==`\\cap`||gi(e.left)?Di(e.left):Di(e.right),e.operator===`\\cup`&&Di(e.right)}},Oi=e=>{if(!gi(e.left)||!gi(e.right))throw new w(`Attempted to enumerate S \\cup T when S:\n${N(L(e.left))}\nand T:\n${N(L(e.right))}\nare not both enumerable`);if(Di(e.left),Di(e.right),ln(e.left))throw new u(sn());let t=ji(e.left),n=ln(e.right)?void 0:ji(e.right);if(!n||t.length+n.length>on())throw new u(sn());return[...t,...n]},ki=e=>{if(typeof e!=`object`||e.kind!==`SetOperation`||e.operator!==`\\cup`||e.enumerated)return F(e).elements;let t=Vr(e,()=>Oi(e)),n=F(Zr(t)).elements;return e.enumerated=ar(n),n},Ai=(e,t)=>{if(typeof e!=`object`||fr(e))return F(e).elements.some(t);let n=Ki.sets;n?.push(e),Di(e);let r=Fi(e,r=>{n?.pop();let i=t(r);return n?.push(e),i});return n?.pop(),r},ji=e=>{let t=[];return Ai(e,e=>(t.push(e),!1)),t},Mi=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,Ni=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(Ni);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(Ni)&&e.range.every(Ni);case`SetOperation`:return e.operator!==`\\cup`&&Ni(e.left)&&Ni(e.right);case`FilteredSet`:return Ni(e.base);case`ProductSet`:return e.factors.every(Ni);default:return!1}},Pi=e=>typeof e!=`object`||fr(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?Pi(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||Pi(e.left)||Pi(e.right):Mi(e)?.some(Pi)??!1,Fi=(e,t)=>{if(e.kind===`Union`)return vi(e,ji).some((n,r)=>Ai(yi(n,r,e),t));if(e.kind===`FilteredSet`&&gi(e.base)){let n=e.startPass?.(!1);return n?Ai(e.base,e=>n(e)&&t(e)):Ai(e.base,n=>e.test(n,!1)&&t(n))}if(Mi(e)?.some(Pi))return Ei(e,ji).some(t);if(e.kind!==`SetOperation`)return F(e).elements.some(t);if(e.operator===`\\cup`)return!gi(e.left)||!gi(e.right)?F(e).elements.some(t):Ai(e.left,t)||Ai(e.right,t);let n=e.operator===`\\`||gi(e.left),r=n?e.left:e.right,i=n?e.right:e.left;return gi(r)?Ai(r,n=>Yi(n,i)===(e.operator===`\\cap`)&&t(n)):F(e).elements.some(t)},Ii=e=>{if(typeof e!=`object`||!dn(e))throw Ki.sets?.push(e),new w(`Shouldn't call isEmpty() on value ${L(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new w(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(Ii);case`RecordSet`:return e.sets.some(Ii);case`FunctionSet`:return!Ii(e.domain)&&Ii(e.range);case`Union`:return vi(e).every((t,n)=>Ii(yi(t,n,e)));default:return F(e).elements.length===0}},Li=(e,t,n)=>e.reduce((e,r)=>{let i=e*zi(r,t);if(i>2147483647)throw new w(n());return i},1),Ri=e=>`Overflow when computing the number of elements in:\n${N(L(e))}`,zi=(e,t)=>{if(typeof e!=`object`)throw new w(`Attempted to compute the number of elements in the ${gn(e)} ${N(L(e))}.`);switch(e.kind){case`ModelValue`:throw new w(`Attempted to compute the number of elements in the model value ${N(L(e))}.`);case`Function`:return e.domain.length;case`LazyFunction`:return zi(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new w(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new w(`Attempted to compute the number of elements in the overridden value ${N(L(e))}.`);case`Subset`:{let n=zi(e.base,t);if(n>=31)throw new w(Ri(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(Ii(e.domain))return 1;if(Ii(e.range))return 0;if(zi(e.range,t)===1)return 1}let n=zi(e.domain,t),r=zi(e.range,t);if(r<=1)return n===0?1:r;let i=1;for(let t=0;t<n;t++)if(i*=r,i>2147483647)throw new w(Ri(e));return i}case`RecordSet`:return t!==`1.7.4`&&Ii(e)?0:Li(e.sets,t,()=>Ri(e));case`ProductSet`:return t!==`1.7.4`&&Ii(e)?0:Li(e.factors,t,()=>`Overflow when computing the number of elements in ${N(L(e))}`);default:return gr(e),F(e).elements.length}},Bi=e=>`Attempted to check if the set ${N(L(e))}is finite.`,Vi=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new w(`Attempted to check if the ${gn(e)} ${N(L(e))} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new w(`Attempted to check if the function:\n${N(L(e))}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return Vi(e.base)&&Ii(e.base);case`Subset`:return Vi(e.base);case`FunctionSet`:{let t=Vi(e.domain);if(t&&Ii(e.domain))return!0;let n=Vi(e.range);return n&&Ii(e.range)?!0:n&&(t||zi(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n=!0;for(let e of t)if(!Vi(e))n=!1;else if(Ii(e))return!0;return n}case`Union`:if(!gi(e.base))throw new w(`Attempted to check if the nonenumerable set:\n${_i(e)}\nis a finite set.`);return F(e.base).elements.every(Vi);case`SetOperation`:if(e.operator===`\\cup`)return Vi(e.left)&&Vi(e.right);if(e.operator===`\\cap`){if(!Vi(e.left)&&!Vi(e.right))throw new w(Bi(e));return!0}if(Vi(e.left))return!0;if(!Vi(e.right))throw new w(Bi(e));return!1;case`FilteredSet`:if(!Vi(e.base))throw new w(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${N(L(e.base))}\nis finite.`);return!0}},Hi=(e,t,n=er)=>{let r=0,i=e.length-1;for(;r<=i;){let a=r+i>>1,o=n(e[a],t);if(o===0)return a;o<0?r=a+1:i=a-1}return-1},Ui=(e,t)=>{let n=e.elements;if(n.length>on())throw new u(sn());let r=Array.from({length:n.length},()=>!1),i=t.filter(e=>{let t=Hi(n,e);return!r[t]&&(r[t]=!0,!0)}),a=ar(n);return i.some((e,t)=>e!==n[t])&&(a.writtenElements=i),a},Wi=e=>{if(typeof e!=`object`||!pn(e))return;if(e.kind===`LazyFunction`&&(!dn(e.domain)||qn(e.domain)))throw new w(`To convert a function of form [x \\in S |-> f(x)] to a tuple, the set S must be enumerable.`);let t=I(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Gi=(e,t)=>{let n=`Attempted to check if the value:\n${N(L(e))}\nis an element of the`;if(!pn(t))return`${n} ${gn(t)} ${N(L(t))}`;let r=ur(t);return r===`record`?`Attempted to check if element:\n${N(L(e))}\nis in the record:\n${N(L(t))}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${N(L(t))}`},Ki={sets:void 0},qi=(e,t,n,r)=>{let i=Ki.sets,a=Ki.callStack,o=i?.length??0,s=a&&{...a,length:a.expressions.length};try{return e(n,r)}catch(e){if(!(e instanceof w))throw e;return i&&(i.length=o),a&&s&&(a.expressions.length=s.length,a.isFrozen=s.isFrozen,a.fingerprint=s.fingerprint),t(n,r,e)}},Ji=e=>(Ki.sets??[]).slice(e).some(e=>typeof e==`object`&&Ki.callStack?.sources.has(e)===!0),Yi=(e,t)=>{let n=Ki.sets;if(n===void 0)return ea(e,t);n.push(t);let r=ea(e,t);return n.pop(),r},Xi=(e,t)=>{let n=t.elements,r=0,i=n.length-1;for(;r<=i;){let t=r+i>>1,a=n[t];if(typeof a!=`number`)return;if(a===e)return!0;a<e?r=t+1:i=t-1}return!1},Zi=(e,t)=>Hi(t.elements,e)!==-1,Qi=(e,t)=>t.isNormalized?Hr(e,t.elements).isFound:Ur(e,Wr(t)),$i=(e,t)=>{if(e.type!==void 0)throw new w(`Attempted to check if the typed model value ${N(L(e))} is an element of\n${N(L(t))}`);return!1},ea=(e,t)=>{if(typeof e==`number`&&typeof t==`object`){if(t.kind===`Set`)return Xi(e,t)??ta(e,t);if(t.kind===`Interval`)return e>=t.low&&e<=t.high}return ta(e,t)},ta=(e,n)=>{if(!dn(n))throw new w(Gi(e,n));switch(n.kind){case`Set`:return gr(e),qi(Zi,Qi,e,n);case`MixedSet`:return Ur(e,n.elements);case`Interval`:if(typeof e==`number`)return e>=n.low&&e<=n.high;if(n.low<=n.high&&(!mn(e)||e.type!==void 0))throw new w(`Attempted to check if the value:\n${N(L(e))}\nis in the integer interval ${N(L(n))}`);return!1;case`InfiniteSet`:if(n.name===`Any`)return!0;if(mn(e))return $i(e,n);if(!(n.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new t(`Attempted to check if the value:\n${N(L(e))}\nis an element of ${n.name}.`);return n.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!dn(e)||qn(e))throw new w(`Attempted to check if the non-enumerable value\n${N(L(e))}\nis element of\n${N(L(n))}`);return F(e).elements.every(e=>Yi(e,n.base));case`FunctionSet`:{if(!pn(e)){if(mn(e))return $i(e,n);throw new w(`Attempted to check if \n${L(e)}\nwhich is not a TLC function value, is in the set of functions:\n${N(L(n))}`)}Tn(e);let t=I(e),r=wr(e,t.domain);return(r===void 0?qr(n.domain,ar(t.domain)):qr({kind:`Interval`,low:r,high:r+t.domain.length-1},n.domain))&&t.range.every(e=>Yi(e,n.range))}case`RecordSet`:{Tn(e);let t=pn(e)?I(e):void 0;if(!t||!En(t.domain)){if(mn(e))return $i(e,n);throw new w(`Attempted to check if non-record\n${L(e)}\nis in the set of records:\n${N(L(n))}`)}return t.domain.length===n.names.length&&n.names.every((e,r)=>{let i=Hi(t.domain,e);return i!==-1&&Yi(t.range[i],n.sets[r])})}case`ProductSet`:{let t=pn(e)?Wi(e):void 0;if(t===void 0){let t=pn(e)&&I(e).domain.every(e=>typeof e==`number`);if(mn(e))return $i(e,n);if(t)return!1;throw new w(`Attempted to check if non-tuple\n${N(L(e))}\nis in the set of tuples:\n${N(L(n))}`)}return t.length===n.factors.length&&t.every((e,t)=>Yi(e,n.factors[t]))}case`FilteredSet`:try{return Yi(e,n.base)&&n.test(e,!0)}catch(t){throw!(t instanceof w)||!Ft(t)?t:new w(`Cannot decide if element:\n${N(L(e))}\n is element of:\n${N(L(n.base))}\nand satisfies the predicate ${n.source?.predicate}`)}case`Union`:{if(!gi(n.base))throw new w(`Attempted to check if:\n ${N(L(e))}\nis an element of the non-enumerable set:\n ${N(_i(n))}`);let t=F(n.base).elements;return t.length>1&&t.forEach(e=>{typeof e==`object`&&e.kind===`Set`&&(e.isNormalized=!0)}),t.some(t=>Yi(e,t))}case`SetOperation`:return n.operator===`\\cup`?Yi(e,n.left)||Yi(e,n.right):Yi(e,n.left)&&Yi(e,n.right)===(n.operator===`\\cap`);case`SequenceSet`:{let r=Wi(e);if(r===void 0){if(mn(e))return $i(e,n);throw new t(`Attempted to check if the value:\n${N(L(e))}\nis an element of ${N(L(n))}.`)}return r.every(e=>Yi(e,n.base))}default:throw new w(Gi(e,n))}},na=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?Yi(e,n):e.range.every((e,r)=>na(e,t.range[r],n.range)),I=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return e.enumerated;if(P(e.domain)||zi(e.domain),!dn(e.domain))throw new w(`The domains of formal parameters must be enumerable.`);let t=di(e.domain);return e.enumerated=sr(t,t.map(t=>e.apply(t))),e.enumerated}throw new w(`Expected a function but found ${L(e)}`)},ra=(e,t,n)=>{let r=N(L(e)),i=N(L(t)),a=n===`1.7.4`;switch(ur(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},ia=(e,t)=>{if(!Ln)return ra(e,t);let n=N(L(t));return ur(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},aa=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}return e.length<=8?e.indexOf(t):-1},oa=e=>new w(`Attempted to apply function with integer domain to the non-integer argument ${N(L(e))}`),sa=(e,t)=>Hi(e.domain,t),ca=(e,t,n)=>{let r=bn(e);throw Ln||r!==e.domain||r.length<32?r.forEach(e=>zr(e,t)):Hi(r,t,Rr),n},la=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=ur(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new w(n(e,t));if(a===void 0&&!Ln&&typeof t!=`number`&&ui(r))throw oa(t)}let i=aa(r,t);return i===-1?qi(sa,ca,e,t):i},ua=(e,t,n,r)=>`In applying the function\n${N(L(e))},\nthe ${t} is:\n${N(L(n))}\nwhich ${r}.\n`,da=(e,t)=>new w(ua(e,`argument list`,t,`does not match its formal parameter`)),fa=(e,t,n)=>{let r=e.domain,i=Wi(n);if(i===void 0)throw da(e,n);if(typeof r!=`object`||r.kind!==`ProductSet`)throw new w(`Attempted to apply a function to ${L(n)}, which is not in its domain`);if(t.forEach((t,a)=>{if(a>=i.length)throw da(e,n);let o=i[a],s=`argument number ${a+1}`;if(!Yi(o,r.factors[a]))throw new w(ua(e,s,o,t===void 0?`is not in the function's domain ${L(r)}`:`is not in its domain`));if(t!==void 0&&Wi(o)?.length!==t)throw new w(ua(e,s,o,`does not match its formal parameter`))}),i.length>t.length)throw da(e,n)},pa=(e,t)=>e.lambdaDomain!==void 0&&e.hash===0&&e.fingerprint===0&&!Yi(t,e.lambdaDomain),ma=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return ma(e.enumerated,t,n);let r=e.boundTupleLengths;if(r!==void 0)return fa(e,r,t),e.apply(t);if(!Yi(t,e.domain))throw new w(ur(e)===`lambda`?ra(e,t):`Attempted to apply a function to ${L(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new w(`Attempted to apply ${L(e)}, which is not a function`);let r=n??ra;if(pa(e,t))throw new w(r(e,t));let i=la(e,t,r);if(i===-1)throw new w(r(e,t));return e.range[i]},ha=e=>ui(e)?si.get(e)??fi(e.length):void 0,ga=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=I(e);if(t.functionClass===`lambda`&&t.lambdaDomain)return t.lambdaDomain;let n=ha(t.domain);if(n)return n;let r=ar(t.domain);return t.functionClass===`record`?(t.writtenKeys&&(r.writtenElements=t.writtenKeys),r):(r.isNormalized=!0,r)},_a=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||e.enumerated===void 0)){if(e.boundTupleLengths!==void 0&&Wi(t)===void 0)throw da(e,t);if(!Yi(t,e.domain))return e;let r=n(e.apply(t));return lr({kind:`LazyFunction`,domain:e.domain,apply:n=>qr(t,n)?r:e.apply(n),source:e.source,boundTupleLengths:e.boundTupleLengths},ur(e))}if(!pn(e))throw new w(`Attempted to apply EXCEPT construct to the value ${N(L(e))}.`);let i=I(e);if(pa(i,t))return i;let a=la(i,t,ia);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=lr(sr(i.domain,o),ur(i));if(l.writtenKeys=i.writtenKeys,l.lambdaDomain=i.lambdaDomain,i.hash!==0&&i.hash!==Ca){let e=Oa(c);if(e!==Ca){let t=Oa(i.domain[a]);l.hash=s===c?i.hash:i.hash-Sa(t,Oa(s))+Sa(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-Ma(e,s)+Ma(e,c)|0}return l},va=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},ya=(e,t)=>Math.imul(e^t,16777619),ba=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return va(t)},xa=e=>va(e+2654435769|0),Sa=(e,t)=>va(Math.imul(e,668265261)+t|0),Ca=795548749,wa=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Oa(t[e]);if(r===Ca)return Ca;n=n+xa(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=Oa(e.domain[n]),i=Oa(e.range[n]);if(r===Ca||i===Ca)return Ca;t=t+Sa(r,i)|0}return t},Ta=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new w(`TLC has found a state in which the value of a variable contains ${N(L(e))}`);if(dn(e)){F(e).elements.forEach(Ta);return}let t=I(e);t.domain.forEach(Ta),t.range.forEach(Ta)},Ea=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{Oa(e)===Ca&&Ta(e);return}catch(e){if(!(e instanceof w))throw e;return e}},Da=e=>{switch(e.kind){case`Set`:case`MixedSet`:return e.elements;case`Function`:return[...e.domain,...e.range];case`Subset`:case`SequenceSet`:case`FilteredSet`:case`Union`:return[e.base];case`FunctionSet`:return[e.domain,e.range];case`RecordSet`:return e.sets;case`ProductSet`:return e.factors;case`SetOperation`:return[e.left,e.right];case`LazyFunction`:return[e.domain];default:return[]}},Oa=e=>typeof e==`number`?va(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?ba(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=wa(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?P(e.domain)?Oa(I(e)):Ca:P(e)?Oa(F(e)):Ca,ka=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Aa=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return ka(t)},ja=e=>ka(Pa(e)+2135587861|0),Ma=(e,t)=>ka(Math.imul(Pa(e),374761393)+Pa(t)|0),Na=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+ja(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+Ma(e.domain[n],e.range[n])|0;return t},Pa=e=>typeof e==`number`?ka(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?Aa(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=Na(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?Pa(I(e)):P(e)?Pa(F(e)):Aa(Fa(e)),Fa=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):Ia(e),Ia=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${Fa(e.base)}>`;if(e.kind===`FilteredSet`&&!P(e))throw new w(`Attempted to compare the non-enumerable set ${L(e)} with another value`);if(dn(e))return P(e)?`{${F(e).elements.map(Fa).join(`,`)}}`:`<${e.kind} ${L(e)}>`;let t=I(e);return`(${t.domain.map((e,n)=>`${Fa(e)}:${Fa(t.range[n])}`).join(`,`)})`},La={'"':`\\"`,"\\":`\\\\`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`},Ra=e=>`"${e.replace(/["\\\t\n\f\r]/g,e=>La[e])}"`,za=1999,Ba=e=>e.reduce((e,t)=>e===0?0:e*zi(t),1),Va=e=>{if(e.kind===`Subset`)return zi(e.base)<=6?F(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return F(e);if(e.kind===`FunctionSet`){let t=Ii(e.domain)?0:zi(e.domain);return(t===0?1:zi(e.range)**t)<=za?F(e):void 0}return Ba(e.kind===`RecordSet`?e.sets:e.factors)<=za?F(e):void 0},Ha=(e,t)=>{if(t||e.kind===`Union`||e.kind===`Subset`&&pn(e.base)&&(e.base.kind===`Function`||P(e.base.domain)))return Va(e);if(P(e))try{return Va(e)}catch(e){if(e instanceof w)return;throw e}},Ua=(e,t)=>{let n=e=>L(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return _i(e,t)}},Wa=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),Ga=e=>{if(P(e.domain))try{return I(e)}catch(e){if(e instanceof w||te(e))return;throw e}},Ka=e=>{let t=[],n=[],r=[],i=(e,a,o)=>{if(typeof e!=`object`)return;let s=e=>i(e,a,!1);switch(e.kind){case`Set`:if(e.elements.forEach(s),e.isNormalized)return;e.isNormalized=!0,t.push(e);return;case`MixedSet`:e.elements.forEach(s),F(e);return;case`Function`:{let t=a||ur(e)===`lambda`;if(e.range.forEach(e=>i(e,t,o)),a||e.writtenKeys===void 0)return;n.push([e,e.writtenKeys]),e.writtenKeys=void 0;return}case`LazyFunction`:if(e.enumerated)return i(e.enumerated,!0,o);o&&r.push(e),s(e.domain);return;case`SetOperation`:s(e.left),s(e.right);return;case`FunctionSet`:s(e.domain),s(e.range);return;case`RecordSet`:e.sets.forEach(s);return;case`ProductSet`:e.factors.forEach(s);return;case`Subset`:case`Union`:case`FilteredSet`:case`SequenceSet`:s(e.base);return;default:return}};try{return e.forEach(e=>i(e,!1,!0)),e.map(e=>L(e,!0,!0))}finally{t.forEach(e=>{e.isNormalized=!1}),r.forEach(e=>{e.enumerated=void 0}),n.forEach(e=>{e[0].writtenKeys=e[1]})}},L=(e,t=!1,n=!1)=>{let r=e=>L(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return Ra(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(F(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=Rn.isExpanded?Ha(e,t):void 0;return n?r(n):Ua(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?Rn.isExpanded||!e.source?Ga(e):void 0:e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${L(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&Ln&&ur(e)!==`tuple`)return`<< >>`;let a=r=>L(r,t,n&&ur(e)!==`lambda`);if(i.domain.length===0&&ur(e)===`record`)return`[]`;if(i.domain.every((e,t)=>e===t+1))return`<<${i.range.map(a).join(`, `)}>>`;let o=n?i.domain.map((e,t)=>[e,i.range[t]]):Sn(i);return ur(e)===`record`||i.domain.every(e=>typeof e==`string`&&Wa(e))?`[${o.map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${o.map(e=>`${r(e[0])} :> ${a(e[1])}`).join(` @@ `)})`}}},qa=(e,t)=>{if(e===void 0)return!1;try{return vr(e,t)}catch(e){if(e instanceof w)return!1;throw e}},Ja=/%(\d+\$)?([-#+ 0,(<]*)(\d+)?(\.\d+)?(.?)/gs,Ya=(e,t)=>{let n=0,r=-1,i=!0,a=e.replace(Ja,(e,a,o=``,s,c,l=``)=>{let u=e=>o.includes(`-`)?e.padEnd(Number(s)):e.padStart(Number(s??0)),d=o.includes(`<`),f=o.replace(`<`,``);if(l===`n`&&e===`%n`)return`
|
|
74
|
-
`;if(l===`%`&&c===void 0&&/^-?$/.test(f))return f===`-`&&s===void 0&&(i=!1),u(`%`);let p=d?r:a===void 0?n++:Number(a.slice(0,-1))-1;r=p;let m=t[p];if(!`sSbBhH`.includes(l)||l===``||!/^-?$/.test(f)||f===`-`&&s===void 0||m===void 0)return i=!1,e;let h=l.toLowerCase(),g=h===`s`?m:h===`b`?`true`:(gt(m)>>>0).toString(16),_=u(c===void 0?g:g.slice(0,Number(c.slice(1))));return l===h?_:_.toUpperCase()});return i?a:void 0},Xa=(e,t)=>{let n=t?void 0:Bn.get(e);if(n)return n();let r=Object.entries(e),i=Hn.get(e),a=i!==void 0&&`_format`in e,o=a?e._format:r.length===1?`%s = %s
|
|
75
|
-
`:`/\\ %s = %s
|
|
76
|
-
`;if(typeof o!=`string`)throw new _(`The _format field of the ALIAS ${i} is ${L(o)}, but it must be a string.`);return r.filter(e=>!(a&&e[0]===`_format`)).filter(e=>!t||!qa(t[e[0]],e[1])).map(e=>{let t=Ya(o,[e[0],N(L(e[1]))]);if(t===void 0)throw new _(`The _format field of the ALIAS ${i} is ${L(o)}, but it must format two strings, the name and the value of a field.`);return t}).join(``)},Za=[10454148508367108822n,15747411856486957441n,13848313129918172575n,15427004735118145554n,14338780731064426356n,15931650522396165332n,17670238537108149059n,12816660938095048951n,13192168525635896882n,16119298732711755075n,13564417994159519395n,15831473429641889162n,17671735485712653535n,14582471876431321160n,9288673424107444897n,12345523232675890545n,13774063780198914517n,10636128657019767374n,13227535641082688945n,10085966873248490402n,17056045221983369811n,18027133543548002442n,13033986364717636900n,12663388180492401538n,11007194744055901935n,16251515628090973732n,18046429724439772544n,9876734796024595817n,14949643787442512870n,16960057143726945461n,10590203213448744021n,12248592797044284137n,9558805810925624286n,16993321702164258530n,11754329512098378960n,12074934892440206921n,15696745233288286746n,10531590977001201739n,18107999685377398317n,12149369488538049728n,12923655455904407421n,10507099144397364930n,17322088528956367024n,14653973644796244054n,15165509594857513400n,13554280709034297251n,16228911470502883382n,17115369786458865383n,11179220607102683830n,16708422618246866334n,12295941796329322556n,18336630348474106240n,13989616001589685348n,14822072159597151759n,14264172520427195041n,11642530518213145397n,11877331515501935358n,13913116192159715440n,17054474839259161580n,13461230878584418056n,16058025410470398786n,11100471369705097435n,11133782763824505275n,13192312712502684421n,17456091706045076157n,13237272598629075916n,12914531898895761383n,15801841604014567326n,16446055517513626294n,16780923767715884464n,15104658705803254918n,10882049990920163451n,12728112724252049190n,11720209067562733740n,16476221075563830086n,16602801460297162326n,16206898064012585915n,12158475401238648099n,13742285336487677729n,15543703592025073839n,9615783578189153721n,16710542608962839044n,11960730242263336692n,13328718558362718101n,12971616006464047952n,17057853503483465676n,16180230282101315295n,15483523553568578902n,17773465781871025571n,18047252642493037509n,11580640560664688668n,10121963531818974651n,14218267149826330657n,12715294421139777506n,10584764766358778171n,12666843443693621286n,17403948736867619210n,17907955559063099692n,15179434392748515198n,15413469521140985247n,13455040338347572751n,15419348191054617477n,12340568220039846914n,13236419189535069162n,18074463254581147189n,10818750974828329405n,9859349269386152082n,15035006154709018396n,13627907273947709876n,9549035931546940138n,16199589727945564820n,10285831968679942330n,17737018494601061698n,15477896647372134857n,13595764249822586512n,10556855812148546550n,12421897615105552821n,15477767459253848096n,17421607461439241175n,12409061346569762725n,13621778224251023638n,10680972825126675886n,16494492050207190715n,16801324317763555620n,12664650400804916358n,16134230614391269483n,10027806175083075147n,9259037851175017999n,11803214621941906429n,9537357587847606069n,10517495000576890277n];let Qa=Za[0];const $a=()=>Qa,eo=/* @__PURE__ */ new Int32Array(256),to=/* @__PURE__ */ new Int32Array(256),no=/* @__PURE__ */ new Int32Array(256),ro=/* @__PURE__ */ new Int32Array(256),io=/* @__PURE__ */ new Int32Array(256),ao=/* @__PURE__ */ new Int32Array(256),oo=/* @__PURE__ */ new Int32Array(256),so=/* @__PURE__ */ new Int32Array(256);let co=0,lo=0,uo=0,fo=0;const po=e=>{let t=(e^fo)&255;fo=(fo>>>8|uo<<24)^io[t],uo=uo>>>8^eo[t]},mo=e=>{let t=Za[e];Qa=t;let n=[];for(let e=1n<<63n;n.length<72;)n.push(e),e=e>>1n^((e&1n)==0n?0n:t);let r=n.slice(64,72).reverse();for(let e=0;e<256;e++){let t=r.reduce((t,n,r)=>e>>r&1?t^n:t,0n);eo[e]=Number(BigInt.asIntN(32,t>>32n)),io[e]=Number(BigInt.asIntN(32,t))}let i=[eo,to,no,ro],a=[io,ao,oo,so];for(let e=1;e<4;e++){let t=i[e-1],n=a[e-1];for(let r=0;r<256;r++){let o=n[r]&255;a[e][r]=(n[r]>>>8|t[r]<<24)^io[o],i[e][r]=t[r]>>>8^eo[o]}}co=Number(BigInt.asIntN(32,t>>32n)),lo=Number(BigInt.asIntN(32,t))};mo(0);const ho=e=>{let t=fo^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;fo=uo^so[n]^oo[r]^ao[i]^io[a],uo=ro[n]^no[r]^to[i]^eo[a]},go=e=>{if(typeof e==`boolean`)return po(0),po(e?116:102),2;if(typeof e==`number`)return po(1),ho(e),5;if(typeof e==`string`){po(3),ho(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)ho(e.charCodeAt(n)&255|(e.charCodeAt(n+1)&255)<<8|(e.charCodeAt(n+2)&255)<<16|(e.charCodeAt(n+3)&255)<<24);for(let n=t;n<e.length;n++)po(e.charCodeAt(n));return 5+e.length}return po(21),ho(Gn(e.name)+1),5},_o=e=>{let t=uo,n=fo;uo=0,fo=0;let r=[go(e),uo,fo];return uo=t,fo=n,r},vo=e=>`m = (${e} ^ l) & 255; l = ((l >>> 8) | (h << 24)) ^ L0[m]; h = (h >>> 8) ^ H0[m];`,yo=e=>`m = l ^ ${e}; l = h ^ L3[m & 255] ^ L2[(m >>> 8) & 255] ^ L1[(m >>> 16) & 255] ^ L0[m >>> 24]; h = H3[m & 255] ^ H2[(m >>> 8) & 255] ^ H1[(m >>> 16) & 255] ^ H0[m >>> 24];`,bo={integer:e=>`${vo(`1`)} ${yo(e)}`,boolean:e=>`${vo(`0`)} ${vo(`(${e} ? 116 : 102)`)}`,set:e=>`${vo(`5`)} ${yo(e)}`,function:e=>`${vo(`9`)} ${yo(e)}`,scalar:(e,t,n)=>`{ let r = ${e}; for (; r >= 4; r -= 4) { ${yo(`0`)} } for (; r > 0; r--) { ${vo(`0`)} } h ^= ${t}; l ^= ${n}; }`},xo=()=>({H0:eo,H1:to,H2:no,H3:ro,L0:io,L1:ao,L2:oo,L3:so,initialHigh:co,initialLow:lo}),So=(e,t)=>{let n=uo,r=fo;fo=e[0],uo=e[1],To(t),e[0]=fo,e[1]=uo,uo=n,fo=r},Co=e=>{po(5),ho(e)},wo=e=>{po(9),ho(e)},To=e=>{if(typeof e!=`object`||mn(e))go(e);else if(pn(e)){let t=I(e);wo(t.domain.length);for(let e=0;e<t.domain.length;e++)To(t.domain[e]),To(t.range[e])}else{let t=F(e).elements;Co(t.length);for(let e of t)To(e)}},Eo=e=>{let t=uo,n=fo;uo=co,fo=lo;for(let t of e)To(t);let r=BigInt(uo>>>0)<<32n|BigInt(fo>>>0);return uo=t,fo=n,r},Do=(e,t)=>{let n=new BigInt64Array(e),r=new Int32Array(n.buffer),i=uo,a=fo;for(let n=0;n<e;n++)uo=co,fo=lo,t(n),r[2*n]=fo,r[2*n+1]=uo;return uo=i,fo=a,n},Oo=(e,t)=>Do(e.length,n=>{for(let r of t)To(e[n][r])}),ko=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),Ao=1024,jo=e=>({current:-1,expressions:[],ranges:[],firstChild:[],lastChild:[],nextSibling:[],prefixes:[],isPart:[],isPrimed:[],isUnchanged:[],recursive:[],lets:[],roots:[],primary:[],secondary:[],covered:/* @__PURE__ */ new WeakSet,values:/* @__PURE__ */ new WeakMap,registers:new Uint8Array(e*Ao),relations:[]}),Mo=(e,t)=>({...e,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,coverage:t}),No=(e,t,n,r,i)=>{let a=e.expressions.length;if(e.expressions.push(t),e.ranges.push(n),e.firstChild.push(-1),e.lastChild.push(-1),e.nextSibling.push(-1),e.prefixes.push(-1),e.isPart.push(i),e.isPrimed.push(!1),e.isUnchanged.push(t?.kind===`Unchanged`),e.recursive.push(-1),e.lets.push(void 0),e.roots.push(r===-1?a:e.roots[r]),e.primary.push(0),e.secondary.push(0),t&&e.covered.add(t),r===-1)return a;let o=e.lastChild[r];return o===-1&&(e.firstChild[r]=a),o!==-1&&(e.nextSibling[o]=a),e.lastChild[r]=a,a},Po=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,Fo=(e,t,n,r,i)=>{let a=t===`next`?Po(e,t,r):void 0;if(a!==void 0)return a;let o=No(e,void 0,r.location.range,-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},Io=(e,t)=>e!==void 0&&t!==void 0&&e.module===t.module&&e.start.line===t.start.line&&e.start.column===t.start.column&&e.end.line===t.end.line&&e.end.column===t.end.column,Lo=(e,t,n)=>{let r=e===void 0?void 0:n.definitions.get(e),i=r?.kind===`Operator`?r.head:void 0,a=t.location.range;return!r||!i?`Action ${a?m(a):`Unknown location`}`:Io(r.body.location.range,a)||!a?`${r.name} ${m(i)}`:`${r.name} ${m(i)} (${a.start.line} ${a.start.column} ${a.end.line} ${a.end.column})`},Ro=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,zo=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,Bo=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},Vo=e=>{let t=Array.from({length:11},()=>[]);return e.forEach((e,n)=>{if(n>=Math.floor(t.length*.75)){let e=Array.from({length:t.length*2+1},()=>[]);for(let n=t.length-1;n>=0;n--)t[n].forEach(t=>e[(gt(t.name)&2147483647)%e.length].unshift(t));t=e}t[(gt(e.name)&2147483647)%t.length].unshift(e)}),t.toReversed().flat()},Ho=e=>e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[t.set]),Uo=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),Wo=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),Go=(e,t,n)=>{let r=new Set(n.map(Ro)),i=[],a=[],o=[],s=/* @__PURE__ */ new Map,c=(e,n,r)=>{if(M(e)){for(let e=r;e;e=e.parent)if(e.name===n)return e.definition&&{definition:e.definition,scope:e.scope};return}let i=t.substitutions.get(n)??n;if(t.variableIndex.has(i)||t.constants.has(i))return;let a=t.definitions.get(i),o=a?.location.range?.module??a?.body.location.range?.module;return a&&!ko.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=No(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(Ro(n));let d=t&&s.get(t);if(d&&i.forEach(t=>{e.expressions[t]===d&&(e.lets[t]??=[]).push(u)}),l?.kind===`Operator`&&l.isRecursive){let t=i.findLast(e=>a[e]===l);t!==void 0&&(e.recursive[u]=t)}return a[u]=l,i.push(u),o(),i.pop(),u},u=e=>{let t=e.definition;if(o.includes(t))return;o.push(t);let n=t.kind===`Function`?Wo(t.bounds):t.params.map(e=>e.name);m(t.body,Uo(n,e.scope)),t.kind===`Function`&&Ho(t.bounds).forEach(t=>m(t,e.scope)),o.pop()},d=e=>e?.definition.kind===`Operator`&&e.definition.params.length>0,f=(e,t,n,r)=>{if(e.kind===`Lambda`)m(e.body,Uo(e.params,r));else{if(e.kind===`Identifier`){let i=c(e,e.name,r);if(n?.kind===`Operator`&&(n.params[t]?.arity??0)>0||d(i)){i&&u(i);return}}m(e,r)}},p=(t,n,r,a)=>l(n===t.operands.length?t:void 0,r,()=>{let o=t.operands;if(n>2&&!t.isBulleted){let s=t.prefixEnds?.[n-3],c=p(t,n-1,r&&s?{...r,end:s}:r,a);e.prefixes[i.at(-1)??-1]=c,m(o[n-1],a)}else o.slice(0,n).forEach(e=>m(e,a))},n<t.operands.length),m=(e,t)=>{let n=e.location.range,r=e=>e.forEach(e=>m(e,t));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:case`Bracket`:case`Subexpression`:case`OperatorReference`:return;case`Label`:case`Lambda`:m(e.body,Uo(e.params,t));return;case`Selection`:m(e.expression,t);return;case`Let`:{let n=e.definitions.reduce((e,t)=>({name:t.name,definition:t,scope:void 0,parent:e}),t);for(let e=n;e!==t&&e;e=e.parent)e.scope=n;e.definitions.forEach(t=>{t.kind===`Operator`&&s.set(t.body,e.body)}),Vo(e.definitions).forEach(e=>u({definition:e,scope:n})),m(e.body,n);return}case`Identifier`:{let r=c(e,e.name,t);l(e,n,()=>{r&&u(r)},!1,r?.definition);return}case`Apply`:{let r=c(e,e.operator,t);l(e,n,()=>{r&&u(r),e.args.forEach((e,n)=>f(e,n,r?.definition,t))},!1,r?.definition);return}case`And`:case`Or`:p(e,e.operands.length,n,t);return;case`Case`:l(e,n,()=>{e.arms.forEach(e=>l(void 0,zo(e.condition.location.range,e.body.location.range),()=>r([e.condition,e.body]),!0));let n=e.other;n&&l(void 0,e.otherRange,()=>m(n,t),!0)});return;case`Record`:case`RecordSet`:l(e,n,()=>e.fields.forEach(e=>l(void 0,Bo(e.location,e.value.location.range),()=>m(e.value,t),!0)));return;case`FunctionApplication`:l(e,n,()=>{m(e.function,t);let n=e.args;n.length===1?m(n[0],t):l(void 0,zo(n[0]?.location.range,n.at(-1)?.location.range),()=>r(n),!0)});return;case`Forall`:case`Exists`:case`FunctionConstruction`:l(e,n,()=>{m(e.body,Uo(Wo(e.bounds),t)),r(Ho(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,Uo(Wo(e.bounds),t)),r(Ho(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,Uo(Wo([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,Uo(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,Uo(e.names,t)));return;case`Except`:l(e,n,()=>{m(e.function,t),e.updates.forEach(e=>{e.path.forEach(e=>{e.kind===`Index`&&r(e.args)}),m(e.value,t)})});return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:l(e,n,()=>m(e.expression,t));return;case`If`:l(e,n,()=>r([e.condition,e.consequent,e.alternative]));return;case`SetEnumeration`:case`Tuple`:l(e,n,()=>r(e.elements));return;case`Product`:l(e,n,()=>r(e.factors));return;case`FunctionSet`:l(e,n,()=>r([e.domain,e.range]));return;case`FieldAccess`:l(e,n,()=>m(e.record,t));return;case`BoxAction`:case`AngleAction`:l(e,n,()=>r([e.action,e.subscript]));return;case`WeakFairness`:case`StrongFairness`:l(e,n,()=>r([e.subscript,e.action]))}};e.relations.forEach(e=>{i.push(e.node),m(e.expression,void 0),i.pop()})},Ko=(e,t,n)=>{for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r]){if(e.expressions[r]===n)return r;if(e.isPart[r]){let t=Ko(e,r,n);if(t!==-1)return t}}return-1},qo=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=Ko(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:Ko(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},Jo=(e,t)=>{for(let n=t;n!==-1;n=e.prefixes[n])e.primary[n]++},Yo=(e,t,n)=>{let r=e.current;e.current=t;try{return n()}finally{e.current=r}},Xo=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},Zo=(e,t,n,r,i)=>{let a=fn(n)?n:t!==`\\`&&fn(r)?r:void 0;if(a===void 0||typeof i!=`object`)return i;let o=a===n?r:n;if(t===`\\cup`){if(Ii(a)||!fn(o))return i;let t=e.values.get(o);t!==void 0&&(e.secondary[t]+=zi(o)+1)}let s=t===`\\cup`?void 0:e.values.get(a);if(e.values.get(i)===s)return i;let c=i===n||i===r||e.values.has(i)?{...i}:i;return s!==void 0&&e.values.set(c,s),c},Qo=(e,t,n)=>{let r=0;return{next:()=>(t!==void 0&&e.secondary[t]++,r++<n),reset:()=>{r=0}}},$o=(e,t,n)=>{if(n.some(e=>Ii(e)))return{next:()=>!1,reset:()=>void 0};let r=n.map(t=>ts(e,t,zi(t),!1)),i=()=>{for(let e=r.length-1;e>0;e--){if(r[e].next())return!0;r[e].reset(),r[e].next()}return r.length>0&&r[0].next()},a=!r.every(e=>e.next());return{next:()=>!a&&(e.secondary[t]+=Math.max(r.length,1),a=!i(),!0),reset:()=>{r.forEach(e=>{e.reset(),e.next()}),a=!1}}},es=(e,t)=>{let n=typeof t==`object`?e.values.get(t):void 0;if(n!==void 0&&typeof t==`object`){if(t.kind===`RecordSet`)return $o(e,n,t.sets);if(t.kind===`FunctionSet`)return $o(e,n,Array.from({length:zi(t.domain)},()=>t.range))}},ts=(e,t,n,r)=>{let i=typeof t==`object`?e.values.get(t):void 0;if(typeof t==`object`&&(t.kind===`Subset`||!r&&t.kind===`FilteredSet`))return Qo(e,void 0,n);let a=es(e,t);if(!a||i===void 0)return Qo(e,i,n);if(!r)return a;let o=0;for(;a.next();)o++;return e.secondary[i]+=o,Qo(e,i,o)},ns=(e,t,n)=>{let r=typeof t==`object`&&t.kind===`Subset`?e.values.get(t):void 0;r!==void 0&&typeof n==`object`&&e.values.set(n,r)},rs=(e,t,n,r)=>{let i=Array.isArray(n)?n.length:n.high-n.low+1;return typeof t!=`object`||t.kind!==`Subset`||!Array.isArray(n)?ts(e,t,i,r):(n.forEach(n=>ns(e,t,n)),Qo(e,void 0,i))},is=e=>(e.every(e=>e.next()),()=>{for(let t=0;t<e.length;t++){if(e[t].next()||t===e.length-1)return;e[t].reset(),e[t].next()}}),as=(e,t,n)=>is(t.map((t,r)=>rs(e,t,n[r],!0))),os=(e,t,n)=>{let r=n.map(e=>zi(e)),i=is(n.map((t,n)=>ts(e,t,r[n],!1))),a=r.reduce((e,t)=>e*t,1);for(let e=0;e<a;e++)i();e.secondary[t]+=a},ss=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},cs=(e,t)=>t.forEach((t,n)=>{let r=Eo([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*Ao+i;e.registers[o]=Math.max(e.registers[o],ss(a)+1)}),ls=(e,t)=>{let n=e.registers.subarray(t*Ao,(t+1)*Ao),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*Ao*Ao/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*Ao?a===0?i:Ao*Math.log(Ao/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},us=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},ds=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>us(e)&t-1;return e.reduce((e,t)=>n(t)<n(e)?t:e)},fs=(e,t)=>{e.some(e=>e.primary===t.primary&&e.secondary===t.secondary)||e.push(t)},ps=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],ms=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},hs=(e,t)=>{let n=e.primary[t.node],r=e.secondary[t.node];return t.kind===`init`?{distinct:n,generated:n+r}:t.kind===`next`?{distinct:r,generated:n}:t.kind===`constraint`?{distinct:r,generated:n+r}:{distinct:0,generated:0}},gs=(e,t)=>{let n=[],r=/* @__PURE__ */ new Map,i=t=>{let n=[],a={primary:e.primary[t],secondary:e.secondary[t]};return(a.primary>0||a.secondary>0||ps(e,t))&&fs(n,a),ms(e,t).forEach(e=>i(e).forEach(e=>fs(n,e))),r.set(t,n),n},a=(t,r,i,a)=>{let o=e.ranges[t];n.push({location:o?m(o):`Unknown location`,depth:r,count:i,cost:a})},o=(t,n)=>a(t,n,e.primary[t],e.secondary[t]),s=(t,n)=>{let c=ms(e,t),l=[];c.forEach(e=>(r.get(e)??i(e)).forEach(e=>fs(l,e)));let u={primary:e.primary[t],secondary:e.secondary[t]},d=ps(e,t),f=e=>c.forEach(t=>s(t,e));if(e.isUnchanged[t]){let e=l.filter(e=>e.primary!==0||e.secondary!==0);e.length===0?o(t,n):a(t,n,Math.max(u.primary,ds(e).primary),0);return}if(l.length===0){(u.primary!==0||d)&&o(t,n);return}let p=u.primary===0&&u.secondary===0;if(l.length===1){let e=l[0],r=e.primary===0&&e.secondary===0;if(e.primary<u.primary){o(t,n),f(n+1);return}if(!d&&p&&!r){a(t,n,e.primary,e.secondary);return}if(p&&r){d&&o(t,n),f(d?n+1:n);return}if(u.primary===e.primary&&u.secondary===e.secondary){o(t,n);return}}let m=!p||d;m&&o(t,n),f(m?n+1:n)};return ms(e,t).forEach(e=>{i(e),s(e,0)}),n},_s=[`init`,`next`,`invariant`,`constraint`,`implied`],vs=(e,t)=>!e||!t?e?1:t?-1:0:e.module===t.module?e.start.line-t.start.line||e.start.column-t.start.column||e.end.line-t.end.line||e.end.column-t.end.column:e.module<t.module?-1:1,ys=e=>_s.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>vs(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||vs(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),bs=(e,t,n,r)=>({variables:r.map(r=>{let i=n[r]?.range;return{label:`${t.variables[r]} ${i?m(i):`Unknown location`}`,distinct:ls(e,r)}}),relations:ys(e).map(t=>({kind:t.kind,label:t.label,...hs(e,t),expressions:gs(e,t.node)}))}),xs=(e,t,n)=>{let r=Po(e,t,n);if(r===void 0)return;let i=e.primary[r],a=e.secondary[r];if(t===`init`)return[[`generated`,i+a],[`distinct`,i]];if(t===`next`)return[[`generated`,i],[`distinct`,a]];let o=e.firstChild[r];return[[`count`,o===-1?i:e.primary[o]]]},Ss=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),Cs=(e,n)=>Ss.has(e)?new w(n):new t(n),ws=(e,n,r,i)=>new t(`The ${e} argument of ${n} should be a ${r}, but instead it is:\n${N(L(i))}`),Ts=(e,n,r=e)=>{if(!dn(e)||qn(e))throw new t(`Applying ${n} to the following value,\nwhich is not a finite set:\n${N(L(r))}`);return F(e)},Es=e=>typeof e==`object`&&e.kind===`Operator`,R=(e,t,n)=>{let r=e[t];if(r===void 0||Es(r))throw Cs(n,`${n} expects a value as argument ${t+1}`);return r},Ds=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`boolean`)throw Cs(n,`${n} expects a boolean but received ${L(r)}`);return r},Os=(e,t,n)=>{let r=e[t];if(r===void 0||!Es(r))throw Cs(n,`${n} expects an operator as argument ${t+1}`);return r},ks=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),z=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),As=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),js=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),Ms=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(R(n,0,e),R(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),Ns=e=>e>2147483647||e<-2147483648,Ps=e=>new t(`Overflow when computing ${e}`),Fs={ModelValue:`ModelValue`,Set:`SetEnumValue`,Interval:`IntervalValue`,InfiniteSet:`UserValue`,SequenceSet:`UserValue`,Subset:`SubsetValue`,FunctionSet:`SetOfFcnsValue`,RecordSet:`SetOfRcdsValue`,ProductSet:`SetOfTuplesValue`,FilteredSet:`SetPredValue`,LazyFunction:`FcnLambdaValue`,Union:`UnionValue`,MixedSet:`SetEnumValue`},Is={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},Ls={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},Rs={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},zs=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return Is[e.operator];if(e.kind!==`Function`)return Fs[e.kind];let t=ur(e);return t===void 0?`FcnRcdValue`:Rs[t]},Bs=e=>Ls[zs(e)],Vs=(e,t)=>new w(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),Hs=(e,n)=>{let r=r=>(...i)=>{let a=Ki.sets?.length??0;try{return r(...i)}catch(r){if(!(r instanceof w)||r instanceof re)throw r;let i=Ji(a);throw Ki.sets&&(Ki.sets.length=a),e.isLazy!==!0&&r instanceof t&&!i?r:Vs(n,r.message)}},i=r(e.evaluate);return{...e,evaluate:(t,r)=>{if(t.length!==e.arity)throw Vs(n,`array is not of length ${e.arity}`);return i(t,r)},evaluateUnary:e.evaluateUnary&&r(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&r(e.evaluateBinary)}},Us=(e,t)=>{if(typeof e!=`number`)throw Vs(t,`Cannot cast tlc2.value.impl.${zs(e)} to tlc2.value.impl.IntValue`);return e},Ws=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Gs=(e,t,n,r)=>{let i=Ws(e,n,`IntValue`,2);return Ms(t,(e,n)=>{let a=Us(n,i),o=Us(e,i),s=r(o,a);if(Ns(s))throw Ps(`${o}${t}${a}`);return s})},Ks=(e,n,r)=>{if(typeof e!=`number`)throw new t(`The ${n} argument of ${r} should be an integer, but instead it is:\n${N(L(e))}`);return e},qs=(e,t,n=e)=>Ms(e,(e,r)=>t(Ks(e,`first`,n),Ks(r,`second`,n))),Js=(e,t,n)=>({...js(e,t,n),isLazy:!0}),Ys=(e,t,n)=>{let r=Os(e,t,n);return()=>r.call([])},Xs=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices`.split(`,`),Zs=[[`\\lnot`,`~`,`\\neg`,`¬`],[`[]`,`□`],[`<>`,`◇`],[`\\land`,`/\\`,`∧`],[`\\lor`,`\\/`,`∨`],[`\\equiv`,`<=>`,`≡`,`⇔`],[`/=`,`#`,`≠`],[`\\leq`,`<=`,`=<`,`≤`],[`\\geq`,`>=`,`≥`],[`\\times`,`\\X`,`×`],[`\\intersect`,`\\cap`,`∩`],[`\\union`,`\\cup`,`∪`],[`\\o`,`\\circ`,`∘`],[`\\oplus`,`(+)`,`⊕`],[`\\ominus`,`(-)`,`⊖`],[`\\odot`,`(.)`,`⊙`],[`\\oslash`,`(/)`,`⊘`],[`\\otimes`,`(\\X)`,`⊗`],[`\\approx`,`≈`],[`:=`,`≔`],[`\\asymp`,`≍`],[`\\bigcirc`,`◯`],[`::=`,`⩴`],[`\\bullet`,`●`],[`\\cdot`,`⋅`],[`\\cong`,`≅`],[`\\div`,`÷`],[`\\doteq`,`≐`],[`..`,`‥`],[`...`,`…`],[`!!`,`‼`],[`\\gg`,`≫`],[`=>`,`⇒`],[`\\in`,`∈`],[`=|`,`⫤`],[`~>`,`↝`],[`\\ll`,`≪`],[`-|`,`⊣`],[`\\notin`,`∉`],[`-+->`,`⇸`],[`\\prec`,`≺`],[`\\preceq`,`⪯`],[`\\propto`,`∝`],[`??`,`⁇`],[`|=`,`⊨`],[`|-`,`⊢`],[`\\sim`,`∼`],[`\\simeq`,`≃`],[`\\sqcap`,`⊓`],[`\\sqcup`,`⊔`],[`\\sqsubset`,`⊏`],[`\\sqsubseteq`,`⊑`],[`\\sqsupset`,`⊐`],[`\\sqsupseteq`,`⊒`],[`\\star`,`⋆`],[`\\subset`,`⊂`],[`\\subseteq`,`⊆`],[`\\succ`,`≻`],[`\\succeq`,`⪰`],[`\\supset`,`⊃`],[`\\supseteq`,`⊇`],[`\\uplus`,`⊎`],[`||`,`‖`],[`\\wr`,`≀`],[`^+`,`⁺`]],Qs=new Map(Zs.flatMap(e=>e.slice(1).map(t=>[t,e[0]]))),$s=e=>e.split(`!`).map(e=>Qs.get(e)??(e===`~`?`\\lnot`:e)).join(`!`),ec=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices,***I do not exist***,--TLA+ BUILTINS--,Formal_0,Formal_1,Formal_2,[,^,/,*,-,-.,+,^+,^*,^#,<,\\leq,>,\\geq,...,..,|,||,&&,&,$$,$,??,%%,%,##,++,--,**,//,^^,@@,!!,|-,|=,-|,=|,<:,:>,:=,::=,\\oplus,\\ominus,\\odot,\\oslash,\\otimes,\\uplus,\\sqcap,\\sqcup,\\div,\\wr,\\star,\\o,\\bigcirc,\\bullet,\\prec,\\succ,\\preceq,\\succeq,\\sim,\\simeq,\\ll,\\gg,\\asymp,\\subset,\\supset,\\supseteq,\\approx,\\cong,\\sqsubset,\\sqsubseteq,\\sqsupset,\\sqsupseteq,\\doteq,\\propto,~,¬,□,◇,/\\,∧,\\/,∨,<=>,≡,⇔,#,≠,<=,=<,≤,>=,≥,\\X,×,\\cap,∩,\\cup,∪,\\circ,∘,(+),⊕,(-),⊖,(.),⊙,(/),⊘,(\\X),⊗,≈,≔,≍,◯,⩴,●,⋅,≅,÷,≐,‥,…,‼,≫,⇒,∈,⫤,↝,≪,⊣,∉,⇸,≺,⪯,∝,⁇,⊨,⊢,∼,≃,⊓,⊔,⊏,⊑,⊐,⊒,⋆,⊂,⊆,≻,⪰,⊃,⊇,⊎,‖,≀,⁺,@`.split(`,`),tc=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs.beginLine.beginColumn.endLine.endColumn.module.name.location.context.parameters._action`.split(`.`),nc=/* @__PURE__ */ `Not a node.N_ActDecl.N_ActionExpr.N_AssumeDecl.N_AssumeProve.N_Assumption.N_BeginModule.N_Body.N_BoundedQuant.N_Case.N_CaseArm.N_CaseStatement.N_ChooseStatement.N_ConjItem.N_ConjList.N_ConsDecl.N_DisjItem.N_DisjList.N_EndModule.N_Except.N_ExceptComponent.N_ExceptSpec.N_Times.N_Extends.N_FairnessExpr.N_FcnAppl.N_FcnConst.N_FieldSet.N_FieldVal.N_FunctionDefinition.N_FunctionParam.N_GeneralId.N_GenInfixOp.N_GenNonExpPrefixOp.N_GenPostfixOp.N_GenPrefixOp.N_IdentDecl.N_Real.N_IdentifierTuple.N_IdentLHS.N_IdPrefix.N_IdPrefixElement.N_IfThenElse.N_InfixDecl.N_InfixExpr.N_InfixLHS.N_InfixOp.N_InnerProof.N_Instance.N_NonLocalInstance.N_Integer.N_LeafProof.N_LetDefinitions.N_LetIn.N_MaybeBound.N_Module.N_ModuleDefinition.N_NonExpPrefixOp.N_Number.N_NumberedAssumeProve.N_OpApplication.N_OpArgs.N_OperatorDefinition.N_OtherArm.N_ParamDecl.N_ParamDeclaration.N_ParenExpr.N_PostfixDecl.N_PostfixExpr.N_PostfixLHS.N_PostfixOp.N_PrefixDecl.N_PrefixExpr.N_PrefixLHS.N_PrefixOp.N_Proof.N_ProofLet.N_ProofName.N_ProofStatement.N_ProofStep.N_QEDStep.N_QuantBound.N_RcdConstructor.N_RecordComponent.N_SetEnumerate.N_SetOfAll.N_SetOfFcns.N_SetOfRcds.N_String.N_SubsetOf.N_Substitution.N_TempDecl.N_Theorem.N_Tuple.N_UnBoundedOrBoundedChoose.N_UnboundedQuant.N_VariableDeclaration.Token =.Token \\in.N_NewSymb.N_Lambda.N_Recursive.N_Label.N_StructOp.N_NumerableStep.N_TerminalProof.N_UseOrHide.N_NonExprBody.N_DefStep.N_HaveStep.N_TakeStep.N_WitnessStep.N_PickStep.N_CaseStep.N_AssertStep`.split(`.`),rc=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
19
|
+
`);s(e===-1?i:i.slice(0,e));continue}if(i.startsWith(`(*`)){let e=j(i);if(e===void 0)return s(i),o(``),t;s(i.slice(0,e));continue}let l=r,u=et(e,n),d=u>0?i.slice(0,u):/^\d+(?![A-Za-z_])/.exec(i)?.[0];if(d){t.push({kind:`Number`,text:d,line:l}),s(d);continue}let f=/^[A-Za-z0-9_]+/.exec(i)?.[0];if(f){t.push({kind:`Word`,text:f,line:l}),s(f);continue}if(i.startsWith(`"`)){let r=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(i),c=r?.[0]??`"`;if(r?.[2]!==`"`)return s(c),n===e.length?o(`${c}\n`):a(n,c),t;t.push({kind:`String`,text:c,line:l}),s(c);continue}let p=qe(e,n)??Ge(e,n),m=ot.find(e=>i.startsWith(e));if(m&&m.length>=(p?.length??0))t.push({kind:`Symbol`,text:m,line:l}),s(m);else{if(!p)return a(n,``),t;t.push({kind:`Word`,text:p.text,line:l}),s(e.slice(n,n+p.length))}}return t.push({kind:`End`,text:``,line:r}),t},ct=(e,t)=>new C(`TLC found an error in the configuration file at line ${e}\n${t}`),lt=(e,t)=>ct(e,`The keyword ${t} appeared twice.`),ut=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),dt=/* @__PURE__ */ new Map([[`INVARIANT`,`invariants`],[`INVARIANTS`,`invariants`],[`PROPERTY`,`properties`],[`PROPERTIES`,`properties`],[`CONSTRAINT`,`constraints`],[`CONSTRAINTS`,`constraints`],[`ACTION_CONSTRAINT`,`actionConstraints`],[`ACTION_CONSTRAINTS`,`actionConstraints`],[`POSTCONDITION`,`postconditions`],[`POSTCONDITIONS`,`postconditions`],[`_POSSIBLE`,`possible`]]),ft=(t,n=`master`)=>{let r=n===`1.7.4`?at:rt,i=st(t),a=0,o={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],rawConstants:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},s=!1,c=/* @__PURE__ */ new Set,l=()=>{let e=i[Math.min(a++,i.length-1)];if(e.kind===`Error`)throw new C(`TLC found an error in the configuration file:\n${e.text}`);return e},u=t=>{if(t.kind===`Number`&&t.text.startsWith(`\\`))throw v(new C(`${e(`java.lang.NumberFormatException`)}For input string: "${t.text}"`),b.error);if(t.kind===`Number`)return{kind:`Number`,value:Number(t.text)};if(t.kind===`String`&&t.text.includes(`\\`))throw new C(`TLC found an error in the configuration file:\nescape sequences are not supported in strings at line ${t.line}`);if(t.kind===`String`)return{kind:`String`,value:t.text.slice(1,-1)};if(t.text===`TRUE`||t.text===`FALSE`)return{kind:`Boolean`,value:t.text===`TRUE`};if(t.text===`{`){let e=[],t=l();if(t.text!==`}`)for(;e.push(u(t)),t=l(),t.text===`,`;)t=l();if(t.text!==`}`)throw ct(t.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(t.kind!==`End`)return{kind:`ModelValue`,name:t.text};throw ct(t.line,`It was expecting a value, but did not find it.`)},d=e=>{let t=l();if(t.kind===`End`)throw ct(t.line,`Expected an identifier after ${e}[.`);let n=l();if(n.text!==`]`)throw ct(n.line,`It was expecting ], but did not find it.`);return t.text},f=(e,t)=>{let n=e.text,r=l();for(;r.text===`!`;)n=`${n}!${l().text}`,r=l();if(r.text===`<-`){if(r=l(),r.text===`[`){let e=d(`<-`),t=l();if(t.kind===`End`)throw ct(t.line,`Expected an identifier after <-[mod].`);o.substitutions.push({name:n,target:t.text,module:e});return}if(r.kind===`End`)throw ct(r.line,`Expected an identifier after <-.`);o.substitutions.push({name:n,target:r.text});return}let i=[],a=r.text===`(`;if(a){for(;i.push(u(l())),r=l(),r.text===`,`;);if(r.text!==`)`)throw ct(t,``);r=l()}if(r.text!==`=`)throw ct(r.line,`It was expecting = or <-, but did not find it.`);r=l();let s=r.text===`[`?d(`=`):void 0,c=u(s===void 0?r:l());o.constants.push({name:n,value:c,...a&&{args:i},...s!==void 0&&{module:s}})},p=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;let n=a-1;f(t,e),o.rawConstants.push(i.slice(n,a).map(e=>e.text).join(` `))}},m=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;e.push(t.text)}},h=l();for(;h.kind!==`End`;){let e=h.text,t=h.line,n=r.has(e)?ut.get(e):void 0,i=r.has(e)?dt.get(e):void 0,a=()=>{let n=l();if(n.kind===`End`)throw ct(t,`The keyword ${e} was not followed by an identifier.`);return n};if(n!==void 0){let r=a();if(o[n]!==void 0)throw lt(t,e);o[n]=r.text,h=l()}else if(i!==void 0)h=m(o[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)h=p(t);else if(e===`CHECK_DEADLOCK`){let n=a();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw ct(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(s)throw lt(t,e);s=!0,o.checkDeadlock=n.text===`TRUE`,h=l()}else{if(!r.has(e)||!it.includes(e))throw ct(t,`It was expecting a keyword, but did not find it.`);if(a(),c.has(e))throw lt(t,e);c.add(e),h=l()}}return o},pt=/* @__PURE__ */ new WeakMap,mt=(e,t)=>{let n=pt.get(e);if(n)return n;let r={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:t};return pt.set(e,r),r},ht=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],gt=e=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return[];case`Apply`:return e.args;case`Lambda`:return[e.body];case`And`:case`Or`:return e.operands;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`If`:return[e.condition,e.consequent,e.alternative];case`Case`:return[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]];case`Let`:return[...e.definitions.flatMap(ht),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`Bracket`:return e.args;case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[]);case`Selection`:return[e.expression]}},_t=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},M=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,vt=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices`.split(`,`),yt=[[`\\lnot`,`~`,`\\neg`,`¬`],[`[]`,`□`],[`<>`,`◇`],[`\\land`,`/\\`,`∧`],[`\\lor`,`\\/`,`∨`],[`\\equiv`,`<=>`,`≡`,`⇔`],[`/=`,`#`,`≠`],[`\\leq`,`<=`,`=<`,`≤`],[`\\geq`,`>=`,`≥`],[`\\times`,`\\X`,`×`],[`\\intersect`,`\\cap`,`∩`],[`\\union`,`\\cup`,`∪`],[`\\o`,`\\circ`,`∘`],[`\\oplus`,`(+)`,`⊕`],[`\\ominus`,`(-)`,`⊖`],[`\\odot`,`(.)`,`⊙`],[`\\oslash`,`(/)`,`⊘`],[`\\otimes`,`(\\X)`,`⊗`],[`\\approx`,`≈`],[`:=`,`≔`],[`\\asymp`,`≍`],[`\\bigcirc`,`◯`],[`::=`,`⩴`],[`\\bullet`,`●`],[`\\cdot`,`⋅`],[`\\cong`,`≅`],[`\\div`,`÷`],[`\\doteq`,`≐`],[`..`,`‥`],[`...`,`…`],[`!!`,`‼`],[`\\gg`,`≫`],[`=>`,`⇒`],[`\\in`,`∈`],[`=|`,`⫤`],[`~>`,`↝`],[`\\ll`,`≪`],[`-|`,`⊣`],[`\\notin`,`∉`],[`-+->`,`⇸`],[`\\prec`,`≺`],[`\\preceq`,`⪯`],[`\\propto`,`∝`],[`??`,`⁇`],[`|=`,`⊨`],[`|-`,`⊢`],[`\\sim`,`∼`],[`\\simeq`,`≃`],[`\\sqcap`,`⊓`],[`\\sqcup`,`⊔`],[`\\sqsubset`,`⊏`],[`\\sqsubseteq`,`⊑`],[`\\sqsupset`,`⊐`],[`\\sqsupseteq`,`⊒`],[`\\star`,`⋆`],[`\\subset`,`⊂`],[`\\subseteq`,`⊆`],[`\\succ`,`≻`],[`\\succeq`,`⪰`],[`\\supset`,`⊃`],[`\\supseteq`,`⊇`],[`\\uplus`,`⊎`],[`||`,`‖`],[`\\wr`,`≀`],[`^+`,`⁺`]],bt=new Map(yt.flatMap(e=>e.slice(1).map(t=>[t,e[0]]))),xt=e=>e.split(`!`).map(e=>bt.get(e)??(e===`~`?`\\lnot`:e)).join(`!`),St=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices,***I do not exist***,--TLA+ BUILTINS--,Formal_0,Formal_1,Formal_2,[,^,/,*,-,-.,+,^+,^*,^#,<,\\leq,>,\\geq,...,..,|,||,&&,&,$$,$,??,%%,%,##,++,--,**,//,^^,@@,!!,|-,|=,-|,=|,<:,:>,:=,::=,\\oplus,\\ominus,\\odot,\\oslash,\\otimes,\\uplus,\\sqcap,\\sqcup,\\div,\\wr,\\star,\\o,\\bigcirc,\\bullet,\\prec,\\succ,\\preceq,\\succeq,\\sim,\\simeq,\\ll,\\gg,\\asymp,\\subset,\\supset,\\supseteq,\\approx,\\cong,\\sqsubset,\\sqsubseteq,\\sqsupset,\\sqsupseteq,\\doteq,\\propto,~,¬,□,◇,/\\,∧,\\/,∨,<=>,≡,⇔,#,≠,<=,=<,≤,>=,≥,\\X,×,\\cap,∩,\\cup,∪,\\circ,∘,(+),⊕,(-),⊖,(.),⊙,(/),⊘,(\\X),⊗,≈,≔,≍,◯,⩴,●,⋅,≅,÷,≐,‥,…,‼,≫,⇒,∈,⫤,↝,≪,⊣,∉,⇸,≺,⪯,∝,⁇,⊨,⊢,∼,≃,⊓,⊔,⊏,⊑,⊐,⊒,⋆,⊂,⊆,≻,⪰,⊃,⊇,⊎,‖,≀,⁺,@`.split(`,`),Ct=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs.beginLine.beginColumn.endLine.endColumn.module.name.location.context.parameters._action`.split(`.`),wt=/* @__PURE__ */ `Not a node.N_ActDecl.N_ActionExpr.N_AssumeDecl.N_AssumeProve.N_Assumption.N_BeginModule.N_Body.N_BoundedQuant.N_Case.N_CaseArm.N_CaseStatement.N_ChooseStatement.N_ConjItem.N_ConjList.N_ConsDecl.N_DisjItem.N_DisjList.N_EndModule.N_Except.N_ExceptComponent.N_ExceptSpec.N_Times.N_Extends.N_FairnessExpr.N_FcnAppl.N_FcnConst.N_FieldSet.N_FieldVal.N_FunctionDefinition.N_FunctionParam.N_GeneralId.N_GenInfixOp.N_GenNonExpPrefixOp.N_GenPostfixOp.N_GenPrefixOp.N_IdentDecl.N_Real.N_IdentifierTuple.N_IdentLHS.N_IdPrefix.N_IdPrefixElement.N_IfThenElse.N_InfixDecl.N_InfixExpr.N_InfixLHS.N_InfixOp.N_InnerProof.N_Instance.N_NonLocalInstance.N_Integer.N_LeafProof.N_LetDefinitions.N_LetIn.N_MaybeBound.N_Module.N_ModuleDefinition.N_NonExpPrefixOp.N_Number.N_NumberedAssumeProve.N_OpApplication.N_OpArgs.N_OperatorDefinition.N_OtherArm.N_ParamDecl.N_ParamDeclaration.N_ParenExpr.N_PostfixDecl.N_PostfixExpr.N_PostfixLHS.N_PostfixOp.N_PrefixDecl.N_PrefixExpr.N_PrefixLHS.N_PrefixOp.N_Proof.N_ProofLet.N_ProofName.N_ProofStatement.N_ProofStep.N_QEDStep.N_QuantBound.N_RcdConstructor.N_RecordComponent.N_SetEnumerate.N_SetOfAll.N_SetOfFcns.N_SetOfRcds.N_String.N_SubsetOf.N_Substitution.N_TempDecl.N_Theorem.N_Tuple.N_UnBoundedOrBoundedChoose.N_UnboundedQuant.N_VariableDeclaration.Token =.Token \\in.N_NewSymb.N_Lambda.N_Recursive.N_Label.N_StructOp.N_NumerableStep.N_TerminalProof.N_UseOrHide.N_NonExprBody.N_DefStep.N_HaveStep.N_TakeStep.N_WitnessStep.N_PickStep.N_CaseStep.N_AssertStep`.split(`.`),Tt=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
77
20
|
Nat == { }
|
|
78
21
|
a+b == {a, b}
|
|
79
22
|
a-b == CHOOSE n : b + n = a
|
|
@@ -389,28 +332,85 @@ _CheckName(name) ==
|
|
|
389
332
|
=> (PrintT(counts) /\\ FALSE)
|
|
390
333
|
_PrintCounts == PrintT(_Counts)
|
|
391
334
|
=============================================================================
|
|
392
|
-
`]]),ic=/* @__PURE__ */ new Map([[`Bags`,/* @__PURE__ */ new Map([[`IsABag`,`public static tlc2.value.IBoolValue tlc2.module.Bags.IsABag(tlc2.value.impl.Value)`],[`BagCardinality`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.BagCardinality(tlc2.value.impl.Value)`],[`BagIn`,`public static tlc2.value.IBoolValue tlc2.module.Bags.BagIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`CopiesIn`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.CopiesIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\oplus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagCup(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\ominus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagDiff(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagUnion`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagUnion(tlc2.value.impl.Value)`],[`\\sqsubseteq`,`public static tlc2.value.IBoolValue tlc2.module.Bags.SqSubseteq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagOfAll`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagOfAll(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagToSet`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagToSet(tlc2.value.impl.Value)`],[`SetToBag`,`public static tlc2.value.impl.Value tlc2.module.Bags.SetToBag(tlc2.value.impl.Value)`]])],[`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)`]])],[`TLCExt`,/* @__PURE__ */ new Map([[`AssertError`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`PickSuccessor`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`ToTrace`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.lassoOrdinal(tlc2.value.impl.Value)`],[`CounterExample`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.error(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`Trace`,`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`TLCDefer`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefer(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCNoOp`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcNoOp(tlc2.value.impl.Value)`],[`TLCModelValue`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.tlcModelValue(tlc2.value.impl.Value)`],[`TLCCache`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcEval2(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCFP`,`public static synchronized tlc2.value.impl.IntValue tlc2.module.TLCExt.tlcFingerprint(tlc2.value.impl.Value)`],[`TLCEvalDefinition`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefByName(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCGetOrDefault`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcGetOrDefault(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])]]),ac=E(`EOF`),oc=E(`IDENTIFIER`),sc=E(`DEFBREAK`),cc=(e,t)=>Array.from({length:E(t)-E(e)+1},(t,n)=>E(e)+n),lc=new Set(cc(`op_57`,`op_119`)),uc=new Set(cc(`op_1`,`op_119`)),dc=new Set(cc(`op_57`,`op_70`)),fc=/* @__PURE__ */ new Set([...cc(`ACTION`,`EXCEPT`),E(`EXTENDS`),...cc(`IF`,`SF`),E(`STATE`),...cc(`THEN`,`WITH`),E(`US`),...cc(`op_112`,`op_116`)]),pc=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),mc=new Map([...pc(`postfix`,160,160,!0,`[`),...pc(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...pc(`prefix`,120,120,!1,`-.`),...pc(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...pc(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...pc(`prefix`,40,40,!0,`\\lnot`),...pc(`nfix`,100,130,!0,`\\times`),...pc(`infix`,140,140,!1,`^`,`^^`),...pc(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...pc(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...pc(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...pc(`infix`,100,110,!0,`|`,`||`,`%%`),...pc(`infix`,100,110,!1,`%`),...pc(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...pc(`infix`,90,140,!1,`\\wr`),...pc(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...pc(`infix`,90,130,!1,`!!`),...pc(`infix`,90,90,!1,`...`,`..`),...pc(`infix`,80,80,!0,`\\intersect`,`\\union`),...pc(`infix`,80,80,!1,`\\`),...pc(`infix`,70,70,!1,`<:`,`:>`),...pc(`infix`,60,60,!0,`@@`),...pc(`infix`,50,140,!0,`\\cdot`),...pc(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...pc(`infix`,30,30,!0,`\\land`,`\\lor`),...pc(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...pc(`infix`,10,10,!1,`=>`)]),hc=new Map([...mc,...Zs.flatMap(e=>e.slice(1).map(t=>[t,mc.get(e[0])]))]),gc=hc.get(`[`),_c={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},vc=e=>({type:`tokens`,kinds:new Set(e)}),yc=e=>typeof e==`string`?e.startsWith(`<`)?vc([E(e.slice(1,-1))]):{type:`call`,name:e}:e,B=(...e)=>({type:`sequence`,units:e.map(yc)}),V=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:B(e))}),bc=e=>(...t)=>({type:e,body:B(...t)}),H=bc(`zeroOrMore`),xc=bc(`oneOrMore`),U=bc(`optional`),W=e=>({type:`action`,run:t=>e(t)??void 0}),G=e=>W(t=>{t.expecting=e}),K=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&B(...e.expansion),semantic:e.semantic}),Sc=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),Cc=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=Sc(e,n);return n},wc=(...e)=>{let t=e.map(E);return e=>t.includes(Cc(e,1).kind)},Tc=(e,t=Cc(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},Ec=e=>{let t=Cc(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},Dc=e=>wc(`CASESEP`)(e)&&Tc(e),Oc=e=>{let t=Cc(e,1);fc.has(t.kind)&&(t.kind=oc)},kc=(e,t,n=t)=>`line ${t.beginLine}, col ${t.beginColumn} to line ${n.beginLine}, col ${n.beginColumn+n.image.length-1} of module ${e.moduleName}`,Ac=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),jc=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},Mc=e=>e.operatorStacks[e.operatorStacks.length-1],Nc=(e,t)=>e.low>t.high,Pc=(e,t)=>e.high<t.low,Fc=e=>e.fix===`prefix`?e:hc.get(`${e.name}.`),Ic=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===gc?Ac(`FcnAppl`,[n,...r.node.heirs]):Ac(`PostfixExpr`,[n,r.node]),operator:void 0})},Lc=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:Ac(`PrefixExpr`,[e[n-2].node,e[n-1].node]),operator:void 0});return}let r=e[n-3].node,i=t.fix===`nfix`;e.splice(n-3,3,{node:Ac(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},Rc=e=>{let t=Mc(e),n=t.length-1,r=t[n],i=t[n-1],a=t[n-2];if(r.operator===void 0||r.operator.fix===`prefix`)return;if(i.operator?.fix===`postfix`)return Ic(t,n),Rc(e);if(i.operator!==void 0){let t=Fc(r.operator);return t!==void 0&&Nc(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${kc(e,i.node.first,i.node.last)} and ${t.name}.`:void 0}if(a===void 0)return;if(a.operator===void 0)return`Expression at location ${kc(e,a.node.first,a.node.last)} and expression at location ${kc(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return Pc(a.operator,r.operator)?void 0:Nc(a.operator,r.operator)?(Lc(t,a.operator),Rc(e)):`Precedence conflict between ops ${a.operator.name} in block ${kc(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=Fc(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(Pc(s,r.operator))return;if(!Nc(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${kc(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return Lc(t,s),Rc(e);let c=kc(e,a.node.first,a.node.last);return a.node.first.beginLine<i.node.first.beginLine&&r.operator.name===`=`?`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${s.name} in block ${c} and =.`:r.operator===_c?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},zc=e=>W(t=>{let n=Mc(t),r=jc(t,1);if(!e(r))n.push({node:r,operator:void 0});else return n.push({node:r,operator:t.lastOperator}),n.length===1?void 0:Rc(t)}),Bc=zc(()=>!1),Vc=zc(()=>!0),Hc=W(e=>{e.lastOperator=hc.get(e.token.image)}),Uc=e=>{let t=e[e.length-1],n=t.kind===`BangExt`?t.heirs[t.heirs.length-1]:t;return n.kind===`OpArgs`?n:void 0},Wc=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`&&e.heirs.length===2?Uc(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Gc=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!Tc(e,n.first.beginColumn))return n;let t=Gc(e,n);if(t!==void 0)return t}},Kc=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(E),n=(e,...t)=>t.some(t=>e.kind===E(t)),r=e=>e!==void 0&&lc.has(e.kind),i=e.token,a=Sc(e,i);i.next=void 0;let o=Sc(e,a);for(a.next=i;!t.includes(o.kind)&&!n(a,`THEOREM`,`PROPOSITION`);){if(n(a,`DEF`)){let e=i;if(n(e,`RBR`,`RSB`)){let t=1;for(;e.next!==void 0&&(e=e.next,!(n(e,`LBR`,`LSB`)&&t===1));)n(e,`LBR`,`LSB`)&&t>1&&t--,n(e,`RBR`,`RSB`)&&t++;e.next===void 0?e=void 0:e.next.kind===oc&&(e=e.next)}else if(e.kind===oc){let t=e.next;!r(t)||dc.has(t.kind)||uc.has(t.kind)&&t.next?.kind!==oc||(e=t.next?.kind===E(`SUBSTITUTE`)?i:uc.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==sc&&(e.next={kind:sc,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=Sc(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},qc=e=>{let t=Cc(e,1);if(t.kind===E(`LAB`)){let n=1;for(;n!==0;)if(t=Sc(e,t),t.kind===E(`LAB`)&&n++,t.kind===E(`RAB`)&&n--,t.kind===ac)return!1;return Sc(e,t).kind===E(`IN`)}if(t.kind!==oc)return!1;for(t=Sc(e,t);t.kind===E(`COMMA`);){if(t=Sc(e,t),t.kind!==oc)return!1;t=Sc(e,t)}return t.kind===E(`IN`)},Jc=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),Yc=e=>e.proofLevels.at(-1)??-1,Xc=e=>{let t=Cc(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:wc(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||Yc(e)>=0&&Jc(t)>Yc(e):wc(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},Zc=(e,t)=>{let n=Jc(t),r=e.proofLevels.length-1,i=e.proofLevels[r-1]??-1,a=e.proofLevels[r]<0;return a&&(e.proofLevels[r]=n<0?i+1:n),n===-1?!0:n===-2?a:a?n>i:e.proofLevels[r]===n},Qc=e=>W(t=>Zc(t,t.token)?void 0:`${kc(t,t.token)}: ${e}`),$c=vc([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(E)),el=vc([...$c.kinds,E(`op_76`)]),tl=vc(uc),nl=vc(dc),rl=vc([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(E)),il=()=>H(K({expansion:[V($c,`<op_77>`)],semantic:Tc}),V(`PrefixOp`,`InfixOp`),Vc),al=()=>V(B(K({expansion:[`OpenStart`],semantic:Tc}),`OpenExpression`,Bc),B(K({semantic:Tc}),`ExtendableExpr`)),ol=()=>V(B(`<MODULE>`,G(`identifier`),`Identifier`),`Expression`),sl=()=>V(B(K({semantic:e=>wc(`ASSUME`,`BOXASSUME`)(e)||Cc(e,2).kind===E(`COLONCOLON`)&&[E(`ASSUME`),E(`BOXASSUME`)].includes(Cc(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),cl=()=>[`JuncItem`,H(K({semantic:Ec}),`JuncItem`)],ll=e=>W(t=>{t.expecting=e,Oc(t)}),ul=e=>W(t=>{t.isTerminalProof=e}),dl=(e,...t)=>B(...t.slice(0,-1),G(`==`),`<DEF>`,W(t=>{Kc(t),t.expecting=e}),t[t.length-1]),q=(e,t,n)=>({message:e,body:B(...t),exit:n}),fl={CompilationUnit:q(void 0,[W(Kc),U(`Prelude`),`Module`]),Prelude:q(void 0,[`<BEGIN_PRAGMA>`,H(V(`<NUMBER>`,`<IDENTIFIER>`))]),Module:q(`Module definition`,[G(`---- MODULE`),`BeginModule`,G(`EXTENDS clause or module body`),`Extends`,G(`Module body`),`Body`,G(`==== or more Module body`),`EndModule`]),BeginModule:q(`Begin module`,[G(`---- MODULE (beginning of module)`),V(`<_BM0>`,`<_BM1>`,`<_BM2>`),ll(`Identifier`),`Identifier`,W(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:q(void 0,[`<END_MODULE>`]),Extends:q(`Extends`,[U(`<EXTENDS>`,ll(`Identifier`),`Identifier`,G(`comma or module body`),H(`<COMMA>`,ll(`Identifier`),`Identifier`))]),Body:q(`Module body`,[G(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),H(V(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,B(K({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,B(K({amount:2}),`Instance`),B(K({amount:2}),`Assumption`),B(K({amount:2}),`Theorem`),B(K({amount:1}),`Module`,W(Kc)),B(K({semantic:e=>wc(`USE`)(e)&&Cc(e,2).kind!==E(`ONLY`)||wc(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:q(`variable declaration`,[`<VARIABLE>`,G(`Identifier`),`Identifier`,G(`comma or module body`),H(`<COMMA>`,G(`Identifier`),`Identifier`)]),ParamDeclaration:q(`Parameter declaration`,[G(`CONSTANT`),`ParamSubDecl`,G(`Identifier, operator or _`),`ConstantDeclarationItems`,G(`,`),H(`<COMMA>`,G(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:q(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:q(`Recursive`,[G(`RECURSIVE`),`<RECURSIVE>`,G(`Identifier, operator or _`),`ConstantDeclarationItems`,G(`,`),H(`<COMMA>`,G(`Identifier, operator or _`),`ConstantDeclarationItems`,G("`,' or `)'"))]),ConstantDeclarationItems:q(`Constant declaration items`,[G(`Identifier, _ or prefix op`),V(B(`Identifier`,G(`(, comma, or Module Body`),U(K({amount:2}),`<LBR>`,G(`_`),`<US>`,G(`comma or )`),H(`<COMMA>`,G(`_`),`<US>`,G(`comma or )`)),`<RBR>`)),B(`NonExpPrefixOp`,G(`_`),`<US>`),B(`<US>`,G(`prefix or postfix operator`),V(B(`InfixOp`,G(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:q(`Definition`,[G(`LOCAL, Identifier or Operator Symbol`),U(`<LOCAL>`),`<DEFBREAK>`,G(`LOCAL, Identifier or Operator Symbol`),V(dl(`Expression`,K({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,G(`[`),`<LSB>`,G(`Identifier`),`QuantBound`,G(`COMMA or ]`),H(`<COMMA>`,G(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),dl(`Expression`,K({expansion:[`<IDENTIFIER>`,nl]}),`PostfixLHS`,`Expression`),dl(`Expression`,K({expansion:[`<IDENTIFIER>`,tl]}),`InfixLHS`,`Expression`),dl(`Expression or Instance`,K({expansion:[`<IDENTIFIER>`,V(`<LBR>`,`<DEF>`)]}),`IdentLHS`,V(`Expression`,`Instantiation`)),dl(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:q(`Identifier tuple`,[`<LAB>`,G(`Identifier or >>`),U(`Identifier`,G(`COMMA or >>`),H(`<COMMA>`,G(`COMMA or >>`),`Identifier`,G(`COMMA or >>`))),`<RAB>`]),IdentLHS:q(`Identifier LHS`,[`Identifier`,G(`( or ==`),U(`<LBR>`,G(`Identifier Declaration, prefix op, _ or )`),V(`IdentDecl`,`SomeFixDecl`),G(`COMMA or )`),H(`<COMMA>`,G(`Identifier Declaration, prefix op or _`),V(`IdentDecl`,`SomeFixDecl`),G(`COMMA or )`)),`<RBR>`)]),PrefixLHS:q(`Prefix LHS`,[el,G(`Identifier`),`Identifier`]),InfixLHS:q(`Infix LHS`,[`Identifier`,tl,`Identifier`]),PostfixLHS:q(`Postfix LHS`,[`Identifier`,nl]),IdentDecl:q(`Identifier Declation`,[`Identifier`,G(`( or ...`),U(`<LBR>`,G(`_`),`<US>`,G(`COMMA or )`),H(`<COMMA>`,G(`_`),`<US>`,G(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:q(`Op. Symbol Declaration`,[V(B(`NonExpPrefixOp`,G(`_`),`<US>`),B(`<US>`,G(`infix or postfix operator`),V(B(`InfixOp`,G(`_`),`<US>`),`PostfixOp`)))]),Instance:q(`Instance`,[G(`LOCAL or instance`),U(`<LOCAL>`),`Instantiation`,G(`COMMA or Module Body`)]),Instantiation:q(`NonLocalInstance`,[`<INSTANCE>`,ll(`Module identifier`),`Identifier`,G(`WITH or another definition.`),U(`<WITH>`,G(``),`Substitution`,G(``),H(K({amount:3}),`<COMMA>`,G(``),`Substitution`,G(``)))]),Substitution:q(`Substitution`,[V(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),G(`<-`),`<SUBSTITUTE>`,G(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:q(void 0,[$c,Hc]),NonExpPrefixOp:q(void 0,[el,Hc]),InfixOp:q(`Infix Op`,[tl,Hc]),PostfixOp:q(void 0,[nl,Hc]),Identifier:q(void 0,[`<IDENTIFIER>`]),Assumption:q(`Assumption`,[G(`ASSUM...`),V(`<ASSUMPTION>`,`<ASSUME>`),U(K({amount:2}),U(`<DEFBREAK>`),`Identifier`,G(`==`),`<DEF>`),W(e=>{Kc(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:q(`Assume-Prove`,[V(B(`Identifier`,`<COLONCOLON>`,`AssumeProve`),B(V(`<ASSUME>`,`<BOXASSUME>`),G(`Expression, Declaration, or AssumeProve`),sl(),G("PROVE or `,'"),H(`<COMMA>`,G(`Expression, Declaration, or AssumeProve`),sl(),G("PROVE or `,'")),V(`<PROVE>`,`<BOXPROVE>`),G(`Expression`),`Expression`))]),NewSymb:q(`NEW symbol declaration`,[G(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),V(B(K({amount:2}),V(B(K({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),G(`Constant declaration`),V(B(K({amount:2}),`IdentDecl`,U(`<IN>`,W(e=>{let t=jc(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${kc(e,t.first,t.last)}`:void 0}),G(`Expression`),`Expression`)),`SomeFixDecl`)),B(K({amount:2}),U(`<NEW>`),`<VARIABLE>`,G(`Identifier`),`Identifier`),B(K({amount:2}),U(`<NEW>`),V(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),G(`Declaration`),V(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:q(`Domain binding`,[U(`<IN>`,G(`Expression`),`Expression`)]),Theorem:q(`Theorem`,[G(`THEOREM, PROPOSITION`),V(`<THEOREM>`,`<PROPOSITION>`),G(`Identifier, Assume-Prove or Expression`),U(K({amount:2}),`Identifier`,G(`==`),`<DEF>`),W(Kc),V(B(K({amount:3}),K({semantic:wc(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),U(K({semantic:Xc}),`Proof`)]),Proof:q(`Proof`,[W(e=>{e.proofLevels.push(-1)}),V(B(K({semantic:e=>wc(`BY`)(e)||Cc(e,2).kind===E(`BY`)}),`UseOrHideOrBy`),B(K({amount:2}),U(`<PROOF>`),V(`<OBVIOUS>`,`<OMITTED>`)),B(U(K({amount:2}),`<PROOF>`),H(K({semantic:e=>Cc(e,2).kind!==E(`QED`)}),`Step`,G(`a proof step`)),`QEDStep`)),W(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:q(`UseOrHideOrBy`,[V(B(U(`<PROOF>`),`<BY>`,ul(!0),U(`<ONLY>`)),B(`<USE>`,ul(!1),U(`<ONLY>`)),B(`<HIDE>`,ul(!1))),G("an expression, `MODULE' or `DEF'"),U(ol(),H(`<COMMA>`,G(`MODULE or expression`),ol(),W(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),U(`<DF>`,G(`MODULE or expression`),ol(),H(`<COMMA>`,G(`MODULE or expression`),ol(),W(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),W(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:q(`QED step`,[G(`Step number`),rl,Qc(`QED step's number has bad level.`),G(`QED`),`<QED>`,U(K({semantic:Xc}),`Proof`)]),Step:q(`Step`,[G(`Step number`),rl,Qc(`step's number has bad level.`),G(`proof step`),V(B(K({semantic:wc(`USE`,`HIDE`)}),`UseOrHideOrBy`),B(K({semantic:wc(`INSTANCE`)}),`Instantiation`),B(K({semantic:wc(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),U(K({semantic:Xc}),W(e=>{let t=jc(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${kc(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:q(`DefStep`,[U(`<DEFINE>`),xc(K({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:q(`HaveStep`,[`<HAVE>`,G(`expression`),`Expression`]),TakeStep:q(`TakeStep`,[`<TAKE>`,G(`identifier`),V(B(K({expansion:[V(B(`<IDENTIFIER>`,H(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,G(`comma or step`),H(`<COMMA>`,G(`identifier or tuple of identifiers`),`QuantBound`,G(`comma or proof step`))),B(`Identifier`,G(`comma or proof step`),H(`<COMMA>`,G(`identifier`),`Identifier`,G(`comma or proof step`))))]),WitnessStep:q(`WitnessStep`,[`<WITNESS>`,G(`expression`),`Expression`,H(`<COMMA>`,G(`expression`),`Expression`,G(`comma or colon`))]),PickStep:q(`PickStep`,[`<PICK>`,G(`identifier`),V(B(K({expansion:[`<IDENTIFIER>`,H(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,G(`comma, or colon`),H(`<COMMA>`,G(`identifier`),`Identifier`,G(`comma or colon`))),B(`QuantBound`,G(`comma or colon`),H(`<COMMA>`,G(`identifier or tuple of identifiers`),`QuantBound`,G(`comma or colon`)))),`<COLON>`,G(`expression`),`Expression`]),CaseStep:q(`CaseStep`,[`<CASE>`,G(`expression`),`Expression`]),AssertStep:q(`AssertStep`,[U(`<SUFFICES>`,G(`expression or ASSUME/PROVE`)),V(`Expression`,B(K({semantic:wc(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:q(void 0,[V(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:q(void 0,[V(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:q(`String`,[`<STRING_LITERAL>`]),Number:q(void 0,[`<NUMBER_LITERAL>`,U(K({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:q(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,H(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:q(void 0,[V(B(K({amount:2,expansion:[V(el,tl,nl),vc([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(E))],semantic:Tc}),V(`NonExpPrefixOp`,B(`InfixOp`,W(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${kc(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),B(K({expansion:[`<LAMBDA>`],semantic:Tc}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:q(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:q(`Quantified form`,[V(`<EXISTS>`,`<FORALL>`),V(B(K({expansion:[`<IDENTIFIER>`,H(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,H(`<COMMA>`,`Identifier`)),B(`QuantBound`,H(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:q(`Bound Quantified Expression`,[V(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,H(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:q(`Quant Bound`,[V(`IdentifierTuple`,B(`Identifier`,H(`<COMMA>`,`Identifier`,G(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:q(`Some { } form`,[`<LBC>`,U(V(B(K({semantic:qc}),V(`IdentifierTuple`,`Identifier`),G(`\\in`),`<IN>`,`Expression`,G(`':', ',' or '}'`),U(V(B(`<COLON>`,`Expression`),xc(`<COMMA>`,`Expression`)))),B(K({expansion:[V(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,H(`<COMMA>`,`Expression`)),B(K({expansion:[V(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,H(`<COMMA>`,`QuantBound`)),B(`Expression`,U(V(B(`<COLON>`,W(e=>{let t=jc(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,H(`<COMMA>`,`QuantBound`)),xc(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:q(`Some [] Form`,[`<LSB>`,V(B(K({semantic:qc}),`QuantBound`,H(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),B(K({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,H(`<COMMA>`,`FieldVal`),`<RSB>`),B(K({semantic:e=>Cc(e,2).kind===E(`MAPTO`)&&fc.has(Cc(e,1).kind)}),W(e=>{Cc(e,1).kind=oc}),`FieldVal`,H(`<COMMA>`,`FieldVal`),`<RSB>`),B(K({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,H(`<COMMA>`,`FieldSet`),`<RSB>`),B(`Expression`,V(B(H(`<COMMA>`,`Expression`),`<RSB>`,W(e=>{let t=e.frames[e.frames.length-1];t.node=Ac(`FcnAppl`,t.heirs),e.lastOperator=gc})),B(`<ARROW>`,`Expression`,`<RSB>`),B(`<EXCEPT>`,`ExceptSpec`,H(`<COMMA>`,`ExceptSpec`),`<RSB>`),B(`<ARSB>`,`ReducedExpression`))))]),FieldVal:q(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:q(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:q(`Except Spec`,[`<BANG>`,xc(`ExceptComponent`,G(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:q(`Except Component`,[V(B(`<DOT>`,W(Oc),`Identifier`,W(e=>{e.token.image===`@`&&e.pushedErrors.push(`@ used in !.@`)})),B(`<LSB>`,`Expression`,H(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:q(`Some << -- >> or >>_ Form`,[`<LAB>`,U(`Expression`,H(`<COMMA>`,`Expression`)),V(`<RAB>`,B(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:q(void 0,[`Identifier`,U(K({amount:2}),`OpArgs`),V(B(`<BANG>`,`NoOpExtension`),W(e=>{e.isFairnessHooked=e.token.kind===E(`RBR`)}))]),ReducedExpression:q(`restricted form of expression`,[V(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:q(`Fairness Expression`,[W(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),V(`<WF>`,`<SF>`),`ReducedExpression`,U(K({amount:2}),`<LBR>`,`Expression`,`<RBR>`,W(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:q(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:q(`CASE Expression`,[`<CASE>`,`CaseArm`,H(K({semantic:e=>Dc(e)&&Cc(e,2).kind!==E(`OTHER`)}),`<CASESEP>`,`CaseArm`),U(K({semantic:Dc}),`<CASESEP>`,`OtherArm`)]),CaseArm:q(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:q(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:q(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:q(`Let Definitions`,[xc(V(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:q(`AND-OR Junction`,[W(e=>{let t=Cc(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),V(B(K({expansion:[`<OR>`]}),...cl()),B(K({expansion:[`<AND>`]}),...cl())),W(e=>{e.junctions.pop()})]),JuncItem:q(`Junction Item`,[V(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Gc(t,e.heirs[1]);return n&&`Item at ${kc(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${kc(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:q(`(Un)Bounded Choose`,[`<CHOOSE>`,V(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:q(`Lambda`,[`<LAMBDA>`,G(`Identifier`),`Identifier`,G("`,' or `:'"),H(`<COMMA>`,G(`Identifier`),`Identifier`,G("`,' or `:'")),`<COLON>`,G(`Expression`),`Expression`]),Expression:q(`Expression`,[W(e=>{e.operatorStacks.push([])}),il(),al()],(e,t)=>{let n=Mc(t);n.push({node:e.heirs[0],operator:_c});let r=Rc(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:q(`ExtendableExpr`,[V(B(K({expansion:[V(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),Bc,H(V(B(K({expansion:[`PostfixOp`],semantic:Tc}),`PostfixOp`,Vc),B(K({expansion:[`<DOT>`],semantic:Tc}),`<DOT>`,W(Oc),K({semantic:Tc}),`Identifier`,W(e=>{let t=Mc(e);t[t.length-1].operator!==void 0&&Ic(t,t.length),t[t.length-1]={node:Ac(`RecordComponent`,[t[t.length-1].node,jc(e,2),jc(e,1)]),operator:void 0}})),B(K({expansion:[`<LSB>`],semantic:Tc}),G(`function argument`),`SBracketCases`,zc(e=>e.kind===`FcnAppl`)))),U(V(B(K({expansion:[`InfixOp`],semantic:Tc}),`InfixOp`,Vc,il(),al()),B(K({expansion:[`<COLONCOLON>`],semantic:Tc}),`<COLONCOLON>`,W(e=>{let t=Mc(e);if(!Wc(t[t.length-1].node))return`\`::' at ${kc(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,W(e=>{let t=Mc(e),n=jc(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!Pc(r,e.lastOperator)){let t=jc(e,3);return`Removing label at ${kc(e,t.first,t.last)} would change expression parsing.`}t.push({node:Ac(`Label`,[jc(e,3),jc(e,2),n]),operator:void 0})}))))]),PrimitiveExp:q(`Primitive expression`,[V(B(K({expansion:[`String`],semantic:Tc}),`String`),B(K({expansion:[`<NUMBER_LITERAL>`],semantic:Tc}),`Number`),B(V(`Identifier`,B(V(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),W(e=>Yc(e)<0&&e.proofLevels.length<=1?`${kc(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${kc(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,B(K({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),U(K({amount:2}),`OpArgs`),H(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:Uc(e.heirs)===void 0?e.heirs.length===1?Ac(`GeneralId`,e.heirs):void 0:Ac(`OpApplication`,e.heirs)}),BangExt:q(`Bang Extension`,[`<BANG>`,V(B(V(B(K({expansion:[`Identifier`],semantic:e=>Cc(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),U(K({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:q(`StructOp`,[G("`<<' , `>>' , `:' , `@' , or number"),V(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,B(K({semantic:e=>Cc(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${kc(t,n.first,n.last)}`:void 0}),OpenStart:q(void 0,[V(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},pl=/* @__PURE__ */ new Map,ml=e=>{let t=pl.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=ml(e);for(let e of t.first)n.first.add(e);return n.hasSemanticStart||=t.hasSemanticStart,t.isNullable};if(e.type===`tokens`)n.first=e.kinds,n.isNullable=!1;else if(e.type===`call`)Object.assign(n,ml(fl[e.name].body));else if(e.type===`lookahead`)n.hasSemanticStart=e.semantic!==void 0;else if(e.type===`sequence`){let t=e.units[0];n.hasSemanticStart=t?.type===`lookahead`&&t.semantic!==void 0,n.isNullable=e.units.every((e,t)=>t===0&&e.type===`lookahead`||r(e))}else e.type===`choice`?n.isNullable=e.alternatives.map(r).some(Boolean):e.type!==`action`&&(n.isNullable=r(e.body)||e.type!==`oneOrMore`);return pl.set(e,n),n},hl=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},gl=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=Sc(e,e.scanPosition)),e.scanPosition=Sc(e,e.scanPosition),e.isRescanning){let t=0,n=e.token;for(;n!==void 0&&n!==e.scanPosition;)t++,n=n.next;n!==void 0&&t<100&&(e.farthestRescan=Math.max(e.farthestRescan,t))}return t.has(e.scanPosition.kind)?e.remaining===0&&e.scanPosition===e.lastPosition?`done`:`matched`:`failed`},_l=(e,t)=>{if(t.type===`tokens`)return gl(e,t.kinds);if(t.type===`call`)return _l(e,fl[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||hl(e,t.semantic)?`matched`:`failed`;if(t.type===`sequence`){for(let[n,r]of t.units.entries()){if(n===0&&r.type===`lookahead`)continue;let t=_l(e,r);if(t!==`matched`)return t}return`matched`}let n=e.scanPosition;if(t.type===`choice`){for(let r of t.alternatives){let t=r.units[0],i=t?.type!==`lookahead`||t.semantic===void 0||hl(e,t.semantic)?_l(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=_l(e,t.body);if(r===`failed`)return e.scanPosition=n,t.type===`oneOrMore`?`failed`:`matched`;if(r===`done`||t.type===`optional`)return r;for(;;){let n=e.scanPosition,r=_l(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},vl=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=_l(e,n)!==`failed`,i={generation:e.generation+t-e.remaining,first:e.token,amount:t},a=e.calls.get(n)??[],o=a.findIndex(t=>t.generation<=e.generation);return o===-1?a.push(i):a[o]=i,e.calls.set(n,a),r},yl=(e,t)=>t.findIndex(t=>{let n=t.units[0],r=n?.type===`lookahead`?n:void 0,i=r?.amount??1,a=r?.expansion??t,o=r?.semantic;return i===0||ml(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!ml(a).hasSemanticStart?ml(a).first.has(Cc(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):vl(e,i,a)&&(o===void 0||o(e))}),bl=e=>{e.isRescanning=!0;for(let[t,n]of e.calls)for(let r of n.filter(t=>t.generation>e.generation))if(e.remaining=r.amount,e.scanPosition=r.first,e.lastPosition=r.first,_l(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=Sc(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===ac){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=Sc(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${Oe(e.token.image)}" `},xl=(e,t)=>{let n=e.expecting===``?``:`Was expecting "${e.expecting}"\n`,r=e.messages.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``);return e.report=`${n}${t??bl(e)}\n\nResidual stack trace follows:\n${r}`,!1},Sl=(e,t)=>{let n=Sc(e,e.token);return t.has(n.kind)?(e.token=n,e.generation++,e.frames[e.frames.length-1].heirs.push({kind:`token`,heirs:[],first:n,last:n}),!0):(e.failedSwitchGeneration=e.generation,xl(e))},Cl=(e,t)=>{let n=fl[t];n.message!==void 0&&(e.messages.push({name:n.message,token:Cc(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!wl(e,n.body))return!1;e.frames.pop(),n.message!==void 0&&(e.messages.pop(),e.expecting=``);let i=n.exit?.(r,e);if(typeof i==`string`)return xl(e,i);let a=r.node??(r.heirs.length===0?void 0:Ac(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},wl=(e,t)=>{if(t.type===`tokens`)return Sl(e,t.kinds);if(t.type===`call`)return Cl(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||xl(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||xl(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||wl(e,t));if(t.type===`choice`){let n=yl(e,t.alternatives);return n===-1?xl(e):wl(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!wl(e,t.body))return!1;if(t.type===`optional`)return yl(e,[t.body])===-1||wl(e,t.body);for(;yl(e,[t.body])===0;)if(!wl(e,t.body))return!1;return!0},Tl=e=>{let t=Ee(e),n={kind:ac,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],pushedErrors:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=wl(r,{type:`call`,name:`CompilationUnit`});if(r.lexicalError!==void 0)return r.lexicalError;let a=[...r.pushedErrors,...i||r.report===void 0?[]:[`***Parse Error***\n${r.report}`]];return a.length===0?void 0:a.join(`
|
|
393
|
-
`)},
|
|
394
|
-
`&&r.push(e+1);return{name:e,source:t,tokens:n,lineOffsets:r,tokenIndexes:new Map(n.map((e,t)=>[
|
|
395
|
-
`,s),t=e===-1?a.length:e+1;o.push(a.slice(s,t)),s=t}else if(a.startsWith(`(*`,s)){let e=1,t=s,n=s+2;for(;e>0&&n<a.length;){let r=a.startsWith(`(*`,n),i=a.startsWith(`*)`,n);r||i?(e+=r?1:-1,n+=2,o.push(a.slice(t,n)),t=n):n++}t<n&&o.push(a.slice(t,n)),s=n}else s++;return o},
|
|
396
|
-
`,set:``}
|
|
335
|
+
`]]),Et=/* @__PURE__ */ new Map([[`Bags`,/* @__PURE__ */ new Map([[`IsABag`,`public static tlc2.value.IBoolValue tlc2.module.Bags.IsABag(tlc2.value.impl.Value)`],[`BagCardinality`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.BagCardinality(tlc2.value.impl.Value)`],[`BagIn`,`public static tlc2.value.IBoolValue tlc2.module.Bags.BagIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`CopiesIn`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.CopiesIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\oplus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagCup(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\ominus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagDiff(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagUnion`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagUnion(tlc2.value.impl.Value)`],[`\\sqsubseteq`,`public static tlc2.value.IBoolValue tlc2.module.Bags.SqSubseteq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagOfAll`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagOfAll(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagToSet`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagToSet(tlc2.value.impl.Value)`],[`SetToBag`,`public static tlc2.value.impl.Value tlc2.module.Bags.SetToBag(tlc2.value.impl.Value)`]])],[`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)`]])],[`TLCExt`,/* @__PURE__ */ new Map([[`AssertError`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`PickSuccessor`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`ToTrace`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.lassoOrdinal(tlc2.value.impl.Value)`],[`CounterExample`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.error(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`Trace`,`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`TLCDefer`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefer(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCNoOp`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcNoOp(tlc2.value.impl.Value)`],[`TLCModelValue`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.tlcModelValue(tlc2.value.impl.Value)`],[`TLCCache`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcEval2(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCFP`,`public static synchronized tlc2.value.impl.IntValue tlc2.module.TLCExt.tlcFingerprint(tlc2.value.impl.Value)`],[`TLCEvalDefinition`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefByName(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCGetOrDefault`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcGetOrDefault(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])]]),Dt=E(`EOF`),Ot=E(`IDENTIFIER`),kt=E(`DEFBREAK`),At=(e,t)=>Array.from({length:E(t)-E(e)+1},(t,n)=>E(e)+n),jt=new Set(At(`op_57`,`op_119`)),Mt=new Set(At(`op_1`,`op_119`)),Nt=new Set(At(`op_57`,`op_70`)),Pt=/* @__PURE__ */ new Set([...At(`ACTION`,`EXCEPT`),E(`EXTENDS`),...At(`IF`,`SF`),E(`STATE`),...At(`THEN`,`WITH`),E(`US`),...At(`op_112`,`op_116`)]),Ft=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),It=new Map([...Ft(`postfix`,160,160,!0,`[`),...Ft(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...Ft(`prefix`,120,120,!1,`-.`),...Ft(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...Ft(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...Ft(`prefix`,40,40,!0,`\\lnot`),...Ft(`nfix`,100,130,!0,`\\times`),...Ft(`infix`,140,140,!1,`^`,`^^`),...Ft(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...Ft(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...Ft(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...Ft(`infix`,100,110,!0,`|`,`||`,`%%`),...Ft(`infix`,100,110,!1,`%`),...Ft(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...Ft(`infix`,90,140,!1,`\\wr`),...Ft(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...Ft(`infix`,90,130,!1,`!!`),...Ft(`infix`,90,90,!1,`...`,`..`),...Ft(`infix`,80,80,!0,`\\intersect`,`\\union`),...Ft(`infix`,80,80,!1,`\\`),...Ft(`infix`,70,70,!1,`<:`,`:>`),...Ft(`infix`,60,60,!0,`@@`),...Ft(`infix`,50,140,!0,`\\cdot`),...Ft(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...Ft(`infix`,30,30,!0,`\\land`,`\\lor`),...Ft(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...Ft(`infix`,10,10,!1,`=>`)]),Lt=new Map([...It,...yt.flatMap(e=>e.slice(1).map(t=>[t,It.get(e[0])]))]),Rt=Lt.get(`[`),zt={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},Bt=e=>({type:`tokens`,kinds:new Set(e)}),Vt=e=>typeof e==`string`?e.startsWith(`<`)?Bt([E(e.slice(1,-1))]):{type:`call`,name:e}:e,N=(...e)=>({type:`sequence`,units:e.map(Vt)}),P=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:N(e))}),Ht=e=>(...t)=>({type:e,body:N(...t)}),F=Ht(`zeroOrMore`),Ut=Ht(`oneOrMore`),I=Ht(`optional`),L=e=>({type:`action`,run:t=>e(t)??void 0}),R=e=>L(t=>{t.expecting=e}),z=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&N(...e.expansion),semantic:e.semantic}),Wt=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),Gt=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=Wt(e,n);return n},Kt=(...e)=>{let t=e.map(E);return e=>t.includes(Gt(e,1).kind)},qt=(e,t=Gt(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},Jt=e=>{let t=Gt(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},Yt=e=>Kt(`CASESEP`)(e)&&qt(e),Xt=e=>{let t=Gt(e,1);Pt.has(t.kind)&&(t.kind=Ot)},Zt=(e,t,n=t)=>`line ${t.beginLine}, col ${t.beginColumn} to line ${n.beginLine}, col ${n.beginColumn+n.image.length-1} of module ${e.moduleName}`,Qt=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),$t=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},en=e=>e.operatorStacks[e.operatorStacks.length-1],tn=(e,t)=>e.low>t.high,nn=(e,t)=>e.high<t.low,rn=e=>e.fix===`prefix`?e:Lt.get(`${e.name}.`),an=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===Rt?Qt(`FcnAppl`,[n,...r.node.heirs]):Qt(`PostfixExpr`,[n,r.node]),operator:void 0})},on=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:Qt(`PrefixExpr`,[e[n-2].node,e[n-1].node]),operator:void 0});return}let r=e[n-3].node,i=t.fix===`nfix`;e.splice(n-3,3,{node:Qt(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},sn=e=>{let t=en(e),n=t.length-1,r=t[n],i=t[n-1],a=t[n-2];if(r.operator===void 0||r.operator.fix===`prefix`)return;if(i.operator?.fix===`postfix`)return an(t,n),sn(e);if(i.operator!==void 0){let t=rn(r.operator);return t!==void 0&&tn(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${Zt(e,i.node.first,i.node.last)} and ${t.name}.`:void 0}if(a===void 0)return;if(a.operator===void 0)return`Expression at location ${Zt(e,a.node.first,a.node.last)} and expression at location ${Zt(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return nn(a.operator,r.operator)?void 0:tn(a.operator,r.operator)?(on(t,a.operator),sn(e)):`Precedence conflict between ops ${a.operator.name} in block ${Zt(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=rn(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(nn(s,r.operator))return;if(!tn(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${Zt(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return on(t,s),sn(e);let c=Zt(e,a.node.first,a.node.last);return a.node.first.beginLine<i.node.first.beginLine&&r.operator.name===`=`?`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${s.name} in block ${c} and =.`:r.operator===zt?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},cn=e=>L(t=>{let n=en(t),r=$t(t,1);if(!e(r))n.push({node:r,operator:void 0});else return n.push({node:r,operator:t.lastOperator}),n.length===1?void 0:sn(t)}),ln=cn(()=>!1),un=cn(()=>!0),dn=L(e=>{e.lastOperator=Lt.get(e.token.image)}),fn=e=>{let t=e[e.length-1],n=t.kind===`BangExt`?t.heirs[t.heirs.length-1]:t;return n.kind===`OpArgs`?n:void 0},pn=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`&&e.heirs.length===2?fn(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},mn=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!qt(e,n.first.beginColumn))return n;let t=mn(e,n);if(t!==void 0)return t}},hn=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(E),n=(e,...t)=>t.some(t=>e.kind===E(t)),r=e=>e!==void 0&&jt.has(e.kind),i=e.token,a=Wt(e,i);i.next=void 0;let o=Wt(e,a);for(a.next=i;!t.includes(o.kind)&&!n(a,`THEOREM`,`PROPOSITION`);){if(n(a,`DEF`)){let e=i;if(n(e,`RBR`,`RSB`)){let t=1;for(;e.next!==void 0&&(e=e.next,!(n(e,`LBR`,`LSB`)&&t===1));)n(e,`LBR`,`LSB`)&&t>1&&t--,n(e,`RBR`,`RSB`)&&t++;e.next===void 0?e=void 0:e.next.kind===Ot&&(e=e.next)}else if(e.kind===Ot){let t=e.next;!r(t)||Nt.has(t.kind)||Mt.has(t.kind)&&t.next?.kind!==Ot||(e=t.next?.kind===E(`SUBSTITUTE`)?i:Mt.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==kt&&(e.next={kind:kt,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=Wt(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},gn=e=>{let t=Gt(e,1);if(t.kind===E(`LAB`)){let n=1;for(;n!==0;)if(t=Wt(e,t),t.kind===E(`LAB`)&&n++,t.kind===E(`RAB`)&&n--,t.kind===Dt)return!1;return Wt(e,t).kind===E(`IN`)}if(t.kind!==Ot)return!1;for(t=Wt(e,t);t.kind===E(`COMMA`);){if(t=Wt(e,t),t.kind!==Ot)return!1;t=Wt(e,t)}return t.kind===E(`IN`)},_n=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),vn=e=>e.proofLevels.at(-1)??-1,yn=e=>{let t=Gt(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:Kt(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||vn(e)>=0&&_n(t)>vn(e):Kt(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},bn=(e,t)=>{let n=_n(t),r=e.proofLevels.length-1,i=e.proofLevels[r-1]??-1,a=e.proofLevels[r]<0;return a&&(e.proofLevels[r]=n<0?i+1:n),n===-1?!0:n===-2?a:a?n>i:e.proofLevels[r]===n},xn=e=>L(t=>bn(t,t.token)?void 0:`${Zt(t,t.token)}: ${e}`),Sn=Bt([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(E)),Cn=Bt([...Sn.kinds,E(`op_76`)]),wn=Bt(Mt),Tn=Bt(Nt),En=Bt([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(E)),Dn=()=>F(z({expansion:[P(Sn,`<op_77>`)],semantic:qt}),P(`PrefixOp`,`InfixOp`),un),On=()=>P(N(z({expansion:[`OpenStart`],semantic:qt}),`OpenExpression`,ln),N(z({semantic:qt}),`ExtendableExpr`)),kn=()=>P(N(`<MODULE>`,R(`identifier`),`Identifier`),`Expression`),An=()=>P(N(z({semantic:e=>Kt(`ASSUME`,`BOXASSUME`)(e)||Gt(e,2).kind===E(`COLONCOLON`)&&[E(`ASSUME`),E(`BOXASSUME`)].includes(Gt(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),jn=()=>[`JuncItem`,F(z({semantic:Jt}),`JuncItem`)],Mn=e=>L(t=>{t.expecting=e,Xt(t)}),Nn=e=>L(t=>{t.isTerminalProof=e}),Pn=(e,...t)=>N(...t.slice(0,-1),R(`==`),`<DEF>`,L(t=>{hn(t),t.expecting=e}),t[t.length-1]),B=(e,t,n)=>({message:e,body:N(...t),exit:n}),Fn={CompilationUnit:B(void 0,[L(hn),I(`Prelude`),`Module`]),Prelude:B(void 0,[`<BEGIN_PRAGMA>`,F(P(`<NUMBER>`,`<IDENTIFIER>`))]),Module:B(`Module definition`,[R(`---- MODULE`),`BeginModule`,R(`EXTENDS clause or module body`),`Extends`,R(`Module body`),`Body`,R(`==== or more Module body`),`EndModule`]),BeginModule:B(`Begin module`,[R(`---- MODULE (beginning of module)`),P(`<_BM0>`,`<_BM1>`,`<_BM2>`),Mn(`Identifier`),`Identifier`,L(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:B(void 0,[`<END_MODULE>`]),Extends:B(`Extends`,[I(`<EXTENDS>`,Mn(`Identifier`),`Identifier`,R(`comma or module body`),F(`<COMMA>`,Mn(`Identifier`),`Identifier`))]),Body:B(`Module body`,[R(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),F(P(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,N(z({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,N(z({amount:2}),`Instance`),N(z({amount:2}),`Assumption`),N(z({amount:2}),`Theorem`),N(z({amount:1}),`Module`,L(hn)),N(z({semantic:e=>Kt(`USE`)(e)&&Gt(e,2).kind!==E(`ONLY`)||Kt(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:B(`variable declaration`,[`<VARIABLE>`,R(`Identifier`),`Identifier`,R(`comma or module body`),F(`<COMMA>`,R(`Identifier`),`Identifier`)]),ParamDeclaration:B(`Parameter declaration`,[R(`CONSTANT`),`ParamSubDecl`,R(`Identifier, operator or _`),`ConstantDeclarationItems`,R(`,`),F(`<COMMA>`,R(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:B(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:B(`Recursive`,[R(`RECURSIVE`),`<RECURSIVE>`,R(`Identifier, operator or _`),`ConstantDeclarationItems`,R(`,`),F(`<COMMA>`,R(`Identifier, operator or _`),`ConstantDeclarationItems`,R("`,' or `)'"))]),ConstantDeclarationItems:B(`Constant declaration items`,[R(`Identifier, _ or prefix op`),P(N(`Identifier`,R(`(, comma, or Module Body`),I(z({amount:2}),`<LBR>`,R(`_`),`<US>`,R(`comma or )`),F(`<COMMA>`,R(`_`),`<US>`,R(`comma or )`)),`<RBR>`)),N(`NonExpPrefixOp`,R(`_`),`<US>`),N(`<US>`,R(`prefix or postfix operator`),P(N(`InfixOp`,R(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:B(`Definition`,[R(`LOCAL, Identifier or Operator Symbol`),I(`<LOCAL>`),`<DEFBREAK>`,R(`LOCAL, Identifier or Operator Symbol`),P(Pn(`Expression`,z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,R(`[`),`<LSB>`,R(`Identifier`),`QuantBound`,R(`COMMA or ]`),F(`<COMMA>`,R(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),Pn(`Expression`,z({expansion:[`<IDENTIFIER>`,Tn]}),`PostfixLHS`,`Expression`),Pn(`Expression`,z({expansion:[`<IDENTIFIER>`,wn]}),`InfixLHS`,`Expression`),Pn(`Expression or Instance`,z({expansion:[`<IDENTIFIER>`,P(`<LBR>`,`<DEF>`)]}),`IdentLHS`,P(`Expression`,`Instantiation`)),Pn(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:B(`Identifier tuple`,[`<LAB>`,R(`Identifier or >>`),I(`Identifier`,R(`COMMA or >>`),F(`<COMMA>`,R(`COMMA or >>`),`Identifier`,R(`COMMA or >>`))),`<RAB>`]),IdentLHS:B(`Identifier LHS`,[`Identifier`,R(`( or ==`),I(`<LBR>`,R(`Identifier Declaration, prefix op, _ or )`),P(`IdentDecl`,`SomeFixDecl`),R(`COMMA or )`),F(`<COMMA>`,R(`Identifier Declaration, prefix op or _`),P(`IdentDecl`,`SomeFixDecl`),R(`COMMA or )`)),`<RBR>`)]),PrefixLHS:B(`Prefix LHS`,[Cn,R(`Identifier`),`Identifier`]),InfixLHS:B(`Infix LHS`,[`Identifier`,wn,`Identifier`]),PostfixLHS:B(`Postfix LHS`,[`Identifier`,Tn]),IdentDecl:B(`Identifier Declation`,[`Identifier`,R(`( or ...`),I(`<LBR>`,R(`_`),`<US>`,R(`COMMA or )`),F(`<COMMA>`,R(`_`),`<US>`,R(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:B(`Op. Symbol Declaration`,[P(N(`NonExpPrefixOp`,R(`_`),`<US>`),N(`<US>`,R(`infix or postfix operator`),P(N(`InfixOp`,R(`_`),`<US>`),`PostfixOp`)))]),Instance:B(`Instance`,[R(`LOCAL or instance`),I(`<LOCAL>`),`Instantiation`,R(`COMMA or Module Body`)]),Instantiation:B(`NonLocalInstance`,[`<INSTANCE>`,Mn(`Module identifier`),`Identifier`,R(`WITH or another definition.`),I(`<WITH>`,R(``),`Substitution`,R(``),F(z({amount:3}),`<COMMA>`,R(``),`Substitution`,R(``)))]),Substitution:B(`Substitution`,[P(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),R(`<-`),`<SUBSTITUTE>`,R(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:B(void 0,[Sn,dn]),NonExpPrefixOp:B(void 0,[Cn,dn]),InfixOp:B(`Infix Op`,[wn,dn]),PostfixOp:B(void 0,[Tn,dn]),Identifier:B(void 0,[`<IDENTIFIER>`]),Assumption:B(`Assumption`,[R(`ASSUM...`),P(`<ASSUMPTION>`,`<ASSUME>`),I(z({amount:2}),I(`<DEFBREAK>`),`Identifier`,R(`==`),`<DEF>`),L(e=>{hn(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:B(`Assume-Prove`,[P(N(`Identifier`,`<COLONCOLON>`,`AssumeProve`),N(P(`<ASSUME>`,`<BOXASSUME>`),R(`Expression, Declaration, or AssumeProve`),An(),R("PROVE or `,'"),F(`<COMMA>`,R(`Expression, Declaration, or AssumeProve`),An(),R("PROVE or `,'")),P(`<PROVE>`,`<BOXPROVE>`),R(`Expression`),`Expression`))]),NewSymb:B(`NEW symbol declaration`,[R(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),P(N(z({amount:2}),P(N(z({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),R(`Constant declaration`),P(N(z({amount:2}),`IdentDecl`,I(`<IN>`,L(e=>{let t=$t(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${Zt(e,t.first,t.last)}`:void 0}),R(`Expression`),`Expression`)),`SomeFixDecl`)),N(z({amount:2}),I(`<NEW>`),`<VARIABLE>`,R(`Identifier`),`Identifier`),N(z({amount:2}),I(`<NEW>`),P(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),R(`Declaration`),P(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:B(`Domain binding`,[I(`<IN>`,R(`Expression`),`Expression`)]),Theorem:B(`Theorem`,[R(`THEOREM, PROPOSITION`),P(`<THEOREM>`,`<PROPOSITION>`),R(`Identifier, Assume-Prove or Expression`),I(z({amount:2}),`Identifier`,R(`==`),`<DEF>`),L(hn),P(N(z({amount:3}),z({semantic:Kt(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),I(z({semantic:yn}),`Proof`)]),Proof:B(`Proof`,[L(e=>{e.proofLevels.push(-1)}),P(N(z({semantic:e=>Kt(`BY`)(e)||Gt(e,2).kind===E(`BY`)}),`UseOrHideOrBy`),N(z({amount:2}),I(`<PROOF>`),P(`<OBVIOUS>`,`<OMITTED>`)),N(I(z({amount:2}),`<PROOF>`),F(z({semantic:e=>Gt(e,2).kind!==E(`QED`)}),`Step`,R(`a proof step`)),`QEDStep`)),L(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:B(`UseOrHideOrBy`,[P(N(I(`<PROOF>`),`<BY>`,Nn(!0),I(`<ONLY>`)),N(`<USE>`,Nn(!1),I(`<ONLY>`)),N(`<HIDE>`,Nn(!1))),R("an expression, `MODULE' or `DEF'"),I(kn(),F(`<COMMA>`,R(`MODULE or expression`),kn(),L(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),I(`<DF>`,R(`MODULE or expression`),kn(),F(`<COMMA>`,R(`MODULE or expression`),kn(),L(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),L(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:B(`QED step`,[R(`Step number`),En,xn(`QED step's number has bad level.`),R(`QED`),`<QED>`,I(z({semantic:yn}),`Proof`)]),Step:B(`Step`,[R(`Step number`),En,xn(`step's number has bad level.`),R(`proof step`),P(N(z({semantic:Kt(`USE`,`HIDE`)}),`UseOrHideOrBy`),N(z({semantic:Kt(`INSTANCE`)}),`Instantiation`),N(z({semantic:Kt(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),I(z({semantic:yn}),L(e=>{let t=$t(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${Zt(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:B(`DefStep`,[I(`<DEFINE>`),Ut(z({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:B(`HaveStep`,[`<HAVE>`,R(`expression`),`Expression`]),TakeStep:B(`TakeStep`,[`<TAKE>`,R(`identifier`),P(N(z({expansion:[P(N(`<IDENTIFIER>`,F(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,R(`comma or step`),F(`<COMMA>`,R(`identifier or tuple of identifiers`),`QuantBound`,R(`comma or proof step`))),N(`Identifier`,R(`comma or proof step`),F(`<COMMA>`,R(`identifier`),`Identifier`,R(`comma or proof step`))))]),WitnessStep:B(`WitnessStep`,[`<WITNESS>`,R(`expression`),`Expression`,F(`<COMMA>`,R(`expression`),`Expression`,R(`comma or colon`))]),PickStep:B(`PickStep`,[`<PICK>`,R(`identifier`),P(N(z({expansion:[`<IDENTIFIER>`,F(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,R(`comma, or colon`),F(`<COMMA>`,R(`identifier`),`Identifier`,R(`comma or colon`))),N(`QuantBound`,R(`comma or colon`),F(`<COMMA>`,R(`identifier or tuple of identifiers`),`QuantBound`,R(`comma or colon`)))),`<COLON>`,R(`expression`),`Expression`]),CaseStep:B(`CaseStep`,[`<CASE>`,R(`expression`),`Expression`]),AssertStep:B(`AssertStep`,[I(`<SUFFICES>`,R(`expression or ASSUME/PROVE`)),P(`Expression`,N(z({semantic:Kt(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:B(void 0,[P(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:B(void 0,[P(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:B(`String`,[`<STRING_LITERAL>`]),Number:B(void 0,[`<NUMBER_LITERAL>`,I(z({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:B(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,F(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:B(void 0,[P(N(z({amount:2,expansion:[P(Cn,wn,Tn),Bt([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(E))],semantic:qt}),P(`NonExpPrefixOp`,N(`InfixOp`,L(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${Zt(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),N(z({expansion:[`<LAMBDA>`],semantic:qt}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:B(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:B(`Quantified form`,[P(`<EXISTS>`,`<FORALL>`),P(N(z({expansion:[`<IDENTIFIER>`,F(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,F(`<COMMA>`,`Identifier`)),N(`QuantBound`,F(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:B(`Bound Quantified Expression`,[P(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,F(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:B(`Quant Bound`,[P(`IdentifierTuple`,N(`Identifier`,F(`<COMMA>`,`Identifier`,R(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:B(`Some { } form`,[`<LBC>`,I(P(N(z({semantic:gn}),P(`IdentifierTuple`,`Identifier`),R(`\\in`),`<IN>`,`Expression`,R(`':', ',' or '}'`),I(P(N(`<COLON>`,`Expression`),Ut(`<COMMA>`,`Expression`)))),N(z({expansion:[P(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,F(`<COMMA>`,`Expression`)),N(z({expansion:[P(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,F(`<COMMA>`,`QuantBound`)),N(`Expression`,I(P(N(`<COLON>`,L(e=>{let t=$t(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,F(`<COMMA>`,`QuantBound`)),Ut(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:B(`Some [] Form`,[`<LSB>`,P(N(z({semantic:gn}),`QuantBound`,F(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),N(z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,F(`<COMMA>`,`FieldVal`),`<RSB>`),N(z({semantic:e=>Gt(e,2).kind===E(`MAPTO`)&&Pt.has(Gt(e,1).kind)}),L(e=>{Gt(e,1).kind=Ot}),`FieldVal`,F(`<COMMA>`,`FieldVal`),`<RSB>`),N(z({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,F(`<COMMA>`,`FieldSet`),`<RSB>`),N(`Expression`,P(N(F(`<COMMA>`,`Expression`),`<RSB>`,L(e=>{let t=e.frames[e.frames.length-1];t.node=Qt(`FcnAppl`,t.heirs),e.lastOperator=Rt})),N(`<ARROW>`,`Expression`,`<RSB>`),N(`<EXCEPT>`,`ExceptSpec`,F(`<COMMA>`,`ExceptSpec`),`<RSB>`),N(`<ARSB>`,`ReducedExpression`))))]),FieldVal:B(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:B(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:B(`Except Spec`,[`<BANG>`,Ut(`ExceptComponent`,R(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:B(`Except Component`,[P(N(`<DOT>`,L(Xt),`Identifier`,L(e=>{e.token.image===`@`&&e.pushedErrors.push(`@ used in !.@`)})),N(`<LSB>`,`Expression`,F(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:B(`Some << -- >> or >>_ Form`,[`<LAB>`,I(`Expression`,F(`<COMMA>`,`Expression`)),P(`<RAB>`,N(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:B(void 0,[`Identifier`,I(z({amount:2}),`OpArgs`),P(N(`<BANG>`,`NoOpExtension`),L(e=>{e.isFairnessHooked=e.token.kind===E(`RBR`)}))]),ReducedExpression:B(`restricted form of expression`,[P(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:B(`Fairness Expression`,[L(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),P(`<WF>`,`<SF>`),`ReducedExpression`,I(z({amount:2}),`<LBR>`,`Expression`,`<RBR>`,L(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:B(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:B(`CASE Expression`,[`<CASE>`,`CaseArm`,F(z({semantic:e=>Yt(e)&&Gt(e,2).kind!==E(`OTHER`)}),`<CASESEP>`,`CaseArm`),I(z({semantic:Yt}),`<CASESEP>`,`OtherArm`)]),CaseArm:B(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:B(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:B(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:B(`Let Definitions`,[Ut(P(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:B(`AND-OR Junction`,[L(e=>{let t=Gt(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),P(N(z({expansion:[`<OR>`]}),...jn()),N(z({expansion:[`<AND>`]}),...jn())),L(e=>{e.junctions.pop()})]),JuncItem:B(`Junction Item`,[P(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=mn(t,e.heirs[1]);return n&&`Item at ${Zt(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${Zt(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:B(`(Un)Bounded Choose`,[`<CHOOSE>`,P(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:B(`Lambda`,[`<LAMBDA>`,R(`Identifier`),`Identifier`,R("`,' or `:'"),F(`<COMMA>`,R(`Identifier`),`Identifier`,R("`,' or `:'")),`<COLON>`,R(`Expression`),`Expression`]),Expression:B(`Expression`,[L(e=>{e.operatorStacks.push([])}),Dn(),On()],(e,t)=>{let n=en(t);n.push({node:e.heirs[0],operator:zt});let r=sn(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:B(`ExtendableExpr`,[P(N(z({expansion:[P(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),ln,F(P(N(z({expansion:[`PostfixOp`],semantic:qt}),`PostfixOp`,un),N(z({expansion:[`<DOT>`],semantic:qt}),`<DOT>`,L(Xt),z({semantic:qt}),`Identifier`,L(e=>{let t=en(e);t[t.length-1].operator!==void 0&&an(t,t.length),t[t.length-1]={node:Qt(`RecordComponent`,[t[t.length-1].node,$t(e,2),$t(e,1)]),operator:void 0}})),N(z({expansion:[`<LSB>`],semantic:qt}),R(`function argument`),`SBracketCases`,cn(e=>e.kind===`FcnAppl`)))),I(P(N(z({expansion:[`InfixOp`],semantic:qt}),`InfixOp`,un,Dn(),On()),N(z({expansion:[`<COLONCOLON>`],semantic:qt}),`<COLONCOLON>`,L(e=>{let t=en(e);if(!pn(t[t.length-1].node))return`\`::' at ${Zt(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,L(e=>{let t=en(e),n=$t(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!nn(r,e.lastOperator)){let t=$t(e,3);return`Removing label at ${Zt(e,t.first,t.last)} would change expression parsing.`}t.push({node:Qt(`Label`,[$t(e,3),$t(e,2),n]),operator:void 0})}))))]),PrimitiveExp:B(`Primitive expression`,[P(N(z({expansion:[`String`],semantic:qt}),`String`),N(z({expansion:[`<NUMBER_LITERAL>`],semantic:qt}),`Number`),N(P(`Identifier`,N(P(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),L(e=>vn(e)<0&&e.proofLevels.length<=1?`${Zt(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${Zt(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,N(z({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),I(z({amount:2}),`OpArgs`),F(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:fn(e.heirs)===void 0?e.heirs.length===1?Qt(`GeneralId`,e.heirs):void 0:Qt(`OpApplication`,e.heirs)}),BangExt:B(`Bang Extension`,[`<BANG>`,P(N(P(N(z({expansion:[`Identifier`],semantic:e=>Gt(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),I(z({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:B(`StructOp`,[R("`<<' , `>>' , `:' , `@' , or number"),P(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,N(z({semantic:e=>Gt(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${Zt(t,n.first,n.last)}`:void 0}),OpenStart:B(void 0,[P(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},In=/* @__PURE__ */ new Map,Ln=e=>{let t=In.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=Ln(e);for(let e of t.first)n.first.add(e);return n.hasSemanticStart||=t.hasSemanticStart,t.isNullable};if(e.type===`tokens`)n.first=e.kinds,n.isNullable=!1;else if(e.type===`call`)Object.assign(n,Ln(Fn[e.name].body));else if(e.type===`lookahead`)n.hasSemanticStart=e.semantic!==void 0;else if(e.type===`sequence`){let t=e.units[0];n.hasSemanticStart=t?.type===`lookahead`&&t.semantic!==void 0,n.isNullable=e.units.every((e,t)=>t===0&&e.type===`lookahead`||r(e))}else e.type===`choice`?n.isNullable=e.alternatives.map(r).some(Boolean):e.type!==`action`&&(n.isNullable=r(e.body)||e.type!==`oneOrMore`);return In.set(e,n),n},Rn=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},zn=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=Wt(e,e.scanPosition)),e.scanPosition=Wt(e,e.scanPosition),e.isRescanning){let t=0,n=e.token;for(;n!==void 0&&n!==e.scanPosition;)t++,n=n.next;n!==void 0&&t<100&&(e.farthestRescan=Math.max(e.farthestRescan,t))}return t.has(e.scanPosition.kind)?e.remaining===0&&e.scanPosition===e.lastPosition?`done`:`matched`:`failed`},Bn=(e,t)=>{if(t.type===`tokens`)return zn(e,t.kinds);if(t.type===`call`)return Bn(e,Fn[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||Rn(e,t.semantic)?`matched`:`failed`;if(t.type===`sequence`){for(let[n,r]of t.units.entries()){if(n===0&&r.type===`lookahead`)continue;let t=Bn(e,r);if(t!==`matched`)return t}return`matched`}let n=e.scanPosition;if(t.type===`choice`){for(let r of t.alternatives){let t=r.units[0],i=t?.type!==`lookahead`||t.semantic===void 0||Rn(e,t.semantic)?Bn(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=Bn(e,t.body);if(r===`failed`)return e.scanPosition=n,t.type===`oneOrMore`?`failed`:`matched`;if(r===`done`||t.type===`optional`)return r;for(;;){let n=e.scanPosition,r=Bn(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},Vn=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=Bn(e,n)!==`failed`,i={generation:e.generation+t-e.remaining,first:e.token,amount:t},a=e.calls.get(n)??[],o=a.findIndex(t=>t.generation<=e.generation);return o===-1?a.push(i):a[o]=i,e.calls.set(n,a),r},Hn=(e,t)=>t.findIndex(t=>{let n=t.units[0],r=n?.type===`lookahead`?n:void 0,i=r?.amount??1,a=r?.expansion??t,o=r?.semantic;return i===0||Ln(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!Ln(a).hasSemanticStart?Ln(a).first.has(Gt(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):Vn(e,i,a)&&(o===void 0||o(e))}),Un=e=>{e.isRescanning=!0;for(let[t,n]of e.calls)for(let r of n.filter(t=>t.generation>e.generation))if(e.remaining=r.amount,e.scanPosition=r.first,e.lastPosition=r.first,Bn(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=Wt(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===Dt){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=Wt(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${Oe(e.token.image)}" `},Wn=(e,t)=>{let n=e.expecting===``?``:`Was expecting "${e.expecting}"\n`,r=e.messages.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``);return e.report=`${n}${t??Un(e)}\n\nResidual stack trace follows:\n${r}`,!1},Gn=(e,t)=>{let n=Wt(e,e.token);return t.has(n.kind)?(e.token=n,e.generation++,e.frames[e.frames.length-1].heirs.push({kind:`token`,heirs:[],first:n,last:n}),!0):(e.failedSwitchGeneration=e.generation,Wn(e))},Kn=(e,t)=>{let n=Fn[t];n.message!==void 0&&(e.messages.push({name:n.message,token:Gt(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!qn(e,n.body))return!1;e.frames.pop(),n.message!==void 0&&(e.messages.pop(),e.expecting=``);let i=n.exit?.(r,e);if(typeof i==`string`)return Wn(e,i);let a=r.node??(r.heirs.length===0?void 0:Qt(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},qn=(e,t)=>{if(t.type===`tokens`)return Gn(e,t.kinds);if(t.type===`call`)return Kn(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||Wn(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||Wn(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||qn(e,t));if(t.type===`choice`){let n=Hn(e,t.alternatives);return n===-1?Wn(e):qn(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!qn(e,t.body))return!1;if(t.type===`optional`)return Hn(e,[t.body])===-1||qn(e,t.body);for(;Hn(e,[t.body])===0;)if(!qn(e,t.body))return!1;return!0},Jn=e=>{let t=Ee(e),n={kind:Dt,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],pushedErrors:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=qn(r,{type:`call`,name:`CompilationUnit`});if(r.lexicalError!==void 0)return r.lexicalError;let a=[...r.pushedErrors,...i||r.report===void 0?[]:[`***Parse Error***\n${r.report}`]];return a.length===0?void 0:a.join(`
|
|
336
|
+
`)},Yn=/* @__PURE__ */ new Map([[`(`,`)`],[`[`,`]`],[`{`,`}`],[`<<`,`>>`]]),Xn=(e,t)=>`${e}:${t}`,Zn=(e,t)=>{let n=tt(t).filter(e=>e.kind!==`End`).map(Xe),r=[0,0];for(let e=0;e<t.length;e++)t[e]===`
|
|
337
|
+
`&&r.push(e+1);return{name:e,source:t,tokens:n,lineOffsets:r,tokenIndexes:new Map(n.map((e,t)=>[Xn(e.line,e.column),t]))}},Qn=(e,t,n)=>e.tokens[t]!==void 0&&e.tokens[t].text===n&&e.tokens[t].kind!==`String`,$n=(e,t,n)=>{let r=0,i=e.tokens.length;for(;r<i;){let a=r+i>>>1,o=e.tokens[a];o.line<t.line||o.line===t.line&&(n?o.column<=t.column:o.column<t.column)?r=a+1:i=a}return r},er=(e,t)=>e.tokenIndexes.get(Xn(t.line,t.column))??Math.min($n(e,t,!1),e.tokens.length-1),tr=(e,t)=>Math.max($n(e,t,!0)-1,0),nr=(e,t)=>{let n=e.tokens[t].text,r=Yn.get(n);if(r===void 0)return t;let i=0;for(let a=t;a<e.tokens.length;a++)if(Qn(e,a,n))i++;else if(Qn(e,a,r)&&(i--,i===0))return a;return t},rr=(e,t)=>({start:er(e,t.start),end:tr(e,t.end)}),ir=(e,t)=>{let n=t.location.range;if(n)return rr(e,n);let r=er(e,t.location);return{start:r,end:nr(e,r)}},ar=(e,t)=>{let n=t.start-1,r=t.end+1;return Qn(e,n,`(`)&&Qn(e,r,`)`)&&nr(e,n)===r?ar(e,{start:n,end:r}):t},or=(e,t)=>{let n=t.start-1,r=t.end+1;return Qn(e,n,`(`)&&nr(e,n)===r&&(Qn(e,n-1,`(`)||Qn(e,n-1,`,`))?or(e,{start:n,end:r}):t},sr=(e,t)=>({file:e.name,beginLine:e.tokens[t.start].line,beginColumn:e.tokens[t.start].column,endLine:e.tokens[t.end].line,endColumn:e.tokens[t.end].endColumn}),cr=(e,t)=>sr(e,{start:t,end:t}),lr=(e,t,n)=>{let r=0,i=e.lineOffsets[t];for(;i<e.source.length;){if(r=e.source[i]===` `?be(r):r+1,r>=n)return i;i++}return i},ur=(e,t)=>{let n=e.tokens[t],r=lr(e,n.line,n.column);return e.source.slice(r,lr(e,n.line,n.endColumn)+1)},dr=(e,t)=>{let n=e.tokens[t],r=e.tokens[t+1];return n?.kind===`Operator`&&n.text===`[]`&&r?.kind===`Keyword`&&(r.text===`ASSUME`||r.text===`PROVE`)&&r.line===n.line&&r.column===n.endColumn+1},fr=e=>{let t=Zn(``,e),n=t.tokens.reduce((e,n,r)=>{if(!dr(t,r))return e;let i=lr(t,n.line,n.column);return`${e.slice(0,i)} ${e.slice(i+2)}`},e);if(n!==e&&Jn(e)!==void 0)throw new s(`SANY rejects a []ASSUME or []PROVE outside an ASSUME/PROVE`);return n},pr=(e,t)=>{let n=e.tokens[t-1],r=e.tokens[t],i=n===void 0?0:lr(e,n.line,n.endColumn)+1,a=e.source.slice(i,lr(e,r.line,r.column)),o=[],s=0;for(;s<a.length;)if(a.startsWith(`\\*`,s)){let e=a.indexOf(`
|
|
338
|
+
`,s),t=e===-1?a.length:e+1;o.push(a.slice(s,t)),s=t}else if(a.startsWith(`(*`,s)){let e=1,t=s,n=s+2;for(;e>0&&n<a.length;){let r=a.startsWith(`(*`,n),i=a.startsWith(`*)`,n);r||i?(e+=r?1:-1,n+=2,o.push(a.slice(t,n)),t=n):n++}t<n&&o.push(a.slice(t,n)),s=n}else s++;return o},mr=(e,t,n,r)=>{let i=[];for(let a=t;a<n&&i.length<r.length;a++){let t=e.tokens[a];t.kind===`Identifier`&&t.text===r[i.length]&&i.push(a)}return i},hr=(e,t,n,r)=>{for(let i=t;i<=n;i++)if(Qn(e,i,r))return i;return-1},gr=/* @__PURE__ */ new Map([[`Identifier`,`N_GeneralId`],[`Subexpression`,`N_GeneralId`],[`Number`,`N_Number`],[`Decimal`,`N_Real`],[`SetEnumeration`,`N_SetEnumerate`],[`SetFilter`,`N_SubsetOf`],[`SetMap`,`N_SetOfAll`],[`Tuple`,`N_Tuple`],[`Product`,`N_Times`],[`FunctionApplication`,`N_FcnAppl`],[`FunctionConstruction`,`N_FcnConst`],[`FunctionSet`,`N_SetOfFcns`],[`Record`,`N_RcdConstructor`],[`RecordSet`,`N_SetOfRcds`],[`FieldAccess`,`N_RecordComponent`],[`Except`,`N_Except`],[`Prime`,`N_PostfixExpr`],[`Always`,`N_PrefixExpr`],[`Eventually`,`N_PrefixExpr`],[`Enabled`,`N_PrefixExpr`],[`Unchanged`,`N_PrefixExpr`],[`Forall`,`N_BoundedQuant`],[`Exists`,`N_BoundedQuant`],[`UnboundedQuantifier`,`N_UnboundedQuant`],[`Choose`,`N_UnBoundedOrBoundedChoose`],[`If`,`N_IfThenElse`],[`Case`,`N_Case`],[`Let`,`N_LetIn`],[`BoxAction`,`N_ActionExpr`],[`AngleAction`,`N_ActionExpr`],[`WeakFairness`,`N_FairnessExpr`],[`StrongFairness`,`N_FairnessExpr`]]),_r=/* @__PURE__ */ new Set([`N_GeneralId`,`N_OpApplication`,`N_PrefixExpr`,`N_InfixExpr`,`N_PostfixExpr`,`N_FcnAppl`,`N_RecordComponent`]),vr=(e,t)=>Qn(e,t.start,`(`)&&nr(e,t.start)===t.end,yr=(e,t)=>ar(e,ir(e,t)),br=(e,t,n)=>yr(e,t.args[0]).start===n.start?t.args.length===2?`N_InfixExpr`:`N_PostfixExpr`:e.tokens[n.start].kind===`Identifier`?`N_OpApplication`:`N_PrefixExpr`,xr=(e,t,n)=>vr(e,n)?`N_ParenExpr`:t.kind===`String`?ur(e,n.start):t.kind===`Apply`?br(e,t,n):t.kind===`And`||t.kind===`Or`?t.isBulleted?t.kind===`And`?`N_ConjList`:`N_DisjList`:`N_InfixExpr`:gr.get(t.kind),Sr=(e,t,n)=>{if(t.kind===`String`&&!vr(e,n))return!1;if(t.kind===`Identifier`&&!t.name.includes(`!`))return!0;let r=xr(e,t,n);return r===void 0||_r.has(r)?void 0:!0},Cr=(e,t,n)=>{let r=(t,n=t)=>sr(e,{start:t,end:n}),i=(t,n=yr(e,t))=>({last:sr(e,n),lastKind:xr(e,t,n)}),a=(e,t)=>({hasChildlessFirstChild:!1,last:r(n.start+1,e),lastKind:t}),o=(t,n)=>{let i=yr(e,t);return{hasChildlessFirstChild:Sr(e,t,i),last:r(i.end+1),lastKind:n}};if(vr(e,n))return{hasChildlessFirstChild:!1,...i(t,{start:n.start+1,end:n.end-1})};switch(t.kind){case`If`:case`BoxAction`:case`AngleAction`:return{hasChildlessFirstChild:!1,...i(t.kind===`If`?t.condition:t.action)};case`Tuple`:case`SetEnumeration`:{let a=t.elements[0];return a===void 0?{hasChildlessFirstChild:!1,last:r(n.end),lastKind:e.tokens[n.end].text}:{hasChildlessFirstChild:!1,...i(a)}}case`Except`:return{hasChildlessFirstChild:!1,...i(t.function)};case`FunctionSet`:return{hasChildlessFirstChild:!1,...i(t.domain)};case`SetMap`:return{hasChildlessFirstChild:!1,...i(t.expression)};case`WeakFairness`:case`StrongFairness`:return{hasChildlessFirstChild:!1,...i(t.subscript)};case`Case`:return a(yr(e,t.arms[0].body).end,`N_CaseArm`);case`Record`:case`RecordSet`:return a(yr(e,t.fields[0].value).end,t.kind===`Record`?`N_FieldVal`:`N_FieldSet`);case`FunctionConstruction`:case`Forall`:case`Exists`:return a(yr(e,t.bounds[0].set).end,`N_QuantBound`);case`Choose`:case`SetFilter`:return(t.kind===`Choose`?t.pattern:t.bound.pattern).kind===`Tuple`?a(nr(e,n.start+1),`N_IdentifierTuple`):void 0;case`Decimal`:{let t=e.tokens[n.start],i=t.column+t.text.indexOf(`.`);return{hasChildlessFirstChild:!1,last:{...r(n.start),beginColumn:i,endColumn:i},lastKind:`.`}}case`Let`:return a(yr(e,t.body).start-2,`N_LetDefinitions`);case`Product`:return o(t.factors[0],`N_GenInfixOp`);case`And`:case`Or`:{if(t.operands.length===1)return;if(!t.isBulleted&&t.operands.length>2)return{hasChildlessFirstChild:void 0,last:r(yr(e,t.operands[t.operands.length-1]).start-1),lastKind:`N_GenInfixOp`};if(!t.isBulleted)return o(t.operands[0],`N_GenInfixOp`);let n=yr(e,t.operands[1]);return{hasChildlessFirstChild:!0,last:r(n.start-1,n.end),lastKind:t.kind===`And`?`N_ConjItem`:`N_DisjItem`}}case`Always`:case`Eventually`:case`Enabled`:case`Unchanged`:return{hasChildlessFirstChild:!0,...i(t.expression,{start:n.start+1,end:n.end})};case`Prime`:return{hasChildlessFirstChild:Sr(e,t.expression,yr(e,t.expression)),last:r(n.end),lastKind:`N_GenPostfixOp`};case`FunctionApplication`:case`FieldAccess`:{let n=t.kind===`FunctionApplication`?t.function:t.record,i=yr(e,n),a=i.end+1;return{hasChildlessFirstChild:Sr(e,n,i),last:r(a),lastKind:e.tokens[a].text}}case`Apply`:{let a=br(e,t,n);return a===`N_OpApplication`?t.operator.includes(`!`)?void 0:{hasChildlessFirstChild:!0,last:r(n.start+1,n.end),lastKind:`N_OpArgs`}:a===`N_PrefixExpr`?{hasChildlessFirstChild:!0,...i(t.args[0],{start:n.start+1,end:n.end})}:o(t.args[0],a===`N_InfixExpr`?`N_GenInfixOp`:`N_GenPostfixOp`)}}},wr=(e,t)=>{let n=yr(e,t),r=sr(e,n),i=Cr(e,t,n),a=t.kind===`Number`||t.kind===`String`||(t.kind===`And`||t.kind===`Or`)&&t.operands.length===1;return i===void 0&&a||i!==void 0&&i.hasChildlessFirstChild===void 0?[{location:r,message:`DEF clause entry should describe a defined operator.`}]:i?.hasChildlessFirstChild===void 0||i.lastKind===void 0?[]:[...i.hasChildlessFirstChild?[{location:r,message:`Was expecting a GeneralId.`}]:[],...i.lastKind===`N_OpArgs`?[{location:i.last,message:"Selector `!(...)' should not have argument(s)."}]:[{location:i.last,message:`Unexpected token found.`},{location:i.last,message:`Need name or step number here, not \`${i.lastKind}'.`}],{location:r,message:`DEF clause entry should describe a defined operator.`}]},Tr={low:15,high:15},Er={low:16,high:16},V=(e,t,n)=>({low:e,high:t,isAssociative:n}),Dr=new Map([[`=>`,V(1,1,!1)],[`<=>`,V(2,2,!1)],[`~>`,V(2,2,!1)],[`-+->`,V(2,2,!1)],[`/\\`,V(3,3,!0)],[`\\/`,V(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,V(5,5,!1)]),[`\\cdot`,V(5,14,!0)],[`@@`,V(6,6,!0)],[`:>`,V(7,7,!1)],[`<:`,V(7,7,!1)],[`\\cup`,V(8,8,!0)],[`\\cap`,V(8,8,!0)],[`\\`,V(8,8,!1)],[`..`,V(9,9,!1)],[`...`,V(9,9,!1)],[`##`,V(9,13,!0)],[`$`,V(9,13,!0)],[`$$`,V(9,13,!0)],[`??`,V(9,13,!0)],[`!!`,V(9,13,!1)],[`\\sqcap`,V(9,13,!0)],[`\\sqcup`,V(9,13,!0)],[`\\uplus`,V(9,13,!0)],[`\\wr`,V(9,14,!1)],[`+`,V(10,10,!0)],[`++`,V(10,10,!0)],[`(+)`,V(10,10,!0)],[`\\oplus`,V(10,10,!0)],[`%`,V(10,11,!1)],[`%%`,V(10,11,!0)],[`|`,V(10,11,!0)],[`||`,V(10,11,!0)],[`\\X`,V(10,13,!1)],[`-`,V(11,11,!0)],[`--`,V(11,11,!0)],[`(-)`,V(11,11,!0)],[`\\ominus`,V(11,11,!0)],[`*`,V(13,13,!0)],[`**`,V(13,13,!0)],[`/`,V(13,13,!1)],[`//`,V(13,13,!1)],[`\\div`,V(13,13,!1)],[`\\o`,V(13,13,!0)],[`(.)`,V(13,13,!0)],[`\\odot`,V(13,13,!0)],[`(/)`,V(13,13,!1)],[`\\oslash`,V(13,13,!1)],[`(\\X)`,V(13,13,!0)],[`\\otimes`,V(13,13,!0)],[`&`,V(13,13,!0)],[`&&`,V(13,13,!0)],[`\\star`,V(13,13,!0)],[`\\bullet`,V(13,13,!0)],[`\\bigcirc`,V(13,13,!0)],[`^`,V(14,14,!1)],[`^^`,V(14,14,!1)]]),Or=(e,t)=>t.isAssociative||e===`%`||e===`\\X`,kr=/* @__PURE__ */ new Map([[`~`,{low:4,high:4}],[`[]`,{low:4,high:15}],[`<>`,{low:4,high:15}],[`ENABLED`,{low:4,high:15}],[`UNCHANGED`,{low:4,high:15}],[`SUBSET`,{low:8,high:8}],[`UNION`,{low:8,high:8}],[`DOMAIN`,{low:9,high:9}],[`-`,{low:12,high:12}],[`-.`,{low:12,high:12}]]),Ar={low:17,high:17},jr=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`,`@`,`\\A`,`\\E`,`\\AA`,`\\EE`,`IF`,`CASE`,`LET`,`CHOOSE`,`LAMBDA`,`WF_`,`SF_`]),Mr=/* @__PURE__ */ new Set([`(`,`{`,`<<`]),Nr=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),Pr=/* @__PURE__ */ new Set([...Nr,`'`]),Fr=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),Ir=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),Lr=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),Rr=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),zr=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,...Pr]),Br=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),Vr=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Hr=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Ur=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),Wr=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),Gr=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),Kr=/* @__PURE__ */ new Set([``,`*`,`-`]),qr={Obvious:`n OBVIOUS`,Omitted:`n OMITTED`,By:` BY`},Jr=(e,t)=>e.line-t.line||e.column-t.column,Yr=(e,t)=>({start:Jr(e.start,t.start)<=0?e.start:t.start,stop:Jr(e.stop,t.stop)>=0?e.stop:t.stop}),Xr=e=>({start:{line:e.start.line,column:e.start.column},stop:{line:e.end.line,column:e.end.column+1}}),Zr={printed:``,set:``},Qr={printed:`
|
|
339
|
+
`,set:``},$r={printed:`
|
|
397
340
|
`,set:`
|
|
398
|
-
`},
|
|
399
|
-
`)}\n`},Ku=(e,t,n=tt(e,t===`tlapm`))=>{let r=t===`tlapm`,i=r?n:n.map(Xe),a=0,o=[],c,l,u=[],d=[],f,p=0,m=[],h=/* @__PURE__ */ new WeakMap,g=e=>u[u.length-1].has(e),_=e=>({line:e.line,column:r&&e.kind===`String`?e.endColumn:e.column,range:void 0}),v=[],y=[],ee=[],b=(e,t=a-1)=>{let n=e===t?ee[e]:void 0;if(n)return n;let r=i[t];v[e]??=_(i[e]),y[t]??={line:r.line,column:r.endColumn};let o={module:d[0].name,start:v[e],end:y[t]};return e===t&&(ee[e]=o),o},x=(e,t)=>(e.location.range=b(t),e),te=(e=0)=>i[Math.min(a+e,i.length-1)],S=(e=0)=>{let t=te(e),n=o[o.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},C=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),ne=e=>r&&(e.kind===`Keyword`||Lu.has(e.text)),w=e=>{let t=i.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},re=e=>e.kind===`End`?`EOF`:/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:Su.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:ne(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,T=(e,t=te(),n)=>{let r=i[i.length-1],a=t.line===r.line&&t.column===r.column,o=new s(`${e} at line ${t.line}, column ${t.column}`,void 0,ie(e,t,a,n));return f!==void 0&&h.set(o,f),o},ie=(e,t,n,a)=>{if(!r)return{reason:e,line:t.line,column:t.column,isEnd:n};let o=i[m[0]-1],s=a?`Unexpected ${re(a)}`:e;if(o)return{reason:s,line:o.line,column:o.endColumn+1,isEnd:n};let c=a?w(a):t;return{reason:s,line:c.line,column:c.column,isEnd:n}},ae=(e,t=te())=>T(e,t,t),oe=e=>{let t={cursor:a,frame:f,restorePoints:m.length,offsideColumns:o.length,recursiveScopes:u.length},n=++p;f=n;try{let n=e();return f=t.frame,n}catch(e){if(!(e instanceof s)||h.get(e)!==n)throw e;a=t.cursor,f=t.frame,m.length=t.restorePoints,o.length=t.offsideColumns,u.length=t.recursiveScopes;return}},se=e=>{let t=f;f=void 0;let n=e();return f=t,n},E=e=>{m.push(a);let t=e();return m.pop(),t},ce=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ne(e),D=(e,t=0)=>{let n=S(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},O=()=>{let e=S();if(e.kind===`End`)throw ae(`Unexpected end of expression`);return a++,e},k=e=>D(e)?(a++,!0):!1,A=e=>{if(!D(e))throw ae(`Expected ${JSON.stringify(e)} but found ${C(S())}`);return O()},le=()=>{let e=S();if(e.kind!==`Identifier`)throw ae(`Expected an identifier but found ${C(e)}`);if(ne(e))throw ae(`Unexpected keyword ${e.text}`);return a++,e.text},ue=()=>{let e=a;return{name:le(),range:b(e)}},de=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),fe=()=>{let e=S();return e.kind!==`String`&&(pu.has(e.text)||iu.has(e.text)||du.has(e.text))?(a++,e.text):le()},pe=!1,me=()=>S().kind===`Identifier`||!ce(S())?le():(pe=!0,O().text),he=e=>{if(!r)return e();o.push(-1);let t=e();return o.pop(),t},ge=(e,t=`,`)=>{let n=[e()];for(;k(t);)n.push(e());return n},_e=(e=0)=>{if(D(`<<`,e)){let t=e+1;for(;S(t).kind===`Identifier`||D(`,`,t);)t++;return D(`>>`,t)&&D(`\\in`,t+1)}let t=e;for(;S(t).kind===`Identifier`;){if(D(`\\in`,t+1))return!0;if(!D(`,`,t+1))return!1;t+=2}return!1},ve=()=>{if(D(`::`))return!0;if(!D(`(`))return!1;let e=1;for(;S(e).kind===`Identifier`&&D(`,`,e+1);)e+=2;return S(e).kind===`Identifier`&&D(`)`,e+1)&&D(`::`,e+2)},ye=()=>{if(!k(`<<`)){let e=ue();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=de(D(`>>`)?[]:ge(ue));return A(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},be=()=>{let e=()=>{let e=ge(ye);A(`\\in`);let t=se(j);return e.map(e=>({pattern:e,set:t}))},t=[e()];for(;D(`,`)&&(!r||_e(1));)O(),t.push(e());return t.flat()},xe=()=>{let e=S();if(r&&Lu.has(e.text)){let t=a;O();let n={kind:`Identifier`,name:e.text,location:_(e)};return{subscript:x(n,t),lastArgs:[]}}let t=r&&(e.kind===`Number`||e.kind===`String`||D(`@`));if(e.kind===`Identifier`){let t=a,n=[],i=[],o=e=>(i.push(b(a,a)),n.push(le()),e&&D(`(`)?Ee():[]),s=[o(!r)];for(;D(`!`)&&S(1).kind===`Identifier`;)O(),s.push(o(!0));let c=s.slice(0,-1),l=_(e);l.range={...b(t),end:i[i.length-1].end};let u=n.join(`!`);return{subscript:c.every(e=>e.length===0)?{kind:`Identifier`,name:u,location:l}:{kind:`Apply`,operator:u,args:c.flat(),argumentCounts:[...c.map(e=>e.length),0],argumentsRange:l.range,selectorRanges:i,location:l},lastArgs:s[s.length-1]}}if(D(`<<`)||D(`(`)||D(`{`)||D(`[`)||t){let e=a,t=Re();return{subscript:t.location.range?t:x(t,e),lastArgs:[]}}throw ae(`Expected a subscript but found ${C(e)}`)},Se=e=>{let t=S(1),n=S(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&D(`==`,du.has(n.text)?3:4))},Ce=e=>{let t=S(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||D(`,`,1)||D(`)`,1)||t.kind===`Keyword`&&vu.has(t.text)||Se(e)},we=()=>{let e=S(),t=e.kind===`Operator`&&(iu.has(e.text)||fu.has(e.text))&&Ce(e);if(r&&e.kind!==`String`&&(fu.has(e.text)||gu.has(e.text)&&e.text!==`'`&&!uu.has(e.text)||hu.has(e.text)&&S(-1).text===`(`&&S(-1).line===e.line&&S(-1).endColumn+1===e.column&&S(1).text===`)`&&S(1).line===e.line&&S(1).column===e.endColumn+1)&&Ce(e))throw T(`incomplete expression`,e);if(t&&!r&&e.text===`\\X`&&e.spelling!==`×`)throw T(`\\X may not be used as an infix operator`,e);if(t)return a++,x({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:_(e)},a-1);if(e.kind!==`String`&&gu.has(e.text)&&Ce(e)){a++;let t=_(e);if(uu.has(e.text))return x({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},a-1);let n={kind:`Identifier`,name:`argument`,location:t};return x({kind:`Lambda`,params:[n.name],body:Vu(e.text,n,t),operator:e.text,location:_(e)},a-1)}if(D(`LAMBDA`)){let t=a;O();let n=de(ge(ue));A(`:`);let r=j();return x({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:_(e)},t)}if(!r)return j();let n=oe(j);if(n)return n;throw ae(`Unexpected ${C(S())}`)},Te,Ee=()=>he(()=>{let e=a;A(`(`);let t=ge(we);return A(`)`),Te=b(e),t}),De=()=>{let e=O();o.push(e.column);let t=[j()],n=()=>{for(;zu(te())&&te().text===e.text&&te().column===e.column;)a++,t.push(j())};return r?se(n):n(),o.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:_(e)}},Oe=e=>he(()=>{let t=_(e),n=S().kind===`Identifier`,i=D(`|->`,1)&&(n||ce(S()));if(i||n&&D(`:`,1)){let e=i?`Record`:`RecordSet`,r=e=>{let t=a,n=_(S()),r=e();return n.range=b(t),A(i?`|->`:`:`),{name:r,value:j(),location:n}},o=[r(()=>n?le():O().text),...k(`,`)?ge(()=>r(le)):[]];return A(`]`),{kind:e,fields:o,location:t}}if(_e()){let e=a,n=be();if(!r||D(`|->`)){A(`|->`);let e=j();return A(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}a=e}let o=j();if(k(`->`)){let e=j();return A(`]`),{kind:`FunctionSet`,domain:o,range:e,location:t}}if(k(`EXCEPT`)){let e=ge(()=>{let e=[a];A(`!`);let t=[];for(;D(`.`)||D(`[`);)if(e.push(a),k(`.`)){if(!ce(S()))throw ae(`Expected a field name but found ${C(S())}`);if(!r&&D(`@`))throw ae(`@ used in !.@`);t.push(O().text)}else A(`[`),t.push(ge(()=>j())),A(`]`);e.push(a,a+1),A(`=`);let n=j();e.push(a);let i=t=>b(e[t],e[t+1]-1);return{path:t.map((t,n)=>typeof t==`string`?{kind:`Field`,name:t}:{kind:`Index`,args:t,tupleRange:i(2*n+1<e.length-1?2*n+1:n+1)}),value:n,range:b(e[0])}});return A(`]`),{kind:`Except`,function:o,updates:e,location:t}}if(!r&&!D(`]_`)){let e=[o];for(;k(`,`);)e.push(j());return A(`]`),{kind:`Bracket`,args:e,location:t}}return A(`]_`),{kind:`BoxAction`,action:o,subscript:xe().subscript,location:t}}),ke=()=>{let e=a,t=x(Be(),e),n=_(O());return x({kind:`Apply`,operator:`\\in`,args:[t,se(j)],location:n},e)},Ae=e=>he(()=>{let t=_(e);if(k(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(_e()&&(S(1).text===`\\in`||D(`<<`))){let e=a,n=ye();A(`\\in`);let r=se(j);if(k(`:`)){let e=se(j);return A(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}a=e}let n=S().kind===`Identifier`&&D(`\\in`,1)?ke():j();if(k(`:`)){let e=be();return A(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;k(`,`);)r.push(j());return A(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),je=e=>{let t=_(e),n=he(()=>D(`>>`)||D(`>>_`)?[]:ge(()=>j()));if(k(`>>_`)){if(n.length!==1)throw T(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:se(xe).subscript,location:t}}return A(`>>`),{kind:`Tuple`,elements:n,location:t}},Me=e=>{let t=_(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&_e()){let e=be();return A(`:`),{kind:n,bounds:e,body:j(),location:t}}let i=de(ge(ue));return A(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:j(),isTemporal:r,location:t}},Ne=e=>{let t=[];do{let n=a;if(k(`OTHER`))return A(`->`),{kind:`Case`,arms:t,other:j(),otherRange:b(n),location:_(e)};let r=j();A(`->`),t.push({condition:r,body:j()})}while(k(`[]`));return{kind:`Case`,arms:t,other:void 0,location:_(e)}},Pe=()=>{let e=S(1);return D(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||_u.has(e.text)||e.kind===`Operator`&&(iu.has(e.text)||du.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&pu.has(e.text))},Fe=()=>{let e=O();if(e.kind===`Number`)return{kind:`Operand`,operand:Le(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return a--,{kind:`Bound`,args:Ee()}}return{kind:`Name`,name:e.text,args:D(`(`)?Ee():[]}},Ie=(e,t,n,r,i)=>{let o=[{kind:`Name`,name:e,args:t}],s=[b(r,r)],c=[n];for(;Pe();){O();let e=a;Te=void 0;let t=Fe();s.push(t.kind===`Bound`?b(e):b(e,e)),o.push(t),c.push(Te)}let l=o.flatMap(e=>e.kind===`Name`?[e.name]:[]),u=l.join(`!`),d=o.flatMap(e=>`args`in e?e.args:[]),f=o.map(e=>`args`in e?e.args.length:0);return l.length<o.length?{kind:`Subexpression`,selectors:o,selectorRanges:s,argumentRanges:c,location:i}:d.length===0?{kind:`Identifier`,name:u,selectorRanges:s,location:i}:{kind:`Apply`,operator:u,args:d,...f.slice(0,-1).some(e=>e>0)&&{argumentCounts:f},argumentsRange:c.at(-1)??b(r),selectorRanges:s,argumentRanges:c,location:i}},Re=e=>{let n=a,i=O(),o=_(i);if(r&&i.kind===`Keyword`&&i.text===`LAMBDA`){let e=ge(le);return A(`:`),{kind:`Lambda`,params:e,body:j(),location:o}}if(i.kind===`Number`)return{kind:`Number`,value:Le(i.text),text:i.text,location:o};if(i.kind===`Decimal`)return{kind:`Decimal`,text:i.text,location:o};if(i.kind===`String`)return{kind:`String`,value:i.text,location:o};let s=i.kind===`Step`&&St(i);if(!r&&s&&yt()<0&&vt.length<=1)throw T(`Step number used outside proof`,i);if(s&&i.text[1]===`+`)throw T(`<+> step number used in an expression`,i);if(i.kind===`Identifier`||s){let t=s?Ct(i)??i.text:i.text;if(ve()){let a=de(k(`(`)?ge(ue):[]);a.names.length>0&&A(`)`),A(`::`);let s=b(n),l=j();if(!r&&e!==void 0&&c!==void 0&&Ru(l)&&e.high>=c.low)throw T(`Removing the label would change expression parsing`,i);return{kind:`Label`,name:t,params:a.names,paramRanges:a.ranges,head:s,body:l,location:o}}let a=D(`(`);if(t===`@`&&!a&&!Pe())return{kind:`ExceptAt`,location:o};let l=a?Ee():[];return Pe()?Ie(t,l,a?Te:void 0,n,o):a?{kind:`Apply`,operator:t,args:l,argumentsRange:Te,location:o}:{kind:`Identifier`,name:t,location:o}}let l=i.kind===`Operator`&&(Bu(i.text)||i.text===`'`&&!r);if(l&&D(`(`)){let e=Ee();return!r&&Pe()?Ie(i.text,e,Te,n,o):t===`tlc`&&i.text===`\\X`&&e.length===2?{kind:`Product`,factors:e,location:o}:i.text===`'`&&e.length===1?{kind:`Prime`,expression:e[0],location:o}:{kind:`Apply`,operator:i.text,spelling:i.spelling,args:e,argumentsRange:Te,location:o}}if(l&&!r)return Pe()?Ie(i.text,[],void 0,n,o):{kind:`Identifier`,name:i.text,spelling:i.spelling,location:o};switch(i.text){case`(`:{let e=he(()=>j());return A(`)`),Hu.set(e,b(n)),e}case`[`:return Oe(i);case`{`:return Ae(i);case`<<`:return je(i);case`@`:return{kind:`ExceptAt`,location:o};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Me(i);case`IF`:{let e=j();A(`THEN`);let t=j();return A(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:j(),location:o}}case`CASE`:return Ne(i);case`LET`:{let e=[],t=[],n=[];for(u.push(/* @__PURE__ */ new Set);!k(`IN`);){if(r&&D(`RECURSIVE`))throw ae(`Unexpected keyword RECURSIVE`);if(k(`RECURSIVE`)){n.push(...M()),d[d.length-1].hasRecursiveLet=!0;continue}let i=lt(!r&&k(`LOCAL`));i.kind===`Instance`?t.push(i):e.push(i)}return u.pop(),{kind:`Let`,definitions:e,...t.length>0&&{instances:t},...n.length>0&&{recursive:n},body:j(),location:o}}case`CHOOSE`:{let e=ye(),t=k(`\\in`)?j():void 0;return A(`:`),{kind:`Choose`,pattern:e,set:t,body:j(),location:o}}case`WF_`:case`SF_`:{let e=xe(),t=!D(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:he(()=>{A(`(`);let e=j();return A(`)`),e});return{kind:i.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:o}}}throw ae(`Unexpected ${C(i)}`,i)},ze=(e,t,n)=>{c=l={low:t,high:n};let r=j(n+1),i=S(),a=du.has(i.text)?nu.high:iu.get(i.text)?.high;if(i.kind===`Operator`&&a!==void 0&&a>=t)throw T(`Precedence conflict between ${e.text} and ${i.text}`,i);return r},Be=()=>{let e=l;l=void 0;let t=S(),n=_(t);if(t.kind===`Operator`&&zu(t))return De();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return O(),{kind:`Apply`,operator:`~`,args:[ze(t,4,4)],location:n};case`-`:return O(),{kind:`Apply`,operator:`-.`,args:[ze(t,12,12)],location:n};case`[]`:case`<>`:case`ENABLED`:case`UNCHANGED`:return O(),Vu(t.text,ze(t,4,15),n);case`SUBSET`:case`UNION`:case`DOMAIN`:return O(),{kind:`Apply`,operator:t.text,args:[ze(t,10,13)],location:n}}return Re(e)},Ve=(e,t,n,r,i)=>{let a=_(e);if(e.text===`/\\`||e.text===`\\/`){let o=e.text===`/\\`?`And`:`Or`;return t.kind===o&&r?{...t,operands:[...t.operands,n],prefixEnds:[...t.prefixEnds??[],i]}:{kind:o,operands:[t,n],prefixEnds:[i],location:a}}return e.text===`\\X`?t.kind===`Product`&&r?{...t,factors:[...t.factors,n]}:{kind:`Product`,factors:[t,n],location:a}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t,n],location:a}},He=(e,t)=>e.text===`'`?{kind:`Prime`,expression:t,location:_(e)}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t],location:_(e)},Ue=()=>{O();let e=he(()=>ge(()=>j()));return he(()=>A(`]`)),e},We=e=>{let t=a,n=Be(),r=n.location.range?n:x(n,t),i;for(;;){let n=S();if(n.kind!==`Operator`)break;let a=_(n);if(du.has(n.text)&&e<=15){O(),c=nu,r=x(He(n,r),t);continue}if(n.text===`[`){let e=Ue();c=ru,r=x({kind:`FunctionApplication`,function:r,args:e,location:a},t);continue}if(n.text===`.`&&ce(S(1))){O();let e=O().text;r=x({kind:`FieldAccess`,record:r,field:e,location:a},t);continue}let o=iu.get(n.text);if(!o||o.low<e)break;if(i){let e=!(i.low>o.high||i.high<o.low),t=i.text===n.text&&o.isAssociative;if(e&&!t&&(i.text!==`\\X`||n.text!==`\\X`))throw T(`Precedence conflict between ${i.text} and ${n.text}`,n)}if(O(),o.low>12&&D(`-`))throw T(`Precedence conflict between ${n.text} and -`,S());c=l=o;let s=j(o.high+1),u=i?.text===n.text;r=x(Ve(n,r,s,u,b(t).end),t),i={...o,text:n.text}}return r},Ge=e=>e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`||e.kind===`Identifier`||e.kind===`Step`&&St(e)&&/^<\d/.test(e.text)||(e.kind===`Operator`||e.kind===`Keyword`)&&cu.has(e.text),Ke=(e,t)=>({start:t,end:a-1,expression:e.location.range?e:x(e,t)}),qe=(e,t,n,r)=>({...n,start:e,end:a-1,fixity:t,isLeft:!1,apply:r}),Je=e=>e.kind===`Operator`&&du.has(e.text)&&D(`(`,1)?oe(()=>he(()=>{O(),O();let t=j(),n=a-1;return A(`)`),{end:n,expression:He(e,t)}})):void 0,Ye=()=>{let e=0;for(let t=a+1;t<i.length;t++){let n=i[t];if(n.kind===`Operator`){if(e===1&&n.text===`,`)return!0;if(i[t-1].text!==`!`&&(Fu.has(n.text)&&e++,Iu.has(n.text)&&--e===0))return!1}}return!1},Ze=e=>D(`(`,1)&&Ye()?oe(()=>he(()=>{O(),O();let t=j();A(`,`);let n=j();return A(`)`),{kind:`Apply`,operator:e.text,args:[t,n],location:_(e)}})):void 0,Qe=e=>{let t=a,n=S(),r=_(n),i=n.kind===`Operator`||n.kind===`Keyword`,o=i?iu.get(n.text):void 0;if(!e){if(D(`[`)){let e=Ue();return qe(t,`Postfix`,su,t=>({kind:`FunctionApplication`,function:t[0].expression,args:e,location:r}))}if(D(`.`)&&ce(S(1))){O();let e=O().text;return qe(t,`Postfix`,su,t=>({kind:`FieldAccess`,record:t[0].expression,field:e,location:r}))}if(o){if(Ze(n)){a=t;return}return O(),{...qe(t,`Infix`,o,e=>Ve(n,e[0].expression,e[1].expression,e[0].joinedBy===n.text,b(e[0].start,e[1].end).end)),isLeft:au(n.text,o),joins:n.text}}if(n.kind!==`Operator`||!du.has(n.text))return;if(Je(n)){a=t;return}return O(),qe(t,`Postfix`,nu,e=>He(n,e[0].expression))}if(n.kind===`Operator`&&zu(n))return Ke(De(),t);let s=o?Ze(n):void 0;if(s)return Ke(s,t);let c=Je(n);if(c)return c.expression.location.range=b(t,c.end),{start:t,end:c.end,expression:c.expression};let l=i?ou.get(n.text):void 0;if(l)return O(),qe(t,`Prefix`,l,e=>Vu(n.text===`-`?`-.`:n.text,e[0].expression,r));if(!Ge(n))return;let u=n.kind===`Operator`&&lu.has(n.text);return Ke(u?Re():se(Re),t)},$e=e=>e!==void 0&&`fixity`in e,et=e=>e!==void 0&&!(`fixity`in e),nt=(e,t)=>{let n=Math.min(e.start,t[0].start),r=Math.max(e.end,t[t.length-1].end),i=e.apply(t);return i.location.range=b(n,r),{start:n,end:r,expression:i,joinedBy:e.joins}},rt=e=>{let t=e.pop(),n=e.pop();if(!et(t)||!$e(n))throw T(`incomplete expression`);let r=n.fixity===`Infix`?e.pop():void 0;e.push(nt(n,et(r)?[r,t]:[t]))},it=e=>{let t=e[e.length-2];return $e(t)?t:void 0},at=(e,t)=>t!==void 0&&e.high<t.low,ot=()=>E(()=>{let e=oe(()=>Qe(!0));if(e===void 0){let e=te();throw e.kind===`End`?ae(`Unexpected end of expression`,e):T(`required expressions(s) missing before '${re(e)}'`,e)}return se(()=>{let t=[e];for(;;){let e=oe(()=>Qe($e(t[t.length-1])));if(e===void 0)break;if(et(e)||e.fixity===`Prefix`){t.push(e);continue}for(;at(e,it(t));)rt(t);let n=t[t.length-1];if(e.fixity===`Postfix`&&et(n)){t.splice(-1,1,nt(e,[n]));continue}let r=it(t);r?.fixity===`Infix`&&r.isLeft&&e.isLeft&&!at(r,e)&&rt(t),t.push(e)}for(;t.length>1;)rt(t);let n=t[0];if(!et(n))throw T(`incomplete expression`);return n.expression})}),j=(e=0)=>r?ot():We(e),st=()=>{if(!k(`(`))return[];let e=ht();return A(`)`),e},ct=()=>{let e=_(S()),t=j(),n=i[a-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:d[0].name,start:e,end:r}}},lt=e=>{let t=a;return x(dt(e),t)},ut=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),dt=e=>{let t=S(),n=a,r=_(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:b(n,a-2),...ct(),isLocal:e,isRecursive:g(t),location:r});if(t.kind===`Identifier`&&S(1).kind===`Operator`&&iu.has(S(1).text)&&S(2).kind===`Identifier`&&D(`==`,3)){let e=ue(),t=O().text,n=ue();return A(`==`),i(t,[ut(e),ut(n)])}let o=t.kind!==`String`&&pu.has(t.text),s=t.kind===`Identifier`&&du.has(S(1).text)&&D(`==`,2);if(o||s){let e=o?t.text:S(1).text;o&&O();let n=ue();return s&&O(),A(`==`),i(e,[ut(n)])}let c=le();if(k(`[`)){let t=he(()=>be());return A(`]`),A(`==`),{kind:`Function`,name:c,bounds:t,body:j(),isLocal:e,isRecursive:g(c),location:r}}let l=a,u=st();return A(`==`),D(`INSTANCE`)?{...ft(c,u,e,r),definitionRange:b(l)}:i(c,u)},ft=(e,t,n,r)=>{let i=a;return A(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:me(),substitutions:k(`WITH`)?ge(()=>{let e=a,t=fe(),n=b(e);return A(`<-`),{name:t,nameRange:n,expression:we()}}):[],isLocal:n,location:r,instanceRange:b(i)}},pt=()=>{let e=a;return x(mt(),e)},mt=()=>{let e=_(S());if(D(`_`)&&S(1).kind===`Operator`&&(iu.has(S(1).text)||du.has(S(1).text)))return O(),{name:O().text,arity:k(`_`)?2:1,location:e};if(S().kind!==`String`&&(pu.has(S().text)||r&&S().kind===`Operator`)&&D(`_`,1)){let t=O().text;return O(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=le();if(!k(`(`))return{name:t,arity:0,location:e};let n=ge(()=>A(`_`));return A(`)`),{name:t,arity:n.length,location:e}},ht=()=>ge(pt),M=()=>{let e=ht();return e.forEach(e=>u[u.length-1].add(e.name)),e},gt=e=>{let t=0,n=e;do{let e=S(n);if(e.kind===`End`)return n;e.kind===`Operator`&&Fu.has(e.text)&&t++,e.kind===`Operator`&&Iu.has(e.text)&&t--,n++}while(t>0);return n},_t=()=>{let e=S(),t=S(1);return e.kind===`Identifier`?D(`(`,1)||D(`[`,1)?D(`==`,gt(1)):t.kind===`Operator`&&du.has(t.text)?D(`==`,2):t.kind===`Operator`&&iu.has(t.text)?S(2).kind===`Identifier`&&D(`==`,3):D(`==`,1):e.kind!==`String`&&pu.has(e.text)&&t.kind===`Identifier`&&D(`==`,2)},vt=[],yt=()=>vt[vt.length-1]??-1,bt=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),xt=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n=t.length;for(;t[n-1]===`.`;)n--;return t.slice(0,n)},St=e=>!e.text.endsWith(`.`)&&!Cu.has(xt(e)),Ct=e=>{let t=xt(e);if(Cu.has(t))return;let n=bt(e);if(n>=0)return`<${n}>${t}`;let r=yt(),i=vt[vt.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},N=e=>{if(e.kind===`Keyword`)return bu.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return vt.length===0;if(e.text[1]===`+`||vt.length===0)return!0;let t=yt();return t>=0&&bt(e)>t},wt=e=>{let t=bt(e),n=vt.length-1,r=vt[n-1]??-1,i=vt[n]<0;return i&&(vt[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:vt[n]===t},Tt=()=>{let e=S();return e.kind===`Step`?St(e):e.kind===`Keyword`?Mu.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!_t()},Et=()=>{let e=a,t=S();return t.kind===`Operator`&&!mu.has(t.text)&&Bu(t.text)?(a++,x({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:_(t)},e)):k(`MODULE`)?x({kind:`ModuleFact`,name:le(),location:_(t)},e):j()},Dt=()=>{let e=a,t=S(),n=ge(()=>{let e=S();if((e.kind!==`Identifier`||ne(e))&&e.kind!==`Operator`)throw ae(`Expected a definition name but found ${C(e)}`,e);return a++,e.text},`!`),r=_(t);return x(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},Ot=()=>ge(()=>{if(r)return Dt();let t=Et(),n=(t.kind===`Identifier`||t.kind===`Subexpression`||t.kind===`OperatorReference`)&&!Hu.has(t);return t.kind!==`ModuleFact`&&!n&&Uu.set(t,tu(Ol(d[0].name,e),t)),t}),kt=()=>{let e=oe(j);if(!e)return[];let t=[e];return E(()=>{for(;D(`,`);){let e=oe(()=>(O(),j()));if(!e)return;t.push(e)}}),t},At=()=>{let e=r?kt():Tt()?ge(Et):[],t=k(`DEF`)||k(`DEFS`);if(r&&e.length===0&&!t)throw ae(`Expected a fact`);return{facts:e,defs:t?Ot():[]}},jt=()=>{let e=a,t=O(),n=t.text===`USE`&&k(`ONLY`),r=b(e);return x({kind:t.text===`USE`?`Use`:`Hide`,isOnly:n,...At(),keyword:r,location:_(t)},e)},Mt=()=>{let e=a,t=_(S()),n=k(`NEW`),i=r?a:e,o=r?_(S()):t,s=S().kind===`Keyword`?Nu.get(S().text):void 0;if(!n&&s===void 0)throw ae(`Expected a declaration but found ${C(S())}`);if(s!==void 0&&O(),s===`Variable`){let e=ue();return x({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:o},i)}let c=pt(),l=(s??`Constant`)===`Constant`&&D(`\\in`);if(l&&c.arity>0)throw T(`declared symbol with arguments before \\in`);return l&&O(),x({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?j():void 0,nameRange:c.location.range,location:o},i)},Nt=()=>{if(S().kind===`Identifier`&&D(`::`,1)&&D(`ASSUME`,2)&&(O(),O()),D(`ASSUME`))return Ft();if(S().kind===`Keyword`&&Pu.has(S().text))return r?se(Mt):Mt();if(!r)return j();let e=oe(j);if(e===void 0)throw ae(`Expected a hypothesis`);return e},Pt=()=>{let e=[Nt()];return E(()=>{for(;;){let t=oe(()=>(A(`,`),Nt()));if(t===void 0)break;e.push(t)}}),e},Ft=()=>{let e=a,t=_(A(`ASSUME`)),n=()=>{let n=r?Pt():ge(Nt);return A(`PROVE`),x({kind:`AssumeProve`,assumptions:n,conclusion:j(),location:t},e)};return r?se(n):n()},It=e=>{let t=0;for(;S(t).kind===`Identifier`&&D(`,`,t+1);)t+=2;return S(t).kind===`Identifier`&&D(e,t+1)},Lt=()=>{let e=S();if(D(`USE`)||D(`HIDE`))return jt();if(!r&&D(`INSTANCE`)){let t=a;return x(ft(void 0,[],!1,_(e)),t)}if(D(`DEFINE`)||_t()){let t=a;k(`DEFINE`);let n=[lt(!1)];for(;_t();)n.push(lt(!1));let r={kind:`Define`,definitions:n,location:_(e)};return x(r,t)}if(k(`HAVE`))return{kind:`Have`,expression:j()};if(k(`TAKE`)){let e=_e(),t=de(e?[]:ge(ue)),n=e?be():[];return{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(k(`WITNESS`))return{kind:`Witness`,expressions:ge(()=>j())};if(k(`PICK`)){let e=It(`:`),t=de(e?ge(ue):[]),n=e?[]:be();return A(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:j()}}return k(`CASE`)?{kind:`Case`,expression:j()}:{kind:`Assert`,isSuffices:k(`SUFFICES`),statement:D(`ASSUME`)?Ft():j()}},Rt=e=>{let n=S();if(n.kind!==`Step`)throw ae(`Expected a step number but found ${C(n)}`,n);if(!wt(n))throw T(`${e?`QED step`:`step`}'s number has bad level`,n);if(t!==`sany`&&bt(n)<0&&Ct(n)!==void 0)throw T(`<*> and <+> cannot be used for a named step`,n);return a++,{name:Ct(n),token:n.text,location:_(n)}},zt=()=>{let e=a,t=Rt(D(`QED`,1)),n=a,r=k(`QED`)?{kind:`Qed`}:Lt(),i=b(e),o=b(n),s=N(S());if(s&&!xu.has(r.kind))throw T(`Proof of a step that does not take a proof`);let c=s?Ht():void 0;return x({...t,body:r,head:i,statement:o,proof:c},e)},Bt=e=>{if(k(`BY`)){let t=b(a-1);return{kind:`By`,isOnly:k(`ONLY`),...At(),keyword:t,location:e}}let t=S();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;O();let n=b(a-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},Vt=()=>{let e=_(S());k(`PROOF`);let t=Bt(e);if(t)return t;let n=[zt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(zt());return{kind:`Steps`,level:yt(),steps:n,location:e}},Ht=()=>{let e=a;vt.push(-1);let t=Vt();return vt.pop(),x(t,e)},Ut=()=>S().kind===`Step`||S().kind===`Keyword`&&bu.has(S().text),Wt=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return Du(e);let n=t.defs[t.defs.length-1]?.location.range;return Eu(Du({...e,end:e.start}),Du(n??t.keyword))},Gt=()=>{let e=a,t=_(S()),n=k(`PROOF`),r=Bt(t);if(r){let t=x(r,e);return{kind:`Leaf`,proof:t,span:Du(t.keyword),first:e,end:a-1}}let i=S();if(i.kind!==`Step`)throw ae(`Expected a step number but found ${C(i)}`);let o=a;O();let s=a,c=k(`QED`)?{kind:`Qed`}:Lt(),l=b(o);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:b(s),span:Wt(l,c),first:e,start:o,end:a-1}},Kt=(e,t,n,r)=>{let a=e[t];if(!a)return{proof:void 0,span:r,next:t,end:void 0};if(a.kind===`Leaf`)return{proof:a.proof,span:a.span,next:t+1,end:a.end};let o=qt(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={..._(i[a.first]),range:b(a.first,o.end)};return{proof:{kind:`Steps`,level:o.level,steps:o.steps,location:s},span:o.span,next:o.next,end:o.end}},qt=(e,t,n,r,i)=>{let a=e[t];if(!a)throw ju(`Unexpected end of (sub)proof at level ${n} before QED step`,r,Au);if(a.kind===`Leaf`)throw ju(`Expecting a proof step but found a${wu[a.proof.kind]} leaf proof`,a.span,Au);if(!i&&a.isProof)throw ju(`PROOF keyword found in step that does not begin subproof`,a.span,ku);let o=a.token.text[1];if(o===`+`&&!i)throw ju(`<+> used but no subproof expected`,a.span,ku);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:bt(a.token);if(s<n||!i&&s>n)return;let c=xu.has(a.body.kind)?Kt(e,t+1,s+1,a.span):{proof:void 0,span:a.span,next:t+1,end:void 0},l=c.end??a.end,u={name:Ct(a.token),token:a.token.text,body:a.body,head:a.head,statement:a.statement,proof:c.proof,location:{..._(a.token),range:b(a.start,l)}},d=Eu(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=qt(e,c.next,s,{start:d.stop,stop:d.stop},!1);return f&&{...f,level:s,steps:[u,...f.steps],span:Eu(d,f.span)}},Jt=()=>{if(!Ut())return;let e=[];for(;Ut();)e.push(Gt());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=Kt(e,0,0,t.span),r=e[n.next];if(r)throw ju(`extra step(s) after finished proof`,r.span,Ou,`Proof.Parser.toplevel`);return n.proof},Yt=(e,t,n,r)=>{e.definitions.some(e=>e.name===t)||e.definitions.push({kind:`Operator`,name:t,params:[],body:n,isLocal:!1,isRecursive:!1,location:r})},Xt=()=>{if(S().kind!==`Identifier`||!D(`==`,1))return;let e=le();return O(),e},Zt=()=>{if(!r)return j();let e=te(),t=oe(j);if(t)return t;throw ae(`Expected "====" but found ${C(e)}`,e)},Qt=e=>{let t=a,n=O(),i=Xt(),o=D(`ASSUME`)?Ft():Zt(),s=r?Jt():N(S())?Ht():void 0,c=x({name:i,statement:o,proof:s,location:_(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),i!==void 0&&o.kind!==`AssumeProve`&&Yt(e,i,o,c.location)},$t=()=>{let e=a,t=O(),n=Xt();return x({name:n,expression:j(),isAxiom:t.text===`AXIOM`,location:_(t)},e)},en=()=>{let e=_(A(`----`));A(`MODULE`);let t=me();A(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[],hasRecursiveLet:!1};for(d.push(n),u.push(/* @__PURE__ */ new Set),k(`EXTENDS`)&&ge(()=>{let e=a;n.extends.push(me()),n.extendsRanges.push(b(e))});;){let t=a,r=S();if(r.kind===`ModuleEnd`)return e.range={module:d[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},d.pop(),u.pop(),n;if(r.kind===`Separator`){if(D(`MODULE`,1)){let e=en();n.modules.push(e),n.units.push({kind:`Module`,module:e}),A(`====`);continue}O()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=_(O()),r=ht();n.constants.push(...r),e.range=b(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=_(O()),r=ge(()=>{let e=a,t=_(S());return x({name:le(),arity:0,location:t},e)});n.variables.push(...r),e.range=b(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=$t();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&Yt(n,e.name,e.expression,e.location);continue}case`USE`:case`HIDE`:{if(D(`USE`)&&D(`ONLY`,1))throw ae(`Expected a module unit but found ${C(r)}`);let e=jt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=_(O()),r=M();e.range=b(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:tn(n,x(ft(void 0,[],!1,_(r)),t));continue;case`LOCAL`:if(O(),D(`INSTANCE`)){tn(n,x(ft(void 0,[],!0,_(r)),t));continue}tn(n,x(dt(!0),t));continue}r.kind===`Keyword`&&yu.has(r.text)?Qt(n):tn(n,lt(!1))}}},tn=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))},nn=en(),rn=pe?Tl(e):void 0;if(rn!==void 0)throw new s(rn);return nn},qu=e=>Ku(e,`tlc`),Ju=(e,t)=>Ku(e,`tlc`,t),Yu=e=>Ku(e,`tlapm`),Xu=e=>Ku(e,`sany`),Zu=(e,t)=>{let n=JSON.stringify(t);e.some(e=>JSON.stringify(e)===n)||e.push(t)},Qu=e=>e===void 0?`Unknown location`:typeof e==`string`?`In module ${e}`:e.beginLine===0&&e.beginColumn===0&&e.endLine===0&&e.endColumn===0?`In module ${e.file}`:`line ${e.beginLine}, col ${e.beginColumn} to line ${e.endLine}, col ${e.endColumn} of module ${e.file}`,$u=e=>e?.kind===`OpAppl`&&e.nullKind===`absent`,ed=()=>({buckets:Array.from({length:11},()=>[]),count:0,threshold:8}),td=(e,t)=>(e&2147483647)%t,nd=e=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let r=e.buckets.length-1;r>=0;r--)e.buckets[r].forEach(e=>n[td(e.hash,t)].unshift(e));e.buckets=n,e.threshold=Math.floor(t*.75)},rd=(e,t,n=t)=>e.buckets[td(gt(n),e.buckets.length)].find(e=>e.key===t)?.value,id=(e,t,n,r=t)=>{let i=gt(r),a=e.buckets[td(i,e.buckets.length)].find(e=>e.key===t);a?a.value=n:(e.count>=e.threshold&&nd(e),e.buckets[td(i,e.buckets.length)].unshift({hash:i,key:t,value:n}),e.count++)},ad=e=>e.buckets.toReversed().flatMap(e=>e.map(e=>e.value)),od=`\0module `,sd=()=>({table:ed(),symbols:[]}),cd=e=>e.kind===`Module`?od+e.name:e.name,ld=(e,t)=>{id(e.table,cd(t),t,t.name),e.symbols.push(t)},ud=e=>e.kind===`ThmOrAssumpDef`?e.params.length:e.kind===`Module`?0:e.arity,dd=(e,t)=>rd(e.table,t),fd=(e,t)=>rd(e.table,od+t,t),pd=e=>e.context.symbols.filter(e=>e.kind===`OpDef`&&e.defKind===`UserDefined`),md=(e,t)=>ad(e.context.table).filter(e=>e.kind===`OpDecl`&&e.declKind===t).toReversed(),hd=e=>e.context.symbols.filter(e=>e.kind===`ThmOrAssumpDef`),gd={kind:`Local`},_d=`$subexpression`,vd=/* @__PURE__ */ new WeakMap,yd=/* @__PURE__ */ new WeakMap,bd=/* @__PURE__ */ new WeakMap,xd=/* @__PURE__ */ new WeakMap,Sd=/* @__PURE__ */ new WeakMap,Cd=/* @__PURE__ */ new WeakMap,wd=/* @__PURE__ */ new WeakMap,Td=/* @__PURE__ */ new WeakSet,Ed=/* @__PURE__ */ new WeakSet,Dd=e=>Ed.has(e)||kd(Cd.get(e))!==void 0,Od=e=>e?.find(e=>e.isEmpty?Dd(e.node):Td.has(e.node)),kd=e=>Od(e)?.error,Ad=/* @__PURE__ */ new WeakMap,jd=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},Md=new Map([...[`~>`,`-+->`,`\\cdot`,`\\X`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}]),[`'`,{key:`'`,arity:1,kind:`Builtin`}]]),Nd=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,Pd=(e,t)=>Nd(e,t)?-1:+!!Nd(t,e),Fd=e=>e.kind===`Operator`?e.params.length:0,Id=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],Ld=e=>e.name.includes(`!`),Rd=e=>e.kind===`Function`&&!Ld(e)?e.bounds.length:void 0,zd=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},Bd=(e,t,n)=>{let r=t.bindings.get(e);return r&&Nd(r.position,t.location)&&(!n||Nd(r.position,n.start))?r:void 0},Vd=(e,t)=>e!==void 0&&t!==void 0&&m(e)===m(t),Hd=(e,t,n,r)=>{if(t===void 0)return!0;if(Vd(t.range,n.range))return!1;let i=n.range;if(i===void 0||r.isGenerated||t.kind!==`Builtin`&&!t.range)return!0;let a=m(i),o=t.range&&m(t.range);return t.kind===`Builtin`?r.errors.push({location:a,message:`Symbol ${$s(e)} is a built-in operator, and cannot be redefined.`}):n.kind===`Parameter`||t.kind!==n.kind||t.arity!==n.arity?r.errors.push({location:a,message:`Multiply-defined symbol '${$s(e)}': this definition or declaration conflicts \nwith the one at ${o}.`}):r.warnings.push({location:a,message:`Multiple declarations or definitions for symbol ${$s(e)}. \nThis duplicates the one at ${o}.`}),!1},Ud=(e,t,n,r)=>Hd(t,zd(e,t)??Bd(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,Wd=(e,t,n)=>{Hd(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},Gd=(e,t,n,r)=>t.reduce((e,t,i)=>Ud(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),Kd=(e,t,n)=>t.reduce((e,t)=>Ud(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),qd=e=>e.kind===`Name`?[e.name]:e.names,Jd=e=>e.flatMap(e=>qd(e.pattern)),Yd=(e,t)=>{let n=t.definitions.get(e),r=Bd(e,t,void 0);return n!==void 0&&(n===t.self?n.isRecursive:n.isRecursive?r!==void 0:Nd(n.location,t.location)&&(r===void 0||!Nd(r.position,n.location)))?n:void 0},Xd=(e,t)=>{let n=Yd(e,t);if(n){let r=n.isRecursive?t.bindings.get(e):void 0;return{key:t.getKey(n),arity:r?.arity??Fd(n),params:r?.params??Id(n),kind:`Definition`,range:n.location.range,functionArity:Rd(n)}}let r=Bd(e,t,void 0);return r?.isPending?{key:e,arity:r.arity,params:r.params,kind:r.kind}:r?t.imported.get(e):void 0},Zd=(e,t)=>t.facts.has(e)||t.bindings.get(e)?.kind===`Theorem`,Qd=(e,t)=>t.bindings.get(e)?.kind===`Theorem`?t.goals.get(e):void 0,$d=(e,t,n)=>zd(t,e)??Xd(e,n),ef=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),tf=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:ef(e.location,e.spelling??t)},nf=e=>{if(!(e.kind!==`Apply`||e.argumentsRange)){if(e.args.length===2)return`infix`;if(e.args.length===1)return e.operator===`-.`?`prefix`:`postfix`}},rf=`In module --TLA+ BUILTINS--`,af=/* @__PURE__ */ new Set([`Definition`,`Instance`,`Theorem`]),of=(e,t,n)=>n.errors.push({location:m(t),message:`Cannot take subexpression of \`${$s(e)}'.`}),sf=e=>!/^[\p{L}\d_]/u.test(e),cf=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),lf=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,uf=(e,t,n)=>{let r=e.split(`!`),i=n??r.map((e,n)=>n===r.length-1?t.length:0);return r.map((e,n)=>{let r=i.slice(0,n).reduce((e,t)=>e+t,0);return{kind:`Name`,name:e,args:t.slice(r,r+i[n])}})},df=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?uf(e.name,[],void 0):uf(e.operator,e.args,e.argumentCounts),ff=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),pf=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:Jd(e.bounds),body:e.body,sets:ff(e.bounds)};case`SetMap`:return{names:Jd(e.bounds),body:e.expression,sets:ff(e.bounds)};case`SetFilter`:return{names:qd(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:qd(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}},mf=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`:case`Selection`: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}},hf=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,gf=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),_f=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind===`Lambda`||e.kind===`Selection`)return;if(e.kind===`Let`)return _f(e.body,t);let n=wd.get(e);if(!(e.kind===`Apply`&&n===void 0&&Dd(e)))return e.kind===`FunctionApplication`&&Dd(e)?_f(e.function,t):mt(e).slice(0,n).reduce((e,n)=>e??_f(n,t),void 0)},vf=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??vf(i,t,n||gf(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&_f(e.set,t):_f(e,t)},yf=e=>e.kind===`Label`?yf(e.body):e,bf=e=>typeof e==`number`?`argument selector ${e}`:e,xf=`within the scope of a declaration
|
|
400
|
-
from outside that declaration's scope.`,
|
|
401
|
-
operator name or before an operator name.`);continue}let d=n.kind===`Operand`?bf(n.operand):n.kind===`At`?`@`:`!(...)`,f=e=>n.kind===`Operand`?lf(n.operand,e):-1,p=`An unexpected null node specified by '${d}'.\nThis is probably due to a previous error.`;if(c.isSufficesOpen){if(f(1)!==0)return a(r,i.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);c.isSufficesOpen=!1;continue}if(i.kind===`NewSymbol`)return i;if(i.kind!==`AssumeProve`){let e=yf(i);if(Td.has(e))return a(r,`Subexpression selection failed, probably due to an error in the selected expression.`);if([`Number`,`Decimal`,`String`].includes(e.kind))return a(r,`Selecting subexpression of expression that has none.`);if(Dd(e))return a(r,`Choosing operand \`${d}' of subexpression with no operands.`);let t=pf(e);if(t&&n.kind!==`Operand`){let e=n.kind===`Bound`?n.args.length:0;if(n.kind===`Bound`&&e!==t.names.length)return a(r,`Selector with ${e} argument(s) used for quantifier with ${t.names.length} bound identifier(s).`);l+=t.names.length,u+=e,c.node=t.body,c.isGoal=!1;continue}let o=t?.sets,s=e.kind===`Identifier`?[]:o?o.length>0?o:void 0:mf(e);if(!s)return i;let m=e.kind===`Except`,h=f(m?e.updates.length+1:s.length);if(h===-1)return a(r,`Nonexistent operand specified by \`${d}'.`);if(m&&h>0)return a(r,`Selecting subexpression of an EXCEPT not yet implemented.`);if(c.node=s[h],c.isGoal=!1,Td.has(c.node))return a(r,p);continue}let m=[...i.assumptions,i.conclusion],h=f(m.length);if(h===-1)return a(r,`Nonexistent operand specified by \`${d}'.`);if(gf(i,h)&&(!c.isGoal||o))return a(r,`Accessing ASSUME/PROVE clause ${xf}`);let g=m[h];if(g.kind===`NewSymbol`&&r!==t.length-1)return a(r,`Selected a subexpression of a NEW clause of an ASSUME.`);if(c.node=g,c.isGoal=!1,g.kind!==`NewSymbol`&&g.kind!==`AssumeProve`&&Td.has(g))return a(r,p)}return c.node.kind===`AssumeProve`?i?c.node:a(void 0,`Selected ASSUME/PROVE instead of expression.`):c.node.kind===`NewSymbol`?i?c.node:a(void 0,`Selected a NEW declaration as an expression or operator.`):l===u?c.node:a(void 0,`Expected ${l} arguments but found ${u}.`)},Cf=(e,t)=>{let n=t.isGenerated?void 0:t.hasLabelScope?t.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:t.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return n===void 0||!e.location.range?!1:(t.errors.push({location:m(e.location.range),message:n}),!0)},wf=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=m(r),a=e.params.filter((r,i)=>{let a=zd(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:m(o),message:`Illegal parameter ${r} of label \`${e.name}'.`}),a});a.filter((e,t)=>a.indexOf(e)!==t).forEach(t=>n.errors.push({location:i,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),n.labelParams.filter(e=>!a.includes(e)).forEach(t=>n.errors.push({location:i,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let o=[...new Set(a.filter(e=>!n.labelParams.includes(e))),...e.params.filter(e=>!a.includes(e))];o.length>0&&n.errors.push({location:i,message:`Label ${e.name} declares extra parameter(s) ${o.map(e=>`${e} `).join(``)}`}),n.labels.has(e.name)&&n.errors.push({location:i,message:`Duplicate label \`${e.name}'.`}),n.labels.add(e.name)},Tf=(e,t,n,r)=>{if(!hf(e))return!1;let i=df(e),a=i[0],o=i.length>1&&a.kind===`Name`?zd(t,a.name)?.goal??Qd(a.name,n):void 0;return o&&{node:Sf(e,i,o,n,r)}},Ef=(e,t,n)=>{let r=zd(t,e)??Bd(e,n,void 0);return r?r.kind===`Instance`:Nf(e,t,n)!==void 0&&[...n.bindings.keys()].some(t=>t.startsWith(`${e}!`))},Df=(e,t,n,r)=>{let i=e.location;if(Hf(e,n,r))return;let a=Ad.get(e);if(a!==void 0)return a;if(jd(t))return e.kind===`Apply`?e.args.length:0;let o=zd(n,t);if(o?.nonFactStep){r.errors.push({location:m(tf(e,t)),message:`Step number of non-expression step used as an expression.`});return}let s=o?.goal?.keyword;if(s){r.errors.push({location:m(tf(e,t)),message:`${s} proof step selected instead of expression.`});return}if(Tf(e,n,r,!1)||cf(t)&&o)return e.kind===`Apply`?e.args.length:0;if(Ef(t,n,r)){let i=zd(n,t)??Bd(t,r,void 0),a=e.kind===`Apply`?e.args.length:0;if(i?.kind===`Instance`&&i.arity!==a){r.errors.push({location:m(e.kind===`Apply`&&e.argumentsRange||tf(e,t)),message:`The operator ${t} requires ${i.arity} arguments.`});return}let o=tf(e,t);r.errors.push({location:m({...o,start:{line:o.end.line,column:o.end.column-t.slice(t.lastIndexOf(`!`)+1).length+1}}),message:`Operator name ${t} is incomplete.`});return}if(o&&e.kind!==`OperatorReference`&&(e.resolution=gd),o)return o.arity;if(Qd(t,r)?.statement.kind===`AssumeProve`)return 0;let c=Xd(t,r);if(c)return e.kind===`Identifier`?e.name=c.key:e.operator=c.key,Ad.set(e,c.arity),c.arity;let l=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``,u=l===``?void 0:zd(n,l)??Xd(l,r);if(u&&(!af.has(u.kind)||zd(n,l)?.nonFactStep)){of(l,e.kind!==`OperatorReference`&&e.selectorRanges?.[0]||tf(e,t),r);return}if(e.kind!==`OperatorReference`&&l!==``&&Wf(l,e.kind===`Apply`&&e.argumentCounts?e.args.slice(0,e.argumentCounts[0]):[],e.selectorRanges?.[0],(e.kind===`Apply`?e.argumentRanges?.[0]:void 0)??i.range,n,r))return;if(u||l!==``&&Zd(l,r))return e.kind===`Apply`?e.args.length:0;let d=nf(e),f=e.kind===`OperatorReference`||d!==void 0;if(!sf(t)||cf(t)||!f){r.errors.push({location:m(tf(e,t)),message:`Unknown operator: \`${$s(t)}'.`});return}let p=e.spelling??t;r.errors.push({location:m(d===`prefix`&&p===`-.`?ef(i,`-`):tf(e,t)),message:`Could not find declaration or definition of symbol '${p}'.`}),d&&Td.add(e),d&&i.range&&r.errors.push({location:m(i.range),message:`Couldn't resolve ${d} operator symbol \`${p}'.`})},Of=(e,t,n)=>(e.forEach(e=>Y(e.set,t,n)),e.reduce((e,t)=>Gd(e,qd(t.pattern),t.pattern.ranges,n),t)),kf=(e,t)=>e.kind===`Identifier`&&e.name===t&&M(e)||mt(e).some(e=>kf(e,t)),Af=(e,t)=>{e.kind===`FunctionConstruction`&&kf(e.body,t)&&(e.isRecursive=!0),mt(e).forEach(e=>Af(e,t))},jf=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?Jd(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:m(o),message:e})},c=e.kind===`Function`?Of(e.bounds,t,i):Kd(t,e.params,i),l=zd(c,a)??Bd(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${$s(a)} defined at wrong LET/IN level.`):l&&!u?s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${$s(a)} already defined or declared.`):l&&e.kind===`Function`&&l.arity>0?s(`Function ${$s(a)} has operator arguments in its RECURSIVE declaration.`):l&&e.kind===`Operator`&&(l.arity!==e.params.length||e.params.some(e=>e.arity>0))&&s(`Definition of ${$s(a)} has different arity than its RECURSIVE declaration.`),l&&u&&e.kind===`Operator`&&(l.params=Id(e)),e.kind===`Function`?(Y(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),Af(e.body,a),e.isSelfReferential=kf(e.body,a)):Y(e.body,c,i),l&&u?((e.kind===`Operator`||l.arity===0)&&(l.isPending=!1,l.range=o),!1):e.kind===`Function`?l===void 0:Hd(a,zd(t,a)??Bd(a,i,o),{kind:`Definition`,arity:Fd(e),range:o},i)},Mf=(e,t,n,r=[],i=[])=>{let a=/* @__PURE__ */ new Set,o=e.filter(e=>e.isRecursive&&i.every(t=>t.name!==e.name)).reduce((e,t)=>{if(zd(e,t.name)?.isPending)return e;let n={name:t.name,arity:Fd(t),params:Id(t),kind:`Definition`,parent:e,isPending:!0};return a.add(n),n},t),s=/* @__PURE__ */ new Map,c=(e,t)=>{let r={kind:`Definition`,arity:t.arity,params:Array(t.arity).fill(0),range:t.location.range},i=Hd(t.name,zd(e,t.name)??Bd(t.name,n,r.range),r,n)?{...r,name:t.name,parent:e,isPending:!0}:void 0;return i&&a.add(i),s.set(t,i),i??e},l=[...n.isGenerated?[]:r,...i].toSorted((e,t)=>Pd(e.location,t.location)),u=(e,t)=>{let r=l.findIndex(e=>!t(e));return l.splice(0,r===-1?l.length:r).reduce((e,t)=>`kind`in t?rp(t,e,n):c(e,t),e)},d=u(e.reduce((e,t)=>{let i=jd(t.name)?e:u(e,e=>!Nd(t.location,e.location)),o={name:t.name,arity:Fd(t),kind:`Definition`,range:t.location.range,parent:i,functionArity:Rd(t)};if(Ld(t))return{...o,params:Id(t),functionArity:zd(i,t.name)?.functionArity};let s=r.some(e=>e.location===t.location),c=n.isGenerated||t.isLocal||jd(t.name),l=s?{...n,isGenerated:!0,errors:[],warnings:[]}:c?{...n,isGenerated:c}:n;return jf(t,i,l,a)?{...o,params:Id(t)}:i},o),()=>!0);return s.forEach((e,t)=>{let r=t.location.range;r&&!n.isGenerated&&(!e||e.isPending)&&n.errors.push({location:m(r),message:`Symbol ${$s(t.name)} declared in RECURSIVE statement but not defined.`})}),d},Nf=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:zd(t,r)??Bd(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity,range:i.range}:void 0},Pf=(e,t,n)=>{if(!hf(e))return!1;let r=df(e),i=r.findIndex(e=>e.kind!==`Name`),a=Nf(r.slice(0,i===-1?r.length:i).flatMap(e=>e.kind===`Name`?[e.name]:[]).join(`!`),t,n),o=r[0],s=o.kind===`Name`?o.args.length:0;if(!a||s===a.arity)return!1;let c=(e.kind===`Identifier`?void 0:e.argumentRanges?.[0])??e.location.range;return c&&n.errors.push({location:m(c),message:`The operator ${a.name} requires ${a.arity} arguments.`}),!0},Ff=(e,t,n,r,i)=>{let a=e?.kind===`Definition`?e.params:void 0;return!e||!a||a.length===e.arity?!1:(r&&!i.isGenerated&&i.errors.push({location:m(r),message:`Wrong number of arguments (${n}) given to operator '${$s(t)}', \nwhich requires ${a.length} arguments.`}),!0)},If=(e,t,n)=>{let r=e.location.range,i=e=>{r&&n.errors.push({location:m(r),message:e})},a=bd.get(e);if(e.kind===`Lambda`&&e.operator!==void 0)i(`The operator ${$s(e.operator)} requires 1 arguments.`);else if(a)n.errors.push(a);else if(e.kind===`Lambda`&&r)Td.add(e),i(`LAMBDA expression used where an expression is required.`);else if(e.kind===`OperatorReference`){let r=Df(e,e.operator,t,n);r!==void 0&&i(`The operator ${$s(e.operator)} requires ${r} arguments.`)}else Y(e,t,n)},Lf=e=>{let t=e.kind===`Subexpression`||e.kind===`Apply`&&e.argumentCounts?.at(-1)===0?df(e):[],n=t.findIndex(e=>`args`in e&&e.args.length>0);if(n===-1||!hf(e))return;let r=t[n];return{index:n,range:e.selectorRanges?.[n],message:`Selector \`${r.kind===`Name`?r.name:`!(...)`}' should not have argument(s).`}},Rf=(e,t,n,r,i,a,o)=>{let s=(e,t)=>{e&&o.errors.push({location:m(e),message:t})},c=(e,c)=>{let l=Nf(r,a,o)?.range??$d(r,a,o)?.range;l&&s(i,`Operator with incorrect arity passed as argument. \nOperator '${$s(e)}' of arity ${c} is argument number ${n+1} (counting from 1) to operator \`${m(l)}', \nbut an operator of arity ${t} was expected.`)},l=e.location.range;if(t===0)return If(e,a,o),!0;let u=Hu.get(e);if(u)return s(u,`An expression appears as argument number ${n+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let d=vd.get(e)??e,f=Lf(d);if(f)return s(f.range,f.message),!1;if(e.kind===`Lambda`){if(vd.has(e)?Y(e,a,o):Uf(e,a,o),kd(Cd.get(e)))return!1;let u=e.params.length===t;return!u&&vd.has(e)?s(l,`Expected arity ${t} but found operator of arity ${e.params.length}.`):!u&&l&&e.operator===void 0?s(i,`Lambda expression with arity ${e.params.length} used as argument ${n+1} of operator \`${r}', \nbut an operator of arity ${t} is required.`):!u&&e.operator!==void 0&&c(e.operator,e.params.length),u}if(d!==e){let n=kd(Cd.get(e));return n&&o.errors.push(n),n||s(d.location.range,`Expected arity ${t} but found operator of arity 0.`),!1}if(e.kind===`Subexpression`)return Y(e,a,o),!1;if(e.kind!==`Identifier`&&e.kind!==`OperatorReference`)return s(l,`An expression appears as argument number ${n+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let p=e.kind===`Identifier`?e.name:e.operator,h=$d(p,a,o)?.params??[],g=Df(e,p,a,o);return e.kind===`Identifier`&&g!==void 0&&g!==t&&s(tf(e,p),`Expected arity ${t} but found operator of arity ${g}.`),e.kind===`OperatorReference`&&g!==void 0&&g!==t&&c(p,g),g===t&&h.every(e=>e===0)},zf=(e,t,n)=>{let r=e.operator,i=$d(r,t,n),a=Pf(e,t,n)?void 0:Df(e,r,t,n);if(a!==void 0&&a!==e.args.length&&n.errors.push({location:m(e.argumentsRange??tf(e,r)),message:`The operator ${$s(r)} requires ${a-(Nf(r,t,n)?.arity??0)} arguments.`}),a!==e.args.length){Ed.add(e);return}let o=i&&(i.kind===`Definition`?i.params:e.args.map(()=>0));if(o===void 0){e.args.forEach(e=>Bf(e,t,n));return}let s=e.selectorRanges?.at(-1)??tf(e,r),c=r===_d,l=e.args.slice(0,o.length).map((e,i)=>{let a=c?Sd.get(e):void 0;return Rf(e,o[i],a?.index??i,a?.operator??r,a?.range??s,t,c?{...n,isGenerated:!1}:n)});Ff(i,r,e.args.length,e.location.range,n)||l.forEach((t,i)=>{!t&&e.location.range&&n.errors.push({location:m(e.location.range),message:`Argument number ${i+1} to operator '${c?`LAMBDA`:r}' \nshould be a ${o[i]}-parameter operator.`})})},Bf=(e,t,n)=>{e.kind===`Identifier`?Df(e,e.name,t,n):Y(e,t,n)},Vf=(e,t,n)=>e.forEach(e=>e.args.slice(0,e.params.length).forEach((r,i)=>Rf(r,e.params[i],i,e.operator,e.range,t,n))),Hf=(e,t,n)=>{let r=yd.get(e);return r?(Vf(r.applications,t,n),n.errors.push(kd(r.nulls)??r.error),!0):!1},Uf=(e,t,n)=>Y(e.body,Gd(t,e.params,e.paramRanges,n),{...n,labelParams:[...n.labelParams,...e.params]}),Y=(e,t,n)=>{if(vd.has(e)&&!n.isGenerated){let r=Od(Cd.get(e));if(r){Vf(r.applications,t,n),n.errors.push(r.error);return}Y(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>Y(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:return;case`ExceptAt`:!n.isInExcept&&e.location.range&&(Ed.add(e),n.errors.push({location:m(e.location.range),message:`@ used where its meaning is not defined.`}));return;case`Identifier`:{let r=e.name,i=Pf(e,t,n)?void 0:Df(e,r,t,n);if(i===0){let i=$d(r,t,n),a=i?.kind;(a===`Variable`||a===`Theorem`||a?.startsWith(`New`)||Zd(r,n))&&Ed.add(e);let o=zd(t,r);if((o?o.goal:Qd(r,n))?.statement.kind===`AssumeProve`){n.errors.push({location:m(tf(e,r)),message:`ASSUME/PROVE used where an expression is required.`});return}Ff(i,r,0,tf(e,r),n);return}i!==void 0&&n.errors.push({location:m(tf(e,r)),message:`The operator ${$s(r)} requires ${i} arguments.`}),Ed.add(e);return}case`OperatorReference`:Df(e,e.operator,t,n);return;case`Apply`:zf(e,t,n);return;case`Lambda`:vd.has(e)?Uf(e,t,n):e.location.range&&(Td.add(e),n.errors.push({location:m(e.location.range),message:`LAMBDA expression used where an expression is required.`}));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:Y(e.expression,t,n);return;case`If`:r([e.condition,e.consequent,e.alternative]);return;case`Case`:r(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&Y(e.other,t,n);return;case`Let`:Y(e.body,Mf(e.definitions,t,n,e.instances,e.recursive),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:Y(e.body,Of(e.bounds,t,n),i(Jd(e.bounds)));return;case`UnboundedQuantifier`:Y(e.body,Gd(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&Y(e.set,t,n),Y(e.body,Gd(t,qd(e.pattern),e.pattern.ranges,n),i(qd(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:Y(e.predicate,Of([e.bound],t,n),i(qd(e.bound.pattern)));return;case`SetMap`:Y(e.expression,Of(e.bounds,t,n),i(Jd(e.bounds)));return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((r,i)=>{e.fields.slice(0,i).some(e=>e.name===r.name)&&n.errors.push({location:m(r.location.range??ef(r.location,r.name)),message:`Non-unique fields in constructor.`}),Y(r.value,t,n)});return;case`Except`:Y(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),Y(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:{let i=e.function,a=i.kind===`Identifier`?i.name:i.kind===`Apply`?i.operator:void 0,o=a===void 0?void 0:$d(a,t,n)?.functionArity;Y(i,t,n);let s=e.args.length;if(o===void 0||s<2||o===s||Dd(i)){r(e.args);return}Ed.add(e),e.location.range&&n.errors.push({location:m(e.location.range),message:`Function '${a}' is defined with ${o} parameters, but is applied to ${s} arguments.`});return}case`FieldAccess`:Y(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:if(Cf(e,n))return;Y(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),wf(e,t,n);return;case`Subexpression`:Gf(e,t,n)&&Ed.add(e);return;case`Selection`:return}},Wf=(e,t,n,r,i,a)=>{let o=zd(i,e)??Bd(e,a,void 0);return!o?.isPending||!n||!r?!1:t.length===o.arity?(t.forEach(e=>Y(e,i,a)),a.errors.push({location:m(n),message:`Subexpression of \`${e}' used inside the operator's definition.`}),!0):(a.errors.push({location:m(r),message:`The operator ${e} requires ${o.arity} arguments.`}),!0)},Gf=(e,t,n)=>{if(Pf(e,t,n)||Hf(e,t,n))return!0;let r=e.selectors[0],i=e.selectorRanges?.[0],a=e.selectors.findIndex(e=>e.kind!==`Name`),o=e.selectors.slice(0,a).flatMap(e=>e.kind===`Name`?[e.name]:[]),s=o.findIndex((e,t)=>t>0&&(Xd(o.slice(0,t+1).join(`!`),n)?.kind??`Instance`)!==`Instance`),c=o.length>1&&(zd(t,o[0])??Bd(o[0],n,void 0))?.kind===`Instance`,l=e.selectorRanges?.[a-1];if(c&&s===-1&&i&&l)return n.errors.push({location:m({module:i.module,start:i.start,end:l.end}),message:`Unknown operator: \`${$s(o.join(`!`))}'.`}),!0;let u=o.slice(0,s+1).join(`!`),d=s>0?Xd(u,n):void 0,f=e.selectors.slice(0,s+1).flatMap(e=>`args`in e?e.args:[]).length,p=e.argumentRanges?.[s]??e.location.range;if(d&&d.arity!==f&&p)return n.errors.push({location:m(p),message:`The operator ${$s(u)} requires ${d.arity} arguments.`}),!0;if(r.kind===`Name`&&e.selectors[1].kind!==`Name`&&i){let e=zd(t,r.name),a=e??Xd(r.name,n);if(a===void 0&&!Zd(r.name,n)||a?.kind===`Instance`)return n.errors.push({location:m(i),message:`Unknown operator: \`${$s(r.name)}'.`}),!0;if(a&&(!af.has(a.kind)||e?.nonFactStep))return of(r.name,i,n),!0}if(r.kind===`Name`&&Wf(r.name,r.args,i,e.argumentRanges?.[0]??e.location.range,t,n))return!0;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Bf(e,t,n));let h=Tf(e,t,n,!1);return h?h.node===void 0:!1},Kf=(e,t)=>{let n=e.location.range;!t.isModuleKnown(e.name,e.location)&&n&&t.errors.push({location:m({...n,start:{line:n.end.line,column:n.end.column-e.name.length+1}}),message:`Module \`${e.name}' used without being extended or instantiated.`})},qf=(e,t,n,r)=>{if(e.kind===`ModuleFact`){Kf(e,r);return}if(e.kind===`ExceptAt`&&e.location.range)return r.errors.push({location:m(e.location.range),message:"Unknown operator: `@'."}),rf;let i=Zf(e,t,n,r);if(vd.has(e))return Y(e,n,r),i;if(Pf(e,n,r))return i;let a=Tf(e,n,r,!0);if(a){let t=a.node?.kind;return t===void 0?rf:t===`AssumeProve`||t===`NewSymbol`?void 0:e.location.range&&m(e.location.range)}if(e.kind===`Subexpression`)return Gf(e,n,r)?rf:i;let o=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;return e.kind===`Identifier`&&zd(n,o)?.nonFactStep?(r.errors.push({location:m(tf(e,o)),message:`Step number of non-fact used as a fact`}),rf):(Zd(o,r)||zd(n,o)?.goal||e.kind===`Identifier`&&Ef(o,n,r)||Y(e,n,r),i)},Jf=(e,t,n)=>{if(e.kind===`ModuleFact`)return Kf(e,n),n.isModuleKnown(e.name,e.location);let r=Uu.get(e)??[];if(n.errors.push(...r.map(e=>({location:Qu(e.location),message:e.message}))),r.length>0)return!1;let i=Wu(e),a=i??vd.get(e)??e,o=a.location.range;if(!o)return!0;let s=a.kind===`Identifier`?a.name:a.kind===`Apply`||a.kind===`OperatorReference`?a.operator:``,c=zd(t,s),l=c??Xd(s,n)??Bd(s,n,o);return l===void 0&&Zd(s,n)||(hf(a)&&df(a).length>1&&(l===void 0||Lf(a))?Xf(e,a,t,n):s===``||Yf(s,c,l,o,n))?!0:(n.errors.push({location:m((i?e:a).location.range??o),message:`DEF clause entry should describe a defined operator.`}),!1)},Yf=(e,t,n,r,i)=>(n===void 0&&i.errors.push({location:m(r),message:`Unknown operator: \`${$s(e)}'.`}),t?.nonFactStep===`Define`||(t?.nonFactStep&&i.errors.push({location:m(r),message:`DEF clause entry refers to a non-definition step.`}),n!==void 0&&af.has(n.kind)&&!cf(e))),Xf=(e,t,n,r)=>{let i=(e,t)=>(e&&r.errors.push({location:m(e),message:t}),!1),a=Lf(t);if(a?.index===0)return i(a.range,a.message);let o=df(t),s=t.selectorRanges,c=yd.get(e);if(!c&&!vd.has(e)){let e=o[0],c=e.kind===`Name`?e.name:``,l=zd(n,c),u=l??Xd(c,r);if(u&&(!af.has(u.kind)||l?.nonFactStep)&&s?.[0])return of(c,s[0],r),!1;if(a)return i(a.range,a.message);if(Tf(t,n,r,!1))return!1;let d=s?.[0],f=s?.[o.findLastIndex(e=>e.kind===`Name`)],p=o.flatMap(e=>e.kind===`Name`?[e.name]:[]);return i(d&&f&&{...d,end:f.end},`Unknown operator: \`${$s(p.join(`!`))}'.`)}if(a)return i(a.range,a.message);let l=c?kd(c.nulls)??c.error:kd(Cd.get(e));return l?(r.errors.push(l),!1):o.at(-1)?.kind===`Name`&&o.at(-2)?.kind!==`Name`},Zf=(e,t,n,r)=>{let i=e.location.range&&m(e.location.range);if(vd.has(e))return kd(Cd.get(e))?rf:t.location.range&&m(t.location.range);if(yd.has(e)||e.kind===`ExceptAt`)return rf;switch(e.kind){case`Number`:case`String`:case`Decimal`:case`Let`:case`Label`:return;case`Identifier`:case`Apply`:case`Subexpression`:{let t=df(e)[0];if(e.kind===`Subexpression`||t.kind!==`Name`)return;let a=e.kind===`Identifier`?e.name:e.operator,o=zd(n,t.name)?.goal??Qd(t.name,r);if(Zd(a,r)||o||cf(a)&&zd(n,a)||e.kind===`Identifier`&&Ef(a,n,r))return;let s=$d(a,n,r),c=e.kind===`Apply`?e.args.length:0;return s?.arity===c?i:rf}default:return i}},Qf=(e,t,n)=>{let r=xd.get(e.facts)??e.facts,i=e.facts.map((e,i)=>qf(e,r[i],t,n)),a=e.facts.filter(e=>e.kind!==`ModuleFact`||n.isModuleKnown(e.name,e.location)).length,o=e.defs.filter(e=>Jf(e,t,n)).length;i.forEach(t=>{t&&e.kind===`Hide`&&n.errors.push({location:t,message:`The only expression allowed as a fact in a HIDE is
|
|
402
|
-
the name of a theorem, assumption, or step.`})});let s=e.location.range;a+o===0&&s&&n.errors.push({location:m(s),message:e.kind===`By`?`Empty BY`:`Empty USE or HIDE statement.`})},$f=(e,t,n)=>(e.set&&Y(e.set,t,n),Ud(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),ep=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:$f(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?ep(t,e.scope,e.unit,!0):Y(t,e.scope,e.unit),e),{scope:t,unit:n});return Y(e.conclusion,i.scope,i.unit),i.scope},tp=(e,t,n)=>e.kind===`AssumeProve`?ep(e,t,n):(Y(e,t,n),t),np=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Qf(e,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>ap(t,e,r),t)},rp=(e,t,n)=>{let r=dp(e,t,n);return e.name===void 0?r:Ud(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},ip=(e,t)=>{let n=(e,t)=>({statement:t,isSuffices:!1,isInProof:!1,keyword:e});switch(e.kind){case`Have`:return n(`HAVE`,{kind:`Tuple`,elements:[e.expression],location:t});case`Case`:return n(`CASE`,{kind:`Tuple`,elements:[e.expression],location:t});case`Witness`:return n(`WITNESS`,{kind:`Tuple`,elements:e.expressions,location:t});case`Take`:return n(`TAKE`,{kind:`Tuple`,elements:ff(e.bounds),location:t});case`Pick`:return n(`PICK`,e.bounds.length>0?{kind:`Exists`,bounds:e.bounds,body:e.body,location:t}:{kind:`UnboundedQuantifier`,quantifier:`Exists`,names:e.names,body:e.body,location:t});case`Qed`:return n(`QED step`,{kind:`Tuple`,elements:[],location:t});default:return}},ap=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=ip(r,e.location),o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,goal:a},s=(t,n)=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,nonFactStep:n};switch(r.kind){case`Assert`:{let a=tp(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return np(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0,keyword:r.isSuffices&&r.statement.kind!==`AssumeProve`?`SUFFICES`:void 0};return np(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return Qf(r,t,n),s(t,r.kind);case`Instance`:return s(rp(r,t,i),r.kind);case`Define`:return s(r.definitions.reduce((e,t)=>t.kind===`Instance`?rp(t,e,i):Mf([t],e,n),t),r.kind);case`Have`:case`Case`:return Y(r.expression,t,i),np(e.proof,o(t),n),o(t);case`Witness`:return r.expressions.forEach(e=>Y(e,t,i)),o(t);case`Take`:return o(Gd(Of(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let a=Gd(Of(r.bounds,t,i),r.names,r.nameRanges,i);return Y(r.body,a,{...i,labelParams:[...i.labelParams,...Jd(r.bounds),...r.names]}),np(e.proof,o(t),n),o(a)}default:return np(e.proof,o(t),n),o(t)}},op=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:tp(e.statement,void 0,t);e.name!==void 0&&Wd(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),np(e.proof,n,t),r&&(r.isInProof=!1)},sp={line:0,column:0},cp=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),lp=(e,t)=>{let n=new Map([...Md,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},up=(e,t,n,r,i)=>{let a=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),r),o=(e,t)=>i.errors.push({location:t,message:`An operator must be substituted for symbol '${$s(e.name)}', and it must have arity ${e.arity}.`}),s=(e,t)=>{let n=t.location.range;if(e.arity===0){If(t,a,i);return}let r=Hu.get(t),s=r?void 0:vd.get(t);if(s){let n=t.kind===`Lambda`?t.params.length:0,r=kd(Cd.get(t));t.kind===`Lambda`?Y(t,a,i):r&&i.errors.push(r),!r&&n!==e.arity&&s.location.range&&i.errors.push({location:m(s.location.range),message:`Expected arity ${e.arity} but found operator of arity ${n}.`}),(r||n!==e.arity)&&o(e,rf);return}if(t.kind===`Subexpression`&&!r){Y(t,a,i),o(e,rf);return}if(t.kind===`Lambda`&&!r){Uf(t,a,i),t.params.length!==e.arity&&n&&o(e,m(n));return}if(t.kind===`OperatorReference`&&!r){let r=Df(t,t.operator,a,i);r===void 0?o(e,rf):r!==e.arity&&n&&o(e,m(n));return}if(t.kind!==`Identifier`||r){let t=r??n;t&&i.errors.push({location:m(t),message:`Arity ${e.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${$s(e.name)}'.`}),o(e,rf);return}let c=Df(t,t.name,a,i);c!==void 0&&c!==e.arity&&i.errors.push({location:m(tf(t,t.name)),message:`Expected arity ${e.arity} but found operator of arity ${c}.`}),c!==e.arity&&o(e,rf)},c=e.location.range,l=t.filter(e=>zd(a,e.name)!==void 0||Xd(e.name,i)!==void 0).map(t=>({declaration:t,expression:{kind:`Identifier`,name:t.name,location:e.location}}));l.filter(e=>e.declaration.arity===0).forEach(e=>{let t=Df(e.expression,e.declaration.name,a,i);t&&c&&i.errors.push({location:m(c),message:`Wrong number of arguments (0) given to operator '${$s(e.declaration.name)}', \nwhich requires ${t} arguments.`})});let u=/* @__PURE__ */ new Map;return e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){i.errors.push({location:m(e.nameRange),message:`Identifier '${n}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let a=e.expression;s(r,a);let o=a.location.range;u.has(n)?o&&i.errors.push({location:m(o),message:`Multiple substitutions for symbol '${n}' in substitution.`}):u.set(n,a)}),l.filter(e=>!u.has(e.declaration.name)).forEach(e=>{(e.declaration.arity===0?0:Df(e.expression,e.declaration.name,a,i))!==e.declaration.arity&&c&&o(e.declaration,m(c)),u.set(e.declaration.name,e.expression)}),t.filter(e=>!u.has(e.name)).forEach(e=>{let t=e.location.range;c&&t&&i.errors.push({location:m(c),message:`Substitution missing for symbol ${$s(e.name)} declared at ${m(t)} \nand instantiated in module ${n}.`})}),u},dp=(e,t,n)=>{let r=n.getInstance(e);return up(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,t)=>Ud(e,t[0],t[1],n),t)},fp=(e,t,n,r)=>{let i=lp(n,r.imported),a=new Map([...n.constants,...n.variables].map(e=>[e.name,e.location])),o={location:e.location,errors:[],warnings:[]};return r.reports.push(o),up(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,isModuleKnown:r.isModuleKnown,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(e=>[e[0],{...e[1],position:a.get(e[0])??sp}])),errors:o.errors,warnings:o.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},pp=(e,t)=>{let n=[],r=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>Pd(e.location,t.location)).forEach(e=>{let i=[],a=[];try{e.check(i,a)}catch(e){if(!(e instanceof s)||!e.sany&&i.length===0)throw e;i.push(...e.sany?.errors??[])}i.forEach(e=>r(n,e)),a.forEach(e=>r(t,e))}),n},mp=(e,t)=>{let n=lp(e,t.imported),r=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1,keyword:void 0}]]:[])),i=new Map([...Md,...t.bound].map(e=>[e[0],{...e[1],position:sp}])),a=/* @__PURE__ */ new Set,o=[],s=(e,a,o,s)=>({location:e,check:(c,l)=>s({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,isModuleKnown:t.isModuleKnown,location:e,self:a,facts:t.facts,goals:r,bindings:i,errors:c,warnings:l,hasLabelScope:o,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})}),c=(e,t)=>e.map(e=>s(e.location,void 0,!1,n=>Wd(e.name,{kind:t,arity:e.arity,range:e.location.range},n)));return pp([...e.units.flatMap(e=>{let t=e.kind===`Variables`?{type:`A VARIABLE declaration`,location:e.location}:e.kind===`Constants`?{type:`A declaration`,location:e.location}:e.kind===`Module`?{type:`A MODULE `,location:e.module.location}:e.kind===`Theorem`?{type:`A THEOREM`,location:e.theorem.location}:e.kind===`Assumption`?{type:`An ASSUME`,location:e.assumption.location}:e.kind===`Use`?{type:`A USE or HIDE`,location:e.use.location}:void 0,n=t?.location.range;return!t||!n?[]:[{location:t.location,check:e=>{o.some(e=>e.binding?.isPending)&&e.push({location:m(n),message:`${t.type} may not appear within a recursive definition section.`})}}]}),...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...c(e.constants,`Constant`),...c(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>s(e.location,void 0,!1,t=>{let n={kind:`Definition`,arity:e.arity,params:Array(e.arity).fill(0),range:e.location.range,position:e.location,isPending:!0},r=Hd(e.name,i.get(e.name),n,t);r&&(i.set(e.name,n),a.add(n)),o.push({declaration:e,binding:r?n:void 0})})),...e.definitions.map(t=>s(t.location,t,!0,n=>{cp(e,t)?Y(t.body,void 0,n):jf(t,void 0,n,a)&&i.set(t.name,{kind:`Definition`,arity:Fd(t),range:t.location.range,position:t.location})})),...e.instances.map(e=>s(e.location,void 0,!1,n=>{Kd(void 0,e.params,n),t.instanced.get(e)?.forEach((e,t)=>Wd(t,e,n)),e.name!==void 0&&Wd(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)})),...e.assumptions.map(e=>s(e.location,void 0,e.name!==void 0,t=>{Y(e.expression,void 0,t),e.name!==void 0&&Wd(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t)})),...e.theorems.map(e=>s(e.location,void 0,e.name!==void 0,t=>op(e,t))),...e.uses.map(e=>s(e.location,void 0,!1,t=>Qf(e,void 0,t))),{location:e.location.range?.end??e.location,check:e=>o.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:m(n),message:`Symbol ${$s(t.declaration.name)} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},hp=/* @__PURE__ */ new WeakSet,gp=/* @__PURE__ */ new WeakMap,_p=(e,t)=>{if(t.length===0)return e;let n={...e};return hp.has(e)&&hp.add(n),gp.set(n,[...t,...gp.get(e)??[]]),n},vp=(e,t,n=/* @__PURE__ */ new Set)=>{let r=wp(e,(e,r)=>vp(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&M(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&M(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},yp=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),bp=/* @__PURE__ */ new WeakMap,xp=e=>bp.get(e)??e.name,Sp=(e,t)=>(xp(t)!==e.name&&bp.set(e,xp(t)),e),Cp=(e,t)=>Sp(e.kind===`Function`?{...e,bounds:yp(e.bounds,e=>t(e,[])),body:t(e.body,Jd(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),wp=(e,t)=>{let n=e=>t(e,[]);switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return e;case`Apply`:return{...e,args:e.args.map(n)};case`Lambda`:return{...e,body:t(e.body,e.params)};case`And`:case`Or`:return{...e,operands:e.operands.map(n)};case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return{...e,expression:n(e.expression)};case`If`:return{...e,condition:n(e.condition),consequent:n(e.consequent),alternative:n(e.alternative)};case`Case`:return{...e,arms:e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:e.other?n(e.other):void 0};case`Let`:{let n=e.definitions.map(e=>e.name);return{...e,definitions:e.definitions.map(e=>Cp(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:yp(e.bounds,n),body:t(e.body,Jd(e.bounds))};case`UnboundedQuantifier`:return{...e,body:t(e.body,e.names)};case`Choose`:return{...e,set:e.set?n(e.set):void 0,body:t(e.body,qd(e.pattern))};case`SetEnumeration`:case`Tuple`:return{...e,elements:e.elements.map(n)};case`SetFilter`:return{...e,bound:{pattern:e.bound.pattern,set:n(e.bound.set)},predicate:t(e.predicate,qd(e.bound.pattern))};case`SetMap`:return{...e,bounds:yp(e.bounds,n),expression:t(e.expression,Jd(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({...e,path:e.path.map(e=>e.kind===`Index`?{...e,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Selection`:return{...e,expression:n(e.expression)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},Tp=[],Ep=(e,t)=>{for(let n=0;n<e.length;n++)t(e[n],Tp)},Dp=(e,t)=>{for(let n=0;n<e.length;n++)t(e[n].set,Tp)},Op=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return;case`Apply`:case`Bracket`:return Ep(e.args,t);case`Lambda`:return t(e.body,e.params);case`And`:case`Or`:return Ep(e.operands,t);case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`Selection`:return t(e.expression,Tp);case`If`:return t(e.condition,Tp),t(e.consequent,Tp),t(e.alternative,Tp);case`Case`:for(let n=0;n<e.arms.length;n++)t(e.arms[n].condition,Tp),t(e.arms[n].body,Tp);e.other&&t(e.other,Tp);return;case`Let`:{let n=e.definitions.map(e=>e.name);return e.definitions.forEach(e=>{e.kind===`Function`?(Dp(e.bounds,e=>t(e,n)),t(e.body,[...n,...Jd(e.bounds)])):t(e.body,[...n,...e.params.map(e=>e.name)])}),t(e.body,n)}case`Forall`:case`Exists`:case`FunctionConstruction`:return Dp(e.bounds,t),t(e.body,Jd(e.bounds));case`UnboundedQuantifier`:return t(e.body,e.names);case`Choose`:return e.set&&t(e.set,Tp),t(e.body,qd(e.pattern));case`SetEnumeration`:case`Tuple`:return Ep(e.elements,t);case`SetFilter`:return t(e.bound.set,Tp),t(e.predicate,qd(e.bound.pattern));case`SetMap`:return Dp(e.bounds,t),t(e.expression,Jd(e.bounds));case`FunctionSet`:return t(e.domain,Tp),t(e.range,Tp);case`Record`:case`RecordSet`:for(let n=0;n<e.fields.length;n++)t(e.fields[n].value,Tp);return;case`Except`:t(e.function,Tp);for(let n=0;n<e.updates.length;n++){let r=e.updates[n];for(let e=0;e<r.path.length;e++){let n=r.path[e];n.kind===`Index`&&Ep(n.args,t)}t(r.value,Tp)}return;case`FunctionApplication`:return t(e.function,Tp),Ep(e.args,t);case`FieldAccess`:return t(e.record,Tp);case`Product`:return Ep(e.factors,t);case`BoxAction`:case`AngleAction`:return t(e.action,Tp),t(e.subscript,Tp);case`WeakFairness`:case`StrongFairness`:return t(e.subscript,Tp),t(e.action,Tp);case`Label`:return t(e.body,Tp);case`Subexpression`:e.selectors.forEach(e=>{`args`in e&&Ep(e.args,t)})}},kp=`LAMBDA`,Ap=e=>`${e}@SUBSTITUTION`,jp=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(jp),Mp=(e,t)=>{if(e.kind!==`Identifier`)return!jp(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=M(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!jp(n.body)},Np=(e,t=/* @__PURE__ */ new Set)=>{let n=ht(e),r=n===void 0||t.has(n)?[]:[n];return Op(e,(e,n)=>r.push(...Np(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n])))),r},Pp=e=>{let t=/* @__PURE__ */ new Map;return n=>{if(!e.substitutedNames.has(n))return n;let r=t.get(n)??e.instantiation.createName(n);return t.set(n,r),r}},Fp=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Ip=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Lp=(e,t)=>e.map(e=>({pattern:Ip(e.pattern,t),set:e.set})),Rp=(e,t)=>e.kind===`Function`?{...e,bounds:Lp(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},zp=(e,t,n)=>{let r=e=>t.get(e)??e;switch(e.kind){case`Identifier`:return{...e,name:r(e.name)};case`Apply`:case`OperatorReference`:return{...e,operator:r(e.operator)};case`Label`:return{...e,params:e.params.map(r)};case`Lambda`:return{...e,params:e.params.map(n)};case`Let`:return{...e,definitions:e.definitions.map(e=>Sp({...Rp(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Lp(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Ip(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Ip(e.bound.pattern,n),set:e.bound.set}};default:return e}},Bp=e=>`${e}@ENABLED`,Vp=(e,t)=>e.modes.get(t)??e,Hp=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!M(e)&&t.instantiation.variables.has(e.name),Up=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Up(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Hp(e,t,n))return[e.name];let r=M(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?Up(r.body,t,/* @__PURE__ */ new Map):void 0},Wp=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Hp(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Bp(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Xp(e.expression,Vp(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Xp(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Xp(e.subscript,Vp(t,`Primed`),n),location:r},Xp(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Up(e.expression,t,n);if(r!==void 0)return{kind:`And`,operands:r.map(r=>({kind:`Apply`,operator:`=`,args:[{kind:`Prime`,expression:{kind:`Identifier`,name:Bp(r),location:e.location},location:e.location},Xp({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Gp=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:gd}),Kp=(e,t)=>e.map(e=>Gp(e.name,t)),qp=(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:Kp(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),Jp=(e,t,n,r)=>{let i=Array.from({length:n},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:i,body:{kind:`Apply`,operator:e,args:[...Kp(t,r),...i.map(e=>Gp(e,r))],location:r},location:r}},Yp=(e,t)=>e.instantiation.isParameterized(t)?Qp(e,t):void 0,Xp=(e,t,n)=>{let r=e=>Xp(e,t,n);if(e.kind===`Selection`&&[...n].every(e=>e[0]===e[1])){let n=e.expression,i=t.selections.get(n)??r(n);return t.selections.set(n,i),{...e,expression:i}}let i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!M(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:Xp(e.expression,Vp(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:Xp(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},Vp(t,`Enabled`),n)};let c=Wp(e,t,n);if(c)return c;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name),r=t.bindings;if(n&&(r===void 0||!Mp(n,i)))return _p(n,[e]);if(n&&r){let t=Ap(e.name);return r.set(t,n),Gp(t,e.location)}let o=Yp(t,e.name);if(o===void 0)return e;if(a.length===0)return{...e,name:o};let s=i.getDefinition(e.name);return s&&Fd(s)>0?Jp(o,a,Fd(s),e.location):{kind:`Apply`,operator:o,args:Kp(a,e.location),location:e.location}}if(e.kind===`Apply`&&o(e.operator)){let n=e.args.map(r),o=i.substitutions.get(e.operator),c=i.substitutions.size>0||a.length>0||hp.has(e),l=e=>(c&&hp.add(e),e);if(o?.kind===`Identifier`||o?.kind===`OperatorReference`){let t=o.kind===`Identifier`?o.name:o.operator;return l({...e,operator:t,args:n,resolution:o.kind===`Identifier`?o.resolution:void 0})}if(o?.kind===`Apply`)return l({...e,operator:o.operator,args:[...o.args,...n],resolution:o.resolution});if(o?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:kp,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:kp,args:n,resolution:gd},location:e.location};if(o)throw new s(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let u=Yp(t,e.operator);return u===void 0?l({...e,args:n}):{...e,operator:u,args:[...Kp(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=i.substitutions.get(e.operator);if(n?.kind===`Identifier`||n?.kind===`OperatorReference`||n?.kind===`Lambda`)return _p(n,[e]);let r=Yp(t,e.operator);if(r===void 0)return e;let o=i.getDefinition(e.operator);return a.length>0&&o?Jp(r,a,Fd(o),e.location):{...e,operator:r}}let l=Pp(t),u=wp(e,(e,i)=>i.length===0?r(e):Xp(e,t,Fp(n,i,l)));return zp(u,n,l)},Zp=(e,t,n)=>t.length===0?e:e.kind===`Operator`?{...e,params:[...t,...e.params]}:{kind:`Operator`,name:e.name,params:t,body:{kind:`Let`,definitions:[e],body:Gp(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Qp=(e,t)=>{let n=e.copies.get(t);if(n!==void 0)return n;let r=e.instantiation,i=r.getDefinition(t);return i?r.addDefinition(t,i.name,n=>{e.copies.set(t,n);let a=Pp(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o,selections:/* @__PURE__ */ new Map}:e,c=Rp(Cp(i,(e,t)=>Xp(e,s,Fp(/* @__PURE__ */ new Map,t,a))),a),l=c.kind!==`Operator`||o.size===0?c.body:{kind:`Let`,definitions:[...o].map(e=>({kind:`Operator`,name:e[0],params:[],body:e[1],isLocal:!0,isRecursive:!1,location:e[1].location})),body:c.body,location:{line:c.body.location.line,column:c.body.location.column}},u=r.frame;return u&&gp.set(l,[u,...gp.get(i.body)??[]]),Zp({...c,body:l},r.params,i.location)}):t},$p=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Np(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t,selections:/* @__PURE__ */ new Map};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>Yp(i,e)??e,getQualifiedKey:t=>{let n=Yp(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Zp(r,e.params,r.location)):t}}},em=e=>e.kind===`Let`&&e.instances!==void 0||mt(e).some(em),tm=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=wp(e,e=>tm(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>Nd(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},nm=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,rm=(e,t)=>e.definitions.some(e=>em(e.body))||e.assumptions.some(e=>em(e.expression))||e.theorems.some(e=>{let t=nm(e);return t!==void 0&&em(t)})?{...e,definitions:e.definitions.map(e=>Cp(e,e=>tm(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:tm(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=nm(e);return n===void 0?e:{...e,statement:tm(n,t,[])}})}:e,im=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]],[`_Track`,0,[0,0],[3,2],[0,0]],[`_Counts`,0,[],[],[]],[`_CheckName`,0,[0],[2],[1]],[`_PrintCounts`,0,[],[],[]]].map(e=>[e[0],{name:e[0],level:e[1],isCorrect:!0,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}])),am={Naturals:{Nat:[14,1,14,16],"+":[15,1,15,19],"-":[17,1,17,33],"*":[18,1,18,17],"^":[19,1,19,19],"<":[20,1,20,19],">":[21,1,21,19],"<=":[22,1,22,19],">=":[23,1,23,19],"%":[33,1,33,20],"\\div":[34,1,34,20],"..":[35,1,35,20]},Integers:{Int:[18,1,18,12],"-.":[22,1,22,13]},Sequences:{Seq:[20,1,20,41],Len:[25,1,25,44],"\\o":[30,1,31,76],Append:[36,1,36,26],Head:[41,1,41,15],Tail:[42,1,42,61],SubSeq:[48,1,48,50],SelectSeq:[53,1,65,14]},FiniteSets:{IsFiniteSet:[14,1,19,68],Cardinality:[21,1,27,11]},Bags:{IsABag:[20,1,24,41],BagToSet:[26,1,26,23],SetToBag:[31,1,31,30],BagIn:[36,1,36,31],EmptyBag:[41,1,41,24],"\\oplus":[43,1,49,46],"\\ominus":[51,1,60,50],BagUnion:[74,1,79,58],"\\sqsubseteq":[81,1,87,42],SubBag:[89,1,110,11],BagOfAll:[122,1,130,66],BagCardinality:[132,1,138,8],CopiesIn:[140,1,145,33]},TLC:{Print:[17,1,17,22],PrintT:[18,1,18,19],Assert:[24,1,25,54],JavaTime:[26,1,26,32],TLCGet:[75,1,75,28],TLCSet:[76,1,76,20],":>":[78,1,78,27],"@@":[79,1,80,50],Permutations:[81,1,82,54],SortSeq:[88,1,92,40],RandomElement:[110,1,110,41],Any:[119,1,119,22],ToString:[121,1,121,58],TLCEval:[145,1,145,15]},TLCExt:{AssertEq:[14,1,20,14],AssertError:[23,1,26,72],TLCGetOrDefault:[30,1,31,17],TLCGetAndSet:[33,1,35,57],Trace:[41,1,57,6],CounterExample:[61,1,75,8],ToTrace:[77,1,87,12],TLCModelValue:[91,1,120,29],TLCDefer:[122,1,134,6],TLCNoOp:[138,1,145,5],PickSuccessor:[148,1,162,37],TLCCache:[166,1,173,12],TLCFP:[175,1,181,24],TLCEvalDefinition:[185,1,190,6]},Randomization:{RandomSubset:[30,1,30,64],RandomSetOfSubsets:[48,1,49,67],TestRandomSetOfSubsets:[61,1,62,71]},Json:{ToJson:[46,1,55,37],ToJsonArray:[57,1,64,42],ToJsonObject:[66,1,73,43],JsonSerialize:[75,1,80,6],JsonDeserialize:[82,1,87,19],ndJsonSerialize:[89,1,95,6],ndJsonDeserialize:[97,1,103,19]},_Possible:{_Track:[10,1,17,38],_Counts:[24,1,30,14],_CheckName:[32,1,35,35],_PrintCounts:[37,1,37,31]}},om=(e,t)=>{let n=am[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},sm={Constant:0,Variable:1,State:1,Action:2,Temporal:3},cm=(e,t)=>`${e}${t}`,lm=(e,t,n)=>`${e}${t}${n}`,um=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},dm=(e,t,n)=>`${e},${t},${n}`,fm=(e=0)=>({level:e,isCorrect:!0,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),pm=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),mm=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),hm=(e,t)=>{t.constraints.forEach((t,n)=>pm(e.constraints,n,t)),t.argConstraints.forEach((t,n)=>mm(e.argConstraints,n,t)),t.argParams.forEach(t=>e.argParams.add(t))},X=(e,t,n,r)=>({...fm(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),gm=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,_m=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,vm=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=>[e[0],{...X(e[0],e[1],[...e[2]],[...e[3]]),nonLeibniz:new Set(e[1]>1?[0,1]:[])}])),ym=X(`'`,2,[1],[0]),bm=X(`UNCHANGED`,2,[1],[0]),xm=X(`ENABLED`,1,[2],[0]),Sm=X(`[]`,3,[3],[0]),Cm=X(`<>`,3,[3],[0]),wm=X(`$ConjList`,0,[3],[1]),Tm=X(`$DisjList`,0,[3],[1]),Em=X(`$IfThenElse`,0,[3],[1]),Dm=X(`$Case`,0,[3],[1]),Om=X(`$BoundedForall`,0,[3],[1]),km=X(`$BoundedExists`,0,[3],[1]),Am=X(`$UnboundedForall`,0,[3],[1]),jm=X(`$UnboundedExists`,0,[3],[1]),Mm=X(`$TemporalForall`,3,[3],[0]),Nm=X(`$TemporalExists`,3,[3],[0]),Pm=X(`$BoundedChoose`,0,[2],[1]),Fm=X(`$UnboundedChoose`,0,[2],[1]),Im=X(`$SetEnumerate`,0,[2],[1]),Lm=X(`$Tuple`,0,[2],[1]),Rm=X(`$SetOfFcns`,0,[2],[1]),zm=X(`$CartesianProd`,0,[2],[1]),Bm=X(`$SubsetOf`,0,[2],[1]),Vm=X(`$SetOfAll`,0,[2],[1]),Hm=X(`$FcnConstructor`,0,[3],[1]),Um=X(`$RcdConstructor`,0,[3],[1]),Wm=X(`$SetOfRcds`,0,[2],[1]),Gm=X(`$Except`,0,[2],[1]),Km=X(`$Pair`,0,[3],[1]),qm=X(`$Seq`,0,[2],[1]),Jm=X(`$FcnApply`,0,[2,2],[1,1]),Ym=X(`$RcdSelect`,0,[2,0],[1,1]),Xm=X(`$SquareAct`,2,[2,1],[0,0]),Zm=X(`$AngleAct`,2,[2,1],[0,0]),Qm=X(`$WF`,3,[1,2],[0,0]),$m=X(`$SF`,3,[1,2],[0,0]),eh=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity,level:0}])]),th=e=>e.map(e=>({name:e,arity:0})),nh=e=>e.kind===`Operator`?e.params:[],rh=e=>e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,ih=(e,t)=>{let n=new Map(t);return e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n})),n},ah=(e,t,n)=>{let r=nh(e);return{...fm(),name:e.name,formals:r,maxLevels:r.map(()=>t),weights:r.map(()=>n),minMaxLevels:r.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}},oh=(e,t,n=!0)=>{let r=[],i=[],a=[],o=[],s=0,c=0,l=()=>{let t=a.length;for(;t>0&&o[t-1]===void 0;)t--;let n=o[t-1]??e;for(let e=t;e<a.length;e++){let t=a[e];n=Array.isArray(t)?eh(n,th(t)):t.kind===`Let`?ih(t,n):t.kind===`Function`?eh(n,th(Jd(t.bounds))):eh(n,t.params),o[e]=n}return n},u=(e,t)=>{a.push(e),o.push(void 0),f(t),a.pop(),o.pop()},d=(e,t)=>t.length===0?f(e):u(t,e),f=e=>{if(e.kind!==`Let`)return Op(e,d);if(a.push(e),o.push(void 0),c++,e.recursive)h(sh(e));else for(let t=0;t<e.definitions.length;t++)p(e.definitions[t]);c--,f(e.body),a.pop(),o.pop()},p=e=>{if(e.kind===`Function`)for(let t=0;t<e.bounds.length;t++)f(e.bounds[t].set);if(u(e,e.body),s===0)return;let t=i[c]??=/* @__PURE__ */ new Set;e.isRecursive&&t.delete(e.name)?s--:r.at(-1)?.members.push({definition:e,scope:l(),isRechecked:t.size>0})},m=(e,t)=>{s===0&&r.push({location:t,members:[]});let n=i[c]??=/* @__PURE__ */ new Set;e.forEach(e=>{n.has(e.name)||(n.add(e.name),s++)}),e.forEach(e=>r.at(-1)?.members.push({definition:e,scope:l(),isRechecked:!0}))},h=e=>{let t=/* @__PURE__ */ new Map;e.forEach(e=>{if(e.kind!==`Definition`||!e.definition.isRecursive)return;let n=t.get(e.definition.name);n?n.push(e.definition):t.set(e.definition.name,[e.definition])}),e.forEach(e=>{e.kind===`Recursive`?m(e.declarations.flatMap(e=>t.get(e.name)??[]),e.location):(s!==0||n)&&(e.kind===`Assumption`?f(e.assumption.expression):e.kind===`Theorem`&&e.theorem.statement.kind!==`AssumeProve`?f(e.theorem.statement):e.kind===`Definition`&&p(e.definition))})};return Array.isArray(t)?h(t):f(t),r},sh=e=>[...(e.recursive??[]).map(e=>({location:e.location,unit:{kind:`Recursive`,declarations:[e],location:e.location}})),...e.definitions.map(e=>({location:e.location,unit:{kind:`Definition`,definition:e}}))].toSorted((e,t)=>Nd(e.location,t.location)?-1:1).map(e=>e.unit),ch=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),lh=e=>e.includes(2)&&e.includes(3),uh=e=>Hu.get(e)??e.location.range,dh=e=>e.kind!==`Let`&&e.kind!==`Label`,fh=e=>{let t=/* @__PURE__ */ new Map,n=/* @__PURE__ */ new Map,r=[],i=[],a=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:r.level,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:S(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){let n=S(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=vm.get(t)??im.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},o=(e,t,n)=>{let r=fm(Math.max(t,...n.map(e=>e.data.level)));return r.isCorrect=n.every(e=>e.data.isCorrect),r.params.add(e),n.forEach((t,n)=>{t.data.params.forEach(t=>{r.params.add(t),r.argParams.add(lm(e,n,t))}),mm(r.argConstraints,cm(e,n),t.data.level),hm(r,t.data)}),r},s=(e,t,n=[],r=[])=>{let a=e=>r.includes(e),o=t.flatMap((t,n)=>t.kind===`Value`&&t.data.level>gm(e,n)?[{operand:t,index:n}]:[]);o.filter(t=>e.isCorrect&&t.operand.data.isCorrect).forEach(t=>i.push(`Level error in applying operator ${$s(e.name)}:\nThe level of argument ${t.index+1} exceeds the maximum level allowed by the operator`));let s=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},c=(t,n,r)=>e.conditions.has(dm(t,n,r)),l=fm(Math.max(e.level,...t.filter((t,n)=>_m(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return l.isCorrect=o.length===0&&t.every(e=>e.data.isCorrect)&&n.every(e=>e.isCorrect),e.params.forEach(e=>l.params.add(e)),t.forEach((t,n)=>{_m(e,n)===1&&t.data.params.forEach(e=>l.params.add(e))}),n.forEach(e=>e.params.forEach(e=>l.params.add(e))),r.forEach(e=>l.params.delete(e)),e.constraints.forEach((e,t)=>pm(l.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||pm(l.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>pm(l.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{a(t)||pm(l.constraints,t,gm(e,n))})),t.forEach((e,n)=>{if(e.kind!==`Operator`)return;let r=e.data;t.forEach((e,t)=>r.formals.forEach((i,a)=>{c(n,t,a)&&e.data.params.forEach(e=>pm(l.constraints,e,gm(r,a)))}))}),e.argParams.forEach(e=>{let t=um(e),n=s(t.operator);n?.kind===`Operator`&&pm(l.constraints,t.param,gm(n.data,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>mm(l.argConstraints,t,e))),t.forEach((n,r)=>{if(n.kind!==`Declared`)return;let i=n.declared;Array.from({length:i.arity},(t,n)=>mm(l.argConstraints,cm(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{c(r,t,a)&&mm(l.argConstraints,cm(i.name,a),e.data.level)}))}),e.argParams.forEach(e=>{let t=um(e),n=s(t.operator);n&&mm(l.argConstraints,cm(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{a(um(e).param)||l.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>l.argParams.add(e))),e.argParams.forEach(e=>{let t=um(e),n=s(t.operator);if(n)n.kind===`Declared`&&l.argParams.add(lm(n.declared.name,t.index,t.param));else{let n=s(t.param);if(!n){l.argParams.add(e);return}n.data.params.forEach(e=>l.argParams.add(lm(t.operator,t.index,e)))}}),t.forEach((e,n)=>{if(e.kind!==`Declared`)return;let r=e.declared;t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{c(n,t,a)&&e.data.params.forEach(e=>l.argParams.add(lm(r.name,a,e)))}))}),l},c=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Operator`,data:x(`LAMBDA`,th(e.params),e.body,t)};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(n!==void 0){let r=a(n,t);if(r.kind===`Defined`&&(r.levels.formals.length>0||e.kind===`OperatorReference`))return{kind:`Operator`,data:r.levels};if(r.kind===`Declared`&&r.arity>0){let e=fm();return e.params.add(n),{kind:`Declared`,data:e,declared:{name:n,arity:r.arity}}}if(e.kind===`OperatorReference`)return{kind:`Value`,data:fm()}}return{kind:`Value`,data:y(e,t)}},l=(e,t)=>e.map(e=>c(e,t)),u=(e,t,n,r=[],a=Jd(r))=>{let o=l(t,eh(n,th(a))),c=r.map(e=>y(e.set,n)),u=s(e,o,c,a);return c.forEach((t,n)=>{if(t.level<=2||(u.isCorrect=!1,!t.isCorrect))return;let a=r[n].pattern,o=a.ranges?.[0];i.push(`Level error in applying operator ${e.name}:\nThe level of the range for the bounded variable ${o?m(o):qd(a)[0]} \nexceeds the maximum level allowed by the operator`)}),u},d=(e,t)=>e.kind===`Declared`?o(e.name,e.level,t):s(e.levels,t),f=(e,t)=>{lh(e)&&i.push(`${t} has both temporal formula and action as arguments`)},p=(e,t)=>{(e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2)&&i.push(`Action used where only temporal formula or state predicate allowed`),ch.has(e.operator)&&f(t.map(e=>e.data.level),$s(e.operator))},h=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;t===2&&dh(n)&&n.kind!==r&&i.push(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`)},g=(e,t)=>{let n=ih(e,t);e.recursive&&oh(t,e).forEach(e=>ne(e.members));let r=e.definitions.map(e=>S(e,n)),i=y(e.body,n),a={level:i.level,isCorrect:i.isCorrect&&r.every(e=>e.isCorrect),params:new Set(i.params),constraints:new Map(i.constraints),argConstraints:new Map(i.argConstraints),argParams:new Set(i.argParams)};return r.forEach(e=>hm(a,e)),a},_=(e,t,n)=>i.length===e?n:(t&&i.splice(e).forEach(e=>r.push({location:m(t),message:`${e}.`})),{...n,isCorrect:!1}),v=(e,t)=>{let n=i.length;return _(n,e,t())},y=(e,t)=>{let n=i.length;return _(n,e.location.range,ee(e,t))},ee=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return fm();case`Identifier`:return d(a(e.name,t),[]);case`Apply`:{let n=l(e.args,t);return p(e,n),d(a(e.operator,t),n)}case`OperatorReference`:case`Lambda`:return c(e,t).data;case`And`:case`Or`:{let n=e.kind===`And`;if(e.isBulleted){let r=l(e.operands,t);return f(r.map(e=>e.data.level),`${n?`Conjunction`:`Disjunction`} list`),s(n?wm:Tm,r)}let i=n?`\\land`:`\\lor`,a=uh(e.operands[0]),o=[],u=0,d=!1;e.operands.forEach((n,s)=>{let l=c(n,t);o.push(l);let p=[u,l.data.level];if(u=Math.max(u,l.data.level),s===0)return;let h=uh(n);s===e.operands.length-1||!a||!h?f(p,i):lh(p)&&(r.push({location:m({...a,end:h.end}),message:`${i} has both temporal formula and action as arguments.`}),d=!0)});let p=s(n?wm:Tm,o);return d?{...p,isCorrect:!1}:p}case`Prime`:return u(ym,[e.expression],t);case`Unchanged`:return u(bm,[e.expression],t);case`Enabled`:return u(xm,[e.expression],t);case`Always`:case`Eventually`:{let n=c(e.expression,t);return h(e,n.data.level),s(e.kind===`Always`?Sm:Cm,[n])}case`If`:return u(Em,[e.condition,e.consequent,e.alternative],t);case`Case`:return u(Dm,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return g(e,t);case`Forall`:case`Exists`:{let n=u(e.kind===`Forall`?Om:km,[e.body],t,e.bounds),i=n.level===3?e.bounds.find(e=>y(e.set,t).level===2):void 0,a=i?.set.location.range;return a&&r.push({location:m(a),message:`Action-level bound of quantified temporal formula.`}),i?{...n,isCorrect:!1}:n}case`UnboundedQuantifier`:return u(e.isTemporal?e.quantifier===`Forall`?Mm:Nm:e.quantifier===`Forall`?Am:jm,[e.body],t,[],e.names);case`Choose`:return u(e.set?Pm:Fm,[e.body],t,e.set?[{pattern:e.pattern,set:e.set}]:[],qd(e.pattern));case`SetEnumeration`:return u(Im,e.elements,t);case`Tuple`:return u(Lm,e.elements,t);case`FunctionSet`:return u(Rm,[e.domain,e.range],t);case`Product`:return u(zm,e.factors,t);case`SetFilter`:return u(Bm,[e.predicate],t,[e.bound]);case`SetMap`:return u(Vm,[e.expression],t,e.bounds);case`FunctionConstruction`:return u(Hm,[e.body],t,e.bounds);case`Record`:return u(Um,e.fields.map(e=>e.value),t);case`RecordSet`:return u(Wm,e.fields.map(e=>e.value),t);case`Except`:return s(Gm,[c(e.function,t),...e.updates.map(e=>({kind:`Value`,data:s(Km,[{kind:`Value`,data:v(e.range,()=>s(qm,e.path.map(e=>e.kind===`Field`?{kind:`Value`,data:fm()}:e.args.length===1?c(e.args[0],t):{kind:`Value`,data:v(e.tupleRange,()=>u(Lm,e.args,t))})))},c(e.value,t)])}))]);case`FunctionApplication`:return s(Jm,[c(e.function,t),e.args.length===1?c(e.args[0],t):{kind:`Value`,data:u(Lm,e.args,t)}]);case`Bracket`:return fm();case`FieldAccess`:return s(Ym,[c(e.record,t),{kind:`Value`,data:fm()}]);case`BoxAction`:case`AngleAction`:return u(e.kind===`BoxAction`?Xm:Zm,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return u(e.kind===`WeakFairness`?Qm:$m,[e.subscript,e.action],t);case`Label`:return y(e.body,t);case`Selection`:{let r=e.expression,i=n.get(r);if(i)return i;let a=y(r,t);return n.set(r,a),a}case`Subexpression`:return fm()}},b=(e,t,n=!1,r=/* @__PURE__ */ new Set)=>{let i=(e,i=n,a=t)=>b(e,a,i,r),o=(e,o)=>{let s=a(e,t);s.kind===`Declared`?(n&&r.add(e),o.forEach(e=>i(e))):o.forEach((e,t)=>i(e,n||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),r;case`Apply`:return o(e.operator,e.args),r;case`Lambda`:case`Let`:case`Selection`:return r;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return mt(e).forEach(e=>i(e,!0)),r;case`UnboundedQuantifier`:return i(e.body,n||e.isTemporal===!0,eh(t,th(e.names))),r;default:return Op(e,(e,r)=>i(e,n,eh(t,th(r)))),r}},x=(e,t,n,r)=>{let i=eh(r,t),a=y(n,i),o=e=>t.some(t=>t.name===e),s=b(n.kind===`Selection`?n.expression:n,i),c={...fm(a.level),isCorrect:a.isCorrect,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(cm(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(lm(e.name,n,t.name))).map(e=>dm(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(um(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=um(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},te=/* @__PURE__ */ new Set,S=(e,n)=>{let r=t.get(e);if(r&&!te.delete(e))return r;let i=r??ah(e,3,0);t.set(e,i);let a=x(e.name,nh(e),rh(e),n),o={...a,level:Math.max(i.level,a.level),params:/* @__PURE__ */ new Set([...i.params,...a.params]),argParams:/* @__PURE__ */ new Set([...i.argParams,...a.argParams]),maxLevels:a.maxLevels.map((e,t)=>Math.min(e,i.maxLevels[t])),weights:a.weights.map((e,t)=>Math.max(e,i.weights[t])),nonLeibniz:/* @__PURE__ */ new Set([...i.nonLeibniz,...a.nonLeibniz])};return t.set(e,o),o},C=e=>e.forEach(e=>{let t=e.definition.location.range;e.definition.isRecursive&&t&&S(e.definition,e.scope).maxLevels.forEach((n,i)=>{n>=2||r.push({location:m(t),message:`Argument ${i+1} of recursive operator ${$s(e.definition.name)} is primed`})})}),ne=e=>{if(e.length===0||t.has(e[0].definition))return;let n=e.filter(e=>e.definition.isRecursive);n.forEach(e=>t.set(e.definition,ah(e.definition,2,1)));let r=e=>(e.definition.isRecursive&&te.add(e.definition),S(e.definition,e.scope));e.forEach(e=>{r(e),C([e])});let i=n.map(e=>S(e.definition,e.scope)),a=Math.max(0,...i.map(e=>e.level)),o=i.flatMap(e=>[...e.params]);e.forEach(e=>{let n=S(e.definition,e.scope);t.set(e.definition,{...n,level:Math.max(n.level,a),params:/* @__PURE__ */ new Set([...n.params,...o])}),e.isRechecked&&!e.definition.isRecursive&&te.add(e.definition)}),e.forEach(r)};return{analyze:y,analyzeDefinition:S,checkPrimedArguments:C,checkRecursiveSection:ne,toOperand:c,errors:r}},ph=(e,t,n)=>{let r=new Map(t),i=e.assumptions.flatMap(e=>{if(e.kind===`NewSymbol`){let t=e.set&&n.analyze(e.set,r),i=e.location.range;return t?.level===3&&i&&n.errors.push({location:m(i),message:`Level error:
|
|
403
|
-
Temporal formula used as set.`}),r.set(e.name,{kind:`Formal`,arity:e.arity,level:sm[e.level]}),t?[t]:[]}return[e.kind===`AssumeProve`?ph(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=fm(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),hm(a,e)}),a},mh=(e,t,n,r)=>{let i=fh(t),a=(e,t)=>Math.max(0,...e.map(e=>i.analyze(e,t).level)),o=(e,t)=>{let n=e.body;return n.kind===`Have`||n.kind===`Case`?a([n.expression],t):n.kind===`Witness`?a(n.expressions,t):n.kind===`Take`?a(n.bounds.map(e=>e.set),t):n.kind===`Pick`?a([n.body,...n.bounds.map(e=>e.set)],t):n.kind===`Assert`?n.statement.kind===`AssumeProve`?ph(n.statement,t,i).level:a([n.statement],t):0},s=(e,t)=>e.forEach(e=>{e.kind!==`ModuleFact`&&i.analyze(e,t)}),c=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=m(e.statement),n=()=>o(e,/* @__PURE__ */ new Map)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?n()?[]:[{location:t,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...n()?[]:[{location:t,message:`Non-constant CASE for temporal goal.`}],...c(e.proof)]:e.body.kind===`Qed`?c(e.proof):[]}):[],l=(e,t)=>{if(e?.kind===`By`)return s(e.facts,t),i.errors.splice(0);if(e?.kind!==`Steps`)return[];let n=new Map(t);return e.steps.flatMap(e=>{let t=e.body;(t.kind===`Use`||t.kind===`Hide`)&&s(t.facts,n),t.kind===`Define`&&t.definitions.forEach(e=>{e.kind!==`Instance`&&(n.set(e.name,{kind:`Let`,definition:e,scope:n}),i.analyzeDefinition(e,n))});let r=o(e,n)===3,u=t.kind===`Pick`&&t.bounds.length>0&&r?t.bounds.filter(e=>a([e.set],n)!==0).flatMap(e=>e.set.location.range?[{location:m(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...i.errors.splice(0),...l(e.proof,n),...u,...e.proof?.kind===`Steps`&&r?c(e.proof):[]]})},u=/* @__PURE__ */ new Map,d=e=>{let t=u.get(e);if(t!==void 0)return t;let n=e.kind===`AssumeProve`?ph(e,/* @__PURE__ */ new Map,i).level:i.analyze(e,/* @__PURE__ */ new Map).level;return u.set(e,n),n},f=[...e.theorems,...e.assumptions.map(e=>({...e,statement:e.expression}))],p=new Set(f.map(e=>e.statement)),h=oh(/* @__PURE__ */ new Map,e.units,e.hasRecursiveLet),g=(e,t)=>({location:e,check:e=>{t(),e.push(...i.errors.splice(0))}});return{sections:h.map(e=>g(e.location,()=>i.checkRecursiveSection(e.members))),check:t=>[(t?h:[]).map(e=>g(e.location,()=>i.checkPrimedArguments(e.members))),e.definitions.filter(e=>!e.name.includes(`!`)&&!p.has(e.body)).map(e=>g(e.location,()=>i.analyzeDefinition(e,/* @__PURE__ */ new Map))),f.filter(e=>e.name!==void 0).map(e=>g(e.location,()=>d(e.statement))),[...e.assumptions.map(e=>({location:e.location,check:t=>{let n=d(e.expression);t.push(...i.errors.splice(0));let r=e.location.range;n!==0&&r&&t.push({location:m(r),message:`Level error: assumptions must be level 0 (Constant), \nbut this one has level ${n}.`})}})),...e.theorems.map(e=>({location:e.location,check:t=>{let n=d(e.statement);t.push(...i.errors.splice(0),...l(e.proof,/* @__PURE__ */ new Map),...n===3?c(e.proof):[],...i.errors.splice(0))}})),...e.uses.map(e=>g(e.location,()=>s(e.facts,/* @__PURE__ */ new Map))),...n]].flatMap(e=>pp(e,r))}},hh=1024,gh=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),_h=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),vh=/* @__PURE__ */ new Set([...gh,..._h,`Enabled`]),yh=/* @__PURE__ */ new Set([`~>`,`-+->`]),bh=/* @__PURE__ */ new Set([...yh,`\\cdot`]),xh=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Sh=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),Ch=/* @__PURE__ */ new Set([`RandomSubset`,`RandomSetOfSubsets`,`TestRandomSetOfSubsets`,`RandomSubsetSet`]),wh=(e,t)=>xh.has(e)||t.builtins.get(e)?.isStateLevel===!0,Th=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(gh.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(_h.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&yh.has(e.operator))return 224},o=/* @__PURE__ */ new Map,s=(e,n,c)=>{let l=e.kind;if(l===`Selection`){let t=o.get(e.expression)??0,r=n?c?1:2:c?4:8;if((t&r)!==0)return;o.set(e.expression,t|r)}let u=c?1:513;(vh.has(l)||l===`UnboundedQuantifier`&&e.isTemporal===!0||l===`Apply`&&bh.has(e.operator))&&(r[0]|=u),vh.has(l)&&(r[0]|=16);let d=a(e);n&&d!==void 0&&(r[0]|=d);let f=n&&d===void 0,p=ht(e);if(p!==void 0&&M(e)&&t.variableIndex.has(p)&&(c||(r[0]|=512),f&&(r[0]|=32)),p!==void 0&&!M(e)){let e=t.substitutions.get(p)??p,n=t.definitions.get(e),a=t.constants.has(p),o=t.variableIndex.get(p);if((o!==void 0||t.builtins.get(e)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=u),o!==void 0&&(f&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:f,isOperatorArgument:c||l===`OperatorReference`||l===`Identifier`&&n.kind===`Operator`&&n.params.length>0});else{wh(e,t)&&(r[0]|=2|(e===`Assert`?0:4)),Sh.has(e)&&(r[0]|=8),Ch.has(e)&&(r[0]|=256),e===`TLCEval`&&(r[0]|=hh),!a&&wh(e,t)&&(r[0]|=16);let n=t.builtins.get(e);f&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}mt(e).forEach(e=>s(e,f,c||l===`Lambda`))};return e.forEach(e=>s(e,!0,!1)),{row:r,edges:i}},Eh=(e,t,n,r)=>{let i=n.length,a=e.slice(),o=new Int32Array(i).fill(-1),s=new Int32Array(i),c=new Int32Array(i).fill(-1),l=[],u=[],d=0,f=0,p=(e,n)=>{for(let i=0;i<t;i++){let o=a[n*t+i];a[e*t+i]|=i===0?o&r:o}},m=e=>{u.push(e,0),o[e]=s[e]=d++,l.push(e)};for(let e=0;e<i;e++)if(o[e]===-1)for(m(e);u.length>0;){let e=u[u.length-2],t=u[u.length-1],r=n[e];if(t<r.length){u[u.length-1]=t+1;let n=r[t];o[n]===-1?m(n):c[n]===-1&&(s[e]=Math.min(s[e],o[n]));continue}if(u.length-=2,u.length>0){let t=u[u.length-2];s[t]=Math.min(s[t],s[e])}if(s[e]!==o[e])continue;let i=[];for(;;){let t=l.pop()??e;if(c[t]=f,i.push(t),t===e)break}f++;let a=i[0];i.forEach(e=>{e!==a&&p(a,e),n[e].forEach(e=>{c[e]!==c[a]&&p(a,e)})}),i.forEach(e=>{e!==a&&p(e,a)})}return a},Dh=1294,Oh=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&513),kh=e=>{let t=[...new Set(e.definitions.values())],n=new Map(t.map((e,t)=>[e,t])),r=1+(e.variables.length+31>>>5),i=new Uint32Array(t.length*r),a=new Uint32Array(t.length*r),o=t.map((t,n)=>{let o=Th(pt(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&Dh,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=Eh(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=Eh(i,r,u,224),f=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&!e.isOperatorArgument).map(s))),p=Eh(i,r,f,512),m=o.map(e=>new Int32Array(e.map(s).filter(e=>!Oh(t[e],l[e*r]|p[e*r])))),h=Eh(a,r,m,Dh);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|p[t]&512|d[t]&224|h[t]&Dh:e),words:r}},Ah=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?jh(pt(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},jh=(e,t)=>{let n=t.facts.words,r=Th(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=Ah(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isOperatorArgument||(i[0]|=r[0]&512),e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}Oh(e.callee,r[0])||(i[0]|=r[0]&Dh)}),i},Mh=(e,t)=>!(Ah(e,t)[0]&513),Nh=(e,t)=>!(Ah(e,t)[0]&512),Ph={any:2,repeated:4,streamed:8,replayed:260,varying:258},Fh=(e,t,n)=>(jh(e,t)[0]&Ph[n])!==0,Ih=(e,t,n=`any`)=>(Ah(e,t)[0]&Ph[n])!==0,Lh=(e,t)=>!!(jh([e],t)[0]&hh),Rh=(e,t)=>{let n=Ah(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},zh=e=>{let t=[];for(let n=1;n<e.length;n++)for(let r=e[n];r!==0;r&=r-1)t.push((n-1<<5)+(31-Math.clz32(r&-r)));return t},Bh=(e,t)=>{let n=jh([e],t);return n[0]&16?void 0:zh(n)},Vh=(e,t)=>!!(jh([e],t)[0]&1),Hh=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`,`Choose`,`SetFilter`,`FunctionConstruction`]),Uh=()=>({implication:ix,negate:ax,equivalent:ox,body:sx,condition:(e,t)=>{if(typeof e!=`boolean`)throw Vb(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw Hb(t,n,e);return e},apply:ma,expectFunction:ex,tuple:pi,set:Zr,record:hi,writtenRecord:Cn,equal:vr,enumerate:mx,choiceElements:qS,noChoice:e=>{throw JS(e)},filterPredicate:KS,isReducible:fn,finiteElements:e=>F(e).elements,addBounded:cn,normalizedSet:or,isBeyondBound:ln,cardinality:zi,functionDomain:di,sortedFunction:sr,unassigned:(e,t)=>{throw Yb(e,t)},prime:fS,keepLazyContext:tx,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>Qb(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})});let Wh,Gh;const Kh=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},qh=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Jh=e=>`local${e.counter++}`,Yh=(e,t=/* @__PURE__ */ new Set)=>{let n=ht(e);return n!==void 0&&t.add(n),e.kind!==`Selection`&&mt(e).forEach(e=>Yh(e,t)),t},Xh=(e,t,n)=>{if(n.locals.size===0)return n.context;let r=Lh(t,e.environment),i=Yh(t),a=[...n.locals].filter(e=>r||i.has(e[0]));if(a.length===0)return n.context;let o=qh(e,a.map(e=>e[0]));return`extend(${n.context}, ${o}, [${a.map(e=>e[1]).join(`, `)}])`},Zh=(e,t,n)=>`${qh(e,xS(t,e.environment))}(${Xh(e,t,n)})`,Qh=(e,t,n)=>{let r=`helper${e.counter++}`,i=[...t.locals.values()],a={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(t.locals)},o=i.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${r}(context, state, next${o}) { let primed; let applied; ${n(a)} }`),`${r}(${t.context}, ${t.state}, ${t.isPrimed?`undefined`:t.next}${o})`},$h=(e,t,n,r)=>{let i=Jh(e),a=Jh(e),o=Jh(e);return`for (let ${i} = 0, ${a} = ${t}.low, ${o} = ${a} === undefined ? ${t}.length : ${t}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${t}[${i}] : ${a} + ${i}; ${r} }`},eg=(e,t,n)=>{let r=t.kind===`Forall`;return Qh(e,n,n=>{let i=t.bounds.map(()=>Jh(e)),a=t.bounds.map((r,a)=>a>0&&t.bounds[a-1].set===r.set?`const ${i[a]} = ${i[a-1]};`:`const ${i[a]} = enumerate(${sg(e,r.set,n)}, ${qh(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=Jh(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${sg(e,t.body,n)}, ${qh(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>$h(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},tg=(e,t,n,r,i)=>Qh(e,i,i=>{let a=Jh(e),o=Jh(e),s=qh(e,t),c=`choiceElements(${sg(e,n,i)}, ${s}, ${qh(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${sg(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${$h(e,a,o,l)} return noChoice(${s});`}),ng=(e,t,n,r)=>Qh(e,r,r=>{let i=Jh(e),a=Jh(e),o=Jh(e),s=Jh(e),c=qh(e,t),l=`if (!isReducible(${i})) return ${qh(e,US(t,e.environment))}(${i}, ${Xh(e,t,r)});`,u=sg(e,t.bound.set,r);r.locals.set(n,s);let d=GS(t,e.environment)?` else break;`:``,f=`if (filterPredicate(${sg(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});${d}`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${$h(e,a,s,f)} return normalizedSet(${o});`}),rg=(e,t,n,r)=>Qh(e,r,r=>{let i=Jh(e),a=Jh(e),o=Jh(e),s=Jh(e),c=Jh(e),l=Jh(e),u=qh(e,BS(t,e.environment)),d=Xh(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=sg(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${sg(e,t.body,r)}; if (!${a}) ${s}.push(${l});`;return`const ${i} = ${p}; ${f} const ${a} = isBeyondBound(${i}); const ${o} = ${a} ? ${i} : functionDomain(${i}); if (${a}) cardinality(${i}); const ${s} = []; ${$h(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),ig=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=sg(e,r[0],n),a=sg(e,r[1],n),o=qh(e,t);return`(implication(${i}, ${o}, "P") ? implication(${a}, ${o}, "Q") : true)`}if(t.operator===`~`&&r.length===1)return`negate(${sg(e,r[0],n)}, ${qh(e,t)})`;if(t.operator===`<=>`)return`equivalent(${sg(e,r[0],n)}, ${sg(e,r[1],n)}, ${qh(e,t)})`;if(M(t))return Zh(e,t,n);let i=Ux(t.operator,e.environment);if(i?.kind!==`Builtin`)return Zh(e,t,n);if(i.name===`DOMAIN`)return`${qh(e,Gb(t))}(${sg(e,r[0],n)})`;if(i.name===`\\subseteq`&&i.evaluateBinary&&r.length===2)return`${qh(e,Kb(t,i.evaluateBinary))}(${sg(e,r[0],n)}, ${sg(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&wS(r[0],a))return`${qh(e,i.evaluateUnary)}(${sg(e,r[0],n)})`;let o=r.length===2&&wS(r[0],a)&&wS(r[1],a);return i.evaluateBinary&&o?`${qh(e,i.evaluateBinary)}(${sg(e,r[0],n)}, ${sg(e,r[1],n)})`:Zh(e,t,n)},ag=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(M(e))return!1;let r=eS(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return ag(e.expression,t,n);case`FieldAccess`:return ag(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>ag(e,t,n));default:return!1}},og=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return og(e.record);case`FunctionApplication`:return[e.function,...e.args].every(og);default:return!1}},sg=(e,t,n)=>{let r=(t,r=n)=>sg(e,t,r);switch(t.kind){case`Number`:return _n(t.value)?String(t.value):Zh(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(M(t))return Zh(e,t,n);let i=eS(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=qh(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?qh(e,i.value):Zh(e,t,n)}case`Apply`:return ig(e,t,n);case`And`:case`Or`:{if(t.operands.length===0)return String(t.kind===`And`);let n=qh(e,t),i=t.kind===`And`?` && `:` || `;return`(${t.operands.map((e,t)=>`junct(${r(e)}, ${n}, ${t})`).join(i)})`}case`If`:return`(condition(${r(t.condition)}, ${qh(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{FS(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${ag(t.function,n,e.environment)?r(t.function):og(t.function)?r(t.function,i):Zh(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${qh(e,t)}))`,o=Wb(e.environment.runtime.version),s=o?`, ${qh(e,o)}`:``;return t.args.length===1?`apply(${a}, ${r(t.args[0])}${s})`:`apply(${a}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${s})`}case`FieldAccess`:return`${qh(e,Ub(t))}(${r(t.record)})`;case`Record`:{let i=XS(t.fields);if(ZS(i))return Zh(e,t,n);let a=qh(e,i.map(e=>e.name)),o=`[${t.fields.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${qh(e,i.map(e=>t.fields.indexOf(e)))}, ${o}, ${qh(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:return n.isPrimed?Zh(e,t,n):r(t.expression,{context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals});case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?eg(e,t,n):Zh(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?tg(e,t,t.set,t.pattern.name,n):Zh(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!zS(t)?rg(e,t,r.pattern.name,n):Zh(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?ng(e,t,t.bound.pattern.name,n):Zh(e,t,n);default:return Zh(e,t,n)}},cg=(e,t)=>{if(!Hh.has(e.kind)||(Gh??=Kh(),!Gh))return;let n={environment:t,references:[],helpers:[],counter:0},r=sg(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
|
|
404
|
-
|
|
405
|
-
|
|
341
|
+
`},ei=(e,t,n,r=`Proof.Parser`)=>new s(e,void 0,{reason:`${e}${n.set}`,line:t.start.line,column:t.start.column,isEnd:!1,proof:{stop:t.stop,exception:r,printed:`${e}${n.printed}`}}),ti=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),ni=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),ri=/* @__PURE__ */ new Set([`NEW`,...ni.keys()]),ii=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),ai=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),oi=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),si=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?Dr.has(e.operator):Nr.has(e.operator)),ci=e=>(e.text===`/\\`||e.text===`\\/`)&&e.spelling!==`\\land`&&e.spelling!==`\\lor`,li=e=>Dr.has(e)||Nr.has(e)||e===`-.`,ui=(e,t,n)=>{switch(e){case`ENABLED`:return{kind:`Enabled`,expression:t,location:n};case`UNCHANGED`:return{kind:`Unchanged`,expression:t,location:n};case`[]`:return{kind:`Always`,expression:t,location:n};case`<>`:return{kind:`Eventually`,expression:t,location:n};case`'`:return{kind:`Prime`,expression:t,location:n};default:return{kind:`Apply`,operator:e,args:[t],location:n}}},di=/* @__PURE__ */ new WeakMap,fi=/* @__PURE__ */ new WeakMap,pi=e=>{if(di.has(e))return;let t=e.kind===`UnboundedQuantifier`?{name:e.names[0],range:e.nameRanges?.[0]}:e.kind===`Choose`&&e.pattern.kind===`Name`?{name:e.pattern.name,range:e.pattern.ranges?.[0]}:e.kind===`SetFilter`&&e.bound.pattern.kind===`Name`?{name:e.bound.pattern.name,range:e.bound.pattern.ranges?.[0]}:void 0,n=t?.range;return t&&n?{kind:`Identifier`,name:t.name,location:{...n.start,range:n}}:void 0},mi=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.replace(/\r?\n$/,``).split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
|
|
342
|
+
`)}\n`},hi=(e,t,n=tt(e,t===`tlapm`))=>{let r=t===`tlapm`,i=r?n:n.map(Xe),a=0,o=[],c,l,u=[],d=[],f,p=0,m=[],h=/* @__PURE__ */ new WeakMap,g=e=>u[u.length-1].has(e),_=e=>({line:e.line,column:r&&e.kind===`String`?e.endColumn:e.column,range:void 0}),v=[],y=[],ee=[],b=(e,t=a-1)=>{let n=e===t?ee[e]:void 0;if(n)return n;let r=i[t];v[e]??=_(i[e]),y[t]??={line:r.line,column:r.endColumn};let o={module:d[0].name,start:v[e],end:y[t]};return e===t&&(ee[e]=o),o},x=(e,t)=>(e.location.range=b(t),e),te=(e=0)=>i[Math.min(a+e,i.length-1)],S=(e=0)=>{let t=te(e),n=o[o.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},C=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),ne=e=>r&&(e.kind===`Keyword`||oi.has(e.text)),w=e=>{let t=i.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},re=e=>e.kind===`End`?`EOF`:/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:Gr.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:ne(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,T=(e,t=te(),n)=>{let r=i[i.length-1],a=t.line===r.line&&t.column===r.column,o=new s(`${e} at line ${t.line}, column ${t.column}`,void 0,ie(e,t,a,n));return f!==void 0&&h.set(o,f),o},ie=(e,t,n,a)=>{if(!r)return{reason:e,line:t.line,column:t.column,isEnd:n};let o=i[m[0]-1],s=a?`Unexpected ${re(a)}`:e;if(o)return{reason:s,line:o.line,column:o.endColumn+1,isEnd:n};let c=a?w(a):t;return{reason:s,line:c.line,column:c.column,isEnd:n}},ae=(e,t=te())=>T(e,t,t),oe=e=>{let t={cursor:a,frame:f,restorePoints:m.length,offsideColumns:o.length,recursiveScopes:u.length},n=++p;f=n;try{let n=e();return f=t.frame,n}catch(e){if(!(e instanceof s)||h.get(e)!==n)throw e;a=t.cursor,f=t.frame,m.length=t.restorePoints,o.length=t.offsideColumns,u.length=t.recursiveScopes;return}},se=e=>{let t=f;f=void 0;let n=e();return f=t,n},E=e=>{m.push(a);let t=e();return m.pop(),t},ce=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ne(e),D=(e,t=0)=>{let n=S(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},O=()=>{let e=S();if(e.kind===`End`)throw ae(`Unexpected end of expression`);return a++,e},k=e=>D(e)?(a++,!0):!1,A=e=>{if(!D(e))throw ae(`Expected ${JSON.stringify(e)} but found ${C(S())}`);return O()},le=()=>{let e=S();if(e.kind!==`Identifier`)throw ae(`Expected an identifier but found ${C(e)}`);if(ne(e))throw ae(`Unexpected keyword ${e.text}`);return a++,e.text},ue=()=>{let e=a;return{name:le(),range:b(e)}},de=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),fe=()=>{let e=S();return e.kind!==`String`&&(Ir.has(e.text)||Dr.has(e.text)||Pr.has(e.text))?(a++,e.text):le()},pe=!1,me=()=>S().kind===`Identifier`||!ce(S())?le():(pe=!0,O().text),he=e=>{if(!r)return e();o.push(-1);let t=e();return o.pop(),t},ge=(e,t=`,`)=>{let n=[e()];for(;k(t);)n.push(e());return n},_e=(e=0)=>{if(D(`<<`,e)){let t=e+1;for(;S(t).kind===`Identifier`||D(`,`,t);)t++;return D(`>>`,t)&&D(`\\in`,t+1)}let t=e;for(;S(t).kind===`Identifier`;){if(D(`\\in`,t+1))return!0;if(!D(`,`,t+1))return!1;t+=2}return!1},ve=()=>{if(D(`::`))return!0;if(!D(`(`))return!1;let e=1;for(;S(e).kind===`Identifier`&&D(`,`,e+1);)e+=2;return S(e).kind===`Identifier`&&D(`)`,e+1)&&D(`::`,e+2)},ye=()=>{if(!k(`<<`)){let e=ue();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=de(D(`>>`)?[]:ge(ue));return A(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},be=()=>{let e=()=>{let e=ge(ye);A(`\\in`);let t=se(j);return e.map(e=>({pattern:e,set:t}))},t=[e()];for(;D(`,`)&&(!r||_e(1));)O(),t.push(e());return t.flat()},xe=()=>{let e=S();if(r&&oi.has(e.text)){let t=a;O();let n={kind:`Identifier`,name:e.text,location:_(e)};return{subscript:x(n,t),lastArgs:[]}}let t=r&&(e.kind===`Number`||e.kind===`String`||D(`@`));if(e.kind===`Identifier`){let t=a,n=[],i=[],o=e=>(i.push(b(a,a)),n.push(le()),e&&D(`(`)?Ee():[]),s=[o(!r)];for(;D(`!`)&&S(1).kind===`Identifier`;)O(),s.push(o(!0));let c=s.slice(0,-1),l=_(e);l.range={...b(t),end:i[i.length-1].end};let u=n.join(`!`);return{subscript:c.every(e=>e.length===0)?{kind:`Identifier`,name:u,location:l}:{kind:`Apply`,operator:u,args:c.flat(),argumentCounts:[...c.map(e=>e.length),0],argumentsRange:l.range,selectorRanges:i,location:l},lastArgs:s[s.length-1]}}if(D(`<<`)||D(`(`)||D(`{`)||D(`[`)||t){let e=a,t=Re();return{subscript:t.location.range?t:x(t,e),lastArgs:[]}}throw ae(`Expected a subscript but found ${C(e)}`)},Se=e=>{let t=S(1),n=S(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&D(`==`,Pr.has(n.text)?3:4))},Ce=e=>{let t=S(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||D(`,`,1)||D(`)`,1)||t.kind===`Keyword`&&Vr.has(t.text)||Se(e)},we=()=>{let e=S(),t=e.kind===`Operator`&&(Dr.has(e.text)||Fr.has(e.text))&&Ce(e);if(r&&e.kind!==`String`&&(Fr.has(e.text)||zr.has(e.text)&&e.text!==`'`&&!Nr.has(e.text)||Rr.has(e.text)&&S(-1).text===`(`&&S(-1).line===e.line&&S(-1).endColumn+1===e.column&&S(1).text===`)`&&S(1).line===e.line&&S(1).column===e.endColumn+1)&&Ce(e))throw T(`incomplete expression`,e);if(t&&!r&&e.text===`\\X`&&e.spelling!==`×`)throw T(`\\X may not be used as an infix operator`,e);if(t)return a++,x({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:_(e)},a-1);if(e.kind!==`String`&&zr.has(e.text)&&Ce(e)){a++;let t=_(e);if(Nr.has(e.text))return x({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},a-1);let n={kind:`Identifier`,name:`argument`,location:t};return x({kind:`Lambda`,params:[n.name],body:ui(e.text,n,t),operator:e.text,location:_(e)},a-1)}if(D(`LAMBDA`)){let t=a;O();let n=de(ge(ue));A(`:`);let r=j();return x({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:_(e)},t)}if(!r)return j();let n=oe(j);if(n)return n;throw ae(`Unexpected ${C(S())}`)},Te,Ee=()=>he(()=>{let e=a;A(`(`);let t=ge(we);return A(`)`),Te=b(e),t}),De=()=>{let e=O();o.push(e.column);let t=[j()],n=()=>{for(;ci(te())&&te().text===e.text&&te().column===e.column;)a++,t.push(j())};return r?se(n):n(),o.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:_(e)}},Oe=e=>he(()=>{let t=_(e),n=S().kind===`Identifier`,i=D(`|->`,1)&&(n||ce(S()));if(i||n&&D(`:`,1)){let e=i?`Record`:`RecordSet`,r=e=>{let t=a,n=_(S()),r=e();return n.range=b(t),A(i?`|->`:`:`),{name:r,value:j(),location:n}},o=[r(()=>n?le():O().text),...k(`,`)?ge(()=>r(le)):[]];return A(`]`),{kind:e,fields:o,location:t}}if(_e()){let e=a,n=be();if(!r||D(`|->`)){A(`|->`);let e=j();return A(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}a=e}let o=j();if(k(`->`)){let e=j();return A(`]`),{kind:`FunctionSet`,domain:o,range:e,location:t}}if(k(`EXCEPT`)){let e=ge(()=>{let e=[a];A(`!`);let t=[];for(;D(`.`)||D(`[`);)if(e.push(a),k(`.`)){if(!ce(S()))throw ae(`Expected a field name but found ${C(S())}`);if(!r&&D(`@`))throw ae(`@ used in !.@`);t.push(O().text)}else A(`[`),t.push(ge(()=>j())),A(`]`);e.push(a,a+1),A(`=`);let n=j();e.push(a);let i=t=>b(e[t],e[t+1]-1);return{path:t.map((t,n)=>typeof t==`string`?{kind:`Field`,name:t}:{kind:`Index`,args:t,tupleRange:i(2*n+1<e.length-1?2*n+1:n+1)}),value:n,range:b(e[0])}});return A(`]`),{kind:`Except`,function:o,updates:e,location:t}}if(!r&&!D(`]_`)){let e=[o];for(;k(`,`);)e.push(j());return A(`]`),{kind:`Bracket`,args:e,location:t}}return A(`]_`),{kind:`BoxAction`,action:o,subscript:xe().subscript,location:t}}),ke=()=>{let e=a,t=x(Be(),e),n=_(O());return x({kind:`Apply`,operator:`\\in`,args:[t,se(j)],location:n},e)},Ae=e=>he(()=>{let t=_(e);if(k(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(_e()&&(S(1).text===`\\in`||D(`<<`))){let e=a,n=ye();A(`\\in`);let r=se(j);if(k(`:`)){let e=se(j);return A(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}a=e}let n=S().kind===`Identifier`&&D(`\\in`,1)?ke():j();if(k(`:`)){let e=be();return A(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;k(`,`);)r.push(j());return A(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),je=e=>{let t=_(e),n=he(()=>D(`>>`)||D(`>>_`)?[]:ge(()=>j()));if(k(`>>_`)){if(n.length!==1)throw T(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:se(xe).subscript,location:t}}return A(`>>`),{kind:`Tuple`,elements:n,location:t}},Me=e=>{let t=_(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&_e()){let e=be();return A(`:`),{kind:n,bounds:e,body:j(),location:t}}let i=de(ge(ue));return A(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:j(),isTemporal:r,location:t}},Ne=e=>{let t=[];do{let n=a;if(k(`OTHER`))return A(`->`),{kind:`Case`,arms:t,other:j(),otherRange:b(n),location:_(e)};let r=j();A(`->`),t.push({condition:r,body:j()})}while(k(`[]`));return{kind:`Case`,arms:t,other:void 0,location:_(e)}},Pe=()=>{let e=S(1);return D(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Br.has(e.text)||e.kind===`Operator`&&(Dr.has(e.text)||Pr.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&Ir.has(e.text))},Fe=()=>{let e=O();if(e.kind===`Number`)return{kind:`Operand`,operand:Le(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return a--,{kind:`Bound`,args:Ee()}}return{kind:`Name`,name:e.text,args:D(`(`)?Ee():[]}},Ie=(e,t,n,r,i)=>{let o=[{kind:`Name`,name:e,args:t}],s=[b(r,r)],c=[n];for(;Pe();){O();let e=a;Te=void 0;let t=Fe();s.push(t.kind===`Bound`?b(e):b(e,e)),o.push(t),c.push(Te)}let l=o.flatMap(e=>e.kind===`Name`?[e.name]:[]),u=l.join(`!`),d=o.flatMap(e=>`args`in e?e.args:[]),f=o.map(e=>`args`in e?e.args.length:0);return l.length<o.length?{kind:`Subexpression`,selectors:o,selectorRanges:s,argumentRanges:c,location:i}:d.length===0?{kind:`Identifier`,name:u,selectorRanges:s,location:i}:{kind:`Apply`,operator:u,args:d,...f.slice(0,-1).some(e=>e>0)&&{argumentCounts:f},argumentsRange:c.at(-1)??b(r),selectorRanges:s,argumentRanges:c,location:i}},Re=e=>{let n=a,i=O(),o=_(i);if(r&&i.kind===`Keyword`&&i.text===`LAMBDA`){let e=ge(le);return A(`:`),{kind:`Lambda`,params:e,body:j(),location:o}}if(i.kind===`Number`)return{kind:`Number`,value:Le(i.text),text:i.text,location:o};if(i.kind===`Decimal`)return{kind:`Decimal`,text:i.text,location:o};if(i.kind===`String`)return{kind:`String`,value:i.text,location:o};let s=i.kind===`Step`&&St(i);if(!r&&s&&yt()<0&&vt.length<=1)throw T(`Step number used outside proof`,i);if(s&&i.text[1]===`+`)throw T(`<+> step number used in an expression`,i);if(i.kind===`Identifier`||s){let t=s?Ct(i)??i.text:i.text;if(ve()){let a=de(k(`(`)?ge(ue):[]);a.names.length>0&&A(`)`),A(`::`);let s=b(n),l=j();if(!r&&e!==void 0&&c!==void 0&&si(l)&&e.high>=c.low)throw T(`Removing the label would change expression parsing`,i);return{kind:`Label`,name:t,params:a.names,paramRanges:a.ranges,head:s,body:l,location:o}}let a=D(`(`);if(t===`@`&&!a&&!Pe())return{kind:`ExceptAt`,location:o};let l=a?Ee():[];return Pe()?Ie(t,l,a?Te:void 0,n,o):a?{kind:`Apply`,operator:t,args:l,argumentsRange:Te,location:o}:{kind:`Identifier`,name:t,location:o}}let l=i.kind===`Operator`&&(li(i.text)||i.text===`'`&&!r);if(l&&D(`(`)){let e=Ee();return!r&&Pe()?Ie(i.text,e,Te,n,o):t===`tlc`&&i.text===`\\X`&&e.length===2?{kind:`Product`,factors:e,location:o}:i.text===`'`&&e.length===1?{kind:`Prime`,expression:e[0],location:o}:{kind:`Apply`,operator:i.text,spelling:i.spelling,args:e,argumentsRange:Te,location:o}}if(l&&!r)return Pe()?Ie(i.text,[],void 0,n,o):{kind:`Identifier`,name:i.text,spelling:i.spelling,location:o};switch(i.text){case`(`:{let e=he(()=>j());return A(`)`),di.set(e,b(n)),e}case`[`:return Oe(i);case`{`:return Ae(i);case`<<`:return je(i);case`@`:return{kind:`ExceptAt`,location:o};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Me(i);case`IF`:{let e=j();A(`THEN`);let t=j();return A(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:j(),location:o}}case`CASE`:return Ne(i);case`LET`:{let e=[],t=[],n=[];for(u.push(/* @__PURE__ */ new Set);!k(`IN`);){if(r&&D(`RECURSIVE`))throw ae(`Unexpected keyword RECURSIVE`);if(k(`RECURSIVE`)){n.push(...gt()),d[d.length-1].hasRecursiveLet=!0;continue}let i=lt(!r&&k(`LOCAL`));i.kind===`Instance`?t.push(i):e.push(i)}return u.pop(),{kind:`Let`,definitions:e,...t.length>0&&{instances:t},...n.length>0&&{recursive:n},body:j(),location:o}}case`CHOOSE`:{let e=ye(),t=k(`\\in`)?j():void 0;return A(`:`),{kind:`Choose`,pattern:e,set:t,body:j(),location:o}}case`WF_`:case`SF_`:{let e=xe(),t=!D(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:he(()=>{A(`(`);let e=j();return A(`)`),e});return{kind:i.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:o}}}throw ae(`Unexpected ${C(i)}`,i)},ze=(e,t,n)=>{c=l={low:t,high:n};let r=j(n+1),i=S(),a=Pr.has(i.text)?Tr.high:Dr.get(i.text)?.high;if(i.kind===`Operator`&&a!==void 0&&a>=t)throw T(`Precedence conflict between ${e.text} and ${i.text}`,i);return r},Be=()=>{let e=l;l=void 0;let t=S(),n=_(t);if(t.kind===`Operator`&&ci(t))return De();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return O(),{kind:`Apply`,operator:`~`,args:[ze(t,4,4)],location:n};case`-`:return O(),{kind:`Apply`,operator:`-.`,args:[ze(t,12,12)],location:n};case`[]`:case`<>`:case`ENABLED`:case`UNCHANGED`:return O(),ui(t.text,ze(t,4,15),n);case`SUBSET`:case`UNION`:case`DOMAIN`:return O(),{kind:`Apply`,operator:t.text,args:[ze(t,10,13)],location:n}}return Re(e)},Ve=(e,t,n,r,i)=>{let a=_(e);if(e.text===`/\\`||e.text===`\\/`){let o=e.text===`/\\`?`And`:`Or`;return t.kind===o&&r?{...t,operands:[...t.operands,n],prefixEnds:[...t.prefixEnds??[],i]}:{kind:o,operands:[t,n],prefixEnds:[i],location:a}}return e.text===`\\X`?t.kind===`Product`&&r?{...t,factors:[...t.factors,n]}:{kind:`Product`,factors:[t,n],location:a}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t,n],location:a}},He=(e,t)=>e.text===`'`?{kind:`Prime`,expression:t,location:_(e)}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t],location:_(e)},Ue=()=>{O();let e=he(()=>ge(()=>j()));return he(()=>A(`]`)),e},We=e=>{let t=a,n=Be(),r=n.location.range?n:x(n,t),i;for(;;){let n=S();if(n.kind!==`Operator`)break;let a=_(n);if(Pr.has(n.text)&&e<=15){O(),c=Tr,r=x(He(n,r),t);continue}if(n.text===`[`){let e=Ue();c=Er,r=x({kind:`FunctionApplication`,function:r,args:e,location:a},t);continue}if(n.text===`.`&&ce(S(1))){O();let e=O().text;r=x({kind:`FieldAccess`,record:r,field:e,location:a},t);continue}let o=Dr.get(n.text);if(!o||o.low<e)break;if(i){let e=!(i.low>o.high||i.high<o.low),t=i.text===n.text&&o.isAssociative;if(e&&!t&&(i.text!==`\\X`||n.text!==`\\X`))throw T(`Precedence conflict between ${i.text} and ${n.text}`,n)}if(O(),o.low>12&&D(`-`))throw T(`Precedence conflict between ${n.text} and -`,S());c=l=o;let s=j(o.high+1),u=i?.text===n.text;r=x(Ve(n,r,s,u,b(t).end),t),i={...o,text:n.text}}return r},Ge=e=>e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`||e.kind===`Identifier`||e.kind===`Step`&&St(e)&&/^<\d/.test(e.text)||(e.kind===`Operator`||e.kind===`Keyword`)&&jr.has(e.text),Ke=(e,t)=>({start:t,end:a-1,expression:e.location.range?e:x(e,t)}),qe=(e,t,n,r)=>({...n,start:e,end:a-1,fixity:t,isLeft:!1,apply:r}),Je=e=>e.kind===`Operator`&&Pr.has(e.text)&&D(`(`,1)?oe(()=>he(()=>{O(),O();let t=j(),n=a-1;return A(`)`),{end:n,expression:He(e,t)}})):void 0,Ye=()=>{let e=0;for(let t=a+1;t<i.length;t++){let n=i[t];if(n.kind===`Operator`){if(e===1&&n.text===`,`)return!0;if(i[t-1].text!==`!`&&(ii.has(n.text)&&e++,ai.has(n.text)&&--e===0))return!1}}return!1},Ze=e=>D(`(`,1)&&Ye()?oe(()=>he(()=>{O(),O();let t=j();A(`,`);let n=j();return A(`)`),{kind:`Apply`,operator:e.text,args:[t,n],location:_(e)}})):void 0,Qe=e=>{let t=a,n=S(),r=_(n),i=n.kind===`Operator`||n.kind===`Keyword`,o=i?Dr.get(n.text):void 0;if(!e){if(D(`[`)){let e=Ue();return qe(t,`Postfix`,Ar,t=>({kind:`FunctionApplication`,function:t[0].expression,args:e,location:r}))}if(D(`.`)&&ce(S(1))){O();let e=O().text;return qe(t,`Postfix`,Ar,t=>({kind:`FieldAccess`,record:t[0].expression,field:e,location:r}))}if(o){if(Ze(n)){a=t;return}return O(),{...qe(t,`Infix`,o,e=>Ve(n,e[0].expression,e[1].expression,e[0].joinedBy===n.text,b(e[0].start,e[1].end).end)),isLeft:Or(n.text,o),joins:n.text}}if(n.kind!==`Operator`||!Pr.has(n.text))return;if(Je(n)){a=t;return}return O(),qe(t,`Postfix`,Tr,e=>He(n,e[0].expression))}if(n.kind===`Operator`&&ci(n))return Ke(De(),t);let s=o?Ze(n):void 0;if(s)return Ke(s,t);let c=Je(n);if(c)return c.expression.location.range=b(t,c.end),{start:t,end:c.end,expression:c.expression};let l=i?kr.get(n.text):void 0;if(l)return O(),qe(t,`Prefix`,l,e=>ui(n.text===`-`?`-.`:n.text,e[0].expression,r));if(!Ge(n))return;let u=n.kind===`Operator`&&Mr.has(n.text);return Ke(u?Re():se(Re),t)},$e=e=>e!==void 0&&`fixity`in e,et=e=>e!==void 0&&!(`fixity`in e),nt=(e,t)=>{let n=Math.min(e.start,t[0].start),r=Math.max(e.end,t[t.length-1].end),i=e.apply(t);return i.location.range=b(n,r),{start:n,end:r,expression:i,joinedBy:e.joins}},rt=e=>{let t=e.pop(),n=e.pop();if(!et(t)||!$e(n))throw T(`incomplete expression`);let r=n.fixity===`Infix`?e.pop():void 0;e.push(nt(n,et(r)?[r,t]:[t]))},it=e=>{let t=e[e.length-2];return $e(t)?t:void 0},at=(e,t)=>t!==void 0&&e.high<t.low,ot=()=>E(()=>{let e=oe(()=>Qe(!0));if(e===void 0){let e=te();throw e.kind===`End`?ae(`Unexpected end of expression`,e):T(`required expressions(s) missing before '${re(e)}'`,e)}return se(()=>{let t=[e];for(;;){let e=oe(()=>Qe($e(t[t.length-1])));if(e===void 0)break;if(et(e)||e.fixity===`Prefix`){t.push(e);continue}for(;at(e,it(t));)rt(t);let n=t[t.length-1];if(e.fixity===`Postfix`&&et(n)){t.splice(-1,1,nt(e,[n]));continue}let r=it(t);r?.fixity===`Infix`&&r.isLeft&&e.isLeft&&!at(r,e)&&rt(t),t.push(e)}for(;t.length>1;)rt(t);let n=t[0];if(!et(n))throw T(`incomplete expression`);return n.expression})}),j=(e=0)=>r?ot():We(e),st=()=>{if(!k(`(`))return[];let e=ht();return A(`)`),e},ct=()=>{let e=_(S()),t=j(),n=i[a-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:d[0].name,start:e,end:r}}},lt=e=>{let t=a;return x(dt(e),t)},ut=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),dt=e=>{let t=S(),n=a,r=_(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:b(n,a-2),...ct(),isLocal:e,isRecursive:g(t),location:r});if(t.kind===`Identifier`&&S(1).kind===`Operator`&&Dr.has(S(1).text)&&S(2).kind===`Identifier`&&D(`==`,3)){let e=ue(),t=O().text,n=ue();return A(`==`),i(t,[ut(e),ut(n)])}let o=t.kind!==`String`&&Ir.has(t.text),s=t.kind===`Identifier`&&Pr.has(S(1).text)&&D(`==`,2);if(o||s){let e=o?t.text:S(1).text;o&&O();let n=ue();return s&&O(),A(`==`),i(e,[ut(n)])}let c=le();if(k(`[`)){let t=he(()=>be());return A(`]`),A(`==`),{kind:`Function`,name:c,bounds:t,body:j(),isLocal:e,isRecursive:g(c),location:r}}let l=a,u=st();return A(`==`),D(`INSTANCE`)?{...ft(c,u,e,r),definitionRange:b(l)}:i(c,u)},ft=(e,t,n,r)=>{let i=a;return A(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:me(),substitutions:k(`WITH`)?ge(()=>{let e=a,t=fe(),n=b(e);return A(`<-`),{name:t,nameRange:n,expression:we()}}):[],isLocal:n,location:r,instanceRange:b(i)}},pt=()=>{let e=a;return x(mt(),e)},mt=()=>{let e=_(S());if(D(`_`)&&S(1).kind===`Operator`&&(Dr.has(S(1).text)||Pr.has(S(1).text)))return O(),{name:O().text,arity:k(`_`)?2:1,location:e};if(S().kind!==`String`&&(Ir.has(S().text)||r&&S().kind===`Operator`)&&D(`_`,1)){let t=O().text;return O(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=le();if(!k(`(`))return{name:t,arity:0,location:e};let n=ge(()=>A(`_`));return A(`)`),{name:t,arity:n.length,location:e}},ht=()=>ge(pt),gt=()=>{let e=ht();return e.forEach(e=>u[u.length-1].add(e.name)),e},_t=e=>{let t=0,n=e;do{let e=S(n);if(e.kind===`End`)return n;e.kind===`Operator`&&ii.has(e.text)&&t++,e.kind===`Operator`&&ai.has(e.text)&&t--,n++}while(t>0);return n},M=()=>{let e=S(),t=S(1);return e.kind===`Identifier`?D(`(`,1)||D(`[`,1)?D(`==`,_t(1)):t.kind===`Operator`&&Pr.has(t.text)?D(`==`,2):t.kind===`Operator`&&Dr.has(t.text)?S(2).kind===`Identifier`&&D(`==`,3):D(`==`,1):e.kind!==`String`&&Ir.has(e.text)&&t.kind===`Identifier`&&D(`==`,2)},vt=[],yt=()=>vt[vt.length-1]??-1,bt=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),xt=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n=t.length;for(;t[n-1]===`.`;)n--;return t.slice(0,n)},St=e=>!e.text.endsWith(`.`)&&!Kr.has(xt(e)),Ct=e=>{let t=xt(e);if(Kr.has(t))return;let n=bt(e);if(n>=0)return`<${n}>${t}`;let r=yt(),i=vt[vt.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},wt=e=>{if(e.kind===`Keyword`)return Ur.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return vt.length===0;if(e.text[1]===`+`||vt.length===0)return!0;let t=yt();return t>=0&&bt(e)>t},Tt=e=>{let t=bt(e),n=vt.length-1,r=vt[n-1]??-1,i=vt[n]<0;return i&&(vt[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:vt[n]===t},Et=()=>{let e=S();return e.kind===`Step`?St(e):e.kind===`Keyword`?ti.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!M()},Dt=()=>{let e=a,t=S();return t.kind===`Operator`&&!Lr.has(t.text)&&li(t.text)?(a++,x({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:_(t)},e)):k(`MODULE`)?x({kind:`ModuleFact`,name:le(),location:_(t)},e):j()},Ot=()=>{let e=a,t=S(),n=ge(()=>{let e=S();if((e.kind!==`Identifier`||ne(e))&&e.kind!==`Operator`)throw ae(`Expected a definition name but found ${C(e)}`,e);return a++,e.text},`!`),r=_(t);return x(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},kt=()=>ge(()=>{if(r)return Ot();let t=Dt(),n=(t.kind===`Identifier`||t.kind===`Subexpression`||t.kind===`OperatorReference`)&&!di.has(t);return t.kind!==`ModuleFact`&&!n&&fi.set(t,wr(Zn(d[0].name,e),t)),t}),At=()=>{let e=oe(j);if(!e)return[];let t=[e];return E(()=>{for(;D(`,`);){let e=oe(()=>(O(),j()));if(!e)return;t.push(e)}}),t},jt=()=>{let e=r?At():Et()?ge(Dt):[],t=k(`DEF`)||k(`DEFS`);if(r&&e.length===0&&!t)throw ae(`Expected a fact`);return{facts:e,defs:t?kt():[]}},Mt=()=>{let e=a,t=O(),n=t.text===`USE`&&k(`ONLY`),r=b(e);return x({kind:t.text===`USE`?`Use`:`Hide`,isOnly:n,...jt(),keyword:r,location:_(t)},e)},Nt=()=>{let e=a,t=_(S()),n=k(`NEW`),i=r?a:e,o=r?_(S()):t,s=S().kind===`Keyword`?ni.get(S().text):void 0;if(!n&&s===void 0)throw ae(`Expected a declaration but found ${C(S())}`);if(s!==void 0&&O(),s===`Variable`){let e=ue();return x({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:o},i)}let c=pt(),l=(s??`Constant`)===`Constant`&&D(`\\in`);if(l&&c.arity>0)throw T(`declared symbol with arguments before \\in`);return l&&O(),x({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?j():void 0,nameRange:c.location.range,location:o},i)},Pt=()=>{if(S().kind===`Identifier`&&D(`::`,1)&&D(`ASSUME`,2)&&(O(),O()),D(`ASSUME`))return It();if(S().kind===`Keyword`&&ri.has(S().text))return r?se(Nt):Nt();if(!r)return j();let e=oe(j);if(e===void 0)throw ae(`Expected a hypothesis`);return e},Ft=()=>{let e=[Pt()];return E(()=>{for(;;){let t=oe(()=>(A(`,`),Pt()));if(t===void 0)break;e.push(t)}}),e},It=()=>{let e=a,t=_(A(`ASSUME`)),n=()=>{let n=r?Ft():ge(Pt);return A(`PROVE`),x({kind:`AssumeProve`,assumptions:n,conclusion:j(),location:t},e)};return r?se(n):n()},Lt=e=>{let t=0;for(;S(t).kind===`Identifier`&&D(`,`,t+1);)t+=2;return S(t).kind===`Identifier`&&D(e,t+1)},Rt=()=>{let e=S();if(D(`USE`)||D(`HIDE`))return Mt();if(!r&&D(`INSTANCE`)){let t=a;return x(ft(void 0,[],!1,_(e)),t)}if(D(`DEFINE`)||M()){let t=a;k(`DEFINE`);let n=[lt(!1)];for(;M();)n.push(lt(!1));let r={kind:`Define`,definitions:n,location:_(e)};return x(r,t)}if(k(`HAVE`))return{kind:`Have`,expression:j()};if(k(`TAKE`)){let e=_e(),t=de(e?[]:ge(ue)),n=e?be():[];return{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(k(`WITNESS`))return{kind:`Witness`,expressions:ge(()=>j())};if(k(`PICK`)){let e=Lt(`:`),t=de(e?ge(ue):[]),n=e?[]:be();return A(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:j()}}return k(`CASE`)?{kind:`Case`,expression:j()}:{kind:`Assert`,isSuffices:k(`SUFFICES`),statement:D(`ASSUME`)?It():j()}},zt=e=>{let n=S();if(n.kind!==`Step`)throw ae(`Expected a step number but found ${C(n)}`,n);if(!Tt(n))throw T(`${e?`QED step`:`step`}'s number has bad level`,n);if(t!==`sany`&&bt(n)<0&&Ct(n)!==void 0)throw T(`<*> and <+> cannot be used for a named step`,n);return a++,{name:Ct(n),token:n.text,location:_(n)}},Bt=()=>{let e=a,t=zt(D(`QED`,1)),n=a,r=k(`QED`)?{kind:`Qed`}:Rt(),i=b(e),o=b(n),s=wt(S());if(s&&!Wr.has(r.kind))throw T(`Proof of a step that does not take a proof`);let c=s?P():void 0;return x({...t,body:r,head:i,statement:o,proof:c},e)},Vt=e=>{if(k(`BY`)){let t=b(a-1);return{kind:`By`,isOnly:k(`ONLY`),...jt(),keyword:t,location:e}}let t=S();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;O();let n=b(a-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},N=()=>{let e=_(S());k(`PROOF`);let t=Vt(e);if(t)return t;let n=[Bt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(Bt());return{kind:`Steps`,level:yt(),steps:n,location:e}},P=()=>{let e=a;vt.push(-1);let t=N();return vt.pop(),x(t,e)},Ht=()=>S().kind===`Step`||S().kind===`Keyword`&&Ur.has(S().text),F=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return Xr(e);let n=t.defs[t.defs.length-1]?.location.range;return Yr(Xr({...e,end:e.start}),Xr(n??t.keyword))},Ut=()=>{let e=a,t=_(S()),n=k(`PROOF`),r=Vt(t);if(r){let t=x(r,e);return{kind:`Leaf`,proof:t,span:Xr(t.keyword),first:e,end:a-1}}let i=S();if(i.kind!==`Step`)throw ae(`Expected a step number but found ${C(i)}`);let o=a;O();let s=a,c=k(`QED`)?{kind:`Qed`}:Rt(),l=b(o);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:b(s),span:F(l,c),first:e,start:o,end:a-1}},I=(e,t,n,r)=>{let a=e[t];if(!a)return{proof:void 0,span:r,next:t,end:void 0};if(a.kind===`Leaf`)return{proof:a.proof,span:a.span,next:t+1,end:a.end};let o=L(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={..._(i[a.first]),range:b(a.first,o.end)};return{proof:{kind:`Steps`,level:o.level,steps:o.steps,location:s},span:o.span,next:o.next,end:o.end}},L=(e,t,n,r,i)=>{let a=e[t];if(!a)throw ei(`Unexpected end of (sub)proof at level ${n} before QED step`,r,$r);if(a.kind===`Leaf`)throw ei(`Expecting a proof step but found a${qr[a.proof.kind]} leaf proof`,a.span,$r);if(!i&&a.isProof)throw ei(`PROOF keyword found in step that does not begin subproof`,a.span,Qr);let o=a.token.text[1];if(o===`+`&&!i)throw ei(`<+> used but no subproof expected`,a.span,Qr);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:bt(a.token);if(s<n||!i&&s>n)return;let c=Wr.has(a.body.kind)?I(e,t+1,s+1,a.span):{proof:void 0,span:a.span,next:t+1,end:void 0},l=c.end??a.end,u={name:Ct(a.token),token:a.token.text,body:a.body,head:a.head,statement:a.statement,proof:c.proof,location:{..._(a.token),range:b(a.start,l)}},d=Yr(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=L(e,c.next,s,{start:d.stop,stop:d.stop},!1);return f&&{...f,level:s,steps:[u,...f.steps],span:Yr(d,f.span)}},R=()=>{if(!Ht())return;let e=[];for(;Ht();)e.push(Ut());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=I(e,0,0,t.span),r=e[n.next];if(r)throw ei(`extra step(s) after finished proof`,r.span,Zr,`Proof.Parser.toplevel`);return n.proof},z=(e,t,n,r)=>{e.definitions.some(e=>e.name===t)||e.definitions.push({kind:`Operator`,name:t,params:[],body:n,isLocal:!1,isRecursive:!1,location:r})},Wt=()=>{if(S().kind!==`Identifier`||!D(`==`,1))return;let e=le();return O(),e},Gt=()=>{if(!r)return j();let e=te(),t=oe(j);if(t)return t;throw ae(`Expected "====" but found ${C(e)}`,e)},Kt=e=>{let t=a,n=O(),i=Wt(),o=D(`ASSUME`)?It():Gt(),s=r?R():wt(S())?P():void 0,c=x({name:i,statement:o,proof:s,location:_(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),i!==void 0&&o.kind!==`AssumeProve`&&z(e,i,o,c.location)},qt=()=>{let e=a,t=O(),n=Wt();return x({name:n,expression:j(),isAxiom:t.text===`AXIOM`,location:_(t)},e)},Jt=()=>{let e=_(A(`----`));A(`MODULE`);let t=me();A(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[],hasRecursiveLet:!1};for(d.push(n),u.push(/* @__PURE__ */ new Set),k(`EXTENDS`)&&ge(()=>{let e=a;n.extends.push(me()),n.extendsRanges.push(b(e))});;){let t=a,r=S();if(r.kind===`ModuleEnd`)return e.range={module:d[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},d.pop(),u.pop(),n;if(r.kind===`Separator`){if(D(`MODULE`,1)){let e=Jt();n.modules.push(e),n.units.push({kind:`Module`,module:e}),A(`====`);continue}O()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=_(O()),r=ht();n.constants.push(...r),e.range=b(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=_(O()),r=ge(()=>{let e=a,t=_(S());return x({name:le(),arity:0,location:t},e)});n.variables.push(...r),e.range=b(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=qt();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&z(n,e.name,e.expression,e.location);continue}case`USE`:case`HIDE`:{if(D(`USE`)&&D(`ONLY`,1))throw ae(`Expected a module unit but found ${C(r)}`);let e=Mt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=_(O()),r=gt();e.range=b(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:Yt(n,x(ft(void 0,[],!1,_(r)),t));continue;case`LOCAL`:if(O(),D(`INSTANCE`)){Yt(n,x(ft(void 0,[],!0,_(r)),t));continue}Yt(n,x(dt(!0),t));continue}r.kind===`Keyword`&&Hr.has(r.text)?Kt(n):Yt(n,lt(!1))}}},Yt=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))},Xt=Jt(),Zt=pe?Jn(e):void 0;if(Zt!==void 0)throw new s(Zt);return Xt},gi=e=>hi(e,`tlc`),_i=(e,t)=>hi(e,`tlc`,t),vi=e=>hi(e,`tlapm`),yi=e=>hi(e,`sany`),bi=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},xi=e=>{let t=bi(e);return t^t>>>16},Si=e=>{let t=[...new Set(e)],n=2**Math.max(4,Math.ceil(Math.log2(t.length/.75)));return t.map((e,t)=>({name:e,index:t,bucket:xi(e)&n-1})).sort((e,t)=>e.bucket-t.bucket||e.index-t.index).map(e=>e.name)},Ci=(e,t)=>{let n=JSON.stringify(t);e.some(e=>JSON.stringify(e)===n)||e.push(t)},wi=e=>e===void 0?`Unknown location`:typeof e==`string`?`In module ${e}`:e.beginLine===0&&e.beginColumn===0&&e.endLine===0&&e.endColumn===0?`In module ${e.file}`:`line ${e.beginLine}, col ${e.beginColumn} to line ${e.endLine}, col ${e.endColumn} of module ${e.file}`,Ti=e=>e?.kind===`OpAppl`&&e.nullKind===`absent`,Ei=()=>({buckets:Array.from({length:11},()=>[]),count:0,threshold:8}),Di=(e,t)=>(e&2147483647)%t,Oi=e=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let r=e.buckets.length-1;r>=0;r--)e.buckets[r].forEach(e=>n[Di(e.hash,t)].unshift(e));e.buckets=n,e.threshold=Math.floor(t*.75)},ki=(e,t,n=t)=>e.buckets[Di(bi(n),e.buckets.length)].find(e=>e.key===t)?.value,Ai=(e,t,n,r=t)=>{let i=bi(r),a=e.buckets[Di(i,e.buckets.length)].find(e=>e.key===t);a?a.value=n:(e.count>=e.threshold&&Oi(e),e.buckets[Di(i,e.buckets.length)].unshift({hash:i,key:t,value:n}),e.count++)},ji=e=>e.buckets.toReversed().flatMap(e=>e.map(e=>e.value)),Mi=`\0module `,Ni=()=>({table:Ei(),symbols:[]}),Pi=e=>e.kind===`Module`?Mi+e.name:e.name,Fi=(e,t)=>{Ai(e.table,Pi(t),t,t.name),e.symbols.push(t)},Ii=e=>e.kind===`ThmOrAssumpDef`?e.params.length:e.kind===`Module`?0:e.arity,Li=(e,t)=>ki(e.table,t),Ri=(e,t)=>ki(e.table,Mi+t,t),zi=e=>e.context.symbols.filter(e=>e.kind===`OpDef`&&e.defKind===`UserDefined`),Bi=(e,t)=>ji(e.context.table).filter(e=>e.kind===`OpDecl`&&e.declKind===t).toReversed(),Vi=e=>e.context.symbols.filter(e=>e.kind===`ThmOrAssumpDef`),Hi={kind:`Local`},Ui=`$subexpression`,Wi=/* @__PURE__ */ new WeakMap,Gi=/* @__PURE__ */ new WeakMap,Ki=/* @__PURE__ */ new WeakMap,qi=/* @__PURE__ */ new WeakMap,Ji=/* @__PURE__ */ new WeakMap,Yi=/* @__PURE__ */ new WeakMap,Xi=/* @__PURE__ */ new WeakMap,Zi=/* @__PURE__ */ new WeakSet,Qi=/* @__PURE__ */ new WeakSet,$i=e=>Qi.has(e)||ta(Yi.get(e))!==void 0,ea=e=>e?.find(e=>e.isEmpty?Qi.has(e.node):Zi.has(e.node)),ta=e=>ea(e)?.error,na=/* @__PURE__ */ new WeakMap,ra=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},ia=new Map([...[`~>`,`-+->`,`\\cdot`,`\\X`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}]),[`'`,{key:`'`,arity:1,kind:`Builtin`}]]),aa=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,oa=(e,t)=>aa(e,t)?-1:+!!aa(t,e),sa=e=>e.kind===`Operator`?e.params.length:0,ca=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],la=e=>e.name.includes(`!`),ua=e=>e.kind===`Function`&&!la(e)?e.bounds.length:void 0,da=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},fa=(e,t,n)=>{let r=t.bindings.get(e);return r&&aa(r.position,t.location)&&(!n||aa(r.position,n.start))?r:void 0},pa=(e,t)=>e!==void 0&&t!==void 0&&m(e)===m(t),ma=(e,t,n,r)=>{if(t===void 0)return!0;if(pa(t.range,n.range))return!1;let i=n.range;if(i===void 0||r.isGenerated||t.kind!==`Builtin`&&!t.range)return!0;let a=m(i),o=t.range&&m(t.range);return t.kind===`Builtin`?r.errors.push({location:a,message:`Symbol ${xt(e)} is a built-in operator, and cannot be redefined.`}):n.kind===`Parameter`||t.kind!==n.kind||t.arity!==n.arity?r.errors.push({location:a,message:`Multiply-defined symbol '${xt(e)}': this definition or declaration conflicts \nwith the one at ${o}.`}):r.warnings.push({location:a,message:`Multiple declarations or definitions for symbol ${xt(e)}. \nThis duplicates the one at ${o}.`}),!1},ha=(e,t,n,r)=>ma(t,da(e,t)??fa(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,ga=(e,t,n)=>{ma(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},_a=(e,t,n,r)=>t.reduce((e,t,i)=>ha(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),va=(e,t,n)=>t.reduce((e,t)=>ha(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),ya=e=>e.kind===`Name`?[e.name]:e.names,ba=e=>e.flatMap(e=>ya(e.pattern)),xa=(e,t)=>{let n=t.definitions.get(e),r=fa(e,t,void 0);return n!==void 0&&(n===t.self?n.isRecursive:n.isRecursive?r!==void 0:aa(n.location,t.location)&&(r===void 0||!aa(r.position,n.location)))?n:void 0},Sa=(e,t)=>{let n=xa(e,t);if(n){let r=n.isRecursive?t.bindings.get(e):void 0;return{key:t.getKey(n),arity:r?.arity??sa(n),params:r?.params??ca(n),kind:`Definition`,range:n.location.range,functionArity:ua(n)}}let r=fa(e,t,void 0);return r?.isPending?{key:e,arity:r.arity,params:r.params,kind:r.kind}:r?t.imported.get(e):void 0},Ca=(e,t)=>t.facts.has(e)||t.bindings.get(e)?.kind===`Theorem`,wa=(e,t)=>t.bindings.get(e)?.kind===`Theorem`?t.goals.get(e):void 0,Ta=(e,t,n)=>da(t,e)??Sa(e,n),Ea=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Da=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:Ea(e.location,e.spelling??t)},Oa=e=>{if(!(e.kind!==`Apply`||e.argumentsRange)){if(e.args.length===2)return`infix`;if(e.args.length===1)return e.operator===`-.`?`prefix`:`postfix`}},ka=`In module --TLA+ BUILTINS--`,Aa=/* @__PURE__ */ new Set([`Definition`,`Instance`,`Theorem`]),ja=(e,t,n)=>n.errors.push({location:m(t),message:`Cannot take subexpression of \`${xt(e)}'.`}),Ma=e=>!/^[\p{L}\d_]/u.test(e),Na=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Pa=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,Fa=(e,t,n)=>{let r=e.split(`!`),i=n??r.map((e,n)=>n===r.length-1?t.length:0);return r.map((e,n)=>{let r=i.slice(0,n).reduce((e,t)=>e+t,0);return{kind:`Name`,name:e,args:t.slice(r,r+i[n])}})},Ia=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?Fa(e.name,[],void 0):Fa(e.operator,e.args,e.argumentCounts),La=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Ra=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:ba(e.bounds),body:e.body,sets:La(e.bounds)};case`SetMap`:return{names:ba(e.bounds),body:e.expression,sets:La(e.bounds)};case`SetFilter`:return{names:ya(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:ya(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}},za=e=>{let t=e.operands,n=e.location.range,r=e.prefixEnds?.[t.length-3];return e.isBulleted||!n||!r?t:[{...e,operands:t.slice(0,-1),prefixEnds:e.prefixEnds?.slice(0,-1),location:{...e.location,range:{...n,end:r}}},t[t.length-1]]},Ba=e=>{switch(e.kind){case`Apply`:return e.args;case`And`:case`Or`:return za(e);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`:case`Selection`: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}},Va=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,Ha=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),Ua=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind===`Lambda`||e.kind===`Selection`)return;if(e.kind===`Let`)return Ua(e.body,t);let n=Xi.get(e);if(!(e.kind===`Apply`&&n===void 0&&$i(e)))return e.kind===`FunctionApplication`&&$i(e)?Ua(e.function,t):gt(e).slice(0,n).reduce((e,n)=>e??Ua(n,t),void 0)},Wa=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??Wa(i,t,n||Ha(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&Ua(e.set,t):Ua(e,t)},Ga=e=>e.kind===`Label`?Ga(e.body):e,Ka=e=>typeof e==`number`?`argument selector ${e}`:e,qa=`within the scope of a declaration
|
|
343
|
+
from outside that declaration's scope.`,Ja=(e,t,n,r,i)=>{let a=(t,n)=>{let i=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;i&&r.errors.push({location:m(i),message:n})},o=n.isSuffices===n.isInProof,s=n.statement,c={node:s,isGoal:!0,isSufficesOpen:n.isSuffices},l=0,u=0;for(let[e,n]of t.slice(1).entries()){let r=e+1,i=c.node;if(n.kind===`Name`){if(t[r-1].kind!==`Name`)return i.kind!==`NewSymbol`&&i.kind!==`AssumeProve`&&Ga(i).kind===`Let`?i:a(r-1,`A name selector here must be from a LET clause.`);let e=s.kind===`AssumeProve`?[...s.assumptions,s.conclusion]:[s],l=r===1?e.map((e,t)=>({position:t,label:Wa(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:i.kind===`Label`?Ua(i.body,n.name):void 0};if(!l?.label)return a(r,`Cannot find label \`${n.name}'.`);if(r===1&&s.kind===`AssumeProve`&&Ha(s,l.position)&&o)return a(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${qa}`);if(n.args.length!==l.label.params.length)return a(r,`Label \`${n.name}' used with wrong number of arguments.`);c.node=l.label,c.isGoal=!1,c.isSufficesOpen=!1;continue}if(n.kind===`Colon`){if(t[r-1].kind!==`Name`)return a(r-1,`!: should not follow an operand selector.`);let e=t[r+1];if(e===void 0?r!==1:e.kind!==`Name`)return a(r,`\`!:' can be used only after a name and either at the end after an
|
|
344
|
+
operator name or before an operator name.`);continue}let d=n.kind===`Operand`?Ka(n.operand):n.kind===`At`?`@`:`!(...)`,f=e=>n.kind===`Operand`?Pa(n.operand,e):-1,p=`An unexpected null node specified by '${d}'.\nThis is probably due to a previous error.`;if(c.isSufficesOpen){if(f(1)!==0)return a(r,i.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);c.isSufficesOpen=!1;continue}if(i.kind===`NewSymbol`)return i;if(i.kind!==`AssumeProve`){let e=Ga(i);if(Zi.has(e))return a(r,`Subexpression selection failed, probably due to an error in the selected expression.`);if([`Number`,`Decimal`,`String`].includes(e.kind))return a(r,`Selecting subexpression of expression that has none.`);if($i(e))return a(r,`Choosing operand \`${d}' of subexpression with no operands.`);let t=Ra(e);if(t&&n.kind!==`Operand`){let e=n.kind===`Bound`?n.args.length:0;if(n.kind===`Bound`&&e!==t.names.length)return a(r,`Selector with ${e} argument(s) used for quantifier with ${t.names.length} bound identifier(s).`);l+=t.names.length,u+=e,c.node=t.body,c.isGoal=!1;continue}let o=t?.sets,s=e.kind===`Identifier`?[]:o?o.length>0?o:void 0:Ba(e);if(!s)return i;let m=e.kind===`Except`,h=f(m?e.updates.length+1:s.length);if(h===-1)return a(r,`Nonexistent operand specified by \`${d}'.`);if(m&&h>0)return a(r,`Selecting subexpression of an EXCEPT not yet implemented.`);if(c.node=s[h],c.isGoal=!1,Zi.has(c.node))return a(r,p);continue}let m=[...i.assumptions,i.conclusion],h=f(m.length);if(h===-1)return a(r,`Nonexistent operand specified by \`${d}'.`);if(Ha(i,h)&&(!c.isGoal||o))return a(r,`Accessing ASSUME/PROVE clause ${qa}`);let g=m[h];if(g.kind===`NewSymbol`&&r!==t.length-1)return a(r,`Selected a subexpression of a NEW clause of an ASSUME.`);if(c.node=g,c.isGoal=!1,g.kind!==`NewSymbol`&&g.kind!==`AssumeProve`&&Zi.has(g))return a(r,p)}return c.node.kind===`AssumeProve`?i?c.node:a(void 0,`Selected ASSUME/PROVE instead of expression.`):c.node.kind===`NewSymbol`?i?c.node:a(void 0,`Selected a NEW declaration as an expression or operator.`):l===u?c.node:a(void 0,`Expected ${l} arguments but found ${u}.`)},Ya=(e,t)=>{let n=t.isGenerated?void 0:t.hasLabelScope?t.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:t.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return n===void 0||!e.location.range?!1:(t.errors.push({location:m(e.location.range),message:n}),!0)},Xa=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=m(r),a=e.params.filter((r,i)=>{let a=da(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:m(o),message:`Illegal parameter ${r} of label \`${e.name}'.`}),a});a.filter((e,t)=>a.indexOf(e)!==t).forEach(t=>n.errors.push({location:i,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),n.labelParams.filter(e=>!a.includes(e)).forEach(t=>n.errors.push({location:i,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let o=[...new Set(a.filter(e=>!n.labelParams.includes(e))),...e.params.filter(e=>!a.includes(e))];o.length>0&&n.errors.push({location:i,message:`Label ${e.name} declares extra parameter(s) ${o.map(e=>`${e} `).join(``)}`}),n.labels.has(e.name)&&n.errors.push({location:i,message:`Duplicate label \`${e.name}'.`}),n.labels.add(e.name)},Za=(e,t,n,r)=>{if(!Va(e))return!1;let i=Ia(e),a=i[0],o=i.length>1&&a.kind===`Name`?da(t,a.name)?.goal??wa(a.name,n):void 0;return o&&{node:Ja(e,i,o,n,r)}},Qa=(e,t,n)=>{let r=da(t,e)??fa(e,n,void 0);return r?r.kind===`Instance`:oo(e,t,n)!==void 0&&[...n.bindings.keys()].some(t=>t.startsWith(`${e}!`))},$a=(e,t,n,r)=>{let i=e.location;if(go(e,n,r))return;let a=na.get(e);if(a!==void 0)return a;if(ra(t))return e.kind===`Apply`?e.args.length:0;let o=da(n,t);if(o?.nonFactStep){r.errors.push({location:m(Da(e,t)),message:`Step number of non-expression step used as an expression.`});return}let s=o?.goal?.keyword;if(s){r.errors.push({location:m(Da(e,t)),message:`${s} proof step selected instead of expression.`});return}if(Za(e,n,r,!1)||Na(t)&&o)return e.kind===`Apply`?e.args.length:0;if(Qa(t,n,r)){let i=da(n,t)??fa(t,r,void 0),a=e.kind===`Apply`?e.args.length:0;if(i?.kind===`Instance`&&i.arity!==a){r.errors.push({location:m(e.kind===`Apply`&&e.argumentsRange||Da(e,t)),message:`The operator ${t} requires ${i.arity} arguments.`});return}let o=Da(e,t);r.errors.push({location:m({...o,start:{line:o.end.line,column:o.end.column-t.slice(t.lastIndexOf(`!`)+1).length+1}}),message:`Operator name ${t} is incomplete.`});return}if(o&&e.kind!==`OperatorReference`&&(e.resolution=Hi),o)return o.arity;if(wa(t,r)?.statement.kind===`AssumeProve`)return 0;let c=Sa(t,r);if(c)return e.kind===`Identifier`?e.name=c.key:e.operator=c.key,na.set(e,c.arity),c.arity;let l=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``,u=l===``?void 0:da(n,l)??Sa(l,r);if(u&&(!Aa.has(u.kind)||da(n,l)?.nonFactStep)){ja(l,e.kind!==`OperatorReference`&&e.selectorRanges?.[0]||Da(e,t),r);return}if(e.kind!==`OperatorReference`&&l!==``&&vo(l,e.kind===`Apply`&&e.argumentCounts?e.args.slice(0,e.argumentCounts[0]):[],e.selectorRanges?.[0],(e.kind===`Apply`?e.argumentRanges?.[0]:void 0)??i.range,n,r))return;if(u||l!==``&&Ca(l,r))return e.kind===`Apply`?e.args.length:0;let d=Oa(e),f=e.kind===`OperatorReference`||d!==void 0;if(!Ma(t)||Na(t)||!f){r.errors.push({location:m(Da(e,t)),message:`Unknown operator: \`${xt(t)}'.`});return}let p=e.spelling??t;r.errors.push({location:m(d===`prefix`&&p===`-.`?Ea(i,`-`):Da(e,t)),message:`Could not find declaration or definition of symbol '${p}'.`}),d&&Zi.add(e),d&&i.range&&r.errors.push({location:m(i.range),message:`Couldn't resolve ${d} operator symbol \`${p}'.`})},eo=(e,t,n)=>(e.forEach(e=>H(e.set,t,n)),e.reduce((e,t)=>_a(e,ya(t.pattern),t.pattern.ranges,n),t)),to=(e,t)=>e.kind===`Identifier`&&e.name===t&&M(e)||gt(e).some(e=>to(e,t)),no=(e,t)=>{e.kind===`FunctionConstruction`&&to(e.body,t)&&(e.isRecursive=!0),gt(e).forEach(e=>no(e,t))},ro=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?ba(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:m(o),message:e})},c=e.kind===`Function`?eo(e.bounds,t,i):va(t,e.params,i),l=da(c,a)??fa(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${xt(a)} defined at wrong LET/IN level.`):l&&!u?s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${xt(a)} already defined or declared.`):l&&e.kind===`Function`&&l.arity>0?s(`Function ${xt(a)} has operator arguments in its RECURSIVE declaration.`):l&&e.kind===`Operator`&&(l.arity!==e.params.length||e.params.some(e=>e.arity>0))&&s(`Definition of ${xt(a)} has different arity than its RECURSIVE declaration.`),l&&u&&e.kind===`Operator`&&(l.params=ca(e)),e.kind===`Function`?(H(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),no(e.body,a),e.isSelfReferential=to(e.body,a)):H(e.body,c,i),l&&u?((e.kind===`Operator`||l.arity===0)&&(l.isPending=!1,l.range=o),!1):e.kind===`Function`?l===void 0:ma(a,da(t,a)??fa(a,i,o),{kind:`Definition`,arity:sa(e),range:o},i)},io=(e,t,n,r=[],i=[])=>{let a=/* @__PURE__ */ new Set,o=e.filter(e=>e.isRecursive&&i.every(t=>t.name!==e.name)).reduce((e,t)=>{if(da(e,t.name)?.isPending)return e;let n={name:t.name,arity:sa(t),params:ca(t),kind:`Definition`,parent:e,isPending:!0};return a.add(n),n},t),s=/* @__PURE__ */ new Map,c=(e,t)=>{let r={kind:`Definition`,arity:t.arity,params:Array(t.arity).fill(0),range:t.location.range},i=ma(t.name,da(e,t.name)??fa(t.name,n,r.range),r,n)?{...r,name:t.name,parent:e,isPending:!0}:void 0;return i&&a.add(i),s.set(t,i),i??e},l=[...n.isGenerated?[]:r,...i].toSorted((e,t)=>oa(e.location,t.location)),u=(e,t)=>{let r=l.findIndex(e=>!t(e));return l.splice(0,r===-1?l.length:r).reduce((e,t)=>`kind`in t?jo(t,e,n):c(e,t),e)},d=u(e.reduce((e,t)=>{let i=ra(t.name)?e:u(e,e=>!aa(t.location,e.location)),o={name:t.name,arity:sa(t),kind:`Definition`,range:t.location.range,parent:i,functionArity:ua(t)};if(la(t))return{...o,params:ca(t),functionArity:da(i,t.name)?.functionArity};let s=r.some(e=>e.location===t.location),c=n.isGenerated||t.isLocal||ra(t.name),l=s?{...n,isGenerated:!0,errors:[],warnings:[]}:c?{...n,isGenerated:c}:n;return ro(t,i,l,a)?{...o,params:ca(t)}:i},o),()=>!0);return s.forEach((e,t)=>{let r=t.location.range;r&&!n.isGenerated&&(!e||e.isPending)&&n.errors.push({location:m(r),message:`Symbol ${xt(t.name)} declared in RECURSIVE statement but not defined.`})}),d},ao=(e,t,n)=>e.slice(0,-1).map((r,i)=>{let a=e.slice(0,i+1).join(`!`),o=da(t,a)??fa(a,n,void 0);return o?.kind===`Instance`?{name:a,arity:o.arity,range:o.range}:void 0}),oo=(e,t,n)=>ao(e.split(`!`),t,n)[0],so=(e,t,n)=>{if(!Va(e))return!1;let r=Ia(e),i=r.findIndex(e=>e.kind!==`Name`),a=r.slice(0,i===-1?r.length:i).flatMap(e=>e.kind===`Name`?[e]:[]),o=ao(a.map(e=>e.name),t,n),s=o.findIndex((e,t)=>e!==void 0&&(o[t-1]?.arity??0)+a[t].args.length!==e.arity),c=o[s];if(!c)return!1;let l=(e.kind===`Identifier`?void 0:e.argumentRanges?.[s])??e.location.range;return l&&n.errors.push({location:m(l),message:`The operator ${c.name} requires ${c.arity-(o[s-1]?.arity??0)} arguments.`}),!0},co=(e,t,n,r,i)=>{let a=e?.kind===`Definition`?e.params:void 0;return!e||!a||a.length===e.arity?!1:(r&&!i.isGenerated&&i.errors.push({location:m(r),message:`Wrong number of arguments (${n}) given to operator '${xt(t)}', \nwhich requires ${a.length} arguments.`}),!0)},lo=(e,t,n)=>{let r=e.location.range,i=e=>{r&&n.errors.push({location:m(r),message:e})},a=Ki.get(e);if(e.kind===`Lambda`&&e.operator!==void 0)i(`The operator ${xt(e.operator)} requires 1 arguments.`);else if(a)n.errors.push(a);else if(e.kind===`Lambda`&&r)Zi.add(e),i(`LAMBDA expression used where an expression is required.`);else if(e.kind===`OperatorReference`){let r=$a(e,e.operator,t,n);r!==void 0&&i(`The operator ${xt(e.operator)} requires ${r} arguments.`)}else H(e,t,n)},uo=(e,t=!1)=>{if(!Va(e))return;let n=t||e.kind===`Subexpression`||e.kind===`Apply`&&e.argumentCounts?.at(-1)===0?Ia(e):[],r=n.findIndex(e=>`args`in e&&e.args.length>0);if(r===-1)return;let i=n[r];return{index:r,range:e.selectorRanges?.[r],message:`Selector \`${i.kind===`Name`?i.name:`!(...)`}' should not have argument(s).`}},fo=(e,t,n,r,i,a,o)=>{let s=(e,t)=>{e&&o.errors.push({location:m(e),message:t})},c=(e,c)=>{let l=oo(r,a,o)?.range??Ta(r,a,o)?.range;l&&s(i,`Operator with incorrect arity passed as argument. \nOperator '${xt(e)}' of arity ${c} is argument number ${n+1} (counting from 1) to operator \`${m(l)}', \nbut an operator of arity ${t} was expected.`)},l=e.location.range;if(t===0)return lo(e,a,o),!0;let u=di.get(e);if(u)return s(u,`An expression appears as argument number ${n+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let d=Wi.get(e)??e,f=uo(d);if(f)return s(f.range,f.message),!1;if(e.kind===`Lambda`){if(Wi.has(e)?H(e,a,o):_o(e,a,o),ta(Yi.get(e)))return!1;let u=e.params.length===t;return!u&&Wi.has(e)?s(l,`Expected arity ${t} but found operator of arity ${e.params.length}.`):!u&&l&&e.operator===void 0?s(i,`Lambda expression with arity ${e.params.length} used as argument ${n+1} of operator \`${r}', \nbut an operator of arity ${t} is required.`):!u&&e.operator!==void 0&&c(e.operator,e.params.length),u}if(d!==e){let n=ta(Yi.get(e));return n&&o.errors.push(n),n||s(d.location.range,`Expected arity ${t} but found operator of arity 0.`),!1}if(e.kind===`Subexpression`)return H(e,a,o),!1;if(e.kind!==`Identifier`&&e.kind!==`OperatorReference`)return s(l,`An expression appears as argument number ${n+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let p=e.kind===`Identifier`?e.name:e.operator,h=Ta(p,a,o)?.params??[],g=$a(e,p,a,o);return e.kind===`Identifier`&&g!==void 0&&g!==t&&s(Da(e,p),`Expected arity ${t} but found operator of arity ${g}.`),e.kind===`OperatorReference`&&g!==void 0&&g!==t&&c(p,g),g===t&&h.every(e=>e===0)},po=(e,t,n)=>{let r=e.operator,i=Ta(r,t,n),a=so(e,t,n)?void 0:$a(e,r,t,n);if(a!==void 0&&a!==e.args.length&&n.errors.push({location:m(e.argumentsRange??Da(e,r)),message:`The operator ${xt(r)} requires ${a-(ao(r.split(`!`),t,n).findLast(e=>e!==void 0)?.arity??0)} arguments.`}),a!==e.args.length){Qi.add(e);return}let o=i&&(i.kind===`Definition`?i.params:e.args.map(()=>0));if(o===void 0){e.args.forEach(e=>mo(e,t,n));return}let s=e.selectorRanges?.at(-1)??Da(e,r),c=r===Ui,l=e.args.slice(0,o.length).map((e,i)=>{let a=c?Ji.get(e):void 0;return fo(e,o[i],a?.index??i,a?.operator??r,a?.range??s,t,c?{...n,isGenerated:!1}:n)});co(i,r,e.args.length,e.location.range,n)||l.forEach((t,i)=>{!t&&e.location.range&&n.errors.push({location:m(e.location.range),message:`Argument number ${i+1} to operator '${c?`LAMBDA`:r}' \nshould be a ${o[i]}-parameter operator.`})})},mo=(e,t,n)=>{e.kind===`Identifier`?$a(e,e.name,t,n):H(e,t,n)},ho=(e,t,n)=>e.forEach(e=>e.args.slice(0,e.params.length).forEach((r,i)=>fo(r,e.params[i],i,e.operator,e.range,t,n))),go=(e,t,n)=>{let r=Gi.get(e);return r?(ho(r.applications,t,n),n.errors.push(ta(r.nulls)??r.error),!0):!1},_o=(e,t,n)=>H(e.body,_a(t,e.params,e.paramRanges,n),{...n,labelParams:[...n.labelParams,...e.params]}),H=(e,t,n)=>{if(Wi.has(e)&&!n.isGenerated){let r=ea(Yi.get(e));if(r){Qi.add(e),ho(r.applications,t,n),n.errors.push(r.error);return}H(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>H(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:return;case`ExceptAt`:!n.isInExcept&&e.location.range&&(Qi.add(e),n.errors.push({location:m(e.location.range),message:`@ used where its meaning is not defined.`}));return;case`Identifier`:{let r=e.name,i=so(e,t,n)?void 0:$a(e,r,t,n);if(i===0){let i=Ta(r,t,n),a=i?.kind;(a===`Variable`||a===`Theorem`||a?.startsWith(`New`)||Ca(r,n))&&Qi.add(e);let o=da(t,r);if((o?o.goal:wa(r,n))?.statement.kind===`AssumeProve`){n.errors.push({location:m(Da(e,r)),message:`ASSUME/PROVE used where an expression is required.`});return}co(i,r,0,Da(e,r),n);return}i!==void 0&&n.errors.push({location:m(Da(e,r)),message:`The operator ${xt(r)} requires ${i} arguments.`}),Qi.add(e);return}case`OperatorReference`:$a(e,e.operator,t,n);return;case`Apply`:po(e,t,n);return;case`Lambda`:Wi.has(e)?_o(e,t,n):e.location.range&&(Zi.add(e),n.errors.push({location:m(e.location.range),message:`LAMBDA expression used where an expression is required.`}));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:H(e.expression,t,n);return;case`If`:r([e.condition,e.consequent,e.alternative]);return;case`Case`:r(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&H(e.other,t,n);return;case`Let`:H(e.body,io(e.definitions,t,n,e.instances,e.recursive),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:H(e.body,eo(e.bounds,t,n),i(ba(e.bounds)));return;case`UnboundedQuantifier`:H(e.body,_a(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&H(e.set,t,n),H(e.body,_a(t,ya(e.pattern),e.pattern.ranges,n),i(ya(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:H(e.predicate,eo([e.bound],t,n),i(ya(e.bound.pattern)));return;case`SetMap`:H(e.expression,eo(e.bounds,t,n),i(ba(e.bounds)));return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((r,i)=>{e.fields.slice(0,i).some(e=>e.name===r.name)&&n.errors.push({location:m(r.location.range??Ea(r.location,r.name)),message:`Non-unique fields in constructor.`}),H(r.value,t,n)});return;case`Except`:H(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),H(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:{let i=e.function,a=i.kind===`Identifier`?i.name:i.kind===`Apply`?i.operator:void 0,o=a===void 0?void 0:Ta(a,t,n)?.functionArity;H(i,t,n);let s=e.args.length;if(o===void 0||s<2||o===s||$i(i)){r(e.args);return}Qi.add(e),e.location.range&&n.errors.push({location:m(e.location.range),message:`Function '${a}' is defined with ${o} parameters, but is applied to ${s} arguments.`});return}case`FieldAccess`:H(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:if(Ya(e,n))return;H(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),Xa(e,t,n);return;case`Subexpression`:yo(e,t,n)&&Qi.add(e);return;case`Selection`:return}},vo=(e,t,n,r,i,a)=>{let o=da(i,e)??fa(e,a,void 0);return!o?.isPending||!n||!r?!1:t.length===o.arity?(t.forEach(e=>H(e,i,a)),a.errors.push({location:m(n),message:`Subexpression of \`${e}' used inside the operator's definition.`}),!0):(a.errors.push({location:m(r),message:`The operator ${e} requires ${o.arity} arguments.`}),!0)},yo=(e,t,n)=>{if(so(e,t,n)||go(e,t,n))return!0;let r=e.selectors[0],i=e.selectorRanges?.[0],a=e.selectors.findIndex(e=>e.kind!==`Name`),o=e.selectors.slice(0,a).flatMap(e=>e.kind===`Name`?[e.name]:[]),s=o.findIndex((e,t)=>t>0&&(Sa(o.slice(0,t+1).join(`!`),n)?.kind??`Instance`)!==`Instance`),c=o.length>1&&(da(t,o[0])??fa(o[0],n,void 0))?.kind===`Instance`,l=e.selectorRanges?.[a-1];if(c&&s===-1&&i&&l)return n.errors.push({location:m({module:i.module,start:i.start,end:l.end}),message:`Unknown operator: \`${xt(o.join(`!`))}'.`}),!0;let u=o.slice(0,s+1).join(`!`),d=s>0?Sa(u,n):void 0,f=e.selectors.slice(0,s+1).flatMap(e=>`args`in e?e.args:[]).length,p=e.argumentRanges?.[s]??e.location.range;if(d&&d.arity!==f&&p)return n.errors.push({location:m(p),message:`The operator ${xt(u)} requires ${d.arity} arguments.`}),!0;if(r.kind===`Name`&&e.selectors[1].kind!==`Name`&&i){let e=da(t,r.name),a=e??Sa(r.name,n);if(a===void 0&&!Ca(r.name,n)||a?.kind===`Instance`)return n.errors.push({location:m(i),message:`Unknown operator: \`${xt(r.name)}'.`}),!0;if(a&&(!Aa.has(a.kind)||e?.nonFactStep))return ja(r.name,i,n),!0}if(r.kind===`Name`&&vo(r.name,r.args,i,e.argumentRanges?.[0]??e.location.range,t,n))return!0;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>mo(e,t,n));let h=Za(e,t,n,!1);return h?h.node===void 0:!1},bo=(e,t)=>{let n=e.location.range;!t.isModuleKnown(e.name,e.location)&&n&&t.errors.push({location:m({...n,start:{line:n.end.line,column:n.end.column-e.name.length+1}}),message:`Module \`${e.name}' used without being extended or instantiated.`})},xo=(e,t,n,r)=>{if(e.kind===`ModuleFact`){bo(e,r);return}if(e.kind===`ExceptAt`&&e.location.range)return r.errors.push({location:m(e.location.range),message:"Unknown operator: `@'."}),ka;let i=To(e,t,n,r);if(Wi.has(e))return H(e,n,r),i;if(so(e,n,r))return i;let a=Za(e,n,r,!0);if(a){let t=a.node?.kind;return t===void 0?ka:t===`AssumeProve`||t===`NewSymbol`?void 0:e.location.range&&m(e.location.range)}if(e.kind===`Subexpression`)return yo(e,n,r)?ka:i;let o=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;return e.kind===`Identifier`&&da(n,o)?.nonFactStep?(r.errors.push({location:m(Da(e,o)),message:`Step number of non-fact used as a fact`}),ka):(Ca(o,r)||da(n,o)?.goal||e.kind===`Identifier`&&Qa(o,n,r)||H(e,n,r),i)},So=(e,t,n)=>{if(e.kind===`ModuleFact`)return bo(e,n),n.isModuleKnown(e.name,e.location);let r=fi.get(e)??[];if(n.errors.push(...r.map(e=>({location:wi(e.location),message:e.message}))),r.length>0)return!1;let i=pi(e),a=i??Wi.get(e)??e,o=a.location.range;if(!o)return!0;let s=a.kind===`Identifier`?a.name:a.kind===`Apply`||a.kind===`OperatorReference`?a.operator:``,c=da(t,s),l=c??Sa(s,n)??fa(s,n,o);return l===void 0&&Ca(s,n)||(Va(a)&&Ia(a).length>1&&(l===void 0||uo(a,!0))?wo(e,a,t,n):s===``||Co(s,c,l,o,n))?!0:(n.errors.push({location:m((i?e:a).location.range??o),message:`DEF clause entry should describe a defined operator.`}),!1)},Co=(e,t,n,r,i)=>(n===void 0&&i.errors.push({location:m(r),message:`Unknown operator: \`${xt(e)}'.`}),t?.nonFactStep===`Define`||(t?.nonFactStep&&i.errors.push({location:m(r),message:`DEF clause entry refers to a non-definition step.`}),n!==void 0&&Aa.has(n.kind)&&!Na(e))),wo=(e,t,n,r)=>{let i=(e,t)=>(e&&r.errors.push({location:m(e),message:t}),!1),a=uo(t,!0);if(a?.index===0)return i(a.range,a.message);let o=Ia(t),s=t.selectorRanges,c=Gi.get(e);if(!c&&!Wi.has(e)){let e=o[0],c=e.kind===`Name`?e.name:``,l=da(n,c),u=l??Sa(c,r);if(u&&(!Aa.has(u.kind)||l?.nonFactStep)&&s?.[0])return ja(c,s[0],r),!1;if(a)return i(a.range,a.message);if(Za(t,n,r,!1))return!1;let d=s?.[0],f=s?.[o.findLastIndex(e=>e.kind===`Name`)],p=o.flatMap(e=>e.kind===`Name`?[e.name]:[]);return i(d&&f&&{...d,end:f.end},`Unknown operator: \`${xt(p.join(`!`))}'.`)}if(a)return i(a.range,a.message);let l=c?ta(c.nulls)??c.error:ta(Yi.get(e));return l?(r.errors.push(l),!1):o.at(-1)?.kind===`Name`&&o.at(-2)?.kind!==`Name`},To=(e,t,n,r)=>{let i=e.location.range&&m(e.location.range);if(Wi.has(e))return ta(Yi.get(e))?ka:t.location.range&&m(t.location.range);if(Gi.has(e)||e.kind===`ExceptAt`)return ka;switch(e.kind){case`Number`:case`String`:case`Decimal`:case`Let`:case`Label`:return;case`Identifier`:case`Apply`:case`Subexpression`:{let t=Ia(e)[0];if(e.kind===`Subexpression`||t.kind!==`Name`)return;let a=e.kind===`Identifier`?e.name:e.operator,o=da(n,t.name)?.goal??wa(t.name,r);if(Ca(a,r)||o||Na(a)&&da(n,a)||e.kind===`Identifier`&&Qa(a,n,r))return;let s=Ta(a,n,r),c=e.kind===`Apply`?e.args.length:0;return s?.arity===c?i:ka}default:return i}},Eo=(e,t,n)=>{let r=qi.get(e.facts)??e.facts,i=e.facts.map((e,i)=>xo(e,r[i],t,n)),a=e.facts.filter(e=>e.kind!==`ModuleFact`||n.isModuleKnown(e.name,e.location)).length,o=e.defs.filter(e=>So(e,t,n)).length;i.forEach(t=>{t&&e.kind===`Hide`&&n.errors.push({location:t,message:`The only expression allowed as a fact in a HIDE is
|
|
345
|
+
the name of a theorem, assumption, or step.`})});let s=e.location.range;a+o===0&&s&&n.errors.push({location:m(s),message:e.kind===`By`?`Empty BY`:`Empty USE or HIDE statement.`})},Do=(e,t,n)=>(e.set&&H(e.set,t,n),ha(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Oo=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Do(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Oo(t,e.scope,e.unit,!0):H(t,e.scope,e.unit),e),{scope:t,unit:n});return H(e.conclusion,i.scope,i.unit),i.scope},ko=(e,t,n)=>e.kind===`AssumeProve`?Oo(e,t,n):(H(e,t,n),t),Ao=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Eo(e,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>No(t,e,r),t)},jo=(e,t,n)=>{let r=zo(e,t,n);return e.name===void 0?r:ha(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Mo=(e,t)=>{let n=(e,t)=>({statement:t,isSuffices:!1,isInProof:!1,keyword:e});switch(e.kind){case`Have`:return n(`HAVE`,{kind:`Tuple`,elements:[e.expression],location:t});case`Case`:return n(`CASE`,{kind:`Tuple`,elements:[e.expression],location:t});case`Witness`:return n(`WITNESS`,{kind:`Tuple`,elements:e.expressions,location:t});case`Take`:return n(`TAKE`,{kind:`Tuple`,elements:La(e.bounds),location:t});case`Pick`:return n(`PICK`,e.bounds.length>0?{kind:`Exists`,bounds:e.bounds,body:e.body,location:t}:{kind:`UnboundedQuantifier`,quantifier:`Exists`,names:e.names,body:e.body,location:t});case`Qed`:return n(`QED step`,{kind:`Tuple`,elements:[],location:t});default:return}},No=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=Mo(r,e.location),o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,goal:a},s=(t,n)=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,nonFactStep:n};switch(r.kind){case`Assert`:{let a=ko(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Ao(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0,keyword:r.isSuffices&&r.statement.kind!==`AssumeProve`?`SUFFICES`:void 0};return Ao(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return Eo(r,t,n),s(t,r.kind);case`Instance`:return s(jo(r,t,i),r.kind);case`Define`:return s(r.definitions.reduce((e,t)=>t.kind===`Instance`?jo(t,e,i):io([t],e,n),t),r.kind);case`Have`:case`Case`:return H(r.expression,t,i),Ao(e.proof,o(t),n),o(t);case`Witness`:return r.expressions.forEach(e=>H(e,t,i)),o(t);case`Take`:return o(_a(eo(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let a=_a(eo(r.bounds,t,i),r.names,r.nameRanges,i);return H(r.body,a,{...i,labelParams:[...i.labelParams,...ba(r.bounds),...r.names]}),Ao(e.proof,o(t),n),o(a)}default:return Ao(e.proof,o(t),n),o(t)}},Po=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:ko(e.statement,void 0,t);e.name!==void 0&&ga(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Ao(e.proof,n,t),r&&(r.isInProof=!1)},Fo={line:0,column:0},Io=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Lo=(e,t)=>{let n=new Map([...ia,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},Ro=(e,t,n,r,i)=>{let a=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),r),o=(e,t)=>i.errors.push({location:t,message:`An operator must be substituted for symbol '${xt(e.name)}', and it must have arity ${e.arity}.`}),s=(e,t)=>{let n=t.location.range;if(e.arity===0){lo(t,a,i);return}let r=di.get(t),s=r?void 0:Wi.get(t);if(s){let n=t.kind===`Lambda`?t.params.length:0,r=ta(Yi.get(t));t.kind===`Lambda`?H(t,a,i):r&&i.errors.push(r),!r&&n!==e.arity&&s.location.range&&i.errors.push({location:m(s.location.range),message:`Expected arity ${e.arity} but found operator of arity ${n}.`}),(r||n!==e.arity)&&o(e,ka);return}if(t.kind===`Subexpression`&&!r){H(t,a,i),o(e,ka);return}if(t.kind===`Lambda`&&!r){_o(t,a,i),t.params.length!==e.arity&&n&&o(e,m(n));return}if(t.kind===`OperatorReference`&&!r){let r=$a(t,t.operator,a,i);r===void 0?o(e,ka):r!==e.arity&&n&&o(e,m(n));return}if(t.kind!==`Identifier`||r){let t=r??n;t&&i.errors.push({location:m(t),message:`Arity ${e.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${xt(e.name)}'.`}),o(e,ka);return}let c=$a(t,t.name,a,i);c!==void 0&&c!==e.arity&&i.errors.push({location:m(Da(t,t.name)),message:`Expected arity ${e.arity} but found operator of arity ${c}.`}),c!==e.arity&&o(e,ka)},c=e.location.range,l=t.filter(e=>da(a,e.name)!==void 0||Sa(e.name,i)!==void 0).map(t=>({declaration:t,expression:{kind:`Identifier`,name:t.name,location:e.location}}));l.filter(e=>e.declaration.arity===0).forEach(e=>{let t=$a(e.expression,e.declaration.name,a,i);t&&c&&i.errors.push({location:m(c),message:`Wrong number of arguments (0) given to operator '${xt(e.declaration.name)}', \nwhich requires ${t} arguments.`})});let u=/* @__PURE__ */ new Map;return e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){i.errors.push({location:m(e.nameRange),message:`Identifier '${n}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let a=e.expression;s(r,a);let o=a.location.range;u.has(n)?o&&i.errors.push({location:m(o),message:`Multiple substitutions for symbol '${n}' in substitution.`}):u.set(n,a)}),l.filter(e=>!u.has(e.declaration.name)).forEach(e=>{(e.declaration.arity===0?0:$a(e.expression,e.declaration.name,a,i))!==e.declaration.arity&&c&&o(e.declaration,m(c)),u.set(e.declaration.name,e.expression)}),t.filter(e=>!u.has(e.name)).forEach(e=>{let t=e.location.range;c&&t&&i.errors.push({location:m(c),message:`Substitution missing for symbol ${xt(e.name)} declared at ${m(t)} \nand instantiated in module ${n}.`})}),u},zo=(e,t,n)=>{let r=n.getInstance(e);return Ro(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,t)=>ha(e,t[0],t[1],n),t)},Bo=(e,t,n,r)=>{let i=Lo(n,r.imported),a=new Map([...n.constants,...n.variables].map(e=>[e.name,e.location])),o={location:e.location,errors:[],warnings:[]};return r.reports.push(o),Ro(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,isModuleKnown:r.isModuleKnown,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(e=>[e[0],{...e[1],position:a.get(e[0])??Fo}])),errors:o.errors,warnings:o.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},Vo=(e,t)=>{let n=[],r=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>oa(e.location,t.location)).forEach(e=>{let i=[],a=[];try{e.check(i,a)}catch(e){if(!(e instanceof s)||!e.sany&&i.length===0)throw e;i.push(...e.sany?.errors??[])}i.forEach(e=>r(n,e)),a.forEach(e=>r(t,e))}),n},Ho=(e,t)=>{let n=Lo(e,t.imported),r=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1,keyword:void 0}]]:[])),i=new Map([...ia,...t.bound].map(e=>[e[0],{...e[1],position:Fo}])),a=/* @__PURE__ */ new Set,o=[],s=(e,a,o,s)=>({location:e,check:(c,l)=>s({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,isModuleKnown:t.isModuleKnown,location:e,self:a,facts:t.facts,goals:r,bindings:i,errors:c,warnings:l,hasLabelScope:o,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})}),c=(e,t)=>e.map(e=>s(e.location,void 0,!1,n=>ga(e.name,{kind:t,arity:e.arity,range:e.location.range},n)));return Vo([...e.units.flatMap(e=>{let t=e.kind===`Variables`?{type:`A VARIABLE declaration`,location:e.location}:e.kind===`Constants`?{type:`A declaration`,location:e.location}:e.kind===`Module`?{type:`A MODULE `,location:e.module.location}:e.kind===`Theorem`?{type:`A THEOREM`,location:e.theorem.location}:e.kind===`Assumption`?{type:`An ASSUME`,location:e.assumption.location}:e.kind===`Use`?{type:`A USE or HIDE`,location:e.use.location}:void 0,n=t?.location.range;return!t||!n?[]:[{location:t.location,check:e=>{o.some(e=>e.binding?.isPending)&&e.push({location:m(n),message:`${t.type} may not appear within a recursive definition section.`})}}]}),...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...c(e.constants,`Constant`),...c(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>s(e.location,void 0,!1,t=>{let n={kind:`Definition`,arity:e.arity,params:Array(e.arity).fill(0),range:e.location.range,position:e.location,isPending:!0},r=ma(e.name,i.get(e.name),n,t);r&&(i.set(e.name,n),a.add(n)),o.push({declaration:e,binding:r?n:void 0})})),...e.definitions.map(t=>s(t.location,t,!0,n=>{Io(e,t)?H(t.body,void 0,n):ro(t,void 0,n,a)&&i.set(t.name,{kind:`Definition`,arity:sa(t),range:t.location.range,position:t.location})})),...e.instances.map(e=>s(e.location,void 0,!1,n=>{va(void 0,e.params,n),t.instanced.get(e)?.forEach((e,t)=>ga(t,e,n)),e.name!==void 0&&ga(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)})),...e.assumptions.map(e=>s(e.location,void 0,e.name!==void 0,t=>{H(e.expression,void 0,t),e.name!==void 0&&ga(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t)})),...e.theorems.map(e=>s(e.location,void 0,e.name!==void 0,t=>Po(e,t))),...e.uses.map(e=>s(e.location,void 0,!1,t=>Eo(e,void 0,t))),{location:e.location.range?.end??e.location,check:e=>o.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:m(n),message:`Symbol ${xt(t.declaration.name)} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},Uo={Set:{open:`{ `,close:` }`,pad:` `,separator:`,`,divider:``,dividerPad:``},Sequence:{open:`<< `,close:` >>`,pad:` `,separator:`,`,divider:``,dividerPad:``},Subset:{open:`SUBSET `,close:` `,pad:` `,separator:`,`,divider:``,dividerPad:``},Function:{open:`( `,close:` )`,pad:` `,separator:` @@`,divider:` :>`,dividerPad:` `},Record:{open:`[ `,close:` ]`,pad:` `,separator:`,`,divider:` |->`,dividerPad:` `}},Wo=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},Go=e=>e!==void 0&&/^\p{Nd}$/u.test(e),Ko=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),qo=e=>{let t=t=>{let n=Je(e,t,Wo);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l=t(i);for(;l!==void 0&&e[l]!==a;){let n=o(l);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l=t(i)}if(l!==void 0)return c.last=l,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=Je(e,t,Go);if(e.startsWith(`..`,n)&&Go(e[n+2]))return{kind:`Constant`,first:t,last:Je(e,n+2,Go)-1,children:[]}},a=t=>{let n=e[t];if(n===`"`){let n=e.indexOf(`"`,t+1);return n===-1?void 0:{kind:`Constant`,first:t,last:n,children:[]}}let r=Go(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:Je(e,t+1,Go)-1,children:[]};if(Ko(n))return{kind:`Constant`,first:t,last:Je(e,t,Ko)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},U=e=>{let t=e.length===0?void 0:qo(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=Uo[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),g=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||g===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${g}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},Jo={general:1e3,stackOverflow:1005,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,unchangedVariableChanged:2143,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,initialStateIncomplete:2106,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,noInitialStates:2118,errorState:2120,behaviorUpToThisPoint:2121,backToState:2122,subscriptUndetermined:2139,subscriptMissingVariable:2140,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,simulating:2188,finished:2186,traceSpecWritten:2501,traceSpecFailed:2502,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,coverageStart:2201,coverageEnd:2202,coverageValue:2221,depthFirstStats:2204,depthFirstLevel:2205,depthFirstProgress:2206,depthFirstInitGenerated:2208,simulationProgress:2209,simulationStats:2210,temporalBranches:2212,statePrint1:2216,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,noInitialStatesInModel:2256,version:2262,depthFirstModelChecking:2271,noSpecificationButProperty:2257,fairnessTautology:2258,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,coverageNext:2772,coverageInit:2773,coverageProperty:2774,coverageValueCost:2775,coverageEndOverhead:2777,coverageConstraint:2778,coverageVariable:2779,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001,moduleOverrideStdout:2e4},Yo={none:0,error:1,warning:3,state:4},Xo={0:``,1:`Error: `,3:`Warning: `,4:`State `},Zo=(e,t,n,r)=>e?`@!@!@STARTMSG ${t}:${n} @!@!@\n${r}\n@!@!@ENDMSG ${t} @!@!@`:`${Xo[n]}${r}`,Qo=e=>{let t=/* @__PURE__ */ new Set;return{isTool:e.isTool,isDiffTrace:e.isDiffTrace??!1,version:e.version??`master`,print:(n,r,i)=>{let a=r===Yo.warning;if(a&&e.errorCodes?.includes(n))throw new o(n,i);if(a&&e.isWarningEnabled===!1||r!==Yo.error&&e.suppressedCodes?.includes(n))return;let s=a&&!e.isTool&&t.size===0?`
|
|
346
|
+
(Use the -nowarning option to disable this warning.)`:``,c=Zo(e.isTool,n,r,`${i}${s}`);a&&t.has(c)||(a&&t.add(c),console.log(c))}}},$o=`The configuration file did not specify the initial state predicate.
|
|
347
|
+
Can also be caused by trying to run TLC on a specification from
|
|
348
|
+
a module imported with a parameterized INSTANCE statement.`,es=[[1005,S,!1],[1e3,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable%1% %2% undefined).`,!1],[1e3,`Could not find operator: %1% in module: %2%`,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
|
|
349
|
+
%1%`,!0],[2143,`The variable %1% was changed while it is specified as UNCHANGED at
|
|
350
|
+
%2%`,!1],[2144,`The EXCEPT was applied to non-existing fields of the value at
|
|
351
|
+
%1%`,!1],[2145,`TLCGet(%1%) was undefined.`,!0],[2154,`Attempted to apply the operator overridden by the Java method
|
|
352
|
+
%1%,
|
|
353
|
+
but it produced the following error:
|
|
354
|
+
%2%`,!1],[2148,`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable %1% occurring in the state formula v.
|
|
355
|
+
`,!1],[2155,`Attempted to compare %1% with the value
|
|
356
|
+
%2%`,!0],[2158,`Attempted to check if the value:
|
|
357
|
+
%1%
|
|
358
|
+
is an element of %2%.`,!0],[2157,`Attempted to apply TransitiveClosure to a set containing
|
|
359
|
+
the following value:
|
|
360
|
+
%1%`,!0],[2156,`TLC supports at most %1% model values, but model value %2% exceeds this limit.`,!1],[2156,`tla-ts can't recover a model check from the checkpoint in %1%.`,!1],[2165,`Choose can only deal with numbers up to %1%`,!1],[2169,`The %1% argument of %2% should be a %3%, but instead it is:
|
|
361
|
+
%4%`,!0],[2170,`Argument mismatch in operator application.%1%`,!1],[2171,`Parsing or semantic analysis failed.%1%`,!1],[2172,ee,!1],[2176,`Applying %1% to the following value,
|
|
362
|
+
which is not %2%:
|
|
363
|
+
%3%`,!0],[2177,`Attempted to apply BagUnion to the following set, whose
|
|
364
|
+
element is not a bag:
|
|
365
|
+
%1%`,!0],[2178,`Overflow when computing %1%`,!1],[2179,`The second argument of \\div is 0.`,!0],[2180,`0^0 is undefined.`,!0],[2181,`Attempted to compute cardinality of the value
|
|
366
|
+
%1%`,!0],[2182,`Evaluating an expression of the form %1% when s is not a %2%:
|
|
367
|
+
%3%`,!0],[2183,`The %1% argument of %2% must be in the domain of its %3% argument:
|
|
368
|
+
%4%
|
|
369
|
+
, but instead it is
|
|
370
|
+
%5%`,!0],[2184,`Attempted to apply %1% to the empty sequence.`,!0],[2115,`No next state actions defined to generate successor states from.`,!1],[2146,`The invariant %1% is not a state predicate (one with no primes or temporal operators).%2%`,!1],[2213,`TLC cannot handle the temporal formula %1%`,!1],[2214,`Temporal formulas containing actions must be of forms <>[]A or []<>A.`,!1],[2215,`TLC expected a %1% value, but did not find one. %2%`,!1],[2222,`The constant parameter %1% is not assigned a value by the configuration file.`,!1],[2223,`In the configuration file, the identifier %1% appears
|
|
371
|
+
on the right-hand side of a <- after already appearing on the
|
|
372
|
+
left-hand side of one.`,!1],[2224,`The configuration file substitutes for %1% with the undefined identifier %2%.`,!1],[2225,`The configuration file substitutes for %1% with %2% of different number of arguments.`,!1],[2226,`In the configuration file, the identifier %1% does not appear in the specification.`,!1],[2227,`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`,!1],[2228,`TLC requires %1% not to take any argument.`,!1],[2228,`TLC requires %1% not to take any argument, but one was given: %2%`,!1],[2229,`The %1% %2% specified in the configuration file
|
|
373
|
+
is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,$o,!1],[2232,`The configuration file did not specify the next state predicate.`,!1],[2233,`The %1% %2% cannot be a constant.`,!1],[2234,`The operator %1% cannot take any argument.`,!1],[2235,`The operator %1% is not defined in the spec.`,!1],[2236,`The operator %1%, which equals %2%,
|
|
374
|
+
cannot be used as a %3%`,!1],[2237,`The spec is trivially false because %1% is false.`,!1],[2238,`TLC cannot handle subscript %1%`,!1],[2239,`TLC cannot handle this conjunct of the spec:
|
|
375
|
+
%1%`,!1],[2240,`The specification contains more than one conjunct of the form [][Next]_v,
|
|
376
|
+
but TLC can handle only specifications with one next-state relation.`,!1],[2241,`The property %1% is not correctly defined.`,!1],[2242,`The arity of the operator %1% is inconsistent in the configuration file.`,!1],[2244,`TLC can't handle real numbers.
|
|
377
|
+
%1%`,!1],[2245,`In the configuration file, the module name %1% is not a module in the specification.`,!1],[2247,`In computing %1%, TLC expected a %2% expression,
|
|
378
|
+
but instead found %3%.
|
|
379
|
+
%4%`,!1],[2248,`In computing %1%, TLC expected a %2% expression,
|
|
380
|
+
but didn't find one.
|
|
381
|
+
%3%`,!1],[2260,`In computing ENABLED, TLC encountered a temporal formula (%1%).
|
|
382
|
+
%2%`,!1],[2261,`TLC encountered a temporal formula (%1%) when evaluating a predicate or action.
|
|
383
|
+
%2%`,!1],[2265,`TLC can't handle a number this big.
|
|
384
|
+
%1%`,!1],[2266,`The %1% argument of %2% should be an %3%, but instead it is:
|
|
385
|
+
%4%`,!0],[2272,`The formula %1% at %2% is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. To check that action %1% holds in *every* step of the behavior, define a temporal property: Let A be the formula at %2%; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`,!1],[2273,`The formula %1% at %2% is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. To check that action %1% holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at %2% (compare page 90 of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`,!1],[2274,`The formula %1% at %2% is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. To check that infinitely many %1% steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at %2% (compare page 91 of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`,!1],[2280,`In evaluation, the identifier %1% is either undefined or not an operator.
|
|
386
|
+
%2%`,!1],[2281,`The configuration file substitutes constant %1% with non-constant %2%%3%`,!1],[2283,`The argument of %1% should be a %2%, but instead it is:
|
|
387
|
+
%3%`,!0],[5003,`TLC found an error in the configuration file at line %1%
|
|
388
|
+
The keyword %2% was not followed by an identifier.`,!1],[5004,`TLC found an error in the configuration file at line %1%
|
|
389
|
+
The keyword %2% appeared twice.`,!1],[5005,`TLC found an error in the configuration file at line %1%
|
|
390
|
+
Expected an identifier after %2%.`,!1],[5006,`TLC found an error in the configuration file at line %1%
|
|
391
|
+
It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the configuration file:
|
|
392
|
+
%1%`,!1],[5002,`TLC found an error in the configuration file at line %1%
|
|
393
|
+
`,!1],[2250,`A state predicate was evaluated to a non-boolean value.`,!1],[2252,`Encountered an action predicate that's not a boolean.`,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]];let ts;const ns=()=>ts??=es.map(e=>({pattern:RegExp(`^${e[1].split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e[0],isEvalException:e[2]}})),rs=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+: ))|\nis an element of a set of \d+-tuples\.$|^In computing ENABLED, TLC encountered a temporal formula \(a (~> b|-\+-> formula)\)\./,is=e=>rs.test(e)?void 0:ns().find(t=>t.pattern.test(e))?.message,as=e=>e instanceof t||is(e.message)?.isEvalException===!0,os=/* @__PURE__ */ new Map([[1e3,`
|
|
394
|
+
: `],[2105,`failed.
|
|
395
|
+
`],[2154,`but it produced the following error:
|
|
396
|
+
`],[2171,`Parsing or semantic analysis failed.`],[2213,`:
|
|
397
|
+
`],[2281,` - specifically: `],[2405,`failed.
|
|
398
|
+
`]]),ss=(e,t,n)=>{let r=n?os.get(e):void 0,i=r===void 0?-1:t.indexOf(r);if(r===void 0||i===-1)return t;let a=i+r.length;return`${t.slice(0,a)}${cs(t.slice(a),n)}`},cs=(e,t)=>{let n=t?is(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${Yo.none} @!@!@\n${ss(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},ls=(e,t=2)=>String(e).padStart(t,`0`),us=e=>{let t=Math.floor(e/1e3)%60,n=Math.floor(e/6e4)%60,r=Math.floor(e/36e5);return e>864e5?`${Math.floor(r/24)}d ${ls(r%24)}h`:e>36e5?`${ls(r%24)}h ${ls(n)}min`:e>6e4?`${ls(n)}min ${ls(t)}s`:`${ls(t)}s`},ds=e=>`${e.getFullYear()}-${ls(e.getMonth()+1)}-${ls(e.getDate())} ${ls(e.getHours())}:${ls(e.getMinutes())}:${ls(e.getSeconds())}`,fs=/* @__PURE__ */ new WeakMap,ps=(e,t,n)=>{if(!(e instanceof w))return e;let r=v(new w(`${n}\n${e.message}`,e),d(e));return fs.set(r,{code:t,headline:n,inner:e}),r},ms=e=>fs.has(e),hs=e(`util.WrongInvocationException`),gs=l.slice(0,l.indexOf(`
|
|
399
|
+
`)),_s=`${l}tlc2.tool.EvalException: `,vs=`${l}util.Assert$TLCRuntimeException: `,ys=e=>as(e)?_s:vs,bs=e=>{try{return e()}catch(e){throw e instanceof w?as(e)?new w(`${a}${e.message}`):is(e.message)?e:new w(`${l}${e.message}`):e}},xs=[_s,vs,l,a],Ss=(e,t)=>{let r=fs.get(e);if(r)return`${r.headline}\n${Ss(r.inner,t)}`;let i=e.message;if(e instanceof n)return i;let a=xs.find(e=>i.startsWith(e))??``;return`${a}${cs(i.slice(a.length),t)}`},Cs=(e,t)=>{let r=fs.get(e),a=e.message;if(r)return{code:r.code,message:a,toolMessage:Ss(e,!0)};if(e instanceof i)return{code:t?Jo.stackOverflow:Jo.general,message:a,toolMessage:a};if(t&&as(e))return{code:is(a)?.code??Jo.general,message:a,toolMessage:a};let o=t&&!a.startsWith(gs)&&!(e instanceof n),s=e instanceof u?hs:l,c=o?s:``;return{code:Jo.general,message:`${c}${a}`,toolMessage:`${c}${Ss(e,!0)}`}},ws=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,Ts=2147483647,Es=1e6;let Ds=Es;const Os=()=>Ds,ks=()=>Math.max(Ds,10),As=()=>`Attempted to construct a set with too many elements (>${Ds}).`,js=(e,t)=>{if(e.length===ks())throw new u(As());e.push(t)},Ms=e=>typeof e==`object`&&e.kind===`Interval`&&e.high-e.low>=ks(),Ns=(e,t)=>{if(Array.isArray(e))return e.forEach(t);for(let n=e.low;n<=e.high;n++)t(n)},Ps=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,Fs=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),Is=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),Ls=e=>typeof e==`object`&&e.kind===`ModelValue`,Rs=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),zs=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:Ps(e)?`set`:`function`,Bs=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648;let Vs=!1;const Hs=(e,t)=>(Vs=!0,e.writtenKeys=t,e),Us=e=>(e.hash!==0||e.fingerprint!==0?void 0:e.writtenKeys)??e.domain,Ws=e=>Us(e).map(t=>[t,e.range[e.domain.indexOf(t)]]),Gs=e=>e.domain.every(e=>typeof e==`number`)?e.domain.map((t,n)=>[t,e.range[n]]):Ws(e),Ks=(e,t,n,r)=>Hs(Rl(e,t.map(e=>n[e])),r),qs=e=>{if(!(typeof e!=`object`||e.kind!==`Function`&&e.kind!==`Set`)&&e.hash===0&&e.fingerprint===0){if(e.kind===`Set`)return e.elements.forEach(qs);e.writtenKeys=void 0,e.range.forEach(qs)}},Js=e=>{Vs&&typeof e==`object`&&e.kind===`Function`&&(e.writtenKeys=void 0)},Ys=e=>e.every(e=>typeof e==`string`),Xs=(e,t)=>e.length>0&&t.length>0&&Ys(e)!==Ys(t),Zs=(e,t)=>{Vs&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Xs(n,r)?sl(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=Cc(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=i[e],n=a[e],r=typeof t==`number`&&typeof n==`number`?t-n:Cc(t,n);if(r!==0)return r}return 0},Qs=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=Cc(n[e],r[e]);if(t!==0)return t}return 0},$s=e=>Ls(e)?e.type:void 0,ec=(e,t,n)=>{let r=$s(e),i=$s(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(Ls(e)&&Ls(t)){if(r===void 0||i===void 0||r===i)return;throw new w(`Attempted to ${a} the differently-typed model values ${U(q(e))} and ${U(q(t))}`)}throw r===void 0?new w(`Attempted to ${a} the typed model value ${U(q(t))} and the non-model value\n${U(q(e))}`):new w(`Attempted to ${a}${n?``:` the`} typed model value ${U(q(e))} and non-model value\n${U(q(t))}`)},tc=()=>({ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0}),nc=tc(),rc=e=>{Object.assign(nc,tc()),wc.clear();for(let t of e)pc(t)},ic=()=>{nc.searchRank=nc.size},ac=()=>nc.unorderedString;let oc=!1;const sc={isExpanded:!0,isViewPrinted:!1},cc=e=>{oc=e.version===`1.7.4`,Ds=e.maxSetSize??Es,sc.isExpanded=e.isLazyValueExpanded??!0,sc.isViewPrinted=e.isViewPrinted??!1},lc=/* @__PURE__ */ new WeakMap,uc=(e,t)=>(sc.isViewPrinted&&lc.set(e,t),e),dc=/* @__PURE__ */ new WeakMap,fc=(e,t)=>(dc.set(e,t),e),pc=e=>(nc.ranks[e]===void 0&&(nc.ranks[e]=nc.size++),e),mc=e=>nc.ranks[pc(e)],hc=(e,t)=>{if(e===t)return 0;let n=nc.ranks,r=n[e],i=n[t],a=nc.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&(nc.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},gc=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),_c=(e,t)=>(gc(e)||gc(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),vc=(e,t)=>new w(gc(e)?`Attempted to compare overridden value ${U(q(e,!0))} with non-overridden value:\n${U(q(t))}`:`Attempted to compare ${zs(e)} ${q(e)} with ${zs(t)} ${q(t)}`),yc=(e,n,r)=>{if(!gc(e))throw new w(`Attempted to ${r} the set ${U(q(W(e)?G(e):e,!0))} with the value:\n${U(q(n,!0))}`);if(!gc(n))throw vc(e,n);let i=e.kind===`InfiniteSet`?e.name:void 0,a=n.kind===`InfiniteSet`?n.name:void 0;if(i!==void 0&&i===a)return 0;if(i===`Nat`&&a===`Int`||i===`Int`&&a===`Nat`)return i===`Nat`?-1:1;throw new t(`Attempted to compare ${U(q(e,!0))} with the value\n${U(q(n,!0))}`)},bc={kind:`InfiniteSet`,name:`Any`},xc=e=>{throw new t(`Attempted to compare ANY with the value\n${U(q(e))}`)},Sc=e=>{Vs&&qs(e),e===bc&&xc(e),typeof e==`object`&&e.kind===`LazyFunction`&&K(e)},Cc=(e,t)=>{if(e===t)return Sc(e),0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return Zs(e,t);if(n===`Set`&&r===`Set`)return Qs(e,t);if(n===`Interval`&&r===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.max(0,t.high-t.low+1);return n!==r||n===0?n-r:e.low-t.low}if(n===`ModelValue`&&r===`ModelValue`)return e.type!==void 0&&t.type!==void 0&&ec(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return ec(e,t,!1),n===`ModelValue`?-1:1;if(e===bc||t===bc)return xc(e===bc?t:e);if(Ps(e)&&Ps(t)&&_c(e,t))return yc(e,t,`compare`);let i=Ps(e);if(i!==Ps(t))throw vc(e,t);if(n===`Interval`&&r===`Set`){let n=cu(e)-t.elements.length;if(n!==0)return n}if(n===`Set`&&r===`Interval`){let n=e.elements.length-cu(t);if(n!==0)return n}return i?Qs(G(e),G(t)):Zs(K(e),K(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return hc(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(ec(e,t,!1),Ls(e))return-1;if(Ls(t))return 1;throw vc(e,t)},wc=/* @__PURE__ */ new Map,Tc=32768,Ec=e=>{let t=wc.get(e);if(t)return t;if(wc.size===Tc)throw new f(`TLC supports at most ${Tc} model values, but model value ${e} exceeds this limit.`);let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:mc(e),hash:Vu(Hu(Uu(e),109)),fingerprint:Qu($u(e)^60)};return wc.set(e,n),n},Dc=()=>[...wc.values()],Oc=e=>({kind:`Set`,elements:e,writtenElements:void 0,isNormalized:!1,hash:0,fingerprint:0,isFingerprinted:!1}),kc=e=>{let t=Oc(e);return t.isNormalized=!0,t},Ac=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,lambdaDomain:void 0,isFingerprinted:!1});let jc=!1;const Mc=(e,t)=>(t===`lambda`&&(jc=!0),t!==void 0&&(e.functionClass=t),e),Nc=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,Pc=e=>Mc(e,`lambda`),Fc=e=>ws(e)&&e.isCached===!0;let Ic=!1;const Lc=e=>(Ic=!0,e),Rc=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),zc=e=>{Ic&&typeof e==`object`&&ws(e)&&Rc.has(e.kind)&&(e.isCached=!0)},Bc=e=>{(jc||Ic)&&typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&(e.isFingerprinted||(e.isFingerprinted=!0,e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(Bc),e.range.forEach(Bc)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(Bc):Ps(e)&&W(e)&&(zc(e),G(e).elements.forEach(Bc))))},Vc=(e,t)=>{if(zc(e),e===t)return Sc(e),!0;if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&ec(e,t,!0),Cc(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return Zs(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Qs(e,t)===0;if(e.kind===`Interval`&&t.kind===`Set`&&cu(e)!==t.elements.length||e.kind===`Set`&&t.kind===`Interval`&&e.elements.length!==cu(t))return!1;if(Ls(e)||Ls(t))return e.kind===`LazyFunction`&&K(e),ec(e,t,!0),Ls(e)&&Ls(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return Vc(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=au(e.domain),r=au(t.domain);if(n||r)return n===r;let i=au(e.range),a=au(t.range);return i||a?i===a:Vc(e.domain,t.domain)&&Vc(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(au(e))return au(t);if(au(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&Vc(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return au(e)?au(t):!au(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>Vc(e,t.factors[n]));let n=Ps(e)&&Ps(t)&&!(W(e)&&W(t));if(n&&_c(e,t))return yc(e,t,`check equality of`)===0;if(n){if(!gc(e)){let n=G(e);if(!gc(t))return Qs(n,G(t))===0}return id(e)===id(t)}return Cc(e,t)===0},Hc=e=>{let t=(e,t)=>{if(e===t)return!0;if(e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(!n(e[r],t[r]))return!1;return!0},n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):id(n)===id(r);return n},Uc=Hc(!1),Wc=Hc(!0),Gc=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},Kc=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Zu(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||Wc(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||Wc(i[e],n))return i[e]}return n.kind===`Set`?Gc(n.elements,t):(Gc(n.domain,t),Gc(n.range,t)),i===void 0?e.set(r,n):Array.isArray(i)?i.push(n):e.set(r,[i,n]),n};return e=>{for(let n=0;n<e.length;n++)e[n]=t(e[n]);return e}},qc=(e,t)=>t.length===0||Nc(e)===`tuple`?1:Ru(t)?.low,Jc=e=>{if(!Is(e))return;let t=K(e);return{domain:t.domain,range:t.range,low:qc(e,t.domain)}},Yc=e=>{if(!Is(e))return;let t=K(e);return Ys(t.domain)?t:void 0},Xc=(e,t,n)=>(ec(t,e,n),1),Zc={number:{name:`integer`,other:`non-integer`,equality:`check equality of`},string:{name:`string`,other:`non-string`,equality:`check equality of`},boolean:{name:`boolean`,other:`non-boolean`,equality:`compare equality of`}},Qc=(e,t,n)=>{let r=Zc[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${U(q(e))} with ${r.other}:\n${U(q(t))}`},$c=e=>e?`check equality of`:`compare`,el=(e,t,n,r)=>{let i=Jc(n);if(!i){if(Ls(n))return Xc(n,t,r);throw new w(`Attempted to ${$c(r)} the function ${U(q(t))} with the value:\n${U(q(n))}`)}if(e.range.length!==i.range.length)return e.range.length-i.range.length;let a=()=>tl(e.range,i.range,r);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&i.low!==void 0)return e.low===i.low?a():e.low-i.low;let o=e.low??i.low;if(o===void 0)return tl(e.domain,i.domain,r)||a();let s=e.low===void 0?e.domain:i.domain;for(let t=0;t<s.length;t++){let n=s[t];if(typeof n!=`number`)throw new w(`Attempted to compare ${r?`an `:``}integer with non-integer${r||e.low!==void 0?`:`:``}\n${U(q(n))}.`);let i=e.low===void 0?n-(o+t):o+t-n;if(i!==0)return i}return a()},tl=(e,t,n)=>{for(let r=0;r<e.length;r++){let i=ol(e[r],t[r],n);if(i!==0)return i}return 0},nl=(e,t,n)=>{let r=K(e);if(Nc(e)===`tuple`){let i=Is(t)?pu(t):void 0;return i?r.range.length-i.length||tl(r.range,i,n):el({...r,low:1},e,t,n)}if(Nc(e)===`record`){let i=Yc(t);if(!i){if(Ls(t))return Xc(t,e,n);throw new w(`Attempted to ${$c(n)} record:\n${U(q(e))}\nwith non-record\n${U(q(t))}`)}return r.domain.length-i.domain.length||tl(r.domain,i.domain,n)||tl(r.range,i.range,n)}return el({...r,low:qc(e,r.domain)},e,t,n)},rl=(e,t)=>gc(e)||gc(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),il=(e,t)=>{let n=Rs(t)?t:G(t);return{elements:G(e).elements,otherElements:G(n).elements}},al=(e,t,n)=>{if(rl(e,t))return n?+!Vc(e,t):Cc(e,t);if(!Rs(e))return al(G(e),t,n);if(!Ps(t)){if(Ls(t))return Xc(t,e,n);throw new w(`Attempted to ${$c(n)} the set ${U(q(e))} with the value:\n${U(q(t))}`)}let r=il(e,t);return r.elements.length-r.otherElements.length||tl(r.elements,r.otherElements,n)},ol=(e,t,n)=>{if(typeof e!=`object`){if(typeof t==typeof e)return n?e===t?0:1:Cc(e,t);if(Ls(t))return Xc(t,e,n);throw new w(Qc(e,t,n))}return e.kind===`ModelValue`?(e.type!==void 0&&ec(e,t,n),Ls(t)?n?e.name===t.name?0:1:e.rank-t.rank:-1):Is(e)?nl(e,t,n):al(e,t,n)},sl=(e,t)=>ol(e,t,!1),cl=(e,t)=>ol(e,t,!0)===0,ll=e=>{let t=[];for(let n of e){let e=dl(n,t);e.isFound||t.splice(e.index,0,n)}return t},ul=(e,t)=>{let n=hu.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},dl=(e,t)=>{let n=0,r=t.length;for(;n<r;){let i=n+(r-n>>1),a=ul(e,()=>sl(e,t[i]));if(a===0)return{index:i,isFound:!0};a<0?r=i:n=i+1}return{index:n,isFound:!1}},fl=(e,t)=>t.some(t=>ul(t,()=>cl(t,e))),pl=e=>e.kind===`MixedSet`||e.isNormalized?e.elements:e.writtenElements??e.elements,ml=e=>{typeof e==`object`&&(e.kind===`Set`&&(e.isNormalized=!0,e.elements.forEach(ml)),e.kind===`Function`&&(e.writtenKeys=void 0,e.domain.forEach(ml),e.range.forEach(ml)))},hl=e=>{if(!(typeof e!=`object`||Fc(e)))switch(e.kind){case`Set`:e.isNormalized=!0;return;case`MixedSet`:G(e);return;case`FilteredSet`:case`Subset`:return hl(e.base);case`SetOperation`:return e.operator===`\\cup`?void 0:(hl(e.left),hl(e.right));case`FunctionSet`:return hl(e.domain),hl(e.range);case`RecordSet`:return e.sets.forEach(hl);case`ProductSet`:return e.factors.forEach(hl)}},gl=(e,t)=>gu(Vc,cl,e,t),_l=e=>{for(let t=1;t<e.length;t++)if(Cc(e[t-1],e[t])>=0)return!1;return!0},vl=e=>{for(let t=0;t<e.length;t++){let n=e[t],r=t>0?e[t-1]:void 0;if(typeof n!=`number`||typeof r==`number`&&r>=n)return!1}return!0},yl=e=>{for(let t=1;t<e.length;t++)zc(e[t]);if(e.length<2||_l(e))return Oc(e);let t=[...e].sort(Cc),n=[t[0]];for(let e=1;e<t.length;e++)Cc(n[n.length-1],t[e])!==0&&n.push(t[e]);return Oc(n)},bl=e=>{if(vl(e))return Oc(e);let t=gu(yl,e=>({kind:`MixedSet`,elements:e}),e,void 0);return t.kind===`Set`&&t.elements!==e&&(t.writtenElements=e),t},xl=Oc([]),Sl=(e,t)=>{if(e.elements.length===0||t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&Cc(r[a],t)<0;)a++;a<r.length&&Cc(r[a],t)===0||i.push(t)}return i.length===n.length?e:Oc(i)},Cl=(e,t)=>{let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&Cc(r[a],t)<0;)a++;a<r.length&&Cc(r[a],t)===0&&i.push(t)}return i.length===n.length?e:Oc(i)},wl=(e,t)=>{if(e.elements.length===0)return t;if(t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=[],o=0,s=0;for(;o<n.length&&s<r.length;){let e=Cc(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=Oc(i);if(e.hash!==0&&e.hash!==Ku){let t=e.hash,n=0;for(;n<a.length;n++){let e=Zu(a[n]);if(e===Ku)break;t=t+Wu(e)|0}n===a.length&&(c.hash=t)}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+ed(a[e])|0;c.fingerprint=t}return c},Tl=e=>{let t=e.length<2?e:[...e].sort((e,t)=>Cc(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&Cc(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return Ac(n,r)},El=e=>{let t=Tl(e);return t.domain.length!==e.length||e.every((e,n)=>e[0]===t.domain[n])?t:Hs(t,e.map(e=>e[0]))},Dl=[],Ol=/* @__PURE__ */ new Map,kl=[],Al=/* @__PURE__ */ new WeakMap,jl=e=>{let t=Dl[e]??Ol.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?Ol.set(e,new WeakRef(n)):Dl[e]=n,n},Ml=e=>{if(cu(e),e.low===1&&e.high>=1)return jl(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},Nl=e=>e.length>0&&(e===Dl[e.length]||e===Ol.get(e.length)?.deref())||Al.has(e),Pl=e=>{let t=G(e).elements;return Nl(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Fl=e=>{let t=kl[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return kl[e]=n,n},Il=e=>Mc(Ac(jl(e.length),e),`tuple`),Ll=e=>Mc(Tl(e),`record`),Rl=(e,t)=>Mc(Ac(e,t),`record`),zl=e=>Ps(e)&&!gc(e),Bl=(e,t=!1)=>`UNION(${q(e.base,t)})`,Vl=(e,t=e=>G(e).elements)=>{if(!zl(e.base))throw new w(`Attempted to enumerate the nonenumerable set:\n${Bl(e)}`);return t(e.base)},Hl=(e,t,n)=>{if(zl(e))return e;throw new w(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${U(q(e))}\nwhen enumerating:\n${U(Bl(n))}`)},W=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return W(e.base);case`FunctionSet`:return W(e.domain)&&W(e.range)||Ul(e.domain)===!0||Ul(e)===!0;case`RecordSet`:return e.sets.every(W)||Ul(e)===!0;case`ProductSet`:return e.factors.every(W)||Ul(e)===!0;case`Union`:return W(e.base)&&(Rs(e.base)?pl(e.base):eu(e.base)).every(W);case`SetOperation`:return e.operator===`\\cup`?W(e.left)&&W(e.right):e.operator===`\\cap`?W(e.left)||W(e.right):W(e.left);default:return!1}},Ul=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:return e.name===`Any`&&void 0;case`Subset`:case`SequenceSet`:return!1;case`FunctionSet`:{let t=Ul(e.domain);return t===void 0?void 0:!t&&Ul(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=Ul(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return W(e)?G(e).elements.length===0:void 0;default:return}},Wl=e=>{let t=e.reduce((e,t)=>e*t.length,1),n=[],r=e.map(()=>0);for(let i=0;i<t;i++){n.push(e.map((e,t)=>e[r[t]]));for(let t=e.length-1;t>=0&&(r[t]++,!(r[t]<e[t].length));t--)r[t]=0}return n},Gl=(e,t)=>{for(let n=e.length-1;n>=0;n--)if(e[n]<t-e.length+n){e[n]++;for(let t=n+1;t<e.length;t++)e[t]=e[t-1]+1;return!0}return!1},Kl=e=>{if(typeof e!=`object`||e.kind!==`Subset`||gc(e.base))return;let t=G(e.base).elements;if(t.length<=20)return;let n=-1,r=[0],i=e=>{for(e<=n&&(n=-1);n<e;)n===-1?r=[]:Gl(r,t.length)||(r=Array.from({length:r.length+1},(e,t)=>t)),n++;return Oc(r.map(e=>t[e]))},a=2**t.length,o=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<a;return new Proxy([],{get:(e,t,n)=>t===`length`?a:o(t)?i(Number(t)):Reflect.get(e,t,n),has:(e,t)=>o(t)||Reflect.has(e,t)})},ql=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(Oc(r.map(t=>e[t])));while(Gl(r,e.length))}return t},Jl=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(gc(a))throw new w(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},Yl=(e,t=e=>G(e).elements)=>{if(typeof e!=`object`)throw new w(`Expected a set but found ${q(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return ll(e.elements);case`Interval`:{let t=Ml(e);return t!==Dl[t.length]&&Al.set(t,e),t}case`Subset`:{if(cu(e.base)===0)return ql([]);if(!Ps(e.base))throw new w(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${U(q(e.base))}`);let t=G(e.base).elements;if(t.length>30)throw new w(su(e));return ql(t)}case`FunctionSet`:{if(!oc&&au(e))return[];if(gc(e.domain))throw new w(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${U(q(e.domain))}\ncannot be enumerated.`);let n=Pl(e.domain);if((n.length>0||oc)&&gc(e.range))throw new w(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${U(q(e.range))}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return Wl(n.map(()=>r)).map(e=>Ac(n,e))}case`RecordSet`:{if(!oc&&au(e))return[];let n=Jl(e.sets,t,(t,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${U(q(t))}`);return Wl(n).map(t=>Ll(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!oc&&au(e))return[];let n=Jl(e.factors,t,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${U(q(e))}`);return Wl(n).map(Il)}case`FilteredSet`:if(!Ps(e.base)||gc(e.base))throw new w(`Attempted to enumerate { x \\in S : p(x) } when S:\n${U(q(e.base))}\nis not enumerable`);return G(bl(eu(e.base).filter(e.startPass?.(!0)??(t=>e.test(t,!1))))).elements;case`Union`:{let t=[];return Vl(e).forEach((n,r)=>{let i=Hl(n,r,e);if(Ms(i))throw new u(As());eu(i).forEach(e=>js(t,e))}),G(bl(t)).elements}case`SetOperation`:{if(e.operator===`\\cap`&&!zl(e.left)&&!zl(e.right))throw new w(`Attempted to enumerate S \\cap T when neither S:\n${U(q(e.left))}\nnor T:\n${U(q(e.right))}\nis enumerable`);if(e.operator===`\\`&&!zl(e.left))throw new w(`Attempted to enumerate S \\ T when S:\n${U(q(e.left))}\nis not enumerable.`);if(e.operator===`\\cup`)return G(bl(Zl(e))).elements;let t=e.operator===`\\`||zl(e.left),n=t?e.left:e.right,r=t?e.right:e.left,i=[];return Ns(typeof n==`object`&&n.kind===`Interval`?n:eu(n),t=>{vu(t,r)===(e.operator===`\\cap`)&&js(i,t)}),G(bl(i)).elements}case`InfiniteSet`:case`SequenceSet`:throw new w(`Attempted to enumerate the non-enumerable set ${q(e)}`);default:throw new w(`Expected a set but found ${q(e)}`)}},G=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return Oc(Yl(e));let t=typeof e==`object`&&ws(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=hu.sets;n?.push(e);let r=Yl(e);n?.pop();let i=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?Oc(r):yl(r);return t&&(t.enumerated=i),i},Xl=e=>{if(!(typeof e!=`object`||Fc(e)))switch(e.kind){case`MixedSet`:G(e);return;case`FilteredSet`:return zl(e.base)||G(e),Xl(e.base);case`Union`:if(!Rs(e.base)&&zl(e.base))return Xl(e.base);Vl(e).slice(0,1).forEach(t=>Xl(Hl(t,0,e)));return;case`SetOperation`:e.operator===`\\`&&!zl(e.left)&&G(e),e.operator!==`\\cup`||zl(e.left)&&zl(e.right)||G(e),e.operator!==`\\cap`||zl(e.left)?Xl(e.left):Xl(e.right),e.operator===`\\cup`&&Xl(e.right)}},Zl=e=>{if(!zl(e.left)||!zl(e.right))throw new w(`Attempted to enumerate S \\cup T when S:\n${U(q(e.left))}\nand T:\n${U(q(e.right))}\nare not both enumerable`);if(Xl(e.left),Xl(e.right),Ms(e.left))throw new u(As());let t=eu(e.left),n=Ms(e.right)?void 0:eu(e.right);if(!n||t.length+n.length>ks())throw new u(As());return[...t,...n]},Ql=e=>{if(typeof e!=`object`||e.kind!==`SetOperation`||e.operator!==`\\cup`||e.enumerated)return G(e).elements;let t=ul(e,()=>Zl(e)),n=G(bl(t)).elements;return e.enumerated=Oc(n),n},$l=(e,t)=>{if(typeof e!=`object`||Fc(e))return G(e).elements.some(t);let n=hu.sets;n?.push(e),Xl(e);let r=iu(e,r=>{n?.pop();let i=t(r);return n?.push(e),i});return n?.pop(),r},eu=e=>{let t=[];return $l(e,e=>(t.push(e),!1)),t},tu=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,nu=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(nu);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(nu)&&e.range.every(nu);case`SetOperation`:return e.operator!==`\\cup`&&nu(e.left)&&nu(e.right);case`FilteredSet`:return nu(e.base);case`ProductSet`:return e.factors.every(nu);default:return!1}},ru=e=>typeof e!=`object`||Fc(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?ru(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||ru(e.left)||ru(e.right):tu(e)?.some(ru)??!1,iu=(e,t)=>{if(e.kind===`Union`)return Vl(e,eu).some((n,r)=>$l(Hl(n,r,e),t));if(e.kind===`FilteredSet`&&zl(e.base)){let n=e.startPass?.(!1);return n?$l(e.base,e=>n(e)&&t(e)):$l(e.base,n=>e.test(n,!1)&&t(n))}if(tu(e)?.some(ru))return Yl(e,eu).some(t);if(e.kind!==`SetOperation`)return G(e).elements.some(t);if(e.operator===`\\cup`)return!zl(e.left)||!zl(e.right)?G(e).elements.some(t):$l(e.left,t)||$l(e.right,t);let n=e.operator===`\\`||zl(e.left),r=n?e.left:e.right,i=n?e.right:e.left;return zl(r)?$l(r,n=>vu(n,i)===(e.operator===`\\cap`)&&t(n)):G(e).elements.some(t)},au=e=>{if(typeof e!=`object`||!Ps(e))throw hu.sets?.push(e),new w(`Shouldn't call isEmpty() on value ${q(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new w(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(au);case`RecordSet`:return e.sets.some(au);case`FunctionSet`:return!au(e.domain)&&au(e.range);case`Union`:return Vl(e).every((t,n)=>au(Hl(t,n,e)));default:return G(e).elements.length===0}},ou=(e,t,n)=>e.reduce((e,r)=>{let i=e*cu(r,t);if(i>2147483647)throw new w(n());return i},1),su=e=>`Overflow when computing the number of elements in:\n${U(q(e))}`,cu=(e,t)=>{if(typeof e!=`object`)throw new w(`Attempted to compute the number of elements in the ${zs(e)} ${U(q(e))}.`);switch(e.kind){case`ModelValue`:throw new w(`Attempted to compute the number of elements in the model value ${U(q(e))}.`);case`Function`:return e.domain.length;case`LazyFunction`:return cu(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new w(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new w(`Attempted to compute the number of elements in the overridden value ${U(q(e))}.`);case`Subset`:{let n=cu(e.base,t);if(n>=31)throw new w(su(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(au(e.domain))return 1;if(au(e.range))return 0;if(cu(e.range,t)===1)return 1}let n=cu(e.domain,t),r=cu(e.range,t);if(r<=1)return n===0?1:r;let i=1;for(let t=0;t<n;t++)if(i*=r,i>2147483647)throw new w(su(e));return i}case`RecordSet`:return t!==`1.7.4`&&au(e)?0:ou(e.sets,t,()=>su(e));case`ProductSet`:return t!==`1.7.4`&&au(e)?0:ou(e.factors,t,()=>`Overflow when computing the number of elements in ${U(q(e))}`);default:return zc(e),G(e).elements.length}},lu=e=>`Attempted to check if the set ${U(q(e))}is finite.`,uu=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new w(`Attempted to check if the ${zs(e)} ${U(q(e))} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new w(`Attempted to check if the function:\n${U(q(e))}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return uu(e.base)&&au(e.base);case`Subset`:return uu(e.base);case`FunctionSet`:{let t=uu(e.domain);if(t&&au(e.domain))return!0;let n=uu(e.range);return n&&au(e.range)?!0:n&&(t||cu(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n=!0;for(let e of t)if(!uu(e))n=!1;else if(au(e))return!0;return n}case`Union`:if(!zl(e.base))throw new w(`Attempted to check if the nonenumerable set:\n${Bl(e)}\nis a finite set.`);return G(e.base).elements.every(uu);case`SetOperation`:if(e.operator===`\\cup`)return uu(e.left)&&uu(e.right);if(e.operator===`\\cap`){if(!uu(e.left)&&!uu(e.right))throw new w(lu(e));return!0}if(uu(e.left))return!0;if(!uu(e.right))throw new w(lu(e));return!1;case`FilteredSet`:if(!uu(e.base))throw new w(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${U(q(e.base))}\nis finite.`);return!0}},du=(e,t,n=Cc)=>{let r=0,i=e.length-1;for(;r<=i;){let a=r+i>>1,o=n(e[a],t);if(o===0)return a;o<0?r=a+1:i=a-1}return-1},fu=(e,t)=>{let n=e.elements;if(n.length>ks())throw new u(As());let r=Array.from({length:n.length},()=>!1),i=t.filter(e=>{let t=du(n,e);return!r[t]&&(r[t]=!0,!0)}),a=Oc(n);return i.some((e,t)=>e!==n[t])&&(a.writtenElements=i),a},pu=e=>{if(typeof e!=`object`||!Is(e))return;if(e.kind===`LazyFunction`&&(!Ps(e.domain)||gc(e.domain)))throw new w(`To convert a function of form [x \\in S |-> f(x)] to a tuple, the set S must be enumerable.`);let t=K(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},mu=(e,t)=>{let n=`Attempted to check if the value:\n${U(q(e))}\nis an element of the`;if(!Is(t))return`${n} ${zs(t)} ${U(q(t))}`;let r=Nc(t);return r===`record`?`Attempted to check if element:\n${U(q(e))}\nis in the record:\n${U(q(t))}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${U(q(t))}`},hu={sets:void 0},gu=(e,t,n,r)=>{let i=hu.sets,a=hu.callStack,o=i?.length??0,s=a&&{...a,length:a.expressions.length};try{return e(n,r)}catch(e){if(!(e instanceof w))throw e;return i&&(i.length=o),a&&s&&(a.expressions.length=s.length,a.isFrozen=s.isFrozen,a.fingerprint=s.fingerprint),t(n,r,e)}},_u=e=>(hu.sets??[]).slice(e).some(e=>typeof e==`object`&&hu.callStack?.sources.has(e)===!0),vu=(e,t)=>{let n=hu.sets;if(n===void 0)return Cu(e,t);n.push(t);let r=Cu(e,t);return n.pop(),r},yu=(e,t)=>{let n=t.elements,r=0,i=n.length-1;for(;r<=i;){let t=r+i>>1,a=n[t];if(typeof a!=`number`)return;if(a===e)return!0;a<e?r=t+1:i=t-1}return!1},bu=(e,t)=>du(t.elements,e)!==-1,xu=(e,t)=>t.isNormalized?dl(e,t.elements).isFound:fl(e,pl(t)),Su=(e,t)=>{if(e.type!==void 0)throw new w(`Attempted to check if the typed model value ${U(q(e))} is an element of\n${U(q(t))}`);return!1},Cu=(e,t)=>{if(typeof e==`number`&&typeof t==`object`){if(t.kind===`Set`)return yu(e,t)??wu(e,t);if(t.kind===`Interval`)return e>=t.low&&e<=t.high}return wu(e,t)},wu=(e,n)=>{if(!Ps(n))throw new w(mu(e,n));switch(n.kind){case`Set`:return zc(e),gu(bu,xu,e,n);case`MixedSet`:return fl(e,n.elements);case`Interval`:if(typeof e==`number`)return e>=n.low&&e<=n.high;if(n.low<=n.high&&(!Ls(e)||e.type!==void 0))throw new w(`Attempted to check if the value:\n${U(q(e))}\nis in the integer interval ${U(q(n))}`);return!1;case`InfiniteSet`:if(n.name===`Any`)return!0;if(Ls(e))return Su(e,n);if(!(n.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new t(`Attempted to check if the value:\n${U(q(e))}\nis an element of ${n.name}.`);return n.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!Ps(e)||gc(e))throw new w(`Attempted to check if the non-enumerable value\n${U(q(e))}\nis element of\n${U(q(n))}`);return G(e).elements.every(e=>vu(e,n.base));case`FunctionSet`:{if(!Is(e)){if(Ls(e))return Su(e,n);throw new w(`Attempted to check if \n${q(e)}\nwhich is not a TLC function value, is in the set of functions:\n${U(q(n))}`)}Js(e);let t=K(e),r=qc(e,t.domain);return(r===void 0?gl(n.domain,Oc(t.domain)):gl({kind:`Interval`,low:r,high:r+t.domain.length-1},n.domain))&&t.range.every(e=>vu(e,n.range))}case`RecordSet`:{Js(e);let t=Is(e)?K(e):void 0;if(!t||!Ys(t.domain)){if(Ls(e))return Su(e,n);throw new w(`Attempted to check if non-record\n${q(e)}\nis in the set of records:\n${U(q(n))}`)}return t.domain.length===n.names.length&&n.names.every((e,r)=>{let i=du(t.domain,e);return i!==-1&&vu(t.range[i],n.sets[r])})}case`ProductSet`:{let t=Is(e)?pu(e):void 0;if(t===void 0){let t=Is(e)&&K(e).domain.every(e=>typeof e==`number`);if(Ls(e))return Su(e,n);if(t)return!1;throw new w(`Attempted to check if non-tuple\n${U(q(e))}\nis in the set of tuples:\n${U(q(n))}`)}return t.length===n.factors.length&&t.every((e,t)=>vu(e,n.factors[t]))}case`FilteredSet`:try{return vu(e,n.base)&&n.test(e,!0)}catch(t){throw!(t instanceof w)||!as(t)?t:new w(`Cannot decide if element:\n${U(q(e))}\n is element of:\n${U(q(n.base))}\nand satisfies the predicate ${n.source?.predicate}`)}case`Union`:{if(!zl(n.base))throw new w(`Attempted to check if:\n ${U(q(e))}\nis an element of the non-enumerable set:\n ${U(Bl(n))}`);let t=G(n.base).elements;return t.length>1&&t.forEach(e=>{typeof e==`object`&&e.kind===`Set`&&(e.isNormalized=!0)}),t.some(t=>vu(e,t))}case`SetOperation`:return n.operator===`\\cup`?vu(e,n.left)||vu(e,n.right):vu(e,n.left)&&vu(e,n.right)===(n.operator===`\\cap`);case`SequenceSet`:{let r=pu(e);if(r===void 0){if(Ls(e))return Su(e,n);throw new t(`Attempted to check if the value:\n${U(q(e))}\nis an element of ${U(q(n))}.`)}return r.every(e=>vu(e,n.base))}default:throw new w(mu(e,n))}},Tu=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?vu(e,n):e.range.every((e,r)=>Tu(e,t.range[r],n.range)),K=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return e.enumerated;if(W(e.domain)||cu(e.domain),!Ps(e.domain))throw new w(`The domains of formal parameters must be enumerable.`);let t=Pl(e.domain);return e.enumerated=Ac(t,t.map(t=>e.apply(t))),e.enumerated}throw new w(`Expected a function but found ${q(e)}`)},Eu=(e,t,n)=>{let r=U(q(e)),i=U(q(t)),a=n===`1.7.4`;switch(Nc(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},Du=(e,t)=>{if(!oc)return Eu(e,t);let n=U(q(t));return Nc(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},Ou=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}return e.length<=8?e.indexOf(t):-1},ku=e=>new w(`Attempted to apply function with integer domain to the non-integer argument ${U(q(e))}`),Au=(e,t)=>du(e.domain,t),ju=(e,t,n)=>{let r=Us(e);throw oc||r!==e.domain||r.length<32?r.forEach(e=>cl(e,t)):du(r,t,sl),n},Mu=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=Nc(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new w(n(e,t));if(a===void 0&&!oc&&typeof t!=`number`&&Nl(r))throw ku(t)}let i=Ou(r,t);return i===-1?gu(Au,ju,e,t):i},Nu=(e,t,n,r)=>`In applying the function\n${U(q(e))},\nthe ${t} is:\n${U(q(n))}\nwhich ${r}.\n`,Pu=(e,t)=>new w(Nu(e,`argument list`,t,`does not match its formal parameter`)),Fu=(e,t,n)=>{let r=e.domain,i=pu(n);if(i===void 0)throw Pu(e,n);if(typeof r!=`object`||r.kind!==`ProductSet`)throw new w(`Attempted to apply a function to ${q(n)}, which is not in its domain`);if(t.forEach((t,a)=>{if(a>=i.length)throw Pu(e,n);let o=i[a],s=`argument number ${a+1}`;if(!vu(o,r.factors[a]))throw new w(Nu(e,s,o,t===void 0?`is not in the function's domain ${q(r)}`:`is not in its domain`));if(t!==void 0&&pu(o)?.length!==t)throw new w(Nu(e,s,o,`does not match its formal parameter`))}),i.length>t.length)throw Pu(e,n)},Iu=(e,t)=>e.lambdaDomain!==void 0&&e.hash===0&&e.fingerprint===0&&!vu(t,e.lambdaDomain),Lu=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return Lu(e.enumerated,t,n);let r=e.boundTupleLengths;if(r!==void 0)return Fu(e,r,t),e.apply(t);if(!vu(t,e.domain))throw new w(Nc(e)===`lambda`?Eu(e,t):`Attempted to apply a function to ${q(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new w(`Attempted to apply ${q(e)}, which is not a function`);let r=n??Eu;if(Iu(e,t))throw new w(r(e,t));let i=Mu(e,t,r);if(i===-1)throw new w(r(e,t));return e.range[i]},Ru=e=>Nl(e)?Al.get(e)??Fl(e.length):void 0,zu=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=K(e);if(t.functionClass===`lambda`&&t.lambdaDomain)return t.lambdaDomain;let n=Ru(t.domain);if(n)return n;let r=Oc(t.domain);return t.functionClass===`record`?(t.writtenKeys&&(r.writtenElements=t.writtenKeys),r):(r.isNormalized=!0,r)},Bu=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||e.enumerated===void 0)){if(e.boundTupleLengths!==void 0&&pu(t)===void 0)throw Pu(e,t);if(!vu(t,e.domain))return e;let r=n(e.apply(t));return Mc({kind:`LazyFunction`,domain:e.domain,apply:n=>gl(t,n)?r:e.apply(n),source:e.source,boundTupleLengths:e.boundTupleLengths},Nc(e))}if(!Is(e))throw new w(`Attempted to apply EXCEPT construct to the value ${U(q(e))}.`);let i=K(e);if(Iu(i,t))return i;let a=Mu(i,t,Du);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=Mc(Ac(i.domain,o),Nc(i));if(l.writtenKeys=i.writtenKeys,l.lambdaDomain=i.lambdaDomain,i.hash!==0&&i.hash!==Ku){let e=Zu(c);if(e!==Ku){let t=Zu(i.domain[a]);l.hash=s===c?i.hash:i.hash-Gu(t,Zu(s))+Gu(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-td(e,s)+td(e,c)|0}return l},Vu=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Hu=(e,t)=>Math.imul(e^t,16777619),Uu=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return Vu(t)},Wu=e=>Vu(e+2654435769|0),Gu=(e,t)=>Vu(Math.imul(e,668265261)+t|0),Ku=795548749,qu=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Zu(t[e]);if(r===Ku)return Ku;n=n+Wu(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=Zu(e.domain[n]),i=Zu(e.range[n]);if(r===Ku||i===Ku)return Ku;t=t+Gu(r,i)|0}return t},Ju=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new w(`TLC has found a state in which the value of a variable contains ${U(q(e))}`);if(Ps(e)){G(e).elements.forEach(Ju);return}let t=K(e);t.domain.forEach(Ju),t.range.forEach(Ju)},Yu=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{Zu(e)===Ku&&Ju(e);return}catch(e){if(!(e instanceof w))throw e;return e}},Xu=e=>{switch(e.kind){case`Set`:case`MixedSet`:return e.elements;case`Function`:return[...e.domain,...e.range];case`Subset`:case`SequenceSet`:case`FilteredSet`:case`Union`:return[e.base];case`FunctionSet`:return[e.domain,e.range];case`RecordSet`:return e.sets;case`ProductSet`:return e.factors;case`SetOperation`:return[e.left,e.right];case`LazyFunction`:return[e.domain];default:return[]}},Zu=e=>typeof e==`number`?Vu(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?Uu(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=qu(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?W(e.domain)?Zu(K(e)):Ku:W(e)?Zu(G(e)):Ku,Qu=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},$u=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Qu(t)},ed=e=>Qu(rd(e)+2135587861|0),td=(e,t)=>Qu(Math.imul(rd(e),374761393)+rd(t)|0),nd=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+ed(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+td(e.domain[n],e.range[n])|0;return t},rd=e=>typeof e==`number`?Qu(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?$u(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=nd(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?rd(K(e)):W(e)?rd(G(e)):$u(id(e)),id=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):ad(e),ad=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${id(e.base)}>`;if(e.kind===`FilteredSet`&&!W(e))throw new w(`Attempted to compare the non-enumerable set ${q(e)} with another value`);if(Ps(e))return W(e)?`{${G(e).elements.map(id).join(`,`)}}`:`<${e.kind} ${q(e)}>`;let t=K(e);return`(${t.domain.map((e,n)=>`${id(e)}:${id(t.range[n])}`).join(`,`)})`},od={'"':`\\"`,"\\":`\\\\`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`},sd=e=>`"${e.replace(/["\\\t\n\f\r]/g,e=>od[e])}"`,cd=1999,ld=e=>e.reduce((e,t)=>e===0?0:e*cu(t),1),ud=e=>{if(e.kind===`Subset`)return cu(e.base)<=6?G(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return G(e);if(e.kind===`FunctionSet`){let t=au(e.domain)?0:cu(e.domain);return(t===0?1:cu(e.range)**t)<=cd?G(e):void 0}return ld(e.kind===`RecordSet`?e.sets:e.factors)<=cd?G(e):void 0},dd=(e,t)=>{if(t||e.kind===`Union`||e.kind===`Subset`&&Is(e.base)&&(e.base.kind===`Function`||W(e.base.domain)))return ud(e);if(W(e))try{return ud(e)}catch(e){if(e instanceof w)return;throw e}},fd=(e,t)=>{let n=e=>q(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return Bl(e,t)}},pd=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),md=e=>{if(W(e.domain))try{return K(e)}catch(e){if(e instanceof w||te(e))return;throw e}},hd=e=>{let t=[],n=[],r=[],i=(e,a,o)=>{if(typeof e!=`object`)return;let s=e=>i(e,a,!1);switch(e.kind){case`Set`:if(e.elements.forEach(s),e.isNormalized)return;e.isNormalized=!0,t.push(e);return;case`MixedSet`:e.elements.forEach(s),G(e);return;case`Function`:{let t=a||Nc(e)===`lambda`;if(e.range.forEach(e=>i(e,t,o)),a||e.writtenKeys===void 0)return;n.push([e,e.writtenKeys]),e.writtenKeys=void 0;return}case`LazyFunction`:if(e.enumerated)return i(e.enumerated,!0,o);o&&r.push(e),s(e.domain);return;case`SetOperation`:s(e.left),s(e.right);return;case`FunctionSet`:s(e.domain),s(e.range);return;case`RecordSet`:e.sets.forEach(s);return;case`ProductSet`:e.factors.forEach(s);return;case`Subset`:case`Union`:case`FilteredSet`:case`SequenceSet`:s(e.base);return;default:return}};try{return e.forEach(e=>i(e,!1,!0)),e.map(e=>q(e,!0,!0))}finally{t.forEach(e=>{e.isNormalized=!1}),r.forEach(e=>{e.enumerated=void 0}),n.forEach(e=>{e[0].writtenKeys=e[1]})}},q=(e,t=!1,n=!1)=>{let r=e=>q(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return sd(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(G(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=sc.isExpanded?dd(e,t):void 0;return n?r(n):fd(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?sc.isExpanded||!e.source?md(e):void 0:e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${q(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&oc&&Nc(e)!==`tuple`)return`<< >>`;let a=r=>q(r,t,n&&Nc(e)!==`lambda`);if(i.domain.length===0&&Nc(e)===`record`)return`[]`;if(i.domain.every((e,t)=>e===t+1))return`<<${i.range.map(a).join(`, `)}>>`;let o=n?i.domain.map((e,t)=>[e,i.range[t]]):Gs(i);return Nc(e)===`record`||i.domain.every(e=>typeof e==`string`&&pd(e))?`[${o.map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${o.map(e=>`${r(e[0])} :> ${a(e[1])}`).join(` @@ `)})`}}},gd=(e,t)=>{if(e===void 0)return!1;try{return Vc(e,t)}catch(e){if(e instanceof w)return!1;throw e}},_d=/%(\d+\$)?([-#+ 0,(<]*)(\d+)?(\.\d+)?(.?)/gs,vd=(e,t)=>{let n=0,r=-1,i=!0,a=e.replace(_d,(e,a,o=``,s,c,l=``)=>{let u=e=>o.includes(`-`)?e.padEnd(Number(s)):e.padStart(Number(s??0)),d=o.includes(`<`),f=o.replace(`<`,``);if(l===`n`&&e===`%n`)return`
|
|
400
|
+
`;if(l===`%`&&c===void 0&&/^-?$/.test(f))return f===`-`&&s===void 0&&(i=!1),u(`%`);let p=d?r:a===void 0?n++:Number(a.slice(0,-1))-1;r=p;let m=t[p];if(!`sSbBhH`.includes(l)||l===``||!/^-?$/.test(f)||f===`-`&&s===void 0||m===void 0)return i=!1,e;let h=l.toLowerCase(),g=h===`s`?m:h===`b`?`true`:(bi(m)>>>0).toString(16),_=u(c===void 0?g:g.slice(0,Number(c.slice(1))));return l===h?_:_.toUpperCase()});return i?a:void 0},yd=(e,t)=>{let n=t?void 0:lc.get(e);if(n)return n();let r=Object.entries(e),i=dc.get(e),a=i!==void 0&&`_format`in e,o=a?e._format:r.length===1?`%s = %s
|
|
401
|
+
`:`/\\ %s = %s
|
|
402
|
+
`;if(typeof o!=`string`)throw new _(`The _format field of the ALIAS ${i} is ${q(o)}, but it must be a string.`);return r.filter(e=>!(a&&e[0]===`_format`)).filter(e=>!t||!gd(t[e[0]],e[1])).map(e=>{let t=vd(o,[e[0],U(q(e[1]))]);if(t===void 0)throw new _(`The _format field of the ALIAS ${i} is ${q(o)}, but it must format two strings, the name and the value of a field.`);return t}).join(``)},bd=[10454148508367108822n,15747411856486957441n,13848313129918172575n,15427004735118145554n,14338780731064426356n,15931650522396165332n,17670238537108149059n,12816660938095048951n,13192168525635896882n,16119298732711755075n,13564417994159519395n,15831473429641889162n,17671735485712653535n,14582471876431321160n,9288673424107444897n,12345523232675890545n,13774063780198914517n,10636128657019767374n,13227535641082688945n,10085966873248490402n,17056045221983369811n,18027133543548002442n,13033986364717636900n,12663388180492401538n,11007194744055901935n,16251515628090973732n,18046429724439772544n,9876734796024595817n,14949643787442512870n,16960057143726945461n,10590203213448744021n,12248592797044284137n,9558805810925624286n,16993321702164258530n,11754329512098378960n,12074934892440206921n,15696745233288286746n,10531590977001201739n,18107999685377398317n,12149369488538049728n,12923655455904407421n,10507099144397364930n,17322088528956367024n,14653973644796244054n,15165509594857513400n,13554280709034297251n,16228911470502883382n,17115369786458865383n,11179220607102683830n,16708422618246866334n,12295941796329322556n,18336630348474106240n,13989616001589685348n,14822072159597151759n,14264172520427195041n,11642530518213145397n,11877331515501935358n,13913116192159715440n,17054474839259161580n,13461230878584418056n,16058025410470398786n,11100471369705097435n,11133782763824505275n,13192312712502684421n,17456091706045076157n,13237272598629075916n,12914531898895761383n,15801841604014567326n,16446055517513626294n,16780923767715884464n,15104658705803254918n,10882049990920163451n,12728112724252049190n,11720209067562733740n,16476221075563830086n,16602801460297162326n,16206898064012585915n,12158475401238648099n,13742285336487677729n,15543703592025073839n,9615783578189153721n,16710542608962839044n,11960730242263336692n,13328718558362718101n,12971616006464047952n,17057853503483465676n,16180230282101315295n,15483523553568578902n,17773465781871025571n,18047252642493037509n,11580640560664688668n,10121963531818974651n,14218267149826330657n,12715294421139777506n,10584764766358778171n,12666843443693621286n,17403948736867619210n,17907955559063099692n,15179434392748515198n,15413469521140985247n,13455040338347572751n,15419348191054617477n,12340568220039846914n,13236419189535069162n,18074463254581147189n,10818750974828329405n,9859349269386152082n,15035006154709018396n,13627907273947709876n,9549035931546940138n,16199589727945564820n,10285831968679942330n,17737018494601061698n,15477896647372134857n,13595764249822586512n,10556855812148546550n,12421897615105552821n,15477767459253848096n,17421607461439241175n,12409061346569762725n,13621778224251023638n,10680972825126675886n,16494492050207190715n,16801324317763555620n,12664650400804916358n,16134230614391269483n,10027806175083075147n,9259037851175017999n,11803214621941906429n,9537357587847606069n,10517495000576890277n];let xd=bd[0];const Sd=()=>xd,Cd=/* @__PURE__ */ new Int32Array(256),wd=/* @__PURE__ */ new Int32Array(256),Td=/* @__PURE__ */ new Int32Array(256),Ed=/* @__PURE__ */ new Int32Array(256),Dd=/* @__PURE__ */ new Int32Array(256),Od=/* @__PURE__ */ new Int32Array(256),kd=/* @__PURE__ */ new Int32Array(256),Ad=/* @__PURE__ */ new Int32Array(256);let jd=0,Md=0,Nd=0,Pd=0;const Fd=e=>{let t=(e^Pd)&255;Pd=(Pd>>>8|Nd<<24)^Dd[t],Nd=Nd>>>8^Cd[t]},Id=e=>{let t=bd[e];xd=t;let n=[];for(let e=1n<<63n;n.length<72;)n.push(e),e=e>>1n^((e&1n)==0n?0n:t);let r=n.slice(64,72).reverse();for(let e=0;e<256;e++){let t=r.reduce((t,n,r)=>e>>r&1?t^n:t,0n);Cd[e]=Number(BigInt.asIntN(32,t>>32n)),Dd[e]=Number(BigInt.asIntN(32,t))}let i=[Cd,wd,Td,Ed],a=[Dd,Od,kd,Ad];for(let e=1;e<4;e++){let t=i[e-1],n=a[e-1];for(let r=0;r<256;r++){let o=n[r]&255;a[e][r]=(n[r]>>>8|t[r]<<24)^Dd[o],i[e][r]=t[r]>>>8^Cd[o]}}jd=Number(BigInt.asIntN(32,t>>32n)),Md=Number(BigInt.asIntN(32,t))};Id(0);const Ld=e=>{let t=Pd^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;Pd=Nd^Ad[n]^kd[r]^Od[i]^Dd[a],Nd=Ed[n]^Td[r]^wd[i]^Cd[a]},Rd=e=>{if(typeof e==`boolean`)return Fd(0),Fd(e?116:102),2;if(typeof e==`number`)return Fd(1),Ld(e),5;if(typeof e==`string`){Fd(3),Ld(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)Ld(e.charCodeAt(n)&255|(e.charCodeAt(n+1)&255)<<8|(e.charCodeAt(n+2)&255)<<16|(e.charCodeAt(n+3)&255)<<24);for(let n=t;n<e.length;n++)Fd(e.charCodeAt(n));return 5+e.length}return Fd(21),Ld(mc(e.name)+1),5},zd=e=>{let t=Nd,n=Pd;Nd=0,Pd=0;let r=[Rd(e),Nd,Pd];return Nd=t,Pd=n,r},Bd=e=>`m = (${e} ^ l) & 255; l = ((l >>> 8) | (h << 24)) ^ L0[m]; h = (h >>> 8) ^ H0[m];`,Vd=e=>`m = l ^ ${e}; l = h ^ L3[m & 255] ^ L2[(m >>> 8) & 255] ^ L1[(m >>> 16) & 255] ^ L0[m >>> 24]; h = H3[m & 255] ^ H2[(m >>> 8) & 255] ^ H1[(m >>> 16) & 255] ^ H0[m >>> 24];`,Hd={integer:e=>`${Bd(`1`)} ${Vd(e)}`,boolean:e=>`${Bd(`0`)} ${Bd(`(${e} ? 116 : 102)`)}`,set:e=>`${Bd(`5`)} ${Vd(e)}`,function:e=>`${Bd(`9`)} ${Vd(e)}`,scalar:(e,t,n)=>`{ let r = ${e}; for (; r >= 4; r -= 4) { ${Vd(`0`)} } for (; r > 0; r--) { ${Bd(`0`)} } h ^= ${t}; l ^= ${n}; }`},Ud=()=>({H0:Cd,H1:wd,H2:Td,H3:Ed,L0:Dd,L1:Od,L2:kd,L3:Ad,initialHigh:jd,initialLow:Md}),Wd=(e,t)=>{let n=Nd,r=Pd;Pd=e[0],Nd=e[1],qd(t),e[0]=Pd,e[1]=Nd,Nd=n,Pd=r},Gd=e=>{Fd(5),Ld(e)},Kd=e=>{Fd(9),Ld(e)},qd=e=>{if(typeof e!=`object`||Ls(e))Rd(e);else if(Is(e)){let t=K(e);Kd(t.domain.length);for(let e=0;e<t.domain.length;e++)qd(t.domain[e]),qd(t.range[e])}else{let t=G(e).elements;Gd(t.length);for(let e of t)qd(e)}},Jd=e=>{let t=Nd,n=Pd;Nd=jd,Pd=Md;for(let t of e)qd(t);let r=BigInt(Nd>>>0)<<32n|BigInt(Pd>>>0);return Nd=t,Pd=n,r},Yd=(e,t)=>{let n=new BigInt64Array(e),r=new Int32Array(n.buffer),i=Nd,a=Pd;for(let n=0;n<e;n++)Nd=jd,Pd=Md,t(n),r[2*n]=Pd,r[2*n+1]=Nd;return Nd=i,Pd=a,n},Xd=(e,t)=>Yd(e.length,n=>{for(let r of t)qd(e[n][r])}),Zd=/* @__PURE__ */ new WeakMap,Qd=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),$d=1024,ef=e=>({current:-1,expressions:[],ranges:[],firstChild:[],lastChild:[],nextSibling:[],prefixes:[],isPart:[],isPrimed:[],isUnchanged:[],recursive:[],lets:[],roots:[],primary:[],secondary:[],covered:/* @__PURE__ */ new WeakSet,values:/* @__PURE__ */ new WeakMap,registers:new Uint8Array(e*$d),relations:[]}),tf=(e,t)=>({...e,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,coverage:t}),nf=(e,t,n,r,i)=>{let a=e.expressions.length;if(e.expressions.push(t),e.ranges.push(n),e.firstChild.push(-1),e.lastChild.push(-1),e.nextSibling.push(-1),e.prefixes.push(-1),e.isPart.push(i),e.isPrimed.push(!1),e.isUnchanged.push(t?.kind===`Unchanged`),e.recursive.push(-1),e.lets.push(void 0),e.roots.push(r===-1?a:e.roots[r]),e.primary.push(0),e.secondary.push(0),t&&e.covered.add(t),r===-1)return a;let o=e.lastChild[r];return o===-1&&(e.firstChild[r]=a),o!==-1&&(e.nextSibling[o]=a),e.lastChild[r]=a,a},rf=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,af=e=>e.location.range??(e.kind===`Let`?e.body.location.range:void 0),of=(e,t,n,r,i)=>{let a=t===`next`?rf(e,t,r):void 0;if(a!==void 0)return a;let o=nf(e,void 0,af(r),-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},sf=(e,t)=>e!==void 0&&t!==void 0&&e.module===t.module&&e.start.line===t.start.line&&e.start.column===t.start.column&&e.end.line===t.end.line&&e.end.column===t.end.column,cf=(e,t,n)=>{let r=e===void 0?void 0:n.definitions.get(e),i=r?.kind===`Operator`?r.head:void 0,a=af(t);return!r||!i?`Action ${a?m(a):`Unknown location`}`:sf(af(r.body),a)||!a?`${r.name} ${m(i)}`:`${r.name} ${m(i)} (${a.start.line} ${a.start.column} ${a.end.line} ${a.end.column})`},lf=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,uf=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,df=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},ff=e=>{let t=Array.from({length:11},()=>[]);return e.forEach((e,n)=>{if(n>=Math.floor(t.length*.75)){let e=Array.from({length:t.length*2+1},()=>[]);for(let n=t.length-1;n>=0;n--)t[n].forEach(t=>e[(bi(t.name)&2147483647)%e.length].unshift(t));t=e}t[(bi(e.name)&2147483647)%t.length].unshift(e)}),t.toReversed().flat()},pf=e=>e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[t.set]),mf=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),hf=(e,t)=>{let n=e.reduce((e,t)=>({name:t.name,definition:t,scope:void 0,parent:e}),t);for(let e=n;e!==t&&e;e=e.parent)e.scope=n;return n},gf=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),_f=(e,t,n)=>{let r=new Set(n.map(lf)),i=[],a=[],o=[],s=/* @__PURE__ */ new Map,c=(e,n,r)=>{if(M(e)){for(let e=r;e;e=e.parent)if(e.name===n)return e.definition&&{definition:e.definition,scope:e.scope};return}let i=t.substitutions.get(n)??n;if(t.variableIndex.has(i)||t.constants.has(i))return;let a=t.definitions.get(i),o=a?.location.range?.module??a?.body.location.range?.module;return a&&!Qd.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=nf(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(lf(n));let d=t&&s.get(t);if(d&&i.forEach(t=>{e.expressions[t]===d&&(e.lets[t]??=[]).push(u)}),l?.kind===`Operator`&&l.isRecursive){let t=i.findLast(e=>a[e]===l);t!==void 0&&(e.recursive[u]=t)}return a[u]=l,i.push(u),o(),i.pop(),u},u=e=>{let t=e.definition;if(o.includes(t))return;o.push(t);let n=t.kind===`Function`?gf(t.bounds):t.params.map(e=>e.name);if(t.kind===`Function`){let r=e.scope!==void 0;l(mt(t,r),t.location.range,()=>{m(t.body,mf(n,e.scope)),pf(t.bounds).forEach(t=>m(t,e.scope))})}else m(t.body,mf(n,e.scope));o.pop()},d=e=>e?.definition.kind===`Operator`&&e.definition.params.length>0,f=(e,t,n,r)=>{if(e.kind===`Lambda`)m(e.body,mf(e.params,r));else{if(e.kind===`Identifier`){let i=c(e,e.name,r);if(n?.kind===`Operator`&&(n.params[t]?.arity??0)>0||d(i)){i&&u(i);return}}m(e,r)}},p=(t,n,r,a)=>l(n===t.operands.length?t:void 0,r,()=>{let o=t.operands;if(n>2&&!t.isBulleted){let s=t.prefixEnds?.[n-3],c=p(t,n-1,r&&s?{...r,end:s}:r,a);e.prefixes[i.at(-1)??-1]=c,m(o[n-1],a)}else o.slice(0,n).forEach(e=>m(e,a))},n<t.operands.length),m=(e,t)=>{let n=e.location.range,r=e=>e.forEach(e=>m(e,t));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:case`Bracket`:case`Subexpression`:case`OperatorReference`:return;case`Label`:case`Lambda`:m(e.body,mf(e.params,t));return;case`Selection`:n===void 0?m(e.expression,t):l(e,n,()=>m(e.expression,t));return;case`Let`:{let n=hf(e.definitions,t);e.definitions.forEach(t=>{t.kind===`Operator`&&s.set(t.body,e.body)}),ff(e.definitions).forEach(e=>{e.name!==`$subexpression`&&u({definition:e,scope:n})}),m(e.body,n);return}case`Identifier`:{let r=c(e,e.name,t);l(e,n,()=>{r&&u(r)},!1,r?.definition);return}case`Apply`:{let r=c(e,e.operator,t);l(e,n,()=>{r&&u(r),e.args.forEach((e,n)=>f(e,n,r?.definition,t))},!1,r?.definition);return}case`And`:case`Or`:p(e,e.operands.length,n,t);return;case`Case`:l(e,n,()=>{e.arms.forEach(e=>l(void 0,uf(e.condition.location.range,e.body.location.range),()=>r([e.condition,e.body]),!0));let n=e.other;n&&l(void 0,e.otherRange,()=>m(n,t),!0)});return;case`Record`:case`RecordSet`:l(e,n,()=>e.fields.forEach(e=>l(void 0,df(e.location,e.value.location.range),()=>m(e.value,t),!0)));return;case`FunctionApplication`:l(e,n,()=>{m(e.function,t);let n=e.args;n.length===1?m(n[0],t):l(void 0,uf(n[0]?.location.range,n.at(-1)?.location.range),()=>r(n),!0)});return;case`Forall`:case`Exists`:case`FunctionConstruction`:l(e,n,()=>{m(e.body,mf(gf(e.bounds),t)),r(pf(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,mf(gf(e.bounds),t)),r(pf(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,mf(gf([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,mf(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,mf(e.names,t)));return;case`Except`:l(e,n,()=>{m(e.function,t),e.updates.forEach(e=>{e.path.forEach(e=>{e.kind===`Index`&&r(e.args)}),m(e.value,t)})});return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:l(e,n,()=>m(e.expression,t));return;case`If`:l(e,n,()=>r([e.condition,e.consequent,e.alternative]));return;case`SetEnumeration`:case`Tuple`:l(e,n,()=>r(e.elements));return;case`Product`:l(e,n,()=>r(e.factors));return;case`FunctionSet`:l(e,n,()=>r([e.domain,e.range]));return;case`FieldAccess`:l(e,n,()=>m(e.record,t));return;case`BoxAction`:case`AngleAction`:l(e,n,()=>r([e.action,e.subscript]));return;case`WeakFairness`:case`StrongFairness`:l(e,n,()=>r([e.subscript,e.action]))}},h=e=>{let t=[];for(let n=e;n;n=n.parent){let e=Zd.get(n);e&&t.unshift(e)}return hf(t,void 0)};e.relations.forEach(e=>{i.push(e.node),m(e.expression,h(e.scope)),i.pop()})},vf=(e,t,n)=>{for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r]){if(e.expressions[r]===n)return r;if(e.isPart[r]){let t=vf(e,r,n);if(t!==-1)return t}}return-1},yf=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=vf(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:vf(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},bf=(e,t)=>{for(let n=t;n!==-1;n=e.prefixes[n])e.primary[n]++},xf=(e,t,n)=>{let r=e.current;e.current=t;try{return n()}finally{e.current=r}},Sf=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},Cf=(e,t,n,r,i)=>{let a=Fs(n)?n:t!==`\\`&&Fs(r)?r:void 0;if(a===void 0||typeof i!=`object`)return i;let o=a===n?r:n;if(t===`\\cup`){if(au(a)||!Fs(o))return i;let t=e.values.get(o);t!==void 0&&(e.secondary[t]+=cu(o)+1)}let s=t===`\\cup`?void 0:e.values.get(a);if(e.values.get(i)===s)return i;let c=i===n||i===r||e.values.has(i)?{...i}:i;return s!==void 0&&e.values.set(c,s),c},wf=(e,t,n)=>{let r=0;return{next:()=>(t!==void 0&&e.secondary[t]++,r++<n),reset:()=>{r=0}}},Tf=(e,t,n)=>{if(n.some(e=>au(e)))return{next:()=>!1,reset:()=>void 0};let r=n.map(t=>Df(e,t,cu(t),!1)),i=()=>{for(let e=r.length-1;e>0;e--){if(r[e].next())return!0;r[e].reset(),r[e].next()}return r.length>0&&r[0].next()},a=!r.every(e=>e.next());return{next:()=>!a&&(e.secondary[t]+=Math.max(r.length,1),a=!i(),!0),reset:()=>{r.forEach(e=>{e.reset(),e.next()}),a=!1}}},Ef=(e,t)=>{let n=typeof t==`object`?e.values.get(t):void 0;if(n!==void 0&&typeof t==`object`){if(t.kind===`RecordSet`)return Tf(e,n,t.sets);if(t.kind===`FunctionSet`)return Tf(e,n,Array.from({length:cu(t.domain)},()=>t.range))}},Df=(e,t,n,r)=>{let i=typeof t==`object`?e.values.get(t):void 0;if(typeof t==`object`&&(t.kind===`Subset`||!r&&t.kind===`FilteredSet`))return wf(e,void 0,n);let a=Ef(e,t);if(!a||i===void 0)return wf(e,i,n);if(!r)return a;let o=0;for(;a.next();)o++;return e.secondary[i]+=o,wf(e,i,o)},Of=(e,t,n)=>{let r=typeof t==`object`&&t.kind===`Subset`?e.values.get(t):void 0;r!==void 0&&typeof n==`object`&&e.values.set(n,r)},kf=/* @__PURE__ */ new Set([`Set`,`MixedSet`,`Interval`,`FunctionSet`,`RecordSet`,`ProductSet`]),Af=(e,t,n,r)=>{if(typeof t!=`object`||kf.has(t.kind))return;if(t.kind!==`Subset`){let r=Df(e,t,n,!1);for(let e=0;e<=n;e++)r.next();return}let i=e.values.get(t);i!==void 0&&(e.secondary[i]+=n);for(let n=0;n<r.length;n++)Of(e,t,r[n])},jf=(e,t,n,r)=>{let i=Array.isArray(n)?n.length:n.high-n.low+1;return typeof t!=`object`||t.kind!==`Subset`||!Array.isArray(n)?Df(e,t,i,r):(n.forEach(n=>Of(e,t,n)),wf(e,void 0,i))},Mf=e=>(e.every(e=>e.next()),()=>{for(let t=0;t<e.length;t++){if(e[t].next()||t===e.length-1)return;e[t].reset(),e[t].next()}}),Nf=(e,t,n)=>Mf(t.map((t,r)=>jf(e,t,n[r],!0))),Pf=(e,t,n)=>{let r=n.map(e=>cu(e)),i=Mf(n.map((t,n)=>Df(e,t,r[n],!1))),a=r.reduce((e,t)=>e*t,1);for(let e=0;e<a;e++)i();e.secondary[t]+=a},Ff=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},If=(e,t)=>t.forEach((t,n)=>{let r=Jd([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*$d+i;e.registers[o]=Math.max(e.registers[o],Ff(a)+1)}),Lf=(e,t)=>{let n=e.registers.subarray(t*$d,(t+1)*$d),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*$d*$d/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*$d?a===0?i:$d*Math.log($d/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},Rf=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},zf=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>Rf(e)&t-1;return e.reduce((e,t)=>n(t)<n(e)?t:e)},Bf=(e,t)=>{e.some(e=>e.primary===t.primary&&e.secondary===t.secondary)||e.push(t)},Vf=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],Hf=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},Uf=(e,t)=>{let n=e.primary[t.node],r=e.secondary[t.node];return t.kind===`init`?{distinct:n,generated:n+r}:t.kind===`next`?{distinct:r,generated:n}:t.kind===`constraint`?{distinct:r,generated:n+r}:{distinct:0,generated:0}},Wf=(e,t)=>{let n=[],r=/* @__PURE__ */ new Map,i=t=>{let n=[],a={primary:e.primary[t],secondary:e.secondary[t]};return(a.primary>0||a.secondary>0||Vf(e,t))&&Bf(n,a),Hf(e,t).forEach(e=>i(e).forEach(e=>Bf(n,e))),r.set(t,n),n},a=(t,r,i,a)=>{let o=e.ranges[t];n.push({location:o?m(o):`Unknown location`,depth:r,count:i,cost:a})},o=(t,n)=>a(t,n,e.primary[t],e.secondary[t]),s=(t,n)=>{let c=Hf(e,t),l=[];c.forEach(e=>(r.get(e)??i(e)).forEach(e=>Bf(l,e)));let u={primary:e.primary[t],secondary:e.secondary[t]},d=Vf(e,t),f=e=>c.forEach(t=>s(t,e));if(e.isUnchanged[t]){let e=l.filter(e=>e.primary!==0||e.secondary!==0);e.length===0?o(t,n):a(t,n,Math.max(u.primary,zf(e).primary),0);return}if(l.length===0){(u.primary!==0||d)&&o(t,n);return}let p=u.primary===0&&u.secondary===0;if(l.length===1){let e=l[0],r=e.primary===0&&e.secondary===0;if(e.primary<u.primary){o(t,n),f(n+1);return}if(!d&&p&&!r){a(t,n,e.primary,e.secondary);return}if(p&&r){d&&o(t,n),f(d?n+1:n);return}if(u.primary===e.primary&&u.secondary===e.secondary){o(t,n);return}}let m=!p||d;m&&o(t,n),f(m?n+1:n)};return Hf(e,t).forEach(e=>{i(e),s(e,0)}),n},Gf=[`init`,`next`,`invariant`,`constraint`,`implied`],Kf=(e,t)=>!e||!t?e?1:t?-1:0:e.module===t.module?e.start.line-t.start.line||e.start.column-t.start.column||e.end.line-t.end.line||e.end.column-t.end.column:e.module<t.module?-1:1,qf=e=>Gf.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>Kf(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||Kf(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),Jf=(e,t,n,r)=>({variables:r.map(r=>{let i=n[r]?.range;return{label:`${t.variables[r]} ${i?m(i):`Unknown location`}`,distinct:Lf(e,r)}}),relations:qf(e).map(t=>({kind:t.kind,label:t.label,...Uf(e,t),expressions:Wf(e,t.node)}))}),Yf=(e,t,n)=>{let r=rf(e,t,n);if(r===void 0)return;let i=e.primary[r],a=e.secondary[r];if(t===`init`)return[[`generated`,i+a],[`distinct`,i]];if(t===`next`)return[[`generated`,i],[`distinct`,a]];let o=e.firstChild[r];return[[`count`,o===-1?i:e.primary[o]]]},Xf=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),Zf=(e,n)=>Xf.has(e)?new w(n):new t(n),Qf=(e,n,r,i)=>new t(`The ${e} argument of ${n} should be a ${r}, but instead it is:\n${U(q(i))}`),$f=(e,n,r=e)=>{if(!Ps(e)||gc(e))throw new t(`Applying ${n} to the following value,\nwhich is not a finite set:\n${U(q(r))}`);return G(e)},ep=e=>typeof e==`object`&&e.kind===`Operator`,J=(e,t,n)=>{let r=e[t];if(r===void 0||ep(r))throw Zf(n,`${n} expects a value as argument ${t+1}`);return r},tp=(e,t,n)=>{let r=J(e,t,n);if(typeof r!=`boolean`)throw Zf(n,`${n} expects a boolean but received ${q(r)}`);return r},np=(e,t,n)=>{let r=e[t];if(r===void 0||!ep(r))throw Zf(n,`${n} expects an operator as argument ${t+1}`);return r},rp=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),Y=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),ip=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),ap=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),op=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(J(n,0,e),J(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),sp=e=>e>2147483647||e<-2147483648,cp=e=>new t(`Overflow when computing ${e}`),lp={ModelValue:`ModelValue`,Set:`SetEnumValue`,Interval:`IntervalValue`,InfiniteSet:`UserValue`,SequenceSet:`UserValue`,Subset:`SubsetValue`,FunctionSet:`SetOfFcnsValue`,RecordSet:`SetOfRcdsValue`,ProductSet:`SetOfTuplesValue`,FilteredSet:`SetPredValue`,LazyFunction:`FcnLambdaValue`,Union:`UnionValue`,MixedSet:`SetEnumValue`},up={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},dp={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},fp={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},pp=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return up[e.operator];if(e.kind!==`Function`)return lp[e.kind];let t=Nc(e);return t===void 0?`FcnRcdValue`:fp[t]},mp=e=>dp[pp(e)],hp=(e,t)=>new w(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),gp=(e,n)=>{let r=r=>(...i)=>{let a=hu.sets?.length??0;try{return r(...i)}catch(r){if(!(r instanceof w)||r instanceof re)throw r;let i=_u(a);throw hu.sets&&(hu.sets.length=a),e.isLazy!==!0&&r instanceof t&&!i?r:hp(n,r.message)}},i=r(e.evaluate);return{...e,evaluate:(t,r)=>{if(t.length!==e.arity)throw hp(n,`array is not of length ${e.arity}`);return i(t,r)},evaluateUnary:e.evaluateUnary&&r(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&r(e.evaluateBinary)}},_p=(e,t)=>{if(typeof e!=`number`)throw hp(t,`Cannot cast tlc2.value.impl.${pp(e)} to tlc2.value.impl.IntValue`);return e},vp=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,yp=(e,t,n,r)=>{let i=vp(e,n,`IntValue`,2);return op(t,(e,n)=>{let a=_p(n,i),o=_p(e,i),s=r(o,a);if(sp(s))throw cp(`${o}${t}${a}`);return s})},bp=(e,n,r)=>{if(typeof e!=`number`)throw new t(`The ${n} argument of ${r} should be an integer, but instead it is:\n${U(q(e))}`);return e},xp=(e,t,n=e)=>op(e,(e,r)=>t(bp(e,`first`,n),bp(r,`second`,n))),Sp=(e,t,n)=>({...ap(e,t,n),isLazy:!0}),Cp=(e,t,n)=>{let r=np(e,t,n);return()=>r.call([])},wp=/* @__PURE__ */ new WeakSet,Tp=/* @__PURE__ */ new WeakMap,Ep=(e,t)=>{if(t.length===0)return e;let n={...e};return wp.has(e)&&wp.add(n),Tp.set(n,[...t,...Tp.get(e)??[]]),n},Dp=(e,t,n=/* @__PURE__ */ new Set)=>{let r=Np(e,(e,r)=>Dp(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&M(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&M(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Op=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),kp=/* @__PURE__ */ new WeakMap,Ap=e=>kp.get(e)??e.name,jp=(e,t)=>(Ap(t)!==e.name&&kp.set(e,Ap(t)),e),Mp=(e,t)=>jp(e.kind===`Function`?{...e,bounds:Op(e.bounds,e=>t(e,[])),body:t(e.body,ba(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),Np=(e,t)=>{let n=e=>t(e,[]);switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return e;case`Apply`:return{...e,args:e.args.map(n)};case`Lambda`:return{...e,body:t(e.body,e.params)};case`And`:case`Or`:return{...e,operands:e.operands.map(n)};case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return{...e,expression:n(e.expression)};case`If`:return{...e,condition:n(e.condition),consequent:n(e.consequent),alternative:n(e.alternative)};case`Case`:return{...e,arms:e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:e.other?n(e.other):void 0};case`Let`:{let n=e.definitions.map(e=>e.name);return{...e,definitions:e.definitions.map(e=>Mp(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Op(e.bounds,n),body:t(e.body,ba(e.bounds))};case`UnboundedQuantifier`:return{...e,body:t(e.body,e.names)};case`Choose`:return{...e,set:e.set?n(e.set):void 0,body:t(e.body,ya(e.pattern))};case`SetEnumeration`:case`Tuple`:return{...e,elements:e.elements.map(n)};case`SetFilter`:return{...e,bound:{pattern:e.bound.pattern,set:n(e.bound.set)},predicate:t(e.predicate,ya(e.bound.pattern))};case`SetMap`:return{...e,bounds:Op(e.bounds,n),expression:t(e.expression,ba(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({...e,path:e.path.map(e=>e.kind===`Index`?{...e,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Selection`:return{...e,expression:n(e.expression)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},Pp=[],Fp=(e,t)=>{for(let n=0;n<e.length;n++)t(e[n],Pp)},Ip=(e,t)=>{for(let n=0;n<e.length;n++)t(e[n].set,Pp)},Lp=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return;case`Apply`:case`Bracket`:return Fp(e.args,t);case`Lambda`:return t(e.body,e.params);case`And`:case`Or`:return Fp(e.operands,t);case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`Selection`:return t(e.expression,Pp);case`If`:return t(e.condition,Pp),t(e.consequent,Pp),t(e.alternative,Pp);case`Case`:for(let n=0;n<e.arms.length;n++)t(e.arms[n].condition,Pp),t(e.arms[n].body,Pp);e.other&&t(e.other,Pp);return;case`Let`:{let n=e.definitions.map(e=>e.name);return e.definitions.forEach(e=>{e.kind===`Function`?(Ip(e.bounds,e=>t(e,n)),t(e.body,[...n,...ba(e.bounds)])):t(e.body,[...n,...e.params.map(e=>e.name)])}),t(e.body,n)}case`Forall`:case`Exists`:case`FunctionConstruction`:return Ip(e.bounds,t),t(e.body,ba(e.bounds));case`UnboundedQuantifier`:return t(e.body,e.names);case`Choose`:return e.set&&t(e.set,Pp),t(e.body,ya(e.pattern));case`SetEnumeration`:case`Tuple`:return Fp(e.elements,t);case`SetFilter`:return t(e.bound.set,Pp),t(e.predicate,ya(e.bound.pattern));case`SetMap`:return Ip(e.bounds,t),t(e.expression,ba(e.bounds));case`FunctionSet`:return t(e.domain,Pp),t(e.range,Pp);case`Record`:case`RecordSet`:for(let n=0;n<e.fields.length;n++)t(e.fields[n].value,Pp);return;case`Except`:t(e.function,Pp);for(let n=0;n<e.updates.length;n++){let r=e.updates[n];for(let e=0;e<r.path.length;e++){let n=r.path[e];n.kind===`Index`&&Fp(n.args,t)}t(r.value,Pp)}return;case`FunctionApplication`:return t(e.function,Pp),Fp(e.args,t);case`FieldAccess`:return t(e.record,Pp);case`Product`:return Fp(e.factors,t);case`BoxAction`:case`AngleAction`:return t(e.action,Pp),t(e.subscript,Pp);case`WeakFairness`:case`StrongFairness`:return t(e.subscript,Pp),t(e.action,Pp);case`Label`:return t(e.body,Pp);case`Subexpression`:e.selectors.forEach(e=>{`args`in e&&Fp(e.args,t)})}},Rp=`LAMBDA`,zp=e=>`${e}@SUBSTITUTION`,Bp=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(Bp),Vp=(e,t)=>{if(e.kind!==`Identifier`)return!Bp(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=M(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!Bp(n.body)},Hp=(e,t=/* @__PURE__ */ new Set)=>{let n=_t(e),r=n===void 0||t.has(n)?[]:[n];return Lp(e,(e,n)=>r.push(...Hp(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n])))),r},Up=e=>{let t=/* @__PURE__ */ new Map;return n=>{if(!e.substitutedNames.has(n))return n;let r=t.get(n)??e.instantiation.createName(n);return t.set(n,r),r}},Wp=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Gp=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Kp=(e,t)=>e.map(e=>({pattern:Gp(e.pattern,t),set:e.set})),qp=(e,t)=>e.kind===`Function`?{...e,bounds:Kp(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},Jp=(e,t,n)=>{let r=e=>t.get(e)??e;switch(e.kind){case`Identifier`:return{...e,name:r(e.name)};case`Apply`:case`OperatorReference`:return{...e,operator:r(e.operator)};case`Label`:return{...e,params:e.params.map(r)};case`Lambda`:return{...e,params:e.params.map(n)};case`Let`:return{...e,definitions:e.definitions.map(e=>jp({...qp(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Kp(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Gp(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Gp(e.bound.pattern,n),set:e.bound.set}};default:return e}},Yp=e=>`${e}@ENABLED`,Xp=(e,t)=>e.modes.get(t)??e,Zp=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!M(e)&&t.instantiation.variables.has(e.name),Qp=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Qp(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Zp(e,t,n))return[e.name];let r=M(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?Qp(r.body,t,/* @__PURE__ */ new Map):void 0},$p=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Zp(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Yp(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:am(e.expression,Xp(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[am(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:am(e.subscript,Xp(t,`Primed`),n),location:r},am(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Qp(e.expression,t,n);if(r!==void 0)return{kind:`And`,operands:r.map(r=>({kind:`Apply`,operator:`=`,args:[{kind:`Prime`,expression:{kind:`Identifier`,name:Yp(r),location:e.location},location:e.location},am({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},em=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:Hi}),tm=(e,t)=>e.map(e=>em(e.name,t)),nm=(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:tm(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),rm=(e,t,n,r)=>{let i=Array.from({length:n},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:i,body:{kind:`Apply`,operator:e,args:[...tm(t,r),...i.map(e=>em(e,r))],location:r},location:r}},im=(e,t)=>e.instantiation.isParameterized(t)?cm(e,t):void 0,am=(e,t,n)=>{let r=e=>am(e,t,n);if(e.kind===`Selection`&&[...n].every(e=>e[0]===e[1])){let n=e.expression,i=t.selections.get(n)??r(n);return t.selections.set(n,i),{...e,expression:i}}let i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!M(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:am(e.expression,Xp(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:am(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},Xp(t,`Enabled`),n)};let c=$p(e,t,n);if(c)return c;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name),r=t.bindings;if(n&&(r===void 0||!Vp(n,i)))return Ep(n,[e]);if(n&&r){let t=zp(e.name);return r.set(t,n),em(t,e.location)}let o=im(t,e.name);if(o===void 0)return e;if(a.length===0)return{...e,name:o};let s=i.getDefinition(e.name);return s&&sa(s)>0?rm(o,a,sa(s),e.location):{kind:`Apply`,operator:o,args:tm(a,e.location),location:e.location}}if(e.kind===`Apply`&&o(e.operator)){let n=e.args.map(r),o=i.substitutions.get(e.operator),c=i.substitutions.size>0||a.length>0||wp.has(e),l=e=>(c&&wp.add(e),e);if(o?.kind===`Identifier`||o?.kind===`OperatorReference`){let t=o.kind===`Identifier`?o.name:o.operator;return l({...e,operator:t,args:n,resolution:o.kind===`Identifier`?o.resolution:void 0})}if(o?.kind===`Apply`)return l({...e,operator:o.operator,args:[...o.args,...n],resolution:o.resolution});if(o?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:Rp,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:Rp,args:n,resolution:Hi},location:{line:e.location.line,column:e.location.column}};if(o)throw new s(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let u=im(t,e.operator);return u===void 0?l({...e,args:n}):{...e,operator:u,args:[...tm(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=i.substitutions.get(e.operator);if(n?.kind===`Identifier`||n?.kind===`OperatorReference`||n?.kind===`Lambda`)return Ep(n,[e]);let r=im(t,e.operator);if(r===void 0)return e;let o=i.getDefinition(e.operator);return a.length>0&&o?rm(r,a,sa(o),e.location):{...e,operator:r}}let l=Up(t),u=Np(e,(e,i)=>i.length===0?r(e):am(e,t,Wp(n,i,l)));return Jp(u,n,l)},om=e=>e.isSelfReferential?{kind:`Let`,definitions:[e],body:em(e.name,e.location),location:{line:e.location.line,column:e.location.column}}:mt(e,!0),sm=(e,t)=>t.length===0?e:e.kind===`Operator`?{...e,params:[...t,...e.params]}:{kind:`Operator`,name:e.name,params:t,body:om(e),isLocal:e.isLocal,isRecursive:!1,location:e.location},cm=(e,t)=>{let n=e.copies.get(t);if(n!==void 0)return n;let r=e.instantiation,i=r.getDefinition(t);return i?r.addDefinition(t,i.name,n=>{e.copies.set(t,n);let a=Up(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o,selections:/* @__PURE__ */ new Map}:e,c=qp(Mp(i,(e,t)=>am(e,s,Wp(/* @__PURE__ */ new Map,t,a))),a),l=c.kind!==`Operator`||o.size===0?c.body:{kind:`Let`,definitions:[...o].map(e=>({kind:`Operator`,name:e[0],params:[],body:e[1],isLocal:!0,isRecursive:!1,location:e[1].location})),body:c.body,location:{line:c.body.location.line,column:c.body.location.column}},u=r.frame;return u&&Tp.set(l,[u,...Tp.get(i.body)??[]]),sm({...c,body:l},r.params)}):t},lm=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Hp(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t,selections:/* @__PURE__ */ new Map};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>im(i,e)??e,getQualifiedKey:t=>{let n=im(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>sm(r,e.params)):t}}},um=e=>e.kind===`Let`&&e.instances!==void 0||gt(e).some(um),dm=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=Np(e,e=>dm(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>aa(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},fm=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,pm=(e,t)=>e.definitions.some(e=>um(e.body))||e.assumptions.some(e=>um(e.expression))||e.theorems.some(e=>{let t=fm(e);return t!==void 0&&um(t)})?{...e,definitions:e.definitions.map(e=>Mp(e,e=>dm(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:dm(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=fm(e);return n===void 0?e:{...e,statement:dm(n,t,[])}})}:e,mm=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]],[`_Track`,0,[0,0],[3,2],[0,0]],[`_Counts`,0,[],[],[]],[`_CheckName`,0,[0],[2],[1]],[`_PrintCounts`,0,[],[],[]]].map(e=>[e[0],{name:e[0],level:e[1],isCorrect:!0,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}])),hm={Naturals:{Nat:[14,1,14,16],"+":[15,1,15,19],"-":[17,1,17,33],"*":[18,1,18,17],"^":[19,1,19,19],"<":[20,1,20,19],">":[21,1,21,19],"<=":[22,1,22,19],">=":[23,1,23,19],"%":[33,1,33,20],"\\div":[34,1,34,20],"..":[35,1,35,20]},Integers:{Int:[18,1,18,12],"-.":[22,1,22,13]},Sequences:{Seq:[20,1,20,41],Len:[25,1,25,44],"\\o":[30,1,31,76],Append:[36,1,36,26],Head:[41,1,41,15],Tail:[42,1,42,61],SubSeq:[48,1,48,50],SelectSeq:[53,1,65,14]},FiniteSets:{IsFiniteSet:[14,1,19,68],Cardinality:[21,1,27,11]},Bags:{IsABag:[20,1,24,41],BagToSet:[26,1,26,23],SetToBag:[31,1,31,30],BagIn:[36,1,36,31],EmptyBag:[41,1,41,24],"\\oplus":[43,1,49,46],"\\ominus":[51,1,60,50],BagUnion:[74,1,79,58],"\\sqsubseteq":[81,1,87,42],SubBag:[89,1,110,11],BagOfAll:[122,1,130,66],BagCardinality:[132,1,138,8],CopiesIn:[140,1,145,33]},TLC:{Print:[17,1,17,22],PrintT:[18,1,18,19],Assert:[24,1,25,54],JavaTime:[26,1,26,32],TLCGet:[75,1,75,28],TLCSet:[76,1,76,20],":>":[78,1,78,27],"@@":[79,1,80,50],Permutations:[81,1,82,54],SortSeq:[88,1,92,40],RandomElement:[110,1,110,41],Any:[119,1,119,22],ToString:[121,1,121,58],TLCEval:[145,1,145,15]},TLCExt:{AssertEq:[14,1,20,14],AssertError:[23,1,26,72],TLCGetOrDefault:[30,1,31,17],TLCGetAndSet:[33,1,35,57],Trace:[41,1,57,6],CounterExample:[61,1,75,8],ToTrace:[77,1,87,12],TLCModelValue:[91,1,120,29],TLCDefer:[122,1,134,6],TLCNoOp:[138,1,145,5],PickSuccessor:[148,1,162,37],TLCCache:[166,1,173,12],TLCFP:[175,1,181,24],TLCEvalDefinition:[185,1,190,6]},Randomization:{RandomSubset:[30,1,30,64],RandomSetOfSubsets:[48,1,49,67],TestRandomSetOfSubsets:[61,1,62,71]},Json:{ToJson:[46,1,55,37],ToJsonArray:[57,1,64,42],ToJsonObject:[66,1,73,43],JsonSerialize:[75,1,80,6],JsonDeserialize:[82,1,87,19],ndJsonSerialize:[89,1,95,6],ndJsonDeserialize:[97,1,103,19]},_Possible:{_Track:[10,1,17,38],_Counts:[24,1,30,14],_CheckName:[32,1,35,35],_PrintCounts:[37,1,37,31]}},gm=(e,t)=>{let n=hm[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},_m={Constant:0,Variable:1,State:1,Action:2,Temporal:3},vm=(e,t)=>`${e}${t}`,ym=(e,t,n)=>`${e}${t}${n}`,bm=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},xm=(e,t,n)=>`${e},${t},${n}`,Sm=(e=0)=>({level:e,isCorrect:!0,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),Cm=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),wm=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Tm=(e,t)=>{t.constraints.forEach((t,n)=>Cm(e.constraints,n,t)),t.argConstraints.forEach((t,n)=>wm(e.argConstraints,n,t)),t.argParams.forEach(t=>e.argParams.add(t))},X=(e,t,n,r)=>({...Sm(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Em=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,Dm=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Om=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=>[e[0],{...X(e[0],e[1],[...e[2]],[...e[3]]),nonLeibniz:new Set(e[1]>1?[0,1]:[])}])),km=X(`'`,2,[1],[0]),Am=X(`UNCHANGED`,2,[1],[0]),jm=X(`ENABLED`,1,[2],[0]),Mm=X(`[]`,3,[3],[0]),Nm=X(`<>`,3,[3],[0]),Pm=X(`$ConjList`,0,[3],[1]),Fm=X(`$DisjList`,0,[3],[1]),Im=X(`$IfThenElse`,0,[3],[1]),Lm=X(`$Case`,0,[3],[1]),Rm=X(`$BoundedForall`,0,[3],[1]),zm=X(`$BoundedExists`,0,[3],[1]),Bm=X(`$UnboundedForall`,0,[3],[1]),Vm=X(`$UnboundedExists`,0,[3],[1]),Hm=X(`$TemporalForall`,3,[3],[0]),Um=X(`$TemporalExists`,3,[3],[0]),Wm=X(`$BoundedChoose`,0,[2],[1]),Gm=X(`$UnboundedChoose`,0,[2],[1]),Km=X(`$SetEnumerate`,0,[2],[1]),qm=X(`$Tuple`,0,[2],[1]),Jm=X(`$SetOfFcns`,0,[2],[1]),Ym=X(`$CartesianProd`,0,[2],[1]),Xm=X(`$SubsetOf`,0,[2],[1]),Zm=X(`$SetOfAll`,0,[2],[1]),Qm=X(`$FcnConstructor`,0,[3],[1]),$m=X(`$RcdConstructor`,0,[3],[1]),eh=X(`$SetOfRcds`,0,[2],[1]),th=X(`$Except`,0,[2],[1]),nh=X(`$Pair`,0,[3],[1]),rh=X(`$Seq`,0,[2],[1]),ih=X(`$FcnApply`,0,[2,2],[1,1]),ah=X(`$RcdSelect`,0,[2,0],[1,1]),oh=X(`$SquareAct`,2,[2,1],[0,0]),sh=X(`$AngleAct`,2,[2,1],[0,0]),ch=X(`$WF`,3,[1,2],[0,0]),lh=X(`$SF`,3,[1,2],[0,0]),uh=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity,level:0}])]),dh=e=>e.map(e=>({name:e,arity:0})),fh=e=>e.kind===`Operator`?e.params:[],ph=e=>e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,mh=(e,t)=>{let n=new Map(t);return e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n})),n},hh=(e,t,n)=>{let r=fh(e);return{...Sm(),name:e.name,formals:r,maxLevels:r.map(()=>t),weights:r.map(()=>n),minMaxLevels:r.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}},gh=(e,t,n=!0)=>{let r=[],i=[],a=[],o=[],s=0,c=0,l=()=>{let t=a.length;for(;t>0&&o[t-1]===void 0;)t--;let n=o[t-1]??e;for(let e=t;e<a.length;e++){let t=a[e];n=Array.isArray(t)?uh(n,dh(t)):t.kind===`Let`?mh(t,n):t.kind===`Function`?uh(n,dh(ba(t.bounds))):uh(n,t.params),o[e]=n}return n},u=(e,t)=>{a.push(e),o.push(void 0),f(t),a.pop(),o.pop()},d=(e,t)=>t.length===0?f(e):u(t,e),f=e=>{if(e.kind!==`Let`)return Lp(e,d);if(a.push(e),o.push(void 0),c++,e.recursive)h(_h(e));else for(let t=0;t<e.definitions.length;t++)p(e.definitions[t]);c--,f(e.body),a.pop(),o.pop()},p=e=>{if(e.kind===`Function`)for(let t=0;t<e.bounds.length;t++)f(e.bounds[t].set);if(u(e,e.body),s===0)return;let t=i[c]??=/* @__PURE__ */ new Set;e.isRecursive&&t.delete(e.name)?s--:r.at(-1)?.members.push({definition:e,scope:l(),isRechecked:t.size>0})},m=(e,t)=>{s===0&&r.push({location:t,members:[]});let n=i[c]??=/* @__PURE__ */ new Set;e.forEach(e=>{n.has(e.name)||(n.add(e.name),s++)}),e.forEach(e=>r.at(-1)?.members.push({definition:e,scope:l(),isRechecked:!0}))},h=e=>{let t=/* @__PURE__ */ new Map;e.forEach(e=>{if(e.kind!==`Definition`||!e.definition.isRecursive)return;let n=t.get(e.definition.name);n?n.push(e.definition):t.set(e.definition.name,[e.definition])}),e.forEach(e=>{e.kind===`Recursive`?m(e.declarations.flatMap(e=>t.get(e.name)??[]),e.location):(s!==0||n)&&(e.kind===`Assumption`?f(e.assumption.expression):e.kind===`Theorem`&&e.theorem.statement.kind!==`AssumeProve`?f(e.theorem.statement):e.kind===`Definition`&&p(e.definition))})};return Array.isArray(t)?h(t):f(t),r},_h=e=>[...(e.recursive??[]).map(e=>({location:e.location,unit:{kind:`Recursive`,declarations:[e],location:e.location}})),...e.definitions.map(e=>({location:e.location,unit:{kind:`Definition`,definition:e}}))].toSorted((e,t)=>aa(e.location,t.location)?-1:1).map(e=>e.unit),vh=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),yh=e=>e.includes(2)&&e.includes(3),bh=e=>di.get(e)??e.location.range,xh=e=>e.kind!==`Let`&&e.kind!==`Label`,Sh=e=>{let t=/* @__PURE__ */ new Map,n=/* @__PURE__ */ new Map,r=[],i=[],a=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:r.level,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:S(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){let n=S(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Om.get(t)??mm.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},o=(e,t,n)=>{let r=Sm(Math.max(t,...n.map(e=>e.data.level)));return r.isCorrect=n.every(e=>e.data.isCorrect),r.params.add(e),n.forEach((t,n)=>{t.data.params.forEach(t=>{r.params.add(t),r.argParams.add(ym(e,n,t))}),wm(r.argConstraints,vm(e,n),t.data.level),Tm(r,t.data)}),r},s=(e,t,n=[],r=[])=>{let a=e=>r.includes(e),o=t.flatMap((t,n)=>t.kind===`Value`&&t.data.level>Em(e,n)?[{operand:t,index:n}]:[]);o.filter(t=>e.isCorrect&&t.operand.data.isCorrect).forEach(t=>i.push(`Level error in applying operator ${xt(e.name)}:\nThe level of argument ${t.index+1} exceeds the maximum level allowed by the operator`));let s=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},c=(t,n,r)=>e.conditions.has(xm(t,n,r)),l=Sm(Math.max(e.level,...t.filter((t,n)=>Dm(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return l.isCorrect=o.length===0&&t.every(e=>e.data.isCorrect)&&n.every(e=>e.isCorrect),e.params.forEach(e=>l.params.add(e)),t.forEach((t,n)=>{Dm(e,n)===1&&t.data.params.forEach(e=>l.params.add(e))}),n.forEach(e=>e.params.forEach(e=>l.params.add(e))),r.forEach(e=>l.params.delete(e)),e.constraints.forEach((e,t)=>Cm(l.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||Cm(l.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>Cm(l.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{a(t)||Cm(l.constraints,t,Em(e,n))})),t.forEach((e,n)=>{if(e.kind!==`Operator`)return;let r=e.data;t.forEach((e,t)=>r.formals.forEach((i,a)=>{c(n,t,a)&&e.data.params.forEach(e=>Cm(l.constraints,e,Em(r,a)))}))}),e.argParams.forEach(e=>{let t=bm(e),n=s(t.operator);n?.kind===`Operator`&&Cm(l.constraints,t.param,Em(n.data,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>wm(l.argConstraints,t,e))),t.forEach((n,r)=>{if(n.kind!==`Declared`)return;let i=n.declared;Array.from({length:i.arity},(t,n)=>wm(l.argConstraints,vm(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{c(r,t,a)&&wm(l.argConstraints,vm(i.name,a),e.data.level)}))}),e.argParams.forEach(e=>{let t=bm(e),n=s(t.operator);n&&wm(l.argConstraints,vm(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{a(bm(e).param)||l.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>l.argParams.add(e))),e.argParams.forEach(e=>{let t=bm(e),n=s(t.operator);if(n)n.kind===`Declared`&&l.argParams.add(ym(n.declared.name,t.index,t.param));else{let n=s(t.param);if(!n){l.argParams.add(e);return}n.data.params.forEach(e=>l.argParams.add(ym(t.operator,t.index,e)))}}),t.forEach((e,n)=>{if(e.kind!==`Declared`)return;let r=e.declared;t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{c(n,t,a)&&e.data.params.forEach(e=>l.argParams.add(ym(r.name,a,e)))}))}),l},c=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Operator`,data:x(`LAMBDA`,dh(e.params),e.body,t)};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(n!==void 0){let r=a(n,t);if(r.kind===`Defined`&&(r.levels.formals.length>0||e.kind===`OperatorReference`))return{kind:`Operator`,data:r.levels};if(r.kind===`Declared`&&r.arity>0){let e=Sm();return e.params.add(n),{kind:`Declared`,data:e,declared:{name:n,arity:r.arity}}}if(e.kind===`OperatorReference`)return{kind:`Value`,data:Sm()}}return{kind:`Value`,data:y(e,t)}},l=(e,t)=>e.map(e=>c(e,t)),u=(e,t,n,r=[],a=ba(r))=>{let o=l(t,uh(n,dh(a))),c=r.map(e=>y(e.set,n)),u=s(e,o,c,a);return c.forEach((t,n)=>{if(t.level<=2||(u.isCorrect=!1,!t.isCorrect))return;let a=r[n].pattern,o=a.ranges?.[0];i.push(`Level error in applying operator ${e.name}:\nThe level of the range for the bounded variable ${o?m(o):ya(a)[0]} \nexceeds the maximum level allowed by the operator`)}),u},d=(e,t)=>e.kind===`Declared`?o(e.name,e.level,t):s(e.levels,t),f=(e,t)=>{yh(e)&&i.push(`${t} has both temporal formula and action as arguments`)},p=(e,t)=>{(e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2)&&i.push(`Action used where only temporal formula or state predicate allowed`),vh.has(e.operator)&&f(t.map(e=>e.data.level),xt(e.operator))},h=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;t===2&&xh(n)&&n.kind!==r&&i.push(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`)},g=(e,t)=>{let n=mh(e,t);e.recursive&&gh(t,e).forEach(e=>ne(e.members));let r=e.definitions.map(e=>S(e,n)),i=y(e.body,n),a={level:i.level,isCorrect:i.isCorrect&&r.every(e=>e.isCorrect),params:new Set(i.params),constraints:new Map(i.constraints),argConstraints:new Map(i.argConstraints),argParams:new Set(i.argParams)};return r.forEach(e=>Tm(a,e)),a},_=(e,t,n)=>i.length===e?n:(t&&i.splice(e).forEach(e=>r.push({location:m(t),message:`${e}.`})),{...n,isCorrect:!1}),v=(e,t)=>{let n=i.length;return _(n,e,t())},y=(e,t)=>{let n=i.length;return _(n,e.location.range,ee(e,t))},ee=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return Sm();case`Identifier`:return d(a(e.name,t),[]);case`Apply`:{let n=l(e.args,t);return p(e,n),d(a(e.operator,t),n)}case`OperatorReference`:case`Lambda`:return c(e,t).data;case`And`:case`Or`:{let n=e.kind===`And`;if(e.isBulleted){let r=l(e.operands,t);return f(r.map(e=>e.data.level),`${n?`Conjunction`:`Disjunction`} list`),s(n?Pm:Fm,r)}let i=n?`\\land`:`\\lor`,a=bh(e.operands[0]),o=[],u=0,d=!1;e.operands.forEach((n,s)=>{let l=c(n,t);o.push(l);let p=[u,l.data.level];if(u=Math.max(u,l.data.level),s===0)return;let h=bh(n);s===e.operands.length-1||!a||!h?f(p,i):yh(p)&&(r.push({location:m({...a,end:h.end}),message:`${i} has both temporal formula and action as arguments.`}),d=!0)});let p=s(n?Pm:Fm,o);return d?{...p,isCorrect:!1}:p}case`Prime`:return u(km,[e.expression],t);case`Unchanged`:return u(Am,[e.expression],t);case`Enabled`:return u(jm,[e.expression],t);case`Always`:case`Eventually`:{let n=c(e.expression,t);return h(e,n.data.level),s(e.kind===`Always`?Mm:Nm,[n])}case`If`:return u(Im,[e.condition,e.consequent,e.alternative],t);case`Case`:return u(Lm,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return g(e,t);case`Forall`:case`Exists`:{let n=u(e.kind===`Forall`?Rm:zm,[e.body],t,e.bounds),i=n.level===3?e.bounds.find(e=>y(e.set,t).level===2):void 0,a=i?.set.location.range;return a&&r.push({location:m(a),message:`Action-level bound of quantified temporal formula.`}),i?{...n,isCorrect:!1}:n}case`UnboundedQuantifier`:return u(e.isTemporal?e.quantifier===`Forall`?Hm:Um:e.quantifier===`Forall`?Bm:Vm,[e.body],t,[],e.names);case`Choose`:return u(e.set?Wm:Gm,[e.body],t,e.set?[{pattern:e.pattern,set:e.set}]:[],ya(e.pattern));case`SetEnumeration`:return u(Km,e.elements,t);case`Tuple`:return u(qm,e.elements,t);case`FunctionSet`:return u(Jm,[e.domain,e.range],t);case`Product`:return u(Ym,e.factors,t);case`SetFilter`:return u(Xm,[e.predicate],t,[e.bound]);case`SetMap`:return u(Zm,[e.expression],t,e.bounds);case`FunctionConstruction`:return u(Qm,[e.body],t,e.bounds);case`Record`:return u($m,e.fields.map(e=>e.value),t);case`RecordSet`:return u(eh,e.fields.map(e=>e.value),t);case`Except`:return s(th,[c(e.function,t),...e.updates.map(e=>({kind:`Value`,data:s(nh,[{kind:`Value`,data:v(e.range,()=>s(rh,e.path.map(e=>e.kind===`Field`?{kind:`Value`,data:Sm()}:e.args.length===1?c(e.args[0],t):{kind:`Value`,data:v(e.tupleRange,()=>u(qm,e.args,t))})))},c(e.value,t)])}))]);case`FunctionApplication`:return s(ih,[c(e.function,t),e.args.length===1?c(e.args[0],t):{kind:`Value`,data:u(qm,e.args,t)}]);case`Bracket`:return Sm();case`FieldAccess`:return s(ah,[c(e.record,t),{kind:`Value`,data:Sm()}]);case`BoxAction`:case`AngleAction`:return u(e.kind===`BoxAction`?oh:sh,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return u(e.kind===`WeakFairness`?ch:lh,[e.subscript,e.action],t);case`Label`:return y(e.body,t);case`Selection`:{let r=e.expression,i=n.get(r);if(i)return i;let a=y(r,t);return n.set(r,a),a}case`Subexpression`:return Sm()}},b=(e,t,n=!1,r=/* @__PURE__ */ new Set)=>{let i=(e,i=n,a=t)=>b(e,a,i,r),o=(e,o)=>{let s=a(e,t);s.kind===`Declared`?(n&&r.add(e),o.forEach(e=>i(e))):o.forEach((e,t)=>i(e,n||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),r;case`Apply`:return o(e.operator,e.args),r;case`Lambda`:case`Let`:case`Selection`:return r;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return gt(e).forEach(e=>i(e,!0)),r;case`UnboundedQuantifier`:return i(e.body,n||e.isTemporal===!0,uh(t,dh(e.names))),r;default:return Lp(e,(e,r)=>i(e,n,uh(t,dh(r)))),r}},x=(e,t,n,r)=>{let i=uh(r,t),a=y(n,i),o=e=>t.some(t=>t.name===e),s=b(n.kind===`Selection`?n.expression:n,i),c={...Sm(a.level),isCorrect:a.isCorrect,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(vm(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(ym(e.name,n,t.name))).map(e=>xm(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(bm(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=bm(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},te=/* @__PURE__ */ new Set,S=(e,n)=>{let r=t.get(e);if(r&&!te.delete(e))return r;let i=r??hh(e,3,0);t.set(e,i);let a=x(e.name,fh(e),ph(e),n),o={...a,level:Math.max(i.level,a.level),params:/* @__PURE__ */ new Set([...i.params,...a.params]),argParams:/* @__PURE__ */ new Set([...i.argParams,...a.argParams]),maxLevels:a.maxLevels.map((e,t)=>Math.min(e,i.maxLevels[t])),weights:a.weights.map((e,t)=>Math.max(e,i.weights[t])),nonLeibniz:/* @__PURE__ */ new Set([...i.nonLeibniz,...a.nonLeibniz])};return t.set(e,o),o},C=e=>e.forEach(e=>{let t=e.definition.location.range;e.definition.isRecursive&&t&&S(e.definition,e.scope).maxLevels.forEach((n,i)=>{n>=2||r.push({location:m(t),message:`Argument ${i+1} of recursive operator ${xt(e.definition.name)} is primed`})})}),ne=e=>{if(e.length===0||t.has(e[0].definition))return;let n=e.filter(e=>e.definition.isRecursive);n.forEach(e=>t.set(e.definition,hh(e.definition,2,1)));let r=e=>(e.definition.isRecursive&&te.add(e.definition),S(e.definition,e.scope));e.forEach(e=>{r(e),C([e])});let i=n.map(e=>S(e.definition,e.scope)),a=Math.max(0,...i.map(e=>e.level)),o=i.flatMap(e=>[...e.params]);e.forEach(e=>{let n=S(e.definition,e.scope);t.set(e.definition,{...n,level:Math.max(n.level,a),params:/* @__PURE__ */ new Set([...n.params,...o])}),e.isRechecked&&!e.definition.isRecursive&&te.add(e.definition)}),e.forEach(r)};return{analyze:y,analyzeDefinition:S,checkPrimedArguments:C,checkRecursiveSection:ne,toOperand:c,errors:r}},Ch=(e,t,n)=>{let r=new Map(t),i=e.assumptions.flatMap(e=>{if(e.kind===`NewSymbol`){let t=e.set&&n.analyze(e.set,r),i=e.location.range;return t?.level===3&&i&&n.errors.push({location:m(i),message:`Level error:
|
|
403
|
+
Temporal formula used as set.`}),r.set(e.name,{kind:`Formal`,arity:e.arity,level:_m[e.level]}),t?[t]:[]}return[e.kind===`AssumeProve`?Ch(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=Sm(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),Tm(a,e)}),a},wh=(e,t,n,r)=>{let i=Sh(t),a=(e,t)=>Math.max(0,...e.map(e=>i.analyze(e,t).level)),o=(e,t)=>{let n=e.body;return n.kind===`Have`||n.kind===`Case`?a([n.expression],t):n.kind===`Witness`?a(n.expressions,t):n.kind===`Take`?a(n.bounds.map(e=>e.set),t):n.kind===`Pick`?a([n.body,...n.bounds.map(e=>e.set)],t):n.kind===`Assert`?n.statement.kind===`AssumeProve`?Ch(n.statement,t,i).level:a([n.statement],t):0},s=(e,t)=>e.forEach(e=>{e.kind!==`ModuleFact`&&i.analyze(e,t)}),c=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=m(e.statement),n=()=>o(e,/* @__PURE__ */ new Map)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?n()?[]:[{location:t,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...n()?[]:[{location:t,message:`Non-constant CASE for temporal goal.`}],...c(e.proof)]:e.body.kind===`Qed`?c(e.proof):[]}):[],l=(e,t)=>{if(e?.kind===`By`)return s(e.facts,t),i.errors.splice(0);if(e?.kind!==`Steps`)return[];let n=new Map(t);return e.steps.flatMap(e=>{let t=e.body;(t.kind===`Use`||t.kind===`Hide`)&&s(t.facts,n),t.kind===`Define`&&t.definitions.forEach(e=>{e.kind!==`Instance`&&(n.set(e.name,{kind:`Let`,definition:e,scope:n}),i.analyzeDefinition(e,n))});let r=o(e,n)===3,u=t.kind===`Pick`&&t.bounds.length>0&&r?t.bounds.filter(e=>a([e.set],n)!==0).flatMap(e=>e.set.location.range?[{location:m(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...i.errors.splice(0),...l(e.proof,n),...u,...e.proof?.kind===`Steps`&&r?c(e.proof):[]]})},u=/* @__PURE__ */ new Map,d=e=>{let t=u.get(e);if(t!==void 0)return t;let n=e.kind===`AssumeProve`?Ch(e,/* @__PURE__ */ new Map,i).level:i.analyze(e,/* @__PURE__ */ new Map).level;return u.set(e,n),n},f=[...e.theorems,...e.assumptions.map(e=>({...e,statement:e.expression}))],p=new Set(f.map(e=>e.statement)),h=gh(/* @__PURE__ */ new Map,e.units,e.hasRecursiveLet),g=(e,t)=>({location:e,check:e=>{t(),e.push(...i.errors.splice(0))}});return{sections:h.map(e=>g(e.location,()=>i.checkRecursiveSection(e.members))),check:t=>[(t?h:[]).map(e=>g(e.location,()=>i.checkPrimedArguments(e.members))),e.definitions.filter(e=>!e.name.includes(`!`)&&!p.has(e.body)).map(e=>g(e.location,()=>i.analyzeDefinition(e,/* @__PURE__ */ new Map))),f.filter(e=>e.name!==void 0).map(e=>g(e.location,()=>d(e.statement))),[...e.assumptions.map(e=>({location:e.location,check:t=>{let n=d(e.expression);t.push(...i.errors.splice(0));let r=e.location.range;n!==0&&r&&t.push({location:m(r),message:`Level error: assumptions must be level 0 (Constant), \nbut this one has level ${n}.`})}})),...e.theorems.map(e=>({location:e.location,check:t=>{let n=d(e.statement);t.push(...i.errors.splice(0),...l(e.proof,/* @__PURE__ */ new Map),...n===3?c(e.proof):[],...i.errors.splice(0))}})),...e.uses.map(e=>g(e.location,()=>s(e.facts,/* @__PURE__ */ new Map))),...n]].flatMap(e=>Vo(e,r))}},Th=1024,Eh=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),Dh=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),Oh=/* @__PURE__ */ new Set([...Eh,...Dh,`Enabled`]),kh=/* @__PURE__ */ new Set([`~>`,`-+->`]),Ah=/* @__PURE__ */ new Set([...kh,`\\cdot`]),jh=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Mh=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),Nh=/* @__PURE__ */ new Set([`RandomSubset`,`RandomSetOfSubsets`,`TestRandomSetOfSubsets`,`RandomSubsetSet`]),Ph=(e,t)=>jh.has(e)||t.builtins.get(e)?.isStateLevel===!0,Fh=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(Eh.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(Dh.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&kh.has(e.operator))return 224},o=/* @__PURE__ */ new Map,s=(e,n,c)=>{let l=e.kind;if(l===`Selection`){let t=o.get(e.expression)??0,r=n?c?1:2:c?4:8;if((t&r)!==0)return;o.set(e.expression,t|r)}let u=c?1:513;(Oh.has(l)||l===`UnboundedQuantifier`&&e.isTemporal===!0||l===`Apply`&&Ah.has(e.operator))&&(r[0]|=u),Oh.has(l)&&(r[0]|=16);let d=a(e);n&&d!==void 0&&(r[0]|=d);let f=n&&d===void 0,p=_t(e);if(p!==void 0&&M(e)&&t.variableIndex.has(p)&&(c||(r[0]|=512),f&&(r[0]|=32)),p!==void 0&&!M(e)){let e=t.substitutions.get(p)??p,n=t.definitions.get(e),a=t.constants.has(p),o=t.variableIndex.get(p);if((o!==void 0||t.builtins.get(e)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=u),o!==void 0&&(f&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:f,isOperatorArgument:c||l===`OperatorReference`||l===`Identifier`&&n.kind===`Operator`&&n.params.length>0});else{Ph(e,t)&&(r[0]|=2|(e===`Assert`?0:4)),Mh.has(e)&&(r[0]|=8),Nh.has(e)&&(r[0]|=256),e===`TLCEval`&&(r[0]|=Th),!a&&Ph(e,t)&&(r[0]|=16);let n=t.builtins.get(e);f&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}gt(e).forEach(e=>s(e,f,c||l===`Lambda`))};return e.forEach(e=>s(e,!0,!1)),{row:r,edges:i}},Ih=(e,t,n,r)=>{let i=n.length,a=e.slice(),o=new Int32Array(i).fill(-1),s=new Int32Array(i),c=new Int32Array(i).fill(-1),l=[],u=[],d=0,f=0,p=(e,n)=>{for(let i=0;i<t;i++){let o=a[n*t+i];a[e*t+i]|=i===0?o&r:o}},m=e=>{u.push(e,0),o[e]=s[e]=d++,l.push(e)};for(let e=0;e<i;e++)if(o[e]===-1)for(m(e);u.length>0;){let e=u[u.length-2],t=u[u.length-1],r=n[e];if(t<r.length){u[u.length-1]=t+1;let n=r[t];o[n]===-1?m(n):c[n]===-1&&(s[e]=Math.min(s[e],o[n]));continue}if(u.length-=2,u.length>0){let t=u[u.length-2];s[t]=Math.min(s[t],s[e])}if(s[e]!==o[e])continue;let i=[];for(;;){let t=l.pop()??e;if(c[t]=f,i.push(t),t===e)break}f++;let a=i[0];i.forEach(e=>{e!==a&&p(a,e),n[e].forEach(e=>{c[e]!==c[a]&&p(a,e)})}),i.forEach(e=>{e!==a&&p(e,a)})}return a},Lh=1294,Rh=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&513),zh=e=>{let t=[...new Set(e.definitions.values())],n=new Map(t.map((e,t)=>[e,t])),r=1+(e.variables.length+31>>>5),i=new Uint32Array(t.length*r),a=new Uint32Array(t.length*r),o=t.map((t,n)=>{let o=Fh(ht(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&Lh,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=Ih(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=Ih(i,r,u,224),f=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&!e.isOperatorArgument).map(s))),p=Ih(i,r,f,512),m=o.map(e=>new Int32Array(e.map(s).filter(e=>!Rh(t[e],l[e*r]|p[e*r])))),h=Ih(a,r,m,Lh);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|p[t]&512|d[t]&224|h[t]&Lh:e),words:r}},Bh=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?Vh(ht(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},Vh=(e,t)=>{let n=t.facts.words,r=Fh(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=Bh(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isOperatorArgument||(i[0]|=r[0]&512),e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}Rh(e.callee,r[0])||(i[0]|=r[0]&Lh)}),i},Hh=(e,t)=>!(Bh(e,t)[0]&513),Uh=(e,t)=>!(Bh(e,t)[0]&512),Wh={any:2,repeated:4,streamed:8,replayed:260,varying:258},Gh=(e,t,n)=>(Vh(e,t)[0]&Wh[n])!==0,Kh=(e,t,n=`any`)=>(Bh(e,t)[0]&Wh[n])!==0,qh=(e,t)=>!!(Vh([e],t)[0]&Th),Jh=(e,t)=>{let n=Bh(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},Yh=e=>{let t=[];for(let n=1;n<e.length;n++)for(let r=e[n];r!==0;r&=r-1)t.push((n-1<<5)+(31-Math.clz32(r&-r)));return t},Xh=(e,t)=>{let n=Vh([e],t);return n[0]&16?void 0:Yh(n)},Zh=(e,t)=>!!(Vh([e],t)[0]&1),Qh=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`,`Choose`,`SetFilter`,`FunctionConstruction`]),$h=()=>({implication:hx,negate:gx,equivalent:_x,body:vx,condition:(e,t)=>{if(typeof e!=`boolean`)throw Qb(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw $b(t,n,e);return e},apply:Lu,expectFunction:dx,tuple:Il,set:bl,record:Rl,writtenRecord:Ks,equal:Vc,enumerate:Tx,choiceElements:rC,noChoice:e=>{throw iC(e)},filterPredicate:nC,isReducible:Fs,finiteElements:e=>G(e).elements,addBounded:js,normalizedSet:kc,isBeyondBound:Ms,cardinality:cu,functionDomain:Pl,sortedFunction:Ac,unassigned:(e,t)=>{throw ox(e,t)},prime:SS,keepLazyContext:fx,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>lx(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})});let eg,tg;const ng=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},rg=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),ig=e=>`local${e.counter++}`,ag=(e,t=/* @__PURE__ */ new Set)=>{let n=_t(e);return n!==void 0&&t.add(n),e.kind!==`Selection`&>(e).forEach(e=>ag(e,t)),t},og=(e,t,n)=>{if(n.locals.size===0)return n.context;let r=qh(t,e.environment),i=ag(t),a=[...n.locals].filter(e=>r||i.has(e[0]));if(a.length===0)return n.context;let o=rg(e,a.map(e=>e[0]));return`extend(${n.context}, ${o}, [${a.map(e=>e[1]).join(`, `)}])`},sg=(e,t,n)=>`${rg(e,jS(t,e.environment))}(${og(e,t,n)})`,cg=(e,t,n)=>{let r=`helper${e.counter++}`,i=[...t.locals.values()],a={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(t.locals)},o=i.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${r}(context, state, next${o}) { let primed; let applied; ${n(a)} }`),`${r}(${t.context}, ${t.state}, ${t.isPrimed?`undefined`:t.next}${o})`},lg=(e,t,n,r)=>{let i=ig(e),a=ig(e),o=ig(e);return`for (let ${i} = 0, ${a} = ${t}.low, ${o} = ${a} === undefined ? ${t}.length : ${t}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${t}[${i}] : ${a} + ${i}; ${r} }`},ug=(e,t,n)=>{let r=t.kind===`Forall`;return cg(e,n,n=>{let i=t.bounds.map(()=>ig(e)),a=t.bounds.map((r,a)=>a>0&&t.bounds[a-1].set===r.set?`const ${i[a]} = ${i[a-1]};`:`const ${i[a]} = enumerate(${_g(e,r.set,n)}, ${rg(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=ig(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${_g(e,t.body,n)}, ${rg(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>lg(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},dg=(e,t,n,r,i)=>cg(e,i,i=>{let a=ig(e),o=ig(e),s=rg(e,t),c=`choiceElements(${_g(e,n,i)}, ${s}, ${rg(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${_g(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${lg(e,a,o,l)} return noChoice(${s});`}),fg=(e,t,n,r)=>cg(e,r,r=>{let i=ig(e),a=ig(e),o=ig(e),s=ig(e),c=rg(e,t),l=`if (!isReducible(${i})) return ${rg(e,$S(t,e.environment))}(${i}, ${og(e,t,r)});`,u=_g(e,t.bound.set,r);r.locals.set(n,s);let d=tC(t,e.environment)?` else break;`:``,f=`if (filterPredicate(${_g(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});${d}`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${lg(e,a,s,f)} return normalizedSet(${o});`}),pg=(e,t,n,r)=>cg(e,r,r=>{let i=ig(e),a=ig(e),o=ig(e),s=ig(e),c=ig(e),l=ig(e),u=rg(e,XS(t,e.environment)),d=og(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=_g(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${_g(e,t.body,r)}; if (!${a}) ${s}.push(${l});`;return`const ${i} = ${p}; ${f} const ${a} = isBeyondBound(${i}); const ${o} = ${a} ? ${i} : functionDomain(${i}); if (${a}) cardinality(${i}); const ${s} = []; ${lg(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),mg=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=_g(e,r[0],n),a=_g(e,r[1],n),o=rg(e,t);return`(implication(${i}, ${o}, "P") ? implication(${a}, ${o}, "Q") : true)`}if(t.operator===`~`&&r.length===1)return`negate(${_g(e,r[0],n)}, ${rg(e,t)})`;if(t.operator===`<=>`)return`equivalent(${_g(e,r[0],n)}, ${_g(e,r[1],n)}, ${rg(e,t)})`;if(M(t))return sg(e,t,n);let i=$x(t.operator,e.environment);if(i?.kind!==`Builtin`)return sg(e,t,n);if(i.name===`DOMAIN`)return`${rg(e,nx(t))}(${_g(e,r[0],n)})`;if(i.name===`\\subseteq`&&i.evaluateBinary&&r.length===2)return`${rg(e,rx(t,i.evaluateBinary))}(${_g(e,r[0],n)}, ${_g(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&PS(r[0],a))return`${rg(e,i.evaluateUnary)}(${_g(e,r[0],n)})`;let o=r.length===2&&PS(r[0],a)&&PS(r[1],a);return i.evaluateBinary&&o?`${rg(e,i.evaluateBinary)}(${_g(e,r[0],n)}, ${_g(e,r[1],n)})`:sg(e,t,n)},hg=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(M(e))return!1;let r=uS(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return hg(e.expression,t,n);case`FieldAccess`:return hg(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>hg(e,t,n));default:return!1}},gg=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return gg(e.record);case`FunctionApplication`:return[e.function,...e.args].every(gg);default:return!1}},_g=(e,t,n)=>{let r=(t,r=n)=>_g(e,t,r);switch(t.kind){case`Number`:return Bs(t.value)?String(t.value):sg(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(M(t))return sg(e,t,n);let i=uS(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=rg(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?rg(e,i.value):sg(e,t,n)}case`Apply`:return mg(e,t,n);case`And`:case`Or`:{if(t.operands.length===0)return String(t.kind===`And`);let n=rg(e,t),i=t.kind===`And`?` && `:` || `;return`(${t.operands.map((e,t)=>`junct(${r(e)}, ${n}, ${t})`).join(i)})`}case`If`:return`(condition(${r(t.condition)}, ${rg(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{GS(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${hg(t.function,n,e.environment)?r(t.function):gg(t.function)?r(t.function,i):sg(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${rg(e,t)}))`,o=tx(e.environment.runtime.version),s=o?`, ${rg(e,o)}`:``;return t.args.length===1?`apply(${a}, ${r(t.args[0])}${s})`:`apply(${a}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${s})`}case`FieldAccess`:return`${rg(e,ex(t))}(${r(t.record)})`;case`Record`:{let i=oC(t.fields);if(sC(i))return sg(e,t,n);let a=rg(e,i.map(e=>e.name)),o=`[${t.fields.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${rg(e,i.map(e=>t.fields.indexOf(e)))}, ${o}, ${rg(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:return n.isPrimed?sg(e,t,n):r(t.expression,{context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals});case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?ug(e,t,n):sg(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?dg(e,t,t.set,t.pattern.name,n):sg(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!YS(t)?pg(e,t,r.pattern.name,n):sg(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?fg(e,t,t.bound.pattern.name,n):sg(e,t,n);default:return sg(e,t,n)}},vg=(e,t)=>{if(!Qh.has(e.kind)||(tg??=ng(),!tg))return;let n={environment:t,references:[],helpers:[],counter:0},r=_g(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
|
|
404
|
+
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;return eg??=$h(),Function(...Object.keys(eg),...i,a)(...Object.values(eg),...n.references)},yg=(e,n,r)=>new t(`Applying ${e} to the following value,\nwhich is not ${n}:\n${U(q(r))}`),bg=e=>Is(e)?K(e):void 0,xg=`a function with a finite domain`,Sg=(e,t,n)=>{let r=J(e,t,n),i=bg(r);if(!i)throw yg(n,xg,r);return i},Cg=(e,t)=>{let n=J(e,1,t),r=bg(n),i=r&&Dg(r,J(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw Qf(`second`,t,`bag`,n);return i},wg=(e,t,n)=>{let r=t[n];if(!r||!Eg(r))throw Qf(n===0?`first`:`second`,`(+)`,`bag`,J(e,n,`(+)`));return r},Tg=(e,t)=>{if(!Ps(e)||!W(e))throw t();return G(e).elements},Eg=e=>e.range.every(e=>typeof e==`number`&&e>0),Dg=(e,t)=>{let n=e.domain.findIndex(e=>gl(t,e));return n===-1?void 0:e.range[n]},Og=(e,t)=>{if(typeof e==`number`)return e;throw t()},kg=(e,t,n)=>{let r=Og(e,n)+Og(t,n);if(sp(r))throw cp(`${e}+${t}`);return r},Ag=(e,t,n,r,i)=>{let a=Og(e.range[t],r),o=Dg(n,e.domain[t]);if(o===void 0)return a;let s=a-Og(o,i);if(sp(s))throw cp(`${a}-${o}`);return s},jg=(e,t,n,r,i=e.length)=>{let a=e.slice(0,i).find(e=>gl(t,e[0]));a?a[1]=kg(a[1],n,r):e.push([t,n])},Mg=e=>e.domain.map((t,n)=>[t,e.range[n]]),Ng=Ac([],[]),Pg=e=>[rp(`EmptyBag`,Ng),Y(`IsABag`,1,e=>{let t=bg(J(e,0,`IsABag`));return t!==void 0&&Eg(t)}),Y(`BagCardinality`,1,e=>{let t=J(e,0,`BagCardinality`),n=Sg(e,0,`BagCardinality`),r=()=>yg(`BagCardinality`,`a bag`,t);return n.range.reduce((e,t)=>{if(typeof t!=`number`||t<=0)throw r();return kg(e,t,r)},0)}),Y(`BagIn`,2,e=>{let t=Cg(e,`BagIn`);return t!==void 0&&t>0}),Y(`CopiesIn`,2,e=>Cg(e,`CopiesIn`)??0),Y(`\\oplus`,2,e=>{let t=[0,1].map(t=>bg(J(e,t,`(+)`))),n=wg(e,t,0),r=wg(e,t,1),i=Mg(n),a=()=>Qf(`second`,`(+)`,`bag`,J(e,1,`(+)`));return r.domain.forEach((e,t)=>jg(i,e,r.range[t],a,n.domain.length)),Tl(i)}),Y(`\\ominus`,2,e=>{let t=J(e,0,`(-)`),n=J(e,1,`(-)`),r=bg(t),i=bg(n);if(!r)throw Qf(`first`,`(-)`,`bag`,t);if(!i)throw Qf(`second`,`(-)`,`bag`,n);let a=()=>Qf(`first`,`(-)`,`bag`,t),o=()=>Qf(`second`,`(-)`,`bag`,n);return Tl(r.domain.flatMap((e,t)=>{let n=Ag(r,t,i,a,o);return n>0?[[e,n]]:[]}))}),Y(`BagUnion`,1,e=>{let n=J(e,0,`BagUnion`),r=Tg(n,()=>yg(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??Ng;let i=()=>new t(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${U(q(n))}`),a=e=>{let t=bg(e);if(!t)throw i();return t},o=Mg(a(r[0]));return r.slice(1).forEach(e=>{let t=a(e);t.domain.forEach((e,n)=>jg(o,e,t.range[n],i))}),Tl(o)}),Y(`\\sqsubseteq`,2,e=>{let t=J(e,0,`\\sqsubseteq`),n=J(e,1,`\\sqsubseteq`),r=bg(t),i=bg(n);if(!r)throw yg(`\\sqsubseteq`,xg,t);if(!i)throw yg(`\\sqsubseteq`,xg,n);let a=()=>yg(`\\sqsubseteq`,`a bag`,t),o=()=>yg(`\\sqsubseteq`,`a bag`,n);return r.domain.every((e,t)=>{let n=Dg(i,e);return Og(r.range[t],a)<=(n===void 0?0:Og(n,o))})}),ip(`BagOfAll`,2,e=>{let t=np(e,0,`BagOfAll`),n=J(e,1,`BagOfAll`),r=bg(n);if(!r)throw Qf(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[],a=()=>Qf(`second`,`BagOfAll`,`bag`,n);return r.domain.forEach((e,n)=>jg(i,t.call([e]),r.range[n],a)),Tl(i)}),Y(`SubBag`,1,t=>{let n=J(t,0,`SubBag`);if(!Is(n))throw new w(`Attempted to apply the operator DOMAIN to a non-function\n(${mp(n)})\nline 106, col 58 to line 106, col 65 of module Bags`);let r=K(n),i=G(bl(r.range)).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new w(`Attempted to apply a function to ${q(r)}, which is not in its domain`);return yl(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>Ac(e.map(e=>e[0]),e.map(e=>e[1]))))}),Y(`BagToSet`,1,e=>zu(Sg(e,0,`BagToSet`))),Y(`SetToBag`,1,e=>{let t=J(e,0,`SetToBag`),n=Tg(t,()=>yg(`BagToSet`,xg,t));return Ac([...n],n.map(()=>1))})],Fg={emptyArray:1,nonemptyArray:2,emptyObject:3,danglingName:4,nonemptyObject:5,emptyDocument:6,nonemptyDocument:7},Z={none:0,beginObject:1,endObject:2,beginArray:3,endArray:4,true:5,false:6,null:7,singleQuoted:8,doubleQuoted:9,unquoted:10,singleQuotedName:12,doubleQuotedName:13,unquotedName:14,number:16,eof:17},Ig={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},Lg=[{lower:`true`,upper:`TRUE`,token:Z.true},{lower:`false`,upper:`FALSE`,token:Z.false},{lower:`null`,upper:`NULL`,token:Z.null}],Rg=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
|
|
405
|
+
`],[`r`,`\r`],[`f`,`\f`]]),zg=1024,Bg=e=>{let t=+!!e.startsWith(``),n=t,r=0,i=t,a=!0,o=Z.none,s=0,c=[Fg.emptyDocument],l=[void 0],u=[0],d=()=>`$${c.map((e,t)=>e===Fg.emptyArray||e===Fg.nonemptyArray?`[${u[t]}]`:e===Fg.emptyDocument||e===Fg.nonemptyDocument?``:`.${l[t]??``}`).join(``)}`,f=()=>` at line ${r+1} column ${n-i+1} path ${d()}`,p=e=>new w(`com.google.gson.stream.MalformedJsonException: ${e}${f()}
|
|
406
406
|
See https://github.com/google/gson/blob/main/Troubleshooting.md#malformed-json`),m=()=>new w(`java.io.EOFException: End of input${f()}`),h=()=>{if(!a)throw p(`Use JsonReader.setStrictness(Strictness.LENIENT) to accept malformed JSON`)},g=e=>`/\\;#=`.includes(e)?(h(),!1):!`{}[]:, \f\r
|
|
407
407
|
`.includes(e),_=()=>{for(;n<e.length;){let t=e[n++];if(t===`
|
|
408
408
|
`){r++,i=n;return}if(t===`\r`)return}},v=t=>{for(;n+t.length<=e.length;n++)if(e[n]===`
|
|
409
409
|
`)r++,i=n+1;else if(e.startsWith(t,n))return!0;return!1},y=()=>{for(;n<e.length;){let t=e[n++];if(t===`
|
|
410
|
-
`)r++,i=n;else if(t===`/`){if(n===e.length)return t;h();let r=e[n];if(r!==`*`&&r!==`/`)return t;if(n++,r===`/`)_();else if(v(`*/`))n+=2;else throw p(`Unterminated comment`)}else if(t===`#`)h(),_();else if(t!==` `&&t!==`\r`&&t!==` `)return t}},ee=()=>{let e=y();if(e===void 0)throw m();return e},b=()=>{let t=
|
|
411
|
-
`,n)&&(n+=5),c[t]=
|
|
410
|
+
`)r++,i=n;else if(t===`/`){if(n===e.length)return t;h();let r=e[n];if(r!==`*`&&r!==`/`)return t;if(n++,r===`/`)_();else if(v(`*/`))n+=2;else throw p(`Unterminated comment`)}else if(t===`#`)h(),_();else if(t!==` `&&t!==`\r`&&t!==` `)return t}},ee=()=>{let e=y();if(e===void 0)throw m();return e},b=()=>{let t=Lg.find(t=>e[n]===t.lower[0]||e[n]===t.upper[0]);if(!t)return Z.none;let r=t.lower.length;for(let i=0;i<r;i++){let r=e[n+i];if(r!==t.lower[i]&&r!==t.upper[i])return Z.none}return n+r<e.length&&g(e[n+r])?Z.none:(n+=r,t.token)},x=()=>{let t=Ig.none,r=!1,i=0;for(;n+i<e.length;i++){if(i===zg)return Z.none;let a=e[n+i];if(a===`-`){if(t===Ig.none)t=Ig.sign;else if(t===Ig.exponentE)t=Ig.exponentSign;else return Z.none}else if(a===`+`){if(t!==Ig.exponentE)return Z.none;t=Ig.exponentSign}else if(a===`e`||a===`E`){if(t!==Ig.digit&&t!==Ig.fractionDigit)return Z.none;t=Ig.exponentE}else if(a===`.`){if(t!==Ig.digit)return Z.none;t=Ig.decimal}else if(a<`0`||a>`9`){if(g(a))return Z.none;break}else if(t===Ig.sign||t===Ig.none)r=a===`0`,t=Ig.digit;else if(t===Ig.digit){if(r)return Z.none}else t===Ig.decimal?t=Ig.fractionDigit:(t===Ig.exponentE||t===Ig.exponentSign)&&(t=Ig.exponentDigit)}return i===zg||t!==Ig.digit&&t!==Ig.fractionDigit&&t!==Ig.exponentDigit?Z.none:(s=i,Z.number)},te=()=>{let t=c.length-1,r=c[t];if(r===Fg.emptyArray)c[t]=Fg.nonemptyArray;else if(r===Fg.nonemptyArray){let e=ee();if(e===`]`)return Z.endArray;if(e===`;`)h();else if(e!==`,`)throw p(`Unterminated array`)}else if(r===Fg.emptyObject||r===Fg.nonemptyObject){if(c[t]=Fg.danglingName,r===Fg.nonemptyObject){let e=ee();if(e===`}`)return Z.endObject;if(e===`;`)h();else if(e!==`,`)throw p(`Unterminated object`)}let e=ee();if(e===`"`)return Z.doubleQuotedName;if(e===`'`)return h(),Z.singleQuotedName;if(e===`}`){if(r!==Fg.nonemptyObject)return Z.endObject;throw p(`Expected name`)}if(h(),n--,g(e))return Z.unquotedName;throw p(`Expected name`)}else if(r===Fg.danglingName){c[t]=Fg.nonemptyObject;let r=ee();if(r===`=`)h(),e[n]===`>`&&n++;else if(r!==`:`)throw p(`Expected ':'`)}else if(r===Fg.emptyDocument){if(y()===void 0)return Z.eof;n--,e.startsWith(`)]}'
|
|
411
|
+
`,n)&&(n+=5),c[t]=Fg.nonemptyDocument}else if(r===Fg.nonemptyDocument){if(y()===void 0)return Z.eof;h(),n--}let i=y();if(i===void 0){if(r===Fg.emptyDocument)return Z.eof;throw m()}if(i===`]`&&r===Fg.emptyArray)return Z.endArray;if(i===`]`||i===`;`||i===`,`){if(r!==Fg.emptyArray&&r!==Fg.nonemptyArray)throw p(`Unexpected value`);return h(),n--,Z.null}if(i===`'`)return h(),Z.singleQuoted;if(i===`"`)return Z.doubleQuoted;if(i===`[`)return Z.beginArray;if(i===`{`)return Z.beginObject;n--;let a=b();if(a!==Z.none)return a;let o=x();if(o!==Z.none)return o;if(!g(e[n]))throw p(`Expected value`);return h(),Z.unquoted},S=()=>(o===Z.none&&(o=te()),o),C=()=>{if(n===e.length)throw p(`Unterminated escape sequence`);let t=e[n++];if(t===`u`){if(n+4>e.length)throw p(`Unterminated escape sequence`);let t=e.slice(n,n+4);if(!/^[\da-fA-F]{4}$/.test(t))throw p(`Malformed Unicode escape \\u${t}`);return n+=4,String.fromCharCode(Number.parseInt(t,16))}let a=Rg.get(t);if(a!==void 0)return a;if(t===`
|
|
412
412
|
`)return r++,i=n,t;if(`'"\\/`.includes(t))return t;throw p(`Invalid escape sequence`)},ne=t=>{let a=``,o=n;for(;n<e.length;){let s=e[n++];if(s===t)return a+e.slice(o,n-1);s===`\\`?(a+=e.slice(o,n-1)+C(),o=n):s===`
|
|
413
|
-
`&&(r++,i=n)}throw p(`Unterminated string`)},re=()=>{let t=n;for(;n<e.length&&g(e[n]);)n++;return e.slice(t,n)},T=e=>{if(c.length-1>=255)throw new w(`com.google.gson.stream.MalformedJsonException: Nesting limit 255 reached${f()}`);c.push(e),l.push(void 0),u.push(0),o=Z.none},ie=()=>{c.pop(),l.pop(),u.pop(),u[c.length-1]++,o=Z.none},ae=()=>{let e=S();return e!==Z.endObject&&e!==Z.endArray&&e!==Z.eof},oe=()=>{let e=S(),t=e===Z.unquotedName?re():ne(e===Z.singleQuotedName?`'`:`"`);return o=Z.none,l[c.length-1]=t,t},se=t=>t===Z.true||t===Z.false?t===Z.true:t===Z.null?null:t===Z.number?(n+=s,{literal:e.slice(n-s,n)}):t===Z.unquoted?re():ne(t===Z.singleQuoted?`'`:`"`),E=()=>{let e=S();if(e===Z.beginArray){T(Tg.emptyArray);let e=[];for(;ae();)e.push(E());return ie(),e}if(e===Z.beginObject){T(Tg.emptyObject);let e=/* @__PURE__ */ new Map;for(;ae();)e.set(oe(),E());return ie(),e}let t=se(e);return o=Z.none,u[c.length-1]++,t};if(S()===Z.eof)return null;let ce=E();return a=!1,ce!==null&&S(),ce},jg=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),Mg=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),Ng=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),Pg=e=>{if(!pn(e))return;let t=I(e),n=t.domain.flatMap((e,n)=>typeof e==`string`?[[e,t.range[n]]]:[]);return n.length===t.domain.length?mi(n):void 0},Fg=(e,t)=>{let n=`tlc2.value.impl.${zs(e)}`,r=`tlc2.value.impl.${t}`;return new w(`class ${n} cannot be cast to class ${r} (${n} and ${r} are in unnamed module of loader 'app')`)},Ig=e=>new w(`Cannot convert value: unsupported value type tlc2.value.impl.${zs(e)}`),Lg=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Rg=e=>`[${e.map(Hg).join(`,`)}]`,zg=e=>`{${Sn(e).map(e=>`${Lg(typeof e[0]==`string`?e[0]:L(e[0]))}:${Hg(e[1])}`).join(`,`)}}`,Bg=e=>{let t=I(e),n=Wi(t);return n?Rg(n):zg(t)},Vg=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,Hg=e=>typeof e==`string`?Lg(e):typeof e==`object`?e.kind===`ModelValue`?Lg(e.name):zs(e)===`RecordValue`?zg(I(e)):Ug(e):String(e),Ug=e=>{let t=zs(e);if(t===`TupleValue`)return Rg(I(e).range);if(Vg(t))return Bg(e);if(gi(e))return Rg(F(e).elements);throw Ig(e)},Wg=e=>e.map(e=>`${Hg(e)}\n`).join(``),Gg=e=>{let t=zs(e);if(t===`RecordValue`)return zg(I(e));if(t===`TupleValue`)return`{${I(e).range.map((e,t)=>`"${t}":${Hg(e)}`).join(`,`)}}`;if(Vg(t))return Bg(e);throw Ig(e)},Kg=e=>{if(e===null)throw new w(`Cannot convert value: unsupported JSON value null`);if(typeof e==`boolean`)return e;if(typeof e==`string`)return Wn(e);if(Array.isArray(e))return pi(e.map(Kg));if(e instanceof Map)return mi([...e].map(e=>[Wn(e[0]),Kg(e[1])]));let t=Number(e.literal);if(!/^-?\d+$/.test(e.literal)||Ns(t))throw new w(`Cannot convert value: expected a 32-bit integer JSON number, but found ${e.literal}`);return t||0},qg=e=>{if(typeof e!=`string`)throw new w(`Cannot cast tlc2.value.impl.${zs(e)} to tlc2.value.impl.StringValue`);return e},Jg=(e,t)=>{let n=ma(e,t);if(typeof n!=`string`)throw Fg(n,`StringValue`);return n},Yg=e=>{if(!Mg.has(e.toLowerCase()))throw Ng.has(e.toLowerCase())?new p(`IOUtils!Serialize does not support the charset ${e}`):new w(/^[a-zA-Z\d][\w.:+-]*$/.test(e)?`java.nio.charset.UnsupportedCharsetException: ${e}`:`java.nio.charset.IllegalCharsetNameException: ${e}`)},Xg=(e,t,n,r)=>{let i=n.find(e=>!jg.has(e));if(i!==void 0)throw new w(`java.lang.IllegalArgumentException: No enum constant java.nio.file.StandardOpenOption.${i}`);if(n.includes(`READ`))throw new w(`java.lang.IllegalArgumentException: READ not allowed`);let a=new Set(n.length===0?[`CREATE`,`TRUNCATE_EXISTING`]:n);if(a.has(`APPEND`)&&a.has(`TRUNCATE_EXISTING`))throw new w(`java.lang.IllegalArgumentException: APPEND + TRUNCATE_EXISTING not allowed`);if(a.has(`DELETE_ON_CLOSE`))throw new p(`IOUtils!Serialize does not support DELETE_ON_CLOSE`);let o=e.readFile?.(t);if(o===void 0&&!a.has(`CREATE`)&&!a.has(`CREATE_NEW`))throw new w(`java.nio.file.NoSuchFileException: ${t}`);if(o!==void 0&&a.has(`CREATE_NEW`))throw new w(`java.nio.file.FileAlreadyExistsException: ${t}`);o===void 0||a.has(`TRUNCATE_EXISTING`)?e.writeFile?.(t,r):e.writeFile?.(t,a.has(`APPEND`)?o+r:r+o.slice(r.length))},Zg=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},Qg=(e,t)=>{let n=e.readFile?.(t);if(n===void 0)throw new w(`${t} (No such file or directory)`);return n},$g=e=>[Hs(js(`ToJson`,1,e=>Wn(Hg(R(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),Hs(js(`ToJsonArray`,1,e=>Wn(Ug(R(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),Hs(js(`ToJsonObject`,1,e=>Wn(Gg(R(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),Hs(js(`JsonSerialize`,2,t=>{let n=qg(R(t,0,`JsonSerialize`)),r=R(t,1,`JsonSerialize`);if(!Wi(r)&&!Pg(r))throw ws(`second`,`JsonSerialize`,`sequence or record`,r);return Zg(e,n),e.writeFile?.(n,Hg(r)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),Hs(js(`ndJsonSerialize`,2,t=>{let n=qg(R(t,0,`ndJsonSerialize`)),r=R(t,1,`ndJsonSerialize`),i=Wi(r);if(!i)throw ws(`second`,`ndJsonSerialize`,`sequence`,r);return Zg(e,n),e.writeFile?.(n,Wg(i)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),Hs(js(`JsonDeserialize`,1,t=>Kg(Ag(Qg(e,qg(R(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),Hs(js(`ndJsonDeserialize`,1,t=>pi(Qg(e,qg(R(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>Kg(Ag(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],e_=(e,t)=>[Hs(Js(`Serialize`,3,(n,r)=>{let i=Ys(n,2,`Serialize`)(),a=Pg(i);if(!a)throw ws(`third`,`ndJsonSerialize`,`sequence`,i);if(Jg(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=Ys(n,0,`Serialize`)(),s=Wi(o);if(!s)throw ws(`first`,`Serialize`,`sequence`,o);let c=Ys(n,1,`Serialize`)();if(typeof c!=`string`)throw ws(`second`,`ndJsonSerialize`,`sequence`,c);let l=ma(a,`openOptions`);if(zs(l)!==`TupleValue`)throw Fg(l,`TupleValue`);let u=Jg(a,`charset`),d=I(l).range.map(e=>{if(typeof e!=`string`)throw Fg(e,`StringValue`);return e});return Yg(u),Xg(e,c,d,Wg(s)),!0}),`public static synchronized tlc2.value.impl.Value tlc2.module.Json.textSerialize(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`)],t_={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},n_=e=>{let t=[],n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=0,a=ir(),o=e=>t.push(e&255),s=e=>{o(e>>8),o(e)},c=e=>{s(e>>16),s(e)},l=e=>e>32767?c(-e):s(e),u=e=>{o(t_.string),c(0),c(-1),c(e.length),e.split(``).forEach(e=>o(e.charCodeAt(0)))},d=e=>{o(t_.handle),l(e)},f=e=>{if(typeof e==`boolean`){o(t_.boolean),o(+!!e);return}if(typeof e==`number`){o(t_.integer),c(e);return}if(typeof e==`string`){i++,u(e);return}if(e.kind===`ModelValue`){o(t_.modelValue),s(a.indexOf(e));return}if(e.kind===`Interval`){o(t_.interval),c(e.low),c(e.high);return}let t=n.get(e);if(t!==void 0){d(t);return}if(n.set(e,i++),dn(e)){let t=F(e).elements;o(t_.set),c(t.length),t.forEach(f);return}let p=I(e),m=ur(e);m===`tuple`?(o(t_.tuple),l(p.range.length),p.range.forEach(f)):m===`record`?(o(t_.record),c(p.domain.length),p.domain.forEach((e,t)=>{let n=String(e),a=r.get(n);a===void 0?(r.set(n,i++),u(n)):d(a),f(p.range[t])})):(o(t_.function),l(p.domain.length),o(1),p.domain.forEach((e,t)=>{f(e),f(p.range[t])}))};return f(e),ie(Uint8Array.from(t))},r_=e=>[Hs(js(`_TLCTraceSerialize`,2,t=>{let n=qg(R(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,n_(R(t,0,`_TLCTraceSerialize`))),!0}),`public static final tlc2.value.IValue tlc2.module._TLCTrace.ioSerialize(tlc2.value.IValue,tlc2.value.impl.StringValue) throws java.io.IOException`)],i_=25214903917n,a_=(1n<<48n)-1n,o_=e=>{let t=(BigInt.asUintN(64,e)^i_)&a_,n=e=>(t=t*i_+11n&a_,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^i_)&a_},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=2147483647)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},s_=[],c_=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},l_=()=>{for(let e=1277011;s_.length<1341;e++)c_(e)&&s_.push(e);return s_},u_=e=>{let t=l_(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},d_=e=>{let t=[],n=e;for(let e=2;e*e<=n;e++)for(;n%e===0;)t.push(e),n/=e;return n>1&&t.push(n),t},f_=e=>{for(let t=Math.max(e,9);;t++){let e=d_(t),n=new Set(e);if(t%4!=0&&n.size!==e.length)return{modulus:BigInt(t),multiplier:BigInt([...n].reduce((e,t)=>e*t,1)+1)}}},p_=(e,t,n)=>{if(t<=0)return[];let r=f_(t),i=BigInt(n.nextInt(t)),a=BigInt(u_(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},m_=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:tn),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},h_=(1n<<63n)-1n-24n,g_=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(h_*BigInt(n)+i)%t;return r<0n?r+t:r})},__=(e,t)=>e.reduceRight((e,t)=>({remaining:e.remaining/BigInt(t.length),elements:[t[Number(e.remaining%BigInt(t.length))],...e.elements]}),{remaining:t,elements:[]}).elements,v_=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=di(e.domain),n=F(e.range).elements;return{lists:t.map(()=>n),create:e=>sr(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>F(e).elements),create:t=>mi(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>F(e).elements),create:pi}}},y_=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,b_=(e,t,n,r)=>{if(Ii(t))return[];let i=r===`1.7.4`?m_:p_;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=y_(t,r)?void 0:v_(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(2147483647)?g_(e,t,n):i(e,Number(t),n)).map(e=>a.create(__(a.lists,e)))}let o=F(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},x_=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...Ts(e.domain,`RandomElement`,e).elements];return sr(n,n.map(()=>x_(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return mi(e.names.map((n,r)=>[n,x_(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return pi(e.factors.map(e=>x_(e,t)));if(typeof e==`object`&&e.kind===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.floor(t.nextDouble()*n);if(r>=n)throw new w(`Attempted to retrieve out-of-bounds element from the interval value ${N(L(e))}.`);return e.low+r}let n=Ts(e,`RandomElement`).elements,r=Math.floor(t.nextDouble()*n.length);if(r>=n.length)throw new w(`Index ${r} out of bounds for length ${n.length}`);return n[r]},S_=(e,t,n)=>{if(typeof e!=`number`||e<0)throw ws(t,n,`nonnegative integer`,e);return e},C_=(e,t,n,r)=>Xr(Array.from({length:t},()=>Xr(e.filter(()=>r.nextDouble()<n)))),w_=(e,t)=>{let n=`RandomSetOfSubsets`,r=S_(R(e,0,n),`first`,n),i=S_(R(e,1,n),`second`,n),a=R(e,2,n);if(!dn(a)||!P(a))throw ws(`third`,n,`finite set`,a);let o=F(a).elements;if(o.length<31&&r>2**o.length)throw ws(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw ws(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return C_(o,r,o.length===0?0:i/o.length,t.getRandom())},T_=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,E_=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,D_=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(T_.test(t))return Number(t.replace(/[fFdD]$/,``));let n=E_.exec(t);if(!n)return;let r=n[3]??``,i=`${n[2]}${r}`;if(i===``)return;let a=Number.parseInt(i,16)*2**(Number(n[4])-4*r.length);return n[1]===`-`?-a:a},O_=e=>z(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=S_(R(t,0,n),`first`,n),i=R(t,1,n);if(typeof i!=`string`)throw ws(`second`,n,`string literal representing a probability`,i);let a=D_(i);if(a===void 0||a<0||a>1)throw ws(`second`,n,`string literal does not represent a parsable probability`,i);let o=R(t,2,n);if(!dn(o)||qn(o)||!Vi(o))throw ws(`third`,n,`finite set`,o);let s=zi(o);if(32-Math.clz32(r)>s&&r>1<<s)throw ws(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return C_(F(o).elements,r,a,e.getRandom())}),k_=e=>[Hs(z(`RandomSubset`,2,t=>{let n=S_(R(t,0,`RandomSubset`),`first`,`RandomSubset`),r=R(t,1,`RandomSubset`);if(!gi(r)||!Vi(r))throw ws(`second`,`RandomSubset`,`a finite set`,r);let i=y_(r,e.version);if(i&&i.reduce((e,t)=>e*F(t).elements.length,1)>on())throw new w(sn());return Xr(b_(n,r,e.getRandom(),e.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),z(`RandomSetOfSubsets`,3,t=>w_(t,e)),z(`TestRandomSetOfSubsets`,3,t=>pi(Array.from({length:5},()=>F(w_(t,e)).elements.length)))],A_=(e,t=0n)=>{let n=o_(t),r=o_(t),i,a=!1,o={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>mi([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,markExplored:void 0,getSuccessorAction:()=>void 0,toRecord:()=>({}),setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Eo,getSimulationValue:void 0,getRandom:()=>{let e=a?void 0:o.getCurrentState();return e===void 0?n:(e!==i&&(r.setSeed(o.getFingerprint(e)^BigInt.asUintN(64,t)),i=e),r)},reseedRandom:()=>{i=void 0},evaluateAtStartup:e=>{let t=a;a=!0;try{return e()}finally{a=t}},pause:void 0,readLine:void 0,warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return o},j_=e=>ni([...e.possibleCounts].map(e=>[e[0],e[1]])),M_=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,j_(e)]]),N_=e=>mi([[`name`,e??`UnnamedAction`],[`location`,mi([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),P_=/* @__PURE__ */ new WeakSet,F_=e=>lr(ri(e),`record`),I_=(e,t,n=!0)=>{[`state`,`action`,`console`].forEach(Wn);let r=[[`action`,Xr(e)],[`state`,Xr(t)]],i=F_(n?r:[...r,[`console`,!1]]);return P_.add(i),i},L_=(e,t,n,r=!0)=>{let i=e.map((e,t)=>pi([t+1,mi(Object.entries(e))])),a=i.slice(1).map((e,n)=>pi([i[n],t[n],e])),o=n?[pi([i[i.length-1],n.action,i[n.start]])]:[];return I_([...a,...o],i,r)},R_=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return M_(e).get(t)},z_=(e,n,r,i)=>{if(typeof r==`number`&&r>=0)e.registers.set(r,i);else if(r===`exit`)i===!0&&(e.isStopped=!0);else if(r===`pause`){if(i!==!0||!e.pause)return;n(`Press enter to resume model checking.`),e.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))e.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))e.properties.set(r.slice(2),L(i));else throw new t(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${N(L(r))}`)},B_=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:Q(e),V_=e=>e.every(e=>e!==void 0),H_=(e,t,n)=>{if(e.kind===`Prime`||e.kind===`Unchanged`)return 2;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r!==void 0&&!M(e);if(i&&t.variableIndex.has(r))return 1;let a=mt(e).map(e=>H_(e,t,n)),o=i?cx(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(H_(o.body,t,n))),Math.max(0,...a)},U_=(e,n)=>{let r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new WeakMap,a=e=>{let t=i.get(e)??/* @__PURE__ */ new Map;return i.set(e,t),t};return[Js(`AssertError`,2,e=>{let t=Os(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw new w(`In computing AssertError, a non-string expression (${B_(t)}) was used as the err of an AssertError(err, exp).`);let r=Ys(e,0,`AssertError`)();try{Ys(e,1,`AssertError`)()}catch(e){if(e instanceof w)return Rt(e.message,n.isTool)===r;throw e}return!1}),js(`TLCGetOrDefault`,2,e=>R_(n,R(e,0,`TLCGetOrDefault`))??R(e,1,`TLCGetOrDefault`)),js(`Trace`,0,(e,t)=>{let r=t?.environment.variables??[],i=t?.state??r.map(()=>void 0);if(!t||!V_(i)){let e=r.filter((e,t)=>i[t]===void 0);throw new w(`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return t.state?pi(n.getBehavior(i).map(e=>{let r=t.environment.variables.map((t,n)=>[t,e[n]]),i=n.getSimulationValue?.(`action`,e);return mi(i===void 0?r:[[`_action`,i],...r])})):pi([mi([])])}),js(`CounterExample`,0,()=>n.counterExample??I_([],[])),z(`ToTrace`,1,e=>{let n=R(e,0,`ToTrace`);if(typeof n!=`object`||!P_.has(n))throw new t(`The argument of ToTrace should be a CounterExample, but instead it is:\n${N(L(n))}`);let r=F(ma(n,`state`)).elements.map(e=>Wi(e)??[]);return pi(r.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),z(`TLCModelValue`,1,e=>{let n=R(e,0,`TLCModelValue`);if(typeof n!=`string`)throw new t(`The argument of ModelValue should be a string, but instead it is:\n${N(L(n))}`);return rr(n)}),Js(`TLCDefer`,1,(e,t)=>{let r=Os(e,0,`TLCDefer`).expression;return t&&r&&(n.deferred=e=>{$(r,{...t,next:e})}),!0}),z(`TLCNoOp`,1,e=>R(e,0,`TLCNoOp`)),{...Js(`PickSuccessor`,1,(t,r)=>{let i=r?.next??(r?.environment.variables??[]).map(()=>void 0);if(n.getSimulationValue===void 0&&(!V_(i)||r?.next&&n.isSeen(i)))return!0;let a=Os(t,0,`PickSuccessor`),o=a.call([]);if(typeof o!=`boolean`)throw new w(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${Bs(o)}) was used as the condition of an IF.\n${a.expression?B_(a.expression):``}`);if(o||!r?.next||!V_(i)||!r.state||!V_(r.state))return!0;let s=r.state,c=n.getSuccessorAction(s,i),l=t=>e(Dt(n.isTool,wt.moduleOverrideStdout,Tt.none,t));for(;;){l(`Extend behavior of length ${n.getLevel(s)} with a "${c?.name}" step [<Action ${c?.location.range&&m(c.location.range)}>]? (Yes/no/explored/states/diff):`);let e=n.readLine?.();if(e===void 0)throw new re;if(/^[\0-\x20]*$/.test(e)||e.toLowerCase().startsWith(`y`))return!0;if(e[0]===`s`)l(`${Xa(n.toRecord(s)).trimEnd()}\n~>\n${Xa(n.toRecord(i)).trimEnd()}`);else if(e[0]===`d`)l(Xa(n.toRecord(i),n.toRecord(s)));else if(e[0]===`e`){if(n.markExplored)return n.markExplored(i),!0;if(n.getSimulationValue===void 0)throw new p(`tla-ts can't mark a state explored while it searches depth first.`);l(`Marking a state explored is unsupported by the current TLC mode. Is TLC running in simulation mode?`)}else if(e[0]===`n`)return!1}}),isActionLevel:!0},Js(`TLCCache`,2,(e,t)=>{let i=Os(e,0,`TLCCache`),o=Fa(Ys(e,1,`TLCCache`)()),s=i.expression;if(!s||!t)return i.call([]);let c=H_(s,t.environment,/* @__PURE__ */ new Set);if(c===2)return i.call([]);let l=c===1;if(l&&t.state&&n.getSimulationValue===void 0)return i.call([]),i.call([]);let u=l&&t.state?a(t.state):r,d=u.get(s)??/* @__PURE__ */ new Map;u.set(s,d);let f=d.get(o);if(f!==void 0)return f;let p=i.call([]);return d.set(o,p),p}),z(`TLCFP`,1,e=>{let t=R(e,0,`TLCFP`),n=Ea(t);if(n)throw n;return Number(BigInt.asIntN(32,Eo([t])))}),Js(`TLCEvalDefinition`,1,(e,n)=>{let r=Ys(e,0,`TLCEvalDefinition`)();if(typeof r!=`string`)throw new t(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${N(L(r))}`);let i=n?cx(r,n.environment):void 0,a=i?void 0:n?.environment.builtins.get(r);if(a?.arity===0)return a.evaluate([],n);if(!i||!n)throw new t(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${N(L(r))}`);if(i.kind===`Operator`&&i.params.length>0){let e=i.params.map(e=>e.arity===0?e.name:`${e.name}(${Array.from({length:e.arity},()=>`_`).join(`,`)})`);throw new t(`The argument of TLCEvalDefinition should be a a zero-arity definition, but instead it is:\n${r}(${e.join(`, `)})`)}return i.kind===`Operator`?$(i.body,n):$({kind:`Identifier`,name:r,location:i.location},n)})]},W_=(e,t)=>[js(`_Track`,2,e=>{let n=String(R(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,R(e,0,`_Track`)===!0?r+1:r),!0}),js(`_Counts`,0,()=>j_(t)),js(`_CheckName`,1,n=>{let r=String(R(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(L(j_(t),!0)),!1)}),js(`_PrintCounts`,0,()=>(e(L(j_(t),!0)),!0))],G_=e=>`${e.getUTCFullYear()}.${zt(e.getUTCMonth()+1)}.${zt(e.getUTCDate())}.${zt(e.getUTCHours())}${zt(e.getUTCMinutes())}${zt(e.getUTCSeconds())}`,K_=e=>ni([...e].map(e=>[e[0],pi([e[1]])])),q_=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),J_=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Y_=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),X_=(e,n,r)=>{if(e.version===`1.7.4`?!J_.has(n)||!e.isStarted&&Y_.has(n):!e.isStarted&&q_.has(n))throw new t(`TLCGet(${n}) was undefined.`);let i=e.getSimulationValue?.(n,r);if(i!==void 0)return i;let a=Math.floor((Date.now()-e.startedAt)/1e3);switch(n){case`level`:return r===void 0?0:e.getLevel(r);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return a;case`stats`:return F_([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,a],[`worker`,0]]);case`config`:return F_([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,String(BigInt.asIntN(64,$a()))],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return F_([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Wn(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Wn(G_(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return N_(void 0);case`all`:return K_(e.registers);case`all:named`:return K_(M_(e))}if(n.startsWith(`s:`)){let r=M_(e).get(n);if(r===void 0)throw new t(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return Wn(e.properties.get(n.slice(2))??n);throw new t(`TLCGet(${n}) was undefined.`)},Z_=(e,n,r)=>{if(typeof n==`number`&&n>=0){let r=e.registers.get(n);if(r===void 0)throw new t(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new t(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${N(L(n))}`);return X_(e,n,r?.state)},Q_=e=>e.length===0?[[]]:e.flatMap((t,n)=>Q_([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),$_=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&F(e).elements.forEach($_),e.kind===`Function`&&e.range.forEach($_))},ev=e=>{if(typeof e!=`object`)return e;switch(e.kind){case`Function`:return e.functionClass===void 0?e:sr(e.domain,e.range);case`ModelValue`:case`MixedSet`:case`InfiniteSet`:case`SequenceSet`:return e;case`LazyFunction`:return I(e);default:return F(e)}},tv=(e,n)=>[z(`Print`,2,t=>(e(Ka([R(t,0,`Print`),R(t,1,`Print`)]).map(N).join(` `)),R(t,1,`Print`))),z(`PrintT`,1,t=>(e(N(Ka([R(t,0,`PrintT`)])[0])),!0)),z(`Assert`,2,e=>{if(R(e,0,`Assert`)!==!0)throw new t(`The first argument of Assert evaluated to FALSE; the second argument was:\n${N(L(R(e,1,`Assert`)))}`,b.assertViolation);return!0}),z(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),z(`:>`,2,e=>ni([[R(e,0,`:>`),R(e,1,`:>`)]])),z(`@@`,2,e=>{let t=R(e,0,`@@`),n=R(e,1,`@@`),r=pn(t)?I(t):void 0,i=pn(n)?I(n):void 0;if(!r)throw ws(`first`,`@@`,`function`,t);if(!i)throw ws(`second`,`@@`,`function`,n);let a=xn(r),o=xn(i).filter(e=>!a.some(t=>qr(e[0],t[0])));return ri([...a,...o])}),z(`ToString`,1,e=>Wn(L(R(e,0,`ToString`),!0))),{...Js(`TLCEval`,1,(e,t)=>{let n=ev(Ys(e,0,`TLCEval`)());return t===void 0&&$_(n),n}),isStateLevel:!1},z(`Permutations`,1,e=>{let t=Ts(R(e,0,`Permutations`),`Permutations`).elements;return Xr(Q_(t).map(e=>ni(t.map((t,n)=>[t,e[n]]))))}),As(`SortSeq`,2,e=>{let t=R(e,0,`SortSeq`),n=Wi(t);if(!n)throw ws(`first`,`SortSeq`,`natural number`,t);let r=Os(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw ws(`second`,`SortSeq`,`boolean function`,n)},a=n.slice(0,1);return n.slice(1).forEach(e=>{let t=a.length;for(;t>0&&i(e,a[t-1]);)t--;a.splice(t,0,e)}),pi(a)}),n.version===`1.7.4`?Hs({...js(`TLCGet`,1,(e,t)=>Z_(n,R(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):Hs(Js(`TLCGet`,1,(e,t)=>Z_(n,Ys(e,0,`TLCGet`)(),t)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),js(`TLCSet`,2,t=>(z_(n,e,R(t,0,`TLCSet`),R(t,1,`TLCSet`)),!0)),ks(`Any`,Zn),z(`RandomElement`,1,e=>x_(R(e,0,`RandomElement`),n.getRandom()))],nv=`----------------------------- MODULE Bags --------------------------------
|
|
413
|
+
`&&(r++,i=n)}throw p(`Unterminated string`)},re=()=>{let t=n;for(;n<e.length&&g(e[n]);)n++;return e.slice(t,n)},T=e=>{if(c.length-1>=255)throw new w(`com.google.gson.stream.MalformedJsonException: Nesting limit 255 reached${f()}`);c.push(e),l.push(void 0),u.push(0),o=Z.none},ie=()=>{c.pop(),l.pop(),u.pop(),u[c.length-1]++,o=Z.none},ae=()=>{let e=S();return e!==Z.endObject&&e!==Z.endArray&&e!==Z.eof},oe=()=>{let e=S(),t=e===Z.unquotedName?re():ne(e===Z.singleQuotedName?`'`:`"`);return o=Z.none,l[c.length-1]=t,t},se=t=>t===Z.true||t===Z.false?t===Z.true:t===Z.null?null:t===Z.number?(n+=s,{literal:e.slice(n-s,n)}):t===Z.unquoted?re():ne(t===Z.singleQuoted?`'`:`"`),E=()=>{let e=S();if(e===Z.beginArray){T(Fg.emptyArray);let e=[];for(;ae();)e.push(E());return ie(),e}if(e===Z.beginObject){T(Fg.emptyObject);let e=/* @__PURE__ */ new Map;for(;ae();)e.set(oe(),E());return ie(),e}let t=se(e);return o=Z.none,u[c.length-1]++,t};if(S()===Z.eof)return null;let ce=E();return a=!1,ce!==null&&S(),ce},Vg=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),Hg=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),Ug=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),Wg=e=>{if(!Is(e))return;let t=K(e),n=t.domain.flatMap((e,n)=>typeof e==`string`?[[e,t.range[n]]]:[]);return n.length===t.domain.length?Ll(n):void 0},Gg=(e,t)=>{let n=`tlc2.value.impl.${pp(e)}`,r=`tlc2.value.impl.${t}`;return new w(`class ${n} cannot be cast to class ${r} (${n} and ${r} are in unnamed module of loader 'app')`)},Kg=e=>new w(`Cannot convert value: unsupported value type tlc2.value.impl.${pp(e)}`),qg=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Jg=e=>`[${e.map(Qg).join(`,`)}]`,Yg=e=>`{${Gs(e).map(e=>`${qg(typeof e[0]==`string`?e[0]:q(e[0]))}:${Qg(e[1])}`).join(`,`)}}`,Xg=e=>{let t=K(e),n=pu(t);return n?Jg(n):Yg(t)},Zg=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,Qg=e=>typeof e==`string`?qg(e):typeof e==`object`?e.kind===`ModelValue`?qg(e.name):pp(e)===`RecordValue`?Yg(K(e)):$g(e):String(e),$g=e=>{let t=pp(e);if(t===`TupleValue`)return Jg(K(e).range);if(Zg(t))return Xg(e);if(zl(e))return Jg(G(e).elements);throw Kg(e)},e_=e=>e.map(e=>`${Qg(e)}\n`).join(``),t_=e=>{let t=pp(e);if(t===`RecordValue`)return Yg(K(e));if(t===`TupleValue`)return`{${K(e).range.map((e,t)=>`"${t}":${Qg(e)}`).join(`,`)}}`;if(Zg(t))return Xg(e);throw Kg(e)},n_=e=>{if(e===null)throw new w(`Cannot convert value: unsupported JSON value null`);if(typeof e==`boolean`)return e;if(typeof e==`string`)return pc(e);if(Array.isArray(e))return Il(e.map(n_));if(e instanceof Map)return Ll([...e].map(e=>[pc(e[0]),n_(e[1])]));let t=Number(e.literal);if(!/^-?\d+$/.test(e.literal)||sp(t))throw new w(`Cannot convert value: expected a 32-bit integer JSON number, but found ${e.literal}`);return t||0},r_=e=>{if(typeof e!=`string`)throw new w(`Cannot cast tlc2.value.impl.${pp(e)} to tlc2.value.impl.StringValue`);return e},i_=(e,t)=>{let n=Lu(e,t);if(typeof n!=`string`)throw Gg(n,`StringValue`);return n},a_=e=>{if(!Hg.has(e.toLowerCase()))throw Ug.has(e.toLowerCase())?new p(`IOUtils!Serialize does not support the charset ${e}`):new w(/^[a-zA-Z\d][\w.:+-]*$/.test(e)?`java.nio.charset.UnsupportedCharsetException: ${e}`:`java.nio.charset.IllegalCharsetNameException: ${e}`)},o_=(e,t,n,r)=>{let i=n.find(e=>!Vg.has(e));if(i!==void 0)throw new w(`java.lang.IllegalArgumentException: No enum constant java.nio.file.StandardOpenOption.${i}`);if(n.includes(`READ`))throw new w(`java.lang.IllegalArgumentException: READ not allowed`);let a=new Set(n.length===0?[`CREATE`,`TRUNCATE_EXISTING`]:n);if(a.has(`APPEND`)&&a.has(`TRUNCATE_EXISTING`))throw new w(`java.lang.IllegalArgumentException: APPEND + TRUNCATE_EXISTING not allowed`);if(a.has(`DELETE_ON_CLOSE`))throw new p(`IOUtils!Serialize does not support DELETE_ON_CLOSE`);let o=e.readFile?.(t);if(o===void 0&&!a.has(`CREATE`)&&!a.has(`CREATE_NEW`))throw new w(`java.nio.file.NoSuchFileException: ${t}`);if(o!==void 0&&a.has(`CREATE_NEW`))throw new w(`java.nio.file.FileAlreadyExistsException: ${t}`);o===void 0||a.has(`TRUNCATE_EXISTING`)?e.writeFile?.(t,r):e.writeFile?.(t,a.has(`APPEND`)?o+r:r+o.slice(r.length))},s_=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},c_=(e,t)=>{let n=e.readFile?.(t);if(n===void 0)throw new w(`${t} (No such file or directory)`);return n},l_=e=>[gp(ap(`ToJson`,1,e=>pc(Qg(J(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),gp(ap(`ToJsonArray`,1,e=>pc($g(J(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),gp(ap(`ToJsonObject`,1,e=>pc(t_(J(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),gp(ap(`JsonSerialize`,2,t=>{let n=r_(J(t,0,`JsonSerialize`)),r=J(t,1,`JsonSerialize`);if(!pu(r)&&!Wg(r))throw Qf(`second`,`JsonSerialize`,`sequence or record`,r);return s_(e,n),e.writeFile?.(n,Qg(r)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),gp(ap(`ndJsonSerialize`,2,t=>{let n=r_(J(t,0,`ndJsonSerialize`)),r=J(t,1,`ndJsonSerialize`),i=pu(r);if(!i)throw Qf(`second`,`ndJsonSerialize`,`sequence`,r);return s_(e,n),e.writeFile?.(n,e_(i)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),gp(ap(`JsonDeserialize`,1,t=>n_(Bg(c_(e,r_(J(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),gp(ap(`ndJsonDeserialize`,1,t=>Il(c_(e,r_(J(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>n_(Bg(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],u_=(e,t)=>[gp(Sp(`Serialize`,3,(n,r)=>{let i=Cp(n,2,`Serialize`)(),a=Wg(i);if(!a)throw Qf(`third`,`ndJsonSerialize`,`sequence`,i);if(i_(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=Cp(n,0,`Serialize`)(),s=pu(o);if(!s)throw Qf(`first`,`Serialize`,`sequence`,o);let c=Cp(n,1,`Serialize`)();if(typeof c!=`string`)throw Qf(`second`,`ndJsonSerialize`,`sequence`,c);let l=Lu(a,`openOptions`);if(pp(l)!==`TupleValue`)throw Gg(l,`TupleValue`);let u=i_(a,`charset`),d=K(l).range.map(e=>{if(typeof e!=`string`)throw Gg(e,`StringValue`);return e});return a_(u),o_(e,c,d,e_(s)),!0}),`public static synchronized tlc2.value.impl.Value tlc2.module.Json.textSerialize(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`)],d_={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},f_=e=>{let t=[],n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=0,a=Dc(),o=e=>t.push(e&255),s=e=>{o(e>>8),o(e)},c=e=>{s(e>>16),s(e)},l=e=>e>32767?c(-e):s(e),u=e=>{o(d_.string),c(0),c(-1),c(e.length),e.split(``).forEach(e=>o(e.charCodeAt(0)))},d=e=>{o(d_.handle),l(e)},f=e=>{if(typeof e==`boolean`){o(d_.boolean),o(+!!e);return}if(typeof e==`number`){o(d_.integer),c(e);return}if(typeof e==`string`){i++,u(e);return}if(e.kind===`ModelValue`){o(d_.modelValue),s(a.indexOf(e));return}if(e.kind===`Interval`){o(d_.interval),c(e.low),c(e.high);return}let t=n.get(e);if(t!==void 0){d(t);return}if(n.set(e,i++),Ps(e)){let t=G(e).elements;o(d_.set),c(t.length),t.forEach(f);return}let p=K(e),m=Nc(e);m===`tuple`?(o(d_.tuple),l(p.range.length),p.range.forEach(f)):m===`record`?(o(d_.record),c(p.domain.length),p.domain.forEach((e,t)=>{let n=String(e),a=r.get(n);a===void 0?(r.set(n,i++),u(n)):d(a),f(p.range[t])})):(o(d_.function),l(p.domain.length),o(1),p.domain.forEach((e,t)=>{f(e),f(p.range[t])}))};return f(e),ie(Uint8Array.from(t))},p_=e=>[gp(ap(`_TLCTraceSerialize`,2,t=>{let n=r_(J(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,f_(J(t,0,`_TLCTraceSerialize`))),!0}),`public static final tlc2.value.IValue tlc2.module._TLCTrace.ioSerialize(tlc2.value.IValue,tlc2.value.impl.StringValue) throws java.io.IOException`)],m_=25214903917n,h_=(1n<<48n)-1n,g_=e=>{let t=(BigInt.asUintN(64,e)^m_)&h_,n=e=>(t=t*m_+11n&h_,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^m_)&h_},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=2147483647)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},__=[],v_=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},y_=()=>{for(let e=1277011;__.length<1341;e++)v_(e)&&__.push(e);return __},b_=e=>{let t=y_(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},x_=e=>{let t=[],n=e;for(let e=2;e*e<=n;e++)for(;n%e===0;)t.push(e),n/=e;return n>1&&t.push(n),t},S_=e=>{for(let t=Math.max(e,9);;t++){let e=x_(t),n=new Set(e);if(t%4!=0&&n.size!==e.length)return{modulus:BigInt(t),multiplier:BigInt([...n].reduce((e,t)=>e*t,1)+1)}}},C_=(e,t,n)=>{if(t<=0)return[];let r=S_(t),i=BigInt(n.nextInt(t)),a=BigInt(b_(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},w_=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Ts),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},T_=(1n<<63n)-1n-24n,E_=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(T_*BigInt(n)+i)%t;return r<0n?r+t:r})},D_=(e,t)=>e.reduceRight((e,t)=>({remaining:e.remaining/BigInt(t.length),elements:[t[Number(e.remaining%BigInt(t.length))],...e.elements]}),{remaining:t,elements:[]}).elements,O_=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Pl(e.domain),n=G(e.range).elements;return{lists:t.map(()=>n),create:e=>Ac(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>G(e).elements),create:t=>Ll(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>G(e).elements),create:Il}}},k_=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,A_=(e,t,n,r)=>{if(au(t))return[];let i=r===`1.7.4`?w_:C_;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=k_(t,r)?void 0:O_(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(2147483647)?E_(e,t,n):i(e,Number(t),n)).map(e=>a.create(D_(a.lists,e)))}let o=G(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},j_=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...$f(e.domain,`RandomElement`,e).elements];return Ac(n,n.map(()=>j_(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return Ll(e.names.map((n,r)=>[n,j_(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return Il(e.factors.map(e=>j_(e,t)));if(typeof e==`object`&&e.kind===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.floor(t.nextDouble()*n);if(r>=n)throw new w(`Attempted to retrieve out-of-bounds element from the interval value ${U(q(e))}.`);return e.low+r}let n=$f(e,`RandomElement`).elements,r=Math.floor(t.nextDouble()*n.length);if(r>=n.length)throw new w(`Index ${r} out of bounds for length ${n.length}`);return n[r]},M_=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Qf(t,n,`nonnegative integer`,e);return e},N_=(e,t,n,r)=>yl(Array.from({length:t},()=>yl(e.filter(()=>r.nextDouble()<n)))),P_=(e,t)=>{let n=`RandomSetOfSubsets`,r=M_(J(e,0,n),`first`,n),i=M_(J(e,1,n),`second`,n),a=J(e,2,n);if(!Ps(a)||!W(a))throw Qf(`third`,n,`finite set`,a);let o=G(a).elements;if(o.length<31&&r>2**o.length)throw Qf(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw Qf(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return N_(o,r,o.length===0?0:i/o.length,t.getRandom())},F_=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,I_=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,L_=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(F_.test(t))return Number(t.replace(/[fFdD]$/,``));let n=I_.exec(t);if(!n)return;let r=n[3]??``,i=`${n[2]}${r}`;if(i===``)return;let a=Number.parseInt(i,16)*2**(Number(n[4])-4*r.length);return n[1]===`-`?-a:a},R_=e=>Y(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=M_(J(t,0,n),`first`,n),i=J(t,1,n);if(typeof i!=`string`)throw Qf(`second`,n,`string literal representing a probability`,i);let a=L_(i);if(a===void 0||a<0||a>1)throw Qf(`second`,n,`string literal does not represent a parsable probability`,i);let o=J(t,2,n);if(!Ps(o)||gc(o)||!uu(o))throw Qf(`third`,n,`finite set`,o);let s=cu(o);if(32-Math.clz32(r)>s&&r>1<<s)throw Qf(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return N_(G(o).elements,r,a,e.getRandom())}),z_=e=>[gp(Y(`RandomSubset`,2,t=>{let n=M_(J(t,0,`RandomSubset`),`first`,`RandomSubset`),r=J(t,1,`RandomSubset`);if(!zl(r)||!uu(r))throw Qf(`second`,`RandomSubset`,`a finite set`,r);let i=k_(r,e.version);if(i&&i.reduce((e,t)=>e*G(t).elements.length,1)>ks())throw new w(As());return yl(A_(n,r,e.getRandom(),e.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),Y(`RandomSetOfSubsets`,3,t=>P_(t,e)),Y(`TestRandomSetOfSubsets`,3,t=>Il(Array.from({length:5},()=>G(P_(t,e)).elements.length)))],B_=(e,t=0n)=>{let n=g_(t),r=g_(t),i,a=!1,o={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Ll([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,markExplored:void 0,getSuccessorAction:()=>void 0,toRecord:()=>({}),setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Jd,getSimulationValue:void 0,getRandom:()=>{let e=a?void 0:o.getCurrentState();return e===void 0?n:(e!==i&&(r.setSeed(o.getFingerprint(e)^BigInt.asUintN(64,t)),i=e),r)},reseedRandom:()=>{i=void 0},runWithNewRandom:e=>{let n=r,a=i;r=g_(t),i=void 0;try{return e()}finally{r=n,i=a}},evaluateAtStartup:e=>{let t=a;a=!0;try{return e()}finally{a=t}},pause:void 0,readLine:void 0,warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return o},V_=e=>Tl([...e.possibleCounts].map(e=>[e[0],e[1]])),H_=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,V_(e)]]),U_=e=>Ll([[`name`,e??`UnnamedAction`],[`location`,Ll([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),W_=/* @__PURE__ */ new WeakSet,G_=e=>Mc(El(e),`record`),K_=(e,t,n=!0)=>{[`state`,`action`,`console`].forEach(pc);let r=[[`action`,yl(e)],[`state`,yl(t)]],i=G_(n?r:[...r,[`console`,!1]]);return W_.add(i),i},q_=(e,t,n,r=!0)=>{let i=e.map((e,t)=>Il([t+1,Ll(Object.entries(e))])),a=i.slice(1).map((e,n)=>Il([i[n],t[n],e])),o=n?[Il([i[i.length-1],n.action,i[n.start]])]:[];return K_([...a,...o],i,r)},J_=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return H_(e).get(t)},Y_=(e,n,r,i)=>{if(typeof r==`number`&&r>=0)e.registers.set(r,i);else if(r===`exit`)i===!0&&(e.isStopped=!0);else if(r===`pause`){if(i!==!0||!e.pause)return;n(`Press enter to resume model checking.`),e.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))e.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))e.properties.set(r.slice(2),q(i));else throw new t(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${U(q(r))}`)},X_=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:Q(e),Z_=e=>e.every(e=>e!==void 0),Q_=(e,t,n)=>{if(e.kind===`Prime`||e.kind===`Unchanged`)return 2;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r!==void 0&&!M(e);if(i&&t.variableIndex.has(r))return 1;let a=gt(e).map(e=>Q_(e,t,n)),o=i?yx(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(Q_(o.body,t,n))),Math.max(0,...a)},$_=(e,n)=>{let r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new WeakMap,a=e=>{let t=i.get(e)??/* @__PURE__ */ new Map;return i.set(e,t),t};return[Sp(`AssertError`,2,e=>{let t=np(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw new w(`In computing AssertError, a non-string expression (${X_(t)}) was used as the err of an AssertError(err, exp).`);let r=Cp(e,0,`AssertError`)();try{Cp(e,1,`AssertError`)()}catch(e){if(e instanceof w)return cs(e.message,n.isTool)===r;throw e}return!1}),ap(`TLCGetOrDefault`,2,e=>J_(n,J(e,0,`TLCGetOrDefault`))??J(e,1,`TLCGetOrDefault`)),ap(`Trace`,0,(e,t)=>{let r=t?.environment.variables??[],i=t?.state??r.map(()=>void 0);if(!t||!Z_(i)){let e=r.filter((e,t)=>i[t]===void 0);throw new w(`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return t.state?Il(n.getBehavior(i).map(e=>{let r=t.environment.variables.map((t,n)=>[t,e[n]]),i=n.getSimulationValue?.(`action`,e);return Ll(i===void 0?r:[[`_action`,i],...r])})):Il([Ll([])])}),ap(`CounterExample`,0,()=>n.counterExample??K_([],[])),Y(`ToTrace`,1,e=>{let n=J(e,0,`ToTrace`);if(typeof n!=`object`||!W_.has(n))throw new t(`The argument of ToTrace should be a CounterExample, but instead it is:\n${U(q(n))}`);let r=G(Lu(n,`state`)).elements.map(e=>pu(e)??[]);return Il(r.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),Y(`TLCModelValue`,1,e=>{let n=J(e,0,`TLCModelValue`);if(typeof n!=`string`)throw new t(`The argument of ModelValue should be a string, but instead it is:\n${U(q(n))}`);return Ec(n)}),Sp(`TLCDefer`,1,(e,t)=>{let r=np(e,0,`TLCDefer`).expression;return t&&r&&(n.deferred=e=>{$(r,{...t,next:e})}),!0}),Y(`TLCNoOp`,1,e=>J(e,0,`TLCNoOp`)),{...Sp(`PickSuccessor`,1,(t,r)=>{let i=r?.next??(r?.environment.variables??[]).map(()=>void 0);if(n.getSimulationValue===void 0&&(!Z_(i)||r?.next&&n.isSeen(i)))return!0;let a=np(t,0,`PickSuccessor`),o=a.call([]);if(typeof o!=`boolean`)throw new w(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${mp(o)}) was used as the condition of an IF.\n${a.expression?X_(a.expression):``}`);if(o||!r?.next||!Z_(i)||!r.state||!Z_(r.state))return!0;let s=r.state,c=n.getSuccessorAction(s,i),l=t=>e(Zo(n.isTool,Jo.moduleOverrideStdout,Yo.none,t));for(;;){l(`Extend behavior of length ${n.getLevel(s)} with a "${c?.name}" step [<Action ${c?.location.range&&m(c.location.range)}>]? (Yes/no/explored/states/diff):`);let e=n.readLine?.();if(e===void 0)throw new re;if(/^[\0-\x20]*$/.test(e)||e.toLowerCase().startsWith(`y`))return!0;if(e[0]===`s`)l(`${yd(n.toRecord(s)).trimEnd()}\n~>\n${yd(n.toRecord(i)).trimEnd()}`);else if(e[0]===`d`)l(yd(n.toRecord(i),n.toRecord(s)));else if(e[0]===`e`){if(n.markExplored)return n.markExplored(i),!0;if(n.getSimulationValue===void 0)throw new p(`tla-ts can't mark a state explored while it searches depth first.`);l(`Marking a state explored is unsupported by the current TLC mode. Is TLC running in simulation mode?`)}else if(e[0]===`n`)return!1}}),isActionLevel:!0},Sp(`TLCCache`,2,(e,t)=>{let i=np(e,0,`TLCCache`),o=id(Cp(e,1,`TLCCache`)()),s=i.expression;if(!s||!t)return i.call([]);let c=Q_(s,t.environment,/* @__PURE__ */ new Set);if(c===2)return i.call([]);let l=c===1;if(l&&t.state&&n.getSimulationValue===void 0)return i.call([]),i.call([]);let u=l&&t.state?a(t.state):r,d=u.get(s)??/* @__PURE__ */ new Map;u.set(s,d);let f=d.get(o);if(f!==void 0)return f;let p=i.call([]);return d.set(o,p),p}),Y(`TLCFP`,1,e=>{let t=J(e,0,`TLCFP`),n=Yu(t);if(n)throw n;return Number(BigInt.asIntN(32,Jd([t])))}),Sp(`TLCEvalDefinition`,1,(e,n)=>{let r=Cp(e,0,`TLCEvalDefinition`)();if(typeof r!=`string`)throw new t(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${U(q(r))}`);let i=n?yx(r,n.environment):void 0,a=i?void 0:n?.environment.builtins.get(r);if(a?.arity===0)return a.evaluate([],n);if(!i||!n)throw new t(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${U(q(r))}`);if(i.kind===`Operator`&&i.params.length>0){let e=i.params.map(e=>e.arity===0?e.name:`${e.name}(${Array.from({length:e.arity},()=>`_`).join(`,`)})`);throw new t(`The argument of TLCEvalDefinition should be a a zero-arity definition, but instead it is:\n${r}(${e.join(`, `)})`)}return i.kind===`Operator`?$(i.body,n):$({kind:`Identifier`,name:r,location:i.location},n)})]},ev=(e,t)=>[ap(`_Track`,2,e=>{let n=String(J(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,J(e,0,`_Track`)===!0?r+1:r),!0}),ap(`_Counts`,0,()=>V_(t)),ap(`_CheckName`,1,n=>{let r=String(J(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(q(V_(t),!0)),!1)}),ap(`_PrintCounts`,0,()=>(e(q(V_(t),!0)),!0))],tv=e=>`${e.getUTCFullYear()}.${ls(e.getUTCMonth()+1)}.${ls(e.getUTCDate())}.${ls(e.getUTCHours())}${ls(e.getUTCMinutes())}${ls(e.getUTCSeconds())}`,nv=e=>Tl([...e].map(e=>[e[0],Il([e[1]])])),rv=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),iv=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),av=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),ov=(e,n,r)=>{if(e.version===`1.7.4`?!iv.has(n)||!e.isStarted&&av.has(n):!e.isStarted&&rv.has(n))throw new t(`TLCGet(${n}) was undefined.`);let i=e.getSimulationValue?.(n,r);if(i!==void 0)return i;let a=Math.floor((Date.now()-e.startedAt)/1e3);switch(n){case`level`:return r===void 0?0:e.getLevel(r);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return a;case`stats`:return G_([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,a],[`worker`,0]]);case`config`:return G_([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,String(BigInt.asIntN(64,Sd()))],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return G_([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,pc(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,pc(tv(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return U_(void 0);case`all`:return nv(e.registers);case`all:named`:return nv(H_(e))}if(n.startsWith(`s:`)){let r=H_(e).get(n);if(r===void 0)throw new t(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return pc(e.properties.get(n.slice(2))??n);throw new t(`TLCGet(${n}) was undefined.`)},sv=(e,n,r)=>{if(typeof n==`number`&&n>=0){let r=e.registers.get(n);if(r===void 0)throw new t(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new t(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${U(q(n))}`);return ov(e,n,r?.state)},cv=e=>e.length===0?[[]]:e.flatMap((t,n)=>cv([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),lv=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&G(e).elements.forEach(lv),e.kind===`Function`&&e.range.forEach(lv))},uv=e=>{if(typeof e!=`object`)return e;switch(e.kind){case`Function`:return e.functionClass===void 0?e:Ac(e.domain,e.range);case`ModelValue`:case`MixedSet`:case`InfiniteSet`:case`SequenceSet`:return e;case`LazyFunction`:return K(e);default:return G(e)}},dv=(e,n)=>[Y(`Print`,2,t=>(e(hd([J(t,0,`Print`),J(t,1,`Print`)]).map(U).join(` `)),J(t,1,`Print`))),Y(`PrintT`,1,t=>(e(U(hd([J(t,0,`PrintT`)])[0])),!0)),Y(`Assert`,2,e=>{if(J(e,0,`Assert`)!==!0)throw new t(`The first argument of Assert evaluated to FALSE; the second argument was:\n${U(q(J(e,1,`Assert`)))}`,b.assertViolation);return!0}),Y(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),Y(`:>`,2,e=>Tl([[J(e,0,`:>`),J(e,1,`:>`)]])),Y(`@@`,2,e=>{let t=J(e,0,`@@`),n=J(e,1,`@@`),r=Is(t)?K(t):void 0,i=Is(n)?K(n):void 0;if(!r)throw Qf(`first`,`@@`,`function`,t);if(!i)throw Qf(`second`,`@@`,`function`,n);let a=Ws(r),o=Ws(i).filter(e=>!a.some(t=>gl(e[0],t[0])));return El([...a,...o])}),Y(`ToString`,1,e=>pc(q(J(e,0,`ToString`),!0))),{...Sp(`TLCEval`,1,(e,t)=>{let n=uv(Cp(e,0,`TLCEval`)());return t===void 0&&lv(n),n}),isStateLevel:!1},Y(`Permutations`,1,e=>{let t=$f(J(e,0,`Permutations`),`Permutations`).elements;return yl(cv(t).map(e=>Tl(t.map((t,n)=>[t,e[n]]))))}),ip(`SortSeq`,2,e=>{let t=J(e,0,`SortSeq`),n=pu(t);if(!n)throw Qf(`first`,`SortSeq`,`natural number`,t);let r=np(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw Qf(`second`,`SortSeq`,`boolean function`,n)},a=n.slice(0,1);return n.slice(1).forEach(e=>{let t=a.length;for(;t>0&&i(e,a[t-1]);)t--;a.splice(t,0,e)}),Il(a)}),n.version===`1.7.4`?gp({...ap(`TLCGet`,1,(e,t)=>sv(n,J(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):gp(Sp(`TLCGet`,1,(e,t)=>sv(n,Cp(e,0,`TLCGet`)(),t)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),ap(`TLCSet`,2,t=>(Y_(n,e,J(t,0,`TLCSet`),J(t,1,`TLCSet`)),!0)),rp(`Any`,bc),Y(`RandomElement`,1,e=>j_(J(e,0,`RandomElement`),n.getRandom()))],fv=`----------------------------- MODULE Bags --------------------------------
|
|
414
414
|
(**************************************************************************)
|
|
415
415
|
(* A bag, also called a multiset, is a set that can contain multiple *)
|
|
416
416
|
(* copies of the same element. A bag can have infinitely many elements, *)
|
|
@@ -563,7 +563,7 @@ CopiesIn(e, B) ==
|
|
|
563
563
|
7 Dec 98 : Corrected error found by Stephan Merz.
|
|
564
564
|
6 Dec 98 : Modified comments based on suggestions by Lyle Ramshaw.
|
|
565
565
|
5 Dec 98 : Initial version.
|
|
566
|
-
`,
|
|
566
|
+
`,pv=/* @__PURE__ */ new Map([[`Bags`,fv],[`FiniteSets`,`---------------------------- MODULE FiniteSets -----------------------------
|
|
567
567
|
(***************************************************************************)
|
|
568
568
|
(* The two definitions in this standard module are overridden by TLC in *)
|
|
569
569
|
(* the Java class tlc2.module.FiniteSets. Each operator is overridden by *)
|
|
@@ -1695,7 +1695,7 @@ _TLCTrace ==
|
|
|
1695
1695
|
/\\ PrintT("CounterExample written: " \\o _TLCTraceFile)
|
|
1696
1696
|
|
|
1697
1697
|
=============================================================================
|
|
1698
|
-
`]]),
|
|
1698
|
+
`]]),mv=new Map([...[...pv].filter(e=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e[0])),[`Bags`,fv.replace(`
|
|
1699
1699
|
LOCAL INSTANCE Naturals
|
|
1700
1700
|
`,`
|
|
1701
1701
|
EXTENDS TLC
|
|
@@ -1787,12 +1787,12 @@ _TEPosition ==
|
|
|
1787
1787
|
ELSE TLCGet("level") + 1
|
|
1788
1788
|
|
|
1789
1789
|
=============================================================================
|
|
1790
|
-
`]]),av=(e=`master`)=>e===`1.7.4`?iv:rv,ov=(e,t)=>e.every(e=>Yi(e,t)),sv=Xr([!1,!0]);Gr(sv);const cv=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return ti(cv(e,t,r),cv(e,r,n))},lv=[`\\cup`,`\\cap`,`\\`],uv=e=>typeof e==`object`&&e.kind===`MixedSet`,dv=e=>e.kind===`Interval`||e.kind===`Set`&&e.isNormalized,fv=(e,t,n)=>{t.kind===`Interval`&&zi(t);let r=t.kind===`Interval`?t:Wr(t);if(e!==`\\cup`){let i=e===`\\cap`,a=[];return un(r,e=>{Yi(e,n)===i&&cn(a,e)}),dv(t)?or(a):Zr(a)}if(Ii(t))return n;if(!fn(n))return mr({kind:`SetOperation`,operator:e,left:t,right:n});let i=[];return un(r,e=>cn(i,e)),un(n.kind===`Interval`?n:F(n).elements,e=>{Yi(e,t)||cn(i,e)}),Zr(i)},pv=(e,t)=>{let n=t.elements,r=0,i=n.length;for(;r<i;){let t=r+i>>1,a=n[t];if(typeof a!=`number`)return;a<e.low?r=t+1:i=t}for(let t=e.low;t<=e.high;t++,r++){if(r===n.length)return!1;let e=n[r];if(e!==t)return typeof e!=`number`&&void 0}return!0},mv=(e,t)=>{if(typeof t==`object`&&t.kind===`Interval`&&t.low<=e.low&&t.high>=e.high)return!0;let n=typeof t==`object`&&t.kind===`Set`?pv(e,t):void 0;if(n!==void 0)return n;for(let n=e.low;n<=e.high;n++)if(!Yi(n,t))return!1;return!0},hv=(e,t)=>{let n=(t,n)=>Ds([Ys(t,n,e)()],0,e);return{...z(e,2,e=>t(n(e,0),()=>n(e,1))),evaluateBinary:void 0,isLazy:!0}},gv=[ks(`TRUE`,!0),ks(`FALSE`,!1),ks(`BOOLEAN`,sv),ks(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),Ms(`=`,qr),Ms(`#`,(e,t)=>!qr(e,t)),z(`~`,1,e=>!Ds(e,0,`~`)),z(`<=>`,2,e=>Ds(e,0,`<=>`)===Ds(e,1,`<=>`)),hv(`/\\`,(e,t)=>e&&t()),hv(`\\/`,(e,t)=>e||t()),hv(`=>`,(e,t)=>!e||t()),z(`\\in`,2,e=>Yi(R(e,0,`\\in`),R(e,1,`\\in`))),z(`\\notin`,2,e=>!Yi(R(e,0,`\\notin`),R(e,1,`\\notin`))),Ms(`\\subseteq`,(e,t)=>{if(typeof e==`object`&&e.kind===`Interval`)return mv(e,t);if(!dn(e))throw new w(`\\subseteq expects a set but received ${L(e)}`);return typeof e==`object`&&e.kind===`Subset`&&typeof t==`object`&&t.kind===`Subset`&&P(e.base)?ov(F(e.base).elements,t.base):!Ai(e,e=>!Yi(e,t))}),...lv.map(e=>z(e,2,t=>{let n=R(t,0,e),r=R(t,1,e),i=e!==`\\cup`&&typeof r==`object`&&r.kind===`Interval`&&typeof n==`object`&&n.kind!==`Interval`;if(fn(n)&&fn(r)&&!uv(n)&&!uv(r)&&!i&&!ln(n)&&!ln(r)){if(e===`\\cup`&&Ii(n))return r;let t=e===`\\cup`?ti:e===`\\cap`?ei:$r;return qi((n,r)=>{let i=F(n),a=F(r),o=t(i,a);if(e===`\\cup`){let e=Wr(i),t=$r(a,i).elements,n=e===i.elements&&(t.length===0||er(e[e.length-1],t[0])<0);if(e.length+t.length>on())throw new u(sn());if(n&&!i.isNormalized)return o;let r=o===i?ar(o.elements):o;return n||(r.writtenElements=[...e,...t]),r}return o===n||(o.isNormalized=dv(n),i.writtenElements&&!i.isNormalized&&(o.writtenElements=i.writtenElements.filter(e=>Yi(e,o)))),o},(t,n)=>fv(e,t,n),n,r)}return fn(n)?fv(e,n,r):e!==`\\`&&fn(r)?fv(e,r,n):mr({kind:`SetOperation`,operator:e,left:n,right:r})})),z(`SUBSET`,1,e=>({kind:`Subset`,base:R(e,0,`SUBSET`)})),z(`UNION`,1,e=>{let t=R(e,0,`UNION`),n=hn(t)?Wr(t):[],r=n.filter(hn);if(!hn(t)||r.length!==n.length)return mr({kind:`Union`,base:t});let i=r.flatMap(Wr),a=()=>{let e={kind:`MixedSet`,elements:[]};return i.forEach(t=>{Yi(t,e)||cn(e.elements,t)}),Zr(e.elements)};return uv(t)||r.some(uv)?a():r.length===0?Qr:qi(e=>Ui(cv(e,0,e.length),i),a,r.map(F),void 0)}),z(`DOMAIN`,1,e=>{let t=R(e,0,`DOMAIN`);if(!pn(t))throw new w(`DOMAIN expects a function but received ${L(t)}`);return ga(t)})],_v=Ws(`Integers`,`Neg`,`IntValue`,1),vv=e=>{let n=Ws(e,`DotDot`,`IntervalValue`,2);return[Gs(e,`+`,`Plus`,(e,t)=>e+t),Gs(e,`-`,`Minus`,(e,t)=>e-t),Gs(e,`*`,`Times`,(e,t)=>e*t),Gs(e,`^`,`Expt`,(e,n)=>{if(n<0)throw new t(`The second argument of ^ should be a natural number, but instead it is:\n${n}`);if(e===0&&n===0)throw new t(`0^0 is undefined.`);return e**n}),Gs(e,`\\div`,`Divide`,(e,n)=>{if(n===0)throw new t(`The second argument of \\div is 0.`);let r=Math.floor(e/n);if(Ns(r))throw Ps(`${e} \\div ${n}`);return r}),Gs(e,`%`,`Mod`,(e,n)=>{if(n<=0)throw new t(`The second argument of % should be a positive number, but instead it is:\n${n}`);return(e%n+n)%n}),Ms(`..`,(e,t)=>{let r=Us(t,n);return{kind:`Interval`,low:Us(e,n),high:r}})]},yv=vv(`Naturals`),bv=vv(`Integers`),xv=e=>{let t=yv.indexOf(e);return t===-1?void 0:bv[t]},Sv=e=>{let t=(t,n=`tlc2.value.IBoolValue`)=>`public static ${n} tlc2.module.${e}.${t}(tlc2.value.impl.Value,tlc2.value.impl.Value)`,n=e===`Integers`;return[Hs(qs(`<`,(e,t)=>e<t),t(`LT`)),Hs(qs(`>`,(e,t)=>e>t),n?t(`GT`,`tlc2.value.impl.BoolValue`):t(`GT`)),Hs(qs(`<=`,(e,t)=>e<=t),t(`LE`)),Hs(qs(`>=`,(e,t)=>e>=t,n?`>=`:`>`),t(`GEQ`))]},Cv=[ks(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...yv,...Sv(`Naturals`)],wv=[ks(`Int`,{kind:`InfiniteSet`,name:`Int`}),...bv,...Sv(`Integers`),z(`-.`,1,e=>{let t=Us(R(e,0,`-`),_v);if(Ns(-t))throw Ps(`-${t}`);return-t})],Tv=(e,n,r)=>{let i=R(e,n,r),a=Wi(i);if(!a)throw new t(`${r}\n${N(L(i))}`);return a},Ev=(e,t,n)=>{let r=R(e,t,n);return typeof r==`string`?r:Tv(e,t,n)},Dv=(e,t,n)=>{let r=R(e,t,`SubSeq`);if(typeof r!=`number`)throw ws(n,`SubSeq`,`natural number`,r);return r},Ov=(e,t,n)=>typeof e==`string`?Wn(e.slice(t,n)):pi(e.slice(t,n)),kv=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Av=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,jv=(e,t)=>{let n=ic.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?Hs(e,t):e}):t},Mv=e=>jv(`Sequences`,[z(`Seq`,1,e=>({kind:`SequenceSet`,base:R(e,0,`Seq`)})),z(`Len`,1,e=>Ev(e,0,kv(``,`Len`)).length),z(`\\o`,2,e=>{let n=Ev(e,0,Av(`s \\o t`,`sequence`));if(typeof n!=`string`){let t=Tv(e,1,Av(`t \\o s`,`sequence`)),r=n.length===0?R(e,1,`\\o`):t.length===0?R(e,0,`\\o`):void 0;return r!==void 0&&ur(r)===`tuple`?r:pi([...n,...t])}let r=R(e,1,`\\o`);if(typeof r!=`string`)throw new t(`${Av(`t \\o s`,`string`)}\n${N(L(r))}`);return Wn(n+r)}),z(`Append`,2,t=>pi([...Tv(t,0,Av(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),R(t,1,`Append`)])),z(`Head`,1,e=>{let n=Tv(e,0,kv(``,`Head`));if(n.length===0)throw new t(`Attempted to apply Head to the empty sequence.`);return n[0]}),z(`Tail`,1,e=>{let n=Ev(e,0,kv(``,`Tail`));if(n.length===0)throw new t(`Attempted to apply Tail to the empty sequence.`);return Ov(n,1)}),z(`SubSeq`,3,e=>{let n=Ev(e,0,kv(`first `,`SubSeq`)),r=Dv(e,1,`second`),i=Dv(e,2,`third`);if(r>i)return Ov(n,0,0);let a=r<1||r>n.length?{position:`second`,value:r}:i>n.length?{position:`third`,value:i}:void 0;if(a)throw new t(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${N(L(R(e,0,`SubSeq`)))}\n, but instead it is\n${a.value}`);return Ov(n,r-1,i)}),As(`SelectSeq`,2,e=>{let n=Os(e,1,`SelectSeq`);return pi(Tv(e,0,kv(`first `,`SelectSeq`)).filter(e=>{let r=n.call([e]);if(typeof r!=`boolean`)throw new t(`The second argument of SelectSeq should be a boolean-valued operator, but instead it is:\n<Operator ${n.name}>`);return r}))})]),Nv=e=>jv(`FiniteSets`,[z(`IsFiniteSet`,1,e=>Vi(R(e,0,`IsFiniteSet`))),z(`Cardinality`,1,n=>{let r=R(n,0,`Cardinality`);if(!dn(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new t(`Attempted to compute cardinality of the value\n${N(L(r))}`);return zi(r,e)})]),Pv=[Hs(z(`Warshall`,1,e=>{let n=R(e,0,`Warshall`);if(!dn(n)||qn(n))throw new t(`Applying TransitiveClosure to the following value,\nwhich is not an enumerable set:\n${N(L(n))}`);zi(n);let r=[],i=/* @__PURE__ */ new Map,a=e=>{let t=Fa(e),n=i.get(t)??r.length;return n===r.length&&(i.set(t,n),r.push(e)),n},o=F(n).elements.map(e=>{let n=Wi(e);if(n?.length!==2)throw new t(`Attempted to apply TransitiveClosure to a set containing\nthe following value:\n${N(L(e))}`);return[a(n[0]),a(n[1])]}),s=r.map(()=>r.map(()=>!1));o.forEach(e=>{s[e[0]][e[1]]=!0});for(let e=0;e<r.length;e++)for(let t=0;t<r.length;t++)if(s[t][e])for(let n=0;n<r.length;n++)s[e][n]&&(s[t][n]=!0);return Zr(r.flatMap((e,t)=>r.flatMap((n,r)=>s[t][r]?[pi([e,n])]:[])))}),`public static tlc2.value.impl.Value tlc2.module.TransitiveClosure.Warshall(tlc2.value.impl.Value)`)],Fv=(e,t,n,r,i,a)=>{if(e===`TransitiveClosure`)return Pv;if(e===`AnySet`)return[ks(`ANY`,Zn)];if(e===`IOUtils`)return e_(r,a);if(e===`_TLCTrace`)return r_(r);if(!av(n.version).has(e))return;let o=Rv(e,t,n,r,i);return e===`Randomization`&&o?[...o,O_(n)]:o},Iv=/* @__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`]]]),Lv=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]]]),Rv=(e,t,n,r,i)=>{switch(e){case`Naturals`:return Cv;case`Integers`:return wv;case`Sequences`:return Mv(n.version);case`FiniteSets`:return Nv(n.version);case`TLC`:return jv(`TLC`,tv(t,n));case`Randomization`:return k_(n);case`_Possible`:return W_(t,n);case`Json`:return $g(r);case`Bags`:return jv(`Bags`,wg(i));case`TLCExt`:return jv(`TLCExt`,U_(t,n));default:return}},zv=(e,t,n)=>{let r=e.callStack;if(!r)return n();let i=r.expressions.at(-1)!==t&&gp.get(t)||[];r.expressions.push(...i,t);let a=Ki.sets,o=a??[],s=o.length;Ki.sets=o;try{return n()}catch(e){throw hS(r,o.slice(s),e),e}finally{r.isFrozen||(r.expressions.length-=i.length+1),o.length=s,Ki.sets=a}},Bv=(e,t,n)=>e.coverage?qo(e.coverage,t,n):-1,Vv=(e,t,n)=>e.coverage?Yo(e.coverage,t,n):n(),Hv=(e,t,n,r)=>Vv(e,t,()=>$(n,r)),Uv=(e,t,n,r)=>{let i=Hv(e,t,n,r),a=e.coverage;if(a?.covered.has(n))for(let e=t;e!==-1;e=a.prefixes[e])a.primary[e]--;return i},Wv=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},Gv=e=>!e.includes(void 0),Kv=e=>e.variables.map(()=>void 0),qv=(e,t,n)=>{let r=[...e];return r[t]=n,r},Jv=(e,t)=>{let n=e.operands[0].location,r=e.location.range,i=e.prefixEnds?.[t-2],a=r&&i?{...n,range:{...r,end:i}}:e.location;return{...e,operands:e.operands.slice(0,t),location:a}},Yv=(e,t)=>e.coverage?e.coverage.prefixes[t]:-1,Xv=e=>e.kind===`Identifier`?e.name:void 0,Zv=(e,t,n)=>{if(t.kind===`Label`)return Zv(e,t.body,n);let r=Xv(t);if(r===void 0)return;let i=Zb(n,r);if(i?.kind===`Thunk`)return Zv(e,i.expression,i.scope);if(i)return;let a=e.variableIndex.get(r);if(a!==void 0)return a;let o=Ux(r,e);return o?.kind===`Closure`&&o.params.length===0?Zv(e,o.body,o.scope):void 0},Qv=(e,t,n)=>{if(t.kind===`Prime`)return Zv(e,t.expression,n);if(t.kind===`Label`)return Qv(e,t.body,n);let r=Xv(t);if(r===void 0)return;let i=Zb(n,r);if(i?.kind===`Thunk`)return Qv(e,i.expression,i.scope);if(i)return;let a=Ux(r,e);return a?.kind===`Closure`&&a.params.length===0?Qv(e,a.body,a.scope):void 0},$v=e=>{if(typeof e!=`boolean`)throw new w(`TLC expected a boolean expression.`);return e},ey=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),ty=(e,t,n,r)=>{let i=ry(e,t,n,r);return i&&e.coverage&&!e.isInit&&Jo(e.coverage,r),i},ny=(e,t,n)=>{let r=e.coverage;return r&&e.isInit&&(Jo(r,n),Jo(r,r.roots[n])),e.onState(t),!0},ry=(e,t,n,r)=>t===void 0?Gv(n)?ny(e,n,r):e.onIncomplete?.(n)??!1:Gv(n)&&ey(e)?ay(e,t,n,r):t.kind===`Predicate`?oy(e,t.expression,t.rest,t.scope,n,t.node):t.kind===`Unchanged`?xy(e,t.expression,t.rest,t.scope,n,t.node):iy(e,t,n)&&ty(e,t.rest,n,t.node),iy=(e,t,n)=>{let r=e.environment,i=Hv(e,t.node,t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return Hv(e,t.node,t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?Xb(t,r.runtime.version):t}})();try{return!qr(i,a)}catch(t){throw e.callStack&&hS(e.callStack,[i],t),t}},ay=(e,t,n,r)=>{for(let i=t;i!==void 0;i=i.rest){if(i.kind===`Unchanged`)return xy(e,i.expression,i.rest,i.scope,n,i.node);if(!(i.kind===`Changed`?iy(e,i,n):$v(Hv(e,i.node,i.expression,Wv(e,i.scope,n))))){let t=e.coverage;return t&&e.isInit&&t.secondary[t.roots[r]]++,!1}}return ny(e,n,r)},oy=(e,t,n,r,i,a)=>sy(e,t,n,r,i,Bv(e,a,t)),sy=(e,t,n,r,i,a)=>zv(e,t,()=>{switch(t.kind){case`Let`:{let o=Wv(e,r,i),s=t.definitions,c=e.coverage&&!e.isEnabled?oS(s,o,{impure:new Set(s),streamed:/* @__PURE__ */ new Set}):oS(s,o);return oy(e,t.body,n,c,i,a)}case`Label`:return oy(e,t.body,n,r,i,a);case`Selection`:return oy(e,t.expression,n,r,i,a);default:if(hy.has(t.kind))throw new w(`The state relation is not a boolean expression.`);return zv(e,t,()=>yy(e,t,n,r,i,a))}}),cy=(e,t,n,r,i)=>$v(t)&&ty(e,n,r,i),ly=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`~>`,`-+->`,`\\cdot`]),uy=(e,t,n,r,i,a)=>{let o=Wv(e,r,i);if(t.kind===`Identifier`){let s=Zb(r,t.name);if(s?.kind===`Thunk`&&s.cache===void 0){let t=e.coverage?.values.get(s)??a;return oy(e,s.expression,n,s.scope,i,t)}if(s?.kind===`Operator`&&s.operator.kind===`Closure`&&s.operator.params.length===0)return oy(e,s.operator.body,n,s.operator.scope,i,a);let c=s?void 0:e.environment.definitions.get(t.name),l=s?void 0:Ux(t.name,e.environment);return l?.kind===`Closure`&&l.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(c&&Mh(c,e.environment))?oy(e,l.body,n,l.scope,i,a):cy(e,Uv(e,a,t,o),n,i,a)}let s=Wx(t,o);if(s?.kind===`Closure`&&s.params.length===t.args.length){let r=Vv(e,a,()=>nS(s,t.args,o));return oy(e,s.body,n,r,i,a)}let c=ly.has(t.operator)?Hv(e,a,t,o):Uv(e,a,t,o);return cy(e,c,n,i,a)},dy=(e,t,n,r,i,a)=>{let o=n[r];return o===void 0?ty(e,t,qv(n,r,i),a):qr(o,i)&&ty(e,t,n,a)},fy=(e,t,n,r,i)=>({kind:e,expression:t,scope:n,node:r,rest:i}),py=(e,t,n,r,i,a)=>{let[o,s]=t.args,c=e.isInit?Zv(e.environment,o,r):Qv(e.environment,o,r),l=Wv(e,r,i);if(c===void 0)return Hv(e,a,t,l)===!0&&ty(e,n,i,a);let u=Hv(e,a,s,l),d=i[c];if(t.operator===`=`)return dy(e,n,i,c,u,a);let f=t.operator===`\\subseteq`?{kind:`Subset`,base:u}:u;if(typeof f==`object`&&f!==u&&e.callStack?.sources.set(f,s),d!==void 0)return Hv(e,a,t,l)===!0&&ty(e,n,i,a);if(!gi(f))throw new w(`The right side of \\IN is not enumerable.`);let p=ji(f),m=e.coverage&&rs(e.coverage,f,p,!1),h=p.reduce((t,r)=>(m?.next(),ty(e,n,qv(i,c,r),a)||t),!1);return m?.next(),h},my=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),hy=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),gy={Always:`[]`,Eventually:`<>`,WeakFairness:`WF`,StrongFairness:`SF`},_y=e=>{let t=e.kind===`Apply`&&(e.operator===`~>`||e.operator===`-+->`)?e.operator===`~>`?`a ~> b`:`a -+-> formula`:gy[e.kind];if(t!==void 0)return`In computing ENABLED, TLC encountered a temporal formula (${t}).\n${Q(e)}`;if(e.kind===`UnboundedQuantifier`)return e.isTemporal?`In computing ENABLED, TLC encountered temporal quantifier.\n${Q(e)}`:`In computing ENABLED, TLC encountered unbounded quantifier. Make sure that the expression is of form ${e.quantifier===`Forall`?`\\A`:`\\E`} x \\in S: P(x).\n${Q(e)}`;if(e.kind===`Choose`&&e.set===void 0)return`In computing ENABLED, TLC encountered unbounded CHOOSE. Make sure that the expression is of form CHOOSE x \\in S: P(x).\n${Q(e)}`},vy=(e,t,n,r)=>{let i=[],a=e.environment.runtime.version,o=Vv(e,r,()=>_x(t.bounds,e=>{let t=$(e,n);return{value:t,elements:mx(t,e,a)}})),s=o.map(e=>e.elements);yx(t.bounds,s,n.scope,e=>(i.push(e),!1));let c=e.coverage;return{bindings:i,charge:c&&as(c,o.map(e=>e.value),s)}},yy=(e,t,n,r,i,a)=>{let o=Wv(e,r,i);switch(t.kind){case`Identifier`:return uy(e,t,n,r,i,a);case`Apply`:return my.has(t.operator)&&t.args.length===2?py(e,t,n,r,i,a):t.operator===`=>`&&t.args.length===2?$v(Hv(e,a,t.args[0],o))?oy(e,t.args[1],n,r,i,a):ty(e,n,i,a):uy(e,t,n,r,i,a);case`And`:{let o=t.operands;if(t.isBulleted||o.length===2){let t=o.slice(1).reduceRight((e,t)=>fy(`Predicate`,t,r,a,e),n);return oy(e,o[0],t,r,i,a)}let s=o[o.length-1];return sy(e,Jv(t,o.length-1),fy(`Predicate`,s,r,a,n),r,i,Yv(e,a))}case`Or`:{let o=t.operands;if(t.isBulleted||o.length===2)return o.reduce((t,o)=>oy(e,o,n,r,i,a)||t,!1);let s=sy(e,Jv(t,o.length-1),n,r,i,Yv(e,a)),c=oy(e,o[o.length-1],n,r,i,a);return s||c}case`Exists`:{let r=vy(e,t,o,a);return r.bindings.reduce((o,s)=>(r.charge?.(),oy(e,t.body,n,s,i,a)||o),!1)}case`Forall`:{let r=vy(e,t,o,a),s=r.bindings;if(s.forEach(()=>r.charge?.()),s.length===0)return ty(e,n,i,a);let c=s.slice(1).reduce((e,n)=>fy(`Predicate`,t.body,n,a,e),n);return oy(e,t.body,c,s[0],i,a)}case`If`:return oy(e,$v(Hv(e,a,t.condition,o))?t.consequent:t.alternative,n,r,i,a);case`Case`:{let s=t.arms.find(t=>$v(Hv(e,a,t.condition,o)))?.body??t.other;if(s===void 0)throw new w(`TLC encountered a CASE with no conditions true.`);return oy(e,s,n,r,i,a)}case`FunctionApplication`:{let r=Ex(Hv(e,a,t.function,e.isInit?o:tx(o)));if(r){let s=Vv(e,a,()=>Dx(r,t,o));return oy(e,r.body,n,s,i,a)}break}case`Unchanged`:if(!e.isInit)return xy(e,t.expression,n,r,i,a);break;case`BoxAction`:if(!e.isInit){let o=oy(e,t.action,n,r,i,a);return xy(e,t.subscript,n,r,i,a)||o}break;case`AngleAction`:if(!e.isInit)return oy(e,t.action,fy(`Changed`,t.subscript,r,a,n),r,i,a)}let s=e.isEnabled?_y(t):void 0;if(s!==void 0)throw new w(s);return cy(e,Hv(e,a,t,o),n,i,a)},by=(e,t,n)=>e.runtime.warn(wt.unchangedVariableChanged,`The variable ${e.variables[t]} was changed while it is specified as UNCHANGED at\n${Q(n)}`),xy=(e,t,n,r,i,a)=>zv(e,t,()=>{let o=Bv(e,a,t),s=Zv(e.environment,t,r);if(s!==void 0){let r=e.current?.[s];if(r===void 0)return!1;e.isEnabled&&e.coverage&&Jo(e.coverage,o);let a=i[s];return a!==void 0&&!qr(a,r)?(by(e.environment,s,t),!1):dy(e,n,i,s,r,o)}if(t.kind===`Tuple`){let[a,...s]=t.elements;if(a===void 0)return ty(e,n,i,o);let c=s.reduceRight((e,t)=>fy(`Unchanged`,t,r,o,e),n);return xy(e,a,c,r,i,o)}if(t.kind===`Identifier`){let a=Zb(r,t.name);if(a?.kind===`Thunk`)return xy(e,a.expression,n,a.scope,i,o);let s=a?void 0:Ux(t.name,e.environment);if(s?.kind===`Closure`&&s.params.length===0)return xy(e,s.body,n,s.scope,i,o)}if(e.isEnabled&&t.kind===`Apply`){let a=Wv(e,r,i),s=Wx(t,a);if(s?.kind===`Closure`&&s.params.length===t.args.length)return xy(e,s.body,n,nS(s,t.args,a),i,o)}let c=e.environment,l=Hv(e,o,t,{environment:c,scope:r,state:e.current,next:void 0}),u=Hv(e,o,t,{environment:c,scope:r,state:i,next:void 0});return qr(l,u)&&ty(e,n,i,o)}),Sy=(e,t,n,r,i)=>({environment:e,callStack:e.callStack,coverage:t===`enabled`&&e.coverage?.current===-1?void 0:e.coverage,isInit:t===`init`,isEnabled:t===`enabled`,current:n,onState:r,onIncomplete:i}),Cy=/* @__PURE__ */ Error(`The replay found a successor`),wy=(e,t,n,r)=>{let i=()=>{throw Cy},a=r.coverage?.current??-1,o=Sy(r,`enabled`,n,i,i),s=o.callStack,c=s?.expressions.length??0;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=fy(`Changed`,e.subscript,t,a,void 0);oy(o,e.action,n,t,Kv(r),a)}else oy(o,e,void 0,t,Kv(r),a);return!1}catch(e){if(e!==Cy)throw e;return s&&(s.expressions.length=c,s.isFrozen=!1),!0}},Ty=(e,t,n,r)=>{let[i,...a]=e;if(i===void 0)return;let o=Sy(t,`init`,void 0,n,r),s=a.reduceRight((e,t)=>fy(`Predicate`,t.expression,t.scope,t.node??-1,e),void 0);oy(o,i.expression,s,i.scope,Kv(t),i.node??-1)},Ey=(e,t,n,r)=>{if(e.some(e=>hy.has(e.expression.kind)))return;let i=n.coverage;e.forEach(e=>{let a=[],o=e.node??-1;Dy(e,o,t,n,e=>{i&&o!==-1&&i.primary[o]++,a.push(e)}),a.forEach(t=>r(t,e))})},Dy=(e,t,n,r,i,a)=>{let o=Sy(r,`next`,n,i,a);oy(o,e.expression,void 0,e.scope,Kv(r),t)},Oy=(e,t)=>{let n=[],r=e=>({environment:t,scope:e,state:void 0,next:void 0}),i=(e,r)=>{if(Zv(t,e,void 0)!==void 0&&e.kind===`Identifier`){n.push(e);return}if(e.kind===`Tuple`){e.elements.forEach(e=>i(e,r));return}if(e.kind!==`Identifier`)return;let a=Zb(r,e.name)?void 0:Ux(e.name,t);a?.kind===`Closure`&&a.params.length===0&&i(a.body,a.scope)},a=(e,o,s)=>{switch(e.kind){case`Let`:a(e.body,oS(e.definitions,r(o)),s);return;case`Label`:a(e.body,o,s);return;case`Selection`:a(e.expression,o,s);return;case`FunctionApplication`:a(e.function,o,s);return;case`If`:a(e.consequent,o,s),a(e.alternative,o,s);return;case`Case`:e.arms.forEach(e=>a(e.body,o,s)),e.other&&a(e.other,o,s);return;case`And`:case`Or`:e.operands.forEach(e=>a(e,o,s));return;case`Exists`:case`Forall`:a(e.body,o,s);return;case`Unchanged`:i(e.expression,o);return;case`AngleAction`:a(e.action,o,s);return;case`BoxAction`:a(e.action,o,s),n.push(e.subscript);return;case`Identifier`:case`Apply`:{if(e.kind===`Apply`){if(e.operator===`=>`){e.args.forEach(e=>a(e,o,s));return}if(e.operator===`=`||e.operator===`\\in`){Qv(t,e.args[0],o)!==void 0&&n.push(e);return}}let i=e.kind===`Identifier`?e.name:e.operator,c=Zb(o,i);if(c?.kind===`Thunk`){a(c.expression,c.scope,s);return}let l=e.kind===`Apply`?Wx(e,r(o)):c?.kind===`Operator`?c.operator:c?void 0:Ux(i,t);if(l?.kind!==`Closure`||s.has(l.body)||t.definitions.get(i)?.isRecursive)return;let u=e.kind===`Apply`?e.args:[];if(l.params.length!==u.length)return;s.add(l.body),a(l.body,nS(l,u,r(o)),s),s.delete(l.body)}}};return e.forEach(e=>a(e.expression,e.scope,/* @__PURE__ */ new Set)),n.flatMap(e=>e.location.range??[])},ky=/* @__PURE__ */ new WeakMap,Ay=/* @__PURE__ */ new WeakMap,jy=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},My=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Ny=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,Py=(e,t)=>{let n=new w(t);return e.isInit?n:v(n,b.error)},Fy=(e,t,n,r)=>{let i=Bb(n);return r&&hy.has(n.kind)?e.isEnabled?`Attempted to compute ENABLED on a non-boolean expression.\n${i}`:`The ${e.isInit?`init`:`next`} state relation is not a boolean expression.\n${i}`:`In computing ${Ny(e)}, TLC expected a boolean expression,\nbut instead found ${L(t)}.\n${i}`},Iy=(e,t,n)=>{let r=Bs(t),i=Q(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${Ny(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
1791
|
-
`:``}${i}`},Ly=(e,t,n)=>By(e,t,$(t,n)),Ry=new Set(gv.map(e=>e.name)),zy=e=>e.kind===`Apply`?Ry.has(e.operator):e.kind!==`Identifier`&&!hy.has(e.kind),By=(e,t,r,i=!0)=>{if(typeof r==`boolean`)return r;let a=Fy(e,r,t,i);throw e.isInit&&i&&zy(t)?new n(a):Py(e,a)},Vy=(e,t,n,r)=>r.environment.callStack?$(n,r):(e[t]??=SS(n,r.environment))(r),Hy=e=>e===`=`||e===`\\in`||e===`\\subseteq`,Uy=(e,t,n)=>{let r=n?ky:Ay,i=r.get(e);if(i)return i;let a=Cb(e,t,n),o=n?void 0:Sb(e,t),s=o?(e,t,n,r,i,s)=>(e.generator?o:a)(e,t,n,r,i,s):a;return r.set(e,s),s},Wy=(e,t)=>{if(t.constants.has(e))return;let n=cx(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},Gy=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return Gy(e.expression,t,!1,r);if(e.kind!==`Identifier`||M(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=Wy(e.name,t);if(a&&!r.has(a))return r.add(a),Gy(a.body,t,n,r)},Ky=(e,t,n)=>Gy(e,t,!n),qy=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return qy(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=oS(e.definitions,jy(r,t,n));return qy(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=Zb(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return qy(a.expression,a.scope,n,r,i);if(a)return;let o=r.environment.variableIndex.get(e.name);if(o!==void 0)return i?void 0:o;let s=Wy(e.name,r.environment);if(s)return qy(s.body,void 0,n,r,i)},Jy=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||M(e))||!t&&e.kind===`Prime`,Yy=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Yy(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[{index:r,expression:e}];let i=Wy(e.name,t);if(i)return n.add(e.name),Yy(i.body,t,n)},Xy=/* @__PURE__ */ new Set([`Label`,`Selection`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),Zy=(e,t,n)=>Xy.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||Hy(e.operator)&&(Jy(e.args[0],n)||Ky(e.args[0],t,n)!==void 0)||M(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,Qy=/* @__PURE__ */ new Set,$y=(e,t)=>{if(M(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r=!0;return Op(e,(e,i)=>{let a=r?$y(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];a?n.push(...a):r=!1}),r?n:void 0},eb=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||M(e)?void 0:cx(r,t);return i&&!n.has(i)&&(n.add(i),eb(i.body,t,n))?!0:mt(e).some(e=>eb(e,t,n))},tb=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=Ky(e.args[0],t,n);if(r!==void 0)return{kind:`Assign`,expression:e,index:r,value:e.args[1]}}if(!n&&e.kind===`Unchanged`){let n=Yy(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,variables:n}}return Zy(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:Uy(e,t,n)}},nb=(e,t)=>{if(e.bounds.length<2||e.body.kind!==`And`)return;let n=e.bounds.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:[]);if(n.length!==e.bounds.length)return;let r=new Set(n.slice(0,-1)),i=e.body.operands,a=i.findIndex(e=>{if(Bh(e,t)===void 0||eb(e,t,/* @__PURE__ */ new Set))return!0;let n=$y(e,Qy);return!n||n.some(e=>r.has(e))}),o=a===-1?i.length:a;if(o!==0)return{names:n,guards:i.slice(0,o),rest:i.slice(o)}},rb=(e,t,n)=>{let r=e.map(e=>tb(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=ey(t);for(let s=e;s<r.length;s++){if(s>0&&f&&Tb(u)){d??=jy(t,n,u);for(let e=s;e<r.length;e++){let n=r[e],i=t.current,o=i&&n.kind===`Unchanged`?n.variables.find(e=>{let t=u[e.index];return t!==void 0&&!qr(t,i[e.index])}):void 0;if(o){by(t.environment,o.index,o.expression);return}let s=n.expression,c=Vy(a,e,s,d);if(!By(t,s,c,!1)){t.onUnsatisfied?.(u,s);return}}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=jy(t,n,u);let r=Vy(i,s,e.expression,d);if(!By(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=jy(t,n,u);let r=Vy(i,s,e.value,d),a=u[e.index];if(a===void 0)u=My(u,e.index,r),d=void 0;else if(!qr(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;let r;for(let i of e.variables){let e=(r??u)[i.index];if(e===void 0)r??=u.slice(),r[i.index]=n[i.index];else if(!qr(e,n[i.index])){by(t.environment,i.index,i.expression);return}}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},ib=e=>{let t=_y(e);return(n,r,i,a,o,s)=>{if(n.isEnabled&&t!==void 0)throw Py(n,t);Ly(n,e,jy(n,r,i))&&s(i,a)}},ab=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=jy(r,i,a);if(a[l]!==void 0){Ly(r,e,u)&&c(a,o);return}let d=$(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!gi(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${Ny(r)}, the right side of \\IN is not enumerable.`;throw Py(r,`${t}\n${Q(e)}`)}let p=ji(f);if(r.generator){for(let e of b_(p.length,f,r.environment.runtime.getRandom(),r.environment.runtime.version))if(c(My(a,l,e),o),r.successors>0||r.isStopped)return}for(let e=0;e<p.length&&!r.isStopped;e++)c(My(a,l,p[e]),o)}},ob=/* @__PURE__ */ new WeakMap,sb=e=>{let t=ob.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(sb),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return ob.set(e,n),n},cb=(e,t)=>{let n=e.args[0],r=ib(e),i=(e,r,i)=>qy(n,r,i,e,!t)??-1,a=ab(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=$(e.args[1],jy(t,n,o));l(My(o,u,d),s)}},lb=(e,t,n)=>{let r=Q(e);return(i,a,o,s,c,l)=>{let u=jy(i,a,o),d=$(e.function,n?u:tx(u)),f=Ex(d);if(f!==void 0){Uy(f.body,t,n)(i,Dx(f,e,u),o,s,c,l);return}if(!pn(d))throw Py(i,`In computing ${Ny(i)}, a non-function (${Bs(d)}) was applied as a function.\n${r}`);let p=$(e,u);if(typeof p!=`boolean`)throw Py(i,`In computing ${Ny(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},ub=(e,t)=>{let n=sb(e);return Yy(e,t)?rb([n],t,!1):e.kind===`Tuple`?Uy(n,t,!1):(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?Zb(i,e.name):void 0;if(l?.kind===`Thunk`&&!l.isReleased){Uy(sb(l.expression),t,!1)(r,l.scope,a,o,s,c);return}let u=jy(r,i,a);if(r.isEnabled&&e.kind===`Apply`){let n=Wx(e,u);if(n?.kind===`Closure`&&n.params.length===e.args.length){Uy(sb(n.body),t,!1)(r,nS(n,e.args,u),a,o,s,c);return}}Ly(r,n,u)&&c(a,o)}},db=(e,t,n)=>{let r=e.operator,i=ib(e),a=M(e)?void 0:Ux(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=DS(a,e.args,t),o;return(e,s,c,l,u,d)=>{o??=Uy(a.body,t,n),o(e,i(jy(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=jy(a,o,s),f=Wx(e,d);f?.kind===`Closure`?Uy(f.body,t,n)(a,nS(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},fb=(e,t,n)=>{let r=ib(e),i=M(e)?void 0:Wy(e.name,t),a;return(o,s,c,l,u,d)=>{let f=Zb(s,e.name);f?.kind===`Thunk`&&!f.isReleased?Uy(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i||e.location.range&&Rx(i,t)!==void 0?r(o,s,c,l,u,d):(a??=Uy(i.body,t,n),a(o,void 0,c,u?l:i.name,u,d))}},pb=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||M(e))return;let n=e.args[0],r=e.args[1];if(n.kind!==`FunctionApplication`||r.kind!==`String`)return;let i=n.args.length===1?n.args[0]:void 0;if(i?.kind!==`Identifier`||!M(i))return;let a=Gy(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},mb=e=>e.kind===`And`?e.operands.flatMap(mb):[e],hb=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&Zy(e,t,!1),gb=e=>{let t=[];return(n,r,i)=>{let a=jy(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!By(n,i,Vy(t,r,i,a)))return}}},_b=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=mb(e),r=n.findIndex(e=>!hb(e,t)||pb(e,t)),i=r===-1?void 0:pb(n[r],t);return i?{...i,before:r===0?void 0:gb(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>_b(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.before===void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o,before:void 0}}if(e.kind!==`Apply`||M(e))return;let r=Ux(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=_b(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(!i||o?.kind!==`Identifier`||!M(o))return;let s=i.before,c=s&&DS(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(jy(e,t,n)),n))}},vb=(e,t,n)=>{let r=Zb(t,n.argument),i=e.current?.[n.variable];if(r?.kind!==`Value`||typeof i!=`object`||i.kind!==`Function`)return;let a=i.domain.indexOf(r.value),o=a===-1?void 0:i.range[a];return typeof o==`string`?o:void 0},yb=(e,t,n)=>{let r=e.map(e=>Uy(e,t,n)),i=n?[]:e.map(e=>_b(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e:void 0);return(e,t,n,i,s,c)=>{let l=a&&vb(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++){let u=o[a];l!==void 0&&u?.labels.has(l)===!1?u.before?.(e,t,n):r[a](e,t,n,i,s,c)}}},bb=e=>(t,n,r,i,a,o)=>{let s=t.generator;if(!s)throw Error(`A random choice needs the run's generator`);let c=Math.floor(s.nextDouble()*e.length),l=u_(s);for(let s=0;s<e.length;s++)if(e[(c+s*l)%e.length](t,n,r,i,a,o),t.successors>0||t.isStopped)return},xb=(e,t)=>{let n=Uy(e.body,t,!1);return(r,i,a,o,s,c)=>{let l=jy(r,i,a),u=t.runtime.version,d=_x(e.bounds,e=>$(e,l)).map((n,r)=>b_(fx(n,e.bounds[r].set,u).length,n,t.runtime.getRandom(),u)),f=(t,i)=>{if(t<0)return n(r,i,a,o,s,c),r.successors>0||r.isStopped;let l=e.bounds[t].pattern;return d[t].some(e=>f(t-1,$b(i,l,e)))};f(d.length-1,i)}},Sb=(e,t)=>{if(e.kind===`Exists`)return xb(e,t);if(e.kind!==`Or`)return;let n=e.operands.map(e=>Uy(e,t,!1));return e.isBulleted?bb(n):n.reduce((e,t)=>bb([e,t]))},Cb=(e,t,n)=>{let r=e=>Uy(e,t,n);switch(e.kind){case`And`:return rb(e.operands,t,n);case`Or`:return yb(e.operands,t,n);case`Exists`:{let i=r(e.body),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name;return(n,r,o,s,c,l)=>{let u=fx($(a.set,jy(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,Qb(r,e,u[t]),o,s,c,l)}}let o=n?void 0:nb(e,t);if(o){let r=rb(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=jy(n,i,a),d=_x(e.bounds,e=>fx($(e,u),e,t.runtime.version));if(d.some(e=>e.length===0))return;let f=(e,t)=>{if(e<0)r(n,t,a,s,c,l);else for(let r of d[e]){if(n.isStopped)return;let i=Qb(t,o.names[e],r);if(e===d.length-1){let e=jy(n,i,a);if(!o.guards.every(t=>Ly(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{bx(e.bounds,jy(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Bh(e,t)!==void 0&&!eb(e.body,t,/* @__PURE__ */ new Set)?$y(e,Qy):void 0;return(t,n,r,o,s,c)=>{let l=[];bx(e.bounds,jy(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>Zb(n,e)?.kind===`Value`)){u.every(n=>Ly(t,e.body,jy(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Tb(r)?u.slice(n).every(n=>Ly(t,e.body,jy(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=$(e.condition,jy(r,i,a));if(typeof l!=`boolean`)throw Py(r,Iy(r,l,e));(l?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,source:e.body,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=jy(r,i,a),u=t.find(e=>{let t=$(e.condition,l);if(typeof t==`boolean`)return t;throw Py(r,`In computing ${Ny(r)}, a non-boolean expression${r.isEnabled?``:` `}(${Bs(t)}) was used as a guard condition of a CASE.\n${Bb(e.source)}`)})?.body??n;if(!u)throw Py(r,`In computing ${Ny(r)}, TLC encountered a CASE with no conditions true.\n${Q(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=cS(e.definitions,t),a={impure:/* @__PURE__ */ new Set,streamed:i.streamed};return(t,r,o,s,c,l)=>n(t,oS(e.definitions,jy(t,r,o),t.isEnabled?a:i),o,s,c,l)}case`Unchanged`:return n?()=>{throw new w(`UNCHANGED appears in an initial predicate at ${Lb(e)}`)}:ub(e.expression,t);case`AngleAction`:{let n=r(e.action),i={kind:`Unchanged`,expression:e.subscript,location:e.subscript.location},a=(e,n,r)=>{try{return Ly(e,i,jy(e,n,r))}catch(n){throw e.isEnabled?Xb(n,t.runtime.version):n}};return(e,t,r,i,o,s)=>n(e,t,r,i,o,(n,r)=>{a(e,t,n)||s(n,r)})}case`BoxAction`:return yb([e.action,sb(e.subscript)],t,n);case`Label`:return r(e.body);case`Selection`:return r(e.expression);case`Identifier`:return fb(e,t,n);case`FunctionApplication`:return lb(e,t,n);case`Apply`:{let i=e.args;if(Hy(e.operator)){let r=Ky(i[0],t,n);if(r!==void 0)return e.operator===`=`?rb([e],t,n):ab(e,()=>r);if(Jy(i[0],n))return cb(e,n)}if(e.operator===`=>`){let t=r(i[1]);return(n,r,a,o,s,c)=>{let l=$(i[0],jy(n,r,a));if(typeof l!=`boolean`){let t=Bs(l),r=Q(e);throw Py(n,n.isInit?`In computing initial states of a predicate of form P => Q, P was ${t}\n.${r}`:n.isEnabled?`While computing ENABLED of an expression of the form P => Q, P was ${t}.\n${r}`:`In computing next states of a predicate of the form P => Q, P was\n${t}.\n${r}`)}l?t(n,r,a,o,s,c):c(a,o)}}return db(e,t,n)}default:return ib(e)}},wb=e=>e.variables.map(()=>void 0),Tb=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Eb=(e,t)=>{let n=t.state;if(!n||!Tb(n))throw new w(`ENABLED needs a complete state at ${Lb(e)}`);let r=t.environment;if(r.callStack||r.coverage&&r.coverage.current!==-1)return wy(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1,generator:void 0,successors:0};return Uy(e,r,!1)(i,t.scope,wb(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Db=(e,t,n,i,a)=>{let o={environment:t,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1,generator:void 0,successors:0};Uy(e,t,!0)(o,i,wb(t),void 0,!1,e=>{if(!o.isStopped){if(!Tb(e)){if(a){o.isStopped=a([...e]);return}throw v(new r([...e]),b.error)}o.isStopped=n(e)}})},Ob=(e,t,n)=>{let r=[];return Db(e,t,e=>(r.push(e),!1),n),r},kb=(e,t,n)=>{let r=n.variables.filter((t,n)=>e[n]===void 0);return new ne(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${r.join(`, `)}`,e,t,r)},Ab=(e,t,n,r,i,a,o,s)=>{let c={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:a,successors:0,onUnsatisfied:o};return Uy(e,n,!1)(c,i,wb(n),void 0,!1,(e,t)=>{if(!c.isStopped){if(!Tb(e)){if(s){s(e,t);return}throw kb(e,t,n)}c.successors++,c.isStopped=r({state:e,action:t})}}),c.successors},jb=(e,t,n,r)=>{let i={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:void 0,successors:0};return Uy(e,n,!1)(i,r,wb(n),void 0,!1,e=>{Tb(e)||i.successors++}),i.successors>0},Mb=(e,t,n,r)=>{let i=[];return Ab(e,t,n,e=>(i.push(e),!1),r),i},Nb=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Pb=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Fb=e=>Pb.has(e.kind)||e.kind===`Apply`&&Nb.has(e.operator),Ib=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&fn(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Lb=e=>`line ${e.location.line}, column ${e.location.column}`,Q=e=>{let t=e.location.range;return t?m(t):Lb(e)},Rb={Always:`[]A`,Eventually:`<>A`,WeakFairness:`WF`,StrongFairness:`SF`},zb=(e,t)=>new w(`TLC encountered a temporal formula (${e}) when evaluating a predicate or action.\n${Q(t)}`),Bb=e=>e.kind===`Number`?e.text??String(e.value):Q(e),Vb=(e,t)=>new w(`A non-boolean expression (${Bs(t)}) was used as the condition of an IF.\n${Q(e)}`),Hb=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new w(`A non-boolean expression (${Bs(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${Bb(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new w(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${Bs(n)}.\n${Q({...e,location:{...e.location,range:{...r,end:i}}})}`)},Ub=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${N(L(n))}\n${Q(e)}`,r=e=>`Attempted to apply function:\n${N(L(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!pn(i))throw new w(`Attempted to select field "${t}" from a non-record value ${N(L(i))}\n${Q(e)}`);let a=ur(i);if(a===`tuple`)throw oa(t);return ma(i.kind===`LazyFunction`?I(i):i,t,a===`record`?n:r)}},Wb=e=>e===`1.7.4`?(t,n)=>ra(t,n,e):void 0,Gb=e=>t=>{if(!pn(t))throw new w(`Attempted to apply the operator DOMAIN to a non-function\n(${Bs(t)})\n${Q(e)}`);return ga(t)},Kb=(e,t)=>(n,r)=>{if(!dn(n)||qn(n))throw new w(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${Q(e)}`);return t(n,r)},qb=e=>v(new w(`TLC can't handle real numbers.\n${e.text}`),b.configParseError),Jb=e=>v(new w(`TLC can't handle a number this big.\n${e.text??e.value}`),b.error),Yb=(e,t)=>new T(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${Q(t)}`,e),Xb=(e,t)=>e instanceof T&&t!==`1.7.4`?new w(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${e.variable} occurring in the state formula v.\n`):e,Zb=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},Qb=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),$b=(e,t,n)=>{if(t.kind===`Name`)return Qb(e,t.name,n);let r=Wi(n);if(!r||r.length!==t.names.length){let e=t.ranges?.[0];throw new w(`Argument mismatch in operator application.${e?m(e):``}`)}return t.names.reduce((e,t,n)=>Qb(e,t,r[n]),e)},ex=(e,t)=>{if(pn(e))return e;throw new w(`A non-function (${Bs(e)}) was applied as a function.\n${Q(t)}`)},tx=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},nx=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),rx=(e,t)=>{if(typeof e!=`boolean`)throw new w(`Expected ${t} to be a boolean but found ${L(e)}`);return e},ix=(e,t,n)=>{if(typeof e!=`boolean`)throw new w(`Attempted to evaluate an expression of form P => Q when ${n} was\n${Bs(e)}.\n${Q(t)}`);return e},ax=(e,t)=>{if(typeof e!=`boolean`)throw new w(`Attempted to apply the operator ~ to a non-boolean\n(${Bs(e)})\n${Q(t)}`);return!e},ox=(e,t,n)=>{if(typeof e!=`boolean`||typeof t!=`boolean`)throw new w(`Attempted to evaluate an expression of form P <=> Q when P or Q was not a boolean.\n${Q(n)}`);return e===t},sx=(e,t)=>{if(typeof e!=`boolean`)throw new w(`TLC expected a boolean value, but did not find one. ${Bb(t)}`);return e},cx=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),lx=(e,t)=>{let n=`universally (\\A) or existentially (\\E) quantify over ${t}, because this would require checking an\ninfinite number of cases.`;if(typeof e==`object`&&e.kind===`SequenceSet`)return`In TLA+, Seq(S) represents the set of all finite sequences whose elements come from the set S. Even when S\nis a finite set, the number of possible sequences in Seq(S) is unbounded because sequences can have any\nfinite length (e.g., length 0, 1, 2, and so on). As a result, TLC cannot evaluate expressions that\n${n} Note that for a finite set of sequences s, TLC handles s \\subseteq Seq(S).\nSee https://explain.tlapl.us/seq-unenumerable for additional details.`;if(typeof e==`object`&&e.kind===`InfiniteSet`&&e.name!==`STRING`&&e.name!==`Any`)return`The set ${e.name} contains infinitely many elements. As a result, TLC cannot evaluate expressions that\n${n} Note that TLC handles set membership like T \\subseteq ${e.name} for any finite set T.`},ux=(e,t,n)=>{if(!dn(e)||qn(e)){let r=L(e),i=n===`1.7.4`?void 0:lx(e,r);throw new w(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${Bb(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${Bb(t)}\n${i}`)}},dx=(e,t,n)=>(ux(e,t,n),typeof e==`object`&&e.kind===`Interval`?li(e):Ci(e)??ki(e)),fx=(e,t,n)=>n===`1.7.4`?(ux(e,t,n),Ci(e)??ji(e)):dx(e,t,n),px=e=>{if(typeof e==`object`&&e.kind===`Interval`)return zi(e),e},mx=(e,t,n)=>px(e)??fx(e,t,n),hx=(e,t,n)=>px(e)??dx(e,t,n),gx=(e,t)=>{if(Array.isArray(e))return e.some(t);for(let n=e.low;n<=e.high;n++)if(t(n))return!0;return!1},_x=(e,t)=>e.reduce((n,r,i)=>(n.push(i>0&&e[i-1].set===r.set?n[i-1]:t(r.set,i)),n),[]),vx=(e,t)=>_x(e,e=>mx($(e,t),e,t.environment.runtime.version)),yx=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):gx(t[n],t=>i(n-1,$b(a,e[n].pattern,t)));return i(e.length-1,n)},bx=(e,t,n)=>yx(e,vx(e,t),t.scope,n),xx=(e,t,n,r)=>{let i=_x(e,e=>{let n=$(e,t);return{value:n,elements:mx(n,e,t.environment.runtime.version)}}),a=i.map(e=>e.elements),o=as(n,i.map(e=>e.value),a);return yx(e,a,t.scope,e=>(o(),r(e)))},Sx=(e,t)=>{let n=_x(e,e=>$(e,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Cx=(e,t,n)=>{if(e.length===1)return $b(t,e[0].pattern,n);let r=Wi(n)??[];return e.reduce((e,t,n)=>$b(e,t.pattern,r[n]),t)},wx=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,Tx=e=>Object.assign(e.value,{lambda:e}),Ex=e=>wx(e)?e.lambda:void 0,Dx=(e,t,n)=>{let r=e.value,i=t.args.map(e=>$(e,n)),a=i.length===1?i[0]:pi(i),o=(e,n,i)=>`In applying the function\n${N(L(r))},\nthe ${e} is:\n${N(L(n))}${i}.\n${Q(t.function)}`,s=e.bounds;if(s.length===1){if(!Yi(a,r.domain))throw new w(o(`first argument`,a,`which is not in its domain`));return Cx(s,e.scope,a)}let c=Wi(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[];if(c===void 0)throw new w(`Attempted to apply a function to an argument not in its domain.\n${Q(t.function)}`);let u=()=>new w(`In applying the function\n${N(L(r))},\nthe argument list is:\n${N(L(a))}\nwhich does not match its formal parameter.\n`);if(s.forEach((e,t)=>{if(t>=c.length)throw u();let n=c[t],r=`argument number ${t+1}`;if(!Yi(n,l[t]))throw new w(o(r,n,`${e.pattern.kind===`Name`?``:`
|
|
1792
|
-
`}which is not in its domain`));if(e.pattern.kind===`Tuple`&&Wi(n)?.length!==e.pattern.names.length)throw new w(o(r,n,`which does not match its formal parameter`))}),c.length>s.length)throw u();return Cx(s,e.scope,a)},Ox=(e,t)=>{if(t.location.range)return{parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:Bb(t)}},kx=(e,t,n)=>{if(!e)return;let r=t.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:e.parameters.map(e=>({name:e.name,domain:r[e.index]})),body:e.body}},Ax=(e,t,n,r)=>{let i={kind:`LazyFunction`,domain:e,source:n,boundTupleLengths:r,apply:e=>t(e,i)};return i},jx=e=>e.length===1?void 0:e.map(e=>e.pattern.kind===`Tuple`?e.pattern.names.length:void 0),Mx=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),Nx=(e,t)=>{let n=Sx(e.bounds,t),r=Ax(n,(n,r)=>$(e.body,nx(t,Cx(e.bounds,Qb(void 0,e.name,r),n))),kx(Ox(e.bounds,e.body),e.bounds,n),jx(e.bounds));Tx({value:r,bounds:e.bounds,body:e.body,scope:Qb(void 0,e.name,r)});let i=Object.assign(r,{rebind:n=>{let i=Nx(e,{...t,environment:n});return i.enumerated=r.enumerated,i}});return e.bounds.length===1?dr(i):i},Px=(e,t)=>{if(typeof t!=`object`||ur(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!fn(t.domain))return t;try{let e=I(t);return sr(e.domain,e.range)}catch(e){if(e instanceof w)return t;throw e}},Fx=(e,t)=>e.kind===`Operator`&&e.params.length>0?()=>{throw new w(`Operator ${e.name} requires ${e.params.length} arguments`)}:e.kind===`Function`?e.isSelfReferential?t=>Nx(e,t):SS(Mx(e),t):SS(e.body,t),Ix={name:``,binding:{kind:`Value`,value:!1},parent:void 0},Lx=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=Fx(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=e.kind===`Operator`&&e.params.length===0&&Lh(e.body,t)?e=>(i===void 0?void 0:a[i])??r(nx(e,kS(e.scope)?void 0:Ix)):i===void 0?e=>r(nx(e,void 0)):e=>a[i]??r(nx(e,void 0));return t.definitionEvaluators.set(e,o),o},Rx=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},zx=(e,t)=>e.forEach(e=>{if(e.kind===`Operator`&&e.params.length>0)return;let n=e.name;if(t.constants.has(n)||t.substitutions.has(n)||!Nh(e,t))return;let r=t.facts.ids.get(e);if(r===void 0||t.startupValues[r]!==void 0)return;let i={environment:t,scope:void 0,state:void 0,next:void 0};try{let n=t.runtime.evaluateAtStartup(()=>Px(e,Fx(e,t)(i)));Gr(n),t.startupValues[r]=n}catch(e){if(!(e instanceof w)&&!te(e))throw e}}),Bx=(e,t)=>{if(t===void 0||e===t)return!0;try{return t.every((t,n)=>t===void 0||e?.[n]!==void 0&&vr(e[n],t))}catch(e){if(e instanceof w)return!1;throw e}},Vx=(e,t)=>{let n=e.cache;if(n!==void 0&&Bx(t.state,e.state)&&Bx(t.next,e.next))return n;let r=t.environment.coverage,i=r?.current===-1?void 0:r?.values.get(e),a=r&&i!==void 0?Yo(r,i,()=>$(e.expression,nx(t,e.scope))):$(e.expression,nx(t,e.scope));return(!e.isStreamed||Ni(a))&&(e.cache=a,e.state=t.state,e.next=t.next),e.cache!==void 0&&e.state===void 0&&e.next===void 0&&(e.scope=void 0,e.isReleased=!0),a},Hx=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),Ux=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return Ux(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Hx(r):t.builtins.get(e)},Wx=(e,t)=>M(e)?Gx(e.operator,t):Ux(e.operator,t.environment)??Gx(e.operator,t),Gx=(e,t)=>{let n=Zb(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return Ux(e,t.environment)},Kx=e=>e.kind===`Closure`?e.params.length:e.arity,qx=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:e.params.map(e=>({name:e,arity:0})),body:e.body,scope:t.scope};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0,r=n===void 0?void 0:Gx(n,t);if(!r)throw new w(`Expected an operator argument at ${Lb(e)}`);return r},Jx=(e,t,n)=>{if(e.kind===`Builtin`&&e.isLazy)return e.evaluate(t.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>e})),n);if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>Qb(e,n.name,t[r]),e.scope);return $(e.body,nx(n,r))},Yx=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:Kx(e),call:n=>Jx(e,n,t)},Xx=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Gx(e.name,t);return n!==void 0&&Kx(n)>0},Zx=(e,t)=>e.map(e=>Xx(e,t)?Yx(qx(e,t),t):$(e,t)),Qx=(e,t)=>new w(`Operator ${e.name} expects ${e.params.length} arguments but received ${t}`),$x=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),eS=(e,t)=>{let n=t.variableIndex.get(e);if(n!==void 0)return{kind:`Variable`,index:n};let r=t.constants.get(e);if(r!==void 0)return{kind:`Value`,value:r};let i=t.substitutions.get(e);if(i!==void 0)return eS(i,t);let a=t.definitions.get(e);if(a)return{kind:`Definition`,definition:a};let o=t.builtins.get(e);if(o&&o.arity===0&&!o.isStateLevel)return{kind:`Value`,value:o.evaluate([])}},tS=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&_n(e.value)){let t={kind:`Value`,value:e.value,argument:e};return()=>t}let n=t.coverage;if(n)return t=>{let r=$x(e,t);return n.current!==-1&&n.values.set(r,n.current),r};if(e.kind===`Identifier`){let n=M(e)?void 0:eS(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0&&!t.callStack)return t=>{let n=Zb(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:$x(e,t)}}return t=>$x(e,t)},nS=(e,t,n,r)=>{if(t.length!==e.params.length)throw Qx(e,t.length);let i=e.scope;for(let a=0;a<t.length;a++){let o=e.params[a],s=o.arity>0?{kind:`Operator`,operator:qx(t[a],n)}:(r?.[a]??tS(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},rS=(e,t,n,r)=>e.kind===`Closure`?$(e.body,nx(n,nS(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>$(e,n))):e.isLazy?e.evaluate(TS(t,n),n):e.evaluate(Zx(t,n),n),iS=/* @__PURE__ */ new WeakMap,aS=e=>{let t=iS.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:!0};return iS.set(e,n),n},oS=(e,t,n)=>{let r=e.map(e=>({name:e.name,binding:{kind:`Value`,value:!1},parent:void 0})),i=r.reduce((e,t)=>(t.parent=e,t),t.scope),a=!1;for(let o=e.length-1;o>=0;o--){let s=e[o];a||=s.isRecursive;let c=s.kind===`Operator`&&s.params.length===0&&!a?r[o].parent:i;r[o].binding=s.kind===`Function`?{kind:`Thunk`,expression:aS(s),scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1}:s.params.length>0||n?.impure.has(s)?{kind:`Operator`,operator:{kind:`Closure`,name:s.name,params:s.params,body:s.body,scope:c}}:{kind:`Thunk`,expression:s.body,scope:c,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(s)??!1}}let o=t.environment.coverage;return o&&o.current!==-1&&r.forEach(e=>{e.binding.kind===`Thunk`&&o.values.set(e.binding,o.current)}),i},sS=(e,t,n)=>{let r=Zb(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return Vx(r,n);if(r?.kind===`Operator`){if(Kx(r.operator)===0)return Jx(r.operator,[],n);throw new w(`Operator ${e} is used without arguments`)}let i=eS(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw Yb(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return Lx(i.definition,n.environment)(n);let a=n.environment.builtins.get(n.environment.substitutions.get(e)??e);if(a?.arity===0)return a.evaluate([],n);throw new w(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${Q(t)}`)},cS=(e,t)=>({impure:new Set(e.filter(e=>Ih(e,t,`varying`))),streamed:new Set(e.filter(e=>Ih(e,t,`streamed`)))}),lS=e=>[...e.facts.ids.keys()].some(t=>Ih(t,e)),uS=e=>[...e.facts.ids.keys()].some(t=>Ih(t,e,`repeated`)),dS=e=>typeof e==`object`&&(e.kind===`FilteredSet`||e.kind===`LazyFunction`)&&`rebind`in e,fS=e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),pS=e=>t=>{let n=e(t);return vr(n,e(fS(t)))},mS=(e,t,n,r)=>i=>{r.expressions.push(e);let a=Ki.sets,o=Ki.callStack,s=a??[],c=s.length;Ki.sets=s,Ki.callStack=r;try{let a=t(i),o=dS(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&Fb(e)&&r.sources.set(o,e),o}catch(t){t instanceof u&&!r.isFrozen&&(r.expressions.length=0,r.isFrozen=!0);let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=Ib(e,r.values),a=i&&!mt(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!pn(a)?void 0:a;throw hS(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,Ki.sets=a,Ki.callStack=o}},hS=(e,t,n)=>{let r=[...new Set(t)].flatMap(t=>{let n=typeof t==`object`?e.sources.get(t):void 0;return n?[n]:[]});if(r.length>0&&n instanceof w){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},gS=(e,t,n)=>{if(!(n instanceof w))return;e.isFrozen||e.expressions.push(t),e.isFrozen=!0;let r=e.fingerprint;e.fingerprint={sources:[t,...r?.sources??[]],reason:r?.reason??n.message}},_S=e=>({...e,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),vS=(e,t,n)=>{let r=e.location.range,i=e.prefixEnds;if(!n||e.isBulleted||!r||!i||t.length<3)return;let a=i.slice(0,t.length-2).map(t=>({...e,location:{...e.location,range:{...r,end:t}}})).reverse(),o=e.kind===`And`;return r=>{n.expressions.push(...a);for(let i=0;i<t.length;i++){i>=2&&!n.isFrozen&&n.expressions.pop();let s=t[i](r);if(typeof s!=`boolean`)throw Hb(e,i,s);if(s!==o)return n.isFrozen||(n.expressions.length-=a.length-Math.max(i-1,0)),s}return o}},yS=(e,t,n,r)=>i=>{if(r.expressions.at(-1)===e)return n(i);r.expressions.push(...t);try{return n(i)}finally{r.isFrozen||(r.expressions.length-=t.length)}},bS=(e,t,n)=>r=>{let i=n.current;if(i===-1||!n.covered.has(e))return t(r);let a=qo(n,i,e);Jo(n,a),n.current=a;try{let i=t(r),o=e.kind===`SetEnumeration`||(e.kind===`SetFilter`||e.kind===`SetMap`)&&fn(i)||e.kind===`SetFilter`&&typeof i==`object`&&i.kind===`FilteredSet`||(e.kind===`FunctionSet`||e.kind===`RecordSet`)&&typeof i==`object`&&i.kind===e.kind||e.kind===`Apply`&&e.operator===`SUBSET`&&typeof i==`object`&&i.kind===`Subset`;return typeof i==`object`&&o&&n.values.set(i,a),i}finally{n.current=i}},xS=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=$S(e,t),i=t.callStack,a=i&&gp.get(e),o=i?mS(e,r,t,i):r,s=i&&a?yS(e,a,o,i):o,c=t.coverage,l=c?bS(e,s,c):s;return t.evaluators.set(e,l),l},SS=(e,t)=>{if(t.callStack||t.coverage)return xS(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=cg(e,t)??xS(e,t);return t.entryEvaluators.set(e,r),r},$=(e,t)=>SS(e,t.environment)(t),CS=(e,t)=>{let n=e.name,r=M(e)?void 0:eS(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw Yb(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`){let e=r.definition,n;return r=>(n??=Lx(e,t))(r)}return t=>sS(n,e,t)},wS=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||M(e))return!0;let n=Ux(e.name,t);return n===void 0||Kx(n)===0},TS=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>$(e,t),expression:e})),ES=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(TS(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&wS(t[0],n)){let e=xS(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&wS(t[0],n)&&wS(t[1],n);if(i&&a){let e=xS(t[0],n),r=xS(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(Zx(t,n),n)},DS=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw Qx(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:tS(e,n));return n=>{let a=e.scope;for(let e=0;e<t.length;e++){let o=i[e],s=o?o(n):{kind:`Operator`,operator:qx(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},OS=(e,t,n)=>{let r=DS(e,t,n),i;return t=>(i??=SS(e.body,n),i({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},kS=e=>{for(let t=e;t!==void 0;t=t.parent){let e=t.binding;if(e.kind!==`Operator`||e.operator.kind!==`Closure`||e.operator.params.length===0)return!1;let n=e.operator.scope;for(;n!==void 0&&n!==t;)n=n.parent;if(n!==t)return!1}return!0},AS=/* @__PURE__ */ new Set([`\\cup`,`\\cap`,`\\`]),jS=(e,t)=>{let n=e.args;if(e.operator===`=>`){let r=xS(n[0],t),i=xS(n[1],t);return t=>!ix(r(t),e,`P`)||ix(i(t),e,`Q`)}if(e.operator===`~`&&n.length===1){let r=xS(n[0],t);return t=>ax(r(t),e)}if(e.operator===`<=>`){let r=xS(n[0],t),i=xS(n[1],t);return t=>ox(r(t),i(t),e)}if(e.operator===`~>`||e.operator===`-+->`)return()=>{throw zb(e.operator===`~>`?`a ~> b`:`a -+-> formula`,e)};let r=M(e)?void 0:Ux(e.operator,t);if(r?.kind===`Closure`)return OS(r,n,t);if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=xS(n[0],t),i=Gb(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=!hp.has(e)&&!Vh(n[0],t),a=t.tlcEvalValues;return t=>{if(!i||!kS(t.scope))return r.evaluate(TS(n,t),t);let o=a.get(e);if(o!==void 0)return o;let s=r.evaluate(TS(n,t),void 0);return a.set(e,s),s}}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&r.evaluateBinary&&n.length===2){let i=xS(n[0],t),a=xS(n[1],t),o=Kb(e,r.evaluateBinary),s=t.coverage;return s?e=>{let t=i(e),n=a(e);if(typeof t!=`object`||t.kind!==`Set`||!s.values.has(t))return o(t,n);let r=t.elements.findIndex(e=>!Yi(e,n));return Xo(s,t,(r===-1?t.elements.length:r)+1),r===-1}:e=>o(i(e),a(e))}let i=t.coverage,a=r?.kind===`Builtin`?r.evaluateBinary:void 0;if(i&&a&&AS.has(e.operator)&&n.length===2){let r=xS(n[0],t),o=xS(n[1],t);return t=>{let n=r(t),s=o(t);return Zo(i,e.operator,n,s,a(n,s))}}if(r?.kind===`Builtin`)return ES(r,n,t);if(e.operator===`\\cdot`&&n.length===2)return()=>{throw new w(t.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let o=n.map(e=>tS(e,t));return r=>{let i=Gx(e.operator,r);if(i)return rS(i,n,r,o);throw t.definitions.get(e.operator)?.kind===`Function`?new w(`${e.operator} is a function; apply it with brackets`):new w(`Unknown operator ${e.operator} at ${Lb(e)}`)}},MS=(e,t)=>{let n=e.kind===`Forall`,r=xS(e.body,t),i=e.bounds[0],a=t.coverage;if(a)return t=>xx(e.bounds,t,a,i=>sx(r(nx(t,i)),e)!==n)?!n:n;if(e.bounds.length===1&&i.pattern.kind===`Name`){let a=i.pattern.name,o=xS(i.set,t);return s=>gx(mx(o(s),i.set,t.runtime.version),t=>sx(r(nx(s,Qb(s.scope,a,t))),e)!==n)?!n:n}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let i=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``);return a=>{let s=_x(o,e=>mx(xS(e,t)(a),e,t.runtime.version)),c=(t,o)=>t<0?sx(r(nx(a,o)),e)!==n:gx(s[t],e=>c(t-1,Qb(o,i[t],e)));return c(o.length-1,a.scope)?!n:n}}return t=>bx(o,t,i=>sx(r(nx(t,i)),e)!==n)?!n:n},NS=(e,t)=>{if(e.kind===`Tuple`)return pi(e.names.map(e=>{let n=Zb(t,e);return n?.kind===`Value`&&n.value}));let n=Zb(t,e.name);return n?.kind===`Value`?n.value:void 0},PS=/* @__PURE__ */ new WeakSet,FS=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&PS.add(e)},IS=/* @__PURE__ */ new WeakMap,LS=e=>{if(IS.has(e))return IS.get(e);let t=/* @__PURE__ */ new Set,n=e=>{if(e.kind===`Subexpression`)return!1;let r=ht(e);return r!==void 0&&t.add(r),e.kind===`ExceptAt`&&t.add(`@`),mt(e).every(n)},r=n(e)?[...t]:void 0;return IS.set(e,r),r},RS=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=Zb(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),zS=e=>PS.has(e),BS=(e,t)=>{let n=zS(e),r=xS(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=e=>r(nx(t,Qb(t.scope,n,e)));if(ln(e))return zi(e),un(e,i),f(e,t);let o=di(e),s=sr(o,o.map(i));return fn(e)?s:(s.lambdaDomain=e,dr(s))}let n=[],s=_x(i,(n,r)=>hx(i.length>1&&typeof e==`object`&&e.kind===`ProductSet`?e.factors[r]:e,n,t.environment.runtime.version));return yx(i,s,t.scope,e=>{let o=i.length===1?NS(a.pattern,e)??!1:pi(i.map(t=>NS(t.pattern,e)??!1));return n.push([o,r(nx(t,e))]),!1}),ni(n)},c=Ox(i,e.body),l=jx(i),u=LS(e.body),d=t.coverage,f=(n,a)=>{let o=RS(a.scope,u),s=nx(a,o),f=e=>r(nx(s,Cx(i,o,e))),p=d&&!t.callStack?d.current:-1,m=Tx({value:Ax(n,d?e=>d.current===-1?f(e):Yo(d,p,()=>f(e)):f,kx(c,i,n),l),bounds:i,body:e.body,scope:o});return i.length===1?dr(m):m},p=t.callStack;return{build:(t,r)=>{if(e.isRecursive||n||r.isKeepLazy||!P(t))return f(t,r);if(!(i.length===1?fn(t):typeof t==`object`&&t.kind===`ProductSet`&&t.factors.every(fn))){if(p)return f(t,r);try{return s(t,r)}catch(e){if(!(e instanceof w))throw e;return f(t,r)}}if(!p)return s(t,r);try{return s(t,r)}catch(t){throw gS(p,e,t),t}},createLazy:f}},VS=(e,t)=>{let n=BS(e,t).build,r=e.bounds,i=t.coverage;if(i)return t=>{let a=Sx(r,t),o=n(a,t),s=r.length===1||typeof a!=`object`||a.kind!==`ProductSet`?[a]:a.factors;return(typeof o!=`object`||o.kind!==`LazyFunction`)&&s.every(fn)&&i.current!==-1&&i.covered.has(e)&&os(i,i.current,s),o};if(r.length===1&&r[0].pattern.kind===`Name`){let e=xS(r[0].set,t);return t=>n(e(t),t)}return e=>n(Sx(r,e),e)},HS=(e,t)=>{let n=PS.has(e);n&&FS(e.function);let r=xS(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>xS(e,t))}),value:xS(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):pi(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(nx(i,Qb(i.scope,`@`,e))):_a(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i=!1;n=o(n,r.path,0,t,e=>(i=!0,r.value(e))),i||t.environment.runtime.warn(wt.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${Q(e.function)}`)}return n}},US=(e,t)=>{let n=xS(e.predicate,t),r=e.bound.pattern,i=Bb(e.predicate),a=e.predicate.location.range&&{names:r.kind===`Name`?r.name:r.names.join(`, `),predicate:i},o=t.coverage,s=(t,n,c,l)=>{let u=(e,t)=>{if(r.kind===`Tuple`&&Wi(e)?.length!==r.names.length)throw new w(`Attempted to check if the value:\n${N(L(e))}\nis an element of a set of ${r.names.length}-tuples.`);let a=c(nx(n,$b(n.scope,r,e)));if(typeof a!=`boolean`)throw new w(`${t?`The evaluation of predicate`:`Evaluating predicate`} ${i} yielded non-Boolean value.`);return a},d=r=>s(t,{...n,environment:r},xS(e.predicate,r),-1);return!o||l===-1?{kind:`FilteredSet`,base:t,test:u,source:a,rebind:d}:{kind:`FilteredSet`,base:t,test:(e,t)=>Yo(o,t?-1:l,()=>u(e,t)),startPass:e=>{let n=es(o,t);return r=>{n?.next(),ns(o,t,r),o.secondary[l]++;let i=Yo(o,l,()=>u(r,!1));return e&&i&&o.secondary[l]++,i}},source:a,rebind:d}};return(e,t,r=-1)=>s(e,t,n,r)},WS=e=>M(e)||e.kind===`OperatorReference`||mt(e).some(WS),GS=(e,t)=>e.bound.pattern.kind===`Name`&&!t.coverage&&!WS(e.predicate)&&!Fh([e.predicate],t,`varying`),KS=(e,t)=>{if(typeof e!=`boolean`)throw new w(`Attempted to evaluate an expression of form {x \\in S : P(x)} when P was ${Bs(e)}.\n${Bb(t.predicate)}`);return e},qS=(e,t,n,r)=>{if(!dn(e)||qn(e))throw new w(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${Q(t)}`);return Kr(e),hx(e,n,r)},JS=e=>new w(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${Q(e)}`),YS=(e,t)=>{if(e.kind===`SetFilter`){let n=xS(e.predicate,t),r=xS(e.bound.set,t),i=US(e,t),a=e.bound.pattern,o=t.coverage,s=GS(e,t);return t=>{let c=r(t);if(!fn(c))return i(c,t,o?.current);let l=[],u=c.kind===`Interval`?c:F(c).elements,d=Array.isArray(u)?u.length:u.high-u.low+1;for(let r=0;r<d;r++){let i=Array.isArray(u)?u[r]:u.low+r,o=n(nx(t,$b(t.scope,a,i)));if(KS(o,e))cn(l,i);else if(s)break}return o&&Xo(o,c,d+1),or(l)}}if(e.kind===`SetMap`){let n=xS(e.expression,t),r=t.coverage;return t=>{let i=[],a=e=>(cn(i,n(nx(t,e))),!1);return r?xx(e.bounds,t,r,a):bx(e.bounds,t,a),Zr(i)}}let n=e.set;if(!n)return()=>{throw new w(`TLC attempted to evaluate an unbounded CHOOSE.\nMake sure that the expression is of form CHOOSE x \\in S: P(x).\n${Q(e)}`)};let r=xS(e.body,t),i=xS(n,t),a=t.coverage;return t=>{let o=i(t),s=qS(o,e,n,t.environment.runtime.version),c=a&&rs(a,o,s,!0),l,u=e.pattern;if(gx(s,n=>{if(c?.next(),u.kind===`Tuple`&&Wi(n)?.length!==u.names.length)throw new w(`Attempted to compute the value of an expression of form\nCHOOSE <<x1, ... , xN>> \\in S: P, but S was not a set\nof N-tuples.\n${Q(e)}`);let i=$b(t.scope,u,n);return sx(r(nx(t,i)),e)?(l=NS(u,i),!0):!1}),l!==void 0)return l;throw c?.next(),JS(e)}},XS=e=>[...e].sort((e,t)=>er(e.name,t.name)),ZS=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),QS=(e,t)=>{let n=XS(e),r=e.map(e=>xS(e.value,t));if(ZS(n))return t=>mi(e.map((e,n)=>[e.name,r[n](t)]));let i=n.map(e=>e.name),a=e.map(e=>e.name);if(a.some((e,t)=>e!==i[t])){let t=n.map(t=>e.indexOf(t));return e=>Cn(i,t,r.map(t=>t(e)),a)}return e=>hi(i,r.map(t=>t(e)))},$S=(e,t)=>{let n=e=>xS(e,t);switch(e.kind){case`Number`:{let t=e.value;return _n(t)?()=>t:()=>{throw Jb(e)}}case`Decimal`:return()=>{throw qb(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return CS(e,t);case`Apply`:return jS(e,t);case`Bracket`:return()=>{throw new w(`A bracket without a function or subscript is not an expression at ${Lb(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new w(`An operator cannot be used as a value at ${Lb(e)}`)};case`And`:{let r=e.operands.map(n);return vS(e,r,t.callStack)??(t=>{for(let n=0;n<r.length;n++){let i=r[n](t);if(typeof i!=`boolean`)throw Hb(e,n,i);if(!i)return!1}return!0})}case`Or`:{let r=e.operands.map(n);return vS(e,r,t.callStack)??(t=>{for(let n=0;n<r.length;n++){let i=r[n](t);if(typeof i!=`boolean`)throw Hb(e,n,i);if(i)return!0}return!1})}case`Prime`:{let t=n(e.expression);return e=>t(fS(e))}case`Unchanged`:return pS(n(e.expression));case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw Vb(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({source:e.condition,condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t){let t=e.condition(n);if(typeof t!=`boolean`)throw new w(`A non-boolean expression (${Bs(t)}) was used as a condition of a CASE. ${Bb(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new w(`Attempted to evaluate a CASE with no conditions true.\n${Q(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(nx(n,oS(e.definitions,n)))}case`Forall`:case`Exists`:return MS(e,t);case`UnboundedQuantifier`:return()=>{let t=e.quantifier===`Forall`?`\\A`:`\\E`;throw e.isTemporal?zb(e.quantifier===`Forall`?`\\AA`:`\\EE`,e):new w(`TLC attempted to evaluate an unbounded ${t}.\nMake sure that the expression is of form ${t} x \\in S: P(x).\n${Q(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return YS(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Zr(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>pi(t.map(t=>t(e)))}case`FunctionConstruction`:return VS(e,t);case`FunctionSet`:{let t=n(e.domain),r=n(e.range);return e=>({kind:`FunctionSet`,domain:t(e),range:r(e)})}case`Record`:return QS(e.fields,t);case`RecordSet`:{let t=XS(e.fields),r=t.map(e=>e.name),i=t.map(t=>e.fields.indexOf(t)),a=e.fields.map(e=>n(e.value));return i.every((e,t)=>e===t)?e=>({kind:`RecordSet`,names:r,sets:a.map(t=>t(e))}):e=>{let t=a.map(t=>t(e));return{kind:`RecordSet`,names:r,sets:i.map(e=>t[e])}}}case`Except`:return HS(e,t);case`ExceptAt`:return t=>{let n=Zb(t.scope,`@`);if(n?.kind!==`Value`)throw new w(`@ appears outside an EXCEPT at ${Lb(e)}`);return n.value};case`FunctionApplication`:{FS(e.function);let r=n(e.function),i=t=>ex(r(tx(t)),e),a=e.args.map(n),o=Wb(t.runtime.version);if(a.length===1){let e=a[0];return t=>ma(i(t),e(t),o)}return e=>ma(i(e),pi(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=Ub(e);return e=>r(t(e))}case`Product`:{let t=e.factors.map(n);return e=>({kind:`ProductSet`,factors:t.map(t=>t(e))})}case`BoxAction`:case`AngleAction`:{let t=n(e.action),r=pS(n(e.subscript)),i=e.kind===`BoxAction`,a=i?`[A]_e`:`<A>_e`;return n=>{let o=t(n);if(typeof o!=`boolean`)throw new w(`Attempted to evaluate an expression of form ${a}, but A was not a boolean.\n${Q(e)}`);return i?o||r(n):o&&!r(n)}}case`Enabled`:{let t=e.expression;return e=>Eb(t,e)}case`Label`:return n(e.body);case`Selection`:return n(e.expression);case`Subexpression`:return()=>{throw new w(`The subexpression reference at ${Lb(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw zb(Rb[e.kind],e)}}},eC=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},tC=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Oa(e[t]),16777619),r=Math.imul(r^Pa(e[t]),1540483477);t[0]=eC(n)||1,t[1]=eC(r)},nC=()=>{let e=/* @__PURE__ */ new Int32Array(8192),t=0,n=(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}},r=()=>{let t=e,r=new Int32Array(t.length*2);for(let e=0;e<t.length;e+=2){if(t[e]===0)continue;let i=n(r,t[e],t[e+1]);r[i*2]=t[e],r[i*2+1]=t[e+1]}e=r};return{insert:(i,a)=>{t*4>=e.length&&r();let o=n(e,i,a);return e[o*2]!==i&&(e[o*2]=i,e[o*2+1]=a,t++,!0)}}},rC=e=>({slots:new Int32Array(1<<17),size:0,shift:16,states:e}),iC=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=ya(t,Oa(e[n]));return t&1073741823},aC=(e,t)=>{for(let n=0;n<t.length;n++)if(!br(e[n],t[n]))return!1;return!0},oC=(e,t)=>Math.imul(t,2654435761)>>>e.shift<<1,sC=(e,t,n)=>{let r=e.slots.length-1;for(let i=oC(e,t);;i=i+2&r){let r=e.slots[i+1];if(r===0)return-1;if(e.slots[i]===t&&aC(e.states[r-1],n))return r-1}},cC=(e,t,n)=>{let r=e.slots.length-1,i=oC(e,t);for(;e.slots[i+1]!==0;)i=i+2&r;e.slots[i]=t,e.slots[i+1]=n},lC=(e,t,n)=>{if(e.size++,e.size*4>e.slots.length){let t=e.slots;e.slots=new Int32Array(t.length*2),e.shift--;for(let n=0;n<t.length;n+=2)t[n+1]!==0&&cC(e,t[n],t[n+1])}cC(e,t,n+1)},uC=(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}},dC=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),fC=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return uC(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},pC=e=>Atomics.load(e.used,0)*2>=e.slots.length,mC=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&uC(t,n);return{slots:t,used:e.used}},hC={kind:`Boolean`,value:!0},gC={kind:`Boolean`,value:!1},_C=e=>e?hC:gC,vC=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,yC=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,bC=(e,t)=>({kind:e,body:t}),xC=(e,t,n)=>({kind:e,operands:[t,n]}),SC=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?SC(e,t.operands).operands:[t])}),CC=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return CC(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,CC(t)),0)}},wC=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 wC(e.body);case`And`:case`Or`:return e.operands.some(wC)}},TC=/* @__PURE__ */ new WeakMap;let EC=0;const DC=e=>{let t=TC.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`#${EC++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(DC).join(`,`)})`;default:return`${e.kind}(${DC(e.body)})`}})();return TC.set(e,n),n},OC=(e,t)=>e===t||DC(e)===DC(t),kC=(e,t)=>{let n=DC(t);return e.some(e=>e===t||DC(e)===n)},AC=e=>e===`And`?`Or`:`And`,jC=(e,t)=>{switch(e.kind){case`Boolean`:return t?_C(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?bC(`Not`,e):e;case`Not`:return jC(e.body,!t);case`And`:case`Or`:return SC(t?AC(e.kind):e.kind,e.operands.map(e=>jC(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return bC(n,jC(e.body,t))}}},MC=e=>{switch(e.kind){case`Boolean`:return _C(!e.value);case`Not`:return e.body;case`And`:case`Or`:return SC(AC(e.kind),e.operands.map(MC));case`Always`:return bC(`Eventually`,MC(e.body));case`Eventually`:return bC(`Always`,MC(e.body));default:return bC(`Not`,e)}},NC=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=NC(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return _C(t)}return n.length===0?_C(!t):n.length===1?n[0]:SC(e.kind,n)}case`Not`:{let t=NC(e.body);return t.kind===`Boolean`?_C(!t.value):bC(`Not`,t)}case`Always`:case`Eventually`:{let t=NC(e.body);return bC(e.kind,t.kind===e.kind?t.body:t)}default:return e}},PC=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,FC=e=>{switch(e.kind){case`And`:{let t=[],n=1;for(let r of e.operands){let e=FC(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n*=e.operands.length,n>2147483647))throw new w(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n===1)return{kind:`And`,operands:t};let r=Array.from({length:n},()=>[]),i=1,a=n;for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}a/=e.operands.length;let t=0;for(let n=0;n<i;n++)for(let n of e.operands)for(let e=0;e<a;e++)r[t++].push(n);i*=e.operands.length}return{kind:`Or`,operands:r.map(e=>SC(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=FC(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=PC(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:SC(`Or`,t);n.push(bC(`Always`,bC(`Eventually`,e)))}return SC(`Or`,n)}case`Not`:return vC(e.body)?e:FC(MC(e.body));default:return e}},IC=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?IC(e.operands[0]):SC(e.kind,e.operands.map(IC));case`Not`:return e.body.kind===`Not`?IC(e.body.body):bC(`Not`,IC(e.body));case`Always`:case`Eventually`:case`Next`:return bC(e.kind,IC(e.body));default:return e}},LC=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return LC(e.operands[0]);let t=Math.floor(e.operands.length/2);return xC(e.kind,LC(SC(e.kind,e.operands.slice(0,t))),LC(SC(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return bC(e.kind,LC(e.body));default:return e}},RC=(e,t)=>{e.kind===`Eventually`&&!kC(t,e)&&t.push(e),`body`in e&&RC(e.body,t),`operands`in e&&e.operands.forEach(e=>RC(e,t))},zC=e=>{let t=e.filter(yC),n=e.flatMap(e=>e.kind===`Not`&&yC(e.body)?[e.body]:[]);return!t.some(e=>kC(n,e))},BC=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,bC(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new w(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},VC=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:bC(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},HC=(e,t,n)=>e.flatMap(e=>{let r=VC(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),UC=e=>[...new Set(e.map(DC))].sort().join(`|`),WC=(e,t)=>{let n=new Set(t.map(UC));return[...e.filter(e=>!n.has(UC(e))),...t]},GC=e=>{let t=BC(e),n=HC(t,`Always`,`And`),r=HC(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=VC(t,`Eventually`,`Or`);if(n&&!(kC(e,n.first)||kC(e,n.second)))return WC(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(kC(e,t.first)||kC(e,t.second))&&!kC(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!zC(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=VC(t[e],`Always`,`And`);n&&(kC(t,n.first)||t.push(n.first),kC(t,n.second)||t.push(n.second))}let r=!0;for(;r;){r=!1;for(let e of n)kC(t,e.first)&&kC(t,e.second)&&!kC(t,e.whole)&&(t.push(e.whole),r=!0)}return t.length>e.length&&!zC(t)?[]:i(t)};return a(e)},KC=e=>({particle:e,successors:[],statePredicates:e.filter(e=>CC(e)<=1)}),qC=e=>{let t=GC([e]).map(KC),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=UC(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 GC(n)){let n=UC(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(KC(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},JC=(e,t)=>!kC(e,t)||kC(e,t.body),YC=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&CC(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=PC(e);if(n){let e=CC(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(wC(e))throw new w(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},XC=(e,t)=>{let n=e.findIndex(e=>OC(e,t));return n===-1?(e.push(t),e.length-1):n},ZC=e=>{let t=FC(NC(jC(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=IC(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])YC(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:SC(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:OC(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&LC(e.formula),n=[];t&&RC(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>XC(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>XC(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>XC(i,e))}));return{tableau:t&&qC(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},QC=()=>v(new w(`Temporal formula is a tautology (its negation is unsatisfiable).`),b.livenessEvaluationFailure),$C=/* @__PURE__ */ new Set([`~>`,`-+->`]),ew=/* @__PURE__ */ new WeakSet,tw=/* @__PURE__ */ new Map([[`/\\`,`And`],[`\\/`,`Or`]]),nw=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),rw=(e,t)=>new w(`TLC cannot handle the temporal formula ${Q(e)}${t===void 0?``:`:\n${t}`}`),iw=(e,t,n,r=/* @__PURE__ */ new Set,i=/* @__PURE__ */ new Set)=>{let a=(e,t,r)=>{if(i.has(e))return 0;i.add(e);let a=iw(t,r,n,/* @__PURE__ */ new Set,i);return i.delete(e),a},o=e=>{let n=Zb(t,e);if(!n)return;if(n.kind===`Value`)return 0;if(n.kind===`Thunk`)return n.isReleased?0:a(n,n.expression,n.scope);let r=n.operator;return r.kind===`Closure`?a(r,r.body,r.scope):0},s=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=cx(e,n);if(t)return Rh(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isActionLevel?2:r.isStateLevel&&!r.isLevelConstant?1:0},c=(e,t)=>r.has(e)?0:M(t)?o(e)??s(e)??0:s(e)??o(e)??0,l=e=>{let a=0;return wp(e,(e,o)=>(a=Math.max(a,iw(e,t,n,o.length===0?r:/* @__PURE__ */ new Set([...r,...o]),i)),e)),a};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:l(e);case`Identifier`:return c(e.name,e);case`OperatorReference`:return c(e.operator,e);case`Apply`:{if($C.has(e.operator))return 3;if(e.operator===`\\cdot`)return 2;let r=c(e.operator,e),i=Math.max(r,l(e)),o=M(e)?void 0:Ux(e.operator,n);return i===r||o?.kind!==`Closure`||o.params.length!==e.args.length?i:a(o,o.body,nS(o,e.args,nw(n,t)))}default:return l(e)}},aw=(e,t)=>{try{return vx(e,t)}catch(e){if(!(e instanceof w))throw e;if(!Ft(e))return;throw v(new w(`${a}${e.message}`),b.error)}},ow=(e,t,n,r,i={name:void 0,path:[],expanding:/* @__PURE__ */ new Set,isSubstituted:!1})=>{let a=(e,t,a=i.name,o=i.expanding,s)=>ow(e,t,n,r,{name:a,path:s?.kind===`Operator`&&s.params.length===0?[...i.path,s.name]:i.path,expanding:o,isSubstituted:i.isSubstituted||s!==void 0&&n.substitutedDefinitions.has(s)});if(e.kind===`And`)return e.operands.flatMap(e=>a(e,t,Q(e)));if(e.kind===`Label`)return a(e.body,t);if(e.kind===`Selection`)return a(e.expression,t);if(e.kind===`Let`)return a(e.body,sw(e,t,n));if(e.kind===`Identifier`){let r=M(e)?Zb(t,e.name):void 0;if(r?.kind===`Thunk`&&!r.isReleased)return a(r.expression,r.scope,ew.has(r)?e.name:i.name);let o=n.constants.has(e.name)?void 0:cx(e.name,n);if(!r&&o?.kind===`Operator`&&o.params.length===0&&(Rh(o,n)>0||Rx(o,n)===void 0)){if(i.expanding.has(o))throw h();return a(o.body,void 0,!i.isSubstituted&&n.instanceNames.get(e.name)||o.name,/* @__PURE__ */ new Set([...i.expanding,o]),o)}}let o=nw(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||iw(e,t,n)===3)){let t=Wx(e,o),r=M(e)?void 0:cx(e.operator,n),s=t?.kind===`Closure`&&t.params.every(e=>n.instanceParams.has(e));if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&(!i.isSubstituted||s))return a(t.body,nS(t,e.args,o),i.isSubstituted&&r?r.name:e.operator,i.expanding,r)}let s=r&&e.kind===`Forall`&&e.bounds.every(e=>iw(e.set,t,n)===0),c=s?aw(e.bounds,o):void 0;if(s&&c){let n=[];if(yx(e.bounds,c,t,t=>(n.push(...a(e.body,t,Q(e.body))),!1)),n.length===0)throw QC();return n}return[{expression:e,scope:t,name:i.name,path:i.path}]},sw=(e,t,n)=>{let r=oS(e.definitions,nw(n,t),cS(e.definitions,n));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&ew.add(e.binding);return r},cw=(e,t,n)=>{let r=n.runtime.version===`1.7.4`,a=(e,t,i)=>{let a=i===0&&!r?iw(e,t,n):i;if(a===0){let r=$(e,nw(n,t));if(typeof r!=`boolean`)throw new w(`TLC expected a boolean value, but did not find one. ${Bb(e)}`);return _C(r)}return a===1?{kind:`State`,expression:e,scope:t}:e.kind===`AngleAction`?{kind:`Action`,expression:e.action,subscript:e.subscript,scope:t}:{kind:`Action`,expression:e,subscript:void 0,scope:t}},o=0,s=(e,t,r,i)=>{if(o>=100)throw h();o++;let s=p(e,t);o--;let c=CC(s),l=c===0&&iw(r,i,n)>2;return c>2||l?s:a(r,i,c)},c=(e,t)=>{let i=e.kind===`Identifier`?e.name:e.operator,a=nw(n,t),o=M(e)||cx(i,n)===void 0?Zb(t,i):void 0;if(o?.kind===`Thunk`&&!o.isReleased&&ew.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:M(e)?Gx(i,a):Ux(i,n),u=e.kind===`Apply`?e.args:[],f=c?.kind===`Builtin`&&u.length===2?tw.get(c.name):void 0;if(f){let n=u.map(e=>p(e,t));return d(e,t,SC(f,n))}if(c?.kind!==`Closure`)throw rw(e);let m=!M(e)&&cx(i,n)?.isRecursive===!0;return l(e,()=>(r&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>$(e,a)),s(c.body,nS(c,u,a),e,t)),m)},l=(e,t,n=!1)=>{try{return t()}catch(t){let a=t instanceof i||n&&!r;throw!(t instanceof w)||a?t:rw(e)}},u=(e,t)=>{let r=iw(e,t,n),o=[],s=e.kind===`Forall`;try{bx(e.bounds,nw(n,t),t=>(o.push(p(e.body,t)),!1))}catch(n){if(!(n instanceof w)||n instanceof i)throw n;if(r<=2)return a(e,t,r);throw rw(e,s&&!Ft(n)?n.message:void 0)}return o.length===0?_C(s):d(e,t,SC(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=CC(n);return r>2?n:a(e,t,r)},f=(e,t)=>{let n=e.operands,r=e.location.range,i=e.prefixEnds;return e.isBulleted||!r||!i?d(e,t,SC(e.kind,n.map(e=>p(e,t)))):n.slice(1).reduce((a,o,s)=>{let c=s===n.length-2?e:{...e,operands:n.slice(0,s+2),prefixEnds:i.slice(0,s+1),location:{...e.location,range:{...r,end:i[s]}}};return d(c,t,SC(e.kind,[a,p(o,t)]))},p(n[0],t))},p=(e,t)=>{let i=iw(e,t,n);switch(e.kind){case`Label`:return p(e.body,t);case`Selection`:return p(e.expression,t);case`Let`:return p(e.body,sw(e,t,n));case`Apply`:{let n=e.args;if(e.operator===`~`&&!M(e))return d(e,t,bC(`Not`,p(n[0],t)));if(e.operator===`=>`)return d(e,t,xC(`Or`,bC(`Not`,p(n[0],t)),p(n[1],t)));break}case`And`:case`Or`:return f(e,t);case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!r&&iw(e.condition,t,n)===0){let r=$(e.condition,nw(n,t));if(typeof r==`boolean`)return p(r?e.consequent:e.alternative,t)}let i=p(e.condition,t);return d(e,t,xC(`Or`,xC(`And`,i,p(e.consequent,t)),xC(`And`,bC(`Not`,i),p(e.alternative,t))))}}if(i<=2)return a(e,t,i);switch(e.kind){case`Identifier`:return c(e,t);case`Apply`:return e.operator===`~>`?bC(`Always`,xC(`Or`,bC(`Not`,p(e.args[0],t)),bC(`Eventually`,p(e.args[1],t)))):c(e,t);case`Always`:case`Eventually`:return bC(e.kind,p(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n={kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.action.location},r={kind:`Enabled`,step:e.enabled??n,scope:t},i=bC(`Not`,r),a={kind:`Action`,expression:e.action,subscript:e.subscript,scope:t,enabled:r};return e.kind===`WeakFairness`?bC(`Always`,bC(`Eventually`,xC(`Or`,i,a))):xC(`Or`,bC(`Eventually`,bC(`Always`,i)),bC(`Always`,bC(`Eventually`,a)))}default:throw rw(e)}};return p(e,t)},lw=e=>({holdsState:(t,n)=>{let r={environment:e,scope:t.scope,state:n,next:void 0},i=t.kind===`State`?$(t.expression,r):Eb(t.step,r);if(typeof i!=`boolean`)throw new w(`A state predicate was evaluated to a non-boolean value.`);return i},holdsAction:(t,n,r)=>{let i=t.scope,a=t.subscript;if(a&&qr($(a,{environment:e,scope:i,state:n,next:void 0}),$(a,{environment:e,scope:i,state:r,next:void 0})))return!1;let o=$(t.expression,{environment:e,scope:i,state:n,next:r});if(typeof o!=`boolean`)throw new w(`Encountered an action predicate that's not a boolean.`);return o}}),uw=(e,t,n,r,i)=>{let a=e=>uw(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=r.holdsState(e,t);return i.set(e,a),a}case`Action`:return e.enabled&&i.get(e.enabled)===!1?!1:n!==void 0&&r.holdsAction(e,t,n);case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return uw(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new w(`TLC cannot evaluate a temporal formula in a single step`)}},dw=(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)=>dw(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 uw(e,t[r],t[a(r)],lw(i),/* @__PURE__ */ new Map)}},fw=`UnnamedAction`,pw={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},mw=e=>{let t=e.range??pw;return mi([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},hw=(e,t)=>{let n=[[`name`,e.name],[`location`,mw(e.location)]];return e.parameters.length>0&&n.push([`context`,mi(e.parameters)],[`parameters`,pi(e.parameters.map(e=>e[0]))]),t!==void 0&&n.push([`coverage`,t]),mi(n)},gw=(e,t,n)=>({name:e,location:t.location,parameters:[],expression:t,scope:n}),_w=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),vw=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,yw=e=>e.kind===`Apply`?e.args:[],bw=(e,t,n)=>{let r=vw(e);if(r===void 0)return;if(M(e)){let e=Zb(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=Ux(r,n);return i?.kind===`Closure`?i:void 0},xw=(e,t)=>{try{return $(e,_w(t,void 0)),!0}catch(e){if(e instanceof y)return!1;throw e}},Sw=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&Nh(e,t)&&xw(e.body,t),Cw=(e,t)=>e?.kind===`Operator`&&e.body.kind!==`Number`&&e.body.kind!==`String`&&Sw(e,t),ww=(e,t)=>{let n=cx(e.name,t);return n?.body===e.body&&Cw(n,t)},Tw=(e,t)=>{if(e.kind!==`Identifier`||!M(e))return;let n=Zb(t,e.name);return n?.kind===`Thunk`?n:void 0},Ew=(e,t,n)=>{if(e.kind===`Let`)return{expression:e.body,scope:sw(e,t,n)};let r=Tw(e,t);return r&&{expression:r.expression,scope:r.scope}},Dw=(e,t,n,r)=>t.kind===`Apply`?nS(e,t.args,_w(r,n)):e.scope,Ow=(e,t)=>(e?.params??[]).flatMap(e=>{let n=Zb(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),kw=(e,t)=>{try{return e()}catch(e){if(e instanceof y)return t();throw e}},Aw=(e,t,n,r,i)=>{let a=yw(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return r&&a.length===0?[{...e,parameters:[],expression:r.body,scope:r.scope}]:r?a.some(e=>iw(e,n,i)!==0)?o():kw(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),$(e,_w(i,n))]),expression:t,scope:n}],o):[{...e,parameters:[],expression:t,scope:n}]},jw=(e,t,n,r,i)=>{let a=()=>({name:n?.name??fw,location:e.location,parameters:Ow(n,t),expression:e,scope:t});if(hy.has(e.kind))throw v(new w(`${l}The next state relation is not a boolean expression.\n${Bb(e)}`),b.error);switch(e.kind){case`Let`:return jw(e.body,sw(e,t,r),n,r,i);case`Label`:return jw(e.body,t,n,r,i);case`Selection`:return jw(e.expression,t,n,r,i);case`Or`:return e.operands.flatMap(e=>jw(e,t,n,r,i));case`Exists`:return kw(()=>{let o=[];return bx(e.bounds,_w(r,t),t=>(o.push(...jw(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=M(e)?void 0:i.get(vw(e)??``),s=bw(e,t,r);if(o)return Aw(o,e,t,s,r);if(!s)return[a()];let c=yw(e),u=M(e)?s.name:r.instanceNames.get(vw(e)??``)??s.name,d=()=>[{name:u,location:e.location,parameters:[],expression:e,scope:t}];return ww(s,r)||c.some(e=>iw(e,t,r)!==0)?d():kw(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:$(n,_w(r,t))},parent:e}),s.scope);return jw(s.body,e,{...s,name:u},r,i)},d)},Mw=(e,t,n,r,i,a=[])=>{let o=(e,t,o=a)=>Mw(e,t,n,r,i,o),s=(e,t,n)=>gw(e,_p(t,a),n),c=Ew(e,t,n);if(c){o(c.expression,c.scope);return}let l=bw(e,t,n);if(l&&ww(l,n))return;let u=l?[...a,...gp.get(l.body)??[]]:a;if(l&&l.params.length===0){if(iw(l.body,l.scope,n)===1){r.inits.push(s(l.name,l.body,l.scope));return}o(l.body,l.scope,u);return}if(l&&e.kind===`Apply`&&l.params.length===e.args.length){o(l.body,nS(l,e.args,_w(n,t)),u);return}if(e.kind===`And`){e.operands.forEach(e=>o(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t,frames:a});return}r.temporals.push(s(fw,e,t));return}let d=iw(e,t,n);d<=1?r.inits.push(s(fw,e,t)):d===3&&r.temporals.push(s(fw,e,t))},Nw=(e,t,n,r,i)=>{let a=(t,n)=>Nw(e,t,n,r,i),o=Ew(t,n,r);if(o){a(o.expression,o.scope);return}let s=bw(t,n,r);if(s&&ww(s,r))return;if(s&&s.params.length===yw(t).length){a(s.body,Dw(s,t,n,r));return}if(t.kind===`Forall`&&kw(()=>(bx(t.bounds,_w(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(gw(e,a)):iw(a,n,r)<2?i.invariants.push(gw(e,a)):i.impliedTemporals.push(gw(e,t));return}let c=iw(t,n,r);c<=1?i.impliedInits.push(gw(e,t)):c===3&&i.impliedTemporals.push(gw(e,t))},Pw=(e,t)=>{let n=cx(e,t);return n?.kind===`Operator`&&!Cw(n,t)?n:void 0},Fw=(e,t,n)=>{let r={inits:[],actions:[],temporals:[]},i=[],a=e.specification===void 0?void 0:Pw(e.specification,t);a&&(Mw(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...e.frames.length>0?[{name:fw,location:e.frames[0].location,parameters:[],expression:_p(e.expression,e.frames),scope:e.scope}]:jw(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:Ux(e.init,t);o?.kind===`Closure`&&r.inits.push(gw(e.init??``,o.body));let s=e.next===void 0?void 0:Ux(e.next,t);return s?.kind===`Closure`&&r.actions.push(...jw(s.body,s.scope,s,t,n)),r},Iw=(e,t,n)=>{let r=[],i=(e,t)=>{if(e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`)return!1;if(e.kind===`Tuple`)return e.elements.every(e=>i(e,t));if(e.kind===`Label`)return i(e.body,t);if(e.kind===`Selection`)return i(e.expression,t);let a=Ew(e,t,n);if(a)return i(a.expression,a.scope);let o=e.kind===`Identifier`&&M(e)?Zb(t,e.name):void 0;if(o?.kind===`Value`&&o.argument)return i(o.argument,t);if(e.kind===`Identifier`&&!M(e)&&n.variableIndex.has(e.name))return r.push(e.name),!0;let s=bw(e,t,n);if(!s||s.params.length!==yw(e).length)return!0;let c=cx(s.name,n);return c?.body===s.body&&Sw(c,n)?!0:i(s.body,Dw(s,e,t,n))};return i(e,t)?r:void 0},Lw=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>L(e[1])).join(`,`)})`,Rw=(e,t,n=!1)=>`${e.name===fw?n?`Initial predicate`:`Action`:e.name}${t===`1.7.4`?``:Lw(e)} ${m(e.location.range??pw)}`,zw=e=>`${e.name}${Lw(e)}`,Bw=(e,t,n,r)=>{let i={invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]};t.invariants.forEach(e=>{let t=Pw(e,n);t&&i.invariants.push(gw(e,t.body))}),t.properties.forEach(e=>{let t=Pw(e,n);t&&Nw(e,t.body,void 0,n,i)});let a=n.coverage,o=(e,t)=>Xr(e.map(e=>{let n=a&&t&&xs(a,t,e.expression);return hw(e,n&&mi(n))})),s=e=>Xr(e.flatMap(e=>{let t=Pw(e,n);return t?[mi([[`name`,t.name],[`location`,mw(t.location)]])]:[]}));return mi([[`inits`,o(e.inits,`init`)],[`actions`,o(e.actions,`next`)],[`temporals`,o(e.temporals)],[`invariants`,o(i.invariants,`invariant`)],[`impliedinits`,o(i.impliedInits,`implied`)],[`impliedactions`,o(i.impliedActions,`implied`)],[`impliedtemporals`,o(i.impliedTemporals)],[`variables`,Xr(n.variables.map((e,t)=>mi([[`name`,e],[`location`,mw(r[t])],...a?[[`coverage`,mi([[`distinct`,ls(a,t)]])]]:[]])))],[`actionconstraints`,s(t.actionConstraints)],[`constraints`,s(t.constraints)]])},Vw=2**50,Hw=2**51,Uw=(e,t,n,r)=>({fingerprint:e,tableau:t,position:n,stateChecks:r,successors:[],actionChecks:[],stepPositions:[],number:0}),Ww=(e,t,n,r)=>{e.successors.push(t),e.actionChecks.push(n),e.stepPositions.push(r)},Gw=(e,t)=>e.stepPositions[e.successors.indexOf(t)],Kw=e=>{let t=e[e.length-1];return--e.length,t},qw=(e,t,n,r)=>{let i={initial:[],isPartial:!1},a=t.tableau;if(!a){let t=/* @__PURE__ */ new Map,r=Uw(e[0],-1,0,n.getStates(0));Ww(r,r,n.getStutters(0),0),t.set(e[0],r),i.initial.push(r);for(let i=1;i<e.length;i++){let a=t.get(e[i]);if(a===void 0){let a=Uw(e[i],-1,i,n.getStates(i));Ww(a,a,n.getStutters(i),i),Ww(r,a,n.getSteps(i),i),t.set(e[i],a),r=a}else r.successors.includes(a)||Ww(r,a,n.getSteps(i),i),r=a}return i}let o=/* @__PURE__ */ new Map,s=e=>{let t=o.get(e)??[];return o.set(e,t),t},c=(t,o,s,c,l,u)=>{for(let d=0;d<t.length;d++){let f=t[d],p=a.nodes[f.tableau].successors;for(let t=0;t<p.length;t++){let a=p[t],d=s[a];if(d===void 0){if(!n.isConsistent(a,c))continue;let t=Uw(e[c],a,c,l);Ww(f,t,u,c),o.push(t),s[a]=t}else f.successors.includes(d)||Ww(f,d,u,c),d.position!==c&&(i.isPartial=!0,r&&!o.includes(d)&&o.push(d))}}},l=s(e[0]),u=n.getStates(0),d=n.getStutters(0);for(let t=0;t<a.initialCount;t++){if(!n.isConsistent(t,0))continue;let r=Uw(e[0],t,0,u);i.initial.push(r),l[t]=r}for(let e of i.initial)for(let t of a.nodes[e.tableau].successors){let n=l[t];n?Ww(e,n,d,0):i.isPartial=!0}let f=[...i.initial];r&&c(f,f,l,0,u,d);for(let t=1;t<e.length;t++){let r=s(e[t]),i=n.getStates(t),a=[];c(f,a,r,t,i,n.getSteps(t)),c(a,a,r,t,i,n.getStutters(t)),f=a}return i},Jw=(e,t,n)=>{let r=t.promises,i=t.tableau?.nodes??[],a=[],o=1,s=Vw+1,c=Hw+1,l=s,u=c,d=s,f=c,p=t.models[0],m,h=(e,t)=>{let n=e.actionChecks[t],r=p.eventuallyAlways;for(let e=0;e<r.length;e++)if(!n[r[e]])return!1;return!0},g=t=>{let n=[],a=c-1,o=p.infinitelyOftenStates,s=p.infinitelyOftenActions,l=o.map(()=>!1),u=s.map(()=>!1),d=r.map(()=>!1),f=o.length+s.length+r.length,m=t;for(;f>0;){m.number=c;let e=f;search:for(;;){for(let e=0;e<o.length;e++)!l[e]&&m.stateChecks[o[e]]&&(l[e]=!0,f--);for(let e=0;e<r.length;e++)!d[e]&&JC(i[m.tableau].particle,r[e])&&(d[e]=!0,f--);if(f<=0)break;let t,p,h=f;for(let e=0;e<m.successors.length;e++){let r=m.successors[e],i=r.number;if(a<=i&&i<=c){t=r;for(let t=0;t<s.length;t++)!u[t]&&m.actionChecks[e][s[t]]&&(u[t]=!0,f--)}if(f<h){n.push(m),m=r,c++;break search}a<=i&&i<c&&(p=r)}if(f<e&&t){n.push(m),m=t,c++;break}for(;p===void 0;){m=Kw(n);for(let e=0;e<m.successors.length;e++){let t=m.successors[e];if(a<=t.number&&t.number<c){n.push(m),p=t;break}}}n.push(m),m=p,m.number=c}}c++,m.number=c;close:for(;m!==t;){let e=!1;for(let r=0;r<m.successors.length;r++){let i=m.successors[r];if(a<=i.number&&i.number<c){if(n.push(m),i===t)break close;e=!0,m=i,m.number=c;break}}e||(m=Kw(n))}n.length===0&&n.push(m);let h=[];for(let n=0;n<=t.position;n++)(n===0||e[n]!==e[n-1])&&h.push(n);let g=h.length;for(let e=1;e<n.length;e++)n[e].fingerprint!==n[e-1].fingerprint&&h.push(Gw(n[e-1],n[e]));let _=n[n.length-1];return{positions:h,cyclePosition:g,backPosition:_.fingerprint===t.fingerprint?void 0:Gw(_,t)}},_=e=>{let t=p.infinitelyOftenStates,n=p.infinitelyOftenActions,a=t.map(()=>!1),o=n.map(()=>!1),s=r.map(()=>!1),l=[e];for(e.number++;l.length>0;){let e=Kw(l);for(let n=0;n<t.length;n++)a[n]||(a[n]=e.stateChecks[t[n]]);for(let t=0;t<e.successors.length;t++){let r=e.successors[t],i=r.number;if(i>=c)for(let r=0;r<n.length;r++)o[r]||(o[r]=e.actionChecks[t][n[r]]);i===c&&(r.number++,l.push(r))}for(let t=0;t<r.length;t++)JC(i[e.tableau].particle,r[t])&&(s[t]=!0)}c+=2,m!==void 0||a.includes(!1)||o.includes(!1)||s.includes(!1)||(m=g(e))},v=e=>{let t=e.successors.indexOf(e);return t!==-1&&d<=e.number&&h(e,t)},y=e=>{let t=Kw(a);if(t===e&&!v(e))return e.number=c++,!1;for(t.number=c;t!==e;)t=Kw(a),t.number=c;return!0},ee=e=>{let t=s++;e.number=t,a.push(e);for(let n=0;n<e.successors.length;n++){let r=e.successors[n],i=r.number;d<=i&&h(e,n)&&((i<l||f<=i&&i<u)&&(i=ee(r)),i<t&&(t=i))}return t===e.number&&y(e)&&_(e),t},b=e=>{let t=Kw(a);if(t===e&&!e.successors.includes(e)){e.number=Vw;return}let n=[];for(d=s++,f=c,t.number=d,n.push(t);t!==e;)t=Kw(a),t.number=d,n.push(t);return n},x=e=>{let n=b(e);if(n)for(let e of t.models){p=e,l=s,u=c;for(let e=n.length-1;e>=0;e--)n[e].number<u&&ee(n[e])}},te=e=>{let t=o++;e.number=t,a.push(e);for(let n=0;n<e.successors.length;n++){let r=e.successors[n],i=r.number===0?te(r):r.number;i<t&&(t=i)}return t===e.number&&x(e),t};for(let e of n)if(e.number===0&&te(e),m)return m},Yw=(e,t,n,r,i)=>{let a=/* @__PURE__ */ new Map,o=(t,n,i)=>(a.clear(),uw(t,e[n],i===void 0?void 0:e[i],r,a)),s=e.map((e,t)=>t),c=e.map((e,t)=>t);if(i){let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map;for(let i=0;i<e.length;i++){let a=n.get(t[i])??i;if(n.set(t[i],a),aC(e[a],e[i])&&(s[i]=a),i===0)continue;let o=s[i-1]*e.length+s[i];c[i]=r.get(o)??i,r.set(o,c[i])}}let l=n.map(e=>{let t=[],n=[],r=[],a=[],l=e.tableau?.nodes.map(e=>e.statePredicates)??[];return{getStates:n=>{let r=s[n];return t[r]??=e.stateChecks.map(e=>o(e,r,void 0))},getSteps:t=>{let r=c[t];return n[r]??=e.actionChecks.map(e=>o(e,r-1,r))},getStutters:t=>{let n=s[t];return r[n]??=e.actionChecks.map(e=>o(e,n,n))},isConsistent:(e,t)=>{let n=s[t],r=a[n]??=[],c=i?r[e]:void 0;return c===void 0?(r[e]=l[e].every(e=>o(e,n,void 0)),r[e]):c}}}),u=[];for(let e=0;e<n.length;e++){let r=qw(t,n[e],l[e],!1),i=Jw(t,n[e],r.initial);if(i)return i;r.isPartial&&u.push(e)}for(let e of u){let r=qw(t,n[e],l[e],!0),i=Jw(t,n[e],r.initial);if(i)return i}},Xw=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return Xw(e.body);case`And`:case`Or`:return e.operands.some(Xw);default:return!1}},Zw=e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0,Qw=e=>e.promises.some(e=>Xw(e.body))||e.models.some(e=>!Zw(e)),$w=(e,t)=>e.every((e,n)=>br(e,t[n])),eT=e=>e.filter((t,n)=>n===0||e[n-1]!==t),tT=e=>({data:e(1024),length:0,create:e}),nT=(e,t,n,r=0,i=n.length-r)=>{let a=t+i;if(a>e.data.length){let t=e.create(Math.max(2*e.data.length,a));t.set(e.data),e.data=t}for(let a=0;a<i;a++)e.data[t+a]=n[r+a];e.length=Math.max(e.length,a)},rT=(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}},iT=e=>new Int32Array(e).fill(-1),aT=(e,t)=>(e.edgeStarts[t]??-1)!==-1,oT=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},sT=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,cT=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.edgeStarts.push(-1),e.edgeCounts.push(0),e.nextSiblings.push(-1),e.nodeStates.length-1),lT=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},uT=2**53-1,dT=(e,t,n)=>{let r=t.map(e=>cw(e.expression,e.scope,n)),i=e.map(e=>cw(e.expression,e.scope,n)),a=i.map(e=>bC(`Not`,e)),o=a.length===1?a[0]:SC(`Or`,a);return{formula:r.length===0?o:SC(`And`,[...r,o]),checks:i}},fT=e=>{switch(e.kind){case`State`:return[e];case`Enabled`:return[{expression:e.step,scope:e.scope}];case`Action`:return[e.expression,e.subscript].flatMap(t=>t?[{expression:t,scope:e.scope}]:[])}},pT=(e,t)=>{switch(e.kind){case`Boolean`:return;case`State`:case`Enabled`:case`Action`:t.add(e);return;case`And`:case`Or`:e.operands.forEach(e=>pT(e,t));return;default:pT(e.body,t)}},mT=e=>{let t=/* @__PURE__ */ new Set;for(let n of e)[...n.stateChecks,...n.actionChecks,...n.tableau?.nodes.flatMap(e=>e.statePredicates)??[]].forEach(e=>pT(e,t));return[...t]},hT=e=>mT(e).flatMap(e=>fT(e).map(e=>e.expression)),gT=(e,t)=>{let n=/* @__PURE__ */ new Set;pT(e,n);let r=[...n].flatMap(fT);return r.every(e=>e.scope===void 0)?!Fh(r.map(e=>e.expression),t,`repeated`):!uS(t)},_T=(e,t,n,r,i,a)=>[...new Set(e.filter((e,o)=>{try{return!dw(t[o],n,r,0,i)}catch(e){if(!a||!(e instanceof w))throw e;return a.push(e),!1}}).map(e=>e.name))],vT=(e,t,n)=>{if(e.length===0)return;let r=dT(e,t,n),i=ZC(r.formula),a=lw(n),o=gT(r.formula,n);return{solutions:i,findTraceViolation:(t,s)=>{let c=Yw(t,s,i,a,o);if(!c)return;let l=[],u=_T(e,r.checks,c.positions.map(e=>t[e]),c.cyclePosition-1,n,l);return{...c,properties:u,failures:l}}}},yT=(e,t,n,r)=>{if(e.length===0)return;let i=dT(e,t,n),a=gT(i.formula,n),o=ZC(i.formula),s={atoms:lw(n),replay:void 0},c=bT(o,{atoms:{holdsState:(e,t)=>s.atoms.holdsState(e,t),holdsAction:(e,t,n)=>s.atoms.holdsAction(e,t,n)},isShared:a,isSame:$w,evaluateFrom:(e,t)=>{n.runtime.setLivenessSource(e);try{return t()}finally{n.runtime.setLivenessSource(void 0)}}},{getFingerprint:r.getFingerprint,forEachActionSuccessors:(e,t,n)=>r.forEachActionSuccessors(e,t,n,s.replay)},n.runtime.version!==`1.7.4`),l=(e,t)=>{if(e===void 0)return t();s.atoms=lw(e),s.replay=e;try{return t()}finally{s.atoms=lw(n),s.replay=void 0}};return{branches:c.branches,solutions:o,addInitialState:(e,t,n)=>l(n,()=>c.addInitialState(e,t)),addState:(e,t,n,r)=>l(r,()=>c.addState(e,t,n,r!==void 0)),storeState:c.storeState,getStateCounts:c.getStateCounts,findViolation:c.findViolation,getViolatedProperties:(t,r)=>_T(e,i.checks,t,r,n)}},bT=(e,t,n,r)=>{let i=/* @__PURE__ */ new Map,a=1,o=t.isShared,s=t.atoms,c=t.evaluateFrom,l=/* @__PURE__ */ new Map,u=[],d=e=>{let t=l.get(e)??l.size;return l.set(e,t),u[t]=e,t},f=e=>{if(e.kind===`State`||e.kind===`Enabled`)return[d(e)*2+1];if(e.kind===`Not`){let t=e.body;return t.kind===`State`||t.kind===`Enabled`?[d(t)*2]:void 0}if(e.kind!==`And`)return;let t=e.operands.map(f);return t.every(e=>e!==void 0)?t.flat():void 0},p=e=>new Int8Array(e*l.size).fill(-1),m=e=>new Int8Array(e*i.size).fill(-1),h=(e,t,n,r,i)=>o?e(t,n,r,i):e(t,p(1),0,i),g=e=>{switch(e.kind){case`Boolean`:{let t=e.value;return()=>t}case`State`:case`Enabled`:{let t=d(e);return(n,r,i)=>(r[i+t]===-1&&(r[i+t]=+!!s.holdsState(e,n)),r[i+t]===1)}case`Action`:{let t=e.enabled&&d(e.enabled);return(n,r,i,a)=>(t===void 0||r[i+t]!==0)&&a!==void 0&&s.holdsAction(e,n,a)}case`Not`:{let t=g(e.body);return(e,n,r,i)=>!t(e,n,r,i)}case`And`:{let t=e.operands.map(g);return(e,n,r,i)=>t.every(t=>t(e,n,r,i))}case`Or`:{let t=e.operands.map(g);return(e,n,r,i)=>t.some(t=>t(e,n,r,i))}case`Next`:{let t=g(e.body);return(e,n,r,i)=>t(i??e,p(1),0,void 0)}case`Always`:case`Eventually`:return()=>{throw new w(`TLC cannot evaluate a temporal formula in a single step`)}}},_=e.map(e=>({solution:e,checks:{states:e.stateChecks.map(g),actions:e.actionChecks.map(g),nodes:e.tableau?.nodes.map(e=>{let t=o?f({kind:`And`,operands:e.statePredicates}):void 0;return t?Int32Array.from(t):e.statePredicates.map(g)})??[]},actionIds:Int32Array.from(e.actionChecks,e=>{let t=DC(e),n=i.get(t)??i.size;return i.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:tT(e=>new Int32Array(e)),edgeActions:tT(e=>new Uint8Array(e)),stateResults:tT(e=>new Uint8Array(e)),initial:[],firstNodes:tT(iT),lastNodes:tT(iT),nextSiblings:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],stateCount:0,errorNode:void 0})),v=(e,t,n,r,i)=>c(t,()=>{let t=e.checks.states,a=new Uint8Array(t.length);return t.forEach((e,t)=>{a[t]=+!!h(e,n,r,i)}),a}),y=(e,t,n,r,i,a,s,l,u,d)=>c(t,()=>{let t=e.checks.actions;for(let c=0;c<t.length;c++){if(!o){u[d+c]=+!!h(t[c],n,r,i,a);continue}let f=l+e.actionIds[c];s[f]===-1&&(s[f]=+!!t[c](n,r,i,a)),u[d+c]=s[f]}}),ee=(e,t,n,r,i)=>{let a=e.checks.nodes[t];if(!(a instanceof Int32Array))return a.every(e=>h(e,n,r,i));for(let e=0;e<a.length;e++){let t=a[e],o=i+(t>>1);if(r[o]===-1&&(r[o]=+!!s.holdsState(u[t>>1],n)),r[o]!==(t&1))return!1}return!0},b=(e,t,n,r,i,a)=>c(n,()=>ee(e,t,r,i,a)),x=(e,t)=>{if(!r)return!1;let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},te=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=rT(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},S=(e,t,n,r)=>{let 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),rT(i,e[t]-1,e[t+1]))}if(i.slots.set([t+1,n,r],rT(i,t,n)),t<0)return r;let a=e.lastNodes.data[t]??-1;return a===-1?nT(e.firstNodes,t,[r]):e.nextSiblings[a]=r,nT(e.lastNodes,t,[r]),r},C=(e,t)=>t<0?e.checks.nodes.some((n,r)=>te(e,t,r)!==void 0):e.isDone[t]===!0||(e.firstNodes.data[t]??-1)!==-1,ne=(e,t,n)=>(C(e,t)||e.stateCount++,S(e,t,n,cT(e,t,n))),re=(e,t,n,r,i,a)=>{let o=e.edgeTargets.length,s=e.solution.actionChecks.length;nT(e.edgeTargets,o,n),i.forEach((t,n)=>nT(e.edgeActions,(o+n)*s,r,t*s,s)),nT(e.stateResults,e.nodeStates[t]*a.length,a),e.edgeStarts[t]=o,e.edgeCounts[t]=n.length},T={slots:/* @__PURE__ */ new Int32Array},ie=(e,r,i)=>{let o=[...i,{index:e,state:r}],s=16*a;T.slots=T.slots.length===s?T.slots.fill(0):new Int32Array(s);let c=e=>{let r=T.slots,i=o[e];for(let a=(n.getFingerprint(i)&2147483647)%r.length;;a=(a+1)%r.length){let n=r[a];if(n===0)return r[a]=e+1,!0;let s=o[n-1];if(s.index===i.index&&t.isSame(s.state,i.state))return!1}},l=0;for(let e=0;e<o.length;e++){if(l>=T.slots.length>>1){let e=T.slots;T.slots=new Int32Array(2*e.length+1);for(let t of e)t!==0&&c(t-1)}c(e)&&l++}T.slots.length>s&&a++;let u=[];for(let e of T.slots)e!==0&&u.push(o[e-1]);return u},ae=(e,t,r,a,o,s,c)=>{let l=v(e,a,r,s,c),u=t.nodes[e.nodeTableaux[o]],d=e.checks.actions.length,f=[],h=[],g=new Uint8Array(d);u.successors.length>0&&y(e,a,r,s,c,r,m(1),0,g,0);for(let n of u.successors){if(!b(e,n,a,r,s,c))continue;if(x(t,n)&&e.errorNode===void 0&&e.solution.models.some(Zw)){e.errorNode=o;return}let i=te(e,a,n);if(i!==void 0&&h.includes(i))continue;let l=i??ne(e,a,n);h.push(l),f.push(0),i===void 0&&ae(e,t,r,a,l,s,c)}let _=[g],ee=1;if(n.forEachActionSuccessors(a,r,n=>{let o=m(n.length),l=new Uint8Array(n.length*d);_.push(l);for(let m=0;m<n.length;m++){let g=n[m],_=p(1);y(e,a,r,s,c,g.state,o,m*i.size,l,m*d);let v=e.isDone[g.index]===!0;for(let n of u.successors){if(!b(e,n,a,g.state,_,0))continue;let r=te(e,g.index,n);if(r!==void 0&&h.includes(r))continue;let i=r??ne(e,g.index,n);h.push(i),f.push(ee+m),r===void 0&&v&&ae(e,t,g.state,g.index,i,_,0)}}ee+=n.length}),h.length>0){let t=new Uint8Array(ee*d);for(let e=0,n=0;e<_.length;e++)t.set(_[e],n),n+=_[e].length;re(e,o,h,t,f,l)}},oe=(e,t,n,r,i,a,o)=>{let s=l.size,u=new Uint8Array(t.nodes.length*n.length);c(o,()=>{for(let i=0;i<t.nodes.length;i++)for(let t=0;t<n.length;t++)ee(e,i,n[t].state,r,t*s)&&(u[i*n.length+t]=1)}),C(e,o)||e.stateCount++,e.isDone[o]=!0;for(let c of lT(e,o)){let o=[],l=[];n.forEach((i,a)=>{let d=e.isDone[i.index]===!0;for(let f of t.nodes[e.nodeTableaux[c]].successors){if(u[f*n.length+a]===0)continue;let c=te(e,i.index,f);if(c!==void 0&&o.includes(c))continue;let p=c??ne(e,i.index,f);o.push(p),l.push(a),c===void 0&&d&&ae(e,t,i.state,i.index,p,r,a*s)}}),re(e,c,o,i,l,a)}return e.errorNode===void 0?void 0:ce(e,e.errorNode)},se=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)cT(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,n)=>{aT(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n))}),aT(e,i)||e.stateCount++,re(e,i,a,n,o,r)},E=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)aT(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 oT(e,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}aT(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new w(`Couldn't re-create liveness trace (path) starting at: ${t}`)},ce=(e,t)=>eT(E(e,t).reverse().map(t=>e.nodeStates[t])),D=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=(t,n,i)=>e.edgeActions.data[(e.edgeStarts[t]+n)*r+i]===1,a=(e,n)=>t.eventuallyAlways.every(t=>i(e,n,t)),o=new Float64Array(e.nodeStates.length).fill(-1),s=e.initial.filter(t=>aT(e,t)),c=[],l=t=>{let n=oT(e,t).indexOf(t);return n!==-1&&a(t,n)},u=(t,r)=>n.tableau!==void 0&&JC(n.tableau.nodes[e.nodeTableaux[t]].particle,r),d=r=>{let s=c.pop()??r;if(s===r&&!l(s)){o[s]=uT;return}let d=/* @__PURE__ */ new Set,p=/* @__PURE__ */ new Map;for(let t=s;;t=c.pop()??r){d.add(t);let n=p.get(e.nodeStates[t]);if(n?n.push(t):p.set(e.nodeStates[t],[t]),o[t]=uT,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...d].some(n=>sT(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...d].some(n=>oT(e,n).some((e,r)=>d.has(e)&&a(n,r)&&i(n,r,t)))),g=n.promises.every(e=>[...d].some(t=>u(t,e)));if(m&&h&&g)return f(r,d,p)},f=(r,o,s)=>{let c=ce(e,r),l=[],d=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g=f.length+m.length+h.length,_=r,v=e=>{l.push(_),_=e};for(;g>0;){let r=g;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&sT(e,_,t)&&(f[n]=!0,g--)}),n.promises.forEach((e,t)=>{!h[t]&&u(_,e)&&(h[t]=!0,g--)}),!(g<=0);){let n=-1,c=-1,u=g;if(oT(e,_).some((r,l)=>{if(s.has(e.nodeStates[r])){if(!o.has(r)||!a(_,l))return!1;n=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&i(_,l,e)&&(m[t]=!0,g--)})}return g<u?(v(r),d.clear(),!0):(o.has(r)&&!d.has(r)&&(c=r),!1)}))break;if(g<r){v(n),d.clear();break}for(;c===-1;){let t=l.pop();if(t===void 0)throw new w(`TLC failed to build the counterexample of a liveness property`);_=t,c=oT(e,t).find(e=>o.has(e)&&!d.has(e))??-1}v(c),d.add(c)}}let y=p(r,_,s);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];y[y.length-1]!==n&&y.push(n)}let ee=c[c.length-1];return y[y.length-1]===ee&&y.pop(),{prefix:c.slice(0,-1),cycle:[ee,...y.reverse()],isCycleConstrained:Qw(n)}},p=(t,n,r)=>{if(n===t)return[];let i=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([i]),c=[];for(let n=i,l=-1,u=0;;u++){for(let u of r.get(n)??[])for(let[d,f]of oT(e,u).entries()){if(f===u||!a(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==i;)e.push(t),t=r,r=o.get(t)??-1;return e.push(i),e}let p=e.nodeStates[f];r.has(p)&&!s.has(p)&&(s.add(p),c.push([p,n]))}o.set(n,l);let d=c[u];if(d===void 0)throw new w(`TLC failed to build the counterexample of a liveness property`);n=d[0],l=d[1]}};for(let t=0;t<s.length;t++){let n=[s[t],-1,0],r=0;for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),l=n.pop()??0;if(i===-42){if(o[l]===t){let e=d(l);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(o[l]!==-1){n.push(Math.min(t,o[l]));continue}o[l]=r,n.push(t,l,-42),c.push(l);let u=r++;oT(e,l).forEach((t,r)=>{aT(e,t)&&(a(l,r)?o[t]===-1?n.push(t,-1):u=Math.min(u,o[t]):o[t]===-1&&s.push(t))}),n.push(u)}}};return{branches:_.length,addInitialState:(e,t)=>{let n=p(1);for(let r of _){let i=r.solution.tableau;if(!i)r.initial.push(e);else for(let a=0;a<i.initialCount;a++)b(r,a,void 0,t,n,0)&&r.initial.push(te(r,e,a)??ne(r,e,a))}},addState:(e,t,n,r)=>{let a=ie(e,t,n),o=p(a.length),s=a.findIndex(t=>t.index===e)*l.size,c=m(a.length);for(let n of _){let l=n.checks.actions.length,u=new Uint8Array(a.length*l);a.forEach((r,a)=>y(n,e,t,o,s,r.state,c,a*i.size,u,a*l));let d=v(n,e,t,o,s),f=n.solution.tableau;if(r&&(f?lT(n,e).some(e=>n.edgeCounts[e]>0):a.every(e=>aT(n,e.index))))throw new w(`The behavior graph holds every edge of the state already.`);if(!f){se(n,a,u,d,e);continue}let p=oe(n,f,a,o,u,d,e);if(p)return p}},storeState:(e,t)=>{for(let n of _){let r=n.solution.tableau;if(!r)continue;let i=[];for(let t=0;t<r.nodes.length;t++){let r=te(n,e,t);r!==void 0&&i.push(r)}for(let e of i.sort((e,t)=>e-t))n.nodeStates[e]=t,S(n,t,n.nodeTableaux[e],e)}},getStateCounts:()=>_.map(e=>e.stateCount),findViolation:()=>{for(let e of _)for(let t of e.solution.models){let n=D(e,t);if(n)return n}}}},xT=e=>{switch(e.kind){case`Number`:if(!_n(e.value))throw v(new t(`TLC can't handle a number this big.\n${e.value}`),b.error);return e.value;case`String`:case`Boolean`:return e.value;case`ModelValue`:return rr(e.name);case`Set`:return F({kind:`MixedSet`,elements:e.elements.map(xT)})}},ST=e=>{try{return xT(e)}catch(e){throw!(e instanceof w)||e instanceof t||e instanceof f?e:v(new w(`${l}${e.message}`),b.error)}},CT=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>L(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 w(`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`)&&vr(t,r)})});if(t)return t[1];throw new w(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:L(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},wT=e=>new C(`In the configuration file, the identifier ${e} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`),TT=(e,t)=>{let n=e=>t.root.visible.get(e)?.key??e,r=t.root.constants.map(e=>e.name),i=t.root.variables,a=e=>{let n=t.moduleSymbols.get(e.module??``)?.get(e.name);return n?.kind===`Definition`?n:void 0},o=e=>{if(e.module===void 0)return[e.name,n(e.name)];let t=a(e);return t?[t.key]:[]},s=e=>e.module===t.root.module.name?[]:o(e),c=e=>{let n=t.definitions.get(e);return n?.kind===`Operator`?n.params.length:t.root.constants.find(t=>t.name===e)?.arity??t.builtins.get(e)?.arity??0},l=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Set,d=(e,n)=>{t.builtins.set(e,n),t.definitions.delete(e),l.delete(e),u.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=ST(e.value);Gr(t),s(e).forEach(e=>{let n=c(e);n===0?l.set(e,t):d(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let f=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=f.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new C(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(xT),xT(e.value)]),f.set(t,n)}),f.forEach(e=>s(e).forEach(t=>d(t,CT(e.name,c(t),e.rows))));let p=new Map(e.substitutions.flatMap(e=>o(e).map(t=>[t,n(e.target)])));[...p.keys()].forEach(e=>l.delete(e));let m=(e,a,o)=>{let s=n(a),c=t.definitions.get(s);if(!(c!==void 0||t.builtins.has(s)||l.has(s)||r.includes(a)||i.includes(a)))throw new C(`The configuration file substitutes for ${e} with the undefined identifier ${a}.`);if(c?.kind===`Operator`&&c.params.length!==o)throw new C(`The configuration file substitutes for ${e} with ${a} of different number of arguments.`)};e.substitutions.filter(e=>e.module===void 0).forEach(n=>{let i=n.name,a=n.target;if(!r.includes(i)&&!t.root.visible.has(i))throw new C(`In the configuration file, the identifier ${i} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===a))throw wT(a);m(i,a,t.root.constants.find(e=>e.name===i)?.arity??t.root.visible.get(i)?.arity)});let h=e.substitutions.filter(e=>e.module!==void 0);[...t.moduleSymbols.keys()].forEach(e=>{let t=h.filter(t=>t.module===e);t.forEach(e=>{let n=a(e);if(n){if(t.some(t=>t.name===e.target))throw wT(e.target);m(e.name,e.target,n.arity)}});let n=t.find(e=>!a(e));if(n)throw new C(`In the configuration file, the identifier ${n.name} does not appear in the specification.`)});let g=h.find(e=>!t.moduleSymbols.has(e.module??``));if(g)throw new C(`In the configuration file, the module name ${g.module} is not a module in the specification.`);let _=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(s)),v=(e,n)=>{if(_.has(e))return{key:e,prefix:n};let r=t.copySources.get(e);return r&&v(r.source,n+r.prefix)};t.copySources.forEach((e,n)=>{let r=v(e.source,e.prefix),i=t.definitions.get(n);if(!r||!i)return;let a=i.kind===`Operator`?i.params:[],o=qp(n,r.key,a,a.slice(r.prefix),i.location);t.definitions.set(n,o),t.root.visible.forEach((e,r)=>{e.key===n&&r!==n&&t.definitions.set(r,o)})}),t.operatorConstants.forEach((e,t)=>l.set(t,e));let y=r.filter(e=>!l.has(e)&&!p.has(e)&&!u.has(e));if(y.length>0){let e=t.order.getDeclarationOrder(`constant`).find(e=>y.includes(e))??y[0];throw new C(`The constant parameter ${e} is not assigned a value by the configuration file.`)}return{constants:l,substitutions:p}},ET=`tlc2/value/impl/`,DT={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},OT={iconstM1:2,iconst0:3,iconst5:8,bipush:16,sipush:17,ldc:18,ldcW:19,dup:89,areturn:176,getstatic:178,invokespecial:183,invokestatic:184,new:187},kT=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n=0,r=e=>{let t=n;return n+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n)}},AT=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),jT=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],MT=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??AT.get(e[3])}${`[]`.repeat(e[1].length)}`),NT=(e,t)=>e[e[t].first].text,PT=(e,t)=>NT(e,t).replaceAll(`/`,`.`),FT=e=>{let t=kT(e);if(t.readUint32()!==3405691582)throw new s(`A module override is not a class file`);t.readUint16(),t.readUint16();let n=[],r=t.readUint16(),i=new TextDecoder;for(let e=1;e<r;e++){let r=t.readUint8(),a={tag:r,text:``,value:0,first:0,second:0};n[e]=a,r===DT.utf8?a.text=i.decode(t.readBytes(t.readUint16())):r===DT.integer?a.value=t.readInt32():r===DT.float?t.readUint32():r===DT.long||r===DT.double?(t.readBytes(8),e++):r===DT.class||r===DT.string||r===DT.methodType||r===DT.module||r===DT.package?a.first=t.readUint16():r===DT.methodHandle?(t.readUint8(),a.first=t.readUint16()):(a.first=t.readUint16(),a.second=t.readUint16())}t.readUint16();let a=PT(n,t.readUint16());t.readUint16(),t.readBytes(t.readUint16()*2);for(let e=t.readUint16();e>0;e--){t.readBytes(6);for(let e=t.readUint16();e>0;e--)t.readUint16(),t.readBytes(t.readUint32())}let o=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,s=i.indexOf(`)`),c=MT(i.slice(1,s)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:kT(t.readBytes(t.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>PT(n,d.readUint16())):[],p=jT.filter(t=>(e&t[0])!==0).map(e=>e[1]),m=MT(i.slice(s+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;o.push({name:r,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${a}.${r}(${c.join(`,`)})${h}`})}return{pool:n,methods:o}},IT=(e,t)=>{let n=e[t],r=e[n.second];return{className:NT(e,n.first),name:e[r.first].text}},LT=(e,t,n,r)=>{let i=()=>new p(`The Java override ${n}.${e.name} computes its value, which tla-ts cannot run`),a=e.code;if(!a)throw i();let o=[],s=()=>{let e=o.pop();if(e===void 0)throw i();return e},c=e=>{let n=t[e];if(n.tag===DT.integer)return n.value;if(n.tag===DT.string)return t[n.first].text;throw i()};for(let e=0;e<a.length;){let n=a[e],l=()=>a[e+1]<<8|a[e+2];if(n>=OT.iconstM1&&n<=OT.iconst5)o.push(n-OT.iconst0),e+=1;else if(n===OT.bipush)o.push(a[e+1]<<24>>24),e+=2;else if(n===OT.sipush)o.push(l()<<16>>16),e+=3;else if(n===OT.ldc)o.push(c(a[e+1])),e+=2;else if(n===OT.ldcW)o.push(c(l())),e+=3;else if(n===OT.dup){let t=s();o.push(t,t),e+=1}else if(n===OT.getstatic){let n=IT(t,l());if(n.className!==`${ET}BoolValue`||n.name!==`ValTrue`&&n.name!==`ValFalse`)throw i();o.push({kind:`Identifier`,name:n.name===`ValTrue`?`TRUE`:`FALSE`,location:r}),e+=3}else if(n===OT.invokestatic){let n=IT(t,l()),a=s();if(n.className!==`${ET}IntValue`||n.name!==`gen`||typeof a!=`number`)throw i();o.push({kind:`Number`,value:a,location:r}),e+=3}else if(n===OT.new)o.push({className:NT(t,l()),value:void 0}),e+=3;else if(n===OT.invokespecial){let n=IT(t,l()),a=s(),o=s();if(!(n.className===`${ET}StringValue`&&n.name===`<init>`&&typeof a==`string`&&typeof o==`object`&&`className`in o))throw i();o.value={kind:`String`,value:a,location:r},e+=3}else if(n===OT.areturn){let e=s();if(typeof e!=`object`)throw i();if(`className`in e){if(!e.value)throw i();return e.value}return e}else throw i()}throw i()},RT=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=FT(t),i=new Map(e.definitions.filter(e=>n||!e.isLocal).map(e=>[e.name,e.kind===`Operator`?e.params.length:0])),a=e=>i.get(e.name)===e.arity,o=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let n=r.methods.find(e=>e.name===t.name&&a(e));return n?{...t,body:LT(n,r.pool,e.name,t.location)}:t});return{module:{...e,definitions:o},overrides:r.methods.map(t=>({module:e.name,operator:t.name,signature:t.signature,isMatched:a(t)}))}},zT=/* @__PURE__ */ new WeakMap,BT=(e,t)=>{let n=Cp(e,t),r=zT.get(e);return r!==void 0&&zT.set(n,r),n},VT=(e,t)=>e.forEach(e=>{let n=t.find(t=>t.isRecursive&&t.name===e.name);n&&zT.set(n,e.arity)}),HT=e=>{switch(e.kind){case`Name`:return e.name;case`Operand`:return typeof e.operand==`number`?`argument selector ${e.operand}`:e.operand;case`Bound`:return`!(...)`;case`At`:return`@`;case`Colon`:return`:`}},UT=(e,t,n)=>({operator:e,range:t,args:n,params:n.map(()=>0)}),WT=(e,t)=>new s(`${e} at line ${t.line}, column ${t.column}`),GT=(e,t,n,r)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n,applications:r}:void 0;if(e.kind===`Let`)return GT(e.body,t,[...n,e.definitions],r);if(e.kind===`Lambda`||e.kind===`Selection`)return;let i=wd.get(e),a=e.kind===`Apply`&&i===void 0||e.kind===`FunctionApplication`?[...r,e]:r;for(let o of mt(e).slice(0,i)){let i=e.kind===`FunctionApplication`&&o===e.function,s=GT(o,t,n,i?r:a);if(s)return s}},KT=e=>({line:e.line,column:e.column}),qT=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:KT(n)}),e),JT=(e,t)=>{let n=e.location;if(e.params.length===0)return t;if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw WT(`Selected an operator with operator parameters as an argument`,n);return{kind:`Lambda`,params:e.params.map(e=>e.name),body:t,location:n}}if(e.args.length!==e.params.length)throw WT(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:_d,params:e.params,body:t,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:_d,args:e.args,location:n,resolution:gd},location:KT(n)}},YT=(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:gd})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:gd}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:gd};return JT({...t,params:[...t.params,...r]},qT(a,t.lets,n))},XT=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o=0,s=-1,c,l,u=!1,d=0,f=[],p=[],h,g=(e,t)=>{!h&&e&&(h={location:m(e),message:t})},_=(e,t,r=!1)=>{let i=n.selectorRanges?.[o];e&&i&&f.push({node:e,error:{location:m(i),message:t},isEmpty:r,applications:[...p]})},v=(e,t)=>{if(!e)throw WT(t,i);yd.set(n,{applications:p,nulls:f,error:{location:m(e),message:t}}),wd.set(n,d),u=!0},y=r=>{let i=n.selectorRanges?.[o],a=[],s=[];for(;o<e.length;){let n=e[o];if(n.kind!==`Name`&&!r)return;if(n.kind===`Name`){a.push(n.name),s.push(...n.args);let e=a.join(`!`),i=r?r.find(t=>xp(t)===e):t(e);if(i)return{definition:i,name:e,args:s,earlier:s.length-n.args.length}}o++}let c=n.selectorRanges?.[e.findLastIndex(e=>e.kind===`Name`)];return v(i&&c&&{...i,end:c.end},`Unknown operator: \`${a.join(`!`)}'.`)},ee=t=>{let l=y(t);if(!l){u=!0;return}let f=l.definition,m=zT.get(f)??Fd(f),h=o===e.length-1;if(l.args.length!==m){let e=n.argumentRanges?.[o]??i.range,t=`The operator ${$s(l.name)} requires ${m-l.earlier} arguments.`;if(!r||l.args.length!==0)return d+=l.earlier,v(e,t);g(e,t)}if(d+=l.args.length,l.args.forEach((e,t)=>Sd.set(e,{operator:l.name,index:t,range:n.selectorRanges?.[o]})),h)return{definition:f,args:l.args};let _=f.location.range,ee=zT.has(f)&&_?.module===i.range?.module&&Nd(i,f.location);if(p.push({operator:l.name,range:n.selectorRanges?.[o],args:l.args,params:ee?Array(m).fill(0):Id(f)}),f.isRecursive&&_&&_.module===i.range?.module&&Nd(i,_.end))return v(n.selectorRanges?.[o],`Subexpression of \`${l.name}' used inside the operator's definition.`);if(f.kind!==`Operator`)throw WT(`Cannot select a subexpression of ${f.name}`,i);a.params.push(...f.params),a.args.push(...l.args),c=f.body,s=o,o++},b=()=>{for(;o<e.length&&!u;){let t=e[o];if(t.kind!==`Name`)return;let i=n.selectorRanges?.[o],s=c&>(c,t.name,[],[]),l=`Cannot find label \`${t.name}'.`;if(!s)return v(i,l);s.applications.forEach(e=>_(e,l,!0));let u=s.label.params;if(t.args.length!==u.length){let e=`Label \`${t.name}' used with wrong number of arguments.`;if(!r)return v(i,e);g(i,e)}d+=t.args.length,a.lets.push(...s.lets),a.params.push(...u.map(e=>({name:e,arity:0}))),a.args.push(...t.args),p.push(UT(t.name,i,t.args)),c=s.label.body,o++}},x=t=>{if(!c)throw WT(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;let r=n.selectorRanges?.[o],s=`Choosing operand \`${HT(t)}' of subexpression with no operands.`;if(yd.has(c)){v(r,s);return}if(vd.has(c)&&c.kind!==`Lambda`&&c!==l&&(_(c,s,!0),l=c,c=c.kind===`Let`&&c.body.kind===`Apply`&&c.body.operator===`$subexpression`?c.body:c.kind===`Selection`?c:{kind:`Tuple`,elements:[c],location:c.location}),c.kind===`Label`){c=c.body,x(t);return}let u=`Nonexistent operand specified by \`${HT(t)}'.`;if(c.kind===`Let`){if(t.kind!==`Operand`||lf(t.operand,1)!==0){v(r,`A LET/IN expression has only one operand.`);return}a.lets.push(c.definitions),c=c.body;return}let f=pf(c);if(f&&(t.kind===`Bound`||t.kind===`At`)){if(t.kind===`Bound`&&t.args.length!==f.names.length){v(r,`Selector with ${t.args.length} argument(s) used for quantifier with ${f.names.length} bound identifier(s).`);return}a.params.push(...f.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&(d+=t.args.length,a.args.push(...t.args),p.push(UT(``,r,t.args))),c=vd.has(c)&&f.body.kind===`Selection`?f.body.expression:f.body;return}if(c.kind===`Case`){let i=[...c.arms,...c.other?[{condition:void 0,body:c.other}]:[]];if(o===e.length-1){v(r,`Subexpression of CASE must have form !i!j.`);return}let a=t.kind===`Operand`?i[lf(t.operand,i.length)]:void 0;if(!a){v(r,u);return}o++;let s=e[o],l=s.kind===`Operand`?lf(s.operand,2):-1,d=n.selectorRanges?.[o];if(l===-1){v(d,`Second selector for CASE subexpression must specify one of two operands.`);return}let f=l===0?a.condition:a.body;if(!f){v(d,`Selecting OTHER in a CASE statement.`);return}c=f;return}if(c.kind===`Except`&&t.kind===`Operand`&&lf(t.operand,c.updates.length+1)>0){v(r,`Selecting subexpression of an EXCEPT not yet implemented.`);return}let m=f?f.sets:mf(c);if(!m&&c.kind!==`Identifier`){v(r,`Selecting subexpression of expression that has none.`);return}if(t.kind!==`Operand`){v(r,u);return}let h=m?.[lf(t.operand,m.length)];h?c=h:v(r,u)},te=ee(void 0);if(u)return n;if(te)return YT(te.definition,{...a,args:te.args});for(b();o<e.length&&!u;){let t=e[o];if(t.kind===`Name`){for(;c?.kind===`Label`;)c=c.body;if(c?.kind!==`Let`)return v(n.selectorRanges?.[o-1],`A name selector here must be from a LET clause.`),n;a.lets.push(c.definitions);let e=ee(c.definitions);if(u)return n;if(e)return YT(e.definition,{...a,args:[...a.args,...e.args]});b()}else{if(t.kind===`Colon`&&e[o-1].kind!==`Name`)return v(n.selectorRanges?.[o-1],`!: should not follow an operand selector.`),n;if(t.kind===`Colon`&&e[o+1]?.kind!==`Name`&&(s!==o-1||o!==e.length-1))return v(n.selectorRanges?.[o],`\`!:' can be used only after a name and either at the end after an
|
|
1793
|
-
operator name or before an operator name.`),n;t.kind!==`Colon`&&(_(c,`Subexpression selection failed, probably due to an error in the selected expression.`),_(c,`Choosing operand \`${HT(t)}' of subexpression with no operands.`,!0)),x(t),_(c,`An unexpected null node specified by '${HT(e[o])}'.\nThis is probably due to a previous error.`),o++}}if(u)return n;if(!c)throw WT(`Subexpression selection failed`,i);let S=a.params.length,C=a.args.length;if(S!==C){let e=`Expected ${S} arguments but found ${C}.`;if(!r||C>0)return v(i.range,e),n;g(i.range,e)}let ne=qT(c,a.lets,i),w=e=>({kind:`Selection`,expression:e,location:a.params.length===0&&ne.kind!==`Lambda`?i:KT(i)}),re=JT(a,ne.kind===`Lambda`?{...ne,body:vd.has(ne)?ne.body:w(ne.body),location:i}:w(ne));return Cd.set(re,f),h&&bd.set(re,h),re},ZT=(e,t,n,r)=>{if(!e.includes(`!`)||r(e))return;let i=e.split(`!`);if(i.some((e,t)=>r(i.slice(0,t+1).join(`!`))))return uf(e,t,n)},QT=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||mt(e).some(QT),$T=(e,t,n,r=!1)=>{if(!QT(e))return e;if(e.kind===`Let`){e.recursive&&VT(e.recursive,e.definitions);let r=[],i=n=>r.find(e=>e.name===n)??e.definitions.find(e=>e.name===n)??t(n),a=t=>!e.definitions.some(e=>e.name===t)&&n(t);e.definitions.forEach(e=>r.push(BT(e,e=>$T(e,i,a))));let o={...e,definitions:r,body:$T(e.body,i,a)};return o.instances?{...o,instances:o.instances.map(e=>eE(e,i,a))}:o}let i=e.kind===`Apply`?t(e.operator):void 0,a=i?.kind===`Operator`?i.params:e.kind===`Apply`?im.get(e.operator.slice(e.operator.lastIndexOf(`!`)+1))?.formals:void 0,o=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>$T(e,t,n,a!==void 0&&a[r]?.arity!==0))}:wp(e,e=>$T(e,t,n)),s=mt(e),c=mt(o).every((e,t)=>e===s[t])?e:o,l=c.kind===`Subexpression`?c.selectors:c.kind===`Identifier`?ZT(c.name,[],void 0,t):c.kind===`Apply`?ZT(c.operator,c.args,c.argumentCounts,t):void 0,u=l?.[0],d=t=>{wd.set(e,t),wd.set(c,t)};if(!l)return c.kind===`Apply`&&c.operator.includes(`!`)&&!t(c.operator)&&d(0),c;let f=l.findIndex(e=>e.kind!==`Name`),p=l.slice(0,f===-1?l.length:f),m=p.some((e,n)=>n>0&&t(p.slice(0,n+1).map(HT).join(`!`)));if(u?.kind===`Name`&&n(u.name)&&!m)return c;if(u?.kind===`Name`&&l[1].kind!==`Name`&&!t(u.name))return d(0),c;let h=XT(l,t,c,r),g=wd.get(c);g!==void 0&&d(g);let _=Hu.get(e);return _&&h!==c&&Hu.set(h,_),h!==c&&vd.set(h,c),h},eE=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:$T(e.expression,t,n,!0)}))}),tE=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},nE=(e,t)=>eE(e,tE(t.definitions),()=>!1),rE=(e,t)=>{let n=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),r=e.theorems.flatMap(e=>{let t=e.statement;if(e.name===void 0||t.kind!==`AssumeProve`)return[];let n=t.assumptions.filter(e=>e.kind!==`NewSymbol`&&e.kind!==`AssumeProve`);return n.length===t.assumptions.length?[{kind:`Operator`,name:e.name,params:[],body:{kind:`Tuple`,elements:[...n,t.conclusion],location:t.location},isLocal:!0,isRecursive:!1,location:e.location}]:[]}),i=/* @__PURE__ */ new Set([...e.definitions,...r]);VT(e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]),e.definitions);let a=new Map(e.units.flatMap(e=>e.kind===`Recursive`?e.declarations.map(e=>[e.name,e.location]):[])),o=(e,t)=>{let n=a.get(e.name);return Nd(e.location,t)||e.isRecursive&&n!==void 0&&Nd(n,t)},s=/* @__PURE__ */ new Map,c=(e,t)=>n=>{let r=e(n);if(!(!r||i.has(r)&&!o(r,t)))return s.get(r)??r},l=tE([...t,...e.definitions]),u=e=>n.has(e),d=tE([...t,...e.definitions,...r]),f=(e,t)=>$T(e,c(d,t),e=>u(e)&&r.every(t=>t.name!==e)),p=e=>{let t=t=>u(t)||!e(t),n=n=>$T(n,e,t),r=e=>{let t=e.map(e=>e.kind===`ModuleFact`?e:n(e));return xd.set(t,e),t},i=n=>n.map(n=>n.kind===`ModuleFact`?n:$T(n,e,t,!0)),a=e=>e.map(e=>({...e,set:n(e.set)})),o=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&n(e.set)}:o(e)),conclusion:n(e.conclusion)}:n(e),s=s=>{switch(s.kind){case`Use`:case`Hide`:return{...s,facts:r(s.facts),defs:i(s.defs)};case`Instance`:return eE(s,e,t);case`Define`:return{...s,definitions:s.definitions.map(r=>r.kind===`Instance`?eE(r,e,t):BT(r,n))};case`Have`:case`Case`:return{...s,expression:n(s.expression)};case`Witness`:return{...s,expressions:s.expressions.map(n)};case`Take`:return{...s,bounds:a(s.bounds)};case`Pick`:return{...s,bounds:a(s.bounds),body:n(s.body)};case`Assert`:return{...s,statement:o(s.statement)};default:return s}},c=t=>{if(t?.kind===`By`)return{...t,facts:r(t.facts),defs:i(t.defs)};if(t?.kind!==`Steps`)return t;let n={lookup:e,resolveStep:s,resolveProof:c};return{...t,steps:t.steps.map(e=>{let t={...e,body:n.resolveStep(e.body),proof:n.resolveProof(e.proof)};if(t.body.kind===`Define`){let e=t.body.definitions.flatMap(e=>e.kind===`Instance`?[]:[e]),r=n.lookup;n=p(t=>e.find(e=>e.name===t)??r(t))}return t})}};return{lookup:e,resolveFacts:r,resolveDefs:i,resolveStatement:o,resolveStep:s,resolveProof:c}},m=e.definitions.some(e=>QT(e.body))||e.assumptions.some(e=>QT(e.expression));m&&[...e.definitions,...r].toSorted((e,t)=>Pd(e.location,t.location)).forEach(e=>s.set(e,BT(e,t=>f(t,e.location))));let h={...e,theorems:e.theorems.map(e=>{let t=p(c(l,e.location));return{...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:t.resolveStatement(e.statement),proof:e.proof&&p(c(l,e.proof.location)).resolveProof(e.proof)}}),uses:e.uses.map(e=>{let t=p(c(l,e.location));return{...e,facts:t.resolveFacts(e.facts),defs:t.resolveDefs(e.defs)}})};return m?{...h,definitions:e.definitions.map(e=>s.get(e)??e),assumptions:e.assumptions.map(e=>({...e,expression:f(e.expression,e.location)}))}:h},iE=(e,t)=>e.maxLevels[t]??3,aE=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=fh({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return t.set(n,a),a},r=/* @__PURE__ */ new Map,i=t=>{let i=r.get(t);if(i)return i;let a=e(t),o=n(t),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=>pm(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>pm(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>mm(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=um(e);t(n.operator,n.param)&&c.argParams.add(e)})};s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n)));let u=e=>{l(e,()=>!0),a.constants.forEach(t=>{e.params.has(t.name)&&pm(c.constraints,t.name,2)})};return a.assumptions.forEach(e=>u(o.analyze(e,/* @__PURE__ */ new Map))),a.theorems.forEach(e=>e.statement.kind===`AssumeProve`?u(ph(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),r.set(t,c),c};return t=>{let r=/* @__PURE__ */ new Map,a=m(t.location.range??{module:t.instancer,start:t.location,end:t.location}),o=e=>r.set(`${a}\n${e}`,{location:a,message:e}),s=e(t.module),l=i(t.module),u=n(t.instancer),d=/* @__PURE__ */ new Map;t.lets.forEach(e=>d.set(e.name,{kind:`Let`,definition:e,scope:d}));let f=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let n=t.substitutions.get(e.name);if(!n)return[];if(e.arity===0){let t=u.analyze(n,d);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=u.toOperand(n,d),i=r.kind===`Operator`?r.data:void 0;return[{...e,level:r.data.level,operator:i,isLeibniz:i===void 0||i.nonLeibniz.size===0}]}),p=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(f.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&o(p(e.name,e.maximumLevel)),e.isLeibniz||o(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),f.forEach(e=>{let n=l.constraints.get(e.name);n!==void 0&&e.level>n&&o(p(e.name,n));let r=e.operator;if(r)for(let n=0;n<e.arity;n++){let i=l.argConstraints.get(cm(e.name,n));i!==void 0&&iE(r,n)<i&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${n+1} of the operator ${r.name} \nmust be at least ${i}.`)}}),l.argParams.forEach(e=>{let n=um(e),r=f.find(e=>e.name===n.operator)?.operator,i=f.find(e=>e.name===n.param);if(!r||!i)return;let a=iE(r,n.index);i.level>a&&o(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),r.size>0)throw c([...r.values()])}},oE=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],sE=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),cE=new Map(Zs.flatMap(e=>e.map(t=>[t,e[0]]))),lE=e=>cE.get(e)??e,uE=()=>{let e=Array.from({length:11},()=>[]),t=8,n=/* @__PURE__ */ new Set,r=[],i=t=>{for(let n=e.length-1;n>=0;n--){let r=e[n];for(let e=r.length-1;e>=0;e--)t(r[e])}},a=()=>{let n=e.length*2+1,r=Array.from({length:n},()=>[]);i(e=>r[e.hash%n].push(e)),e=r,t=Math.floor(n*.75)};return{put:i=>{n.has(i.key)||(r.length>=t&&a(),e[i.hash%e.length].push(i),n.add(i.key),r.push(i))},inserted:r,ownStart:0,enumerate:()=>{let e=[];return i(t=>e.push(t)),e}}},dE=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:gt(e)&2147483647,kind:t,isLocal:n}),fE=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:lE(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:lE(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=t+2;for(;i<e.length&&e[i].text!==`)`;)i++;return{name:n.text,end:i+1}},pE=(e,t)=>{let n=[];for(let r=t;;){let t=fE(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},mE=e=>({line:e.line,column:e.column}),hE=(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(e[t-1]?.text!==`.`){if(a.text===`EXTENDS`){let n=pE(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},gE=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,_E={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},vE=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&gE(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&gE(e[n+1],e[n+2])?n+=gE(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=>_E[e])}"`:r.text)}return t},yE=e=>e[2]?.text,bE=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},xE=(e,t)=>e.find(e=>e.name===t)??e.map(e=>xE(e.modules,t)).find(Boolean),SE=e=>{let t=e===void 0?[]:tt(e),n;return{tokens:t,ranges:bE(t),getModule:()=>n??=e===void 0?qu(``):Ju(e,t)}},CE=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=e===void 0?void 0:i.get(e);if(t)return t;let n=SE(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:t?.(i)??rc.get(i)??rv.get(i)??Gu(e,i),c=a(s),l=c.tokens,u=c.ranges.get(yE(l)??``)??{start:0,end:0},d={tokens:l,...u,getModule:c.getModule};return n.set(i??``,d),c.ranges.forEach((e,t)=>{e.start===u.start||r.has(t)||r.set(t,{tokens:l,...e,getModule:()=>xE(d.getModule().modules,t)??d.getModule()})}),d};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},wE=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=pE(t,e+1);i.push({location:mE(t[e]),apply:e=>r.forEach(t=>e.put(dE(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c=new Set(n.units.flatMap(e=>e.kind===`Constants`||e.kind===`Variables`?[`${e.location.line}:${e.location.column}`]:[])),l=0;t.slice(e.start,e.end).forEach((n,r)=>{let u=e.start+r;if(n.kind===`Separator`&&t[u+1]?.text===`MODULE`){if(l++,l===2){let e=t[u+2].text;i.push({location:mE(n),apply:t=>t.put(dE(e,`module`,!1))})}return}if(n.kind===`ModuleEnd`&&l--,l!==1||n.kind!==`Keyword`)return;let d=c.has(`${n.line}:${n.column}`);d&&(n.text===`CONSTANT`||n.text===`CONSTANTS`)&&o(u,`constant`),d&&(n.text===`VARIABLE`||n.text===`VARIABLES`)&&o(u,`variable`),n.text===`RECURSIVE`&&pE(t,u+1).every(e=>s.has(e))&&o(u,`definition`),sE.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(mE(n)),i.push({location:mE(n),apply:e=>e.put(dE(t[u+1].text,`theorem`,!1))}))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put(dE(t,`theorem`,!1))})});let u=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(u(e.location))return;let t=lE(e.name);i.push({location:e.location,apply:n=>n.put(dE(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{i.push({location:e.location,apply:t=>{let n=r(e.module).enumerate(),i=e.name===void 0?``:`${e.name}!`,a=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...a,...o].forEach(n=>{n.isLocal||t.put(dE(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(dE(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>Nd(e.location,t.location)?-1:+!!Nd(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=uE();n.set(i??``,o),Xs.toReversed().forEach(e=>o.put(dE(e,`builtin`,!1)));let s=e(i);return s.getModule().extends.forEach(e=>r(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),o.ownStart=o.inserted.length,t(s).forEach(e=>e.apply(o)),o};return{getContext:r,getOwnEntries:e=>{let t=r(e);return t.inserted.slice(t.ownStart)}}},TE=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=e=>{r.add(e)},a=e=>{e.kind===`ModelValue`&&i(e.name),e.kind===`String`&&i(e.value),e.kind===`Set`&&e.elements.forEach(a)};t.constants.forEach(e=>{e.args?.forEach(a),a(e.value)}),ec.forEach(i);let o=t=>{let n=e(t);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=hE(o(e),e,s);return c.set(e,n),n},u=e=>s.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>s.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},h=m(e=>e.extends),g=m(e=>e.instances),_=/* @__PURE__ */ new Set([void 0]),v=/* @__PURE__ */ new Map;vE(o(void 0)).forEach((e,t)=>{t===3&&nc.forEach(i),i(e)});let y=l(void 0);for(;;){let t=h(y,/* @__PURE__ */ new Set)??g(y,/* @__PURE__ */ new Set);if(!t)break;let[n,r]=t;if(d.add(`${n.key}>${r}`),v.set(n.unit,[...v.get(n.unit)??[],r]),!_.has(r)){if(_.add(r),e(r).tokens.length===0){let t=n.unit??yE(e(void 0).tokens);throw x(r,t)}vE(o(r)).forEach(i)}}oE.forEach(i);let ee=/* @__PURE__ */ new Set,b=e=>{if(ee.has(e))return;ee.add(e);let t=v.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(b),o(e).forEach(e=>{e.kind===`String`&&i(e.text)})};return b(void 0),n.forEach(e=>{let t=o(e);vE(t).forEach(i),t.forEach(e=>{e.kind===`String`&&i(e.text)})}),tc.forEach(i),[...r]},EE=(e,t)=>{let n=CE(e,t),r=n.getParsed,i,a=()=>i??=wE(r);return{getStringOrder:(e,t)=>TE(r,e,t),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let e=a();return e.getContext(void 0),t=>e.getOwnEntries(t).filter(e=>e.kind===`definition`).map(e=>e.name)}}},DE=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),OE=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],kE=(e,t,n)=>{try{return n.parseModule(e)}catch(n){if(!(n instanceof s))throw n;let r=Tl(e);throw r===void 0?n:c([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},AE=e=>new s(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),jE=(e,t)=>e.location.range&&t.location.range&&{location:m(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${m(t.location.range)}.`},ME=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,NE=e=>e===`Theorem`?`ThmOrAssumpDefNode`:ME(e),PE=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:Gp(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),FE=(e,t)=>{let n=ht(e);return n!==void 0&&t.has(n)||mt(e).some(e=>FE(e,t))},IE=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Bp(e),n.get(e)??n.size)),n},LE=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),RE=e=>e?.kind===`Steps`?e.steps.flatMap(e=>[...e.body.kind===`Instance`?[e.body]:[],...e.body.kind===`Define`?e.body.definitions.flatMap(e=>e.kind===`Instance`?[e]:[]):[],...RE(e.proof)]):[],zE=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw qb(e);if(e.kind===`Number`&&!_n(e.value))throw Jb(e);zE(e.kind===`Let`?[...mt(e),...LE(e.instances??[])]:mt(e))}),BE=(e,t)=>{let n=t.order??EE(t.source,t.loadModule),r=n.parseModule(t.source),i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Set,u=/* @__PURE__ */ new Set,d=new Map(gv.map(e=>[e.name,e])),f=/* @__PURE__ */ new Map,p=A_(e.checkDeadlock,t.seed);p.isWarningEnabled=t.isWarningEnabled??!0,p.isTool=t.isTool??!1,p.version=t.version??`master`,p.readLine=t.readLine;let h=/* @__PURE__ */ new Map,_=/* @__PURE__ */ new Map,v=[],y=/* @__PURE__ */ new Map,ee=[],b=[],te=/* @__PURE__ */ new Set,S=(e,t)=>[te,...ee].forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ne=0,re=e=>`${e}#${ne++}`,T=[],ie=[],ae=aE(e=>{let t=_.get(e)??le(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>i.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>i.get(t.visible.get(e)?.key??e)}}),oe=/* @__PURE__ */ new Map,se=/* @__PURE__ */ new Map,E=/* @__PURE__ */ new Map,ce=e=>{let n=f.get(e);if(n)return n;let r=Rv(e,t.print,p,t.files,d);if(!r)return;Iv.get(e)?.forEach(ce);let i=/* @__PURE__ */ new Map;return Lv.get(e)?.forEach(e=>ce(e)?.forEach((e,t)=>i.set(t,e))),r.forEach(t=>{d.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:im.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:om(e,t.name)??i.get(t.name)?.range})}),f.set(e,i),i},D=e=>{let n=Iv.get(e)??[];if(e===`TLCExt`||[e,...n].some(e=>t.loadModule?.(e)!==void 0))return;let r=ce(e);return r&&S(e,n),r&&n.includes(`Integers`)&&ce(`Integers`),r},O=e=>(zE([...e.definitions.flatMap(pt),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...LE(e.instances)]),e.modules.forEach(O),e);O(r);let k=(e,r)=>{let i=t.loadModule?.(e)??av(p.version).get(e)??Gu(t.source,e);if(i===void 0)throw x(e,r);let a=kE(i,e,n);if(a.name!==e)throw c([{location:`Unknown location`,message:`File name '${e}' does not match the name '${a.name}' of the top level module it contains.`}],!0);return O(a)},A=e=>{let t=b.indexOf(e.name);if(t!==-1){let n=[...b.slice(t),e.name].map(e=>`${e}.tla`);throw new s(`Circular dependency among .tla files; dependency cycle is: ${n.join(` --> `)}`)}let n=/* @__PURE__ */ new Set,r=[],i=[],a=[];b.push(e.name),ee.push(n);let o=ve(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:i,warnings:ie,levelChecks:a});if(ee.pop(),b.pop(),i.length>0)throw c(i,!1,void 0,ie);let l=r.find(e=>n.has(e.name)),u=l&&h.get(l.name),d=u&&jE(l,u.module);if(d)throw c([d],!1,void 0,ie);if(l)throw AE(l);let f=[...pp(a.flatMap(e=>e.sections),ie),...a.flatMap(e=>e.check(e!==a.at(-1)))].filter((e,t,n)=>n.findIndex(t=>t.location===e.location&&t.message===e.message)===t);if(f.length>0)throw c(f,!1,void 0,ie);return{linked:o,closure:n}},le=(e,n)=>{let r=h.get(e);if(r)return S(e,y.get(e)??[]),r;let a=A(k(e,n)),o=/* @__PURE__ */ new Map;return Fv(e,t.print,p,t.files,d,(e,t,n)=>{let r=o.get(e),i=t.flatMap(e=>typeof e==`object`&&e.kind===`Operator`&&e.expression?[e.expression]:[]);if(r?.kind!==`Operator`||!n||i.length!==t.length)throw new w(`No definition of ${e} to fall back to`);return $(r.body,{environment:n.environment,scope:nS(Hx(r),i,n),state:n.state,next:n.next,isKeepLazy:n.isKeepLazy})})?.forEach(t=>{let n=a.linked.visible.get(t.name);if(n?.kind!==`Definition`||n.arity!==t.arity&&DE.has(e))return;let r=i.get(n.key);r&&o.set(t.name,r),d.set(n.key,t),i.delete(n.key)}),h.set(e,a.linked),y.set(e,a.closure),S(e,a.closure),a.linked},ue=(e,t,n,r,s)=>{let c=s?void 0:D(e.module);if(c)return de(e,c);let d=s??le(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=OE(d),p=`#${ne++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=fp(nE(e,t),f,t,n);T.push({module:e.module,instancer:t.name,lets:[],substitutions:h,location:e.location});let g=e.params.map(e=>({...e,name:`${e.name}${p}`}));g.forEach(e=>u.add(e));let _=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange,v=$p({params:g,substitutions:new Map([...h].map(e=>[e[0],vp(e[1],m)])),variables:new Set(d.variables),getDefinition:e=>i.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>a.get(e)===!0,addDefinition:(n,s,c)=>{let u=re(`${s}@${t.name}`),d=c(u);return i.set(u,d),f.length>0&&l.add(d),e.name!==void 0&&se.set(u,`${e.name}!${se.get(n)??s}`),a.set(u,!r),o.set(u,{source:n,prefix:e.params.length}),u},createName:re,...f.length>0&&{frame:{kind:`Identifier`,name:e.name??e.module,location:{..._.start,range:_}}}});return fe(e,d.exported,f,(t,n)=>{let r=e.name===void 0?v.getKey(t):v.getQualifiedKey(t);return f.length>0&&oe.set(r,{name:n,location:e.location}),e.name!==void 0&&E.set(r,n),r})},de=(e,t)=>e.name===void 0?t:new Map([...t].map(t=>[`${e.name}!${t[0]}`,{key:t[1].key,arity:t[1].arity,params:t[1].params,kind:t[1].kind}])),fe=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(t=>!i.has(t[0])&&(e.name!==void 0||t[1].kind!==`Instance`)).map(t=>{if(e.name===void 0)return[t[0],{key:r(t[1].key,t[0]),arity:t[1].arity,params:t[1].params,kind:t[1].kind,range:a.get(t[1].key)===!0?e.location.range:t[1].range,functionArity:a.get(t[1].key)===!0?void 0:t[1].functionArity}];let i=`${e.name}!${t[0]}`;return[i,{key:t[1].kind===`Instance`?i:r(t[1].key,i),arity:t[1].arity+e.params.length,params:t[1].params&&[...e.params.map(e=>e.arity),...t[1].params],kind:t[1].kind,functionArity:n.length>0?void 0:t[1].functionArity}]}))},pe=(e,t)=>Array.from({length:e},(e,n)=>({name:`argument${n}`,arity:t?.[n]??0})),me=(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=pe(t.arity,void 0);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:Kp(r,n),location:n}}},he=(e,t,n,r)=>{let o=e.location,s=r?void 0:D(e.module);if(s)return e.name===void 0?[]:[...s].map(t=>{let n=pe(t[1].arity,t[1].params);return qp(`${e.name}!${t[0]}`,t[1].key,[...e.params,...n],n,o)});let c=r??le(e.module,n),l=`#${ne++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=OE(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};T.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=>FE(f(e),p),h=d.map(t=>{let n=me(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=[],_=$p({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:Kp(e.params,o),location:o,resolution:gd}:Gp(`${t.name}${l}`,o)])),variables:new Set(c.variables),getDefinition:e=>i.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>a.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}:PE(a,i)),i},createName:re}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(e=>!v.has(e[0])&&e[1].kind!==`Instance`).map(t=>{let n=_.getKey(t[1].key),r=pe(t[1].arity,t[1].params),i=[...e.params,...r];return qp(e.name===void 0?t[0]:`${e.name}!${t[0]}`,n,i,n===t[1].key?r:i,o)});return[...h,...g,...y]},ge=e=>[...e].flatMap(e=>{let t=i.get(e[1].key);return t?[{...t,name:e[0]}]:[]}),_e=/* @__PURE__ */ new Map,ve=(e,n)=>{let o=RT(e,t.loadClass?.(e.name),e===r);_e.set(e.name,o.overrides);let s=o.module,c=T.length,l=new Map([...gv.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...n.symbols]),u=/* @__PURE__ */ new Map,d={location:sp,errors:[],warnings:[]},f=[d],p=e=>e.forEach((e,t)=>{let n=h.get(t);if(!n){l.set(t,e),h.set(t,e);return}if(!n.range||!e.range||m(n.range)===m(e.range))return;let r=m(e.range),i=m(n.range);NE(n.kind)===NE(e.kind)?d.warnings.push({location:r,message:`Warning: the ${ME(n.kind)} of '${t}' conflicts with \nits ${ME(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${ME(e.kind)} of '${t}' conflicts with \nits ${ME(n.kind)} at ${i}.`})}),h=/* @__PURE__ */ new Map,g=/* @__PURE__ */ new Set,y=/* @__PURE__ */ new Map,ee=[],b=[...s.constants],x=s.variables.filter((e,t)=>s.variables.findIndex(t=>t.name===e.name)===t),S=x.map(e=>e.name),C=x.map(e=>e.location);s.extends.forEach(e=>{let t=n.modules.get(e),r=t?void 0:D(e);if(r){p(r);return}let i=t??le(e,s.name);b.push(...i.constants.filter(e=>b.every(t=>t.name!==e.name)&&!S.includes(e.name))),i.variables.forEach((e,t)=>{S.includes(e)||b.some(t=>t.name===e)||(S.push(e),C.push(i.variableLocations[t]))}),p(i.exported),i.facts.forEach(e=>g.add(e)),i.modules.forEach((e,t)=>y.set(t,e)),ee.push(i)});let ne=new Map(l),w=[...s.constants.map(e=>({...e,kind:`Constant`})),...s.variables.map(e=>({...e,kind:`Variable`}))],re=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});w.forEach(e=>h.set(e.name,re(e)));let oe=e=>({key:ce(e),arity:Fd(e),params:Id(e),kind:cp(s,e)?`Theorem`:`Definition`,range:e.location.range,functionArity:Rd(e)}),se=b.length===0&&S.length===0,ce=e=>s===r?e.name:`${e.name}@${n.id}`,O=/* @__PURE__ */ new Map,k=()=>new Map([...n.modules,...y]),A=e=>{let t=s.modules.find(t=>t.name===e.module);return t?Nd(t.location,e.location)?y.get(t.name):void 0:k().get(e.module)},pe=e=>({imported:l,getInstance:e=>{let t=A(e),n=t?void 0:D(e.module);if(n)return{declarations:[],symbols:de(e,n),instancer:s.name};let r=t??le(e.module,s.name),i=OE(r);return{declarations:i,symbols:fe(e,r.exported,i,e=>e),instancer:s.name}},bound:ne,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:ce,isModuleKnown:(e,t)=>e===s.name||te.has(e)||n.modules.has(e)||s.modules.some(n=>n.name===e&&Nd(n.location,t)),instanced:O,facts:g,reports:f,warnings:n.warnings}),me=e=>[...w.filter(t=>Nd(t.location,e)).map(e=>[e.name,re(e)]),...s.definitions.filter(t=>Nd(t.location,e)).map(e=>[e.name,oe(e)])].reduce((e,t)=>e.has(t[0])?e:e.set(t[0],t[1]),new Map(l)),ye=e=>{let t=k(),r=t.get(e.name),i=r&&jE(e,r.module);if(r&&!i)throw AE(e);n.nested.push(e);let a={location:e.location,errors:[],warnings:[]};f.push(a);let o=ve(e,{id:`${n.id}/${e.name}`,symbols:me(e.location),modules:t,nested:n.nested,errors:a.errors,warnings:a.warnings,levelChecks:n.levelChecks});i&&a.errors.push(i),r||y.set(e.name,o)};[...s.instances.map(e=>({location:e.location,link:()=>{let t=ue(e,s,pe(s),se,k().get(e.module));O.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||h.set(n,t))}),e.name!==void 0&&!e.isLocal&&h.set(e.name,{key:`${e.name}@${n.id}`,arity:e.params.length,kind:`Instance`,range:e.location.range})}})),...s.modules.map(e=>({location:e.location,link:()=>ye(e)}))].sort((e,t)=>Nd(e.location,t.location)?-1:1).forEach(e=>e.link());let be=rE(rm(s,(e,t)=>he(e,t,s.name,A(e))),ge(l));s.theorems.flatMap(e=>RE(e.proof)).filter(e=>!k().has(e.module)).forEach(e=>D(e.module)??le(e.module,s.name)),n.errors.push(...mp(be,pe(be))),be.definitions.forEach(e=>{let t=ce(e);i.set(t,e),a.set(t,!se);let n=oe(e),r=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||r!==void 0&&!Nd(r,e.location))&&(l.set(e.name,n),e.isLocal||h.set(e.name,n))});let xe={module:be,constants:b,variables:S,variableLocations:C,visible:l,exported:h,modules:y,extended:ee,facts:/* @__PURE__ */ new Set([...g,...[...be.theorems,...be.assumptions].flatMap(e=>e.name??[])])};_.has(s.name)||_.set(s.name,xe);let Se=T.splice(c).map(e=>({location:e.location,check:()=>ae(e)}));return n.levelChecks.push(mh(be,{constants:new Set(b.map(e=>e.name)),variables:new Set(S),getDefinition:e=>i.get(l.get(e)?.key??e),getQualifiedName:e=>E.get(l.get(e)?.key??e)},Se,ie)),v.push(xe),xe},ye=A(r).linked,be=t.traceFile,xe=be===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:be}}],Se=[...t.moduleOperators??[],...xe].map(e=>{let t=le(e.module,r.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});v.push(...v.splice(v.indexOf(ye),1)),ie.length>0&&!t.isSanyReported&&t.print(g(ie));let Ce=t.runtimeInvariants??[];Ce.forEach(e=>{if(e.module===void 0)return;h.set(r.name,ye);let t=le(e.module,r.name);v.splice(v.indexOf(t),1);let n=i.get(t.visible.get(e.name)?.key??e.name);n&&i.set(e.name,n)}),ye.visible.forEach((e,t)=>{let n=i.get(e.key);n&&e.key!==t&&i.set(t,n)}),Se.forEach(e=>{let t=e.key===void 0?void 0:i.get(e.key);e.kind!==`postcondition`&&t&&i.set(e.operator,t)});let we=[],Te=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>Te(e,t)),we.push(...e.module.assumptions))};Te(ye,/* @__PURE__ */ new Set);let Ee=ye.constants.map(e=>e.name),De=ye.variables,Oe=TT(e,{root:ye,moduleSymbols:new Map([...f,...[...h].map(e=>[e[0],e[1].visible]),[r.name,ye.visible]]),definitions:i,builtins:d,copySources:o,operatorConstants:new Map(Se.flatMap(e=>le(e.module,r.name).constants.flatMap(t=>{let n=e.constants?.[t.name];return n===void 0?[]:[[t.name,n]]}))),order:n}),ke=Oe.constants,Ae=Oe.substitutions;be!==void 0&&d.forEach((e,t)=>{let n=xv(e);n&&d.set(t,n)});let je=IE(De,v.flatMap(e=>e.module.variables.map(e=>e.name))),Me=kh({definitions:i,substitutions:Ae,constants:ke,variableIndex:je,builtins:d,variables:De}),Ne={runtime:p,definitions:i,builtins:d,constants:ke,substitutions:Ae,instanceNames:se,variables:De,variableIndex:je,facts:Me,startupValues:Array.from({length:Me.ids.size},()=>void 0),tlcEvalValues:/* @__PURE__ */ new WeakMap,substitutedDefinitions:l,instanceParams:u,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Pe=fh({constants:new Set(ke.keys()),variables:/* @__PURE__ */ new Set([...De,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>d.has(e))]),getDefinition:e=>cx(e,Ne)}),Fe=e=>{try{$(e,{environment:Ne,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof w)return e;throw e}};Ae.forEach((e,t)=>{let n=i.get(e),r=Ee.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Pe.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Fe(n.body):void 0;if(r){let n=Ft(r)?``:` - specifically: ${r.message}`;throw new C(`The configuration file substitutes constant ${t} with non-constant ${e}${n}`)}}),p.version!==`1.7.4`&&(p.isStarted=!0);let Ie=new Set(v.flatMap(e=>e.module.instances.map(e=>e.module))),Le=n.createDefinitionOrder();return{environment:Ne,assumptions:we,variableLocations:ye.variableLocations,instanceActions:oe,startupDefinitions:v.filter(e=>!Ie.has(e.module.name)||OE(e).length===0).flatMap(e=>Le(e===ye?void 0:e.module.name).flatMap(t=>{let n=i.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:v.flatMap(e=>_e.get(e.module.name)??[]),moduleOperators:Se,runtimeInvariants:Ce,rootName:r.name}},VE=e=>[...e].map(e=>`${e[0]}>${e[1].name}`).sort().join(`,`),HE=(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},UE=e=>v(new w(`${l}${e}`),b.error),WE=e=>{let t=I(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!mn(e)||!mn(i))throw UE(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},GE=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${KE(t)}`:n},KE=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Number`)return e.text??String(e.value);if(e.kind===`SetEnumeration`)return`{${e.elements.map(KE).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${GE(e.pattern,e.set)}:${KE(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(KE).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${KE(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>GE(e.pattern,e.set)).join(`,`)}|->${KE(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(KE);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},qE=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,JE=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new C(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw UE(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>$(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!dn(a)||!P(a))throw UE(`The symmetry operator must specify a set of functions.`);let o=F(a).elements;if(!o.every(pn))throw UE(`The symmetry values must be function records.`);let s=r.body,c=s.kind===`Apply`?s.args:s.kind===`SetEnumeration`?s.elements:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=KE(qE(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(wt.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;o.map(WE).forEach(e=>{e.size>0&&d.set(VE(e),e)});let f=[...d.values()],p=0;for(;p<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p,t).forEach(e=>{let t=HE(n,e),r=VE(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),h=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!qE(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||h.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>mn(e)&&m.has(e.name))})),d.size!==0)return[...d.values()]},YE=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=ZE(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(ZE(e[r],t));return a}},XE=(e,t)=>{let n=[],r=[];for(let i of e){let e=ZE(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(er);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(er(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},ZE=(e,t)=>{if(typeof e!=`object`)return e;let n=e.kind;if(n===`ModelValue`)return t.get(e.name)??e;if(n===`Set`){let n=XE(e.elements,t);return n?ar(n):e}if(n===`Function`||n===`LazyFunction`&&P(e.domain)){let n=I(e),r=YE(n.domain,t),i=YE(n.range,t)??n.range;if(r){let e=ni(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?sr(n.domain,e.range):e}return i===n.range?n:sr(n.domain,i)}if(n===`Interval`||!dn(e)||!P(e))return e;let r=F(e),i=YE(r.elements,t);return i?Xr(i):r},QE=(e,t,n)=>{let r=e;for(let i of t){let t=e.slice(),a=0;for(let o of n)if(t[o]=ZE(e[o],i),a===0&&(a=er(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},$E={line:0,column:0},eD=e=>({kind:`Identifier`,name:e,location:$E}),tD=e=>({name:e,expression:eD(e),scope:void 0}),nD=/* @__PURE__ */ new Set([`name`,`property`]),rD=(e,t,n)=>{let r=cx(t,n);if(!r)throw new C(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new C(nD.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},iD=e=>e.body.kind===`Number`||e.body.kind===`String`,aD=(e,t,n)=>n.constants.has(e)?n.constants.get(e):iD(t)?void 0:Rx(t,n),oD=(e,t,n)=>{if(n.constants.has(t))throw new C(`The ${e} ${t} cannot be a constant.`);let r=rD(e,t,n);if(aD(t,r,n)!==void 0)throw new C(`The ${e} ${t} cannot be a constant.`);return r},sD=(e,t,n)=>{let r=n.constants.has(t)?void 0:rD(e,t,n),i=r?aD(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new C(`The ${e} of ${t} is equal to ${L(i)}`);return i===void 0?r:void 0},cD=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},lD=(e,t,n)=>{let r=e.environment;r.runtime.warn=(e,t)=>n?.({kind:`warning`,code:e,text:t}),n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),zx(e.startupDefinitions,r),t.invariants.forEach(e=>{sD(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},uD=(e,t)=>{let n=fh({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>t.definitions.get(e)});return e.flatMap(e=>{let r=sD(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2){let t=i.params.size===0?``:`
|
|
1790
|
+
`]]),hv=(e=`master`)=>e===`1.7.4`?mv:pv,gv=(e,t)=>e.every(e=>vu(e,t)),_v=yl([!1,!0]);ml(_v);const vv=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return wl(vv(e,t,r),vv(e,r,n))},yv=[`\\cup`,`\\cap`,`\\`],bv=e=>typeof e==`object`&&e.kind===`MixedSet`,xv=e=>e.kind===`Interval`||e.kind===`Set`&&e.isNormalized,Sv=(e,t,n)=>{t.kind===`Interval`&&cu(t);let r=t.kind===`Interval`?t:pl(t);if(e!==`\\cup`){let i=e===`\\cap`,a=[];return Ns(r,e=>{vu(e,n)===i&&js(a,e)}),xv(t)?kc(a):bl(a)}if(au(t))return n;if(!Fs(n))return Lc({kind:`SetOperation`,operator:e,left:t,right:n});let i=[];return Ns(r,e=>js(i,e)),Ns(n.kind===`Interval`?n:G(n).elements,e=>{vu(e,t)||js(i,e)}),bl(i)},Cv=(e,t)=>{let n=t.elements,r=0,i=n.length;for(;r<i;){let t=r+i>>1,a=n[t];if(typeof a!=`number`)return;a<e.low?r=t+1:i=t}for(let t=e.low;t<=e.high;t++,r++){if(r===n.length)return!1;let e=n[r];if(e!==t)return typeof e!=`number`&&void 0}return!0},wv=(e,t)=>{if(typeof t==`object`&&t.kind===`Interval`&&t.low<=e.low&&t.high>=e.high)return!0;let n=typeof t==`object`&&t.kind===`Set`?Cv(e,t):void 0;if(n!==void 0)return n;for(let n=e.low;n<=e.high;n++)if(!vu(n,t))return!1;return!0},Tv=(e,t)=>{let n=(t,n)=>tp([Cp(t,n,e)()],0,e);return{...Y(e,2,e=>t(n(e,0),()=>n(e,1))),evaluateBinary:void 0,isLazy:!0}},Ev=[rp(`TRUE`,!0),rp(`FALSE`,!1),rp(`BOOLEAN`,_v),rp(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),op(`=`,gl),op(`#`,(e,t)=>!gl(e,t)),Y(`~`,1,e=>!tp(e,0,`~`)),Y(`<=>`,2,e=>tp(e,0,`<=>`)===tp(e,1,`<=>`)),Tv(`/\\`,(e,t)=>e&&t()),Tv(`\\/`,(e,t)=>e||t()),Tv(`=>`,(e,t)=>!e||t()),Y(`\\in`,2,e=>vu(J(e,0,`\\in`),J(e,1,`\\in`))),Y(`\\notin`,2,e=>!vu(J(e,0,`\\notin`),J(e,1,`\\notin`))),op(`\\subseteq`,(e,t)=>{if(typeof e==`object`&&e.kind===`Interval`)return wv(e,t);if(!Ps(e))throw new w(`\\subseteq expects a set but received ${q(e)}`);return typeof e==`object`&&e.kind===`Subset`&&typeof t==`object`&&t.kind===`Subset`&&W(e.base)?gv(G(e.base).elements,t.base):!$l(e,e=>!vu(e,t))}),...yv.map(e=>Y(e,2,t=>{let n=J(t,0,e),r=J(t,1,e),i=e!==`\\cup`&&typeof r==`object`&&r.kind===`Interval`&&typeof n==`object`&&n.kind!==`Interval`;if(Fs(n)&&Fs(r)&&!bv(n)&&!bv(r)&&!i&&!Ms(n)&&!Ms(r)){if(e===`\\cup`&&au(n))return r;let t=e===`\\cup`?wl:e===`\\cap`?Cl:Sl;return gu((n,r)=>{let i=G(n),a=G(r),o=t(i,a);if(e===`\\cup`){let e=pl(i),t=Sl(a,i).elements,n=e===i.elements&&(t.length===0||Cc(e[e.length-1],t[0])<0);if(e.length+t.length>ks())throw new u(As());if(n&&!i.isNormalized)return o;let r=o===i?Oc(o.elements):o;return n||(r.writtenElements=[...e,...t]),r}return o===n||(o.isNormalized=xv(n),i.writtenElements&&!i.isNormalized&&(o.writtenElements=i.writtenElements.filter(e=>vu(e,o)))),o},(t,n)=>Sv(e,t,n),n,r)}return Fs(n)?Sv(e,n,r):e!==`\\`&&Fs(r)?Sv(e,r,n):Lc({kind:`SetOperation`,operator:e,left:n,right:r})})),Y(`SUBSET`,1,e=>({kind:`Subset`,base:J(e,0,`SUBSET`)})),Y(`UNION`,1,e=>{let t=J(e,0,`UNION`),n=Rs(t)?pl(t):[],r=n.filter(Rs);if(!Rs(t)||r.length!==n.length)return Lc({kind:`Union`,base:t});let i=r.flatMap(pl),a=()=>{let e={kind:`MixedSet`,elements:[]};return i.forEach(t=>{vu(t,e)||js(e.elements,t)}),bl(e.elements)};return bv(t)||r.some(bv)?a():r.length===0?xl:gu(e=>fu(vv(e,0,e.length),i),a,r.map(G),void 0)}),Y(`DOMAIN`,1,e=>{let t=J(e,0,`DOMAIN`);if(!Is(t))throw new w(`DOMAIN expects a function but received ${q(t)}`);return zu(t)})],Dv=vp(`Integers`,`Neg`,`IntValue`,1),Ov=e=>{let n=vp(e,`DotDot`,`IntervalValue`,2);return[yp(e,`+`,`Plus`,(e,t)=>e+t),yp(e,`-`,`Minus`,(e,t)=>e-t),yp(e,`*`,`Times`,(e,t)=>e*t),yp(e,`^`,`Expt`,(e,n)=>{if(n<0)throw new t(`The second argument of ^ should be a natural number, but instead it is:\n${n}`);if(e===0&&n===0)throw new t(`0^0 is undefined.`);return e**n}),yp(e,`\\div`,`Divide`,(e,n)=>{if(n===0)throw new t(`The second argument of \\div is 0.`);let r=Math.floor(e/n);if(sp(r))throw cp(`${e} \\div ${n}`);return r}),yp(e,`%`,`Mod`,(e,n)=>{if(n<=0)throw new t(`The second argument of % should be a positive number, but instead it is:\n${n}`);return(e%n+n)%n}),op(`..`,(e,t)=>{let r=_p(t,n);return{kind:`Interval`,low:_p(e,n),high:r}})]},kv=Ov(`Naturals`),Av=Ov(`Integers`),jv=e=>{let t=kv.indexOf(e);return t===-1?void 0:Av[t]},Mv=e=>{let t=(t,n=`tlc2.value.IBoolValue`)=>`public static ${n} tlc2.module.${e}.${t}(tlc2.value.impl.Value,tlc2.value.impl.Value)`,n=e===`Integers`;return[gp(xp(`<`,(e,t)=>e<t),t(`LT`)),gp(xp(`>`,(e,t)=>e>t),n?t(`GT`,`tlc2.value.impl.BoolValue`):t(`GT`)),gp(xp(`<=`,(e,t)=>e<=t),t(`LE`)),gp(xp(`>=`,(e,t)=>e>=t,n?`>=`:`>`),t(`GEQ`))]},Nv=[rp(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...kv,...Mv(`Naturals`)],Pv=[rp(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Av,...Mv(`Integers`),Y(`-.`,1,e=>{let t=_p(J(e,0,`-`),Dv);if(sp(-t))throw cp(`-${t}`);return-t})],Fv=(e,n,r)=>{let i=J(e,n,r),a=pu(i);if(!a)throw new t(`${r}\n${U(q(i))}`);return a},Iv=(e,t,n)=>{let r=J(e,t,n);return typeof r==`string`?r:Fv(e,t,n)},Lv=(e,t,n)=>{let r=J(e,t,`SubSeq`);if(typeof r!=`number`)throw Qf(n,`SubSeq`,`natural number`,r);return r},Rv=(e,t,n)=>typeof e==`string`?pc(e.slice(t,n)):Il(e.slice(t,n)),zv=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Bv=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Vv=(e,t)=>{let n=Et.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?gp(e,t):e}):t},Hv=e=>Vv(`Sequences`,[Y(`Seq`,1,e=>({kind:`SequenceSet`,base:J(e,0,`Seq`)})),Y(`Len`,1,e=>Iv(e,0,zv(``,`Len`)).length),Y(`\\o`,2,e=>{let n=Iv(e,0,Bv(`s \\o t`,`sequence`));if(typeof n!=`string`){let t=Fv(e,1,Bv(`t \\o s`,`sequence`)),r=n.length===0?J(e,1,`\\o`):t.length===0?J(e,0,`\\o`):void 0;return r!==void 0&&Nc(r)===`tuple`?r:Il([...n,...t])}let r=J(e,1,`\\o`);if(typeof r!=`string`)throw new t(`${Bv(`t \\o s`,`string`)}\n${U(q(r))}`);return pc(n+r)}),Y(`Append`,2,t=>Il([...Fv(t,0,Bv(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),J(t,1,`Append`)])),Y(`Head`,1,e=>{let n=Fv(e,0,zv(``,`Head`));if(n.length===0)throw new t(`Attempted to apply Head to the empty sequence.`);return n[0]}),Y(`Tail`,1,e=>{let n=Iv(e,0,zv(``,`Tail`));if(n.length===0)throw new t(`Attempted to apply Tail to the empty sequence.`);return Rv(n,1)}),Y(`SubSeq`,3,e=>{let n=Iv(e,0,zv(`first `,`SubSeq`)),r=Lv(e,1,`second`),i=Lv(e,2,`third`);if(r>i)return Rv(n,0,0);let a=r<1||r>n.length?{position:`second`,value:r}:i>n.length?{position:`third`,value:i}:void 0;if(a)throw new t(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${U(q(J(e,0,`SubSeq`)))}\n, but instead it is\n${a.value}`);return Rv(n,r-1,i)}),ip(`SelectSeq`,2,e=>{let n=np(e,1,`SelectSeq`);return Il(Fv(e,0,zv(`first `,`SelectSeq`)).filter(e=>{let r=n.call([e]);if(typeof r!=`boolean`)throw new t(`The second argument of SelectSeq should be a boolean-valued operator, but instead it is:\n<Operator ${n.name}>`);return r}))})]),Uv=e=>Vv(`FiniteSets`,[Y(`IsFiniteSet`,1,e=>uu(J(e,0,`IsFiniteSet`))),Y(`Cardinality`,1,n=>{let r=J(n,0,`Cardinality`);if(!Ps(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new t(`Attempted to compute cardinality of the value\n${U(q(r))}`);return cu(r,e)})]),Wv=[gp(Y(`Warshall`,1,e=>{let n=J(e,0,`Warshall`);if(!Ps(n)||gc(n))throw new t(`Applying TransitiveClosure to the following value,\nwhich is not an enumerable set:\n${U(q(n))}`);cu(n);let r=[],i=/* @__PURE__ */ new Map,a=e=>{let t=id(e),n=i.get(t)??r.length;return n===r.length&&(i.set(t,n),r.push(e)),n},o=G(n).elements.map(e=>{let n=pu(e);if(n?.length!==2)throw new t(`Attempted to apply TransitiveClosure to a set containing\nthe following value:\n${U(q(e))}`);return[a(n[0]),a(n[1])]}),s=r.map(()=>r.map(()=>!1));o.forEach(e=>{s[e[0]][e[1]]=!0});for(let e=0;e<r.length;e++)for(let t=0;t<r.length;t++)if(s[t][e])for(let n=0;n<r.length;n++)s[e][n]&&(s[t][n]=!0);return bl(r.flatMap((e,t)=>r.flatMap((n,r)=>s[t][r]?[Il([e,n])]:[])))}),`public static tlc2.value.impl.Value tlc2.module.TransitiveClosure.Warshall(tlc2.value.impl.Value)`)],Gv=(e,t,n,r,i,a)=>{if(e===`TransitiveClosure`)return Wv;if(e===`AnySet`)return[rp(`ANY`,bc)];if(e===`IOUtils`)return u_(r,a);if(e===`_TLCTrace`)return p_(r);if(!hv(n.version).has(e))return;let o=Jv(e,t,n,r,i);return e===`Randomization`&&o?[...o,R_(n)]:o},Kv=/* @__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`]]]),qv=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]]]),Jv=(e,t,n,r,i)=>{switch(e){case`Naturals`:return Nv;case`Integers`:return Pv;case`Sequences`:return Hv(n.version);case`FiniteSets`:return Uv(n.version);case`TLC`:return Vv(`TLC`,dv(t,n));case`Randomization`:return z_(n);case`_Possible`:return ev(t,n);case`Json`:return l_(r);case`Bags`:return Vv(`Bags`,Pg(i));case`TLCExt`:return Vv(`TLCExt`,$_(t,n));default:return}},Yv=(e,t,n)=>{let r=e.callStack;if(!r)return n();let i=r.expressions.at(-1)!==t&&Tp.get(t)||[];r.expressions.push(...i,t);let a=hu.sets,o=a??[],s=o.length;hu.sets=o;try{return n()}catch(e){throw TS(r,o.slice(s),e),e}finally{r.isFrozen||(r.expressions.length-=i.length+1),o.length=s,hu.sets=a}},Xv=(e,t,n)=>e.coverage?yf(e.coverage,t,n):-1,Zv=(e,t,n)=>e.coverage?xf(e.coverage,t,n):n(),Qv=(e,t,n,r)=>Zv(e,t,()=>$(n,r)),$v=(e,t,n,r)=>{let i=Qv(e,t,n,r),a=e.coverage;if(a?.covered.has(n))for(let e=t;e!==-1;e=a.prefixes[e])a.primary[e]--;return i},ey=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},ty=e=>!e.includes(void 0),ny=e=>e.variables.map(()=>void 0),ry=(e,t,n)=>{let r=[...e];return r[t]=n,r},iy=(e,t)=>{let n=e.operands[0].location,r=e.location.range,i=e.prefixEnds?.[t-2],a=r&&i?{...n,range:{...r,end:i}}:e.location;return{...e,operands:e.operands.slice(0,t),location:a}},ay=(e,t)=>e.coverage?e.coverage.prefixes[t]:-1,oy=e=>e.kind===`Identifier`?e.name:void 0,sy=(e,t,n)=>{if(t.kind===`Label`)return sy(e,t.body,n);let r=oy(t);if(r===void 0)return;let i=cx(n,r);if(i?.kind===`Thunk`)return sy(e,i.expression,i.scope);if(i)return;let a=e.variableIndex.get(r);if(a!==void 0)return a;let o=$x(r,e);return o?.kind===`Closure`&&o.params.length===0?sy(e,o.body,o.scope):void 0},cy=(e,t,n)=>{if(t.kind===`Prime`)return sy(e,t.expression,n);if(t.kind===`Label`)return cy(e,t.body,n);let r=oy(t);if(r===void 0)return;let i=cx(n,r);if(i?.kind===`Thunk`)return cy(e,i.expression,i.scope);if(i)return;let a=$x(r,e);return a?.kind===`Closure`&&a.params.length===0?cy(e,a.body,a.scope):void 0},ly=e=>{if(typeof e!=`boolean`)throw new w(`TLC expected a boolean expression.`);return e},uy=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),dy=(e,t,n,r)=>{let i=py(e,t,n,r);return i&&e.coverage&&!e.isInit&&bf(e.coverage,r),i},fy=(e,t,n)=>{let r=e.coverage;return r&&e.isInit&&(bf(r,n),bf(r,r.roots[n])),e.onState(t),!0},py=(e,t,n,r)=>t===void 0?ty(n)?fy(e,n,r):e.onIncomplete?.(n)??!1:ty(n)&&uy(e)?hy(e,t,n,r):t.kind===`Predicate`?gy(e,t.expression,t.rest,t.scope,n,t.node):t.kind===`Unchanged`?My(e,t.expression,t.rest,t.scope,n,t.node):my(e,t,n)&&dy(e,t.rest,n,t.node),my=(e,t,n)=>{let r=e.environment,i=Qv(e,t.node,t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return Qv(e,t.node,t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?sx(t,r.runtime.version):t}})();try{return!gl(i,a)}catch(t){throw e.callStack&&TS(e.callStack,[i],t),t}},hy=(e,t,n,r)=>{for(let i=t;i!==void 0;i=i.rest){if(i.kind===`Unchanged`)return My(e,i.expression,i.rest,i.scope,n,i.node);if(!(i.kind===`Changed`?my(e,i,n):ly(Qv(e,i.node,i.expression,ey(e,i.scope,n))))){let t=e.coverage;return t&&e.isInit&&t.secondary[t.roots[r]]++,!1}}return fy(e,n,r)},gy=(e,t,n,r,i,a)=>_y(e,t,n,r,i,Xv(e,a,t)),_y=(e,t,n,r,i,a)=>Yv(e,t,()=>{switch(t.kind){case`Let`:{let o=ey(e,r,i),s=t.definitions,c=e.coverage&&!e.isEnabled?gS(s,o,{impure:new Set(s),streamed:/* @__PURE__ */ new Set}):gS(s,o);return gy(e,t.body,n,c,i,a)}case`Label`:return gy(e,t.body,n,r,i,a);case`Selection`:return gy(e,t.expression,n,r,i,a);default:if(Ty.has(t.kind))throw new w(`The state relation is not a boolean expression.`);return Yv(e,t,()=>Ay(e,t,n,r,i,a))}}),vy=(e,t,n,r,i)=>ly(t)&&dy(e,n,r,i),yy=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`~>`,`-+->`,`\\cdot`]),by=(e,t,n,r,i,a)=>{let o=ey(e,r,i);if(t.kind===`Identifier`){let s=cx(r,t.name);if(s?.kind===`Thunk`&&s.cache===void 0){let t=e.coverage?.values.get(s)??a;return gy(e,s.expression,n,s.scope,i,t)}if(s?.kind===`Operator`&&s.operator.kind===`Closure`&&s.operator.params.length===0)return gy(e,s.operator.body,n,s.operator.scope,i,a);let c=s?void 0:e.environment.definitions.get(t.name),l=s?void 0:$x(t.name,e.environment);return l?.kind===`Closure`&&l.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(c&&Hh(c,e.environment))?gy(e,l.body,n,l.scope,i,a):vy(e,$v(e,a,t,o),n,i,a)}let s=eS(t,o);if(s?.kind===`Closure`&&s.params.length===t.args.length){let r=Zv(e,a,()=>fS(s,t.args,o));return gy(e,s.body,n,r,i,a)}let c=yy.has(t.operator)?Qv(e,a,t,o):$v(e,a,t,o);return vy(e,c,n,i,a)},xy=(e,t,n,r,i,a)=>{let o=n[r];return o===void 0?dy(e,t,ry(n,r,i),a):gl(o,i)&&dy(e,t,n,a)},Sy=(e,t,n,r,i)=>({kind:e,expression:t,scope:n,node:r,rest:i}),Cy=(e,t,n,r,i,a)=>{let[o,s]=t.args,c=e.isInit?sy(e.environment,o,r):cy(e.environment,o,r),l=ey(e,r,i);if(c===void 0)return Qv(e,a,t,l)===!0&&dy(e,n,i,a);let u=Qv(e,a,s,l),d=i[c];if(t.operator===`=`)return xy(e,n,i,c,u,a);let f=t.operator===`\\subseteq`?{kind:`Subset`,base:u}:u;if(typeof f==`object`&&f!==u&&(e.callStack?.sources.set(f,s),e.coverage?.values.set(f,a)),d!==void 0)return Qv(e,a,t,l)===!0&&dy(e,n,i,a);if(!zl(f))throw new w(`The right side of \\IN is not enumerable.`);let p=eu(f),m=e.generator;if(m){let t=Oy(e,f,p);for(let r=0;r<t.length;r++){let o=dy(e,n,ry(i,c,t[r]),a);if(m.kept>0)return o}}let h=e.coverage&&jf(e.coverage,f,p,!1),g=p.reduce((t,r)=>(h?.next(),dy(e,n,ry(i,c,r),a)||t),!1);return h?.next(),g},wy=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Ty=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Ey={Always:`[]`,Eventually:`<>`,WeakFairness:`WF`,StrongFairness:`SF`},Dy=e=>{let t=e.kind===`Apply`&&(e.operator===`~>`||e.operator===`-+->`)?e.operator===`~>`?`a ~> b`:`a -+-> formula`:Ey[e.kind];if(t!==void 0)return`In computing ENABLED, TLC encountered a temporal formula (${t}).\n${Q(e)}`;if(e.kind===`UnboundedQuantifier`)return e.isTemporal?`In computing ENABLED, TLC encountered temporal quantifier.\n${Q(e)}`:`In computing ENABLED, TLC encountered unbounded quantifier. Make sure that the expression is of form ${e.quantifier===`Forall`?`\\A`:`\\E`} x \\in S: P(x).\n${Q(e)}`;if(e.kind===`Choose`&&e.set===void 0)return`In computing ENABLED, TLC encountered unbounded CHOOSE. Make sure that the expression is of form CHOOSE x \\in S: P(x).\n${Q(e)}`},Oy=(e,t,n)=>{let r=e.environment.runtime,i=A_(n.length,t,r.getRandom(),r.version);return e.coverage&&Af(e.coverage,t,n.length,i),i},ky=(e,t,n,r)=>{let i=[],a=e.environment.runtime.version,o=Zv(e,r,()=>Ox(t.bounds,e=>{let t=$(e,n);return{value:t,elements:Tx(t,e,a)}})),s=o.map(e=>e.elements);Ax(t.bounds,s,n.scope,e=>(i.push(e),!1));let c=e.coverage;return{bindings:i,charge:c&&Nf(c,o.map(e=>e.value),s)}},Ay=(e,t,n,r,i,a)=>{let o=ey(e,r,i);switch(t.kind){case`Identifier`:return by(e,t,n,r,i,a);case`Apply`:return wy.has(t.operator)&&t.args.length===2?Cy(e,t,n,r,i,a):t.operator===`=>`&&t.args.length===2?ly(Qv(e,a,t.args[0],o))?gy(e,t.args[1],n,r,i,a):dy(e,n,i,a):by(e,t,n,r,i,a);case`And`:{let o=t.operands;if(t.isBulleted||o.length===2){let t=o.slice(1).reduceRight((e,t)=>Sy(`Predicate`,t,r,a,e),n);return gy(e,o[0],t,r,i,a)}let s=o[o.length-1];return _y(e,iy(t,o.length-1),Sy(`Predicate`,s,r,a,n),r,i,ay(e,a))}case`Or`:{let o=t.operands,s=t.isBulleted||o.length===2,c=e.generator;if(c){let l=s?o.length:2,u=Math.floor(c.random.nextDouble()*l),d=b_(c.random),f=!1;for(let p=0;p<l;p++){let m=(u+p*d)%l;if(f=(s||m===1?gy(e,o[s?m:o.length-1],n,r,i,a):_y(e,iy(t,o.length-1),n,r,i,ay(e,a)))||f,c.kept>0)return f}return f}if(s)return o.reduce((t,o)=>gy(e,o,n,r,i,a)||t,!1);let l=_y(e,iy(t,o.length-1),n,r,i,ay(e,a)),u=gy(e,o[o.length-1],n,r,i,a);return l||u}case`Exists`:{let r=e.generator;if(r){let s=e.environment.runtime.version,c=Zv(e,a,()=>Ox(t.bounds,e=>$(e,o))).map((n,r)=>Oy(e,n,Cx(n,t.bounds[r].set,s))),l=!1;return Ax(t.bounds,c,o.scope,o=>(l=gy(e,t.body,n,o,i,a)||l,r.kept>0)),l}let s=ky(e,t,o,a);return s.bindings.reduce((r,o)=>(s.charge?.(),gy(e,t.body,n,o,i,a)||r),!1)}case`Forall`:{let r=ky(e,t,o,a),s=r.bindings;if(s.forEach(()=>r.charge?.()),s.length===0)return dy(e,n,i,a);let c=s.slice(1).reduce((e,n)=>Sy(`Predicate`,t.body,n,a,e),n);return gy(e,t.body,c,s[0],i,a)}case`If`:return gy(e,ly(Qv(e,a,t.condition,o))?t.consequent:t.alternative,n,r,i,a);case`Case`:{let s=t.arms.find(t=>ly(Qv(e,a,t.condition,o)))?.body??t.other;if(s===void 0)throw new w(`TLC encountered a CASE with no conditions true.`);return gy(e,s,n,r,i,a)}case`FunctionApplication`:{let r=Lx(Qv(e,a,t.function,e.isInit?o:fx(o)));if(r){let s=Zv(e,a,()=>Rx(r,t,o));return gy(e,r.body,n,s,i,a)}break}case`Unchanged`:if(!e.isInit)return My(e,t.expression,n,r,i,a);break;case`BoxAction`:if(!e.isInit){let o=gy(e,t.action,n,r,i,a);return My(e,t.subscript,n,r,i,a)||o}break;case`AngleAction`:if(!e.isInit)return gy(e,t.action,Sy(`Changed`,t.subscript,r,a,n),r,i,a)}let s=e.isEnabled?Dy(t):void 0;if(s!==void 0)throw new w(s);return vy(e,Qv(e,a,t,o),n,i,a)},jy=(e,t,n)=>e.runtime.warn(Jo.unchangedVariableChanged,`The variable ${e.variables[t]} was changed while it is specified as UNCHANGED at\n${Q(n)}`),My=(e,t,n,r,i,a)=>Yv(e,t,()=>{let o=Xv(e,a,t),s=sy(e.environment,t,r);if(s!==void 0){let r=e.current?.[s];if(r===void 0)return!1;e.isEnabled&&e.coverage&&bf(e.coverage,o);let a=i[s];return a!==void 0&&!gl(a,r)?(jy(e.environment,s,t),!1):xy(e,n,i,s,r,o)}if(t.kind===`Tuple`){let[a,...s]=t.elements;if(a===void 0)return dy(e,n,i,o);let c=s.reduceRight((e,t)=>Sy(`Unchanged`,t,r,o,e),n);return My(e,a,c,r,i,o)}if(t.kind===`Identifier`){let a=cx(r,t.name);if(a?.kind===`Thunk`)return My(e,a.expression,n,a.scope,i,o);let s=a?void 0:$x(t.name,e.environment);if(s?.kind===`Closure`&&s.params.length===0)return My(e,s.body,n,s.scope,i,o)}if(e.isEnabled&&t.kind===`Apply`){let a=ey(e,r,i),s=eS(t,a);if(s?.kind===`Closure`&&s.params.length===t.args.length)return My(e,s.body,n,fS(s,t.args,a),i,o)}let c=e.environment,l=Qv(e,o,t,{environment:c,scope:r,state:e.current,next:void 0}),u=Qv(e,o,t,{environment:c,scope:r,state:i,next:void 0});return gl(l,u)&&dy(e,n,i,o)}),Ny=(e,t,n,r,i,a)=>({environment:e,callStack:e.callStack,coverage:t===`enabled`&&e.coverage?.current===-1?void 0:e.coverage,isInit:t===`init`,isEnabled:t===`enabled`,current:n,onState:r,onIncomplete:i,generator:a}),Py=/* @__PURE__ */ Error(`The replay found a successor`),Fy=(e,t,n,r)=>{let i=()=>{throw Py},a=r.coverage?.current??-1,o=Ny(r,`enabled`,n,i,i),s=o.callStack,c=s?.expressions.length??0;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=Sy(`Changed`,e.subscript,t,a,void 0);gy(o,e.action,n,t,ny(r),a)}else gy(o,e,void 0,t,ny(r),a);return!1}catch(e){if(e!==Py)throw e;return s&&(s.expressions.length=c,s.isFrozen=!1),!0}},Iy=(e,t,n,r)=>{let[i,...a]=e;if(i===void 0)return;let o=Ny(t,`init`,void 0,n,r),s=a.reduceRight((e,t)=>Sy(`Predicate`,t.expression,t.scope,t.node??-1,e),void 0);gy(o,i.expression,s,i.scope,ny(t),i.node??-1)},Ly=(e,t,n,r)=>{if(e.some(e=>Ty.has(e.expression.kind)))return;let i=n.coverage;e.forEach(e=>{let a=[],o=e.node??-1;Ry(e,o,t,n,e=>{i&&o!==-1&&i.primary[o]++,a.push(e)}),a.forEach(t=>r(t,e))})},Ry=(e,t,n,r,i,a,o)=>{let s=Ny(r,`next`,n,i,a,o);gy(s,e.expression,void 0,e.scope,ny(r),t)},zy=(e,t)=>{let n=[],r=e=>({environment:t,scope:e,state:void 0,next:void 0}),i=(e,r)=>{if(sy(t,e,void 0)!==void 0&&e.kind===`Identifier`){n.push(e);return}if(e.kind===`Tuple`){e.elements.forEach(e=>i(e,r));return}if(e.kind!==`Identifier`)return;let a=cx(r,e.name)?void 0:$x(e.name,t);a?.kind===`Closure`&&a.params.length===0&&i(a.body,a.scope)},a=(e,o,s)=>{switch(e.kind){case`Let`:a(e.body,gS(e.definitions,r(o)),s);return;case`Label`:a(e.body,o,s);return;case`Selection`:a(e.expression,o,s);return;case`FunctionApplication`:a(e.function,o,s);return;case`If`:a(e.consequent,o,s),a(e.alternative,o,s);return;case`Case`:e.arms.forEach(e=>a(e.body,o,s)),e.other&&a(e.other,o,s);return;case`And`:case`Or`:e.operands.forEach(e=>a(e,o,s));return;case`Exists`:case`Forall`:a(e.body,o,s);return;case`Unchanged`:i(e.expression,o);return;case`AngleAction`:a(e.action,o,s);return;case`BoxAction`:a(e.action,o,s),n.push(e.subscript);return;case`Identifier`:case`Apply`:{if(e.kind===`Apply`){if(e.operator===`=>`){e.args.forEach(e=>a(e,o,s));return}if(e.operator===`=`||e.operator===`\\in`){cy(t,e.args[0],o)!==void 0&&n.push(e);return}}let i=e.kind===`Identifier`?e.name:e.operator,c=cx(o,i);if(c?.kind===`Thunk`){a(c.expression,c.scope,s);return}let l=e.kind===`Apply`?eS(e,r(o)):c?.kind===`Operator`?c.operator:c?void 0:$x(i,t);if(l?.kind!==`Closure`||s.has(l.body)||t.definitions.get(i)?.isRecursive)return;let u=e.kind===`Apply`?e.args:[];if(l.params.length!==u.length)return;s.add(l.body),a(l.body,fS(l,u,r(o)),s),s.delete(l.body)}}};return e.forEach(e=>a(e.expression,e.scope,/* @__PURE__ */ new Set)),n.flatMap(e=>e.location.range??[])},By=/* @__PURE__ */ new WeakMap,Vy=/* @__PURE__ */ new WeakMap,Hy=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},Uy=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Wy=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,Gy=(e,t)=>{let n=new w(t);return e.isInit?n:v(n,b.error)},Ky=(e,t,n,r)=>{let i=Zb(n);return r&&Ty.has(n.kind)?e.isEnabled?`Attempted to compute ENABLED on a non-boolean expression.\n${i}`:`The ${e.isInit?`init`:`next`} state relation is not a boolean expression.\n${i}`:`In computing ${Wy(e)}, TLC expected a boolean expression,\nbut instead found ${q(t)}.\n${i}`},qy=(e,t,n)=>{let r=mp(t),i=Q(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${Wy(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
1791
|
+
`:``}${i}`},Jy=(e,t,n)=>Zy(e,t,$(t,n)),Yy=new Set(Ev.map(e=>e.name)),Xy=e=>e.kind===`Apply`?Yy.has(e.operator):e.kind!==`Identifier`&&!Ty.has(e.kind),Zy=(e,t,r,i=!0)=>{if(typeof r==`boolean`)return r;let a=Ky(e,r,t,i);throw e.isInit&&i&&Xy(t)?new n(a):Gy(e,a)},Qy=(e,t,n,r)=>r.environment.callStack?$(n,r):(e[t]??=MS(n,r.environment))(r),$y=e=>e===`=`||e===`\\in`||e===`\\subseteq`,eb=(e,t,n)=>{let r=n?By:Vy,i=r.get(e);if(i)return i;let a=Pb(e,t,n),o=n?void 0:Nb(e,t),s=o?(e,t,n,r,i,s)=>(e.generator?o:a)(e,t,n,r,i,s):a;return r.set(e,s),s},tb=(e,t)=>{if(t.constants.has(e))return;let n=yx(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},nb=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return nb(e.expression,t,!1,r);if(e.kind!==`Identifier`||M(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=tb(e.name,t);if(a&&!r.has(a))return r.add(a),nb(a.body,t,n,r)},rb=(e,t,n)=>nb(e,t,!n),ib=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return ib(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=gS(e.definitions,Hy(r,t,n));return ib(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=cx(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return ib(a.expression,a.scope,n,r,i);if(a)return;let o=r.environment.variableIndex.get(e.name);if(o!==void 0)return i?void 0:o;let s=tb(e.name,r.environment);if(s)return ib(s.body,void 0,n,r,i)},ab=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||M(e))||!t&&e.kind===`Prime`,ob=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>ob(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[{index:r,expression:e}];let i=tb(e.name,t);if(i)return n.add(e.name),ob(i.body,t,n)},sb=/* @__PURE__ */ new Set([`Label`,`Selection`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),cb=(e,t,n)=>sb.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||$y(e.operator)&&(ab(e.args[0],n)||rb(e.args[0],t,n)!==void 0)||M(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,lb=/* @__PURE__ */ new Set,ub=(e,t)=>{if(M(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r=!0;return Lp(e,(e,i)=>{let a=r?ub(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];a?n.push(...a):r=!1}),r?n:void 0},db=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||M(e)?void 0:yx(r,t);return i&&!n.has(i)&&(n.add(i),db(i.body,t,n))?!0:gt(e).some(e=>db(e,t,n))},fb=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=rb(e.args[0],t,n);if(r!==void 0)return{kind:`Assign`,expression:e,index:r,value:e.args[1]}}if(!n&&e.kind===`Unchanged`){let n=ob(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,variables:n}}return cb(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:eb(e,t,n)}},pb=(e,t)=>{if(e.bounds.length<2||e.body.kind!==`And`)return;let n=e.bounds.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:[]);if(n.length!==e.bounds.length)return;let r=new Set(n.slice(0,-1)),i=e.body.operands,a=i.findIndex(e=>{if(Xh(e,t)===void 0||db(e,t,/* @__PURE__ */ new Set))return!0;let n=ub(e,lb);return!n||n.some(e=>r.has(e))}),o=a===-1?i.length:a;if(o!==0)return{names:n,guards:i.slice(0,o),rest:i.slice(o)}},mb=(e,t,n)=>{let r=e.map(e=>fb(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=uy(t);for(let s=e;s<r.length;s++){if(s>0&&f&&Ib(u)){d??=Hy(t,n,u);for(let e=s;e<r.length;e++){let n=r[e],i=t.current,o=i&&n.kind===`Unchanged`?n.variables.find(e=>{let t=u[e.index];return t!==void 0&&!gl(t,i[e.index])}):void 0;if(o){jy(t.environment,o.index,o.expression);return}let s=n.expression,c=Qy(a,e,s,d);if(!Zy(t,s,c,!1)){t.onUnsatisfied?.(u,s);return}}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=Hy(t,n,u);let r=Qy(i,s,e.expression,d);if(!Zy(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=Hy(t,n,u);let r=Qy(i,s,e.value,d),a=u[e.index];if(a===void 0)u=Uy(u,e.index,r),d=void 0;else if(!gl(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;let r;for(let i of e.variables){let e=(r??u)[i.index];if(e===void 0)r??=u.slice(),r[i.index]=n[i.index];else if(!gl(e,n[i.index])){jy(t.environment,i.index,i.expression);return}}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},hb=e=>{let t=Dy(e);return(n,r,i,a,o,s)=>{if(n.isEnabled&&t!==void 0)throw Gy(n,t);Jy(n,e,Hy(n,r,i))&&s(i,a)}},gb=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=Hy(r,i,a);if(a[l]!==void 0){Jy(r,e,u)&&c(a,o);return}let d=$(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!zl(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${Wy(r)}, the right side of \\IN is not enumerable.`;throw Gy(r,`${t}\n${Q(e)}`)}let p=eu(f);if(r.generator){for(let e of A_(p.length,f,r.environment.runtime.getRandom(),r.environment.runtime.version))if(c(Uy(a,l,e),o),r.generator.kept>0||r.isStopped)return}for(let e=0;e<p.length&&!r.isStopped;e++)c(Uy(a,l,p[e]),o)}},_b=/* @__PURE__ */ new WeakMap,vb=e=>{let t=_b.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(vb),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return _b.set(e,n),n},yb=(e,t)=>{let n=e.args[0],r=hb(e),i=(e,r,i)=>ib(n,r,i,e,!t)??-1,a=gb(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=$(e.args[1],Hy(t,n,o));l(Uy(o,u,d),s)}},bb=(e,t,n)=>{let r=Q(e);return(i,a,o,s,c,l)=>{let u=Hy(i,a,o),d=$(e.function,n?u:fx(u)),f=Lx(d);if(f!==void 0){eb(f.body,t,n)(i,Rx(f,e,u),o,s,c,l);return}if(!Is(d))throw Gy(i,`In computing ${Wy(i)}, a non-function (${mp(d)}) was applied as a function.\n${r}`);let p=$(e,u);if(typeof p!=`boolean`)throw Gy(i,`In computing ${Wy(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},xb=(e,t)=>{let n=vb(e);return ob(e,t)?mb([n],t,!1):e.kind===`Tuple`?eb(n,t,!1):(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?cx(i,e.name):void 0;if(l?.kind===`Thunk`&&!l.isReleased){eb(vb(l.expression),t,!1)(r,l.scope,a,o,s,c);return}let u=Hy(r,i,a);if(r.isEnabled&&e.kind===`Apply`){let n=eS(e,u);if(n?.kind===`Closure`&&n.params.length===e.args.length){eb(vb(n.body),t,!1)(r,fS(n,e.args,u),a,o,s,c);return}}Jy(r,n,u)&&c(a,o)}},Sb=(e,t,n)=>{let r=e.operator,i=hb(e),a=M(e)?void 0:$x(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=LS(a,e.args,t),o;return(e,s,c,l,u,d)=>{o??=eb(a.body,t,n),o(e,i(Hy(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=Hy(a,o,s),f=eS(e,d);f?.kind===`Closure`?eb(f.body,t,n)(a,fS(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},Cb=(e,t,n)=>{let r=hb(e),i=M(e)?void 0:tb(e.name,t),a;return(o,s,c,l,u,d)=>{let f=cx(s,e.name);f?.kind===`Thunk`&&!f.isReleased?eb(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i||e.location.range&&Jx(i,t)!==void 0?r(o,s,c,l,u,d):(a??=eb(i.body,t,n),a(o,void 0,c,u?l:i.name,u,d))}},wb=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||M(e))return;let n=e.args[0],r=e.args[1];if(n.kind!==`FunctionApplication`||r.kind!==`String`)return;let i=n.args.length===1?n.args[0]:void 0;if(i?.kind!==`Identifier`||!M(i))return;let a=nb(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},Tb=e=>e.kind===`And`?e.operands.flatMap(Tb):[e],Eb=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&cb(e,t,!1),Db=e=>{let t=[];return(n,r,i)=>{let a=Hy(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!Zy(n,i,Qy(t,r,i,a)))return}}},Ob=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=Tb(e),r=n.findIndex(e=>!Eb(e,t)||wb(e,t)),i=r===-1?void 0:wb(n[r],t);return i?{...i,before:r===0?void 0:Db(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>Ob(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.before===void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o,before:void 0}}if(e.kind!==`Apply`||M(e))return;let r=$x(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Ob(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(!i||o?.kind!==`Identifier`||!M(o))return;let s=i.before,c=s&&LS(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(Hy(e,t,n)),n))}},kb=(e,t,n)=>{let r=cx(t,n.argument),i=e.current?.[n.variable];if(r?.kind!==`Value`||typeof i!=`object`||i.kind!==`Function`)return;let a=i.domain.indexOf(r.value),o=a===-1?void 0:i.range[a];return typeof o==`string`?o:void 0},Ab=(e,t,n)=>{let r=e.map(e=>eb(e,t,n)),i=n?[]:e.map(e=>Ob(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e:void 0);return(e,t,n,i,s,c)=>{let l=a&&kb(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++){let u=o[a];l!==void 0&&u?.labels.has(l)===!1?u.before?.(e,t,n):r[a](e,t,n,i,s,c)}}},jb=e=>(t,n,r,i,a,o)=>{let s=t.generator;if(!s)throw Error(`A random choice needs the run's generator`);let c=Math.floor(s.random.nextDouble()*e.length),l=b_(s.random);for(let u=0;u<e.length;u++)if(e[(c+u*l)%e.length](t,n,r,i,a,o),s.kept>0||t.isStopped)return},Mb=(e,t)=>{let n=eb(e.body,t,!1);return(r,i,a,o,s,c)=>{let l=Hy(r,i,a),u=t.runtime.version,d=Ox(e.bounds,e=>$(e,l)).map((n,r)=>A_(Cx(n,e.bounds[r].set,u).length,n,t.runtime.getRandom(),u)),f=(t,i)=>{if(t<0)return n(r,i,a,o,s,c),(r.generator?.kept??0)>0||r.isStopped;let l=e.bounds[t].pattern;return d[t].some(e=>f(t-1,ux(i,l,e)))};f(d.length-1,i)}},Nb=(e,t)=>{if(e.kind===`Exists`)return Mb(e,t);if(e.kind!==`Or`)return;let n=e.operands.map(e=>eb(e,t,!1));return e.isBulleted?jb(n):n.reduce((e,t)=>jb([e,t]))},Pb=(e,t,n)=>{let r=e=>eb(e,t,n);switch(e.kind){case`And`:return mb(e.operands,t,n);case`Or`:return Ab(e.operands,t,n);case`Exists`:{let i=r(e.body),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name;return(n,r,o,s,c,l)=>{let u=Cx($(a.set,Hy(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,lx(r,e,u[t]),o,s,c,l)}}let o=n?void 0:pb(e,t);if(o){let r=mb(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=Hy(n,i,a),d=Ox(e.bounds,e=>Cx($(e,u),e,t.runtime.version));if(d.some(e=>e.length===0))return;let f=(e,t)=>{if(e<0)r(n,t,a,s,c,l);else for(let r of d[e]){if(n.isStopped)return;let i=lx(t,o.names[e],r);if(e===d.length-1){let e=Hy(n,i,a);if(!o.guards.every(t=>Jy(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{jx(e.bounds,Hy(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Xh(e,t)!==void 0&&!db(e.body,t,/* @__PURE__ */ new Set)?ub(e,lb):void 0;return(t,n,r,o,s,c)=>{let l=[];jx(e.bounds,Hy(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>cx(n,e)?.kind===`Value`)){u.every(n=>Jy(t,e.body,Hy(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Ib(r)?u.slice(n).every(n=>Jy(t,e.body,Hy(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=$(e.condition,Hy(r,i,a));if(typeof l!=`boolean`)throw Gy(r,qy(r,l,e));(l?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,source:e.body,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=Hy(r,i,a),u=t.find(e=>{let t=$(e.condition,l);if(typeof t==`boolean`)return t;throw Gy(r,`In computing ${Wy(r)}, a non-boolean expression${r.isEnabled?``:` `}(${mp(t)}) was used as a guard condition of a CASE.\n${Zb(e.source)}`)})?.body??n;if(!u)throw Gy(r,`In computing ${Wy(r)}, TLC encountered a CASE with no conditions true.\n${Q(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=vS(e.definitions,t),a={impure:/* @__PURE__ */ new Set,streamed:i.streamed};return(t,r,o,s,c,l)=>n(t,gS(e.definitions,Hy(t,r,o),t.isEnabled?a:i),o,s,c,l)}case`Unchanged`:return n?()=>{throw new w(`UNCHANGED appears in an initial predicate at ${Jb(e)}`)}:xb(e.expression,t);case`AngleAction`:{let n=r(e.action),i={kind:`Unchanged`,expression:e.subscript,location:e.subscript.location},a=(e,n,r)=>{try{return Jy(e,i,Hy(e,n,r))}catch(n){throw e.isEnabled?sx(n,t.runtime.version):n}};return(e,t,r,i,o,s)=>n(e,t,r,i,o,(n,r)=>{a(e,t,n)||s(n,r)})}case`BoxAction`:return Ab([e.action,vb(e.subscript)],t,n);case`Label`:return r(e.body);case`Selection`:return r(e.expression);case`Identifier`:return Cb(e,t,n);case`FunctionApplication`:return bb(e,t,n);case`Apply`:{let i=e.args;if($y(e.operator)){let r=rb(i[0],t,n);if(r!==void 0)return e.operator===`=`?mb([e],t,n):gb(e,()=>r);if(ab(i[0],n))return yb(e,n)}if(e.operator===`=>`){let t=r(i[1]);return(n,r,a,o,s,c)=>{let l=$(i[0],Hy(n,r,a));if(typeof l!=`boolean`){let t=mp(l),r=Q(e);throw Gy(n,n.isInit?`In computing initial states of a predicate of form P => Q, P was ${t}\n.${r}`:n.isEnabled?`While computing ENABLED of an expression of the form P => Q, P was ${t}.\n${r}`:`In computing next states of a predicate of the form P => Q, P was\n${t}.\n${r}`)}l?t(n,r,a,o,s,c):c(a,o)}}return Sb(e,t,n)}default:return hb(e)}},Fb=e=>e.variables.map(()=>void 0),Ib=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Lb=(e,t)=>{let n=t.state;if(!n||!Ib(n))throw new w(`ENABLED needs a complete state at ${Jb(e)}`);let r=t.environment;if(r.callStack||r.coverage&&r.coverage.current!==-1)return Fy(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1,generator:void 0,successors:0};return eb(e,r,!1)(i,t.scope,Fb(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Rb=(e,t,n,i,a)=>{let o={environment:t,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1,generator:void 0,successors:0};eb(e,t,!0)(o,i,Fb(t),void 0,!1,e=>{if(!o.isStopped){if(!Ib(e)){if(a){o.isStopped=a([...e]);return}throw v(new r([...e]),b.error)}o.isStopped=n(e)}})},zb=(e,t,n)=>{let r=[];return Rb(e,t,e=>(r.push(e),!1),n),r},Bb=(e,t,n)=>{let r=n.variables.filter((t,n)=>e[n]===void 0);return new ne(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${r.join(`, `)}`,e,t,r)},Vb=(e,t,n,r,i,a,o,s)=>{let c={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:a,successors:0,onUnsatisfied:o};return eb(e,n,!1)(c,i,Fb(n),void 0,!1,(e,t)=>{if(!c.isStopped){if(!Ib(e)){if(s){s(e,t);return}throw Bb(e,t,n)}c.successors++,c.isStopped=r({state:e,action:t})}}),c.successors},Hb=(e,t,n,r)=>{let i={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:void 0,successors:0};return eb(e,n,!1)(i,r,Fb(n),void 0,!1,e=>{Ib(e)||i.successors++}),i.successors>0},Ub=(e,t,n,r)=>{let i=[];return Vb(e,t,n,e=>(i.push(e),!1),r),i},Wb=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Gb=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Kb=e=>Gb.has(e.kind)||e.kind===`Apply`&&Wb.has(e.operator),qb=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&Fs(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Jb=e=>`line ${e.location.line}, column ${e.location.column}`,Q=e=>{let t=e.location.range;return t?m(t):Jb(e)},Yb={Always:`[]A`,Eventually:`<>A`,WeakFairness:`WF`,StrongFairness:`SF`},Xb=(e,t)=>new w(`TLC encountered a temporal formula (${e}) when evaluating a predicate or action.\n${Q(t)}`),Zb=e=>e.kind===`Number`?e.text??String(e.value):Q(e),Qb=(e,t)=>new w(`A non-boolean expression (${mp(t)}) was used as the condition of an IF.\n${Q(e)}`),$b=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new w(`A non-boolean expression (${mp(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${Zb(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new w(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${mp(n)}.\n${Q({...e,location:{...e.location,range:{...r,end:i}}})}`)},ex=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${U(q(n))}\n${Q(e)}`,r=e=>`Attempted to apply function:\n${U(q(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!Is(i))throw new w(`Attempted to select field "${t}" from a non-record value ${U(q(i))}\n${Q(e)}`);let a=Nc(i);if(a===`tuple`)throw ku(t);return Lu(i.kind===`LazyFunction`?K(i):i,t,a===`record`?n:r)}},tx=e=>e===`1.7.4`?(t,n)=>Eu(t,n,e):void 0,nx=e=>t=>{if(!Is(t))throw new w(`Attempted to apply the operator DOMAIN to a non-function\n(${mp(t)})\n${Q(e)}`);return zu(t)},rx=(e,t)=>(n,r)=>{if(!Ps(n)||gc(n))throw new w(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${Q(e)}`);return t(n,r)},ix=e=>v(new w(`TLC can't handle real numbers.\n${e.text}`),b.configParseError),ax=e=>v(new w(`TLC can't handle a number this big.\n${e.text??e.value}`),b.error),ox=(e,t)=>new T(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${Q(t)}`,e),sx=(e,t)=>e instanceof T&&t!==`1.7.4`?new w(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${e.variable} occurring in the state formula v.\n`):e,cx=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},lx=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),ux=(e,t,n)=>{if(t.kind===`Name`)return lx(e,t.name,n);let r=pu(n);if(!r||r.length!==t.names.length){let e=t.ranges?.[0];throw new w(`Argument mismatch in operator application.${e?m(e):``}`)}return t.names.reduce((e,t,n)=>lx(e,t,r[n]),e)},dx=(e,t)=>{if(Is(e))return e;throw new w(`A non-function (${mp(e)}) was applied as a function.\n${Q(t)}`)},fx=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},px=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),mx=(e,t)=>{if(typeof e!=`boolean`)throw new w(`Expected ${t} to be a boolean but found ${q(e)}`);return e},hx=(e,t,n)=>{if(typeof e!=`boolean`)throw new w(`Attempted to evaluate an expression of form P => Q when ${n} was\n${mp(e)}.\n${Q(t)}`);return e},gx=(e,t)=>{if(typeof e!=`boolean`)throw new w(`Attempted to apply the operator ~ to a non-boolean\n(${mp(e)})\n${Q(t)}`);return!e},_x=(e,t,n)=>{if(typeof e!=`boolean`||typeof t!=`boolean`)throw new w(`Attempted to evaluate an expression of form P <=> Q when P or Q was not a boolean.\n${Q(n)}`);return e===t},vx=(e,t)=>{if(typeof e!=`boolean`)throw new w(`TLC expected a boolean value, but did not find one. ${Zb(t)}`);return e},yx=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),bx=(e,t)=>{let n=`universally (\\A) or existentially (\\E) quantify over ${t}, because this would require checking an\ninfinite number of cases.`;if(typeof e==`object`&&e.kind===`SequenceSet`)return`In TLA+, Seq(S) represents the set of all finite sequences whose elements come from the set S. Even when S\nis a finite set, the number of possible sequences in Seq(S) is unbounded because sequences can have any\nfinite length (e.g., length 0, 1, 2, and so on). As a result, TLC cannot evaluate expressions that\n${n} Note that for a finite set of sequences s, TLC handles s \\subseteq Seq(S).\nSee https://explain.tlapl.us/seq-unenumerable for additional details.`;if(typeof e==`object`&&e.kind===`InfiniteSet`&&e.name!==`STRING`&&e.name!==`Any`)return`The set ${e.name} contains infinitely many elements. As a result, TLC cannot evaluate expressions that\n${n} Note that TLC handles set membership like T \\subseteq ${e.name} for any finite set T.`},xx=(e,t,n)=>{if(!Ps(e)||gc(e)){let r=q(e),i=n===`1.7.4`?void 0:bx(e,r);throw new w(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${Zb(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${Zb(t)}\n${i}`)}},Sx=(e,t,n)=>(xx(e,t,n),typeof e==`object`&&e.kind===`Interval`?Ml(e):Kl(e)??Ql(e)),Cx=(e,t,n)=>n===`1.7.4`?(xx(e,t,n),Kl(e)??eu(e)):Sx(e,t,n),wx=e=>{if(typeof e==`object`&&e.kind===`Interval`)return cu(e),e},Tx=(e,t,n)=>wx(e)??Cx(e,t,n),Ex=(e,t,n)=>wx(e)??Sx(e,t,n),Dx=(e,t)=>{if(Array.isArray(e))return e.some(t);for(let n=e.low;n<=e.high;n++)if(t(n))return!0;return!1},Ox=(e,t)=>e.reduce((n,r,i)=>(n.push(i>0&&e[i-1].set===r.set?n[i-1]:t(r.set,i)),n),[]),kx=(e,t)=>Ox(e,e=>Tx($(e,t),e,t.environment.runtime.version)),Ax=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):Dx(t[n],t=>i(n-1,ux(a,e[n].pattern,t)));return i(e.length-1,n)},jx=(e,t,n)=>Ax(e,kx(e,t),t.scope,n),Mx=(e,t,n,r)=>{let i=Ox(e,e=>{let n=$(e,t);return{value:n,elements:Tx(n,e,t.environment.runtime.version)}}),a=i.map(e=>e.elements),o=Nf(n,i.map(e=>e.value),a);return Ax(e,a,t.scope,e=>(o(),r(e)))},Nx=(e,t)=>{let n=Ox(e,e=>$(e,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},Px=(e,t,n)=>{if(e.length===1)return ux(t,e[0].pattern,n);let r=pu(n)??[];return e.reduce((e,t,n)=>ux(e,t.pattern,r[n]),t)},Fx=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,Ix=e=>Object.assign(e.value,{lambda:e}),Lx=e=>Fx(e)?e.lambda:void 0,Rx=(e,t,n)=>{let r=e.value,i=t.args.map(e=>$(e,n)),a=i.length===1?i[0]:Il(i),o=(e,n,i)=>`In applying the function\n${U(q(r))},\nthe ${e} is:\n${U(q(n))}${i}.\n${Q(t.function)}`,s=e.bounds;if(s.length===1){if(!vu(a,r.domain))throw new w(o(`first argument`,a,`which is not in its domain`));return Px(s,e.scope,a)}let c=pu(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[];if(c===void 0)throw new w(`Attempted to apply a function to an argument not in its domain.\n${Q(t.function)}`);let u=()=>new w(`In applying the function\n${U(q(r))},\nthe argument list is:\n${U(q(a))}\nwhich does not match its formal parameter.\n`);if(s.forEach((e,t)=>{if(t>=c.length)throw u();let n=c[t],r=`argument number ${t+1}`;if(!vu(n,l[t]))throw new w(o(r,n,`${e.pattern.kind===`Name`?``:`
|
|
1792
|
+
`}which is not in its domain`));if(e.pattern.kind===`Tuple`&&pu(n)?.length!==e.pattern.names.length)throw new w(o(r,n,`which does not match its formal parameter`))}),c.length>s.length)throw u();return Px(s,e.scope,a)},zx=(e,t)=>{if(t.location.range)return{parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:Zb(t)}},Bx=(e,t,n)=>{if(!e)return;let r=t.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:e.parameters.map(e=>({name:e.name,domain:r[e.index]})),body:e.body}},Vx=(e,t,n,r)=>{let i={kind:`LazyFunction`,domain:e,source:n,boundTupleLengths:r,apply:e=>t(e,i)};return i},Hx=e=>e.length===1?void 0:e.map(e=>e.pattern.kind===`Tuple`?e.pattern.names.length:void 0),Ux=(e,t)=>{let n=Nx(e.bounds,t),r=(n,r)=>$(e.body,px(t,Px(e.bounds,lx(void 0,e.name,r),n))),i=t.environment.coverage,a=i&&!t.environment.callStack?i.current:-1,o=Vx(n,i?(e,t)=>i.current===-1?r(e,t):xf(i,a,()=>r(e,t)):r,Bx(zx(e.bounds,e.body),e.bounds,n),Hx(e.bounds));Ix({value:o,bounds:e.bounds,body:e.body,scope:lx(void 0,e.name,o)});let s=Object.assign(o,{rebind:n=>{let r=Ux(e,{...t,environment:n});return r.enumerated=o.enumerated,r}});return e.bounds.length===1?Pc(s):s},Wx=(e,t)=>{if(typeof t!=`object`||Nc(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!Fs(t.domain))return t;try{let e=K(t);return Ac(e.domain,e.range)}catch(e){if(e instanceof w)return t;throw e}},Gx=(e,t)=>{if(e.kind===`Operator`&&e.params.length>0)return()=>{throw new w(`Operator ${e.name} requires ${e.params.length} arguments`)};if(e.kind!==`Function`)return MS(e.body,t);let n=mt(e,!1);if(!e.isSelfReferential)return MS(n,t);let r=t=>Ux(e,t),i=t.coverage;return i?AS(n,r,i):r},Kx={name:``,binding:{kind:`Value`,value:!1},parent:void 0},qx=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=Gx(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=e.kind===`Operator`&&e.params.length===0&&qh(e.body,t)?e=>(i===void 0?void 0:a[i])??r(px(e,zS(e.scope)?void 0:Kx)):i===void 0?e=>r(px(e,void 0)):e=>a[i]??r(px(e,void 0));return t.definitionEvaluators.set(e,o),o},Jx=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},Yx=(e,t)=>e.forEach(e=>{if(e.kind===`Operator`&&e.params.length>0)return;let n=e.name;if(t.constants.has(n)||t.substitutions.has(n)||!Uh(e,t))return;let r=t.facts.ids.get(e);if(r===void 0||t.startupValues[r]!==void 0)return;let i={environment:t,scope:void 0,state:void 0,next:void 0};try{let n=t.runtime.evaluateAtStartup(()=>Wx(e,Gx(e,t)(i)));ml(n),t.startupValues[r]=n}catch(e){if(!(e instanceof w)&&!te(e))throw e}}),Xx=(e,t)=>{if(t===void 0||e===t)return!0;try{return t.every((t,n)=>t===void 0||e?.[n]!==void 0&&Vc(e[n],t))}catch(e){if(e instanceof w)return!1;throw e}},Zx=(e,t)=>{let n=e.cache;if(n!==void 0&&Xx(t.state,e.state)&&Xx(t.next,e.next))return n;let r=t.environment.coverage,i=r?.current===-1?void 0:r?.values.get(e),a=r&&i!==void 0?xf(r,i,()=>$(e.expression,px(t,e.scope))):$(e.expression,px(t,e.scope));return(!e.isStreamed||nu(a))&&(e.cache=a,e.state=t.state,e.next=t.next),e.cache!==void 0&&e.state===void 0&&e.next===void 0&&(e.scope=void 0,e.isReleased=!0),a},Qx=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),$x=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return $x(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Qx(r):t.builtins.get(e)},eS=(e,t)=>M(e)?tS(e.operator,t):$x(e.operator,t.environment)??tS(e.operator,t),tS=(e,t)=>{let n=cx(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return $x(e,t.environment)},nS=e=>e.kind===`Closure`?e.params.length:e.arity,rS=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:e.params.map(e=>({name:e,arity:0})),body:e.body,scope:t.scope};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0,r=n===void 0?void 0:tS(n,t);if(!r)throw new w(`Expected an operator argument at ${Jb(e)}`);return r},iS=(e,t,n)=>{if(e.kind===`Builtin`&&e.isLazy)return e.evaluate(t.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>e})),n);if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>lx(e,n.name,t[r]),e.scope);return $(e.body,px(n,r))},aS=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:nS(e),call:n=>iS(e,n,t)},oS=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=tS(e.name,t);return n!==void 0&&nS(n)>0},sS=(e,t)=>e.map(e=>oS(e,t)?aS(rS(e,t),t):$(e,t)),cS=(e,t)=>new w(`Operator ${e.name} expects ${e.params.length} arguments but received ${t}`),lS=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),uS=(e,t)=>{let n=t.variableIndex.get(e);if(n!==void 0)return{kind:`Variable`,index:n};let r=t.constants.get(e);if(r!==void 0)return{kind:`Value`,value:r};let i=t.substitutions.get(e);if(i!==void 0)return uS(i,t);let a=t.definitions.get(e);if(a)return{kind:`Definition`,definition:a};let o=t.builtins.get(e);if(o&&o.arity===0&&!o.isStateLevel)return{kind:`Value`,value:o.evaluate([])}},dS=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Bs(e.value)){let t={kind:`Value`,value:e.value,argument:e};return()=>t}let n=t.coverage;if(n)return t=>{let r=lS(e,t);return n.current!==-1&&n.values.set(r,n.current),r};if(e.kind===`Identifier`){let n=M(e)?void 0:uS(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0&&!t.callStack)return t=>{let n=cx(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:lS(e,t)}}return t=>lS(e,t)},fS=(e,t,n,r)=>{if(t.length!==e.params.length)throw cS(e,t.length);let i=e.scope;for(let a=0;a<t.length;a++){let o=e.params[a],s=o.arity>0?{kind:`Operator`,operator:rS(t[a],n)}:(r?.[a]??dS(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},pS=(e,t,n,r)=>e.kind===`Closure`?$(e.body,px(n,fS(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>$(e,n))):e.isLazy?e.evaluate(FS(t,n),n):e.evaluate(sS(t,n),n),mS=e=>e.kind===`Operator`&&e.isRecursive&&e.params.length>0,hS=(e,t,n)=>{let r=n;for(let n=0;n<e.length;n++)mS(e[n])&&(t[n].parent=r,r=t[n]);for(let n=0;n<e.length;n++)mS(e[n])||(t[n].parent=r,r=t[n]);return r},gS=(e,t,n)=>{let r=e.map(e=>({name:e.name,binding:{kind:`Value`,value:!1},parent:void 0})),i=t.scope,a=!1;for(let t=0;t<r.length;t++)r[t].parent=i,i=r[t],a||=e[t].isRecursive;a&&(i=hS(e,r,t.scope));let o=!1;for(let a=e.length-1;a>=0;a--){let s=e[a];o||=s.isRecursive&&s.kind===`Operator`&&s.params.length===0;let c=s.kind===`Operator`&&s.params.length===0&&!o?r[a].parent:i;r[a].binding=s.kind===`Function`?{kind:`Thunk`,expression:mt(s,!0),scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1}:s.params.length>0||n?.impure.has(s)?{kind:`Operator`,operator:{kind:`Closure`,name:s.name,params:s.params,body:s.body,scope:c}}:{kind:`Thunk`,expression:s.body,scope:c,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(s)??!1}}let s=t.environment.coverage;return s&&s.current!==-1&&r.forEach(e=>{e.binding.kind===`Thunk`&&s.values.set(e.binding,s.current)}),i},_S=(e,t,n)=>{let r=cx(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return Zx(r,n);if(r?.kind===`Operator`){if(nS(r.operator)===0)return iS(r.operator,[],n);throw new w(`Operator ${e} is used without arguments`)}let i=uS(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw ox(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return qx(i.definition,n.environment)(n);let a=n.environment.builtins.get(n.environment.substitutions.get(e)??e);if(a?.arity===0)return a.evaluate([],n);throw new w(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${Q(t)}`)},vS=(e,t)=>({impure:new Set(e.filter(e=>Kh(e,t,`varying`))),streamed:new Set(e.filter(e=>Kh(e,t,`streamed`)))}),yS=e=>[...e.facts.ids.keys()].some(t=>Kh(t,e)),bS=e=>[...e.facts.ids.keys()].some(t=>Kh(t,e,`repeated`)),xS=e=>typeof e==`object`&&(e.kind===`FilteredSet`||e.kind===`LazyFunction`)&&`rebind`in e,SS=e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),CS=e=>t=>{let n=e(t);return Vc(n,e(SS(t)))},wS=(e,t,n,r)=>i=>{r.expressions.push(e);let a=hu.sets,o=hu.callStack,s=a??[],c=s.length;hu.sets=s,hu.callStack=r;try{let a=t(i),o=xS(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&Kb(e)&&r.sources.set(o,e),o}catch(t){t instanceof u&&!r.isFrozen&&(r.expressions.length=0,r.isFrozen=!0);let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=qb(e,r.values),a=i&&!gt(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!Is(a)?void 0:a;throw TS(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,hu.sets=a,hu.callStack=o}},TS=(e,t,n)=>{let r=[...new Set(t)].flatMap(t=>{let n=typeof t==`object`?e.sources.get(t):void 0;return n?[n]:[]});if(r.length>0&&n instanceof w){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},ES=(e,t,n)=>{if(!(n instanceof w))return;e.isFrozen||e.expressions.push(t),e.isFrozen=!0;let r=e.fingerprint;e.fingerprint={sources:[t,...r?.sources??[]],reason:r?.reason??n.message}},DS=e=>({...e,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),OS=(e,t,n)=>{let r=e.location.range,i=e.prefixEnds;if(!n||e.isBulleted||!r||!i||t.length<3)return;let a=i.slice(0,t.length-2).map(t=>({...e,location:{...e.location,range:{...r,end:t}}})).reverse(),o=e.kind===`And`;return r=>{n.expressions.push(...a);for(let i=0;i<t.length;i++){i>=2&&!n.isFrozen&&n.expressions.pop();let s=t[i](r);if(typeof s!=`boolean`)throw $b(e,i,s);if(s!==o)return n.isFrozen||(n.expressions.length-=a.length-Math.max(i-1,0)),s}return o}},kS=(e,t,n,r)=>i=>{if(r.expressions.at(-1)===e)return n(i);r.expressions.push(...t);try{return n(i)}finally{r.isFrozen||(r.expressions.length-=t.length)}},AS=(e,t,n)=>r=>{let i=n.current;if(i===-1||!n.covered.has(e))return t(r);let a=yf(n,i,e);bf(n,a),n.current=a;try{let i=t(r),o=e.kind===`SetEnumeration`||(e.kind===`SetFilter`||e.kind===`SetMap`)&&Fs(i)||e.kind===`SetFilter`&&typeof i==`object`&&i.kind===`FilteredSet`||(e.kind===`FunctionSet`||e.kind===`RecordSet`)&&typeof i==`object`&&i.kind===e.kind||e.kind===`Apply`&&e.operator===`SUBSET`&&typeof i==`object`&&i.kind===`Subset`;return typeof i==`object`&&o&&n.values.set(i,a),i}finally{n.current=i}},jS=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=lC(e,t),i=t.callStack,a=i&&Tp.get(e),o=i?wS(e,r,t,i):r,s=i&&a?kS(e,a,o,i):o,c=t.coverage,l=c?AS(e,s,c):s;return t.evaluators.set(e,l),l},MS=(e,t)=>{if(t.callStack||t.coverage)return jS(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=vg(e,t)??jS(e,t);return t.entryEvaluators.set(e,r),r},$=(e,t)=>MS(e,t.environment)(t),NS=(e,t)=>{let n=e.name,r=M(e)?void 0:uS(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw ox(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`){let e=r.definition,n;return r=>(n??=qx(e,t))(r)}return t=>_S(n,e,t)},PS=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||M(e))return!0;let n=$x(e.name,t);return n===void 0||nS(n)===0},FS=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>$(e,t),expression:e})),IS=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(FS(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&PS(t[0],n)){let e=jS(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&PS(t[0],n)&&PS(t[1],n);if(i&&a){let e=jS(t[0],n),r=jS(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(sS(t,n),n)},LS=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw cS(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:dS(e,n));return n=>{let a=e.scope;for(let e=0;e<t.length;e++){let o=i[e],s=o?o(n):{kind:`Operator`,operator:rS(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},RS=(e,t,n)=>{let r=LS(e,t,n),i;return t=>(i??=MS(e.body,n),i({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},zS=e=>{for(let t=e;t!==void 0;t=t.parent){let e=t.binding;if(e.kind!==`Operator`||e.operator.kind!==`Closure`||e.operator.params.length===0)return!1;let n=e.operator.scope;for(;n!==void 0&&n!==t;)n=n.parent;if(n!==t)return!1}return!0},BS=/* @__PURE__ */ new Set([`\\cup`,`\\cap`,`\\`]),VS=(e,t)=>{let n=e.args;if(e.operator===`=>`){let r=jS(n[0],t),i=jS(n[1],t);return t=>!hx(r(t),e,`P`)||hx(i(t),e,`Q`)}if(e.operator===`~`&&n.length===1){let r=jS(n[0],t);return t=>gx(r(t),e)}if(e.operator===`<=>`){let r=jS(n[0],t),i=jS(n[1],t);return t=>_x(r(t),i(t),e)}if(e.operator===`~>`||e.operator===`-+->`)return()=>{throw Xb(e.operator===`~>`?`a ~> b`:`a -+-> formula`,e)};let r=M(e)?void 0:$x(e.operator,t);if(r?.kind===`Closure`)return RS(r,n,t);if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=jS(n[0],t),i=nx(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=!wp.has(e)&&!Zh(n[0],t),a=t.tlcEvalValues;return t=>{if(!i||!zS(t.scope))return r.evaluate(FS(n,t),t);let o=a.get(e);if(o!==void 0)return o;let s=r.evaluate(FS(n,t),void 0);return a.set(e,s),s}}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&r.evaluateBinary&&n.length===2){let i=jS(n[0],t),a=jS(n[1],t),o=rx(e,r.evaluateBinary),s=t.coverage;return s?e=>{let t=i(e),n=a(e);if(typeof t!=`object`||t.kind!==`Set`||!s.values.has(t))return o(t,n);let r=t.elements.findIndex(e=>!vu(e,n));return Sf(s,t,(r===-1?t.elements.length:r)+1),r===-1}:e=>o(i(e),a(e))}let i=t.coverage,a=r?.kind===`Builtin`?r.evaluateBinary:void 0;if(i&&a&&BS.has(e.operator)&&n.length===2){let r=jS(n[0],t),o=jS(n[1],t);return t=>{let n=r(t),s=o(t);return Cf(i,e.operator,n,s,a(n,s))}}if(r?.kind===`Builtin`)return IS(r,n,t);if(e.operator===`\\cdot`&&n.length===2)return()=>{throw new w(t.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let o=n.map(e=>dS(e,t));return r=>{let i=tS(e.operator,r);if(i)return pS(i,n,r,o);throw t.definitions.get(e.operator)?.kind===`Function`?new w(`${e.operator} is a function; apply it with brackets`):new w(`Unknown operator ${e.operator} at ${Jb(e)}`)}},HS=(e,t)=>{let n=e.kind===`Forall`,r=jS(e.body,t),i=e.bounds[0],a=t.coverage;if(a)return t=>Mx(e.bounds,t,a,i=>vx(r(px(t,i)),e)!==n)?!n:n;if(e.bounds.length===1&&i.pattern.kind===`Name`){let a=i.pattern.name,o=jS(i.set,t);return s=>Dx(Tx(o(s),i.set,t.runtime.version),t=>vx(r(px(s,lx(s.scope,a,t))),e)!==n)?!n:n}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let i=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``);return a=>{let s=Ox(o,e=>Tx(jS(e,t)(a),e,t.runtime.version)),c=(t,o)=>t<0?vx(r(px(a,o)),e)!==n:Dx(s[t],e=>c(t-1,lx(o,i[t],e)));return c(o.length-1,a.scope)?!n:n}}return t=>jx(o,t,i=>vx(r(px(t,i)),e)!==n)?!n:n},US=(e,t)=>{if(e.kind===`Tuple`)return Il(e.names.map(e=>{let n=cx(t,e);return n?.kind===`Value`&&n.value}));let n=cx(t,e.name);return n?.kind===`Value`?n.value:void 0},WS=/* @__PURE__ */ new WeakSet,GS=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&WS.add(e)},KS=/* @__PURE__ */ new WeakMap,qS=e=>{if(KS.has(e))return KS.get(e);let t=/* @__PURE__ */ new Set,n=e=>{if(e.kind===`Subexpression`)return!1;let r=_t(e);return r!==void 0&&t.add(r),e.kind===`ExceptAt`&&t.add(`@`),gt(e).every(n)},r=n(e)?[...t]:void 0;return KS.set(e,r),r},JS=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=cx(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),YS=e=>WS.has(e),XS=(e,t)=>{let n=YS(e),r=jS(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=e=>r(px(t,lx(t.scope,n,e)));if(Ms(e))return cu(e),Ns(e,i),f(e,t);let o=Pl(e),s=Ac(o,o.map(i));return Fs(e)?s:(s.lambdaDomain=e,Pc(s))}let n=[],s=Ox(i,(n,r)=>Ex(i.length>1&&typeof e==`object`&&e.kind===`ProductSet`?e.factors[r]:e,n,t.environment.runtime.version));return Ax(i,s,t.scope,e=>{let o=i.length===1?US(a.pattern,e)??!1:Il(i.map(t=>US(t.pattern,e)??!1));return n.push([o,r(px(t,e))]),!1}),Tl(n)},c=zx(i,e.body),l=Hx(i),u=qS(e.body),d=t.coverage,f=(n,a)=>{let o=JS(a.scope,u),s=px(a,o),f=e=>r(px(s,Px(i,o,e))),p=d&&!t.callStack?d.current:-1,m=Ix({value:Vx(n,d?e=>d.current===-1?f(e):xf(d,p,()=>f(e)):f,Bx(c,i,n),l),bounds:i,body:e.body,scope:o});return i.length===1?Pc(m):m},p=t.callStack;return{build:(t,r)=>{if(e.isRecursive||n||r.isKeepLazy||!W(t))return f(t,r);if(!(i.length===1?Fs(t):typeof t==`object`&&t.kind===`ProductSet`&&t.factors.every(Fs))){if(p)return f(t,r);try{return s(t,r)}catch(e){if(!(e instanceof w))throw e;return f(t,r)}}if(!p)return s(t,r);try{return s(t,r)}catch(t){throw ES(p,e,t),t}},createLazy:f}},ZS=(e,t)=>{let n=XS(e,t).build,r=e.bounds,i=t.coverage;if(i)return t=>{let a=Nx(r,t),o=n(a,t),s=r.length===1||typeof a!=`object`||a.kind!==`ProductSet`?[a]:a.factors;return(typeof o!=`object`||o.kind!==`LazyFunction`)&&s.every(Fs)&&i.current!==-1&&i.covered.has(e)&&Pf(i,i.current,s),o};if(r.length===1&&r[0].pattern.kind===`Name`){let e=jS(r[0].set,t);return t=>n(e(t),t)}return e=>n(Nx(r,e),e)},QS=(e,t)=>{let n=WS.has(e);n&&GS(e.function);let r=jS(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>jS(e,t))}),value:jS(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):Il(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(px(i,lx(i.scope,`@`,e))):Bu(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i=!1;n=o(n,r.path,0,t,e=>(i=!0,r.value(e))),i||t.environment.runtime.warn(Jo.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${Q(e.function)}`)}return n}},$S=(e,t)=>{let n=jS(e.predicate,t),r=e.bound.pattern,i=Zb(e.predicate),a=e.predicate.location.range&&{names:r.kind===`Name`?r.name:r.names.join(`, `),predicate:i},o=t.coverage,s=(t,n,c,l)=>{let u=(e,t)=>{if(r.kind===`Tuple`&&pu(e)?.length!==r.names.length)throw new w(`Attempted to check if the value:\n${U(q(e))}\nis an element of a set of ${r.names.length}-tuples.`);let a=c(px(n,ux(n.scope,r,e)));if(typeof a!=`boolean`)throw new w(`${t?`The evaluation of predicate`:`Evaluating predicate`} ${i} yielded non-Boolean value.`);return a},d=r=>s(t,{...n,environment:r},jS(e.predicate,r),-1);return!o||l===-1?{kind:`FilteredSet`,base:t,test:u,source:a,rebind:d}:{kind:`FilteredSet`,base:t,test:(e,t)=>xf(o,t?-1:l,()=>u(e,t)),startPass:e=>{let n=Ef(o,t);return r=>{n?.next(),Of(o,t,r),o.secondary[l]++;let i=xf(o,l,()=>u(r,!1));return e&&i&&o.secondary[l]++,i}},source:a,rebind:d}};return(e,t,r=-1)=>s(e,t,n,r)},eC=e=>M(e)||e.kind===`OperatorReference`||gt(e).some(eC),tC=(e,t)=>e.bound.pattern.kind===`Name`&&!t.coverage&&!eC(e.predicate)&&!Gh([e.predicate],t,`varying`),nC=(e,t)=>{if(typeof e!=`boolean`)throw new w(`Attempted to evaluate an expression of form {x \\in S : P(x)} when P was ${mp(e)}.\n${Zb(t.predicate)}`);return e},rC=(e,t,n,r)=>{if(!Ps(e)||gc(e))throw new w(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${Q(t)}`);return hl(e),Ex(e,n,r)},iC=e=>new w(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${Q(e)}`),aC=(e,t)=>{if(e.kind===`SetFilter`){let n=jS(e.predicate,t),r=jS(e.bound.set,t),i=$S(e,t),a=e.bound.pattern,o=t.coverage,s=tC(e,t);return t=>{let c=r(t);if(!Fs(c))return i(c,t,o?.current);let l=[],u=c.kind===`Interval`?c:G(c).elements,d=Array.isArray(u)?u.length:u.high-u.low+1;for(let r=0;r<d;r++){let i=Array.isArray(u)?u[r]:u.low+r,o=n(px(t,ux(t.scope,a,i)));if(nC(o,e))js(l,i);else if(s)break}return o&&Sf(o,c,d+1),kc(l)}}if(e.kind===`SetMap`){let n=jS(e.expression,t),r=t.coverage;return t=>{let i=[],a=e=>(js(i,n(px(t,e))),!1);return r?Mx(e.bounds,t,r,a):jx(e.bounds,t,a),bl(i)}}let n=e.set;if(!n)return()=>{throw new w(`TLC attempted to evaluate an unbounded CHOOSE.\nMake sure that the expression is of form CHOOSE x \\in S: P(x).\n${Q(e)}`)};let r=jS(e.body,t),i=jS(n,t),a=t.coverage;return t=>{let o=i(t),s=rC(o,e,n,t.environment.runtime.version),c=a&&jf(a,o,s,!0),l,u=e.pattern;if(Dx(s,n=>{if(c?.next(),u.kind===`Tuple`&&pu(n)?.length!==u.names.length)throw new w(`Attempted to compute the value of an expression of form\nCHOOSE <<x1, ... , xN>> \\in S: P, but S was not a set\nof N-tuples.\n${Q(e)}`);let i=ux(t.scope,u,n);return vx(r(px(t,i)),e)?(l=US(u,i),!0):!1}),l!==void 0)return l;throw c?.next(),iC(e)}},oC=e=>[...e].sort((e,t)=>Cc(e.name,t.name)),sC=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),cC=(e,t)=>{let n=oC(e),r=e.map(e=>jS(e.value,t));if(sC(n))return t=>Ll(e.map((e,n)=>[e.name,r[n](t)]));let i=n.map(e=>e.name),a=e.map(e=>e.name);if(a.some((e,t)=>e!==i[t])){let t=n.map(t=>e.indexOf(t));return e=>Ks(i,t,r.map(t=>t(e)),a)}return e=>Rl(i,r.map(t=>t(e)))},lC=(e,t)=>{let n=e=>jS(e,t);switch(e.kind){case`Number`:{let t=e.value;return Bs(t)?()=>t:()=>{throw ax(e)}}case`Decimal`:return()=>{throw ix(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return NS(e,t);case`Apply`:return VS(e,t);case`Bracket`:return()=>{throw new w(`A bracket without a function or subscript is not an expression at ${Jb(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new w(`An operator cannot be used as a value at ${Jb(e)}`)};case`And`:{let r=e.operands.map(n);return OS(e,r,t.callStack)??(t=>{for(let n=0;n<r.length;n++){let i=r[n](t);if(typeof i!=`boolean`)throw $b(e,n,i);if(!i)return!1}return!0})}case`Or`:{let r=e.operands.map(n);return OS(e,r,t.callStack)??(t=>{for(let n=0;n<r.length;n++){let i=r[n](t);if(typeof i!=`boolean`)throw $b(e,n,i);if(i)return!0}return!1})}case`Prime`:{let t=n(e.expression);return e=>t(SS(e))}case`Unchanged`:return CS(n(e.expression));case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw Qb(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({source:e.condition,condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t){let t=e.condition(n);if(typeof t!=`boolean`)throw new w(`A non-boolean expression (${mp(t)}) was used as a condition of a CASE. ${Zb(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new w(`Attempted to evaluate a CASE with no conditions true.\n${Q(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(px(n,gS(e.definitions,n)))}case`Forall`:case`Exists`:return HS(e,t);case`UnboundedQuantifier`:return()=>{let t=e.quantifier===`Forall`?`\\A`:`\\E`;throw e.isTemporal?Xb(e.quantifier===`Forall`?`\\AA`:`\\EE`,e):new w(`TLC attempted to evaluate an unbounded ${t}.\nMake sure that the expression is of form ${t} x \\in S: P(x).\n${Q(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return aC(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>bl(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>Il(t.map(t=>t(e)))}case`FunctionConstruction`:return ZS(e,t);case`FunctionSet`:{let t=n(e.domain),r=n(e.range);return e=>({kind:`FunctionSet`,domain:t(e),range:r(e)})}case`Record`:return cC(e.fields,t);case`RecordSet`:{let t=oC(e.fields),r=t.map(e=>e.name),i=t.map(t=>e.fields.indexOf(t)),a=e.fields.map(e=>n(e.value));return i.every((e,t)=>e===t)?e=>({kind:`RecordSet`,names:r,sets:a.map(t=>t(e))}):e=>{let t=a.map(t=>t(e));return{kind:`RecordSet`,names:r,sets:i.map(e=>t[e])}}}case`Except`:return QS(e,t);case`ExceptAt`:return t=>{let n=cx(t.scope,`@`);if(n?.kind!==`Value`)throw new w(`@ appears outside an EXCEPT at ${Jb(e)}`);return n.value};case`FunctionApplication`:{GS(e.function);let r=n(e.function),i=t=>dx(r(fx(t)),e),a=e.args.map(n),o=tx(t.runtime.version);if(a.length===1){let e=a[0];return t=>Lu(i(t),e(t),o)}return e=>Lu(i(e),Il(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=ex(e);return e=>r(t(e))}case`Product`:{let t=e.factors.map(n);return e=>({kind:`ProductSet`,factors:t.map(t=>t(e))})}case`BoxAction`:case`AngleAction`:{let t=n(e.action),r=CS(n(e.subscript)),i=e.kind===`BoxAction`,a=i?`[A]_e`:`<A>_e`;return n=>{let o=t(n);if(typeof o!=`boolean`)throw new w(`Attempted to evaluate an expression of form ${a}, but A was not a boolean.\n${Q(e)}`);return i?o||r(n):o&&!r(n)}}case`Enabled`:{let t=e.expression;return e=>Lb(t,e)}case`Label`:return n(e.body);case`Selection`:return n(e.expression);case`Subexpression`:return()=>{throw new w(`The subexpression reference at ${Jb(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw Xb(Yb[e.kind],e)}}},uC=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},dC=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Zu(e[t]),16777619),r=Math.imul(r^rd(e[t]),1540483477);t[0]=uC(n)||1,t[1]=uC(r)},fC=()=>{let e=/* @__PURE__ */ new Int32Array(8192),t=0,n=(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}},r=()=>{let t=e,r=new Int32Array(t.length*2);for(let e=0;e<t.length;e+=2){if(t[e]===0)continue;let i=n(r,t[e],t[e+1]);r[i*2]=t[e],r[i*2+1]=t[e+1]}e=r};return{insert:(i,a)=>{t*4>=e.length&&r();let o=n(e,i,a);return e[o*2]!==i&&(e[o*2]=i,e[o*2+1]=a,t++,!0)}}},pC=e=>({slots:new Int32Array(1<<17),size:0,shift:16,states:e}),mC=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Hu(t,Zu(e[n]));return t&1073741823},hC=(e,t)=>{for(let n=0;n<t.length;n++)if(!Uc(e[n],t[n]))return!1;return!0},gC=(e,t)=>Math.imul(t,2654435761)>>>e.shift<<1,_C=(e,t,n)=>{let r=e.slots.length-1;for(let i=gC(e,t);;i=i+2&r){let r=e.slots[i+1];if(r===0)return-1;if(e.slots[i]===t&&hC(e.states[r-1],n))return r-1}},vC=(e,t,n)=>{let r=e.slots.length-1,i=gC(e,t);for(;e.slots[i+1]!==0;)i=i+2&r;e.slots[i]=t,e.slots[i+1]=n},yC=(e,t,n)=>{if(e.size++,e.size*4>e.slots.length){let t=e.slots;e.slots=new Int32Array(t.length*2),e.shift--;for(let n=0;n<t.length;n+=2)t[n+1]!==0&&vC(e,t[n],t[n+1])}vC(e,t,n+1)},bC=(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}},xC=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),SC=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return bC(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},CC=e=>Atomics.load(e.used,0)*2>=e.slots.length,wC=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&bC(t,n);return{slots:t,used:e.used}},TC={kind:`Boolean`,value:!0},EC={kind:`Boolean`,value:!1},DC=e=>e?TC:EC,OC=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,kC=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,AC=(e,t)=>({kind:e,body:t}),jC=(e,t,n)=>({kind:e,operands:[t,n]}),MC=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?MC(e,t.operands).operands:[t])}),NC=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return NC(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,NC(t)),0)}},PC=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 PC(e.body);case`And`:case`Or`:return e.operands.some(PC)}},FC=/* @__PURE__ */ new WeakMap;let IC=0;const LC=e=>{let t=FC.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`#${IC++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(LC).join(`,`)})`;default:return`${e.kind}(${LC(e.body)})`}})();return FC.set(e,n),n},RC=(e,t)=>e===t||LC(e)===LC(t),zC=(e,t)=>{let n=LC(t);return e.some(e=>e===t||LC(e)===n)},BC=e=>e===`And`?`Or`:`And`,VC=(e,t)=>{switch(e.kind){case`Boolean`:return t?DC(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?AC(`Not`,e):e;case`Not`:return VC(e.body,!t);case`And`:case`Or`:return MC(t?BC(e.kind):e.kind,e.operands.map(e=>VC(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return AC(n,VC(e.body,t))}}},HC=e=>{switch(e.kind){case`Boolean`:return DC(!e.value);case`Not`:return e.body;case`And`:case`Or`:return MC(BC(e.kind),e.operands.map(HC));case`Always`:return AC(`Eventually`,HC(e.body));case`Eventually`:return AC(`Always`,HC(e.body));default:return AC(`Not`,e)}},UC=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=UC(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return DC(t)}return n.length===0?DC(!t):n.length===1?n[0]:MC(e.kind,n)}case`Not`:{let t=UC(e.body);return t.kind===`Boolean`?DC(!t.value):AC(`Not`,t)}case`Always`:case`Eventually`:{let t=UC(e.body);return AC(e.kind,t.kind===e.kind?t.body:t)}default:return e}},WC=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,GC=e=>{switch(e.kind){case`And`:{let t=[],n=1;for(let r of e.operands){let e=GC(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n*=e.operands.length,n>2147483647))throw new w(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n===1)return{kind:`And`,operands:t};let r=Array.from({length:n},()=>[]),i=1,a=n;for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}a/=e.operands.length;let t=0;for(let n=0;n<i;n++)for(let n of e.operands)for(let e=0;e<a;e++)r[t++].push(n);i*=e.operands.length}return{kind:`Or`,operands:r.map(e=>MC(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=GC(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=WC(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:MC(`Or`,t);n.push(AC(`Always`,AC(`Eventually`,e)))}return MC(`Or`,n)}case`Not`:return OC(e.body)?e:GC(HC(e.body));default:return e}},KC=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?KC(e.operands[0]):MC(e.kind,e.operands.map(KC));case`Not`:return e.body.kind===`Not`?KC(e.body.body):AC(`Not`,KC(e.body));case`Always`:case`Eventually`:case`Next`:return AC(e.kind,KC(e.body));default:return e}},qC=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return qC(e.operands[0]);let t=Math.floor(e.operands.length/2);return jC(e.kind,qC(MC(e.kind,e.operands.slice(0,t))),qC(MC(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return AC(e.kind,qC(e.body));default:return e}},JC=(e,t)=>{e.kind===`Eventually`&&!zC(t,e)&&t.push(e),`body`in e&&JC(e.body,t),`operands`in e&&e.operands.forEach(e=>JC(e,t))},YC=e=>{let t=e.filter(kC),n=e.flatMap(e=>e.kind===`Not`&&kC(e.body)?[e.body]:[]);return!t.some(e=>zC(n,e))},XC=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,AC(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new w(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},ZC=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:AC(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},QC=(e,t,n)=>e.flatMap(e=>{let r=ZC(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),$C=e=>[...new Set(e.map(LC))].sort().join(`|`),ew=(e,t)=>{let n=new Set(t.map($C));return[...e.filter(e=>!n.has($C(e))),...t]},tw=e=>{let t=XC(e),n=QC(t,`Always`,`And`),r=QC(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=ZC(t,`Eventually`,`Or`);if(n&&!(zC(e,n.first)||zC(e,n.second)))return ew(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(zC(e,t.first)||zC(e,t.second))&&!zC(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!YC(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=ZC(t[e],`Always`,`And`);n&&(zC(t,n.first)||t.push(n.first),zC(t,n.second)||t.push(n.second))}let r=!0;for(;r;){r=!1;for(let e of n)zC(t,e.first)&&zC(t,e.second)&&!zC(t,e.whole)&&(t.push(e.whole),r=!0)}return t.length>e.length&&!YC(t)?[]:i(t)};return a(e)},nw=e=>({particle:e,successors:[],statePredicates:e.filter(e=>NC(e)<=1)}),rw=e=>{let t=tw([e]).map(nw),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=$C(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 tw(n)){let n=$C(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(nw(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},iw=(e,t)=>!zC(e,t)||zC(e,t.body),aw=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&NC(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=WC(e);if(n){let e=NC(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(PC(e))throw new w(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},ow=(e,t)=>{let n=e.findIndex(e=>RC(e,t));return n===-1?(e.push(t),e.length-1):n},sw=e=>{let t=GC(UC(VC(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=KC(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])aw(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:MC(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:RC(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&qC(e.formula),n=[];t&&JC(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>ow(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>ow(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>ow(i,e))}));return{tableau:t&&rw(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},cw=()=>v(new w(`Temporal formula is a tautology (its negation is unsatisfiable).`),b.livenessEvaluationFailure),lw=/* @__PURE__ */ new Set([`~>`,`-+->`]),uw=/* @__PURE__ */ new WeakSet,dw=/* @__PURE__ */ new Map([[`/\\`,`And`],[`\\/`,`Or`]]),fw=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),pw=(e,t)=>new w(`TLC cannot handle the temporal formula ${Q(e)}${t===void 0?``:`:\n${t}`}`),mw=(e,t,n,r=/* @__PURE__ */ new Set,i=/* @__PURE__ */ new Set)=>{let a=(e,t,r)=>{if(i.has(e))return 0;i.add(e);let a=mw(t,r,n,/* @__PURE__ */ new Set,i);return i.delete(e),a},o=e=>{let n=cx(t,e);if(!n)return;if(n.kind===`Value`)return 0;if(n.kind===`Thunk`)return n.isReleased?0:a(n,n.expression,n.scope);let r=n.operator;return r.kind===`Closure`?a(r,r.body,r.scope):0},s=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=yx(e,n);if(t)return Jh(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isActionLevel?2:r.isStateLevel&&!r.isLevelConstant?1:0},c=(e,t)=>r.has(e)?0:M(t)?o(e)??s(e)??0:s(e)??o(e)??0,l=e=>{let a=0;return Np(e,(e,o)=>(a=Math.max(a,mw(e,t,n,o.length===0?r:/* @__PURE__ */ new Set([...r,...o]),i)),e)),a};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:l(e);case`Identifier`:return c(e.name,e);case`OperatorReference`:return c(e.operator,e);case`Apply`:{if(lw.has(e.operator))return 3;if(e.operator===`\\cdot`)return 2;let r=c(e.operator,e),i=Math.max(r,l(e)),o=M(e)?void 0:$x(e.operator,n);return i===r||o?.kind!==`Closure`||o.params.length!==e.args.length?i:a(o,o.body,fS(o,e.args,fw(n,t)))}default:return l(e)}},hw=(e,t)=>{try{return kx(e,t)}catch(e){if(!(e instanceof w))throw e;if(!as(e))return;throw v(new w(`${a}${e.message}`),b.error)}},gw=(e,t,n,r,i={name:void 0,path:[],expanding:/* @__PURE__ */ new Set,isSubstituted:!1})=>{let a=(e,t,a=i.name,o=i.expanding,s)=>gw(e,t,n,r,{name:a,path:s?.kind===`Operator`&&s.params.length===0?[...i.path,s.name]:i.path,expanding:o,isSubstituted:i.isSubstituted||s!==void 0&&n.substitutedDefinitions.has(s)});if(e.kind===`And`)return e.operands.flatMap(e=>a(e,t,Q(e)));if(e.kind===`Label`)return a(e.body,t);if(e.kind===`Selection`)return a(e.expression,t);if(e.kind===`Let`)return a(e.body,_w(e,t,n));if(e.kind===`Identifier`){let r=M(e)?cx(t,e.name):void 0;if(r?.kind===`Thunk`&&!r.isReleased)return a(r.expression,r.scope,uw.has(r)?e.name:i.name);let o=n.constants.has(e.name)?void 0:yx(e.name,n);if(!r&&o?.kind===`Operator`&&o.params.length===0&&(Jh(o,n)>0||Jx(o,n)===void 0)){if(i.expanding.has(o))throw h();return a(o.body,void 0,!i.isSubstituted&&n.instanceNames.get(e.name)||o.name,/* @__PURE__ */ new Set([...i.expanding,o]),o)}}let o=fw(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||mw(e,t,n)===3)){let t=eS(e,o),r=M(e)?void 0:yx(e.operator,n),s=t?.kind===`Closure`&&t.params.every(e=>n.instanceParams.has(e));if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&(!i.isSubstituted||s))return a(t.body,fS(t,e.args,o),i.isSubstituted&&r?r.name:e.operator,i.expanding,r)}let s=r&&e.kind===`Forall`&&e.bounds.every(e=>mw(e.set,t,n)===0),c=s?hw(e.bounds,o):void 0;if(s&&c){let n=[];if(Ax(e.bounds,c,t,t=>(n.push(...a(e.body,t,Q(e.body))),!1)),n.length===0)throw cw();return n}return[{expression:e,scope:t,name:i.name,path:i.path}]},_w=(e,t,n)=>{let r=gS(e.definitions,fw(n,t),vS(e.definitions,n));for(let n=r;n&&n!==t;n=n.parent){n.binding.kind===`Thunk`&&uw.add(n.binding);let t=n.name,r=e.definitions.find(e=>e.name===t);r&&Zd.set(n,r)}return r},vw=(e,t,n)=>{let r=n.runtime.version===`1.7.4`,a=(e,t,i)=>{let a=i===0&&!r?mw(e,t,n):i;if(a===0){let r=$(e,fw(n,t));if(typeof r!=`boolean`)throw new w(`TLC expected a boolean value, but did not find one. ${Zb(e)}`);return DC(r)}return a===1?{kind:`State`,expression:e,scope:t}:e.kind===`AngleAction`?{kind:`Action`,expression:e.action,subscript:e.subscript,scope:t}:{kind:`Action`,expression:e,subscript:void 0,scope:t}},o=0,s=(e,t,r,i)=>{if(o>=100)throw h();o++;let s=p(e,t);o--;let c=NC(s),l=c===0&&mw(r,i,n)>2;return c>2||l?s:a(r,i,c)},c=(e,t)=>{let i=e.kind===`Identifier`?e.name:e.operator,a=fw(n,t),o=M(e)||yx(i,n)===void 0?cx(t,i):void 0;if(o?.kind===`Thunk`&&!o.isReleased&&uw.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:M(e)?tS(i,a):$x(i,n),u=e.kind===`Apply`?e.args:[],f=c?.kind===`Builtin`&&u.length===2?dw.get(c.name):void 0;if(f){let n=u.map(e=>p(e,t));return d(e,t,MC(f,n))}if(c?.kind!==`Closure`)throw pw(e);let m=!M(e)&&yx(i,n)?.isRecursive===!0;return l(e,()=>(r&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>$(e,a)),s(c.body,fS(c,u,a),e,t)),m)},l=(e,t,n=!1)=>{try{return t()}catch(t){let a=t instanceof i||n&&!r;throw!(t instanceof w)||a?t:pw(e)}},u=(e,t)=>{let r=mw(e,t,n),o=[],s=e.kind===`Forall`;try{jx(e.bounds,fw(n,t),t=>(o.push(p(e.body,t)),!1))}catch(n){if(!(n instanceof w)||n instanceof i)throw n;if(r<=2)return a(e,t,r);throw pw(e,s&&!as(n)?n.message:void 0)}return o.length===0?DC(s):d(e,t,MC(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=NC(n);return r>2?n:a(e,t,r)},f=(e,t)=>{let n=e.operands,r=e.location.range,i=e.prefixEnds;return e.isBulleted||!r||!i?d(e,t,MC(e.kind,n.map(e=>p(e,t)))):n.slice(1).reduce((a,o,s)=>{let c=s===n.length-2?e:{...e,operands:n.slice(0,s+2),prefixEnds:i.slice(0,s+1),location:{...e.location,range:{...r,end:i[s]}}};return d(c,t,MC(e.kind,[a,p(o,t)]))},p(n[0],t))},p=(e,t)=>{let i=mw(e,t,n);switch(e.kind){case`Label`:return p(e.body,t);case`Selection`:return p(e.expression,t);case`Let`:return p(e.body,_w(e,t,n));case`Apply`:{let n=e.args;if(e.operator===`~`&&!M(e))return d(e,t,AC(`Not`,p(n[0],t)));if(e.operator===`=>`)return d(e,t,jC(`Or`,AC(`Not`,p(n[0],t)),p(n[1],t)));break}case`And`:case`Or`:return f(e,t);case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!r&&mw(e.condition,t,n)===0){let r=$(e.condition,fw(n,t));if(typeof r==`boolean`)return p(r?e.consequent:e.alternative,t)}let i=p(e.condition,t);return d(e,t,jC(`Or`,jC(`And`,i,p(e.consequent,t)),jC(`And`,AC(`Not`,i),p(e.alternative,t))))}}if(i<=2)return a(e,t,i);switch(e.kind){case`Identifier`:return c(e,t);case`Apply`:return e.operator===`~>`?AC(`Always`,jC(`Or`,AC(`Not`,p(e.args[0],t)),AC(`Eventually`,p(e.args[1],t)))):c(e,t);case`Always`:case`Eventually`:return AC(e.kind,p(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n={kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.action.location},r={kind:`Enabled`,step:e.enabled??n,scope:t},i=AC(`Not`,r),a={kind:`Action`,expression:e.action,subscript:e.subscript,scope:t,enabled:r};return e.kind===`WeakFairness`?AC(`Always`,AC(`Eventually`,jC(`Or`,i,a))):jC(`Or`,AC(`Eventually`,AC(`Always`,i)),AC(`Always`,AC(`Eventually`,a)))}default:throw pw(e)}};return p(e,t)},yw=e=>({holdsState:(t,n)=>{let r={environment:e,scope:t.scope,state:n,next:void 0},i=t.kind===`State`?$(t.expression,r):Lb(t.step,r);if(typeof i!=`boolean`)throw new w(`A state predicate was evaluated to a non-boolean value.`);return i},holdsAction:(t,n,r)=>{let i=t.scope,a=t.subscript;if(a&&gl($(a,{environment:e,scope:i,state:n,next:void 0}),$(a,{environment:e,scope:i,state:r,next:void 0})))return!1;let o=$(t.expression,{environment:e,scope:i,state:n,next:r});if(typeof o!=`boolean`)throw new w(`Encountered an action predicate that's not a boolean.`);return o}}),bw=(e,t,n,r,i)=>{let a=e=>bw(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=r.holdsState(e,t);return i.set(e,a),a}case`Action`:return e.enabled&&i.get(e.enabled)===!1?!1:n!==void 0&&r.holdsAction(e,t,n);case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return bw(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new w(`TLC cannot evaluate a temporal formula in a single step`)}},xw=(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)=>xw(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 bw(e,t[r],t[a(r)],yw(i),/* @__PURE__ */ new Map)}},Sw=`UnnamedAction`,Cw={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},ww=e=>{let t=e.range??Cw;return Ll([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},Tw=(e,t)=>{let n=[[`name`,e.name],[`location`,ww(e.location)]];return e.parameters.length>0&&n.push([`context`,Ll(e.parameters)],[`parameters`,Il(e.parameters.map(e=>e[0]))]),t!==void 0&&n.push([`coverage`,t]),Ll(n)},Ew=(e,t,n)=>({name:e,location:t.location,parameters:[],expression:t,scope:n}),Dw=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Ow=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,kw=e=>e.kind===`Apply`?e.args:[],Aw=(e,t,n)=>{let r=Ow(e);if(r===void 0)return;if(M(e)){let e=cx(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=$x(r,n);return i?.kind===`Closure`?i:void 0},jw=(e,t)=>{try{return $(e,Dw(t,void 0)),!0}catch(e){if(e instanceof y)return!1;throw e}},Mw=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&Uh(e,t)&&jw(e.body,t),Nw=(e,t)=>e?.kind===`Operator`&&e.body.kind!==`Number`&&e.body.kind!==`String`&&Mw(e,t),Pw=(e,t)=>{let n=yx(e.name,t);return n?.body===e.body&&Nw(n,t)},Fw=(e,t)=>{if(e.kind!==`Identifier`||!M(e))return;let n=cx(t,e.name);return n?.kind===`Thunk`?n:void 0},Iw=(e,t,n)=>{if(e.kind===`Let`)return{expression:e.body,scope:_w(e,t,n)};let r=Fw(e,t);return r&&{expression:r.expression,scope:r.scope}},Lw=(e,t,n,r)=>t.kind===`Apply`?fS(e,t.args,Dw(r,n)):e.scope,Rw=(e,t)=>(e?.params??[]).flatMap(e=>{let n=cx(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),zw=(e,t)=>{try{return e()}catch(e){if(e instanceof y)return t();throw e}},Bw=(e,t,n,r,i)=>{let a=kw(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return r&&a.length===0?[{...e,parameters:[],expression:r.body,scope:r.scope}]:r?a.some(e=>mw(e,n,i)!==0)?o():zw(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),$(e,Dw(i,n))]),expression:t,scope:n}],o):[{...e,parameters:[],expression:t,scope:n}]},Vw=(e,t,n,r,i)=>{let a=()=>({name:n?.name??Sw,location:e.location,parameters:Rw(n,t),expression:e,scope:t});if(Ty.has(e.kind))throw v(new w(`${l}The next state relation is not a boolean expression.\n${Zb(e)}`),b.error);switch(e.kind){case`Let`:return Vw(e.body,_w(e,t,r),n,r,i);case`Label`:return Vw(e.body,t,n,r,i);case`Selection`:return e.location.range===void 0?Vw(e.expression,t,n,r,i):[a()];case`Or`:return e.operands.flatMap(e=>Vw(e,t,n,r,i));case`Exists`:return zw(()=>{let o=[];return jx(e.bounds,Dw(r,t),t=>(o.push(...Vw(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=M(e)?void 0:i.get(Ow(e)??``),s=Aw(e,t,r);if(o)return Bw(o,e,t,s,r);if(!s)return[a()];let c=kw(e),u=M(e)?s.name===`$subexpression`?`LAMBDA`:s.name:r.instanceNames.get(Ow(e)??``)??s.name,d=()=>[{name:u,location:e.location,parameters:[],expression:e,scope:t}];return Pw(s,r)||c.some(e=>mw(e,t,r)!==0)?d():zw(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:$(n,Dw(r,t))},parent:e}),s.scope);return Vw(s.body,e,{...s,name:u},r,i)},d)},Hw=(e,t,n,r,i,a=[])=>{let o=(e,t,o=a)=>Hw(e,t,n,r,i,o),s=(e,t,n)=>Ew(e,Ep(t,a),n),c=Iw(e,t,n);if(c){o(c.expression,c.scope);return}let l=Aw(e,t,n);if(l&&Pw(l,n))return;let u=l?[...a,...Tp.get(l.body)??[]]:a;if(l&&l.params.length===0){if(mw(l.body,l.scope,n)===1){r.inits.push(s(l.name,l.body,l.scope));return}o(l.body,l.scope,u);return}if(l&&e.kind===`Apply`&&l.params.length===e.args.length){o(l.body,fS(l,e.args,Dw(n,t)),u);return}if(e.kind===`And`){e.operands.forEach(e=>o(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t,frames:a});return}r.temporals.push(s(Sw,e,t));return}let d=mw(e,t,n);d<=1?r.inits.push(s(Sw,e,t)):d===3&&r.temporals.push(s(Sw,e,t))},Uw=(e,t,n,r,i)=>{let a=(t,n)=>Uw(e,t,n,r,i),o=Iw(t,n,r);if(o){a(o.expression,o.scope);return}let s=Aw(t,n,r);if(s&&Pw(s,r))return;if(s&&s.params.length===kw(t).length){a(s.body,Lw(s,t,n,r));return}if(t.kind===`Forall`&&zw(()=>(jx(t.bounds,Dw(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(Ew(e,a)):mw(a,n,r)<2?i.invariants.push(Ew(e,a)):i.impliedTemporals.push(Ew(e,t));return}let c=mw(t,n,r);c<=1?i.impliedInits.push(Ew(e,t)):c===3&&i.impliedTemporals.push(Ew(e,t))},Ww=(e,t)=>{let n=yx(e,t);return n?.kind===`Operator`&&!Nw(n,t)?n:void 0},Gw=(e,t,n)=>{let r={inits:[],actions:[],temporals:[]},i=[],a=e.specification===void 0?void 0:Ww(e.specification,t);a&&(Hw(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...e.frames.length>0?[{name:Sw,location:e.frames[0].location,parameters:[],expression:Ep(e.expression,e.frames),scope:e.scope}]:Vw(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:$x(e.init,t);o?.kind===`Closure`&&r.inits.push(Ew(e.init??``,o.body));let s=e.next===void 0?void 0:$x(e.next,t);return s?.kind===`Closure`&&r.actions.push(...Vw(s.body,s.scope,s,t,n)),r},Kw=(e,t,n)=>{let r=[],i=(e,t)=>{if(e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`)return!1;if(e.kind===`Tuple`)return e.elements.every(e=>i(e,t));if(e.kind===`Label`)return i(e.body,t);if(e.kind===`Selection`)return i(e.expression,t);let a=Iw(e,t,n);if(a)return i(a.expression,a.scope);let o=e.kind===`Identifier`&&M(e)?cx(t,e.name):void 0;if(o?.kind===`Value`&&o.argument)return i(o.argument,t);if(e.kind===`Identifier`&&!M(e)&&n.variableIndex.has(e.name))return r.push(e.name),!0;let s=Aw(e,t,n);if(!s||s.params.length!==kw(e).length)return!0;let c=yx(s.name,n);return c?.body===s.body&&Mw(c,n)?!0:i(s.body,Lw(s,e,t,n))};return i(e,t)?r:void 0},qw=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>q(e[1])).join(`,`)})`,Jw=(e,t,n=!1)=>`${e.name===Sw?n?`Initial predicate`:`Action`:e.name}${t===`1.7.4`?``:qw(e)} ${m(e.location.range??Cw)}`,Yw=e=>`${e.name}${qw(e)}`,Xw=(e,t,n,r)=>{let i={invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]};t.invariants.forEach(e=>{let t=Ww(e,n);t&&i.invariants.push(Ew(e,t.body))}),t.properties.forEach(e=>{let t=Ww(e,n);t&&Uw(e,t.body,void 0,n,i)});let a=n.coverage,o=(e,t)=>yl(e.map(e=>{let n=a&&t&&Yf(a,t,e.expression);return Tw(e,n&&Ll(n))})),s=e=>yl(e.flatMap(e=>{let t=Ww(e,n);return t?[Ll([[`name`,t.name],[`location`,ww(t.location)]])]:[]}));return Ll([[`inits`,o(e.inits,`init`)],[`actions`,o(e.actions,`next`)],[`temporals`,o(e.temporals)],[`invariants`,o(i.invariants,`invariant`)],[`impliedinits`,o(i.impliedInits,`implied`)],[`impliedactions`,o(i.impliedActions,`implied`)],[`impliedtemporals`,o(i.impliedTemporals)],[`variables`,yl(n.variables.map((e,t)=>Ll([[`name`,e],[`location`,ww(r[t])],...a?[[`coverage`,Ll([[`distinct`,Lf(a,t)]])]]:[]])))],[`actionconstraints`,s(t.actionConstraints)],[`constraints`,s(t.constraints)]])},Zw=2**50,Qw=2**51,$w=(e,t,n,r)=>({fingerprint:e,tableau:t,position:n,stateChecks:r,successors:[],actionChecks:[],stepPositions:[],number:0}),eT=(e,t,n,r)=>{e.successors.push(t),e.actionChecks.push(n),e.stepPositions.push(r)},tT=(e,t)=>e.stepPositions[e.successors.indexOf(t)],nT=e=>{let t=e[e.length-1];return--e.length,t},rT=(e,t,n,r)=>{let i={initial:[],isPartial:!1},a=t.tableau;if(!a){let t=/* @__PURE__ */ new Map,r=$w(e[0],-1,0,n.getStates(0));eT(r,r,n.getStutters(0),0),t.set(e[0],r),i.initial.push(r);for(let i=1;i<e.length;i++){let a=t.get(e[i]);if(a===void 0){let a=$w(e[i],-1,i,n.getStates(i));eT(a,a,n.getStutters(i),i),eT(r,a,n.getSteps(i),i),t.set(e[i],a),r=a}else r.successors.includes(a)||eT(r,a,n.getSteps(i),i),r=a}return i}let o=/* @__PURE__ */ new Map,s=e=>{let t=o.get(e)??[];return o.set(e,t),t},c=(t,o,s,c,l,u)=>{for(let d=0;d<t.length;d++){let f=t[d],p=a.nodes[f.tableau].successors;for(let t=0;t<p.length;t++){let a=p[t],d=s[a];if(d===void 0){if(!n.isConsistent(a,c))continue;let t=$w(e[c],a,c,l);eT(f,t,u,c),o.push(t),s[a]=t}else f.successors.includes(d)||eT(f,d,u,c),d.position!==c&&(i.isPartial=!0,r&&!o.includes(d)&&o.push(d))}}},l=s(e[0]),u=n.getStates(0),d=n.getStutters(0);for(let t=0;t<a.initialCount;t++){if(!n.isConsistent(t,0))continue;let r=$w(e[0],t,0,u);i.initial.push(r),l[t]=r}for(let e of i.initial)for(let t of a.nodes[e.tableau].successors){let n=l[t];n?eT(e,n,d,0):i.isPartial=!0}let f=[...i.initial];r&&c(f,f,l,0,u,d);for(let t=1;t<e.length;t++){let r=s(e[t]),i=n.getStates(t),a=[];c(f,a,r,t,i,n.getSteps(t)),c(a,a,r,t,i,n.getStutters(t)),f=a}return i},iT=(e,t,n)=>{let r=t.promises,i=t.tableau?.nodes??[],a=[],o=1,s=Zw+1,c=Qw+1,l=s,u=c,d=s,f=c,p=t.models[0],m,h=(e,t)=>{let n=e.actionChecks[t],r=p.eventuallyAlways;for(let e=0;e<r.length;e++)if(!n[r[e]])return!1;return!0},g=t=>{let n=[],a=c-1,o=p.infinitelyOftenStates,s=p.infinitelyOftenActions,l=o.map(()=>!1),u=s.map(()=>!1),d=r.map(()=>!1),f=o.length+s.length+r.length,m=t;for(;f>0;){m.number=c;let e=f;search:for(;;){for(let e=0;e<o.length;e++)!l[e]&&m.stateChecks[o[e]]&&(l[e]=!0,f--);for(let e=0;e<r.length;e++)!d[e]&&iw(i[m.tableau].particle,r[e])&&(d[e]=!0,f--);if(f<=0)break;let t,p,h=f;for(let e=0;e<m.successors.length;e++){let r=m.successors[e],i=r.number;if(a<=i&&i<=c){t=r;for(let t=0;t<s.length;t++)!u[t]&&m.actionChecks[e][s[t]]&&(u[t]=!0,f--)}if(f<h){n.push(m),m=r,c++;break search}a<=i&&i<c&&(p=r)}if(f<e&&t){n.push(m),m=t,c++;break}for(;p===void 0;){m=nT(n);for(let e=0;e<m.successors.length;e++){let t=m.successors[e];if(a<=t.number&&t.number<c){n.push(m),p=t;break}}}n.push(m),m=p,m.number=c}}c++,m.number=c;close:for(;m!==t;){let e=!1;for(let r=0;r<m.successors.length;r++){let i=m.successors[r];if(a<=i.number&&i.number<c){if(n.push(m),i===t)break close;e=!0,m=i,m.number=c;break}}e||(m=nT(n))}n.length===0&&n.push(m);let h=[];for(let n=0;n<=t.position;n++)(n===0||e[n]!==e[n-1])&&h.push(n);let g=h.length;for(let e=1;e<n.length;e++)n[e].fingerprint!==n[e-1].fingerprint&&h.push(tT(n[e-1],n[e]));let _=n[n.length-1];return{positions:h,cyclePosition:g,backPosition:_.fingerprint===t.fingerprint?void 0:tT(_,t)}},_=e=>{let t=p.infinitelyOftenStates,n=p.infinitelyOftenActions,a=t.map(()=>!1),o=n.map(()=>!1),s=r.map(()=>!1),l=[e];for(e.number++;l.length>0;){let e=nT(l);for(let n=0;n<t.length;n++)a[n]||(a[n]=e.stateChecks[t[n]]);for(let t=0;t<e.successors.length;t++){let r=e.successors[t],i=r.number;if(i>=c)for(let r=0;r<n.length;r++)o[r]||(o[r]=e.actionChecks[t][n[r]]);i===c&&(r.number++,l.push(r))}for(let t=0;t<r.length;t++)iw(i[e.tableau].particle,r[t])&&(s[t]=!0)}c+=2,m!==void 0||a.includes(!1)||o.includes(!1)||s.includes(!1)||(m=g(e))},v=e=>{let t=e.successors.indexOf(e);return t!==-1&&d<=e.number&&h(e,t)},y=e=>{let t=nT(a);if(t===e&&!v(e))return e.number=c++,!1;for(t.number=c;t!==e;)t=nT(a),t.number=c;return!0},ee=e=>{let t=s++;e.number=t,a.push(e);for(let n=0;n<e.successors.length;n++){let r=e.successors[n],i=r.number;d<=i&&h(e,n)&&((i<l||f<=i&&i<u)&&(i=ee(r)),i<t&&(t=i))}return t===e.number&&y(e)&&_(e),t},b=e=>{let t=nT(a);if(t===e&&!e.successors.includes(e)){e.number=Zw;return}let n=[];for(d=s++,f=c,t.number=d,n.push(t);t!==e;)t=nT(a),t.number=d,n.push(t);return n},x=e=>{let n=b(e);if(n)for(let e of t.models){p=e,l=s,u=c;for(let e=n.length-1;e>=0;e--)n[e].number<u&&ee(n[e])}},te=e=>{let t=o++;e.number=t,a.push(e);for(let n=0;n<e.successors.length;n++){let r=e.successors[n],i=r.number===0?te(r):r.number;i<t&&(t=i)}return t===e.number&&x(e),t};for(let e of n)if(e.number===0&&te(e),m)return m},aT=(e,t,n,r,i)=>{let a=/* @__PURE__ */ new Map,o=(t,n,i)=>(a.clear(),bw(t,e[n],i===void 0?void 0:e[i],r,a)),s=e.map((e,t)=>t),c=e.map((e,t)=>t);if(i){let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map;for(let i=0;i<e.length;i++){let a=n.get(t[i])??i;if(n.set(t[i],a),hC(e[a],e[i])&&(s[i]=a),i===0)continue;let o=s[i-1]*e.length+s[i];c[i]=r.get(o)??i,r.set(o,c[i])}}let l=n.map(e=>{let t=[],n=[],r=[],a=[],l=e.tableau?.nodes.map(e=>e.statePredicates)??[];return{getStates:n=>{let r=s[n];return t[r]??=e.stateChecks.map(e=>o(e,r,void 0))},getSteps:t=>{let r=c[t];return n[r]??=e.actionChecks.map(e=>o(e,r-1,r))},getStutters:t=>{let n=s[t];return r[n]??=e.actionChecks.map(e=>o(e,n,n))},isConsistent:(e,t)=>{let n=s[t],r=a[n]??=[],c=i?r[e]:void 0;return c===void 0?(r[e]=l[e].every(e=>o(e,n,void 0)),r[e]):c}}}),u=[];for(let e=0;e<n.length;e++){let r=rT(t,n[e],l[e],!1),i=iT(t,n[e],r.initial);if(i)return i;r.isPartial&&u.push(e)}for(let e of u){let r=rT(t,n[e],l[e],!0),i=iT(t,n[e],r.initial);if(i)return i}},oT=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return oT(e.body);case`And`:case`Or`:return e.operands.some(oT);default:return!1}},sT=e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0,cT=e=>e.promises.some(e=>oT(e.body))||e.models.some(e=>!sT(e)),lT=(e,t)=>e.every((e,n)=>Uc(e,t[n])),uT=e=>e.filter((t,n)=>n===0||e[n-1]!==t),dT=e=>({data:e(1024),length:0,create:e}),fT=(e,t,n,r=0,i=n.length-r)=>{let a=t+i;if(a>e.data.length){let t=e.create(Math.max(2*e.data.length,a));t.set(e.data),e.data=t}for(let a=0;a<i;a++)e.data[t+a]=n[r+a];e.length=Math.max(e.length,a)},pT=(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}},mT=e=>new Int32Array(e).fill(-1),hT=(e,t)=>(e.edgeStarts[t]??-1)!==-1,gT=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},_T=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,vT=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.edgeStarts.push(-1),e.edgeCounts.push(0),e.nextSiblings.push(-1),e.nodeStates.length-1),yT=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},bT=2**53-1,xT=(e,t,n)=>{let r=t.map(e=>vw(e.expression,e.scope,n)),i=e.map(e=>vw(e.expression,e.scope,n)),a=i.map(e=>AC(`Not`,e)),o=a.length===1?a[0]:MC(`Or`,a);return{formula:r.length===0?o:MC(`And`,[...r,o]),checks:i}},ST=e=>{switch(e.kind){case`State`:return[e];case`Enabled`:return[{expression:e.step,scope:e.scope}];case`Action`:return[e.expression,e.subscript].flatMap(t=>t?[{expression:t,scope:e.scope}]:[])}},CT=(e,t)=>{switch(e.kind){case`Boolean`:return;case`State`:case`Enabled`:case`Action`:t.add(e);return;case`And`:case`Or`:e.operands.forEach(e=>CT(e,t));return;default:CT(e.body,t)}},wT=e=>{let t=/* @__PURE__ */ new Set;for(let n of e)[...n.stateChecks,...n.actionChecks,...n.tableau?.nodes.flatMap(e=>e.statePredicates)??[]].forEach(e=>CT(e,t));return[...t]},TT=e=>wT(e).flatMap(e=>ST(e).map(e=>e.expression)),ET=(e,t)=>{let n=/* @__PURE__ */ new Set;CT(e,n);let r=[...n].flatMap(ST);return r.every(e=>e.scope===void 0)?!Gh(r.map(e=>e.expression),t,`repeated`):!bS(t)},DT=(e,t,n,r,i,a)=>[...new Set(e.filter((e,o)=>{try{return!xw(t[o],n,r,0,i)}catch(e){if(!a||!(e instanceof w))throw e;return a.push(e),!1}}).map(e=>e.name))],OT=(e,t,n)=>{if(e.length===0)return;let r=xT(e,t,n),i=sw(r.formula),a=yw(n),o=ET(r.formula,n);return{solutions:i,findTraceViolation:(t,s)=>{let c=aT(t,s,i,a,o);if(!c)return;let l=[],u=DT(e,r.checks,c.positions.map(e=>t[e]),c.cyclePosition-1,n,l);return{...c,properties:u,failures:l}}}},kT=(e,t,n,r)=>{if(e.length===0)return;let i=xT(e,t,n),a=ET(i.formula,n),o=sw(i.formula),s={atoms:yw(n),replay:void 0},c=AT(o,{atoms:{holdsState:(e,t)=>s.atoms.holdsState(e,t),holdsAction:(e,t,n)=>s.atoms.holdsAction(e,t,n)},isShared:a,isSame:lT,evaluateFrom:(e,t)=>{n.runtime.setLivenessSource(e);try{return t()}finally{n.runtime.setLivenessSource(void 0)}}},{getFingerprint:r.getFingerprint,forEachActionSuccessors:(e,t,n)=>r.forEachActionSuccessors(e,t,n,s.replay)},n.runtime.version!==`1.7.4`),l=(e,t)=>{if(e===void 0)return t();s.atoms=yw(e),s.replay=e;try{return t()}finally{s.atoms=yw(n),s.replay=void 0}};return{branches:c.branches,solutions:o,addInitialState:(e,t,n)=>l(n,()=>c.addInitialState(e,t)),addState:(e,t,n,r)=>l(r,()=>c.addState(e,t,n,r!==void 0)),storeState:c.storeState,getStateCounts:c.getStateCounts,findViolation:c.findViolation,getViolatedProperties:(t,r)=>DT(e,i.checks,t,r,n)}},AT=(e,t,n,r)=>{let i=/* @__PURE__ */ new Map,a=1,o=t.isShared,s=t.atoms,c=t.evaluateFrom,l=/* @__PURE__ */ new Map,u=[],d=e=>{let t=l.get(e)??l.size;return l.set(e,t),u[t]=e,t},f=e=>{if(e.kind===`State`||e.kind===`Enabled`)return[d(e)*2+1];if(e.kind===`Not`){let t=e.body;return t.kind===`State`||t.kind===`Enabled`?[d(t)*2]:void 0}if(e.kind!==`And`)return;let t=e.operands.map(f);return t.every(e=>e!==void 0)?t.flat():void 0},p=e=>new Int8Array(e*l.size).fill(-1),m=e=>new Int8Array(e*i.size).fill(-1),h=(e,t,n,r,i)=>o?e(t,n,r,i):e(t,p(1),0,i),g=e=>{switch(e.kind){case`Boolean`:{let t=e.value;return()=>t}case`State`:case`Enabled`:{let t=d(e);return(n,r,i)=>(r[i+t]===-1&&(r[i+t]=+!!s.holdsState(e,n)),r[i+t]===1)}case`Action`:{let t=e.enabled&&d(e.enabled);return(n,r,i,a)=>(t===void 0||r[i+t]!==0)&&a!==void 0&&s.holdsAction(e,n,a)}case`Not`:{let t=g(e.body);return(e,n,r,i)=>!t(e,n,r,i)}case`And`:{let t=e.operands.map(g);return(e,n,r,i)=>t.every(t=>t(e,n,r,i))}case`Or`:{let t=e.operands.map(g);return(e,n,r,i)=>t.some(t=>t(e,n,r,i))}case`Next`:{let t=g(e.body);return(e,n,r,i)=>t(i??e,p(1),0,void 0)}case`Always`:case`Eventually`:return()=>{throw new w(`TLC cannot evaluate a temporal formula in a single step`)}}},_=e.map(e=>({solution:e,checks:{states:e.stateChecks.map(g),actions:e.actionChecks.map(g),nodes:e.tableau?.nodes.map(e=>{let t=o?f({kind:`And`,operands:e.statePredicates}):void 0;return t?Int32Array.from(t):e.statePredicates.map(g)})??[]},actionIds:Int32Array.from(e.actionChecks,e=>{let t=LC(e),n=i.get(t)??i.size;return i.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:dT(e=>new Int32Array(e)),edgeActions:dT(e=>new Uint8Array(e)),stateResults:dT(e=>new Uint8Array(e)),initial:[],firstNodes:dT(mT),lastNodes:dT(mT),nextSiblings:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],stateCount:0,errorNode:void 0})),v=(e,t,n,r,i)=>c(t,()=>{let t=e.checks.states,a=new Uint8Array(t.length);return t.forEach((e,t)=>{a[t]=+!!h(e,n,r,i)}),a}),y=(e,t,n,r,i,a,s,l,u,d)=>c(t,()=>{let t=e.checks.actions;for(let c=0;c<t.length;c++){if(!o){u[d+c]=+!!h(t[c],n,r,i,a);continue}let f=l+e.actionIds[c];s[f]===-1&&(s[f]=+!!t[c](n,r,i,a)),u[d+c]=s[f]}}),ee=(e,t,n,r,i)=>{let a=e.checks.nodes[t];if(!(a instanceof Int32Array))return a.every(e=>h(e,n,r,i));for(let e=0;e<a.length;e++){let t=a[e],o=i+(t>>1);if(r[o]===-1&&(r[o]=+!!s.holdsState(u[t>>1],n)),r[o]!==(t&1))return!1}return!0},b=(e,t,n,r,i,a)=>c(n,()=>ee(e,t,r,i,a)),x=(e,t)=>{if(!r)return!1;let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},te=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=pT(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},S=(e,t,n,r)=>{let 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),pT(i,e[t]-1,e[t+1]))}if(i.slots.set([t+1,n,r],pT(i,t,n)),t<0)return r;let a=e.lastNodes.data[t]??-1;return a===-1?fT(e.firstNodes,t,[r]):e.nextSiblings[a]=r,fT(e.lastNodes,t,[r]),r},C=(e,t)=>t<0?e.checks.nodes.some((n,r)=>te(e,t,r)!==void 0):e.isDone[t]===!0||(e.firstNodes.data[t]??-1)!==-1,ne=(e,t,n)=>(C(e,t)||e.stateCount++,S(e,t,n,vT(e,t,n))),re=(e,t,n,r,i,a)=>{let o=e.edgeTargets.length,s=e.solution.actionChecks.length;fT(e.edgeTargets,o,n),i.forEach((t,n)=>fT(e.edgeActions,(o+n)*s,r,t*s,s)),fT(e.stateResults,e.nodeStates[t]*a.length,a),e.edgeStarts[t]=o,e.edgeCounts[t]=n.length},T={slots:/* @__PURE__ */ new Int32Array},ie=(e,r,i)=>{let o=[...i,{index:e,state:r}],s=16*a;T.slots=T.slots.length===s?T.slots.fill(0):new Int32Array(s);let c=e=>{let r=T.slots,i=o[e];for(let a=(n.getFingerprint(i)&2147483647)%r.length;;a=(a+1)%r.length){let n=r[a];if(n===0)return r[a]=e+1,!0;let s=o[n-1];if(s.index===i.index&&t.isSame(s.state,i.state))return!1}},l=0;for(let e=0;e<o.length;e++){if(l>=T.slots.length>>1){let e=T.slots;T.slots=new Int32Array(2*e.length+1);for(let t of e)t!==0&&c(t-1)}c(e)&&l++}T.slots.length>s&&a++;let u=[];for(let e of T.slots)e!==0&&u.push(o[e-1]);return u},ae=(e,t,r,a,o,s,c)=>{let l=v(e,a,r,s,c),u=t.nodes[e.nodeTableaux[o]],d=e.checks.actions.length,f=[],h=[],g=new Uint8Array(d);u.successors.length>0&&y(e,a,r,s,c,r,m(1),0,g,0);for(let n of u.successors){if(!b(e,n,a,r,s,c))continue;if(x(t,n)&&e.errorNode===void 0&&e.solution.models.some(sT)){e.errorNode=o;return}let i=te(e,a,n);if(i!==void 0&&h.includes(i))continue;let l=i??ne(e,a,n);h.push(l),f.push(0),i===void 0&&ae(e,t,r,a,l,s,c)}let _=[g],ee=1;if(n.forEachActionSuccessors(a,r,n=>{let o=m(n.length),l=new Uint8Array(n.length*d);_.push(l);for(let m=0;m<n.length;m++){let g=n[m],_=p(1);y(e,a,r,s,c,g.state,o,m*i.size,l,m*d);let v=e.isDone[g.index]===!0;for(let n of u.successors){if(!b(e,n,a,g.state,_,0))continue;let r=te(e,g.index,n);if(r!==void 0&&h.includes(r))continue;let i=r??ne(e,g.index,n);h.push(i),f.push(ee+m),r===void 0&&v&&ae(e,t,g.state,g.index,i,_,0)}}ee+=n.length}),h.length>0){let t=new Uint8Array(ee*d);for(let e=0,n=0;e<_.length;e++)t.set(_[e],n),n+=_[e].length;re(e,o,h,t,f,l)}},oe=(e,t,n,r,i,a,o)=>{let s=l.size,u=new Uint8Array(t.nodes.length*n.length);c(o,()=>{for(let i=0;i<t.nodes.length;i++)for(let t=0;t<n.length;t++)ee(e,i,n[t].state,r,t*s)&&(u[i*n.length+t]=1)}),C(e,o)||e.stateCount++,e.isDone[o]=!0;for(let c of yT(e,o)){let o=[],l=[];n.forEach((i,a)=>{let d=e.isDone[i.index]===!0;for(let f of t.nodes[e.nodeTableaux[c]].successors){if(u[f*n.length+a]===0)continue;let c=te(e,i.index,f);if(c!==void 0&&o.includes(c))continue;let p=c??ne(e,i.index,f);o.push(p),l.push(a),c===void 0&&d&&ae(e,t,i.state,i.index,p,r,a*s)}}),re(e,c,o,i,l,a)}return e.errorNode===void 0?void 0:ce(e,e.errorNode)},se=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)vT(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,n)=>{hT(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n))}),hT(e,i)||e.stateCount++,re(e,i,a,n,o,r)},E=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)hT(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 gT(e,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}hT(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new w(`Couldn't re-create liveness trace (path) starting at: ${t}`)},ce=(e,t)=>uT(E(e,t).reverse().map(t=>e.nodeStates[t])),D=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=(t,n,i)=>e.edgeActions.data[(e.edgeStarts[t]+n)*r+i]===1,a=(e,n)=>t.eventuallyAlways.every(t=>i(e,n,t)),o=new Float64Array(e.nodeStates.length).fill(-1),s=e.initial.filter(t=>hT(e,t)),c=[],l=t=>{let n=gT(e,t).indexOf(t);return n!==-1&&a(t,n)},u=(t,r)=>n.tableau!==void 0&&iw(n.tableau.nodes[e.nodeTableaux[t]].particle,r),d=r=>{let s=c.pop()??r;if(s===r&&!l(s)){o[s]=bT;return}let d=/* @__PURE__ */ new Set,p=/* @__PURE__ */ new Map;for(let t=s;;t=c.pop()??r){d.add(t);let n=p.get(e.nodeStates[t]);if(n?n.push(t):p.set(e.nodeStates[t],[t]),o[t]=bT,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...d].some(n=>_T(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...d].some(n=>gT(e,n).some((e,r)=>d.has(e)&&a(n,r)&&i(n,r,t)))),g=n.promises.every(e=>[...d].some(t=>u(t,e)));if(m&&h&&g)return f(r,d,p)},f=(r,o,s)=>{let c=ce(e,r),l=[],d=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g=f.length+m.length+h.length,_=r,v=e=>{l.push(_),_=e};for(;g>0;){let r=g;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&_T(e,_,t)&&(f[n]=!0,g--)}),n.promises.forEach((e,t)=>{!h[t]&&u(_,e)&&(h[t]=!0,g--)}),!(g<=0);){let n=-1,c=-1,u=g;if(gT(e,_).some((r,l)=>{if(s.has(e.nodeStates[r])){if(!o.has(r)||!a(_,l))return!1;n=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&i(_,l,e)&&(m[t]=!0,g--)})}return g<u?(v(r),d.clear(),!0):(o.has(r)&&!d.has(r)&&(c=r),!1)}))break;if(g<r){v(n),d.clear();break}for(;c===-1;){let t=l.pop();if(t===void 0)throw new w(`TLC failed to build the counterexample of a liveness property`);_=t,c=gT(e,t).find(e=>o.has(e)&&!d.has(e))??-1}v(c),d.add(c)}}let y=p(r,_,s);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];y[y.length-1]!==n&&y.push(n)}let ee=c[c.length-1];return y[y.length-1]===ee&&y.pop(),{prefix:c.slice(0,-1),cycle:[ee,...y.reverse()],isCycleConstrained:cT(n)}},p=(t,n,r)=>{if(n===t)return[];let i=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([i]),c=[];for(let n=i,l=-1,u=0;;u++){for(let u of r.get(n)??[])for(let[d,f]of gT(e,u).entries()){if(f===u||!a(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==i;)e.push(t),t=r,r=o.get(t)??-1;return e.push(i),e}let p=e.nodeStates[f];r.has(p)&&!s.has(p)&&(s.add(p),c.push([p,n]))}o.set(n,l);let d=c[u];if(d===void 0)throw new w(`TLC failed to build the counterexample of a liveness property`);n=d[0],l=d[1]}};for(let t=0;t<s.length;t++){let n=[s[t],-1,0],r=0;for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),l=n.pop()??0;if(i===-42){if(o[l]===t){let e=d(l);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(o[l]!==-1){n.push(Math.min(t,o[l]));continue}o[l]=r,n.push(t,l,-42),c.push(l);let u=r++;gT(e,l).forEach((t,r)=>{hT(e,t)&&(a(l,r)?o[t]===-1?n.push(t,-1):u=Math.min(u,o[t]):o[t]===-1&&s.push(t))}),n.push(u)}}};return{branches:_.length,addInitialState:(e,t)=>{let n=p(1);for(let r of _){let i=r.solution.tableau;if(!i)r.initial.push(e);else for(let a=0;a<i.initialCount;a++)b(r,a,void 0,t,n,0)&&r.initial.push(te(r,e,a)??ne(r,e,a))}},addState:(e,t,n,r)=>{let a=ie(e,t,n),o=p(a.length),s=a.findIndex(t=>t.index===e)*l.size,c=m(a.length);for(let n of _){let l=n.checks.actions.length,u=new Uint8Array(a.length*l);a.forEach((r,a)=>y(n,e,t,o,s,r.state,c,a*i.size,u,a*l));let d=v(n,e,t,o,s),f=n.solution.tableau;if(r&&(f?yT(n,e).some(e=>n.edgeCounts[e]>0):a.every(e=>hT(n,e.index))))throw new w(`The behavior graph holds every edge of the state already.`);if(!f){se(n,a,u,d,e);continue}let p=oe(n,f,a,o,u,d,e);if(p)return p}},storeState:(e,t)=>{for(let n of _){let r=n.solution.tableau;if(!r)continue;let i=[];for(let t=0;t<r.nodes.length;t++){let r=te(n,e,t);r!==void 0&&i.push(r)}for(let e of i.sort((e,t)=>e-t))n.nodeStates[e]=t,S(n,t,n.nodeTableaux[e],e)}},getStateCounts:()=>_.map(e=>e.stateCount),findViolation:()=>{for(let e of _)for(let t of e.solution.models){let n=D(e,t);if(n)return n}}}},jT=e=>{switch(e.kind){case`Number`:if(!Bs(e.value))throw v(new t(`TLC can't handle a number this big.\n${e.value}`),b.error);return e.value;case`String`:case`Boolean`:return e.value;case`ModelValue`:return Ec(e.name);case`Set`:return G({kind:`MixedSet`,elements:e.elements.map(jT)})}},MT=e=>{try{return jT(e)}catch(e){throw!(e instanceof w)||e instanceof t||e instanceof f?e:v(new w(`${l}${e.message}`),b.error)}},NT=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>q(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 w(`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`)&&Vc(t,r)})});if(t)return t[1];throw new w(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:q(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},PT=e=>new C(`In the configuration file, the identifier ${e} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`),FT=(e,t)=>{let n=e=>t.root.visible.get(e)?.key??e,r=t.root.constants.map(e=>e.name),i=t.root.variables,a=e=>{let n=t.moduleSymbols.get(e.module??``)?.get(e.name);return n?.kind===`Definition`?n:void 0},o=e=>{if(e.module===void 0)return[e.name,n(e.name)];let t=a(e);return t?[t.key]:[]},s=e=>e.module===t.root.module.name?[]:o(e),c=e=>{let n=t.definitions.get(e);return n?.kind===`Operator`?n.params.length:t.root.constants.find(t=>t.name===e)?.arity??t.builtins.get(e)?.arity??0},l=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Set,d=(e,n)=>{t.builtins.set(e,n),t.definitions.delete(e),l.delete(e),u.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=MT(e.value);ml(t),s(e).forEach(e=>{let n=c(e);n===0?l.set(e,t):d(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let f=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=f.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new C(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(jT),jT(e.value)]),f.set(t,n)}),f.forEach(e=>s(e).forEach(t=>d(t,NT(e.name,c(t),e.rows))));let p=new Map(e.substitutions.flatMap(e=>o(e).map(t=>[t,n(e.target)])));[...p.keys()].forEach(e=>l.delete(e));let m=(e,a,o)=>{let s=n(a),c=t.definitions.get(s);if(!(c!==void 0||t.builtins.has(s)||l.has(s)||r.includes(a)||i.includes(a)))throw new C(`The configuration file substitutes for ${e} with the undefined identifier ${a}.`);if(c?.kind===`Operator`&&c.params.length!==o)throw new C(`The configuration file substitutes for ${e} with ${a} of different number of arguments.`)};e.substitutions.filter(e=>e.module===void 0).forEach(n=>{let i=n.name,a=n.target;if(!r.includes(i)&&!t.root.visible.has(i))throw new C(`In the configuration file, the identifier ${i} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===a))throw PT(a);m(i,a,t.root.constants.find(e=>e.name===i)?.arity??t.root.visible.get(i)?.arity)});let h=e.substitutions.filter(e=>e.module!==void 0);[...t.moduleSymbols.keys()].forEach(e=>{let t=h.filter(t=>t.module===e);t.forEach(e=>{let n=a(e);if(n){if(t.some(t=>t.name===e.target))throw PT(e.target);m(e.name,e.target,n.arity)}});let n=t.find(e=>!a(e));if(n)throw new C(`In the configuration file, the identifier ${n.name} does not appear in the specification.`)});let g=h.find(e=>!t.moduleSymbols.has(e.module??``));if(g)throw new C(`In the configuration file, the module name ${g.module} is not a module in the specification.`);let _=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(s)),v=(e,n)=>{if(_.has(e))return{key:e,prefix:n};let r=t.copySources.get(e);return r&&v(r.source,n+r.prefix)};t.copySources.forEach((e,n)=>{let r=v(e.source,e.prefix),i=t.definitions.get(n);if(!r||!i)return;let a=i.kind===`Operator`?i.params:[],o=nm(n,r.key,a,a.slice(r.prefix),i.location);t.definitions.set(n,o),t.root.visible.forEach((e,r)=>{e.key===n&&r!==n&&t.definitions.set(r,o)})}),t.operatorConstants.forEach((e,t)=>l.set(t,e));let y=r.filter(e=>!l.has(e)&&!p.has(e)&&!u.has(e));if(y.length>0){let e=t.order.getDeclarationOrder(`constant`).find(e=>y.includes(e))??y[0];throw new C(`The constant parameter ${e} is not assigned a value by the configuration file.`)}return{constants:l,substitutions:p}},IT=`tlc2/value/impl/`,LT={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},RT={iconstM1:2,iconst0:3,iconst5:8,bipush:16,sipush:17,ldc:18,ldcW:19,dup:89,areturn:176,getstatic:178,invokespecial:183,invokestatic:184,new:187},zT=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n=0,r=e=>{let t=n;return n+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n)}},BT=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),VT=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],HT=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??BT.get(e[3])}${`[]`.repeat(e[1].length)}`),UT=(e,t)=>e[e[t].first].text,WT=(e,t)=>UT(e,t).replaceAll(`/`,`.`),GT=e=>{let t=zT(e);if(t.readUint32()!==3405691582)throw new s(`A module override is not a class file`);t.readUint16(),t.readUint16();let n=[],r=t.readUint16(),i=new TextDecoder;for(let e=1;e<r;e++){let r=t.readUint8(),a={tag:r,text:``,value:0,first:0,second:0};n[e]=a,r===LT.utf8?a.text=i.decode(t.readBytes(t.readUint16())):r===LT.integer?a.value=t.readInt32():r===LT.float?t.readUint32():r===LT.long||r===LT.double?(t.readBytes(8),e++):r===LT.class||r===LT.string||r===LT.methodType||r===LT.module||r===LT.package?a.first=t.readUint16():r===LT.methodHandle?(t.readUint8(),a.first=t.readUint16()):(a.first=t.readUint16(),a.second=t.readUint16())}t.readUint16();let a=WT(n,t.readUint16());t.readUint16(),t.readBytes(t.readUint16()*2);for(let e=t.readUint16();e>0;e--){t.readBytes(6);for(let e=t.readUint16();e>0;e--)t.readUint16(),t.readBytes(t.readUint32())}let o=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,s=i.indexOf(`)`),c=HT(i.slice(1,s)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:zT(t.readBytes(t.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>WT(n,d.readUint16())):[],p=VT.filter(t=>(e&t[0])!==0).map(e=>e[1]),m=HT(i.slice(s+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;o.push({name:r,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${a}.${r}(${c.join(`,`)})${h}`})}return{pool:n,methods:o}},KT=(e,t)=>{let n=e[t],r=e[n.second];return{className:UT(e,n.first),name:e[r.first].text}},qT=(e,t,n,r)=>{let i=()=>new p(`The Java override ${n}.${e.name} computes its value, which tla-ts cannot run`),a=e.code;if(!a)throw i();let o=[],s=()=>{let e=o.pop();if(e===void 0)throw i();return e},c=e=>{let n=t[e];if(n.tag===LT.integer)return n.value;if(n.tag===LT.string)return t[n.first].text;throw i()};for(let e=0;e<a.length;){let n=a[e],l=()=>a[e+1]<<8|a[e+2];if(n>=RT.iconstM1&&n<=RT.iconst5)o.push(n-RT.iconst0),e+=1;else if(n===RT.bipush)o.push(a[e+1]<<24>>24),e+=2;else if(n===RT.sipush)o.push(l()<<16>>16),e+=3;else if(n===RT.ldc)o.push(c(a[e+1])),e+=2;else if(n===RT.ldcW)o.push(c(l())),e+=3;else if(n===RT.dup){let t=s();o.push(t,t),e+=1}else if(n===RT.getstatic){let n=KT(t,l());if(n.className!==`${IT}BoolValue`||n.name!==`ValTrue`&&n.name!==`ValFalse`)throw i();o.push({kind:`Identifier`,name:n.name===`ValTrue`?`TRUE`:`FALSE`,location:r}),e+=3}else if(n===RT.invokestatic){let n=KT(t,l()),a=s();if(n.className!==`${IT}IntValue`||n.name!==`gen`||typeof a!=`number`)throw i();o.push({kind:`Number`,value:a,location:r}),e+=3}else if(n===RT.new)o.push({className:UT(t,l()),value:void 0}),e+=3;else if(n===RT.invokespecial){let n=KT(t,l()),a=s(),o=s();if(!(n.className===`${IT}StringValue`&&n.name===`<init>`&&typeof a==`string`&&typeof o==`object`&&`className`in o))throw i();o.value={kind:`String`,value:a,location:r},e+=3}else if(n===RT.areturn){let e=s();if(typeof e!=`object`)throw i();if(`className`in e){if(!e.value)throw i();return e.value}return e}else throw i()}throw i()},JT=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=GT(t),i=new Map(e.definitions.filter(e=>n||!e.isLocal).map(e=>[e.name,e.kind===`Operator`?e.params.length:0])),a=e=>i.get(e.name)===e.arity,o=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let n=r.methods.find(e=>e.name===t.name&&a(e));return n?{...t,body:qT(n,r.pool,e.name,t.location)}:t});return{module:{...e,definitions:o},overrides:r.methods.map(t=>({module:e.name,operator:t.name,signature:t.signature,isMatched:a(t)}))}},YT=/* @__PURE__ */ new WeakMap,XT=/* @__PURE__ */ new WeakSet,ZT=(e,t)=>{let n=Mp(e,t),r=YT.get(e);return r!==void 0&&YT.set(n,r),n},QT=(e,t)=>e.forEach(e=>{let n=t.find(t=>t.isRecursive&&t.name===e.name);n&&YT.set(n,e.arity)}),$T=e=>{switch(e.kind){case`Name`:return e.name;case`Operand`:return typeof e.operand==`number`?`argument selector ${e.operand}`:e.operand;case`Bound`:return`!(...)`;case`At`:return`@`;case`Colon`:return`:`}},eE=(e,t,n)=>({operator:e,range:t,args:n,params:n.map(()=>0)}),tE=(e,t)=>new s(`${e} at line ${t.line}, column ${t.column}`),nE=(e,t,n,r)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n,applications:r}:void 0;if(e.kind===`Let`)return nE(e.body,t,[...n,e.definitions],r);if(e.kind===`Lambda`||e.kind===`Selection`)return;let i=Xi.get(e),a=e.kind===`Apply`&&i===void 0||e.kind===`FunctionApplication`?[...r,e]:r;for(let o of gt(e).slice(0,i)){let i=e.kind===`FunctionApplication`&&o===e.function,s=nE(o,t,n,i?r:a);if(s)return s}},rE=e=>({line:e.line,column:e.column}),iE=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:rE(n)}),e),aE=(e,t)=>{let n=e.location;if(e.params.length===0)return t;if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw tE(`Selected an operator with operator parameters as an argument`,n);return{kind:`Lambda`,params:e.params.map(e=>e.name),body:t,location:n}}if(e.args.length!==e.params.length)throw tE(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:Ui,params:e.params,body:t,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:Ui,args:e.args,location:n,resolution:Hi},location:rE(n)}},oE=(e,t)=>t?.kind===`Operator`?t.params:mm.get(e.operator.slice(e.operator.lastIndexOf(`!`)+1))?.formals,sE=(e,t)=>{if(e.kind!==`Identifier`&&e.kind!==`OperatorReference`)return e;let n=e.kind===`Identifier`?e.name:e.operator,r=Array.from({length:t},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:r,body:{kind:`Apply`,operator:n,args:r.map(t=>({kind:`Identifier`,name:t,location:e.location,resolution:Hi})),location:e.location,...e.kind===`Identifier`&&{resolution:e.resolution}},operator:n,location:e.location}},cE=(e,t)=>{if(e.kind===`Function`)return mt(e,t);let n=e.body;if(n.kind!==`Let`||n.location.range||n.body.kind!==`Identifier`)return n;let r=n.body.name,i=n.definitions.find(e=>e.name===r);return i?.kind===`Function`?{...n,body:mt(i,!0)}:n},lE=(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:Hi})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Hi}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Hi};return aE({...t,params:[...t.params,...r]},iE(a,t.lets,n))},uE=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o=0,s=-1,c,l=!1,u=0,d=[],f=[],p,h=(e,t)=>{!p&&e&&(p={location:m(e),message:t})},g=(e,t,r=!1)=>{let i=n.selectorRanges?.[o];e&&i&&d.push({node:e,error:{location:m(i),message:t},isEmpty:r,applications:[...f]})},_=(e,t)=>{if(!e)throw tE(t,i);Gi.set(n,{applications:f,nulls:d,error:{location:m(e),message:t}}),Xi.set(n,u),l=!0},v=e=>a.lets.flat().findLast(t=>t.name===e)??t(e),y=e=>e.kind!==`Let`||e.location.range?e:(a.lets.push(e.definitions),y(e.body)),ee=r=>{let i=n.selectorRanges?.[o],a=[],s=[];for(;o<e.length;){let n=e[o];if(n.kind!==`Name`&&!r)return;if(n.kind===`Name`){a.push(n.name),s.push(...n.args);let e=a.join(`!`),i=r?r.find(t=>Ap(t)===e):t(e);if(i)return{definition:i,name:e,args:s,earlier:s.length-n.args.length}}o++}let c=n.selectorRanges?.[e.findLastIndex(e=>e.kind===`Name`)];return _(i&&c&&{...i,end:c.end},`Unknown operator: \`${a.join(`!`)}'.`)},b=t=>{let d=ee(t);if(!d){l=!0;return}let p=d.definition,m=YT.get(p)??sa(p),g=o===e.length-1;if(d.args.length!==m){let e=n.argumentRanges?.[o]??i.range,t=`The operator ${xt(d.name)} requires ${m-d.earlier} arguments.`;if(!r||d.args.length!==0)return u+=d.earlier,_(e,t);h(e,t)}if(u+=d.args.length,d.args.forEach((e,t)=>Ji.set(e,{operator:d.name,index:t,range:n.selectorRanges?.[o]})),g)return{definition:p,args:d.args};let v=p.location.range,y=YT.has(p)&&v?.module===i.range?.module&&aa(i,p.location);if(f.push({operator:d.name,range:n.selectorRanges?.[o],args:d.args,params:y?Array(m).fill(0):ca(p)}),p.isRecursive&&v&&v.module===i.range?.module&&aa(i,v.end))return _(n.selectorRanges?.[o],`Subexpression of \`${d.name}' used inside the operator's definition.`);a.params.push(...p.kind===`Operator`?p.params:[]),a.args.push(...d.args),c=cE(p,t!==void 0||XT.has(p)),s=o,o++},x=()=>{let t=c;for(;o<e.length&&!l;){let i=e[o];if(i.kind!==`Name`)return;let s=n.selectorRanges?.[o],l=t&&nE(t,i.name,[],[]),d=`Cannot find label \`${i.name}'.`;if(!l)return _(s,d);l.applications.forEach(e=>g(e,d,!0));let p=l.label.params;if(i.args.length!==p.length){let e=`Label \`${i.name}' used with wrong number of arguments.`;if(!r)return _(s,e);h(s,e)}u+=i.args.length,a.lets.push(...l.lets),a.params.push(...p.map(e=>({name:e,arity:0}))),a.args.push(...i.args),f.push(eE(i.name,s,i.args));let m=e[o+1];t=l.label.body,c=m===void 0||m.kind===`Name`?l.label:l.label.body,o++}},te=t=>{if(!c)throw tE(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;let r=n.selectorRanges?.[o],s=`Choosing operand \`${$T(t)}' of subexpression with no operands.`;if(Gi.has(c)){_(r,s);return}if(Wi.has(c)&&g(c,s,!0),c=y(c),c.kind===`Label`){c=c.body,te(t);return}let l=`Nonexistent operand specified by \`${$T(t)}'.`;if(c.kind===`Let`){if(t.kind!==`Operand`||Pa(t.operand,1)!==0){_(r,`A LET/IN expression has only one operand.`);return}a.lets.push(c.definitions),c=c.body;return}if(c.kind===`Lambda`&&c.operator!==void 0){_(r,`Trying to select subexpression of an operator argument.`);return}if(c.kind===`Lambda`&&t.kind!==`Bound`&&t.kind!==`At`){let e=t.kind===`Operand`?t.operand:$T(t);_(r,`Cannot use !${e} to select subexpression of a LAMBDA.`);return}if(c.kind===`Lambda`&&t.kind===`Bound`&&t.args.length!==c.params.length){_(r,`Selector with ${t.args.length} arguments used for LAMBDA expression taking ${c.params.length} arguments.`);return}let d=Ra(c);if(d&&(t.kind===`Bound`||t.kind===`At`)){if(t.kind===`Bound`&&t.args.length!==d.names.length){_(r,`Selector with ${t.args.length} argument(s) used for quantifier with ${d.names.length} bound identifier(s).`);return}a.params.push(...d.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&(u+=t.args.length,a.args.push(...t.args),f.push(eE(``,r,t.args))),c=Wi.has(c)&&d.body.kind===`Selection`?d.body.expression:d.body;return}if(c.kind===`Case`){let i=[...c.arms,...c.other?[{condition:void 0,body:c.other}]:[]];if(o===e.length-1){_(r,`Subexpression of CASE must have form !i!j.`);return}let a=t.kind===`Operand`?i[Pa(t.operand,i.length)]:void 0;if(!a){_(r,l);return}o++;let s=e[o],u=s.kind===`Operand`?Pa(s.operand,2):-1,d=n.selectorRanges?.[o];if(u===-1){_(d,`Second selector for CASE subexpression must specify one of two operands.`);return}let f=u===0?a.condition:a.body;if(!f){_(d,`Selecting OTHER in a CASE statement.`);return}c=f;return}if(c.kind===`Except`&&t.kind===`Operand`&&Pa(t.operand,c.updates.length+1)>0){_(r,`Selecting subexpression of an EXCEPT not yet implemented.`);return}let p=d?d.sets:Ba(c);if(!p&&c.kind!==`Identifier`){_(r,`Selecting subexpression of expression that has none.`);return}if(t.kind!==`Operand`){_(r,l);return}let m=Pa(t.operand,p?.length??0),h=p?.[m];if(!h){_(r,l);return}let ee=c.kind===`Apply`?oE(c,v(c.operator))?.[m]?.arity??0:0;c=ee>0?sE(h,ee):h},S=b(void 0);if(l)return n;if(S)return lE(S.definition,{...a,args:S.args});for(x();o<e.length&&!l;){let t=e[o];if(t.kind===`Name`){for(;c?.kind===`Label`;)c=c.body;if(c&&=y(c),c?.kind!==`Let`)return _(n.selectorRanges?.[o-1],`A name selector here must be from a LET clause.`),n;a.lets.push(c.definitions);let e=b(c.definitions);if(l)return n;if(e)return lE(e.definition,{...a,args:[...a.args,...e.args]});x()}else{if(t.kind===`Colon`&&e[o-1].kind!==`Name`)return _(n.selectorRanges?.[o-1],`!: should not follow an operand selector.`),n;if(t.kind===`Colon`&&e[o+1]?.kind!==`Name`&&(s!==o-1||o!==e.length-1))return _(n.selectorRanges?.[o],`\`!:' can be used only after a name and either at the end after an
|
|
1793
|
+
operator name or before an operator name.`),n;t.kind!==`Colon`&&(g(c,`Subexpression selection failed, probably due to an error in the selected expression.`),g(c,`Choosing operand \`${$T(t)}' of subexpression with no operands.`,!0)),te(t),g(c,`An unexpected null node specified by '${$T(e[o])}'.\nThis is probably due to a previous error.`),o++}}if(l)return n;if(!c)throw tE(`Subexpression selection failed`,i);if(c.kind===`Lambda`&&!r)return _(i.range,`Selected operator argument when expression expected.`),n;let C=a.params.length,ne=a.args.length;if(C!==ne){let e=`Expected ${C} arguments but found ${ne}.`;if(!r||ne>0)return _(i.range,e),n;h(i.range,e)}let w=c.kind===`Lambda`?{...c,body:iE(c.body,a.lets,i)}:iE(c,a.lets,i),re=e=>({kind:`Selection`,expression:e,location:a.params.length===0&&w.kind!==`Lambda`?i:rE(i)}),T=aE(a,w.kind===`Lambda`?{...w,body:Wi.has(c)?w.body:re(w.body),location:i}:re(w));return Yi.set(T,d),p&&Ki.set(T,p),T},dE=(e,t,n,r)=>{if(!e.includes(`!`)||r(e))return;let i=e.split(`!`);if(i.some((e,t)=>r(i.slice(0,t+1).join(`!`))))return Fa(e,t,n)},fE=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||gt(e).some(fE),pE=(e,t,n,r=!1)=>{if(!fE(e))return e;if(e.kind===`Let`){e.recursive&&QT(e.recursive,e.definitions),e.definitions.forEach(e=>XT.add(e));let r=[],i=n=>r.find(e=>e.name===n)??e.definitions.find(e=>e.name===n)??t(n),a=t=>!e.definitions.some(e=>e.name===t)&&n(t);e.definitions.forEach(e=>{let t=ZT(e,e=>pE(e,i,a));XT.add(t),r.push(t)});let o={...e,definitions:r,body:pE(e.body,i,a)};return o.instances?{...o,instances:o.instances.map(e=>mE(e,i,a))}:o}let i=e.kind===`Apply`?oE(e,t(e.operator)):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>pE(e,t,n,i!==void 0&&i[r]?.arity!==0))}:Np(e,e=>pE(e,t,n)),o=gt(e),s=gt(a).every((e,t)=>e===o[t])?e:a,c=s.kind===`Subexpression`?s.selectors:s.kind===`Identifier`?dE(s.name,[],void 0,t):s.kind===`Apply`?dE(s.operator,s.args,s.argumentCounts,t):void 0,l=c?.[0],u=t=>{Xi.set(e,t),Xi.set(s,t)};if(!c)return s.kind===`Apply`&&s.operator.includes(`!`)&&!t(s.operator)&&u(0),s;let d=c.findIndex(e=>e.kind!==`Name`),f=c.slice(0,d===-1?c.length:d),p=f.some((e,n)=>n>0&&t(f.slice(0,n+1).map($T).join(`!`)));if(l?.kind===`Name`&&n(l.name)&&!p)return s;if(l?.kind===`Name`&&c[1].kind!==`Name`&&!t(l.name))return u(0),s;let m=uE(c,t,s,r),h=Xi.get(s);h!==void 0&&u(h);let g=di.get(e);return g&&m!==s&&di.set(m,g),m!==s&&Wi.set(m,s),m},mE=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:pE(e.expression,t,n,!0)}))}),hE=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},gE=(e,t)=>mE(e,hE(t.definitions),()=>!1),_E=(e,t)=>{let n=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),r=e.theorems.flatMap(e=>{let t=e.statement;if(e.name===void 0||t.kind!==`AssumeProve`)return[];let n=t.assumptions.filter(e=>e.kind!==`NewSymbol`&&e.kind!==`AssumeProve`);return n.length===t.assumptions.length?[{kind:`Operator`,name:e.name,params:[],body:{kind:`Tuple`,elements:[...n,t.conclusion],location:t.location},isLocal:!0,isRecursive:!1,location:e.location}]:[]}),i=/* @__PURE__ */ new Set([...e.definitions,...r]);QT(e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]),e.definitions);let a=new Map(e.units.flatMap(e=>e.kind===`Recursive`?e.declarations.map(e=>[e.name,e.location]):[])),o=(e,t)=>{let n=a.get(e.name);return aa(e.location,t)||e.isRecursive&&n!==void 0&&aa(n,t)},s=/* @__PURE__ */ new Map,c=(e,t)=>n=>{let r=e(n);if(!(!r||i.has(r)&&!o(r,t)))return s.get(r)??r},l=hE([...t,...e.definitions]),u=e=>n.has(e),d=hE([...t,...e.definitions,...r]),f=(e,t)=>pE(e,c(d,t),e=>u(e)&&r.every(t=>t.name!==e)),p=e=>{let t=t=>u(t)||!e(t),n=n=>pE(n,e,t),r=e=>{let t=e.map(e=>e.kind===`ModuleFact`?e:n(e));return qi.set(t,e),t},i=n=>n.map(n=>n.kind===`ModuleFact`?n:pE(n,e,t,!0)),a=e=>e.map(e=>({...e,set:n(e.set)})),o=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&n(e.set)}:o(e)),conclusion:n(e.conclusion)}:n(e),s=s=>{switch(s.kind){case`Use`:case`Hide`:return{...s,facts:r(s.facts),defs:i(s.defs)};case`Instance`:return mE(s,e,t);case`Define`:{let t=[],n=p(n=>t.find(e=>e.name===n)??e(n));return{...s,definitions:s.definitions.map(e=>{if(e.kind===`Instance`)return mE(e,n.lookup,n.isProofGoal);let r=ZT(e,n.resolveInProof);return t.push(r),r})}}case`Have`:case`Case`:return{...s,expression:n(s.expression)};case`Witness`:return{...s,expressions:s.expressions.map(n)};case`Take`:return{...s,bounds:a(s.bounds)};case`Pick`:return{...s,bounds:a(s.bounds),body:n(s.body)};case`Assert`:return{...s,statement:o(s.statement)};default:return s}},c=t=>{if(t?.kind===`By`)return{...t,facts:r(t.facts),defs:i(t.defs)};if(t?.kind!==`Steps`)return t;let n={lookup:e,resolveStep:s,resolveProof:c};return{...t,steps:t.steps.map(e=>{let t={...e,body:n.resolveStep(e.body),proof:n.resolveProof(e.proof)};if(t.body.kind===`Define`){let e=t.body.definitions.flatMap(e=>e.kind===`Instance`?[]:[e]),r=n.lookup;n=p(t=>e.find(e=>e.name===t)??r(t))}return t})}};return{lookup:e,isProofGoal:t,resolveInProof:n,resolveFacts:r,resolveDefs:i,resolveStatement:o,resolveStep:s,resolveProof:c}},m=e.definitions.some(e=>fE(e.body))||e.assumptions.some(e=>fE(e.expression));m&&[...e.definitions,...r].toSorted((e,t)=>oa(e.location,t.location)).forEach(e=>s.set(e,ZT(e,t=>f(t,e.location))));let h={...e,theorems:e.theorems.map(e=>{let t=p(c(l,e.location));return{...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:t.resolveStatement(e.statement),proof:e.proof&&p(c(l,e.proof.location)).resolveProof(e.proof)}}),uses:e.uses.map(e=>{let t=p(c(l,e.location));return{...e,facts:t.resolveFacts(e.facts),defs:t.resolveDefs(e.defs)}})};return m?{...h,definitions:e.definitions.map(e=>s.get(e)??e),assumptions:e.assumptions.map(e=>({...e,expression:f(e.expression,e.location)}))}:h},vE=(e,t)=>e.maxLevels[t]??3,yE=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=Sh({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return t.set(n,a),a},r=/* @__PURE__ */ new Map,i=t=>{let i=r.get(t);if(i)return i;let a=e(t),o=n(t),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=>Cm(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>Cm(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>wm(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=bm(e);t(n.operator,n.param)&&c.argParams.add(e)})};s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n)));let u=e=>{l(e,()=>!0),a.constants.forEach(t=>{e.params.has(t.name)&&Cm(c.constraints,t.name,2)})};return a.assumptions.forEach(e=>u(o.analyze(e,/* @__PURE__ */ new Map))),a.theorems.forEach(e=>e.statement.kind===`AssumeProve`?u(Ch(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),r.set(t,c),c};return t=>{let r=/* @__PURE__ */ new Map,a=m(t.location.range??{module:t.instancer,start:t.location,end:t.location}),o=e=>r.set(`${a}\n${e}`,{location:a,message:e}),s=e(t.module),l=i(t.module),u=n(t.instancer),d=/* @__PURE__ */ new Map;t.lets.forEach(e=>d.set(e.name,{kind:`Let`,definition:e,scope:d}));let f=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let n=t.substitutions.get(e.name);if(!n)return[];if(e.arity===0){let t=u.analyze(n,d);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=u.toOperand(n,d),i=r.kind===`Operator`?r.data:void 0;return[{...e,level:r.data.level,operator:i,isLeibniz:i===void 0||i.nonLeibniz.size===0}]}),p=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(f.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&o(p(e.name,e.maximumLevel)),e.isLeibniz||o(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),f.forEach(e=>{let n=l.constraints.get(e.name);n!==void 0&&e.level>n&&o(p(e.name,n));let r=e.operator;if(r)for(let n=0;n<e.arity;n++){let i=l.argConstraints.get(vm(e.name,n));i!==void 0&&vE(r,n)<i&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${n+1} of the operator ${r.name} \nmust be at least ${i}.`)}}),l.argParams.forEach(e=>{let n=bm(e),r=f.find(e=>e.name===n.operator)?.operator,i=f.find(e=>e.name===n.param);if(!r||!i)return;let a=vE(r,n.index);i.level>a&&o(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),r.size>0)throw c([...r.values()])}},bE=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],xE=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),SE=new Map(yt.flatMap(e=>e.map(t=>[t,e[0]]))),CE=e=>SE.get(e)??e,wE=()=>{let e=Array.from({length:11},()=>[]),t=8,n=/* @__PURE__ */ new Set,r=[],i=t=>{for(let n=e.length-1;n>=0;n--){let r=e[n];for(let e=r.length-1;e>=0;e--)t(r[e])}},a=()=>{let n=e.length*2+1,r=Array.from({length:n},()=>[]);i(e=>r[e.hash%n].push(e)),e=r,t=Math.floor(n*.75)};return{put:i=>{n.has(i.key)||(r.length>=t&&a(),e[i.hash%e.length].push(i),n.add(i.key),r.push(i))},inserted:r,ownStart:0,enumerate:()=>{let e=[];return i(t=>e.push(t)),e}}},TE=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:bi(e)&2147483647,kind:t,isLocal:n}),EE=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:CE(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:CE(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=t+2;for(;i<e.length&&e[i].text!==`)`;)i++;return{name:n.text,end:i+1}},DE=(e,t)=>{let n=[];for(let r=t;;){let t=EE(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},OE=e=>({line:e.line,column:e.column}),kE=(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(e[t-1]?.text!==`.`){if(a.text===`EXTENDS`){let n=DE(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},AE=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,jE={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},ME=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&AE(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&AE(e[n+1],e[n+2])?n+=AE(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=>jE[e])}"`:r.text)}return t},NE=e=>e[2]?.text,PE=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},FE=(e,t)=>e.find(e=>e.name===t)??e.map(e=>FE(e.modules,t)).find(Boolean),IE=e=>{let t=e===void 0?[]:tt(e),n;return{tokens:t,ranges:PE(t),getModule:()=>n??=e===void 0?gi(``):_i(e,t)}},LE=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=e===void 0?void 0:i.get(e);if(t)return t;let n=IE(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:t?.(i)??Tt.get(i)??pv.get(i)??mi(e,i),c=a(s),l=c.tokens,u=c.ranges.get(NE(l)??``)??{start:0,end:0},d={tokens:l,...u,getModule:c.getModule};return n.set(i??``,d),c.ranges.forEach((e,t)=>{e.start===u.start||r.has(t)||r.set(t,{tokens:l,...e,getModule:()=>FE(d.getModule().modules,t)??d.getModule()})}),d};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},RE=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=DE(t,e+1);i.push({location:OE(t[e]),apply:e=>r.forEach(t=>e.put(TE(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c=new Set(n.units.flatMap(e=>e.kind===`Constants`||e.kind===`Variables`?[`${e.location.line}:${e.location.column}`]:[])),l=0;t.slice(e.start,e.end).forEach((n,r)=>{let u=e.start+r;if(n.kind===`Separator`&&t[u+1]?.text===`MODULE`){if(l++,l===2){let e=t[u+2].text;i.push({location:OE(n),apply:t=>t.put(TE(e,`module`,!1))})}return}if(n.kind===`ModuleEnd`&&l--,l!==1||n.kind!==`Keyword`)return;let d=c.has(`${n.line}:${n.column}`);d&&(n.text===`CONSTANT`||n.text===`CONSTANTS`)&&o(u,`constant`),d&&(n.text===`VARIABLE`||n.text===`VARIABLES`)&&o(u,`variable`),n.text===`RECURSIVE`&&DE(t,u+1).every(e=>s.has(e))&&o(u,`definition`),xE.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(OE(n)),i.push({location:OE(n),apply:e=>e.put(TE(t[u+1].text,`theorem`,!1))}))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put(TE(t,`theorem`,!1))})});let u=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(u(e.location))return;let t=CE(e.name);i.push({location:e.location,apply:n=>n.put(TE(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{i.push({location:e.location,apply:t=>{let n=r(e.module).enumerate(),i=e.name===void 0?``:`${e.name}!`,a=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...a,...o].forEach(n=>{n.isLocal||t.put(TE(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(TE(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>aa(e.location,t.location)?-1:+!!aa(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=wE();n.set(i??``,o),vt.toReversed().forEach(e=>o.put(TE(e,`builtin`,!1)));let s=e(i);return s.getModule().extends.forEach(e=>r(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),o.ownStart=o.inserted.length,t(s).forEach(e=>e.apply(o)),o};return{getContext:r,getOwnEntries:e=>{let t=r(e);return t.inserted.slice(t.ownStart)}}},zE=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=e=>{r.add(e)},a=e=>{e.kind===`ModelValue`&&i(e.name),e.kind===`String`&&i(e.value),e.kind===`Set`&&e.elements.forEach(a)};t.constants.forEach(e=>{e.args?.forEach(a),a(e.value)}),St.forEach(i);let o=t=>{let n=e(t);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=kE(o(e),e,s);return c.set(e,n),n},u=e=>s.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>s.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},h=m(e=>e.extends),g=m(e=>e.instances),_=/* @__PURE__ */ new Set([void 0]),v=/* @__PURE__ */ new Map;ME(o(void 0)).forEach((e,t)=>{t===3&&wt.forEach(i),i(e)});let y=l(void 0);for(;;){let t=h(y,/* @__PURE__ */ new Set)??g(y,/* @__PURE__ */ new Set);if(!t)break;let[n,r]=t;if(d.add(`${n.key}>${r}`),v.set(n.unit,[...v.get(n.unit)??[],r]),!_.has(r)){if(_.add(r),e(r).tokens.length===0){let t=n.unit??NE(e(void 0).tokens);throw x(r,t)}ME(o(r)).forEach(i)}}bE.forEach(i);let ee=/* @__PURE__ */ new Set,b=e=>{if(ee.has(e))return;ee.add(e);let t=v.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(b),o(e).forEach(e=>{e.kind===`String`&&i(e.text)})};return b(void 0),n.forEach(e=>{let t=o(e);ME(t).forEach(i),t.forEach(e=>{e.kind===`String`&&i(e.text)})}),Ct.forEach(i),[...r]},BE=(e,t)=>{let n=LE(e,t),r=n.getParsed,i,a=()=>i??=RE(r);return{getStringOrder:(e,t)=>zE(r,e,t),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let e=a();return e.getContext(void 0),t=>e.getOwnEntries(t).filter(e=>e.kind===`definition`).map(e=>e.name)}}},VE=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),HE=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],UE=(e,t,n)=>{try{return n.parseModule(e)}catch(n){if(!(n instanceof s))throw n;let r=Jn(e);throw r===void 0?n:c([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},WE=e=>new s(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),GE=(e,t)=>e.location.range&&t.location.range&&{location:m(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${m(t.location.range)}.`},KE=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,qE=e=>e===`Theorem`?`ThmOrAssumpDefNode`:KE(e),JE=(e,t)=>({kind:`Operator`,name:t,params:[],body:om(e),isLocal:!0,isRecursive:!1,location:e.location}),YE=e=>{let t=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange;return{kind:`Identifier`,name:e.name??e.module,location:{...t.start,range:t}}},XE=(e,t)=>{let n=_t(e);return n!==void 0&&t.has(n)||gt(e).some(e=>XE(e,t))},ZE=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Yp(e),n.get(e)??n.size)),n},QE=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),$E=e=>e?.kind===`Steps`?e.steps.flatMap(e=>[...e.body.kind===`Instance`?[e.body]:[],...e.body.kind===`Define`?e.body.definitions.flatMap(e=>e.kind===`Instance`?[e]:[]):[],...$E(e.proof)]):[],eD=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw ix(e);if(e.kind===`Number`&&!Bs(e.value))throw ax(e);eD(e.kind===`Let`?[...gt(e),...QE(e.instances??[])]:gt(e))}),tD=(e,t)=>{let n=t.order??BE(t.source,t.loadModule),r=n.parseModule(t.source),i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Set,u=/* @__PURE__ */ new Set,d=new Map(Ev.map(e=>[e.name,e])),f=/* @__PURE__ */ new Map,p=B_(e.checkDeadlock,t.seed);p.isWarningEnabled=t.isWarningEnabled??!0,p.isTool=t.isTool??!1,p.version=t.version??`master`,p.readLine=t.readLine;let h=/* @__PURE__ */ new Map,_=/* @__PURE__ */ new Map,v=[],y=/* @__PURE__ */ new Map,ee=[],b=[],te=/* @__PURE__ */ new Set,S=(e,t)=>[te,...ee].forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ne=0,re=e=>`${e}#${ne++}`,T=[],ie=[],ae=yE(e=>{let t=_.get(e)??le(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>i.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>i.get(t.visible.get(e)?.key??e)}}),oe=/* @__PURE__ */ new Map,se=/* @__PURE__ */ new Map,E=/* @__PURE__ */ new Map,ce=e=>{let n=f.get(e);if(n)return n;let r=Jv(e,t.print,p,t.files,d);if(!r)return;Kv.get(e)?.forEach(ce);let i=/* @__PURE__ */ new Map;return qv.get(e)?.forEach(e=>ce(e)?.forEach((e,t)=>i.set(t,e))),r.forEach(t=>{d.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:mm.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:gm(e,t.name)??i.get(t.name)?.range})}),f.set(e,i),i},D=e=>{let n=Kv.get(e)??[];if(e===`TLCExt`||[e,...n].some(e=>t.loadModule?.(e)!==void 0))return;let r=ce(e);return r&&S(e,n),r&&n.includes(`Integers`)&&ce(`Integers`),r},O=e=>(eD([...e.definitions.flatMap(ht),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...QE(e.instances)]),e.modules.forEach(O),e);O(r);let k=(e,r)=>{let i=t.loadModule?.(e)??hv(p.version).get(e)??mi(t.source,e);if(i===void 0)throw x(e,r);let a=UE(i,e,n);if(a.name!==e)throw c([{location:`Unknown location`,message:`File name '${e}' does not match the name '${a.name}' of the top level module it contains.`}],!0);return O(a)},A=e=>{let t=b.indexOf(e.name);if(t!==-1){let n=[...b.slice(t),e.name].map(e=>`${e}.tla`);throw new s(`Circular dependency among .tla files; dependency cycle is: ${n.join(` --> `)}`)}let n=/* @__PURE__ */ new Set,r=[],i=[],a=[];b.push(e.name),ee.push(n);let o=ve(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:i,warnings:ie,levelChecks:a});if(ee.pop(),b.pop(),i.length>0)throw c(i,!1,void 0,ie);let l=r.find(e=>n.has(e.name)),u=l&&h.get(l.name),d=u&&GE(l,u.module);if(d)throw c([d],!1,void 0,ie);if(l)throw WE(l);let f=[...Vo(a.flatMap(e=>e.sections),ie),...a.flatMap(e=>e.check(e!==a.at(-1)))].filter((e,t,n)=>n.findIndex(t=>t.location===e.location&&t.message===e.message)===t);if(f.length>0)throw c(f,!1,void 0,ie);return{linked:o,closure:n}},le=(e,n)=>{let r=h.get(e);if(r)return S(e,y.get(e)??[]),r;let a=A(k(e,n)),o=/* @__PURE__ */ new Map;return Gv(e,t.print,p,t.files,d,(e,t,n)=>{let r=o.get(e),i=t.flatMap(e=>typeof e==`object`&&e.kind===`Operator`&&e.expression?[e.expression]:[]);if(r?.kind!==`Operator`||!n||i.length!==t.length)throw new w(`No definition of ${e} to fall back to`);return $(r.body,{environment:n.environment,scope:fS(Qx(r),i,n),state:n.state,next:n.next,isKeepLazy:n.isKeepLazy})})?.forEach(t=>{let n=a.linked.visible.get(t.name);if(n?.kind!==`Definition`||n.arity!==t.arity&&VE.has(e))return;let r=i.get(n.key);r&&o.set(t.name,r),d.set(n.key,t),i.delete(n.key)}),h.set(e,a.linked),y.set(e,a.closure),S(e,a.closure),a.linked},ue=(e,t,n,r,s)=>{let c=s?void 0:D(e.module);if(c)return de(e,c);let d=s??le(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=HE(d),p=`#${ne++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=Bo(gE(e,t),f,t,n);T.push({module:e.module,instancer:t.name,lets:[],substitutions:h,location:e.location});let g=e.params.map(e=>({...e,name:`${e.name}${p}`}));g.forEach(e=>u.add(e));let _=lm({params:g,substitutions:new Map([...h].map(e=>[e[0],Dp(e[1],m)])),variables:new Set(d.variables),getDefinition:e=>i.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>a.get(e)===!0,addDefinition:(n,s,c)=>{let u=re(`${s}@${t.name}`),d=c(u);return i.set(u,d),f.length>0&&l.add(d),e.name!==void 0&&se.set(u,`${e.name}!${se.get(n)??s}`),a.set(u,!r),o.set(u,{source:n,prefix:e.params.length}),u},createName:re,...f.length>0&&{frame:YE(e)}});return fe(e,d.exported,f,(t,n)=>{let r=e.name===void 0?_.getKey(t):_.getQualifiedKey(t);return f.length>0&&oe.set(r,{name:n,location:e.location}),e.name!==void 0&&E.set(r,n),r})},de=(e,t)=>e.name===void 0?t:new Map([...t].map(t=>[`${e.name}!${t[0]}`,{key:t[1].key,arity:t[1].arity,params:t[1].params,kind:t[1].kind}])),fe=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(t=>!i.has(t[0])&&(e.name!==void 0||t[1].kind!==`Instance`)).map(t=>{if(e.name===void 0)return[t[0],{key:r(t[1].key,t[0]),arity:t[1].arity,params:t[1].params,kind:t[1].kind,range:a.get(t[1].key)===!0?e.location.range:t[1].range,functionArity:a.get(t[1].key)===!0?void 0:t[1].functionArity}];let i=`${e.name}!${t[0]}`;return[i,{key:t[1].kind===`Instance`?i:r(t[1].key,i),arity:t[1].arity+e.params.length,params:t[1].params&&[...e.params.map(e=>e.arity),...t[1].params],kind:t[1].kind,functionArity:n.length>0?void 0:t[1].functionArity}]}))},pe=(e,t)=>Array.from({length:e},(e,n)=>({name:`argument${n}`,arity:t?.[n]??0})),me=(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=pe(t.arity,void 0);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:tm(r,n),location:n}}},he=(e,t,n,r)=>{let o=e.location,s=r?void 0:D(e.module);if(s)return e.name===void 0?[]:[...s].map(t=>{let n=pe(t[1].arity,t[1].params);return nm(`${e.name}!${t[0]}`,t[1].key,[...e.params,...n],n,o)});let c=r??le(e.module,n),l=`#${ne++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=HE(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};T.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=>XE(f(e),p),h=d.map(t=>{let n=me(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=[],_=lm({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:tm(e.params,o),location:o,resolution:Hi}:em(`${t.name}${l}`,o)])),variables:new Set(c.variables),getDefinition:e=>i.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>a.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}:JE(a,i)),i},createName:re}),v=d.length>0?[YE(e)]:[],y=new Set(d.map(e=>e.name)),ee=[...c.exported].filter(e=>!y.has(e[0])&&e[1].kind!==`Instance`).map(t=>{let n=e.name===void 0?t[0]:`${e.name}!${t[0]}`,r=_.getKey(t[1].key),a=g.find(e=>e.name===r),s=i.get(r),c=a??(s&&sm(s,e.params));if(c){let e=c.kind===`Operator`?c:JE(c,n);return{...e,name:n,body:Ep(e.body,v)}}let l=pe(t[1].arity,t[1].params);return nm(n,r,[...e.params,...l],l,o)});return[...h,...g,...ee]},ge=e=>[...e].flatMap(e=>{let t=i.get(e[1].key);return t?[{...t,name:e[0]}]:[]}),_e=/* @__PURE__ */ new Map,ve=(e,n)=>{let o=JT(e,t.loadClass?.(e.name),e===r);_e.set(e.name,o.overrides);let s=o.module,c=T.length,l=new Map([...Ev.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...n.symbols]),u=/* @__PURE__ */ new Map,d={location:Fo,errors:[],warnings:[]},f=[d],p=e=>e.forEach((e,t)=>{let n=h.get(t);if(!n){l.set(t,e),h.set(t,e);return}if(!n.range||!e.range||m(n.range)===m(e.range))return;let r=m(e.range),i=m(n.range);qE(n.kind)===qE(e.kind)?d.warnings.push({location:r,message:`Warning: the ${KE(n.kind)} of '${t}' conflicts with \nits ${KE(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${KE(e.kind)} of '${t}' conflicts with \nits ${KE(n.kind)} at ${i}.`})}),h=/* @__PURE__ */ new Map,g=/* @__PURE__ */ new Set,y=/* @__PURE__ */ new Map,ee=[],b=[...s.constants],x=s.variables.filter((e,t)=>s.variables.findIndex(t=>t.name===e.name)===t),S=x.map(e=>e.name),C=x.map(e=>e.location);s.extends.forEach(e=>{let t=n.modules.get(e),r=t?void 0:D(e);if(r){p(r);return}let i=t??le(e,s.name);b.push(...i.constants.filter(e=>b.every(t=>t.name!==e.name)&&!S.includes(e.name))),i.variables.forEach((e,t)=>{S.includes(e)||b.some(t=>t.name===e)||(S.push(e),C.push(i.variableLocations[t]))}),p(i.exported),i.facts.forEach(e=>g.add(e)),i.modules.forEach((e,t)=>y.set(t,e)),ee.push(i)});let ne=new Map(l),w=[...s.constants.map(e=>({...e,kind:`Constant`})),...s.variables.map(e=>({...e,kind:`Variable`}))],re=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});w.forEach(e=>h.set(e.name,re(e)));let oe=e=>({key:ce(e),arity:sa(e),params:ca(e),kind:Io(s,e)?`Theorem`:`Definition`,range:e.location.range,functionArity:ua(e)}),se=b.length===0&&S.length===0,ce=e=>s===r?e.name:`${e.name}@${n.id}`,O=/* @__PURE__ */ new Map,k=()=>new Map([...n.modules,...y]),A=e=>{let t=s.modules.find(t=>t.name===e.module);return t?aa(t.location,e.location)?y.get(t.name):void 0:k().get(e.module)},pe=e=>({imported:l,getInstance:e=>{let t=A(e),n=t?void 0:D(e.module);if(n)return{declarations:[],symbols:de(e,n),instancer:s.name};let r=t??le(e.module,s.name),i=HE(r);return{declarations:i,symbols:fe(e,r.exported,i,e=>e),instancer:s.name}},bound:ne,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:ce,isModuleKnown:(e,t)=>e===s.name||te.has(e)||n.modules.has(e)||s.modules.some(n=>n.name===e&&aa(n.location,t)),instanced:O,facts:g,reports:f,warnings:n.warnings}),me=e=>[...w.filter(t=>aa(t.location,e)).map(e=>[e.name,re(e)]),...s.definitions.filter(t=>aa(t.location,e)).map(e=>[e.name,oe(e)])].reduce((e,t)=>e.has(t[0])?e:e.set(t[0],t[1]),new Map(l)),ye=e=>{let t=k(),r=t.get(e.name),i=r&&GE(e,r.module);if(r&&!i)throw WE(e);n.nested.push(e);let a={location:e.location,errors:[],warnings:[]};f.push(a);let o=ve(e,{id:`${n.id}/${e.name}`,symbols:me(e.location),modules:t,nested:n.nested,errors:a.errors,warnings:a.warnings,levelChecks:n.levelChecks});i&&a.errors.push(i),r||y.set(e.name,o)};[...s.instances.map(e=>({location:e.location,link:()=>{let t=ue(e,s,pe(s),se,k().get(e.module));O.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||h.set(n,t))}),e.name!==void 0&&!e.isLocal&&h.set(e.name,{key:`${e.name}@${n.id}`,arity:e.params.length,kind:`Instance`,range:e.location.range})}})),...s.modules.map(e=>({location:e.location,link:()=>ye(e)}))].sort((e,t)=>aa(e.location,t.location)?-1:1).forEach(e=>e.link());let be=_E(pm(s,(e,t)=>he(e,t,s.name,A(e))),ge(l));s.theorems.flatMap(e=>$E(e.proof)).filter(e=>!k().has(e.module)).forEach(e=>D(e.module)??le(e.module,s.name)),n.errors.push(...Ho(be,pe(be))),be.definitions.forEach(e=>{let t=ce(e);i.set(t,e),a.set(t,!se);let n=oe(e),r=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||r!==void 0&&!aa(r,e.location))&&(l.set(e.name,n),e.isLocal||h.set(e.name,n))});let xe={module:be,constants:b,variables:S,variableLocations:C,visible:l,exported:h,modules:y,extended:ee,facts:/* @__PURE__ */ new Set([...g,...[...be.theorems,...be.assumptions].flatMap(e=>e.name??[])])};_.has(s.name)||_.set(s.name,xe);let Se=T.splice(c).map(e=>({location:e.location,check:()=>ae(e)}));return n.levelChecks.push(wh(be,{constants:new Set(b.map(e=>e.name)),variables:new Set(S),getDefinition:e=>i.get(l.get(e)?.key??e),getQualifiedName:e=>E.get(l.get(e)?.key??e)},Se,ie)),v.push(xe),xe},ye=A(r).linked,be=t.traceFile,xe=be===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:be}}],Se=[...t.moduleOperators??[],...xe].map(e=>{let t=le(e.module,r.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});v.push(...v.splice(v.indexOf(ye),1)),ie.length>0&&!t.isSanyReported&&t.print(g(ie));let Ce=t.runtimeInvariants??[];Ce.forEach(e=>{if(e.module===void 0)return;h.set(r.name,ye);let t=le(e.module,r.name);v.splice(v.indexOf(t),1);let n=i.get(t.visible.get(e.name)?.key??e.name);n&&i.set(e.name,n)}),ye.visible.forEach((e,t)=>{let n=i.get(e.key);n&&e.key!==t&&i.set(t,n)}),Se.forEach(e=>{let t=e.key===void 0?void 0:i.get(e.key);e.kind!==`postcondition`&&t&&i.set(e.operator,t)});let we=[],Te=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>Te(e,t)),we.push(...e.module.assumptions))};Te(ye,/* @__PURE__ */ new Set);let Ee=ye.constants.map(e=>e.name),De=ye.variables,Oe=FT(e,{root:ye,moduleSymbols:new Map([...f,...[...h].map(e=>[e[0],e[1].visible]),[r.name,ye.visible]]),definitions:i,builtins:d,copySources:o,operatorConstants:new Map(Se.flatMap(e=>le(e.module,r.name).constants.flatMap(t=>{let n=e.constants?.[t.name];return n===void 0?[]:[[t.name,n]]}))),order:n}),ke=Oe.constants,Ae=Oe.substitutions;be!==void 0&&d.forEach((e,t)=>{let n=jv(e);n&&d.set(t,n)});let je=ZE(De,v.flatMap(e=>e.module.variables.map(e=>e.name))),Me=zh({definitions:i,substitutions:Ae,constants:ke,variableIndex:je,builtins:d,variables:De}),Ne={runtime:p,definitions:i,builtins:d,constants:ke,substitutions:Ae,instanceNames:se,variables:De,variableIndex:je,facts:Me,startupValues:Array.from({length:Me.ids.size},()=>void 0),tlcEvalValues:/* @__PURE__ */ new WeakMap,substitutedDefinitions:l,instanceParams:u,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Pe=Sh({constants:new Set(ke.keys()),variables:/* @__PURE__ */ new Set([...De,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>d.has(e))]),getDefinition:e=>yx(e,Ne)}),Fe=e=>{try{$(e,{environment:Ne,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof w)return e;throw e}};Ae.forEach((e,t)=>{let n=i.get(e),r=Ee.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Pe.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Fe(n.body):void 0;if(r){let n=as(r)?``:` - specifically: ${r.message}`;throw new C(`The configuration file substitutes constant ${t} with non-constant ${e}${n}`)}}),p.version!==`1.7.4`&&(p.isStarted=!0);let Ie=new Set(v.flatMap(e=>e.module.instances.map(e=>e.module))),Le=n.createDefinitionOrder();return{environment:Ne,assumptions:we,variableLocations:ye.variableLocations,instanceActions:oe,startupDefinitions:v.filter(e=>!Ie.has(e.module.name)||HE(e).length===0).flatMap(e=>Le(e===ye?void 0:e.module.name).flatMap(t=>{let n=i.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:v.flatMap(e=>_e.get(e.module.name)??[]),moduleOperators:Se,runtimeInvariants:Ce,rootName:r.name}},nD=e=>[...e].map(e=>`${e[0]}>${e[1].name}`).sort().join(`,`),rD=(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},iD=e=>v(new w(`${l}${e}`),b.error),aD=e=>{let t=K(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!Ls(e)||!Ls(i))throw iD(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},oD=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${sD(t)}`:n},sD=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Number`)return e.text??String(e.value);if(e.kind===`SetEnumeration`)return`{${e.elements.map(sD).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${oD(e.pattern,e.set)}:${sD(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(sD).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${sD(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>oD(e.pattern,e.set)).join(`,`)}|->${sD(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(sD);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},cD=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,lD=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new C(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw iD(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>$(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!Ps(a)||!W(a))throw iD(`The symmetry operator must specify a set of functions.`);let o=G(a).elements;if(!o.every(Is))throw iD(`The symmetry values must be function records.`);let s=r.body,c=s.kind===`Apply`?s.args:s.kind===`SetEnumeration`?s.elements:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=sD(cD(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(Jo.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;o.map(aD).forEach(e=>{e.size>0&&d.set(nD(e),e)});let f=[...d.values()],p=0;for(;p<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p,t).forEach(e=>{let t=rD(n,e),r=nD(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),h=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!cD(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||h.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>Ls(e)&&m.has(e.name))})),d.size!==0)return[...d.values()]},uD=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=fD(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(fD(e[r],t));return a}},dD=(e,t)=>{let n=[],r=[];for(let i of e){let e=fD(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(Cc);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(Cc(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},fD=(e,t)=>{if(typeof e!=`object`)return e;let n=e.kind;if(n===`ModelValue`)return t.get(e.name)??e;if(n===`Set`){let n=dD(e.elements,t);return n?Oc(n):e}if(n===`Function`||n===`LazyFunction`&&W(e.domain)){let n=K(e),r=uD(n.domain,t),i=uD(n.range,t)??n.range;if(r){let e=Tl(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Ac(n.domain,e.range):e}return i===n.range?n:Ac(n.domain,i)}if(n===`Interval`||!Ps(e)||!W(e))return e;let r=G(e),i=uD(r.elements,t);return i?yl(i):r},pD=(e,t,n)=>{let r=e;for(let i of t){let t=e.slice(),a=0;for(let o of n)if(t[o]=fD(e[o],i),a===0&&(a=Cc(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},mD={line:0,column:0},hD=e=>({kind:`Identifier`,name:e,location:mD}),gD=e=>({name:e,expression:hD(e),scope:void 0}),_D=/* @__PURE__ */ new Set([`name`,`property`]),vD=(e,t,n)=>{let r=yx(t,n);if(!r)throw new C(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new C(_D.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},yD=e=>e.body.kind===`Number`||e.body.kind===`String`,bD=(e,t,n)=>n.constants.has(e)?n.constants.get(e):yD(t)?void 0:Jx(t,n),xD=(e,t,n)=>{if(n.constants.has(t))throw new C(`The ${e} ${t} cannot be a constant.`);let r=vD(e,t,n);if(bD(t,r,n)!==void 0)throw new C(`The ${e} ${t} cannot be a constant.`);return r},SD=(e,t,n)=>{let r=n.constants.has(t)?void 0:vD(e,t,n),i=r?bD(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new C(`The ${e} of ${t} is equal to ${q(i)}`);return i===void 0?r:void 0},CD=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},wD=(e,t,n)=>{let r=e.environment;r.runtime.warn=(e,t)=>n?.({kind:`warning`,code:e,text:t}),n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),Yx(e.startupDefinitions,r),t.invariants.forEach(e=>{SD(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},TD=(e,t)=>{let n=Sh({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>t.definitions.get(e)});return e.flatMap(e=>{let r=SD(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2){let t=i.params.size===0?``:`
|
|
1794
1794
|
Note that a bug can cause TLC to incorrectly report this error.
|
|
1795
1795
|
If you believe your TLA+ or PlusCal specification to be correct,
|
|
1796
|
-
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw v(new C(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${t}`),b.safetyEvaluationFailure)}return[
|
|
1797
|
-
all state variables. Proceed with fingers crossed.`}),r().filter(e=>n!==void 0&&!n.includes(e)).forEach(e=>i?.({kind:`warning`,code:
|
|
1798
|
-
but TLC can handle only specifications with one next-state relation.`);o.push({expression:c.expression.action,scope:e.scope});return}if(c.kind===`Always`&&c.expression.kind!==`Let`&&c.expression.kind!==`Label`&&iw(c.expression,e.scope,t)<2)throw v(new w(`TLC cannot handle the temporal formula ${Q(c.expression)}`),b.error);let p=iw(c,e.scope,t);if(p===3)u!==void 0&&e.path.includes(u)||(d=!0),s.push(e);else{if(p===2)throw new C(`TLC cannot handle this conjunct of the spec:\n${Q(c)}`);a.push(e)}});let f=[...a,...o],p=e=>`$specification${e}`,h=f.reduce((e,t,n)=>t.scope===void 0?e:{name:p(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),g=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:p(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:a.length===0?void 0:{kind:`And`,operands:a.map(g),location:$E},next:o.length===0?void 0:g(o[0],a.length),scope:h,temporals:s,isPropertyFairness:s.length>0&&!d}},mD=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=sD(`property`,e,t);if(!i)return;iw(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;ow(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(fD(n,t,`property`))return;let a=n.name??e;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){r.actionProperties.push({name:a,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:n.scope});return}if(i.kind===`Always`&&iw(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!M(e)?cx(e.name,t):void 0;r.invariants.push({name:o?.name??(e.kind===`Identifier`?e.name:a),expression:e,scope:n.scope});return}let o=iw(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2){let e=Q(i),t=`Specifying Systems at https://lamport.azurewebsites.net/tla/book.html`,n=i.kind===`BoxAction`?`To check that action ${a} holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at ${e} (compare page 90 of ${t}).`:i.kind===`AngleAction`?`To check that infinitely many ${a} steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at ${e} (compare page 91 of ${t}).`:`To check that action ${a} holds in *every* step of the behavior, define a temporal property: Let A be the formula at ${e}; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of ${t}).`;throw new C(`The formula ${a} at ${e} is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. ${n}`)}r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},hD=e=>{let t=[],n=/* @__PURE__ */ new Set,r=e=>{if(e===void 0||n.has(e))return!0;n.add(e);let i=e.binding;return i.kind===`Thunk`?(t.push(i.expression),r(i.scope)&&r(e.parent)):i.kind===`Operator`?i.operator.kind===`Closure`&&(t.push(i.operator.body),r(i.operator.scope)&&r(e.parent)):r(e.parent)};return r(e)?t:void 0},gD=(e,t,n)=>t.flatMap(t=>sD(e,t,n)?[tD(t)]:[]),_D=(e,t)=>{let n=cx(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},vD=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new C(`_POSSIBLE lists ${n} more than once`);oD(`possible`,n,t);let i=tD(n);if(iw(i.expression,void 0,t)===3)throw new C(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return i}),yD=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||M(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},bD=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=cx(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},xD=(e,t)=>e.flatMap(e=>{let n=bD(e.expression,t);return(e.scope===void 0&&Bh(n,t)===void 0?[n]:dD(e.expression,t)).map(r=>{let i=e.scope===void 0?Bh(r,t):void 0;return{name:e.name,expression:r,scope:e.scope,variables:i,membership:yD(r,i,t),predicate:n}})}),SD=(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},CD=/[\u0100-\uffff]/,wD=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),TD=e=>e.kind===`String`?CD.test(e.value):e.kind===`Set`&&e.elements.some(TD),ED=(e,t)=>{if(e.kind===`Selection`){if(t.has(e.expression))return!1;t.add(e.expression)}return e.kind===`String`&&CD.test(e.value)||e.kind===`Apply`&&wD.has(e.operator)||mt(e).some(e=>ED(e,t))},DD=(e,t)=>{let n=/* @__PURE__ */ new Set;return e.constants.some(e=>TD(e.value)||(e.args??[]).some(TD))||[...t.definitions.values()].some(e=>ED(e.body,n)||e.kind===`Function`&&e.bounds.some(e=>ED(e.set,n)))},OD=e=>{if(!pn(e))return;let t=xn(I(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},kD=(e,t,n,r)=>{let i=n===1?`the next-state action`:`action ${t} of the next-state relation`,a=r===`1.7.4`?`assigned`:`defined`;return`Successor state is not completely specified by ${i}. The following variable${e.length>1?`s are`:` is`} not ${a}: ${e.join(`, `)}.\n`},AD=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),jD=(e,t,n)=>rx($(e,t),n),MD=(e,t,n=PD)=>{let r=$(e,t);if(typeof r!=`boolean`)throw new w(n(e,t.environment));return r},ND=(e,t,n)=>{let r=t.kind===`Identifier`?cx(t.name,n):void 0,i=r?.kind===`Operator`?r.body:t,a=r?.kind===`Operator`?r.bodyRange:void 0;return`TLC expected a ${e} value, but did not find one. ${a&&i.kind!==`Number`?m(a):Bb(i)}`},PD=(e,t)=>ND(`boolean`,e,t),FD=(e,t)=>MD(e.expression,t,(n,r)=>(e.predicate!==e.expression&&MD(e.predicate,t),PD(n,r))),ID=()=>{},LD=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=jD(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),RD=(e,t)=>{try{return e(AD(t,void 0,void 0))?void 0:{message:void 0}}catch(e){if(e instanceof w)return{message:e.message};throw e}},zD=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=RD(e=>sx($(n.expression,e),n.expression),t);if(e)return{name:Bb(n.expression),trace:[],message:e.message}}},BD=(e,t,n,r=!1)=>{let i=EE(t.source,t.loadModule);return Pn(i.getStringOrder(e,(t.runtimeInvariants??[]).flatMap(e=>e.module??[]))),zn(t),mo(t.fingerprintPolynomial??0),r&&Fn(),{order:i,specification:BE(e,{source:t.source,loadModule:t.loadModule,order:i,loadClass:t.loadClass,print:n,files:{readFile:t.readFile,writeFile:t.writeFile,makeDirectory:t.makeDirectory},seed:t.seed,isTool:t.isTool,traceFile:t.traceSpec?.traceFile,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version,moduleOperators:t.moduleOperators,readLine:t.readLine,runtimeInvariants:t.runtimeInvariants})}},VD=e=>{let t=typeof e.config==`string`?ft(e.config,e.version):e.config,n=BD(t,e,e.onPrint??console.log),r=n.specification;lD(r,t,e.onProgress);let i=e.coverage===void 0?void 0:jo(r.environment.variables.length),a=i?Mo(r.environment,i):r.environment,o,s=()=>o??=Fw(t,a,r.instanceActions);a.runtime.getSpecification=()=>Bw(s(),t,a,r.variableLocations);let c=qD(t,a,r.variableLocations,()=>n.order.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators,r.runtimeInvariants);return{config:t,specification:r,environment:a,search:c,getDescription:s,coverage:i,getCoverage:()=>i&&bs(i,a,r.variableLocations,c?.getTlcOrder()??[])}},HD=/* @__PURE__ */ Error(`The walk stopped`),UD=(e,t,n)=>{let r=(n,r)=>r.map(r=>({...r,node:Fo(e,n,Lo(r.name,r.expression,t),r.expression,r.scope)})),i=r(`init`,n.inits),a=r(`next`,n.actions);return Go(e,t,Oy(a,t)),{inits:i,actions:a}},WD=(e,t,n,r,i,a=(e,t)=>{throw kb(e,t,r)})=>Dy(t,t.node,n,r,n=>{e.primary[t.node]++,i(n)},n=>(e.primary[t.node]++,a(n,t.name),!0)),GD=(e,t,n)=>{let r=zD(e,t);if(!r)return;if(r.message===void 0){let e=`Assumption ${r.name} is false.`;return n(wt.assumptionFalse,e,e),b.assumptionViolation}let i=`Evaluating assumption ${r.name} failed.\n${r.message}`;return n(wt.assumptionEvaluationError,i,Lt(wt.assumptionEvaluationError,i,!0)),b.assumptionViolation},KD=e=>v(new w(`${l}Could not find operator: ${e.operator} in module: ${e.module}`),b.error),qD=(e,t,n,r,i,a=[],o=[])=>{let s=e=>a.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw KD(e);return{name:e.operator,key:e.key}}),c=uD(e.invariants,t),u=pD(e,t,n,r,i),d=mD(e,t,i),f=e.properties[0],p=f&&cx(f,t)?.location.range,h=e.specification,g=h&&cx(h,t)?.location.range;u.isPropertyFairness&&p&&g&&i?.({kind:`warning`,code:wt.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${f} at ${m(p)} equals\nthe fairness constraints of the behavior specification ${h} at ${m(g)}.\nTherefore, checking whether ${h} => ${f} using TLC will never result in a violation of ${f}.`});let _=xD([...c,...d.invariants],t),y=_.length>0||d.actionProperties.length>0||d.liveness.length>0;if(u.init===void 0&&(y||d.initialPredicates.length>0||t.variables.length>0))throw new C(t.runtime.version===`1.7.4`?kt:`The configuration file did not specify the initial state predicate.`);if(u.next===void 0&&y)throw new C(`The configuration file did not specify the next state predicate.`);let ee=xD(o.map(e=>{let n=cx(e.name,t);return{name:e.name,expression:n?.kind===`Operator`?n.body:eD(e.name),scope:void 0}}),t),x=[..._,...ee],te=[...new Map(x.map(e=>[e.predicate,e])).values()],S=gD(`constraint`,[...e.constraints,...s(`constraint`).map(e=>e.name)],t),ne=xD(S,t),re=gD(`action constraint`,e.actionConstraints,t),T=t.coverage,ie=(e,n,r=!0)=>n.flatMap(n=>{if(!T)return[];let i=r?bD(n.expression,t):n.expression,a=Lo(r?n.name:void 0,i,t),o=Fo(T,e,a,i,n.scope);return[{expression:i,scope:n.scope,node:o}]}),ae=[...ie(`invariant`,c),...ie(`invariant`,d.invariants,!1)],oe=new Map([...c,...d.invariants].map((e,n)=>[bD(e.expression,t),ae[n]])),se=ie(`constraint`,re),E=ie(`constraint`,S),ce=new Map(E.map(e=>[e.expression,e])),D=[...new Map(ne.map(e=>[e.predicate,e])).values()],O=ie(`implied`,d.initialPredicates,!1),k=ie(`implied`,d.actionProperties.map(e=>({...e,expression:e.box})),!1),A=(e,n,r,i)=>{try{return Yo(e,n.node,()=>$(n.expression,AD(t,r,i,n.scope)))}catch{return}},le=(e,t,n)=>T&&e?Yo(T,e.node,()=>MD(e.expression,n)):MD(t,n),ue=(e,t,n)=>{if(T){for(let r of e){let e=A(T,r,t,n);if(typeof e!=`boolean`)return;if(!e)return T.primary[r.node]++,!1;T.secondary[r.node]++}return!0}};e.rlReward!==void 0&&rD(`rlreward`,e.rlReward,t),e.periodic!==void 0&&rD(`periodic`,e.periodic,t);let de=vD(e.possible,t);if(t.variables.length===0)return;let fe=e.symmetry===void 0?void 0:JE(e.symmetry,t,e.substitutions),pe=e.view===void 0?void 0:oD(`view function`,e.view,t),me=e.view??s(`view`)[0]?.name,he=me===void 0?void 0:tD(me),ge=d.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:$E};return{...e,unchanged:t}}),_e=e=>iw(e.expression,void 0,t)>=2,ve=de.filter(e=>!_e(e)),ye=de.filter(_e),be=t.runtime,xe,Se=()=>{if(xe)return xe;let e=r(),n=n=>{let r=e.indexOf(t.variables[n]);return r===-1?t.variables.length:r};return xe=t.variables.map((e,t)=>t).sort((e,t)=>n(e)-n(t)),xe},Ce=(e,n)=>$(e,AD(t,n,void 0)),we=e=>(he!==void 0&&e.forEach(Gr),fe===void 0?e:QE(e,fe,Se())),Te=e=>{let t=we(e);return Eo(he===void 0?Se().map(e=>t[e]):[Ce(he.expression,t)])},Ee=e=>d.initialPredicates.find((n,r)=>{let i=T&&A(T,O[r],e,void 0);return typeof i==`boolean`?!i:!MD(n.expression,AD(t,e,void 0,n.scope))}),De=/* @__PURE__ */ new WeakSet,Oe=(e,n,r)=>{let i=r&&!De.has(r)?r:void 0;if(SD(e,n,i))return!1;try{let r=AD(t,n,void 0,e.scope),a=e.membership;return i&&a?!na(n[a.variable],i[a.variable],$(a.set,r)):!FD(e,r)}catch(t){throw r?Ut(v(t,b.safetyEvaluationFailure),wt.invariantEvaluationFailed,`Evaluating invariant ${e.name} failed.`):t}},ke=(e,t,n)=>{let r=oe.get(e.predicate),i=T&&r?A(T,r,t,void 0):void 0;return typeof i==`boolean`?!i:x.some(r=>r.predicate===e.predicate&&Oe(r,t,n))},Ae=DD(e,t);be.getFingerprint=Te;let je=()=>{let e=de.find(e=>!be.possibleCounts.get(e.name));if(!e)return;let n=_D(e.name,t),r=n?` at ${m(n)}`:``;return{name:e.name,code:wt.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${r} 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:N(L(j_(be),!0))}},Me=pe?.body.kind===`Tuple`?pe.body.elements:[],Ne=Me.flatMap(e=>e.kind===`Identifier`&&t.variables.includes(e.name)?[e.name]:[]),Pe=pe?.body.kind===`Tuple`&&Ne.length===Me.length&&new Set(Ne).size===Ne.length,Fe=(e,n)=>Pe?Se().filter(e=>Ne.includes(t.variables[e])).map(e=>`/\\ ${t.variables[e]} = ${N(L(n[e]))}\n`).join(``):N(L(Ce(e,n))),Ie=(e,n,r)=>MD(e.expression,AD(t,n,r),e=>`${l}${PD(e,t)}`),Le=e=>{let n=Object.fromEntries(Se().map(n=>[t.variables[n],e[n]]));return he===void 0?n:Vn(n,()=>Fe(he.expression,e))};return be.toRecord=Le,{properties:d,spec:u,toRecord:Le,evaluateAlias:(e,n,r,i)=>{let a=()=>Le(n.map(e=>e??rr(`null`)));try{oD(`alias`,e,t);let i=$(eD(e),AD(t,n,r)),o=OD(i);return o===void 0?a():Un(o,e)}catch(e){if(!(e instanceof C||e instanceof w))throw e;return{...a(),_ALIASEvalError:Rt(e.message,i)}}},isSymmetric:fe!==void 0,isConstrained:ne.length>0||re.length>0,getTypedChecks:n=>{if(T!==void 0||de.length>0||e.periodic!==void 0||[...x,...ne].some(e=>e.scope!==void 0)||re.length>0||d.actionProperties.some(e=>e.scope!==void 0)||d.liveness.length>0&&(n===void 0||he!==void 0)||u.init===void 0||u.next===void 0)return;let r=te.map(e=>e.predicate),i=[...new Set(ne.map(e=>e.predicate))],a=d.initialPredicates.map(e=>e.expression),o=[...t.facts.ids.keys()],s=hD(u.scope),c=e=>Rx(e,t)===void 0&&Ih(e,t,`replayed`);return(s===void 0?o.some(c):o.some(e=>!(e.kind===`Operator`&&e.params.length>0)&&Mh(e,t)&&c(e))||Fh([u.init,u.next,...r,...i,...a,...d.actionProperties.flatMap(e=>[e.action,e.subscript]),...he?[he.expression]:[],...s,...hT(n??[])],t,`replayed`))?void 0:{init:u.init,next:u.next,scope:u.scope,invariants:r,constraints:i,holdsInitialPredicates:e=>Ee(e)===void 0,actionProperties:d.actionProperties,symmetry:fe,view:he?.expression,variableOrder:Se(),liveness:n}},getTlcOrder:Se,getStoredFingerprints:(e,t)=>he!==void 0||Ae?BigInt64Array.from(e,Te):Oo(t,Se()),getFingerprintState:e=>{if(Ae)return[String(Te(e))];let t=we(e);return he===void 0?t:[Ce(he.expression,t)]},findViolatedInvariant:(e,t)=>{let n=T===void 0?x.find(n=>Oe(n,e,t)):te.find(n=>ke(n,e,t));return n&&De.add(e),n},forEachViolatedInvariant:(e,t)=>{for(let n of te)ke(n,e,void 0)&&(De.add(e),t(n))},checkReplayedInitialState:(e,t,n,r)=>{let i=(n,r,i)=>le(n,r,AD(t,e,void 0,i));D.every(e=>i(ce.get(e.predicate),e.predicate,e.scope))&&n();for(let e of te)i(oe.get(e.predicate),e.predicate,e.scope)||r({status:`invariant-violation`,name:e.name});let a=d.initialPredicates.find((e,t)=>!i(O[t],e.expression,e.scope));a&&r({status:`liveness-violation`,name:a.name})},checkReplayedSuccessor:(e,t,n,r)=>(!(!(D.every(e=>le(ce.get(e.predicate),e.predicate,AD(n,t,void 0,e.scope)))&&re.every((r,i)=>le(se[i],r.expression,AD(n,e,t,r.scope))))||r())||te.every(e=>le(oe.get(e.predicate),e.predicate,AD(n,t,void 0,e.scope))))&&ge.every((r,i)=>le(k[i],r.box,AD(n,e,t,r.scope))),satisfiesConstraints:(e,n)=>ue(E,e)??ne.every(r=>SD(r,e,n)||FD(r,AD(t,e,void 0))),findFailedInitialPredicate:Ee,findViolatedActionProperty:(e,n)=>ge.find((r,i)=>{let a=T&&A(T,k[i],e,n);if(typeof a==`boolean`)return!a;try{return!MD(r.action,AD(t,e,n,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Q(r.box)}`)&&!jD(r.unchanged,AD(t,e,n,r.scope),`a subscript`)}catch(e){throw Ut(JD(e),wt.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>ue(se,e,t)??re.every(n=>Ie(n,e,t)),getExcludingConstraints:(e,n)=>[...ne.filter(e=>!FD(e,AD(t,n,void 0))),...re.filter(t=>!Ie(t,e,n))].map(e=>{let n=_D(e.name,t);return n?m(n):e.name}),trackStatePossible:ve.length===0?ID:e=>LD(ve,be,AD(t,e,void 0)),trackActionPossible:ye.length===0?ID:(e,n)=>LD(ye,be,AD(t,e,n)),findUnwitnessedPossible:je,getReward:(n,r,i)=>{if(e.rlReward===void 0)return i;let a=eD(e.rlReward),o=$(a,AD(t,n,r));if(typeof o!=`number`)throw new w(ND(`integer`,a,t));return o},findPostconditionViolation:(n=!1)=>{let r=s(`postcondition`),i=e.postconditions.map(e=>{let n=cx(e,t);return n?n.kind===`Operator`&&n.params.length>0?`TLC requires post condition not to take any argument, but one was given: ${e}`:!iD(n)&&Rx(n,t)!==void 0?`The post condition ${e} cannot be a constant.`:void 0:`The post condition ${e} specified in the configuration file\nis not defined in the specification.`}).find(e=>e!==void 0);if(i!==void 0){if(n)return;throw v(new w(i),b.configParseError)}let a=(e,n)=>{let r=RD(e=>MD(eD(n),e),t);if(!r)return;let i=cx(n,t)?.body,a=_D(n,t),o=a?` at ${i?.kind===`Number`?Bb(i):m(a)}`:``;return r.message===void 0?{name:e,code:wt.postconditionFalse,message:`Postcondition ${e}${o} is false.`}:{name:e,code:wt.postconditionFailed,message:`Evaluating postcondition ${e}${o} failed.\n${r.message}`}};for(let e of r){let t=a(e.name,e.key);if(t)return t}let o=je();if(o)return o;for(let t of e.postconditions){let e=a(t,t);if(e)return e}}}},JD=e=>e instanceof t?v(e,e.exitCode):e,YD=(e,t)=>e*((t-e)/2**64),XD=e=>e.includes(`.`)?e:`${e}.0`,ZD=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return XD(String(e));let[n,r]=e.toExponential().split(`e`);return`${XD(n)}E${r.replace(`+`,``)}`},QD=e=>e!==void 0&&e>=`0`&&e<=`9`,$D=e=>{if(e===0)return`0.0`;let t=ZD(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;QD(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;QD(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;QD(t[n])&&r<2;)i+=t[n++],r++;for(QD(t[n])&&Number(t[n])>=5&&(i=eO(i));QD(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},eO=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${eO(r)}.`:n===`9`?`${eO(r)}0`:`${r}${Number(n)+1}`},tO=e=>{let t=0;for(;10n**BigInt(t+1)<e*10n;)t++;let n=10n**BigInt(t+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t+1}`)},nO=(e,t,n)=>{if(YD(e,t)<1e-10)return;let r=1/0,i=9223372036854775807n,a;if(n(e=>{if(e.length===0)return;let t=e.sort();if(a!==void 0&&a<0n==t[0]<0n){let e=t[0]-a;e<i&&(i=e)}a=t[t.length-1];let n=new Int32Array(t.buffer,t.byteOffset,t.length*2);for(let e=1;e<t.length;e++){let a=n[2*e+1],o=n[2*e-1];if(a<0!=o<0)continue;let s=a-o;if(s<=1048576){let t=s*4294967296+(n[2*e]>>>0)-(n[2*e-2]>>>0);r=Math.min(r,t)}else{let n=t[e]-t[e-1];n<i&&(i=n)}}}),r===1/0)return i;let o=BigInt(r);return o<i?o:i},rO=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=0,o=n.find(t=>(a+=e[t],a>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}).`},iO=[void 0,`lambda`,`tuple`,`record`],aO=()=>{let e=/* @__PURE__ */ new Int32Array(1024),t=0,n=0,r=[],i=/* @__PURE__ */ new Map,a=n=>{if(t===e.length){let t=new Int32Array(e.length*2);t.set(e),e=t}e[t++]=n},o=e=>{let t=i.get(e);if(t!==void 0)return a(t);i.set(e,r.length),a(r.length),r.push(e)},s=e=>{if(typeof e==`boolean`)return a(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(a(2),a(e),!0);if(typeof e==`string`)return a(3),o(e),!0;if(e.kind===`ModelValue`)return a(4),o(e.name),!0;if(e.kind===`Set`)return a(5),a(e.elements.length),e.elements.every(s);if(e.kind===`Function`){let t=ha(e.domain);return t?(a(7),a(iO.indexOf(ur(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(iO.indexOf(ur(e))),a(e.domain.length),e.domain.every(s)&&e.range.every(s))}return!1};return{encode:e=>{let r=t;return e.every(s)?(n++,!0):(t=r,!1)},finish:()=>({words:e.slice(0,t),strings:r,count:n})}},oO=e=>t=>{let n=t.words,r=0,i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r++];if(e===3)return t.strings[n[r++]];if(e===4)return rr(t.strings[n[r++]]);if(e===5)return ar(i(n[r++]));let a=iO[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=di({kind:`Interval`,low:e,high:e+t-1});return lr(sr(o,i(t)),a)}let o=n[r++],s=i(o);return lr(sr(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{Db as $,gt as $n,kl as $t,Bw as A,ji as An,$u as At,aC as B,Ot as Bn,Kl as Bt,bT as C,Xa as Cn,fd as Ct,Rw as D,on as Dn,pd as Dt,mT as E,Da as En,ad as Et,rC as F,Gr as Fn,Xu as Ft,Q as G,Pt as Gn,Wl as Gt,lC as H,Rt as Hn,Fl as Ht,sC as I,F as In,Yu as It,cx as J,Ft as Jn,jl as Jt,$ as K,$t as Kn,Pl as Kt,iC as L,vr as Ln,Xl as Lt,QC as M,P as Mn,Gu as Mt,nC as N,br as Nn,Wu as Nt,zw as O,ir as On,ud as Ot,dC as P,_r as Pn,qu as Pt,kb as Q,vt as Qn,Hl as Qt,mC as R,wt as Rn,Ol as Rt,ZE as S,pi as Sn,Qu as St,vT as T,Ea as Tn,md as Tt,tC as U,Vt as Un,Nl as Ut,pC as V,Lt as Vn,Ll as Vt,_S as W,Bt as Wn,Il as Wt,lS as X,Xt as Xn,Vl as Xt,Rx as Y,Wt as Yn,zl as Yt,GS as Z,zt as Zn,Ul as Zt,GD as _,mi as _n,Fh as _t,nO as a,bs as an,Ty as at,WD as b,hi as bn,ld as bt,HD as c,xo as cn,iv as ct,KD as d,tn as dn,N_ as dt,Tl as en,mt as er,Ab as et,qD as f,er as fn,L_ as ft,VD as g,rr as gn,Mh as gt,kD as h,ni as hn,u_ as ht,tO as i,Mo as in,jb as it,hw as j,In as jn,Uu as jt,Fw as k,an as kn,hd as kt,UD as l,_o as ln,rv as lt,AD as m,Cr as mn,o_ as mt,aO as n,cs as nn,tt as nr,Mb as nt,YD as o,bo as on,Ey as ot,zD as p,qi as pn,F_ as pt,eS as q,Yt as qn,Rl as qt,$D as r,jo as rn,Ae as rr,eb as rt,rO as s,So as sn,Dy as st,oO as t,$s as tn,ft as tr,Ob as tt,BD as u,Eo as un,av as ut,cD as v,Xr as vn,Nd as vt,yT as w,L as wn,dd as wt,JD as x,ar as xn,sd as xt,lD as y,sr as yn,Zu as yt,fC as z,Tt as zn,Gl as zt};
|
|
1796
|
+
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw v(new C(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${t}`),b.safetyEvaluationFailure)}return[gD(e)]})},ED=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>ED(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=yx(e.name,t);if(n?.kind===`Operator`&&n.params.length===0&&Jx(n,t)===void 0)return ED(n.body,t)}return[e]},DD=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||mw(r,e.scope,t)>0)return!1;let i=$(r,GD(t,void 0,void 0,e.scope));if(i===!1)throw new C(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new C(`The operator ${r.name}, which equals ${q(i)},\ncannot be used as a ${n}`);return!0},OD=(e,t,n,r,i)=>{if(e.specification===void 0){let n=(e,n)=>{if(e!==void 0)return xD(n,e,t),hD(e)};return{init:n(e.init,`initial predicate`),next:n(e.next,`next state action`),scope:void 0,temporals:[],isPropertyFairness:!1}}if(e.init!==void 0||e.next!==void 0)throw new C(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let a=[],o=[],s=[],c=t.constants.has(e.specification)?t.constants.get(e.specification):bD(e.specification,vD(`name`,e.specification,t),t);if(c!==void 0)throw new C(`The value of ${e.specification} is equal to ${q(c)}`);let l=vD(`name`,e.specification,t),u=e.properties.length===1?e.properties[0]:void 0,d=!1;gw(l.body,void 0,t,!1).forEach(e=>{let c=e.expression,l=e.path.some(e=>{let n=yx(e,t);return n?.kind===`Operator`&&mw(n.body,void 0,t)===1});if(!l&&DD(e,t,`spec`))return;let f=c.kind===`Identifier`&&!M(c)?t.variableIndex.get(c.name):void 0;if(!l&&c.kind===`Identifier`&&f!==void 0){let e=n[f].range;throw new C(`The operator ${c.name}, which equals ${e?m(e):c.name},\ncannot be used as a spec`)}if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw v(new C(`TLC does not support temporal existential, nor universal, quantification over state variables.`),b.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){let n=Kw(c.expression.subscript,e.scope,t);if(n===void 0&&i?.({kind:`warning`,code:Jo.subscriptUndetermined,text:`TLC could not determine if the subscript of the next-state relation contains
|
|
1797
|
+
all state variables. Proceed with fingers crossed.`}),r().filter(e=>n!==void 0&&!n.includes(e)).forEach(e=>i?.({kind:`warning`,code:Jo.subscriptMissingVariable,text:`The subscript of the next-state relation specified by the specification\ndoes not seem to contain the state variable ${e}`})),o.length>0)throw new C(`The specification contains more than one conjunct of the form [][Next]_v,
|
|
1798
|
+
but TLC can handle only specifications with one next-state relation.`);o.push({expression:c.expression.action,scope:e.scope});return}if(c.kind===`Always`&&c.expression.kind!==`Let`&&c.expression.kind!==`Label`&&mw(c.expression,e.scope,t)<2)throw v(new w(`TLC cannot handle the temporal formula ${Q(c.expression)}`),b.error);let p=mw(c,e.scope,t);if(p===3)u!==void 0&&e.path.includes(u)||(d=!0),s.push(e);else{if(p===2)throw new C(`TLC cannot handle this conjunct of the spec:\n${Q(c)}`);a.push(e)}});let f=[...a,...o],p=e=>`$specification${e}`,h=f.reduce((e,t,n)=>t.scope===void 0?e:{name:p(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),g=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:p(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:a.length===0?void 0:{kind:`And`,operands:a.map(g),location:mD},next:o.length===0?void 0:g(o[0],a.length),scope:h,temporals:s,isPropertyFairness:s.length>0&&!d}},kD=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=SD(`property`,e,t);if(!i)return;mw(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;gw(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(DD(n,t,`property`))return;let a=n.name??e;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){r.actionProperties.push({name:a,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:n.scope});return}if(i.kind===`Always`&&mw(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!M(e)?yx(e.name,t):void 0;r.invariants.push({name:o?.name??(e.kind===`Identifier`?e.name:a),expression:e,scope:n.scope});return}let o=mw(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2){let e=Q(i),t=`Specifying Systems at https://lamport.azurewebsites.net/tla/book.html`,n=i.kind===`BoxAction`?`To check that action ${a} holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at ${e} (compare page 90 of ${t}).`:i.kind===`AngleAction`?`To check that infinitely many ${a} steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at ${e} (compare page 91 of ${t}).`:`To check that action ${a} holds in *every* step of the behavior, define a temporal property: Let A be the formula at ${e}; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of ${t}).`;throw new C(`The formula ${a} at ${e} is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. ${n}`)}r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},AD=e=>{let t=[],n=/* @__PURE__ */ new Set,r=e=>{if(e===void 0||n.has(e))return!0;n.add(e);let i=e.binding;return i.kind===`Thunk`?(t.push(i.expression),r(i.scope)&&r(e.parent)):i.kind===`Operator`?i.operator.kind===`Closure`&&(t.push(i.operator.body),r(i.operator.scope)&&r(e.parent)):r(e.parent)};return r(e)?t:void 0},jD=(e,t,n)=>t.flatMap(t=>SD(e,t,n)?[gD(t)]:[]),MD=(e,t)=>{let n=yx(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},ND=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new C(`_POSSIBLE lists ${n} more than once`);xD(`possible`,n,t);let i=gD(n);if(mw(i.expression,void 0,t)===3)throw new C(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return i}),PD=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||M(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},FD=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=yx(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},ID=(e,t)=>e.flatMap(e=>{let n=FD(e.expression,t);return(e.scope===void 0&&Xh(n,t)===void 0?[n]:ED(e.expression,t)).map(r=>{let i=e.scope===void 0?Xh(r,t):void 0;return{name:e.name,expression:r,scope:e.scope,variables:i,membership:PD(r,i,t),predicate:n}})}),LD=(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},RD=/[\u0100-\uffff]/,zD=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),BD=e=>e.kind===`String`?RD.test(e.value):e.kind===`Set`&&e.elements.some(BD),VD=(e,t)=>{if(e.kind===`Selection`){if(t.has(e.expression))return!1;t.add(e.expression)}return e.kind===`String`&&RD.test(e.value)||e.kind===`Apply`&&zD.has(e.operator)||gt(e).some(e=>VD(e,t))},HD=(e,t)=>{let n=/* @__PURE__ */ new Set;return e.constants.some(e=>BD(e.value)||(e.args??[]).some(BD))||[...t.definitions.values()].some(e=>VD(e.body,n)||e.kind===`Function`&&e.bounds.some(e=>VD(e.set,n)))},UD=e=>{if(!Is(e))return;let t=Ws(K(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},WD=(e,t,n,r)=>{let i=n===1?`the next-state action`:`action ${t} of the next-state relation`,a=r===`1.7.4`?`assigned`:`defined`;return`Successor state is not completely specified by ${i}. The following variable${e.length>1?`s are`:` is`} not ${a}: ${e.join(`, `)}.\n`},GD=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),KD=(e,t,n)=>mx($(e,t),n),qD=(e,t,n=YD)=>{let r=$(e,t);if(typeof r!=`boolean`)throw new w(n(e,t.environment));return r},JD=(e,t,n)=>{let r=t.kind===`Identifier`?yx(t.name,n):void 0,i=r?.kind===`Operator`?r.body:t,a=r?.kind===`Operator`?r.bodyRange:void 0;return`TLC expected a ${e} value, but did not find one. ${a&&i.kind!==`Number`?m(a):Zb(i)}`},YD=(e,t)=>JD(`boolean`,e,t),XD=(e,t)=>qD(e.expression,t,(n,r)=>(e.predicate!==e.expression&&qD(e.predicate,t),YD(n,r))),ZD=()=>{},QD=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=KD(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),$D=(e,t)=>{try{return e(GD(t,void 0,void 0))?void 0:{message:void 0}}catch(e){if(e instanceof w)return{message:e.message};throw e}},eO=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=$D(e=>vx($(n.expression,e),n.expression),t);if(e)return{name:Zb(n.expression),trace:[],message:e.message}}},tO=(e,t,n,r=!1)=>{let i=BE(t.source,t.loadModule);return rc(i.getStringOrder(e,(t.runtimeInvariants??[]).flatMap(e=>e.module??[]))),cc(t),Id(t.fingerprintPolynomial??0),r&&ic(),{order:i,specification:tD(e,{source:t.source,loadModule:t.loadModule,order:i,loadClass:t.loadClass,print:n,files:{readFile:t.readFile,writeFile:t.writeFile,makeDirectory:t.makeDirectory},seed:t.seed,isTool:t.isTool,traceFile:t.traceSpec?.traceFile,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version,moduleOperators:t.moduleOperators,readLine:t.readLine,runtimeInvariants:t.runtimeInvariants})}},nO=e=>{let t=typeof e.config==`string`?ft(e.config,e.version):e.config,n=tO(t,e,e.onPrint??console.log),r=n.specification;wD(r,t,e.onProgress);let i=e.coverage===void 0?void 0:ef(r.environment.variables.length),a=i?tf(r.environment,i):r.environment,o,s=()=>o??=Gw(t,a,r.instanceActions);a.runtime.getSpecification=()=>Xw(s(),t,a,r.variableLocations);let c=cO(t,a,r.variableLocations,()=>n.order.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators,r.runtimeInvariants);return{config:t,specification:r,environment:a,search:c,getDescription:s,coverage:i,getCoverage:()=>i&&Jf(i,a,r.variableLocations,c?.getTlcOrder()??[])}},rO=/* @__PURE__ */ Error(`The walk stopped`),iO=(e,t,n)=>{let r=(n,r)=>r.map(r=>({...r,node:of(e,n,cf(r.name,r.expression,t),r.expression,r.scope)})),i=r(`init`,n.inits),a=r(`next`,n.actions);return _f(e,t,zy(a,t)),{inits:i,actions:a}},aO=(e,t,n,r,i,a=(e,t)=>{throw Bb(e,t,r)},o)=>Ry(t,t.node,n,r,n=>{e.primary[t.node]++,i(n)},n=>(e.primary[t.node]++,a(n,t.name),!0),o),oO=(e,t,n)=>{let r=eO(e,t);if(!r)return;if(r.message===void 0){let e=`Assumption ${r.name} is false.`;return n(Jo.assumptionFalse,e,e),b.assumptionViolation}let i=`Evaluating assumption ${r.name} failed.\n${r.message}`;return n(Jo.assumptionEvaluationError,i,ss(Jo.assumptionEvaluationError,i,!0)),b.assumptionViolation},sO=e=>v(new w(`${l}Could not find operator: ${e.operator} in module: ${e.module}`),b.error),cO=(e,t,n,r,i,a=[],o=[])=>{let s=e=>a.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw sO(e);return{name:e.operator,key:e.key}}),c=TD(e.invariants,t),u=OD(e,t,n,r,i),d=kD(e,t,i),f=e.properties[0],p=f&&yx(f,t)?.location.range,h=e.specification,g=h&&yx(h,t)?.location.range;u.isPropertyFairness&&p&&g&&i?.({kind:`warning`,code:Jo.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${f} at ${m(p)} equals\nthe fairness constraints of the behavior specification ${h} at ${m(g)}.\nTherefore, checking whether ${h} => ${f} using TLC will never result in a violation of ${f}.`});let _=ID([...c,...d.invariants],t),y=_.length>0||d.actionProperties.length>0||d.liveness.length>0;if(u.init===void 0&&(y||d.initialPredicates.length>0||t.variables.length>0))throw new C(t.runtime.version===`1.7.4`?$o:`The configuration file did not specify the initial state predicate.`);if(u.next===void 0&&y)throw new C(`The configuration file did not specify the next state predicate.`);let ee=ID(o.map(e=>{let n=yx(e.name,t);return{name:e.name,expression:n?.kind===`Operator`?n.body:hD(e.name),scope:void 0}}),t),x=[..._,...ee],te=[...new Map(x.map(e=>[e.predicate,e])).values()],S=jD(`constraint`,[...e.constraints,...s(`constraint`).map(e=>e.name)],t),ne=ID(S,t),re=jD(`action constraint`,e.actionConstraints,t),T=t.coverage,ie=(e,n,r=!0)=>n.flatMap(n=>{if(!T)return[];let i=r?FD(n.expression,t):n.expression,a=cf(r?n.name:void 0,i,t),o=of(T,e,a,i,n.scope);return[{expression:i,scope:n.scope,node:o}]}),ae=[...ie(`invariant`,c),...ie(`invariant`,d.invariants,!1)],oe=new Map([...c,...d.invariants].map((e,n)=>[FD(e.expression,t),ae[n]])),se=ie(`constraint`,re),E=ie(`constraint`,S),ce=new Map(E.map(e=>[e.expression,e])),D=[...new Map(ne.map(e=>[e.predicate,e])).values()],O=ie(`implied`,d.initialPredicates,!1),k=ie(`implied`,d.actionProperties.map(e=>({...e,expression:e.box})),!1),A=(e,n,r,i)=>{try{return xf(e,n.node,()=>$(n.expression,GD(t,r,i,n.scope)))}catch{return}},le=(e,t,n)=>T&&e?xf(T,e.node,()=>qD(e.expression,n)):qD(t,n),ue=(e,t,n)=>{if(T){for(let r of e){let e=A(T,r,t,n);if(typeof e!=`boolean`)return;if(!e)return T.primary[r.node]++,!1;T.secondary[r.node]++}return!0}};e.rlReward!==void 0&&vD(`rlreward`,e.rlReward,t),e.periodic!==void 0&&vD(`periodic`,e.periodic,t);let de=ND(e.possible,t);if(t.variables.length===0)return;let fe=e.symmetry===void 0?void 0:lD(e.symmetry,t,e.substitutions),pe=e.view===void 0?void 0:xD(`view function`,e.view,t),me=e.view??s(`view`)[0]?.name,he=me===void 0?void 0:gD(me),ge=d.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:mD};return{...e,unchanged:t}}),_e=e=>mw(e.expression,void 0,t)>=2,ve=de.filter(e=>!_e(e)),ye=de.filter(_e),be=t.runtime,xe,Se=()=>{if(xe)return xe;let e=r(),n=n=>{let r=e.indexOf(t.variables[n]);return r===-1?t.variables.length:r};return xe=t.variables.map((e,t)=>t).sort((e,t)=>n(e)-n(t)),xe},Ce=(e,n)=>$(e,GD(t,n,void 0)),we=e=>(he!==void 0&&e.forEach(ml),fe===void 0?e:pD(e,fe,Se())),Te=e=>{let t=we(e);return Jd(he===void 0?Se().map(e=>t[e]):[Ce(he.expression,t)])},Ee=e=>d.initialPredicates.find((n,r)=>{let i=T&&A(T,O[r],e,void 0);return typeof i==`boolean`?!i:!qD(n.expression,GD(t,e,void 0,n.scope))}),De=/* @__PURE__ */ new WeakSet,Oe=(e,n,r)=>{let i=r&&!De.has(r)?r:void 0;if(LD(e,n,i))return!1;try{let r=GD(t,n,void 0,e.scope),a=e.membership;return i&&a?!Tu(n[a.variable],i[a.variable],$(a.set,r)):!XD(e,r)}catch(t){throw r?ps(v(t,b.safetyEvaluationFailure),Jo.invariantEvaluationFailed,`Evaluating invariant ${e.name} failed.`):t}},ke=(e,t,n)=>{let r=oe.get(e.predicate),i=T&&r?A(T,r,t,void 0):void 0;return typeof i==`boolean`?!i:x.some(r=>r.predicate===e.predicate&&Oe(r,t,n))},Ae=HD(e,t);be.getFingerprint=Te;let je=()=>{let e=de.find(e=>!be.possibleCounts.get(e.name));if(!e)return;let n=MD(e.name,t),r=n?` at ${m(n)}`:``;return{name:e.name,code:Jo.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${r} 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:U(q(V_(be),!0))}},Me=pe?.body.kind===`Tuple`?pe.body.elements:[],Ne=Me.flatMap(e=>e.kind===`Identifier`&&t.variables.includes(e.name)?[e.name]:[]),Pe=pe?.body.kind===`Tuple`&&Ne.length===Me.length&&new Set(Ne).size===Ne.length,Fe=(e,n)=>Pe?Se().filter(e=>Ne.includes(t.variables[e])).map(e=>`/\\ ${t.variables[e]} = ${U(q(n[e]))}\n`).join(``):U(q(Ce(e,n))),Ie=(e,n,r)=>qD(e.expression,GD(t,n,r),e=>`${l}${YD(e,t)}`),Le=e=>{let n=Object.fromEntries(Se().map(n=>[t.variables[n],e[n]]));return he===void 0?n:uc(n,()=>Fe(he.expression,e))};return be.toRecord=Le,{properties:d,spec:u,toRecord:Le,evaluateAlias:(e,n,r,i)=>{let a=()=>Le(n.map(e=>e??Ec(`null`)));try{xD(`alias`,e,t);let i=$(hD(e),GD(t,n,r)),o=UD(i);return o===void 0?a():fc(o,e)}catch(e){if(!(e instanceof C||e instanceof w))throw e;return{...a(),_ALIASEvalError:cs(e.message,i)}}},isSymmetric:fe!==void 0,isConstrained:ne.length>0||re.length>0,getTypedChecks:n=>{if(T!==void 0||de.length>0||e.periodic!==void 0||[...x,...ne].some(e=>e.scope!==void 0)||re.length>0||d.actionProperties.some(e=>e.scope!==void 0)||d.liveness.length>0&&(n===void 0||he!==void 0)||u.init===void 0||u.next===void 0)return;let r=te.map(e=>e.predicate),i=[...new Set(ne.map(e=>e.predicate))],a=d.initialPredicates.map(e=>e.expression),o=[...t.facts.ids.keys()],s=AD(u.scope),c=e=>Jx(e,t)===void 0&&Kh(e,t,`replayed`);return(s===void 0?o.some(c):o.some(e=>!(e.kind===`Operator`&&e.params.length>0)&&Hh(e,t)&&c(e))||Gh([u.init,u.next,...r,...i,...a,...d.actionProperties.flatMap(e=>[e.action,e.subscript]),...he?[he.expression]:[],...s,...TT(n??[])],t,`replayed`))?void 0:{init:u.init,next:u.next,scope:u.scope,invariants:r,constraints:i,holdsInitialPredicates:e=>Ee(e)===void 0,actionProperties:d.actionProperties,symmetry:fe,view:he?.expression,variableOrder:Se(),liveness:n}},getTlcOrder:Se,getStoredFingerprints:(e,t)=>he!==void 0||Ae?BigInt64Array.from(e,Te):Xd(t,Se()),getFingerprintState:e=>{if(Ae)return[String(Te(e))];let t=we(e);return he===void 0?t:[Ce(he.expression,t)]},findViolatedInvariant:(e,t)=>{let n=T===void 0?x.find(n=>Oe(n,e,t)):te.find(n=>ke(n,e,t));return n&&De.add(e),n},forEachViolatedInvariant:(e,t)=>{for(let n of te)ke(n,e,void 0)&&(De.add(e),t(n))},checkReplayedInitialState:(e,t,n,r)=>{let i=(n,r,i)=>le(n,r,GD(t,e,void 0,i));D.every(e=>i(ce.get(e.predicate),e.predicate,e.scope))&&n();for(let e of te)i(oe.get(e.predicate),e.predicate,e.scope)||r({status:`invariant-violation`,name:e.name});let a=d.initialPredicates.find((e,t)=>!i(O[t],e.expression,e.scope));a&&r({status:`liveness-violation`,name:a.name})},checkReplayedSuccessor:(e,t,n,r)=>(!(!(D.every(e=>le(ce.get(e.predicate),e.predicate,GD(n,t,void 0,e.scope)))&&re.every((r,i)=>le(se[i],r.expression,GD(n,e,t,r.scope))))||r())||te.every(e=>le(oe.get(e.predicate),e.predicate,GD(n,t,void 0,e.scope))))&&ge.every((r,i)=>le(k[i],r.box,GD(n,e,t,r.scope))),satisfiesConstraints:(e,n)=>ue(E,e)??ne.every(r=>LD(r,e,n)||XD(r,GD(t,e,void 0))),findFailedInitialPredicate:Ee,findViolatedActionProperty:(e,n)=>ge.find((r,i)=>{let a=T&&A(T,k[i],e,n);if(typeof a==`boolean`)return!a;try{return!qD(r.action,GD(t,e,n,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Q(r.box)}`)&&!KD(r.unchanged,GD(t,e,n,r.scope),`a subscript`)}catch(e){throw ps(lO(e),Jo.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>ue(se,e,t)??re.every(n=>Ie(n,e,t)),getExcludingConstraints:(e,n)=>[...ne.filter(e=>!XD(e,GD(t,n,void 0))),...re.filter(t=>!Ie(t,e,n))].map(e=>{let n=MD(e.name,t);return n?m(n):e.name}),trackStatePossible:ve.length===0?ZD:e=>QD(ve,be,GD(t,e,void 0)),trackActionPossible:ye.length===0?ZD:(e,n)=>QD(ye,be,GD(t,e,n)),findUnwitnessedPossible:je,getReward:(n,r,i)=>{if(e.rlReward===void 0)return i;let a=hD(e.rlReward),o=$(a,GD(t,n,r));if(typeof o!=`number`)throw new w(JD(`integer`,a,t));return o},findPostconditionViolation:(n=!1)=>{let r=s(`postcondition`),i=e.postconditions.map(e=>{let n=yx(e,t);return n?n.kind===`Operator`&&n.params.length>0?`TLC requires post condition not to take any argument, but one was given: ${e}`:!yD(n)&&Jx(n,t)!==void 0?`The post condition ${e} cannot be a constant.`:void 0:`The post condition ${e} specified in the configuration file\nis not defined in the specification.`}).find(e=>e!==void 0);if(i!==void 0){if(n)return;throw v(new w(i),b.configParseError)}let a=(e,n)=>{let r=$D(e=>qD(hD(n),e),t);if(!r)return;let i=yx(n,t)?.body,a=MD(n,t),o=a?` at ${i?.kind===`Number`?Zb(i):m(a)}`:``;return r.message===void 0?{name:e,code:Jo.postconditionFalse,message:`Postcondition ${e}${o} is false.`}:{name:e,code:Jo.postconditionFailed,message:`Evaluating postcondition ${e}${o} failed.\n${r.message}`}};for(let e of r){let t=a(e.name,e.key);if(t)return t}let o=je();if(o)return o;for(let t of e.postconditions){let e=a(t,t);if(e)return e}}}},lO=e=>e instanceof t?v(e,e.exitCode):e,uO=(e,t)=>e*((t-e)/2**64),dO=e=>e.includes(`.`)?e:`${e}.0`,fO=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return dO(String(e));let[n,r]=e.toExponential().split(`e`);return`${dO(n)}E${r.replace(`+`,``)}`},pO=e=>e!==void 0&&e>=`0`&&e<=`9`,mO=e=>{if(e===0)return`0.0`;let t=fO(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;pO(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;pO(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;pO(t[n])&&r<2;)i+=t[n++],r++;for(pO(t[n])&&Number(t[n])>=5&&(i=hO(i));pO(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},hO=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${hO(r)}.`:n===`9`?`${hO(r)}0`:`${r}${Number(n)+1}`},gO=e=>{let t=0;for(;10n**BigInt(t+1)<e*10n;)t++;let n=10n**BigInt(t+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t+1}`)},_O=(e,t,n)=>{if(uO(e,t)<1e-10)return;let r=1/0,i=9223372036854775807n,a;if(n(e=>{if(e.length===0)return;let t=e.sort();if(a!==void 0&&a<0n==t[0]<0n){let e=t[0]-a;e<i&&(i=e)}a=t[t.length-1];let n=new Int32Array(t.buffer,t.byteOffset,t.length*2);for(let e=1;e<t.length;e++){let a=n[2*e+1],o=n[2*e-1];if(a<0!=o<0)continue;let s=a-o;if(s<=1048576){let t=s*4294967296+(n[2*e]>>>0)-(n[2*e-2]>>>0);r=Math.min(r,t)}else{let n=t[e]-t[e-1];n<i&&(i=n)}}}),r===1/0)return i;let o=BigInt(r);return o<i?o:i},vO=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=0,o=n.find(t=>(a+=e[t],a>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}).`},yO=[void 0,`lambda`,`tuple`,`record`],bO=()=>{let e=/* @__PURE__ */ new Int32Array(1024),t=0,n=0,r=[],i=/* @__PURE__ */ new Map,a=n=>{if(t===e.length){let t=new Int32Array(e.length*2);t.set(e),e=t}e[t++]=n},o=e=>{let t=i.get(e);if(t!==void 0)return a(t);i.set(e,r.length),a(r.length),r.push(e)},s=e=>{if(typeof e==`boolean`)return a(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(a(2),a(e),!0);if(typeof e==`string`)return a(3),o(e),!0;if(e.kind===`ModelValue`)return a(4),o(e.name),!0;if(e.kind===`Set`)return a(5),a(e.elements.length),e.elements.every(s);if(e.kind===`Function`){let t=Ru(e.domain);return t?(a(7),a(yO.indexOf(Nc(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(yO.indexOf(Nc(e))),a(e.domain.length),e.domain.every(s)&&e.range.every(s))}return!1};return{encode:e=>{let r=t;return e.every(s)?(n++,!0):(t=r,!1)},finish:()=>({words:e.slice(0,t),strings:r,count:n})}},xO=e=>t=>{let n=t.words,r=0,i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r++];if(e===3)return t.strings[n[r++]];if(e===4)return Ec(t.strings[n[r++]]);if(e===5)return Oc(i(n[r++]));let a=yO[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=Pl({kind:`Interval`,low:e,high:e+t-1});return Mc(Ac(o,i(t)),a)}let o=n[r++],s=i(o);return Mc(Ac(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{Rb as $,xt as $n,Vc as $t,Xw as A,mi as An,Kc as At,hC as B,ir as Bn,q as Bt,AT as C,zi as Cn,Wd as Ct,Jw as D,Si as Dn,Ts as Dt,wT as E,Ti as En,Jd as Et,pC as F,yr as Fn,Ac as Ft,Q as G,sr as Gn,Os as Gt,yC as H,ar as Hn,Xu as Ht,_C as I,Zn as In,Rl as It,yx as J,ur as Jn,W as Jt,$ as K,er as Kn,eu as Kt,mC as L,mr as Ln,Oc as Lt,cw as M,gi as Mn,Ec as Mt,fC as N,yi as Nn,Ll as Nt,Yw as O,bi as On,Cc as Ot,xC as P,vi as Pn,yl as Pt,Bb as Q,Jn as Qn,G as Qt,wC as R,hr as Rn,Il as Rt,fD as S,ji as Sn,Hd as St,OT as T,Vi as Tn,zd as Tt,dC as U,pr as Un,ks as Ut,CC as V,nr as Vn,Yu as Vt,DS as W,rr as Wn,Dc as Wt,yS as X,dr as Xn,Bc as Xt,Jx as Y,fr as Yn,Uc as Yt,tC as Z,Qn as Zn,ml as Zt,oO as _,Ni as _n,Gh as _t,_O as a,ds as an,Iy as at,aO as b,Li as bn,tf as bt,rO as c,Cs as cn,mv as ct,sO as d,ms as dn,U_ as dt,Jo as en,gt as er,Vb as et,cO as f,bs as fn,q_ as ft,nO as g,Fi as gn,Hh as gt,WD as h,Ci as hn,b_ as ht,gO as i,cs as in,Hb as it,Tw as j,pi as jn,Tl as jt,Gw as k,fi as kn,gu as kt,iO as l,ys as ln,pv as lt,GD as m,aa as mn,g_ as mt,bO as n,Qo as nn,tt as nr,Ub as nt,uO as o,us as on,Ly as ot,eO as p,ls as pn,G_ as pt,uS as q,cr as qn,ac as qt,mO as r,ss as rn,Ae as rr,db as rt,vO as s,is as sn,Ry as st,xO as t,Yo as tn,ft as tr,zb as tt,tO as u,as as un,hv as ut,CD as v,wi as vn,If as vt,kT as w,Ii as wn,Ud as wt,lO as x,Bi as xn,Jf as xt,wD as y,Ri as yn,ef as yt,SC as z,or as zn,yd as zt};
|