tla-ts 0.0.3-dev.b4e335d → 0.0.3-dev.baa5e34
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/run-cli.cjs +3 -3
- package/dist/run-cli.js +3 -3
- package/dist/transfer.cjs +30 -30
- package/dist/transfer.js +30 -30
- package/package.json +1 -1
- package/src/config.ts +2 -2
- package/src/lexer.ts +10 -0
- package/src/sany-generator.ts +5 -5
- package/src/sany-report.ts +2 -0
- package/src/values.ts +17 -1
package/dist/run-cli.js
CHANGED
|
@@ -6,7 +6,7 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
import{$ as e,A as t,B as n,C as r,D as i,E as a,H as o,I as s,K as c,L as l,M as u,O as d,Q as f,R as p,T as m,U as h,V as g,W as _,Z as v,_ as y,_t as b,at as x,ct as S,dt as ee,et as C,ft as w,gt as T,h as E,ht as te,it as D,j as ne,k as re,lt as ie,m as ae,mt as O,nt as oe,ot as se,pt as ce,rt as k,st as A,tt as le,ut as j,v as ue,vt as de,w as fe,yt as pe,z as me}from"./transfer.js";import{t as he}from"./parallel.js";import{basename as ge,delimiter as _e,dirname as ve,isAbsolute as M,join as ye,resolve as be}from"node:path";import{existsSync as xe,globSync as Se,mkdirSync as Ce,readFileSync as we,readSync as Te,realpathSync as Ee,writeFileSync as De}from"node:fs";import{spawnSync as Oe}from"node:child_process";import{createHash as ke}from"node:crypto";import{arch as Ae,availableParallelism as je,release as Me,tmpdir as Ne,type as Pe}from"node:os";import{pathToFileURL as N}from"node:url";import{getHeapStatistics as Fe}from"node:v8";import{strFromU8 as Ie,unzipSync as Le}from"fflate";var Re=`0.0.3-dev.b4e335d`;const ze=e=>{let t=e.isRequired?e.flag:`[${e.flag}]`;return e.isRepeatable?`${t}...`:t},Be=(e,t)=>{let n=new Map(t.map(e=>{let[t,...n]=e.flag.split(` `);return[t,e.getArity??(()=>n.length)]}));return{usage:e.replace(`{options}`,t.map(ze).join(` `)),parse:e=>{let t=[],r=[],i=[],a=[];for(let o=0;o<e.length;o++){let s=n.get(e[o]);if(s===void 0){(e[o].startsWith(`-`)?i:r).push(e[o]);continue}let c=s(e.slice(o+1)),l={name:e[o],values:e.slice(o+1,o+1+c)};t.push(l),l.values.length<c&&a.push(l),o+=c}return{options:t,positionals:r,unknown:i,incomplete:a[0],has:e=>t.some(t=>t.name===e),get:e=>t.findLast(t=>t.name===e)?.values}}}},Ve=e=>{let t=e.endColumn-1;return e.startLine===e.endLine?e.startColumn>=t?`line ${e.startLine}, character ${e.startColumn}`:`line ${e.startLine}, characters ${e.startColumn}-${t}`:`line ${e.startLine}, character ${e.startColumn} to line ${e.endLine}, character ${t}`},He=e=>`File ${JSON.stringify(e.file)}, ${Ve(e)}`,Ue=e=>`${e?He(e):`<unknown location>`}:\n`,P=(e,t)=>({text:`${Ue(e)}Error: ${t}`,channel:`stderr`}),We=e=>e?`${He(e)} :\n`:``,F=e=>({kind:`Shift`,amount:e}),Ge=(e,t)=>({kind:`Cons`,expression:e,rest:t}),Ke=(e,t)=>e.reduce((e,t)=>Ge(t,e),t),qe=(e,t)=>t.kind===`Bump`?{kind:`Bump`,amount:t.amount+e,rest:t.rest}:{kind:`Bump`,amount:e,rest:t},I=(e,t)=>{let n=t.location?{...e,location:t.location}:e;return t.isAtomic?{...n,isAtomic:!0}:n},Je=e=>{switch(e.kind){case`Fresh`:case`Flex`:return e.name;case`Defn`:return e.definition.name;case`Fact`:return}},Ye=(e,t,n)=>I({kind:`Apply`,operator:I({kind:`Internal`,builtin:e},n),args:t},n),Xe=e=>e.context.length===0?e.active:{kind:`Sequent`,sequent:e},Ze=(e,t)=>({hyp:t,rest:e,size:(e?.size??0)+1}),Qe=(e,t)=>t.reduce(Ze,e),$e=e=>{let t=[];for(let n=e;n;n=n.rest)t.push(n.hyp);return t.reverse()},et=(e,t)=>{let n=0;for(let r=e;r;r=r.rest){if(Je(r.hyp)===t)return{depth:n,hyp:r.hyp};n++}},tt=(e,t)=>{let n=e;for(let e=0;e<t&&n;e++)n=n.rest;return n},nt=(e,t,n)=>{let r=[];return[t.reduce((e,t)=>{let[i,a]=n(e,t);return r.push(a),i},e),r]},rt=(e,t,n=0)=>({kind:`Fresh`,name:e,shape:n,level:t,domain:void 0,domainVisibility:`Visible`}),it=(e,t)=>({kind:`Fresh`,name:e,shape:0,level:`Constant`,domain:t,domainVisibility:`Visible`}),at=(e,t,n)=>{switch(e.kind){case`Shift`:return I({kind:`Ix`,index:e.amount+t},n);case`Cons`:return t===1?I(ct(e.expression),n):at(e.rest,t-1,n);case`Compose`:return L(e.outer,at(e.inner,t,n));case`Bump`:return t<=e.amount?I({kind:`Ix`,index:t},n):L(F(e.amount),at(e.rest,t-e.amount,n))}},ot=(e,t)=>t.map(t=>L(e,t)),st=(e,t)=>{if(e.kind===`Lambda`){if(e.params.length!==t.length)throw new j(`Arity mismatch`);return ct(L(Ke(t,F(0)),e.body))}return e.kind===`Apply`?{kind:`Apply`,operator:e.operator,args:[...e.args,...t]}:t.length===0?ct(e):{kind:`Apply`,operator:e,args:t}},ct=e=>{if(!e.location&&!e.isAtomic)return e;let{location:t,isAtomic:n,...r}=e;return r},lt=(e,t)=>[qe(t.length,e),bt(t,t=>L(e,t))],ut=(e,t)=>{switch(t.kind){case`Recursive`:case`Operator`:case`Bpragma`:return Ct(t,t=>L(e,t));case`Instance`:{let n=qe(t.instance.args.length,e);return{...t,instance:{...t.instance,substitutions:t.instance.substitutions.map(e=>({name:e.name,expression:L(n,e.expression)}))}}}}},dt=(e,t)=>{switch(t.kind){case`Fresh`:return t.domain?{...t,domain:L(e,t.domain)}:t;case`Flex`:return t;case`Defn`:return{...t,definition:ut(e,t.definition)};case`Fact`:return{...t,expression:L(e,t.expression)}}},ft=(e,t)=>{let[n,r]=nt(e,t.context,(e,t)=>[qe(1,e),dt(e,t)]);return{context:r,active:L(n,t.active)}},L=(e,t)=>{let n=t=>L(e,t);switch(t.kind){case`Internal`:case`Opaque`:case`String`:case`Num`:case`At`:return t;case`Ix`:return at(e,t.index,t);case`Apply`:return I(st(n(t.operator),ot(e,t.args)),t);case`Bang`:return{...t,expression:n(t.expression),selectors:t.selectors.map(e=>xt(e,n))};case`Lambda`:return{...t,body:L(qe(t.params.length,e),t.body)};case`Let`:{let[n,r]=nt(e,t.definitions,(e,t)=>[qe(1,e),ut(e,t)]);return{...t,definitions:r,body:L(n,t.body)}}case`Sequent`:return{...t,sequent:ft(e,t.sequent)};case`With`:return{...t,expression:n(t.expression)};case`If`:return{...t,condition:n(t.condition),consequent:n(t.consequent),alternative:n(t.alternative)};case`List`:return{...t,items:ot(e,t.items)};case`Quant`:{let[n,r]=lt(e,t.bounds);return{...t,bounds:r,body:L(n,t.body)}}case`Tquant`:return{...t,body:L(qe(t.names.length,e),t.body)};case`Choose`:return{...t,domain:t.domain&&n(t.domain),body:L(qe(1,e),t.body)};case`SetSt`:return{...t,domain:n(t.domain),body:L(qe(1,e),t.body)};case`SetOf`:{let[n,r]=lt(e,t.bounds);return{...t,bounds:r,element:L(n,t.element)}}case`SetEnum`:return{...t,elements:ot(e,t.elements)};case`Arrow`:return{...t,domain:n(t.domain),range:n(t.range)};case`Fcn`:{let[n,r]=lt(e,t.bounds);return{...t,bounds:r,body:L(n,t.body)}}case`FcnApp`:return{...t,function:n(t.function),args:ot(e,t.args)};case`Product`:return{...t,factors:ot(e,t.factors)};case`Tuple`:return{...t,elements:ot(e,t.elements)};case`Rect`:case`Record`:return{...t,fields:t.fields.map(e=>({name:e.name,value:n(e.value)}))};case`Except`:return{...t,function:n(t.function),specs:St(t.specs,n)};case`Dot`:return{...t,expression:n(t.expression)};case`Sub`:case`Tsub`:return{...t,action:n(t.action),subscript:n(t.subscript)};case`Fair`:return{...t,subscript:n(t.subscript),action:n(t.action)};case`Case`:return{...t,arms:t.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:t.other&&n(t.other)};case`Parens`:return{...t,expression:n(t.expression)}}},R=(e,t)=>e===0?t:L(F(e),t),pt=(e,t,n)=>e.length===t.length&&e.every((e,r)=>n(e,t[r])),mt=(e,t)=>{let n=new Map(e.map(e=>[e.name,e.value])),r=new Map(t.map(e=>[e.name,e.value]));if(n.size!==r.size)return!1;for(let[e,t]of n){let n=r.get(e);if(!n||!z(t,n))return!1}return!0},ht=(e,t)=>e.level===t.level&&e.domain.kind===t.domain.kind&&(e.domain.kind!==`Domain`||t.domain.kind===`Domain`&&z(e.domain.expression,t.domain.expression)),gt=(e,t)=>{if(e.kind!==t.kind)return!1;switch(e.kind){case`Number`:return t.kind===`Number`&&e.value===t.value;case`Instance`:return t.kind===`Instance`&&pt(e.args,t.args,z);case`Label`:return t.kind===`Label`&&e.label===t.label&&pt(e.args,t.args,z);default:return!0}},_t=(e,t)=>{if(e.kind===`Operator`&&t.kind===`Operator`||e.kind===`Bpragma`&&t.kind===`Bpragma`)return z(e.body,t.body);if(e.kind===`Instance`&&t.kind===`Instance`){let n=e.instance.substitutions.map(e=>({name:e.name,value:e.expression})),r=t.instance.substitutions.map(e=>({name:e.name,value:e.expression}));return pt(e.instance.args,t.instance.args,(e,t)=>e===t)&&e.instance.module===t.instance.module&&mt(n,r)}return!1},vt=(e,t)=>e.kind===`Fresh`&&t.kind===`Fresh`?e.level!==t.level||e.shape!==t.shape?!1:!e.domain||!t.domain?!e.domain&&!t.domain:z(e.domain,t.domain):e.kind===`Flex`&&t.kind===`Flex`?!0:e.kind===`Defn`&&t.kind===`Defn`?_t(e.definition,t.definition)&&e.isLocal===t.isLocal:e.kind===`Fact`&&t.kind===`Fact`&&z(e.expression,t.expression),yt=(e,t)=>pt(e.context,t.context,vt)&&z(e.active,t.active),z=(e,t)=>{if(e.kind===`Parens`)return z(e.expression,t);if(t.kind===`Parens`)return z(e,t.expression);switch(e.kind){case`Ix`:return t.kind===`Ix`&&e.index===t.index;case`Opaque`:return t.kind===`Opaque`&&e.name===t.name;case`Internal`:return t.kind===`Internal`&&e.builtin===t.builtin;case`Lambda`:return t.kind===`Lambda`&&e.params.length===t.params.length&&z(e.body,t.body);case`Apply`:return t.kind===`Apply`&&z(e.operator,t.operator)&&pt(e.args,t.args,z);case`Sequent`:return t.kind===`Sequent`&&yt(e.sequent,t.sequent);case`Bang`:return t.kind===`Bang`&&z(e.expression,t.expression)&&pt(e.selectors,t.selectors,gt);case`With`:return t.kind===`With`&&z(e.expression,t.expression);case`Let`:return t.kind===`Let`&&pt(e.definitions,t.definitions,_t)&&z(e.body,t.body);case`If`:return t.kind===`If`&&z(e.condition,t.condition)&&z(e.consequent,t.consequent)&&z(e.alternative,t.alternative);case`List`:return t.kind===`List`&&e.bullet===t.bullet&&pt(e.items,t.items,z);case`Quant`:return t.kind===`Quant`&&e.quantifier===t.quantifier&&pt(e.bounds,t.bounds,ht)&&z(e.body,t.body);case`Tquant`:return t.kind===`Tquant`&&e.quantifier===t.quantifier&&pt(e.names,t.names,(e,t)=>e===t)&&z(e.body,t.body);case`Choose`:return t.kind===`Choose`?e.domain&&t.domain?z(e.domain,t.domain)&&z(e.body,t.body):!e.domain&&!t.domain&&z(e.body,t.body):!1;case`SetSt`:return t.kind===`SetSt`&&z(e.domain,t.domain)&&z(e.body,t.body);case`SetOf`:return t.kind===`SetOf`&&z(e.element,t.element)&&pt(e.bounds,t.bounds,ht);case`SetEnum`:return t.kind===`SetEnum`&&pt(e.elements,t.elements,z);case`Arrow`:return t.kind===`Arrow`&&z(e.domain,t.domain)&&z(e.range,t.range);case`Fcn`:return t.kind===`Fcn`&&pt(e.bounds,t.bounds,ht)&&z(e.body,t.body);case`FcnApp`:return t.kind===`FcnApp`&&pt([e.function,...e.args],[t.function,...t.args],z);case`Tuple`:return t.kind===`Tuple`&&pt(e.elements,t.elements,z);case`Product`:return t.kind===`Product`&&pt(e.factors,t.factors,z);case`Rect`:return t.kind===`Rect`&&mt(e.fields,t.fields);case`Record`:return t.kind===`Record`&&mt(e.fields,t.fields);case`Except`:return t.kind===`Except`&&z(e.function,t.function)&&pt(e.specs,t.specs,(e,t)=>pt(e.trail,t.trail,(e,t)=>e.kind===`Dot`?t.kind===`Dot`&&e.field===t.field:t.kind===`Apply`&&z(e.expression,t.expression))&&z(e.value,t.value));case`Dot`:return t.kind===`Dot`&&z(e.expression,t.expression)&&e.field===t.field;case`Sub`:case`Tsub`:return t.kind===e.kind&&e.modal===t.modal&&z(e.action,t.action)&&z(e.subscript,t.subscript);case`Fair`:return t.kind===`Fair`&&e.fairness===t.fairness&&z(e.subscript,t.subscript)&&z(e.action,t.action);case`Case`:return t.kind!==`Case`||!(e.arms.length===0||t.arms.length===0?e.arms.length===t.arms.length:z(e.arms[0].condition,t.arms[0].condition)&&z(e.arms[0].body,t.arms[0].body))?!1:e.other&&t.other?z(e.other,t.other):!e.other&&!t.other;case`String`:return t.kind===`String`&&e.value===t.value;case`Num`:return t.kind===`Num`&&e.integer===t.integer&&e.fraction===t.fraction;case`At`:return t.kind===`At`&&e.isExcept===t.isExcept}},bt=(e,t)=>e.map(e=>e.domain.kind===`Domain`?{...e,domain:{kind:`Domain`,expression:t(e.domain.expression)}}:e),xt=(e,t)=>e.kind===`Instance`||e.kind===`Label`?{...e,args:e.args.map(t)}:e,St=(e,t)=>e.map(e=>{let n=t(e.value);return{trail:e.trail.map(e=>e.kind===`Apply`?{kind:`Apply`,expression:t(e.expression)}:e),value:n}}),Ct=(e,t)=>e.kind===`Operator`||e.kind===`Bpragma`?{...e,body:t(e.body)}:e,wt=(e,t,n)=>e.kind===`Fresh`?e.domain?{...e,domain:t(e.domain)}:e:e.kind===`Flex`||n===`visible`&&e.visibility===`Hidden`?e:e.kind===`Defn`?{...e,definition:Ct(e.definition,t)}:{...e,expression:t(e.expression)},Tt=(e,t,n,r,i=`visible`)=>{let a=t=>n(e,t),o=t=>t.reduce((e,t)=>r(e,rt(t.name,t.level)),e);switch(t.kind){case`Ix`:case`Internal`:case`Opaque`:case`String`:case`Num`:case`At`:return t;case`Lambda`:{let i=t.params.reduce((e,t)=>{let n=rt(t.name,`Unknown`,t.shape);return r(e,t.location?{...n,location:t.location}:n)},e);return{...t,body:n(i,t.body)}}case`Sequent`:{let[a,o]=nt(e,t.sequent.context,(e,t)=>{let a=wt(t,t=>n(e,t),i);return[r(e,a),a]});return{...t,sequent:{context:o,active:n(a,t.sequent.active)}}}case`Let`:{let[i,a]=nt(e,t.definitions,(e,t)=>{let i=Ct(t,t=>n(e,t));return[r(e,{kind:`Defn`,definition:i,whereDefined:`User`,visibility:`Visible`,isLocal:!0}),i]});return{...t,definitions:a,body:n(i,t.body)}}case`Quant`:case`Fcn`:{let e=bt(t.bounds,a);return{...t,bounds:e,body:n(o(e),t.body)}}case`SetOf`:{let e=bt(t.bounds,a);return{...t,bounds:e,element:n(o(e),t.element)}}case`Tquant`:{let i=t.names.reduce((e,t)=>r(e,{kind:`Flex`,name:t}),e);return{...t,body:n(i,t.body)}}case`Choose`:{let i=t.domain&&a(t.domain),o=i?it(t.name,i):rt(t.name,`Constant`);return{...t,domain:i,body:n(r(e,o),t.body)}}case`SetSt`:{let i=a(t.domain),o=it(t.name,i);return{...t,domain:i,body:n(r(e,o),t.body)}}case`Bang`:{let e=t.selectors.map(e=>xt(e,a));return{...t,expression:a(t.expression),selectors:e}}case`Apply`:{let e=t.args.map(a);return{...t,operator:a(t.operator),args:e}}case`With`:case`Dot`:case`Parens`:return{...t,expression:a(t.expression)};case`If`:{let e=a(t.alternative),n=a(t.consequent);return{...t,condition:a(t.condition),consequent:n,alternative:e}}case`List`:return{...t,items:t.items.map(a)};case`SetEnum`:case`Tuple`:return{...t,elements:t.elements.map(a)};case`Product`:return{...t,factors:t.factors.map(a)};case`FcnApp`:{let e=t.args.map(a);return{...t,function:a(t.function),args:e}}case`Arrow`:{let e=a(t.range);return{...t,domain:a(t.domain),range:e}}case`Rect`:case`Record`:return{...t,fields:t.fields.map(e=>({name:e.name,value:a(e.value)}))};case`Except`:{let e=St(t.specs,a);return{...t,function:a(t.function),specs:e}}case`Sub`:case`Tsub`:case`Fair`:return{...t,subscript:a(t.subscript),action:a(t.action)};case`Case`:{let e=t.other&&a(t.other),n=t.arms.map(e=>{let t=a(e.body);return{condition:a(e.condition),body:t}});return{...t,arms:n,other:e}}}},Et=(e,t)=>Tt(void 0,e,(e,n)=>t(n),()=>void 0,`all`),Dt=e=>{let t=[];return Et(e,e=>(t.push(e),e)),t},Ot={kind:`Opaque`,name:`$Bad`},kt=e=>e.kind===`Opaque`&&e.name===Ot.name,At=e=>{let t=e.kind===`Parens`?At(e.expression):Et(e,At);if(!t.isAtomic)return t;let{isAtomic:n,...r}=t;return r},jt=e=>e.kind===`Let`?I({kind:`Let`,definitions:e.definitions,body:jt(e.body)},e.body):e.kind===`Parens`?jt(e.expression):Et(e,jt),Mt=e=>e.kind===`Ix`?e.index<=0:Dt(e).some(Mt),Nt=(e,t,n)=>{let r=(e,r=n)=>Nt(e,t,r),i=(e,t)=>e.reduce((e,t)=>e??(t.domain.kind===`Domain`?r(t.domain.expression):void 0),void 0)??r(t,[...n,...e.map(e=>rt(e.name,e.level))]);switch(e.kind){case`Parens`:return e.form.kind===`Xlabel`?e.form.label===t?{context:n,expression:e.expression,indices:e.form.indices}:void 0:r(e.expression);case`Lambda`:return r(e.body,[...n,...e.params.map(e=>rt(e.name,`Unknown`,e.shape))]);case`Let`:{let t=[...n];for(let n of e.definitions){let e=n.kind===`Operator`||n.kind===`Bpragma`?r(n.body,[...t]):void 0;if(e)return e;t.push({kind:`Defn`,definition:n,whereDefined:`Builtin`,visibility:`Visible`,isLocal:!0})}return r(e.body,t)}case`Quant`:case`Fcn`:return i(e.bounds,e.body);case`SetOf`:return i(e.bounds,e.element);case`Tquant`:return r(e.body,[...n,...e.names.map(e=>({kind:`Flex`,name:e}))]);case`Choose`:case`SetSt`:return(e.domain&&r(e.domain))??r(e.body,[...n,rt(e.name,`Constant`)]);case`Sequent`:{let t=[...n];for(let n of e.sequent.context){if(n.kind!==`Fact`)return;let e=r(n.expression,[...t]);if(e)return e;t.push(n)}return r(e.sequent.active,t)}default:for(let t of Dt(e)){let e=r(t);if(e)return e}return}},Pt=(e,t)=>Ke(Array.from({length:e},(e,t)=>({kind:`Ix`,index:t+1})),F(e+t)),Ft=e=>Array.from({length:e},(t,n)=>({kind:`Ix`,index:e-n})),It=(e,t,n)=>{switch(t.kind){case`Quant`:case`Fcn`:case`SetOf`:{if(t.bounds.length!==n.length){let r=t.bounds.length,i=`Arity mismatch in subexpression instance.\nExpected ${r} argument${r===1?``:`s`}, but found${n.length<r?` only`:``} ${n.length}.`;throw e(P(t.location,i)),new j(i,{failure:`Expr.Deref.deref_inst`})}let r=t.kind===`SetOf`?t.element:t.body;return L(Ke(n,F(0)),r)}case`Tquant`:return It(e,I({kind:`Quant`,quantifier:t.quantifier,bounds:t.names.map(e=>({name:e,level:`State`,domain:{kind:`NoDomain`}})),body:t.body},t),n);case`Lambda`:return It(e,I({kind:`Quant`,quantifier:`Forall`,bounds:t.params.map(e=>({name:e.name,level:`Unknown`,domain:{kind:`NoDomain`}})),body:t.body},t),n);case`SetSt`:case`Choose`:if(n.length!==1){let r=`Arity mismatch in subexpression instance.\nExpected 1 argument, but found ${n.length}.`;throw e(P(t.location,r)),new j(r,{failure:`Expr.Deref.deref_inst`})}return L(Ke(n,F(0)),t.body);default:{let n=`Cannot instantiate non-binding expression`;throw e(P(t.location,n)),new j(n,{failure:`Expr.Deref.deref_inst`})}}},Lt=(e,t,n)=>{let r=(()=>{switch(n.kind){case`Quant`:case`Fcn`:case`SetOf`:return n.bounds.map(e=>({name:e.name,shape:0}));case`Tquant`:return n.names.map(e=>({name:e,shape:0}));case`Lambda`:return n.params;case`SetSt`:case`Choose`:return[{name:n.name,shape:0}];default:{let t=`Cannot abstract over bound variables in a non-binding expression`;throw e(P(n.location,t)),new j(t,{failure:`Expr.Deref.deref_at`})}}})(),i=L(Pt(t,r.length),n);return[r,It(e,i,Ft(r.length))]},Rt=(e,t,n,r,i,a)=>{let o=t=>{if(!(r<=t))throw e(P(i.location,a)),new j(a,{failure:`Expr.Deref.deref_num`})},s=e=>(o(e.length),e[r-1]),c=(()=>{switch(n.kind){case`Sequent`:{let i=n.sequent;o(i.context.length+1);let a=i.context[r-1];if(a&&a.kind!==`Fact`){let t=`subexpression reference does not resolve to an expression`;throw e(P(n.location,t)),new j(t,{failure:`Expr.Deref.deref_num`})}let s=L(F(-(r-1)),a?a.expression:i.active);if(Mt(s))throw e(P(n.location,`subexpression of ASSUME/PROVE uses identifiers declared therein
|
|
9
|
+
import{$ as e,A as t,B as n,C as r,D as i,E as a,H as o,I as s,K as c,L as l,M as u,O as d,Q as f,R as p,T as m,U as h,V as g,W as _,Z as v,_ as y,_t as b,at as x,ct as S,dt as ee,et as C,ft as w,gt as T,h as E,ht as te,it as D,j as ne,k as re,lt as ie,m as ae,mt as O,nt as oe,ot as se,pt as ce,rt as k,st as A,tt as le,ut as j,v as ue,vt as de,w as fe,yt as pe,z as me}from"./transfer.js";import{t as he}from"./parallel.js";import{basename as ge,delimiter as _e,dirname as ve,isAbsolute as M,join as ye,resolve as be}from"node:path";import{existsSync as xe,globSync as Se,mkdirSync as Ce,readFileSync as we,readSync as Te,realpathSync as Ee,writeFileSync as De}from"node:fs";import{spawnSync as Oe}from"node:child_process";import{createHash as ke}from"node:crypto";import{arch as Ae,availableParallelism as je,release as Me,tmpdir as Ne,type as Pe}from"node:os";import{pathToFileURL as N}from"node:url";import{getHeapStatistics as Fe}from"node:v8";import{strFromU8 as Ie,unzipSync as Le}from"fflate";var Re=`0.0.3-dev.baa5e34`;const ze=e=>{let t=e.isRequired?e.flag:`[${e.flag}]`;return e.isRepeatable?`${t}...`:t},Be=(e,t)=>{let n=new Map(t.map(e=>{let[t,...n]=e.flag.split(` `);return[t,e.getArity??(()=>n.length)]}));return{usage:e.replace(`{options}`,t.map(ze).join(` `)),parse:e=>{let t=[],r=[],i=[],a=[];for(let o=0;o<e.length;o++){let s=n.get(e[o]);if(s===void 0){(e[o].startsWith(`-`)?i:r).push(e[o]);continue}let c=s(e.slice(o+1)),l={name:e[o],values:e.slice(o+1,o+1+c)};t.push(l),l.values.length<c&&a.push(l),o+=c}return{options:t,positionals:r,unknown:i,incomplete:a[0],has:e=>t.some(t=>t.name===e),get:e=>t.findLast(t=>t.name===e)?.values}}}},Ve=e=>{let t=e.endColumn-1;return e.startLine===e.endLine?e.startColumn>=t?`line ${e.startLine}, character ${e.startColumn}`:`line ${e.startLine}, characters ${e.startColumn}-${t}`:`line ${e.startLine}, character ${e.startColumn} to line ${e.endLine}, character ${t}`},He=e=>`File ${JSON.stringify(e.file)}, ${Ve(e)}`,Ue=e=>`${e?He(e):`<unknown location>`}:\n`,P=(e,t)=>({text:`${Ue(e)}Error: ${t}`,channel:`stderr`}),We=e=>e?`${He(e)} :\n`:``,F=e=>({kind:`Shift`,amount:e}),Ge=(e,t)=>({kind:`Cons`,expression:e,rest:t}),Ke=(e,t)=>e.reduce((e,t)=>Ge(t,e),t),qe=(e,t)=>t.kind===`Bump`?{kind:`Bump`,amount:t.amount+e,rest:t.rest}:{kind:`Bump`,amount:e,rest:t},I=(e,t)=>{let n=t.location?{...e,location:t.location}:e;return t.isAtomic?{...n,isAtomic:!0}:n},Je=e=>{switch(e.kind){case`Fresh`:case`Flex`:return e.name;case`Defn`:return e.definition.name;case`Fact`:return}},Ye=(e,t,n)=>I({kind:`Apply`,operator:I({kind:`Internal`,builtin:e},n),args:t},n),Xe=e=>e.context.length===0?e.active:{kind:`Sequent`,sequent:e},Ze=(e,t)=>({hyp:t,rest:e,size:(e?.size??0)+1}),Qe=(e,t)=>t.reduce(Ze,e),$e=e=>{let t=[];for(let n=e;n;n=n.rest)t.push(n.hyp);return t.reverse()},et=(e,t)=>{let n=0;for(let r=e;r;r=r.rest){if(Je(r.hyp)===t)return{depth:n,hyp:r.hyp};n++}},tt=(e,t)=>{let n=e;for(let e=0;e<t&&n;e++)n=n.rest;return n},nt=(e,t,n)=>{let r=[];return[t.reduce((e,t)=>{let[i,a]=n(e,t);return r.push(a),i},e),r]},rt=(e,t,n=0)=>({kind:`Fresh`,name:e,shape:n,level:t,domain:void 0,domainVisibility:`Visible`}),it=(e,t)=>({kind:`Fresh`,name:e,shape:0,level:`Constant`,domain:t,domainVisibility:`Visible`}),at=(e,t,n)=>{switch(e.kind){case`Shift`:return I({kind:`Ix`,index:e.amount+t},n);case`Cons`:return t===1?I(ct(e.expression),n):at(e.rest,t-1,n);case`Compose`:return L(e.outer,at(e.inner,t,n));case`Bump`:return t<=e.amount?I({kind:`Ix`,index:t},n):L(F(e.amount),at(e.rest,t-e.amount,n))}},ot=(e,t)=>t.map(t=>L(e,t)),st=(e,t)=>{if(e.kind===`Lambda`){if(e.params.length!==t.length)throw new j(`Arity mismatch`);return ct(L(Ke(t,F(0)),e.body))}return e.kind===`Apply`?{kind:`Apply`,operator:e.operator,args:[...e.args,...t]}:t.length===0?ct(e):{kind:`Apply`,operator:e,args:t}},ct=e=>{if(!e.location&&!e.isAtomic)return e;let{location:t,isAtomic:n,...r}=e;return r},lt=(e,t)=>[qe(t.length,e),bt(t,t=>L(e,t))],ut=(e,t)=>{switch(t.kind){case`Recursive`:case`Operator`:case`Bpragma`:return Ct(t,t=>L(e,t));case`Instance`:{let n=qe(t.instance.args.length,e);return{...t,instance:{...t.instance,substitutions:t.instance.substitutions.map(e=>({name:e.name,expression:L(n,e.expression)}))}}}}},dt=(e,t)=>{switch(t.kind){case`Fresh`:return t.domain?{...t,domain:L(e,t.domain)}:t;case`Flex`:return t;case`Defn`:return{...t,definition:ut(e,t.definition)};case`Fact`:return{...t,expression:L(e,t.expression)}}},ft=(e,t)=>{let[n,r]=nt(e,t.context,(e,t)=>[qe(1,e),dt(e,t)]);return{context:r,active:L(n,t.active)}},L=(e,t)=>{let n=t=>L(e,t);switch(t.kind){case`Internal`:case`Opaque`:case`String`:case`Num`:case`At`:return t;case`Ix`:return at(e,t.index,t);case`Apply`:return I(st(n(t.operator),ot(e,t.args)),t);case`Bang`:return{...t,expression:n(t.expression),selectors:t.selectors.map(e=>xt(e,n))};case`Lambda`:return{...t,body:L(qe(t.params.length,e),t.body)};case`Let`:{let[n,r]=nt(e,t.definitions,(e,t)=>[qe(1,e),ut(e,t)]);return{...t,definitions:r,body:L(n,t.body)}}case`Sequent`:return{...t,sequent:ft(e,t.sequent)};case`With`:return{...t,expression:n(t.expression)};case`If`:return{...t,condition:n(t.condition),consequent:n(t.consequent),alternative:n(t.alternative)};case`List`:return{...t,items:ot(e,t.items)};case`Quant`:{let[n,r]=lt(e,t.bounds);return{...t,bounds:r,body:L(n,t.body)}}case`Tquant`:return{...t,body:L(qe(t.names.length,e),t.body)};case`Choose`:return{...t,domain:t.domain&&n(t.domain),body:L(qe(1,e),t.body)};case`SetSt`:return{...t,domain:n(t.domain),body:L(qe(1,e),t.body)};case`SetOf`:{let[n,r]=lt(e,t.bounds);return{...t,bounds:r,element:L(n,t.element)}}case`SetEnum`:return{...t,elements:ot(e,t.elements)};case`Arrow`:return{...t,domain:n(t.domain),range:n(t.range)};case`Fcn`:{let[n,r]=lt(e,t.bounds);return{...t,bounds:r,body:L(n,t.body)}}case`FcnApp`:return{...t,function:n(t.function),args:ot(e,t.args)};case`Product`:return{...t,factors:ot(e,t.factors)};case`Tuple`:return{...t,elements:ot(e,t.elements)};case`Rect`:case`Record`:return{...t,fields:t.fields.map(e=>({name:e.name,value:n(e.value)}))};case`Except`:return{...t,function:n(t.function),specs:St(t.specs,n)};case`Dot`:return{...t,expression:n(t.expression)};case`Sub`:case`Tsub`:return{...t,action:n(t.action),subscript:n(t.subscript)};case`Fair`:return{...t,subscript:n(t.subscript),action:n(t.action)};case`Case`:return{...t,arms:t.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:t.other&&n(t.other)};case`Parens`:return{...t,expression:n(t.expression)}}},R=(e,t)=>e===0?t:L(F(e),t),pt=(e,t,n)=>e.length===t.length&&e.every((e,r)=>n(e,t[r])),mt=(e,t)=>{let n=new Map(e.map(e=>[e.name,e.value])),r=new Map(t.map(e=>[e.name,e.value]));if(n.size!==r.size)return!1;for(let[e,t]of n){let n=r.get(e);if(!n||!z(t,n))return!1}return!0},ht=(e,t)=>e.level===t.level&&e.domain.kind===t.domain.kind&&(e.domain.kind!==`Domain`||t.domain.kind===`Domain`&&z(e.domain.expression,t.domain.expression)),gt=(e,t)=>{if(e.kind!==t.kind)return!1;switch(e.kind){case`Number`:return t.kind===`Number`&&e.value===t.value;case`Instance`:return t.kind===`Instance`&&pt(e.args,t.args,z);case`Label`:return t.kind===`Label`&&e.label===t.label&&pt(e.args,t.args,z);default:return!0}},_t=(e,t)=>{if(e.kind===`Operator`&&t.kind===`Operator`||e.kind===`Bpragma`&&t.kind===`Bpragma`)return z(e.body,t.body);if(e.kind===`Instance`&&t.kind===`Instance`){let n=e.instance.substitutions.map(e=>({name:e.name,value:e.expression})),r=t.instance.substitutions.map(e=>({name:e.name,value:e.expression}));return pt(e.instance.args,t.instance.args,(e,t)=>e===t)&&e.instance.module===t.instance.module&&mt(n,r)}return!1},vt=(e,t)=>e.kind===`Fresh`&&t.kind===`Fresh`?e.level!==t.level||e.shape!==t.shape?!1:!e.domain||!t.domain?!e.domain&&!t.domain:z(e.domain,t.domain):e.kind===`Flex`&&t.kind===`Flex`?!0:e.kind===`Defn`&&t.kind===`Defn`?_t(e.definition,t.definition)&&e.isLocal===t.isLocal:e.kind===`Fact`&&t.kind===`Fact`&&z(e.expression,t.expression),yt=(e,t)=>pt(e.context,t.context,vt)&&z(e.active,t.active),z=(e,t)=>{if(e.kind===`Parens`)return z(e.expression,t);if(t.kind===`Parens`)return z(e,t.expression);switch(e.kind){case`Ix`:return t.kind===`Ix`&&e.index===t.index;case`Opaque`:return t.kind===`Opaque`&&e.name===t.name;case`Internal`:return t.kind===`Internal`&&e.builtin===t.builtin;case`Lambda`:return t.kind===`Lambda`&&e.params.length===t.params.length&&z(e.body,t.body);case`Apply`:return t.kind===`Apply`&&z(e.operator,t.operator)&&pt(e.args,t.args,z);case`Sequent`:return t.kind===`Sequent`&&yt(e.sequent,t.sequent);case`Bang`:return t.kind===`Bang`&&z(e.expression,t.expression)&&pt(e.selectors,t.selectors,gt);case`With`:return t.kind===`With`&&z(e.expression,t.expression);case`Let`:return t.kind===`Let`&&pt(e.definitions,t.definitions,_t)&&z(e.body,t.body);case`If`:return t.kind===`If`&&z(e.condition,t.condition)&&z(e.consequent,t.consequent)&&z(e.alternative,t.alternative);case`List`:return t.kind===`List`&&e.bullet===t.bullet&&pt(e.items,t.items,z);case`Quant`:return t.kind===`Quant`&&e.quantifier===t.quantifier&&pt(e.bounds,t.bounds,ht)&&z(e.body,t.body);case`Tquant`:return t.kind===`Tquant`&&e.quantifier===t.quantifier&&pt(e.names,t.names,(e,t)=>e===t)&&z(e.body,t.body);case`Choose`:return t.kind===`Choose`?e.domain&&t.domain?z(e.domain,t.domain)&&z(e.body,t.body):!e.domain&&!t.domain&&z(e.body,t.body):!1;case`SetSt`:return t.kind===`SetSt`&&z(e.domain,t.domain)&&z(e.body,t.body);case`SetOf`:return t.kind===`SetOf`&&z(e.element,t.element)&&pt(e.bounds,t.bounds,ht);case`SetEnum`:return t.kind===`SetEnum`&&pt(e.elements,t.elements,z);case`Arrow`:return t.kind===`Arrow`&&z(e.domain,t.domain)&&z(e.range,t.range);case`Fcn`:return t.kind===`Fcn`&&pt(e.bounds,t.bounds,ht)&&z(e.body,t.body);case`FcnApp`:return t.kind===`FcnApp`&&pt([e.function,...e.args],[t.function,...t.args],z);case`Tuple`:return t.kind===`Tuple`&&pt(e.elements,t.elements,z);case`Product`:return t.kind===`Product`&&pt(e.factors,t.factors,z);case`Rect`:return t.kind===`Rect`&&mt(e.fields,t.fields);case`Record`:return t.kind===`Record`&&mt(e.fields,t.fields);case`Except`:return t.kind===`Except`&&z(e.function,t.function)&&pt(e.specs,t.specs,(e,t)=>pt(e.trail,t.trail,(e,t)=>e.kind===`Dot`?t.kind===`Dot`&&e.field===t.field:t.kind===`Apply`&&z(e.expression,t.expression))&&z(e.value,t.value));case`Dot`:return t.kind===`Dot`&&z(e.expression,t.expression)&&e.field===t.field;case`Sub`:case`Tsub`:return t.kind===e.kind&&e.modal===t.modal&&z(e.action,t.action)&&z(e.subscript,t.subscript);case`Fair`:return t.kind===`Fair`&&e.fairness===t.fairness&&z(e.subscript,t.subscript)&&z(e.action,t.action);case`Case`:return t.kind!==`Case`||!(e.arms.length===0||t.arms.length===0?e.arms.length===t.arms.length:z(e.arms[0].condition,t.arms[0].condition)&&z(e.arms[0].body,t.arms[0].body))?!1:e.other&&t.other?z(e.other,t.other):!e.other&&!t.other;case`String`:return t.kind===`String`&&e.value===t.value;case`Num`:return t.kind===`Num`&&e.integer===t.integer&&e.fraction===t.fraction;case`At`:return t.kind===`At`&&e.isExcept===t.isExcept}},bt=(e,t)=>e.map(e=>e.domain.kind===`Domain`?{...e,domain:{kind:`Domain`,expression:t(e.domain.expression)}}:e),xt=(e,t)=>e.kind===`Instance`||e.kind===`Label`?{...e,args:e.args.map(t)}:e,St=(e,t)=>e.map(e=>{let n=t(e.value);return{trail:e.trail.map(e=>e.kind===`Apply`?{kind:`Apply`,expression:t(e.expression)}:e),value:n}}),Ct=(e,t)=>e.kind===`Operator`||e.kind===`Bpragma`?{...e,body:t(e.body)}:e,wt=(e,t,n)=>e.kind===`Fresh`?e.domain?{...e,domain:t(e.domain)}:e:e.kind===`Flex`||n===`visible`&&e.visibility===`Hidden`?e:e.kind===`Defn`?{...e,definition:Ct(e.definition,t)}:{...e,expression:t(e.expression)},Tt=(e,t,n,r,i=`visible`)=>{let a=t=>n(e,t),o=t=>t.reduce((e,t)=>r(e,rt(t.name,t.level)),e);switch(t.kind){case`Ix`:case`Internal`:case`Opaque`:case`String`:case`Num`:case`At`:return t;case`Lambda`:{let i=t.params.reduce((e,t)=>{let n=rt(t.name,`Unknown`,t.shape);return r(e,t.location?{...n,location:t.location}:n)},e);return{...t,body:n(i,t.body)}}case`Sequent`:{let[a,o]=nt(e,t.sequent.context,(e,t)=>{let a=wt(t,t=>n(e,t),i);return[r(e,a),a]});return{...t,sequent:{context:o,active:n(a,t.sequent.active)}}}case`Let`:{let[i,a]=nt(e,t.definitions,(e,t)=>{let i=Ct(t,t=>n(e,t));return[r(e,{kind:`Defn`,definition:i,whereDefined:`User`,visibility:`Visible`,isLocal:!0}),i]});return{...t,definitions:a,body:n(i,t.body)}}case`Quant`:case`Fcn`:{let e=bt(t.bounds,a);return{...t,bounds:e,body:n(o(e),t.body)}}case`SetOf`:{let e=bt(t.bounds,a);return{...t,bounds:e,element:n(o(e),t.element)}}case`Tquant`:{let i=t.names.reduce((e,t)=>r(e,{kind:`Flex`,name:t}),e);return{...t,body:n(i,t.body)}}case`Choose`:{let i=t.domain&&a(t.domain),o=i?it(t.name,i):rt(t.name,`Constant`);return{...t,domain:i,body:n(r(e,o),t.body)}}case`SetSt`:{let i=a(t.domain),o=it(t.name,i);return{...t,domain:i,body:n(r(e,o),t.body)}}case`Bang`:{let e=t.selectors.map(e=>xt(e,a));return{...t,expression:a(t.expression),selectors:e}}case`Apply`:{let e=t.args.map(a);return{...t,operator:a(t.operator),args:e}}case`With`:case`Dot`:case`Parens`:return{...t,expression:a(t.expression)};case`If`:{let e=a(t.alternative),n=a(t.consequent);return{...t,condition:a(t.condition),consequent:n,alternative:e}}case`List`:return{...t,items:t.items.map(a)};case`SetEnum`:case`Tuple`:return{...t,elements:t.elements.map(a)};case`Product`:return{...t,factors:t.factors.map(a)};case`FcnApp`:{let e=t.args.map(a);return{...t,function:a(t.function),args:e}}case`Arrow`:{let e=a(t.range);return{...t,domain:a(t.domain),range:e}}case`Rect`:case`Record`:return{...t,fields:t.fields.map(e=>({name:e.name,value:a(e.value)}))};case`Except`:{let e=St(t.specs,a);return{...t,function:a(t.function),specs:e}}case`Sub`:case`Tsub`:case`Fair`:return{...t,subscript:a(t.subscript),action:a(t.action)};case`Case`:{let e=t.other&&a(t.other),n=t.arms.map(e=>{let t=a(e.body);return{condition:a(e.condition),body:t}});return{...t,arms:n,other:e}}}},Et=(e,t)=>Tt(void 0,e,(e,n)=>t(n),()=>void 0,`all`),Dt=e=>{let t=[];return Et(e,e=>(t.push(e),e)),t},Ot={kind:`Opaque`,name:`$Bad`},kt=e=>e.kind===`Opaque`&&e.name===Ot.name,At=e=>{let t=e.kind===`Parens`?At(e.expression):Et(e,At);if(!t.isAtomic)return t;let{isAtomic:n,...r}=t;return r},jt=e=>e.kind===`Let`?I({kind:`Let`,definitions:e.definitions,body:jt(e.body)},e.body):e.kind===`Parens`?jt(e.expression):Et(e,jt),Mt=e=>e.kind===`Ix`?e.index<=0:Dt(e).some(Mt),Nt=(e,t,n)=>{let r=(e,r=n)=>Nt(e,t,r),i=(e,t)=>e.reduce((e,t)=>e??(t.domain.kind===`Domain`?r(t.domain.expression):void 0),void 0)??r(t,[...n,...e.map(e=>rt(e.name,e.level))]);switch(e.kind){case`Parens`:return e.form.kind===`Xlabel`?e.form.label===t?{context:n,expression:e.expression,indices:e.form.indices}:void 0:r(e.expression);case`Lambda`:return r(e.body,[...n,...e.params.map(e=>rt(e.name,`Unknown`,e.shape))]);case`Let`:{let t=[...n];for(let n of e.definitions){let e=n.kind===`Operator`||n.kind===`Bpragma`?r(n.body,[...t]):void 0;if(e)return e;t.push({kind:`Defn`,definition:n,whereDefined:`Builtin`,visibility:`Visible`,isLocal:!0})}return r(e.body,t)}case`Quant`:case`Fcn`:return i(e.bounds,e.body);case`SetOf`:return i(e.bounds,e.element);case`Tquant`:return r(e.body,[...n,...e.names.map(e=>({kind:`Flex`,name:e}))]);case`Choose`:case`SetSt`:return(e.domain&&r(e.domain))??r(e.body,[...n,rt(e.name,`Constant`)]);case`Sequent`:{let t=[...n];for(let n of e.sequent.context){if(n.kind!==`Fact`)return;let e=r(n.expression,[...t]);if(e)return e;t.push(n)}return r(e.sequent.active,t)}default:for(let t of Dt(e)){let e=r(t);if(e)return e}return}},Pt=(e,t)=>Ke(Array.from({length:e},(e,t)=>({kind:`Ix`,index:t+1})),F(e+t)),Ft=e=>Array.from({length:e},(t,n)=>({kind:`Ix`,index:e-n})),It=(e,t,n)=>{switch(t.kind){case`Quant`:case`Fcn`:case`SetOf`:{if(t.bounds.length!==n.length){let r=t.bounds.length,i=`Arity mismatch in subexpression instance.\nExpected ${r} argument${r===1?``:`s`}, but found${n.length<r?` only`:``} ${n.length}.`;throw e(P(t.location,i)),new j(i,{failure:`Expr.Deref.deref_inst`})}let r=t.kind===`SetOf`?t.element:t.body;return L(Ke(n,F(0)),r)}case`Tquant`:return It(e,I({kind:`Quant`,quantifier:t.quantifier,bounds:t.names.map(e=>({name:e,level:`State`,domain:{kind:`NoDomain`}})),body:t.body},t),n);case`Lambda`:return It(e,I({kind:`Quant`,quantifier:`Forall`,bounds:t.params.map(e=>({name:e.name,level:`Unknown`,domain:{kind:`NoDomain`}})),body:t.body},t),n);case`SetSt`:case`Choose`:if(n.length!==1){let r=`Arity mismatch in subexpression instance.\nExpected 1 argument, but found ${n.length}.`;throw e(P(t.location,r)),new j(r,{failure:`Expr.Deref.deref_inst`})}return L(Ke(n,F(0)),t.body);default:{let n=`Cannot instantiate non-binding expression`;throw e(P(t.location,n)),new j(n,{failure:`Expr.Deref.deref_inst`})}}},Lt=(e,t,n)=>{let r=(()=>{switch(n.kind){case`Quant`:case`Fcn`:case`SetOf`:return n.bounds.map(e=>({name:e.name,shape:0}));case`Tquant`:return n.names.map(e=>({name:e,shape:0}));case`Lambda`:return n.params;case`SetSt`:case`Choose`:return[{name:n.name,shape:0}];default:{let t=`Cannot abstract over bound variables in a non-binding expression`;throw e(P(n.location,t)),new j(t,{failure:`Expr.Deref.deref_at`})}}})(),i=L(Pt(t,r.length),n);return[r,It(e,i,Ft(r.length))]},Rt=(e,t,n,r,i,a)=>{let o=t=>{if(!(r<=t))throw e(P(i.location,a)),new j(a,{failure:`Expr.Deref.deref_num`})},s=e=>(o(e.length),e[r-1]),c=(()=>{switch(n.kind){case`Sequent`:{let i=n.sequent;o(i.context.length+1);let a=i.context[r-1];if(a&&a.kind!==`Fact`){let t=`subexpression reference does not resolve to an expression`;throw e(P(n.location,t)),new j(t,{failure:`Expr.Deref.deref_num`})}let s=L(F(-(r-1)),a?a.expression:i.active);if(Mt(s))throw e(P(n.location,`subexpression of ASSUME/PROVE uses identifiers declared therein
|
|
10
10
|
Tlapm does not handle yet such subexpression namings.`)),new j(`Subexpression of ASSUME/PROVE uses identifiers declared therein
|
|
11
11
|
|
|
12
12
|
Tlapm does not handle yet such subexpression namings.`,{failure:`Expr.Deref.deref_num`});return[t,s]}case`Apply`:return[t,s(n.args)];case`With`:return Rt(e,t,n.expression,r,i,a);case`If`:return[t,s([n.condition,n.consequent,n.alternative])];case`List`:return[t,s(n.items)];case`SetEnum`:case`Tuple`:return[t,s(n.elements)];case`Product`:return[t,s(n.factors)];case`Let`:return o(1),[[...t,...n.definitions],n.body];case`Quant`:case`SetOf`:case`Fcn`:return[t,s(n.bounds.flatMap(e=>e.domain.kind===`Domain`?[e.domain.expression]:[]))];case`Choose`:case`SetSt`:if(!n.domain)break;return[t,s([n.domain])];case`Arrow`:return[t,s([n.domain,n.range])];case`FcnApp`:{let e=n.args.length===1?n.args[0]:I({kind:`Tuple`,elements:n.args},n);return[t,s([n.function,e])]}case`Rect`:case`Record`:return[t,s(n.fields.map(e=>e.value))];case`Dot`:return[t,s([n.expression,I({kind:`String`,value:n.field},n)])];case`Except`:return[t,s([n.function,...n.specs.map(e=>e.value)])];case`Sub`:case`Tsub`:return[t,s([n.action,n.subscript])];case`Fair`:return[t,s([n.subscript,n.action])];case`Case`:return[t,s([...n.arms.map(e=>I({kind:`Tuple`,elements:[e.condition,e.body]},e.body)),...n.other?[I({kind:`Tuple`,elements:[Ot,n.other]},n.other)]:[]])]}let c=`Expression has no subexpressions`;throw e(P(n.location,c)),new j(c,{failure:`Expr.Deref.deref_num`})})();if(kt(c[1])){let t=`Cannot resolve subexpression reference !${r}`;throw e(P(n.location,t)),new j(t,{failure:`Expr.Deref.deref_num`})}return c},zt=(e,t)=>{let n=e.length,r=e;for(let e=n-1;e>=0;e--)r.includes(n-e)||(r=r.map(t=>t+e<n?t:t-1));return r.map(e=>t[n-e])},Bt=(e,t,n,r,i)=>{let a=Nt(n,r,[]);if(!a)return e(P(n.location,`Could not find label ${r}`)),{params:[],definitions:[],expression:Ot};let o=a.indices;if(o.length!==i.length&&i.length>0){let t=o.length===1?``:`s`,n=`Expected ${o.length} argument${t} for labelled reference !${r}, but found ${i.length}`;throw e(P(a.expression.location,n)),new j(n,{failure:`Expr.Deref.deref_lsub`})}let s=i.length===0?o.map(e=>({name:e.name,shape:0})):[],c=i.length===0?Ft(o.length):i,l=a.context.reduceRight((e,t)=>t.kind===`Defn`?I({kind:`Let`,definitions:[t.definition],body:e},e):t.kind===`Fresh`?I({kind:`Quant`,quantifier:`Forall`,bounds:[{name:t.name,level:`Constant`,domain:{kind:`NoDomain`}}],body:e},e):L(F(-1),e),a.expression),u=L(Pt(t,s.length),l),d=[],f=u,p=zt(o.map(e=>e.index),c);for(;p.length>0;)if(f.kind===`Let`&&f.definitions.length===1)d.push(f.definitions[0]),f=f.body,p=p.map(e=>L(F(1),e));else{if(f.kind!==`Quant`||f.bounds.length!==1)throw new O(`File "src/expr/e_deref.ml", line 477, characters 21-33: Assertion failed`);f=L(Ge(p[0],F(0)),f.body),p=p.slice(1)}return{params:s,definitions:d,expression:f}},Vt=(e,t,n,r,i)=>{if(n.kind!==`Let`)throw e(P(n.location,`not a LET expression`)),new j(`not a LET expression`,{failure:`Expr.Deref.deref_letop`});let a=n.definitions.findIndex(e=>e.kind===`Operator`&&e.name===r),o=n.definitions[a];if(!o||o.kind!==`Operator`){let t=`no definition of operator ${r}`;throw e(P(n.location,t)),new j(t,{failure:`Expr.Deref.deref_letop`})}let s=o.body,c=s.kind===`Lambda`?I({...s,body:I({kind:`Parens`,expression:s.body,form:{kind:`Xlabel`,label:r,indices:s.params.map((e,t)=>({name:e.name,index:s.params.length-t}))}},s.body)},s):I({kind:`Parens`,expression:s,form:{kind:`Xlabel`,label:r,indices:[]}},s);return Bt(e,t,I({kind:`Let`,definitions:n.definitions.slice(0,a),body:c},s),r,i)},Ht=(e,t,n,r)=>{let[i,...a]=r;if(!i){let e=n.definitions.length===0?n.expression:I({kind:`Let`,definitions:n.definitions,body:n.expression},n.expression),t=n.params.length===0?e:I({kind:`Lambda`,params:n.params,body:e},e);return{...At(t),isAtomic:!0}}if(n.expression.isAtomic)return e(P(n.expression.location,`Expression has no subexpressions`)),Ot;let o=t?n.expression:jt(n.expression),s=n.definitions.length,c=(()=>{let r=(t,r)=>{let[i,s]=Rt(e,[],o,t,n.expression,r);return{params:[],definitions:i,expression:s,rest:a,isLabel:!1}};switch(i.kind){case`Down`:{let[n,...r]=a;if(o.kind===`Let`&&n?.kind===`Label`&&t)return{...Vt(e,s,o,n.label,n.args),rest:r,isLabel:!0};if(t)return{params:[],definitions:[],expression:o,rest:a,isLabel:!1};throw new j(`!: is forbidden for this expression.
|
|
@@ -1343,10 +1343,10 @@ Can have at most one of the options -spec, -myspec, -spec2, -myspec2, writeAST`)
|
|
|
1343
1343
|
operator name or before an operator name.`)}else if(n===void 0)return e.addError(l(u.index),`Subexpression selection failed, probably due to an error in the selected expression.`);else if(n.kind===`LetIn`){if(Hs(f.op,1)!==1)return e.addError(l(u.index),`A LET/IN expression has only one operand.`);u.node=n.body}else if(n.kind===`OpAppl`){let i=n.operator,a=n.operands,o=i.kind===`FormalParam`||i.kind===`OpDecl`&&i.declKind===2||i.kind===`OpDef`&&i.defKind===`UserDefined`,p=()=>e.addError(l(u.index),`Internal error: Expecting $Pair and didn't find it.`),m=e=>e?.kind===`OpAppl`&&e.operator.name===`$Pair`,h=Hs(f.op,a.length);if(o){let e=Hs(f.op,i.arity);if(e===-1)return r();u.node=a[e-1]}else if(i.kind===`OpDef`&&i.defKind===`BuiltIn`){if(i.name===`$RcdConstructor`||i.name===`$SetOfRcds`){if(h===-1)return r();let e=a[h-1];if(!m(e))return p();u.node=e.operands[1]}else if(i.name===`$Case`){if(u.index===t.length-1)return e.addError(l(u.index),`Subexpression of CASE must have form !i!j.`);if(h===-1)return r();let n=a[h-1];if(!m(n))return p();u.index++;let i=Hs(t[u.index].op,2);if(i===-1)return e.addError(l(u.index),`Second selector for CASE subexpression must specify one of two operands.`);if(u.node=n.operands[i-1],u.node===void 0)return e.addError(l(u.index),`Selecting OTHER in a CASE statement.`)}else if(i.name===`$Except`){if(h>1)return e.addError(l(u.index),`Selecting subexpression of an EXCEPT not yet implemented.`);if(h===-1)return r();u.node=a[h-1]}else if((n.bounded?.length??0)===0&&(n.unbounded?.length??0)===0){if(h===-1)return r();u.node=a[h-1]}else if(f.op===`Null`||f.op===`@`){let t=Gs(n);if(s.push(...t),f.op===`Null`){if(d(f).length!==t.length)return e.addError(l(u.index),`Selector with ${d(f).length} argument(s) used for quantifier with ${t.length} bound identifier(s).`);c.push(...d(f).map(e.generateExpression))}u.node=a[0]}else{let e=Hs(f.op,n.ranges.length);if(e===-1)return r();u.node=n.ranges[e-1]}}else return e.addError(l(u.index),`Choosing operand \`${f.name}' of subexpression with no operands.`)}else if(n.kind===`AssumeProve`){if(n.isSuffices&&!u.isInSuffices){if(Hs(f.op,1)!==1)return e.addError(l(u.index),`Accessing non-existent subexpression of a SUFFICES`);u.isInSuffices=!0}else{u.isInSuffices=!1;let i=Hs(f.op,1+n.assumptions.length);if(i===-1)return r();if(e.isOutOfClauseScope(n,i))return e.addError(l(u.index),`Accessing ASSUME/PROVE clause within the scope of a declaration
|
|
1344
1344
|
from outside that declaration's scope.`);if(i<=n.assumptions.length){if(u.node=n.assumptions[i-1],u.node.kind===`NewSymb`&&u.index!==t.length-1)return e.addError(l(u.index),`Selected a subexpression of a NEW clause of an ASSUME.`)}else u.node=n.goal}}else if(n.kind===`OpArg`){let t=n.op;if(t.kind!==`OpDef`||t.name!==`LAMBDA`)return e.addError(l(u.index),`Trying to select subexpression of an operator argument.`);if(f.op!==`Null`&&f.op!==`@`)return e.addError(l(u.index),`Cannot use !${f.name} to select subexpression of a LAMBDA.`);if(f.op===`Null`){if(t.arity!==d(f).length)return e.addError(l(u.index),`Selector with ${d(f).length} arguments used for LAMBDA expression taking ${t.arity} arguments.`);c.push(...d(f).map(e.generateExpression))}s.push(...t.params??[]),u.node=t.body}else if(n.kind===`Label`)u.node=n.body,u.index--;else return e.addError(l(u.index),`Selecting subexpression of expression that has none.`);if(u.node===void 0)return e.addError(l(u.index),`An unexpected null node specified by '${f.name}'.\nThis is probably due to a previous error.`);if(u.index!==t.length-1){let n=t[u.index+1];if(n.op===`Name`){for(;u.node?.kind===`Label`;)u.node=u.node.body;if(u.node?.kind!==`LetIn`)return e.addError(l(u.index),`A name selector here must be from a LET clause.`);u.letInContext=u.node.context,u.mode=`FindingOpName`}else if(n.op===`:`)return e.addError(l(u.index),`!: should not follow an operand selector.`)}u.previousMode=`FindingSubExpr`;break}}u.index++}let f=u.node;if(f===void 0)return e.addError(a,`Subexpression selection failed, probably due to an error in the selected expression.`);if(f.kind===`AssumeProve`||f.kind===`NewSymb`)return r?f:e.addError(a,f.kind===`AssumeProve`?`Selected ASSUME/PROVE instead of expression.`:`Selected a NEW declaration as an expression or operator.`);if(n<0){let t=f.kind===`OpDef`&&(f.defKind===`UserDefined`||f.defKind===`NumberedProofStep`||f.defKind===`ModuleInstance`&&i)||f.kind===`ThmOrAssumpDef`;return u.previousMode!==`FindingOpName`||!t?e.addError(a,`DEF clause entry should describe a defined operator.`):f.kind===`OpDef`&&f.step!==void 0&&f.step.kind!==`DefStep`?e.addError(a,`DEF clause entry refers to a non-definition step.`):f}if(f.kind===`OpDef`&&f.defKind===`NumberedProofStep`)return e.addError(a,r?`Step number of non-fact used as a fact`:`Step number of non-expression step used as an expression.`);if(n>0){let t=s.length+(f.kind===`OpArg`?js(f.op):u.previousMode===`FindingOpName`&&Ws(f)?js(f):0);if(n!==t)return e.addError(a,`Expected arity ${n} but found operator of arity ${t}.`)}let p=f;if(u.previousMode===`FindingOpName`&&s.length+o.length>0){if(p.kind!==`OpDef`&&p.kind!==`ThmOrAssumpDef`)return e.addError(t[t.length-1].location??a,`Internal Error: Found unexpected node kind after FindingOpName`);c.push(...u.definitionArgs);let n=(p.params??[]).map(t=>{let n=e.createFormalParam(t.name,t.arity,t.location);return s.push(n),t.arity===0?e.createOpAppl(n,[],a):e.createOpArg(n,a)});p=e.createOpAppl(p,n,a)}if(p.kind===`OpArg`){if(n===0)return e.addError(a,`Selected operator argument when expression expected.`);if(s.length+o.length>0){let t=p.op;s.push(...Array.from({length:js(t)},(t,n)=>e.createFormalParam(`NewParam${n}`,0,void 0))),p=e.createOpAppl(t,u.definitionArgs,a)}}if(!r){if(p.kind===`ThmOrAssumpDef`&&p.body.kind===`AssumeProve`||p.kind===`Label`&&p.isAssumeProve)return e.addError(a,`ASSUME/PROVE used where an expression is required.`);if(p.kind===`ThmOrAssumpDef`&&p.body.kind===`OpAppl`){let t=Ls.get(p.body.operator.name);if(t!==void 0)return e.addError(a,`${t} proof step selected instead of expression.`)}}if(p.kind===`FormalParam`||p.kind===`OpDecl`||p.kind===`ThmOrAssumpDef`||p.kind===`OpDef`&&(p.defKind===`UserDefined`||p.defKind===`BuiltIn`))return n>0?e.createOpArg(p,a):e.createOpAppl(p,u.definitionArgs,a);if(p.kind===`OpArg`)return p;if(p.kind===`OpDef`||p.kind===`Module`)return(r||i)&&p.kind===`OpDef`?p:e.addError(a,`Module instantiation selected instead of expression.`);let m=o.reduceRight((t,n)=>e.copySubstIn(n,t),p),h=s.length>0?e.createLambda(s,m,a):void 0;return n>0?h===void 0||s.length!==n?e.addError(a,`Expected operator argument with arity ${n} but found one of arity ${s.length}.`):e.createOpArg(h,a):s.length===c.length?h===void 0?e.createOpAppl(e.getBuiltin(`$Nop`),[m],a):e.createOpAppl(h,c,a):e.addError(a,`Expected ${s.length} arguments but found ${c.length}.`)},Js=/* @__PURE__ */ new Map([[`(`,`)`],[`[`,`]`],[`{`,`}`],[`<<`,`>>`]]),Ys=(e,t)=>`${e}:${t}`,Xs=(e,t)=>{let n=le(t).filter(e=>e.kind!==`End`).map(C),r=[0,0];for(let e=0;e<t.length;e++)t[e]===`
|
|
1345
1345
|
`&&r.push(e+1);return{name:e,source:t,tokens:n,lineOffsets:r,tokenIndexes:new Map(n.map((e,t)=>[Ys(e.line,e.column),t]))}},Zs=(e,t,n)=>e.tokens[t]!==void 0&&e.tokens[t].text===n&&e.tokens[t].kind!==`String`,Qs=(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},$s=(e,t)=>e.tokenIndexes.get(Ys(t.line,t.column))??Math.min(Qs(e,t,!1),e.tokens.length-1),ec=(e,t)=>Math.max(Qs(e,t,!0)-1,0),tc=(e,t)=>{let n=e.tokens[t].text,r=Js.get(n);if(r===void 0)return t;let i=0;for(let a=t;a<e.tokens.length;a++)if(Zs(e,a,n))i++;else if(Zs(e,a,r)&&(i--,i===0))return a;return t},nc=(e,t)=>({start:$s(e,t.start),end:ec(e,t.end)}),q=(e,t)=>{let n=t.location.range;if(n)return nc(e,n);let r=$s(e,t.location);return{start:r,end:tc(e,r)}},rc=(e,t)=>{let n=t.start-1,r=t.end+1;return Zs(e,n,`(`)&&Zs(e,r,`)`)&&tc(e,n)===r?rc(e,{start:n,end:r}):t},ic=(e,t)=>{let n=t.start-1,r=t.end+1;return Zs(e,n,`(`)&&tc(e,n)===r&&(Zs(e,n-1,`(`)||Zs(e,n-1,`,`))?ic(e,{start:n,end:r}):t},J=(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}),ac=(e,t)=>J(e,{start:t,end:t}),oc=(t,n,r)=>{let i=0,a=t.lineOffsets[n];for(;a<t.source.length;){if(i=t.source[a]===` `?e(i):i+1,i>=r)return a;a++}return a},sc=(e,t)=>{let n=e.tokens[t],r=oc(e,n.line,n.column);return e.source.slice(r,oc(e,n.line,n.endColumn)+1)},cc=(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},lc=e=>{let t=Xs(``,e),n=t.tokens.reduce((e,n,r)=>{if(!cc(t,r))return e;let i=oc(t,n.line,n.column);return`${e.slice(0,i)} ${e.slice(i+2)}`},e);if(n!==e&&i(e)!==void 0)throw new w(`SANY rejects a []ASSUME or []PROVE outside an ASSUME/PROVE`);return n},uc=(e,t)=>{let n=e.tokens[t-1],r=e.tokens[t],i=n===void 0?0:oc(e,n.line,n.endColumn)+1,a=e.source.slice(i,oc(e,r.line,r.column)),o=[],s=0;for(;s<a.length;)if(a.startsWith(`\\*`,s)){let e=a.indexOf(`
|
|
1346
|
-
`,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},dc=(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},fc=(e,t,n,r)=>{for(let i=t;i<=n;i++)if(Zs(e,i,r))return i;return-1},pc=new Map(d.flatMap(([e,...t])=>t.map(t=>[t,e]))),mc=e=>e.split(`!`).map(e=>pc.get(e)??(e===`~`?`\\lnot`:e)).join(`!`),hc={Constant:{declKind:24,level:0},Variable:{declKind:25,level:1},State:{declKind:26,level:1},Action:{declKind:27,level:2},Temporal:{declKind:28,level:3}},gc=e=>/^[A-Za-z0-9_]+$/.test(e),_c=e=>e!==`!!`&&e.includes(`!`),vc=e=>e.contexts[e.contexts.length-1],yc=(e,t)=>{for(let n=e.contexts.length-1;n>=0;n--){let r=Ms(e.contexts[n],t);if(r)return r}},bc=e=>e.kind===`OpDecl`?`${e.kind}${e.declKind}`:e.kind===`OpDef`?e.defKind:e.kind,xc=e=>e.kind===`OpDef`||e.kind===`FormalParam`?`definition`:`declaration`,Sc=(e,t)=>{if(e.kind===`OpDef`&&t.kind===`OpDef`){let n=e.source??e;return n===(t.source??t)?n.module===void 0||Cc(n.module):!1}if(e.kind===`ThmOrAssumpDef`&&t.kind===`ThmOrAssumpDef`){let n=e.source??e;return n===(t.source??t)&&Cc(n.module)}return!1},Cc=e=>Fs(e,2).length===0&&Fs(e,3).length===0,wc=e=>[...e.kind===`Let`?e.instances??[]:[],..._(e).flatMap(wc)],Tc=e=>e.kind===`AssumeProve`?[...e.assumptions,e.conclusion].flatMap(e=>e.kind===`NewSymbol`?[]:Tc(e)):wc(e),Ec=(e,t)=>{let n=/* @__PURE__ */ new Set;for(let r of e.units)if(r.kind===`Module`&&n.add(r.module.name),r.kind===`Instance`&&r.instance.module===t)return n.has(t);return!1},Dc=e=>{let t=[],n=[],r=/* @__PURE__ */ new Map,i=(a,o)=>{let s=a===e,c=(e,t)=>e.forEach(e=>{t.push(e),r.has(e)||r.set(e,a.name)}),l=e=>!o.has(e);c(a.extends.filter(l),t),c(a.units.flatMap(e=>e.kind===`Instance`?[e.instance]:e.kind===`Definition`?wc(e.definition.body):e.kind===`Theorem`&&s?Tc(e.theorem.statement):e.kind===`Assumption`&&s?wc(e.assumption.expression):[]).map(e=>e.module).filter(e=>l(e)&&!Ec(a,e)),n);let u=new Map(o);a.modules.forEach(e=>{let t=new Map(u),n=/* @__PURE__ */ new Set,r=e=>{n.has(e)||(n.add(e),e.extends.forEach(e=>{let n=t.get(e);n!==void 0&&(n.modules.forEach(e=>{t.has(e.name)||t.set(e.name,e)}),r(n))}))};r(e),i(e,t),u.set(e.name,e)})};return i(e,/* @__PURE__ */ new Map),{extendees:t,instancees:n,importers:r}},Oc=/* @__PURE__ */ new Set([`Identifier`,`Subexpression`,`OperatorReference`,`Lambda`]),kc=e=>{let t=e.kind===`Apply`?zs(e):void 0;return Oc.has(e.kind)||t!==void 0&&Bs(t)},Ac=/* @__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`],[`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`]]),jc=/* @__PURE__ */ new Set([`N_GeneralId`,`N_OpApplication`,`N_PrefixExpr`,`N_InfixExpr`,`N_PostfixExpr`,`N_FcnAppl`,`N_RecordComponent`]),Mc=/* @__PURE__ */ new Set([`'`,`^+`,`^*`,`^#`]),Nc=(e,t)=>Mc.has(t)?`N_GenPostfixOp`:e.kind===`Lambda`||t===`~`||t===`-.`?`N_GenNonExpPrefixOp`:`N_GenInfixOp`,Pc=(e,t,n={})=>{let r=[],a=(e,t)=>_s(r,{location:e,text:t,isWarning:!1}),o=(e,t)=>_s(r,{location:e,text:t,isWarning:!0}),s={value:n.version===`1.7.4`?-1:0},c=()=>++s.value,l={id:0},u=(e,t)=>{let r=yc(e,t.name);if(r===t)return;if(r===void 0){As(vc(e),t);return}let i=t.kind===`FormalParam`||bc(r)!==bc(t)||js(r)!==js(t);r.kind===`OpDef`&&r.defKind===`BuiltIn`&&!(i&&n.version===`1.7.4`)?a(t.location,`Symbol ${t.name} is a built-in operator, and cannot be redefined.`):i?a(t.location,`Multiply-defined symbol '${t.name}': this definition or declaration conflicts \nwith the one at ${vs(r.location)}.`):Sc(t,r)||o(t.location,`Multiple declarations or definitions for symbol ${t.name}. \nThis duplicates the one at ${vs(r.location)}.`)};n.version!==`1.7.4`&&gs(c);let d=gs(c);c();let p=new Map(d.map(e=>[e.name,e])),h=/* @__PURE__ */ new Map,g=/* @__PURE__ */ new Map,_=(e,t)=>{let r=t=>new ee(`Could not parse module ${e} from file ${e}.tla`,e,t),a=n.version===`1.7.4`?f(t):void 0;if(a!==void 0)throw r(a);try{return m(lc(t))}catch(e){throw e instanceof w?r(i(t)??`***Parse Error***\n${e.message}`):e}},v=(e,t,r)=>{let i=g.get(e);if(i)return i;if(t===void 0)throw new ie(e,r,n.version!==`1.7.4`);n.onParse?.(e);let a=_(e,t);if(a.name!==e)throw new ee(`File name '${e}' does not match the name '${a.name}' of the top level module it contains.`,void 0);let o={file:Xs(a.name,t),module:a};return g.set(e,o),o},y=[],b=/* @__PURE__ */ new Set,x=[],S=(e,n,r)=>{let i=x.indexOf(e);if(i!==-1)throw new ee(`Circular dependency among .tla files; dependency cycle is:\n\n ${[...x.slice(i),e].map(e=>`${e}.tla`).join(` --> `)}`,void 0);if(b.has(e))return;b.add(e),x.push(e);let a=ne(e,v(e,n,r).module);[...a.extendees,...a.instancees].forEach(n=>S(n,t(n),e)),x.pop(),y.push(e)},C=/* @__PURE__ */ new Set,T=(e,t)=>C.has(`${e} ${t}`),E=(e,t,n)=>{let r=g.get(e);if(!r||n.has(e))return;n.add(e);let i=ne(e,r.module),a=i[t].find(t=>!T(e,t));if(a!==void 0)return{name:a,importer:e,namingModule:i.importers.get(a)??e};for(let r of[...i.extendees,...i.instancees]){let i=T(e,r)?E(r,t,n):void 0;if(i)return i}},te=n=>{v(n,e);let r=()=>E(n,`extendees`,/* @__PURE__ */ new Set)??E(n,`instancees`,/* @__PURE__ */ new Set);for(let e=r();e!==void 0;e=r())g.has(e.name)||v(e.name,t(e.name),e.namingModule),C.add(`${e.importer} ${e.name}`)},D=n.rootFileName??_(``,e).name,ne=(e,t)=>{let r=Dc(t);return e!==D||n.rootExtendees===void 0||(r.extendees.splice(t.extends.length,0,...n.rootExtendees),n.rootExtendees.forEach(t=>{r.importers.has(t)||r.importers.set(t,e)})),r};te(D),S(D,e);let re=(e,t,r,i)=>{let s={curLevel:0,unresolvedCount:[0],unresolvedSum:0,recursiveSectionCount:0},d=[],f=[],m=[],g=[],_=/* @__PURE__ */ new WeakSet,v=()=>g.push({labels:/* @__PURE__ */ new Map,params:[]}),y=()=>g.pop()?.labels??/* @__PURE__ */ new Map,b={depth:0,isDeclared:[],goal:void 0,goalClause:0},x=/* @__PURE__ */ new WeakMap,S=/* @__PURE__ */ new WeakMap,ee=e=>{let t=e.kind===`AssumeProve`?x.get(e):void 0;t&&(t.isInProof=!1)},C=e=>J(t,q(t,e)),T=e=>e.range?nc(t,e.range):{start:$s(t,e),end:$s(t,e)},E={kind:`Module`,id:c(),name:e.name,location:J(t,T(e.location)),extendees:[],context:vc(i),topLevel:[],definitions:[],opDefsInRecursiveSection:[],isLevelChecked:!1,levelCorrect:!0,argLevelParams:/* @__PURE__ */ new Map,levelConstraints:/* @__PURE__ */ new Map,argLevelConstraints:/* @__PURE__ */ new Map,records:[]};r&&r.definitions.push(E);let te=e=>{for(let t=i.contexts.length-1;t>=0;t--){let n=Ns(i.contexts[t],e);if(n?.kind===`Module`)return n}return h.get(e)},D=e=>{let t=te(e);if(t===void 0)throw new w(`Could not find module ${e}`);return t},ne=(e,t)=>{i.contexts.push(e);let n=t();return i.contexts.pop(),n},ie=(e,t,n,r)=>{let a={...K(c()),kind:`FormalParam`,name:e,arity:t,location:n};return r&&u(i,a),a},ae=e=>({...K(c()),kind:`OpDef`,defKind:`UserDefined`,arity:e.params?.length??0,params:[],body:void 0,isLocal:!1,module:E,source:void 0,preComments:[],isDefined:!0,inRecursive:!1,inRecursiveSection:!1,recursiveSection:-1,letInLevel:0,weights:(e.params??[]).map(()=>0),isLeibnizArg:(e.params??[]).map(()=>!0),isLeibniz:!0,opLevelCond:void 0,maxLevels:(e.params??[]).map(()=>3),minMaxLevel:void 0,labels:/* @__PURE__ */ new Map,step:void 0,...e}),O=e=>{e.letInLevel=s.curLevel,s.unresolvedSum>0&&(e.recursiveSection=s.recursiveSectionCount,e.inRecursiveSection=s.unresolvedCount[s.curLevel]>0,E.opDefsInRecursiveSection.push(e))},oe=(e,t,n,r={},i=c())=>({...K(i),kind:`OpAppl`,operator:e,operands:t,unbounded:r.unbounded,bounded:r.bounded,tupleOrs:r.tupleOrs,ranges:r.ranges??[],location:n}),se=()=>({...oe(k(`$Nop`),[],hs,{},l.id),isNull:!0}),k=e=>{let t=p.get(e);if(!t)throw new ce(`SANY has no builtin operator ${e}`);return t},A=(e,t,n,r={})=>oe(k(e),t,n,r),le=(e,t)=>({...K(c()),kind:`String`,value:e,location:t}),j=(e,t)=>({...K(c()),kind:`OpArg`,op:e,location:t}),ue=(e,t)=>{let n=yc(i,mc(e));if(n===void 0||n.kind===`Module`)throw new w(`Unknown operator: \`${e}' at line ${t.beginLine}, column ${t.beginColumn} of module ${t.file}`);return n},de=(e,t,n)=>{if(e.kind!==`OpDef`||e.defKind!==`UserDefined`)return;let r=e.params??[];r.length===t.length?r.forEach((r,i)=>{let o=t[i];r.arity===0&&o.kind===`OpArg`&&a(n,`Operator used in argument number ${i+1} has incorrect number of arguments.`);let s=o.kind===`OpArg`&&js(o.op)===r.arity&&!(o.op.kind===`OpDef`&&(o.op.params??[]).some(e=>e.arity>0));r.arity>0&&!s&&a(n,`Argument number ${i+1} to operator '${e.name}' \nshould be a ${r.arity}-parameter operator.`)}):a(n,`Wrong number of arguments (${t.length}) given to operator '${e.name}', \nwhich requires ${r.length} arguments.`)},fe=qs({version:n.version,resolveSymbol:e=>yc(i,e),resolveSynonym:mc,generateExpression:e=>N(e),generateArgument:(e,t,n,r)=>Se(e,t,n,r),createOpAppl:(e,t,n)=>{let r=oe(e,t,n);return de(e,t,n),r},createOpArg:j,createFormalParam:(e,t,n)=>ie(e,t,n,!1),createLambda:(e,n,r)=>ae({name:`LAMBDA`,params:e,body:n,location:r,preComments:uc(t,$s(t,{line:r.beginLine,column:r.beginColumn}))}),copySubstIn:(e,t)=>F(`SubstIn`,e.substs,t,e.instantiatedModule,e.location,e.instantiatingModule),getBuiltin:k,addError:(e,t)=>(a(e,t),se()),isOutOfLabelScope:e=>{let t=S.get(e);return t!==void 0&&t.scope.isDeclaredBefore[t.clause]&&t.scope.isSuffices===t.scope.isInProof},isOutOfClauseScope:(e,t)=>{let n=x.get(e);return n!==void 0&&n.isDeclaredBefore[t-1]&&(!n.hasGoal||n.isSuffices===n.isInProof)}}),pe=(e,n)=>{let r={value:n.start};return e.map(e=>{let i=e.op===`Name`?e.name:e.op===`Null`?`(`:String(e.op),a=fc(t,r.value,n.end,i);if(a===-1)return e;if(e.op===`Null`){let n=tc(t,a);return r.value=n+1,{...e,location:J(t,{start:a,end:n})}}r.value=a+1;let o=ac(t,a);if(e.args===void 0||!Zs(t,a+1,`(`))return{...e,location:o};let s=tc(t,a+1);return r.value=s+1,{...e,location:o,argsLocation:J(t,{start:a+1,end:s})}})},me=(e,n,r,i)=>{let a=zs(e);if(a===void 0)throw new w(`Expected a name, found ${e.kind}`);return fe(pe(a,q(t,e)),n,r,i,C(e))},he=e=>{let t=me(e,0,!1,!1);if(t.kind!==`OpAppl`)throw new w(`Expected an expression`);return t},ge=e=>{if(e.kind!==`OpAppl`)return;let t=d.find(t=>t.name===e.operator.name);t&&(t.node.operator=k(`$RecursiveFcnSpec`))},_e=e=>e.reduce((e,t)=>{let n=e[e.length-1];return n!==void 0&&n[0].set===t.set&&t.pattern.kind===`Name`&&n[0].pattern.kind===`Name`?n.push(t):e.push([t]),e},[]),ve=(e,t)=>Fe(e,t,_e(e).map(e=>N(e[0].set))),M=(e,t)=>{let n=g.at(-1);n?.params.push(e);let r=N(t);return n?.params.pop(),r},ye=e=>{let n=q(t,e),r=dc(t,n.start,n.end,e.params);return ne(Os(),()=>{let i=e.params.map((e,n)=>ie(e,0,ac(t,r[n]),!0)),a=M(i,e.body);return ae({name:`LAMBDA`,params:i,body:a,location:J(t,n),preComments:uc(t,n.start)})})},be=e=>e.kind===`OperatorReference`?e.operator:e.kind===`Lambda`&&e.body.kind===`Apply`?e.body.operator:t.tokens[$s(t,e.location)].text,xe=(e,t)=>{let n=C(e);if(e.kind===`Lambda`)return e.location.range===void 0?j(ue(be(e),n),n):j(ye(e),n);if(!kc(e))return a(n,`Arity ${t.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${t.name}'.`),se();if(e.kind===`OperatorReference`)return j(ue(e.operator,n),n);let r=me(e,t.arity,!1,!1);if(r.kind===`OpArg`||r.kind===`OpAppl`&&r.isNull===!0)return r;throw new w(`Expected an operator argument at line ${n.beginLine}, column ${n.beginColumn}`)},Se=(e,n,r,o)=>{let s=e.kind===`OpDef`&&(e.defKind===`UserDefined`||e.defKind===`ModuleInstance`)?e.params?.[n]?.arity??0:0;if(s===0)return N(r);let c=q(t,r),l=J(t,c),u=`${n+1} (counting from 1)`,d=ic(t,c);if(d!==c||!kc(r))return a(J(t,d),`An expression appears as argument number ${u} to operator '${e.name}', in a position an operator is required.`),se();if(r.kind===`Identifier`||r.kind===`Subexpression`||r.kind===`Apply`){let e=me(r,s,!1,!1);if(e.kind===`OpArg`||e.kind===`OpAppl`)return e;throw new w(`Expected an operator argument at ${vs(l)}`)}if(r.kind===`Lambda`&&r.location.range!==void 0){let t=ye(r),i=js(t);return i===s?j(t,l):(a(o,`Lambda expression with arity ${i} used as argument ${n+1} of operator \`${e.name}', \nbut an operator of arity ${s} is required.`),se())}let f=be(r),p=yc(i,mc(f));if(p===void 0)return a(l,`Could not find declaration or definition of symbol '${f}'.`),se();let m=js(p);return m===s?j(p,l):(a(o,`Operator with incorrect arity passed as argument. \nOperator '${p.name}' of arity ${m} is argument number ${u} to operator \`${vs(e.location)}', \nbut an operator of arity ${s} was expected.`),se())},Ce=e=>{let n=C(e);if(e.isBulleted)return A(e.kind===`And`?`$ConjList`:`$DisjList`,e.operands.map(N),n);let r=q(t,e),i=e.kind===`And`?`\\land`:`\\lor`,[a,...o]=e.operands;return o.reduce((e,n,a)=>{let s=rc(t,q(t,n)),c=a===o.length-1?r.end:s.end;return A(i,[e,N(n)],J(t,{start:r.start,end:c}))},N(a))},we=e=>{let n=q(t,e),r=e.arms.map((r,i)=>{let a=rc(t,q(t,r.condition)),o=i===e.arms.length-1&&e.other===void 0,s=rc(t,q(t,r.body)),c=[N(r.condition),N(r.body)];return A(`$Pair`,c,J(t,{start:a.start,end:o?n.end:s.end}))}),i=e.other;if(i){let e=rc(t,q(t,i)),a=Te(e.start,`OTHER`);r.push(A(`$Pair`,[void 0,N(i)],J(t,{start:a,end:n.end})))}return A(`$Case`,r,J(t,n))},Te=(e,n)=>{for(let r=e;r>=0;r--)if(Zs(t,r,n))return r;return e},Ee=e=>{let n=q(t,e),r=J(t,n),i=[N(e.function)],a=A(`$Except`,i,r),o=q(t,e.function),s={value:fc(t,o.end+1,n.end,`EXCEPT`)+1};return e.updates.forEach(e=>{let r=fc(t,s.value,n.end,`!`),o=rc(t,q(t,e.value)),c=J(t,{start:r,end:o.end}),l={value:r+1},u=e.path.map(e=>{if(e.kind===`Field`){let n=De(l.value,e.name);return l.value=n+1,le(e.name,ac(t,n))}let r=fc(t,l.value,n.end,`[`),i=tc(t,r);return l.value=i+1,e.args.length===1?N(e.args[0]):A(`$Tuple`,e.args.map(N),J(t,{start:r,end:i}))}),d=A(`$Seq`,u,c),p=A(`$Pair`,[d],c);m.push(p),f.push(a),p.operands.push(N(e.value)),m.pop(),f.pop(),i.push(p),s.value=o.end+1}),a},De=(e,n)=>{for(let r=e;r<t.tokens.length;r++)if(t.tokens[r].text===n&&t.tokens[r].kind!==`String`)return r;return e},Oe=(e,n)=>{let r=q(t,n),i={value:r.start+1},o=n.fields.map((e,r)=>{let o=De(i.value,e.name),s=rc(t,q(t,e.value));return i.value=s.end+1,n.fields.slice(0,r).some(t=>t.name===e.name)&&a(ac(t,o),`Non-unique fields in constructor.`),A(`$Pair`,[le(e.name,ac(t,o)),N(e.value)],J(t,{start:o,end:s.end}))}),s=A(e,o,J(t,r));return E.records.push(s),s},ke=e=>({line:t.tokens[e].line,column:t.tokens[e].column}),Ae=e=>{let n=[],r=e;for(;t.tokens[r]?.kind===`Identifier`;){let e=Zs(t,r+1,`(`)?tc(t,r+1):r,i=t.tokens.slice(r+1,e).filter(e=>e.text===`_`).length;if(n.push({name:t.tokens[r].text,arity:i,location:{...ke(r),range:{module:t.name,start:ke(r),end:ke(e)}}}),!Zs(t,e+1,`,`))break;r=e+2}return n},je=e=>{let n=[...e.definitions.map(e=>({unit:{kind:`Definition`,definition:e},span:Re(e)})),...(e.instances??[]).map(e=>({unit:{kind:`Instance`,instance:e},span:Re(e)}))],r=q(t,e).start,i=rc(t,q(t,e.body)).start,a=[];for(let e=r+1;e<i;e++){let r=n.some(t=>t.span.start<=e&&e<=t.span.end);Zs(t,e,`RECURSIVE`)&&!r&&a.push({unit:{kind:`Recursive`,declarations:Ae(e+1)},span:{start:e,end:e}})}return[...n,...a].toSorted((e,t)=>e.span.start-t.span.start).map(e=>e.unit)},Me=e=>{let t=Os();return ne(t,()=>{s.curLevel++,s.unresolvedCount[s.curLevel]=0;let n=[],r=[];je(e).forEach(e=>{e.kind===`Recursive`?Ue(e.declarations):e.kind===`Instance`?Ge(e.instance,n,r):e.definition.kind===`Function`?Ve(e.definition,n):ze(e.definition,n)}),P(),s.curLevel=Math.max(s.curLevel-1,0);let i=N(e.body);return{...K(c()),kind:`LetIn`,opDefs:n,instances:r,body:i,context:t,location:C(e)}})},Ne=e=>{let n=q(t,e),r=J(t,n);return ne(Os(),()=>{let i=e.pattern,a=i.kind===`Name`?[i.name]:i.names;if(e.set===void 0){let o=dc(t,n.start,n.end,a),s=a.map((e,r)=>ie(e,0,ac(t,i.kind===`Name`?n.start:o[r]),!0)),c=M(s,e.body);return A(`$UnboundedChoose`,[c],r,{unbounded:s})}let o=N(e.set),s=q(t,e.set),c=dc(t,n.start,s.start,a),l=a.map((e,n)=>ie(e,0,ac(t,c[n]),!0)),u=M(l,e.body);return A(`$BoundedChoose`,[u],r,{bounded:[l],tupleOrs:[i.kind===`Tuple`],ranges:[o]})})},Pe=e=>{if(gc(e.operator)||_c(e.operator)||e.args.length>2||yc(i,mc(e.operator))!==void 0)return;let n=q(t,e);if(t.tokens[n.start].text===e.operator&&Zs(t,n.start+1,`(`))return;let r=rc(t,q(t,e.args[0])),a=e.args.length===1&&r.start!==n.start,o=a?n.start:r.end+1,s=sc(t,o);return{index:o,name:a&&s===`-`?`-.`:s,fixity:a?`prefix`:e.args.length===2?`infix`:`postfix`}},N=e=>{let n=C(e);switch(e.kind){case`Number`:return{...K(c()),kind:`Numeral`,value:Fc(e.text??String(e.value)),location:n};case`Decimal`:{let[t,r]=e.text.split(`.`),i=BigInt(t+r),a=i<=9223372036854775807n;return{...K(c()),kind:`Decimal`,mantissa:i.toString(),exponent:String(a?-r.length:r.length),integralPart:t,fractionalPart:r,location:n}}case`String`:return le(e.value,n);case`Identifier`:{let t=he(e);return ge(t),t}case`Apply`:{let r=Pe(e);if(r!==void 0)return a(ac(t,r.index),`Could not find declaration or definition of symbol '${r.name}'.`),a(n,`Couldn't resolve ${r.fixity} operator symbol \`${r.name}'.`),{...se(),isAbsent:!0};let i=he(e);return(_c(e.operator)||gc(e.operator))&&ge(i),i}case`Bracket`:return a(ac(t,q(t,e).start),"Unsupported expression type `['."),{...se(),isAbsent:!0};case`OperatorReference`:case`Lambda`:{let r=t.tokens[q(t,e).start].text;return a(n,r===`LAMBDA`?`LAMBDA expression used where an expression is required.`:`Unsupported expression type \`${Nc(e,r)}'.`),{...se(),isAbsent:!0}}case`And`:case`Or`:return Ce(e);case`Prime`:return A(`'`,[N(e.expression)],n);case`Unchanged`:return A(`UNCHANGED`,[N(e.expression)],n);case`Enabled`:return A(`ENABLED`,[N(e.expression)],n);case`Always`:return A(`[]`,[N(e.expression)],n);case`Eventually`:return A(`<>`,[N(e.expression)],n);case`If`:return A(`$IfThenElse`,[N(e.condition),N(e.consequent),N(e.alternative)],n);case`Case`:return we(e);case`Let`:return Me(e);case`Forall`:case`Exists`:{let r=q(t,e);return ne(Os(),()=>{let t=ve(e.bounds,r.start),i=M(t.bounded.flat(),e.body);return A(e.kind===`Forall`?`$BoundedForall`:`$BoundedExists`,[i],n,t)})}case`UnboundedQuantifier`:{let r=q(t,e),i=q(t,e.body),a=dc(t,r.start,i.start,e.names),o=e.isTemporal?e.quantifier===`Forall`?`$TemporalForall`:`$TemporalExists`:e.quantifier===`Forall`?`$UnboundedForall`:`$UnboundedExists`;return ne(Os(),()=>{let r=e.names.map((e,n)=>ie(e,0,ac(t,a[n]),!0)),i=M(r,e.body);return A(o,[i],n,{unbounded:r})})}case`Choose`:return Ne(e);case`SetEnumeration`:return A(`$SetEnumerate`,e.elements.map(N),n);case`Tuple`:return A(`$Tuple`,e.elements.map(N),n);case`SetFilter`:{let r=N(e.bound.set),i=q(t,e);return ne(Os(),()=>{let t=Fe([e.bound],i.start,[r]),a=M(t.bounded.flat(),e.predicate);return A(`$SubsetOf`,[a],n,t)})}case`SetMap`:{let r=q(t,e.expression);return ne(Os(),()=>{let t=ve(e.bounds,r.end+1),i=M(t.bounded.flat(),e.expression);return A(`$SetOfAll`,[i],n,t)})}case`FunctionConstruction`:{let r=q(t,e);return ne(Os(),()=>{let t=ve(e.bounds,r.start),i=M(t.bounded.flat(),e.body);return A(`$FcnConstructor`,[i],n,t)})}case`FunctionSet`:return A(`$SetOfFcns`,[N(e.domain),N(e.range)],n);case`Record`:return Oe(`$RcdConstructor`,e);case`RecordSet`:return Oe(`$SetOfRcds`,e);case`Except`:return Ee(e);case`ExceptAt`:{let e=f[f.length-1],t=m[m.length-1];return e===void 0||t===void 0?(a(n,`@ used where its meaning is not defined.`),se()):{...K(c()),kind:`At`,except:e,component:t,location:t.location}}case`FunctionApplication`:{let t=N(e.function);if(ys(t))return t;ge(t);let r=e.args.length===1?N(e.args[0]):A(`$Tuple`,e.args.map(N),n);return A(`$FcnApply`,[t,r],n)}case`FieldAccess`:{let r=N(e.record),i=q(t,e);return A(`$RcdSelect`,[r,le(e.field,ac(t,i.end))],n)}case`Product`:return A(`$CartesianProd`,e.factors.map(N),n);case`BoxAction`:case`AngleAction`:return A(e.kind===`BoxAction`?`$SquareAct`:`$AngleAct`,[N(e.action),N(e.subscript)],n);case`WeakFairness`:case`StrongFairness`:return A(e.kind===`WeakFairness`?`$WF`:`$SF`,[N(e.subscript),N(e.action)],n);case`Label`:return Ie(e);case`Subexpression`:return he(e)}},Fe=(e,n,r)=>{let i=_e(e),a={value:n};return{bounded:i.map(e=>{let n=q(t,e[0].set),r=e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),i=dc(t,a.value,n.start,r);return a.value=n.end+1,r.map((e,n)=>ie(e,0,ac(t,i[n]),!0))}),tupleOrs:i.map(e=>e[0].pattern.kind===`Tuple`),ranges:r}},Ie=e=>{let n=C(e),r=g.at(-1);if(r===void 0)return a(n,`Label not in definition or proof step.`),se();if(b.isDeclared.slice(2,b.depth+1).some(Boolean))return a(n,`Label not allowed within scope of declaration in nested ASSUME/PROVE.`),se();if(f.length>0&&m.length>0)return a(n,`Labels inside EXCEPT clauses are not yet implemented.`),se();v();let o=N(e.body),s=y(),l=dc(t,q(t,e).start,q(t,e.body).start,e.params),u=e.params.map((n,r)=>{let o=yc(i,n);if(o?.kind===`FormalParam`)return o;let s=ac(t,l[r]);return a(s,`Illegal parameter ${n} of label \`${e.name}'.`),ie(n,0,s,!1)}),d={...K(c()),kind:`Label`,name:e.name,params:u,body:o,labels:s,isAssumeProve:!1,location:n},p=/* @__PURE__ */ new Set;if(u.forEach(e=>{p.has(e)&&a(n,`Repeated formal parameter ${e.name} \nin label \`${d.name}'.`),p.add(e)}),r.params.flat().forEach(e=>{p.delete(e)||a(n,`Label ${d.name} must contain formal parameter \`${e.name}'.`)}),p.size>0){let e=[...p].map(e=>`${e.name} `).join(``);a(n,`Label ${d.name} declares extra parameter(s) ${e}`)}r.labels.has(d.name)?a(n,`Duplicate label \`${d.name}'.`):r.labels.set(d.name,d);let h=b.goal;return h&&S.set(d,{scope:h,clause:b.goalClause}),d},Le=(e,n,r)=>{let i={value:n.start};return e.params.map(e=>{let n=e.location?$s(t,e.location):De(i.value,e.name),a=L(n,e.arity);return i.value=a.end+1,ie(mc(e.name),e.arity,J(t,a),r)})},Re=e=>{let n=T(e.location);return e.isLocal&&!Zs(t,n.start,`LOCAL`)&&Zs(t,n.start-1,`LOCAL`)?{start:n.start-1,end:n.end}:n},ze=(e,n)=>{let r=Re(e),o=J(t,r),c=mc(e.name),l={start:e.isLocal?r.start+1:r.start,end:r.end},d=ne(Os(),()=>{let t=Le(e,l,!0),n=yc(i,c);if(n?.kind===`OpDef`&&n.inRecursive&&!n.isDefined){let e=n.params?.length===t.length&&(t.length===0||t[t.length-1].arity===0);n.letInLevel===s.curLevel?e||a(o,`Definition of ${n.name} has different arity than its RECURSIVE declaration.`):a(o,`Recursive operator ${c} defined at wrong LET/IN level.`)}else n!==void 0&&a(o,`Operator ${c} already defined or declared.`);return v(),{params:t,body:N(e.body),existing:n}}),f=y(),p=d.existing,m=d.params,h=uc(t,r.start);if(p?.kind===`OpDef`&&p.inRecursive&&!p.isDefined&&p.letInLevel===s.curLevel){p.params=m,p.weights=m.map(()=>0),p.maxLevels=m.map(()=>3),p.isLeibnizArg=m.map(()=>!0),p.labels=f,Be(p,d.body,o,h),E.definitions.push(p),n?.push(p);return}let g=ae({name:c,params:m,body:d.body,isLocal:e.isLocal,location:o,preComments:h,labels:f});u(i,g),O(g),E.definitions.push(g),n?.push(g)},Be=(e,t,n,r)=>{e.isDefined=!0,e.body=t,e.location=n,e.preComments=r,e.inRecursive&&(s.unresolvedCount[s.curLevel]--,s.unresolvedSum--)},Ve=(e,n)=>{let r=Re(e),o=J(t,r),c=Os(),l=e.isLocal?r.start+1:r.start,f=ne(c,()=>ve(e.bounds,l+1)),p=yc(i,e.name),m=ne(c,()=>ie(e.name,0,o,p===void 0)),h=A(`$NonRecursiveFcnSpec`,[],o,{unbounded:[m],...f}),g=p?.kind===`OpDef`&&p.inRecursive&&!p.isDefined,_=g&&p.letInLevel===s.curLevel;_?p.arity!==0&&a(o,`Function ${p.name} has operator arguments in its RECURSIVE declaration.`):g?a(o,`Recursive function ${e.name} defined at wrong LET/IN level.`):p!==void 0&&a(o,`Function name \`${e.name}' already defined or declared.`);let b=uc(t,r.start),x=p===void 0?ae({name:e.name,params:[],body:h,isLocal:e.isLocal,location:o,preComments:b}):p.kind===`OpDef`&&(_||!g)?p:void 0;_?p.arity===0&&Be(p,h,o,b):p===void 0&&x!==void 0&&(u(i,x),O(x)),x!==void 0&&(E.definitions.push(x),n?.push(x)),d.unshift({name:e.name,node:h}),v();let S=()=>M(f.bounded.flat(),e.body),ee=x===void 0?S():ne(c,S),C=y();x!==void 0&&(x.labels=C),d.shift(),h.operands=[ee],h.operator.name===`$NonRecursiveFcnSpec`&&(h.unbounded=void 0)},He=[],Ue=e=>{s.unresolvedSum===0&&s.recursiveSectionCount++,s.unresolvedCount[s.curLevel]+=e.length,s.unresolvedSum+=e.length,e.forEach(e=>{let n=R(e);c();let r=Array.from({length:e.arity},()=>ie(``,0,void 0,!1)),a=ae({name:mc(e.name),params:r,location:J(t,n),isDefined:!1,inRecursive:!0,inRecursiveSection:!0,recursiveSection:s.recursiveSectionCount,letInLevel:s.curLevel});u(i,a),He.push(a),E.opDefsInRecursiveSection.push(a)})},P=()=>{s.unresolvedCount[s.curLevel]!==0&&(He.filter(e=>e.letInLevel===s.curLevel&&!e.isDefined).forEach(e=>a(e.location,`Symbol ${e.name} declared in RECURSIVE statement but not defined.`)),s.unresolvedSum-=s.unresolvedCount[s.curLevel])},We=(e,r,o)=>{c();let s=Es(r.table).filter(e=>e.kind===`OpDecl`),l=s.flatMap(e=>{let t=yc(i,e.name);return t===void 0?[]:[{op:e,expr:e.declKind===3||e.declKind===2&&e.arity===0?oe(t,[],o):j(t,o),isImplicit:!0}]}),u=(e,t)=>{let n=t.kind===`OpArg`?js(t.op):0,r=e.arity>0&&t.kind===`OpAppl`&&t.isNull===!0;n!==e.arity&&!r&&a(t.location,`An operator must be substituted for symbol '${e.name}', and it must have arity ${e.arity}.`)},d=Re(e),f={value:fc(t,d.start,d.end,`WITH`)+1};return e.substitutions.forEach(e=>{let n=fc(t,f.value,d.end,e.name);n!==-1&&(f.value=q(t,e.expression).end+1);let i=Ms(r,mc(e.name));if(i?.kind!==`OpDecl`){a(n===-1?o:ac(t,n),`Identifier '${n===-1?e.name:sc(t,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 s=i.arity===0?N(e.expression):xe(e.expression,i);u(i,s);let c=l.find(e=>e.op.name===i.name);c&&!c.isImplicit?a(C(e.expression),`Multiple substitutions for symbol '${i.name}' in substitution.`):c?(c.expr=s,c.isImplicit=!1):l.push({op:i,expr:s,isImplicit:!1})}),l.filter(e=>e.isImplicit&&n.version!==`1.7.4`).forEach(e=>u(e.op,e.expr)),s.filter(e=>!l.some(t=>t.op.name===e.name)).forEach(e=>a(o,`Substitution missing for symbol ${e.name} declared at ${vs(e.location)} \nand instantiated in module ${E.name}.`)),l},F=(e,t,n,r,i,o=E)=>(ys(n)&&a(i,e===`SubstIn`?`Substitution error, probably due to error
|
|
1346
|
+
`,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},dc=(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},fc=(e,t,n,r)=>{for(let i=t;i<=n;i++)if(Zs(e,i,r))return i;return-1},pc=new Map(d.flatMap(([e,...t])=>t.map(t=>[t,e]))),mc=e=>e.split(`!`).map(e=>pc.get(e)??(e===`~`?`\\lnot`:e)).join(`!`),hc={Constant:{declKind:24,level:0},Variable:{declKind:25,level:1},State:{declKind:26,level:1},Action:{declKind:27,level:2},Temporal:{declKind:28,level:3}},gc=e=>/^[A-Za-z0-9_]+$/.test(e),_c=e=>e!==`!!`&&e.includes(`!`),vc=e=>e.contexts[e.contexts.length-1],yc=(e,t)=>{for(let n=e.contexts.length-1;n>=0;n--){let r=Ms(e.contexts[n],t);if(r)return r}},bc=e=>e.kind===`OpDecl`?`${e.kind}${e.declKind}`:e.kind===`OpDef`?e.defKind:e.kind,xc=e=>e.kind===`OpDef`||e.kind===`FormalParam`?`definition`:`declaration`,Sc=(e,t)=>{if(e.kind===`OpDef`&&t.kind===`OpDef`){let n=e.source??e;return n===(t.source??t)?n.module===void 0||Cc(n.module):!1}if(e.kind===`ThmOrAssumpDef`&&t.kind===`ThmOrAssumpDef`){let n=e.source??e;return n===(t.source??t)&&Cc(n.module)}return!1},Cc=e=>Fs(e,2).length===0&&Fs(e,3).length===0,wc=e=>[...e.kind===`Let`?e.instances??[]:[],..._(e).flatMap(wc)],Tc=e=>e.kind===`AssumeProve`?[...e.assumptions,e.conclusion].flatMap(e=>e.kind===`NewSymbol`?[]:Tc(e)):wc(e),Ec=(e,t)=>{let n=/* @__PURE__ */ new Set;for(let r of e.units)if(r.kind===`Module`&&n.add(r.module.name),r.kind===`Instance`&&r.instance.module===t)return n.has(t);return!1},Dc=e=>{let t=[],n=[],r=/* @__PURE__ */ new Map,i=(a,o)=>{let s=a===e,c=(e,t)=>e.forEach(e=>{t.push(e),r.has(e)||r.set(e,a.name)}),l=e=>!o.has(e);c(a.extends.filter(l),t),c(a.units.flatMap(e=>e.kind===`Instance`?[e.instance]:e.kind===`Definition`?wc(e.definition.body):e.kind===`Theorem`&&s?Tc(e.theorem.statement):e.kind===`Assumption`&&s?wc(e.assumption.expression):[]).map(e=>e.module).filter(e=>l(e)&&!Ec(a,e)),n);let u=new Map(o);a.modules.forEach(e=>{let t=new Map(u),n=/* @__PURE__ */ new Set,r=e=>{n.has(e)||(n.add(e),e.extends.forEach(e=>{let n=t.get(e);n!==void 0&&(n.modules.forEach(e=>{t.has(e.name)||t.set(e.name,e)}),r(n))}))};r(e),i(e,t),u.set(e.name,e)})};return i(e,/* @__PURE__ */ new Map),{extendees:t,instancees:n,importers:r}},Oc=/* @__PURE__ */ new Set([`Identifier`,`Subexpression`,`OperatorReference`,`Lambda`]),kc=e=>{let t=e.kind===`Apply`?zs(e):void 0;return Oc.has(e.kind)||t!==void 0&&Bs(t)},Ac=/* @__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`],[`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`]]),jc=/* @__PURE__ */ new Set([`N_GeneralId`,`N_OpApplication`,`N_PrefixExpr`,`N_InfixExpr`,`N_PostfixExpr`,`N_FcnAppl`,`N_RecordComponent`]),Mc=/* @__PURE__ */ new Set([`'`,`^+`,`^*`,`^#`]),Nc=(e,t)=>Mc.has(t)?`N_GenPostfixOp`:e.kind===`Lambda`||t===`~`||t===`-.`?`N_GenNonExpPrefixOp`:`N_GenInfixOp`,Pc=(e,t,n={})=>{let r=[],a=(e,t)=>_s(r,{location:e,text:t,isWarning:!1}),o=(e,t)=>_s(r,{location:e,text:t,isWarning:!0}),s={value:n.version===`1.7.4`?-1:0},c=()=>++s.value,l={id:0},u=(e,t)=>{let r=yc(e,t.name);if(r===t)return;if(r===void 0){As(vc(e),t);return}let i=t.kind===`FormalParam`||bc(r)!==bc(t)||js(r)!==js(t);r.kind===`OpDef`&&r.defKind===`BuiltIn`&&!(i&&n.version===`1.7.4`)?a(t.location,`Symbol ${t.name} is a built-in operator, and cannot be redefined.`):i?a(t.location,`Multiply-defined symbol '${t.name}': this definition or declaration conflicts \nwith the one at ${vs(r.location)}.`):Sc(t,r)||o(t.location,`Multiple declarations or definitions for symbol ${t.name}. \nThis duplicates the one at ${vs(r.location)}.`)};n.version!==`1.7.4`&&gs(c);let d=gs(c);c();let p=new Map(d.map(e=>[e.name,e])),h=/* @__PURE__ */ new Map,g=/* @__PURE__ */ new Map,_=(e,t)=>{let r=e===n.rootFileName&&n.rootFilePath||`${e}.tla`,a=t=>new ee(`Could not parse module ${e} from file ${r}`,e,t),o=n.version===`1.7.4`?f(t):void 0;if(o!==void 0)throw a(o);try{return m(lc(t))}catch(e){throw e instanceof w?a(i(t)??`***Parse Error***\n${e.message}`):e}},v=(e,t,r)=>{let i=g.get(e);if(i)return i;if(t===void 0)throw new ie(e,r,n.version!==`1.7.4`);n.onParse?.(e);let a=_(e,t);if(a.name!==e)throw new ee(`File name '${e}' does not match the name '${a.name}' of the top level module it contains.`,void 0);let o={file:Xs(a.name,t),module:a};return g.set(e,o),o},y=[],b=/* @__PURE__ */ new Set,x=[],S=(e,n,r)=>{let i=x.indexOf(e);if(i!==-1)throw new ee(`Circular dependency among .tla files; dependency cycle is:\n\n ${[...x.slice(i),e].map(e=>`${e}.tla`).join(` --> `)}`,void 0);if(b.has(e))return;b.add(e),x.push(e);let a=ne(e,v(e,n,r).module);[...a.extendees,...a.instancees].forEach(n=>S(n,t(n),e)),x.pop(),y.push(e)},C=/* @__PURE__ */ new Set,T=(e,t)=>C.has(`${e} ${t}`),E=(e,t,n)=>{let r=g.get(e);if(!r||n.has(e))return;n.add(e);let i=ne(e,r.module),a=i[t].find(t=>!T(e,t));if(a!==void 0)return{name:a,importer:e,namingModule:i.importers.get(a)??e};for(let r of[...i.extendees,...i.instancees]){let i=T(e,r)?E(r,t,n):void 0;if(i)return i}},te=n=>{v(n,e);let r=()=>E(n,`extendees`,/* @__PURE__ */ new Set)??E(n,`instancees`,/* @__PURE__ */ new Set);for(let e=r();e!==void 0;e=r())g.has(e.name)||v(e.name,t(e.name),e.namingModule),C.add(`${e.importer} ${e.name}`)},D=n.rootFileName??_(``,e).name,ne=(e,t)=>{let r=Dc(t);return e!==D||n.rootExtendees===void 0||(r.extendees.splice(t.extends.length,0,...n.rootExtendees),n.rootExtendees.forEach(t=>{r.importers.has(t)||r.importers.set(t,e)})),r};te(D),S(D,e);let re=(e,t,r,i)=>{let s={curLevel:0,unresolvedCount:[0],unresolvedSum:0,recursiveSectionCount:0},d=[],f=[],m=[],g=[],_=/* @__PURE__ */ new WeakSet,v=()=>g.push({labels:/* @__PURE__ */ new Map,params:[]}),y=()=>g.pop()?.labels??/* @__PURE__ */ new Map,b={depth:0,isDeclared:[],goal:void 0,goalClause:0},x=/* @__PURE__ */ new WeakMap,S=/* @__PURE__ */ new WeakMap,ee=e=>{let t=e.kind===`AssumeProve`?x.get(e):void 0;t&&(t.isInProof=!1)},C=e=>J(t,q(t,e)),T=e=>e.range?nc(t,e.range):{start:$s(t,e),end:$s(t,e)},E={kind:`Module`,id:c(),name:e.name,location:J(t,T(e.location)),extendees:[],context:vc(i),topLevel:[],definitions:[],opDefsInRecursiveSection:[],isLevelChecked:!1,levelCorrect:!0,argLevelParams:/* @__PURE__ */ new Map,levelConstraints:/* @__PURE__ */ new Map,argLevelConstraints:/* @__PURE__ */ new Map,records:[]};r&&r.definitions.push(E);let te=e=>{for(let t=i.contexts.length-1;t>=0;t--){let n=Ns(i.contexts[t],e);if(n?.kind===`Module`)return n}return h.get(e)},D=e=>{let t=te(e);if(t===void 0)throw new w(`Could not find module ${e}`);return t},ne=(e,t)=>{i.contexts.push(e);let n=t();return i.contexts.pop(),n},ie=(e,t,n,r)=>{let a={...K(c()),kind:`FormalParam`,name:e,arity:t,location:n};return r&&u(i,a),a},ae=e=>({...K(c()),kind:`OpDef`,defKind:`UserDefined`,arity:e.params?.length??0,params:[],body:void 0,isLocal:!1,module:E,source:void 0,preComments:[],isDefined:!0,inRecursive:!1,inRecursiveSection:!1,recursiveSection:-1,letInLevel:0,weights:(e.params??[]).map(()=>0),isLeibnizArg:(e.params??[]).map(()=>!0),isLeibniz:!0,opLevelCond:void 0,maxLevels:(e.params??[]).map(()=>3),minMaxLevel:void 0,labels:/* @__PURE__ */ new Map,step:void 0,...e}),O=e=>{e.letInLevel=s.curLevel,s.unresolvedSum>0&&(e.recursiveSection=s.recursiveSectionCount,e.inRecursiveSection=s.unresolvedCount[s.curLevel]>0,E.opDefsInRecursiveSection.push(e))},oe=(e,t,n,r={},i=c())=>({...K(i),kind:`OpAppl`,operator:e,operands:t,unbounded:r.unbounded,bounded:r.bounded,tupleOrs:r.tupleOrs,ranges:r.ranges??[],location:n}),se=()=>({...oe(k(`$Nop`),[],hs,{},l.id),isNull:!0}),k=e=>{let t=p.get(e);if(!t)throw new ce(`SANY has no builtin operator ${e}`);return t},A=(e,t,n,r={})=>oe(k(e),t,n,r),le=(e,t)=>({...K(c()),kind:`String`,value:e,location:t}),j=(e,t)=>({...K(c()),kind:`OpArg`,op:e,location:t}),ue=(e,t)=>{let n=yc(i,mc(e));if(n===void 0||n.kind===`Module`)throw new w(`Unknown operator: \`${e}' at line ${t.beginLine}, column ${t.beginColumn} of module ${t.file}`);return n},de=(e,t,n)=>{if(e.kind!==`OpDef`||e.defKind!==`UserDefined`)return;let r=e.params??[];r.length===t.length?r.forEach((r,i)=>{let o=t[i];r.arity===0&&o.kind===`OpArg`&&a(n,`Operator used in argument number ${i+1} has incorrect number of arguments.`);let s=o.kind===`OpArg`&&js(o.op)===r.arity&&!(o.op.kind===`OpDef`&&(o.op.params??[]).some(e=>e.arity>0));r.arity>0&&!s&&a(n,`Argument number ${i+1} to operator '${e.name}' \nshould be a ${r.arity}-parameter operator.`)}):a(n,`Wrong number of arguments (${t.length}) given to operator '${e.name}', \nwhich requires ${r.length} arguments.`)},fe=qs({version:n.version,resolveSymbol:e=>yc(i,e),resolveSynonym:mc,generateExpression:e=>N(e),generateArgument:(e,t,n,r)=>Se(e,t,n,r),createOpAppl:(e,t,n)=>{let r=oe(e,t,n);return de(e,t,n),r},createOpArg:j,createFormalParam:(e,t,n)=>ie(e,t,n,!1),createLambda:(e,n,r)=>ae({name:`LAMBDA`,params:e,body:n,location:r,preComments:uc(t,$s(t,{line:r.beginLine,column:r.beginColumn}))}),copySubstIn:(e,t)=>F(`SubstIn`,e.substs,t,e.instantiatedModule,e.location,e.instantiatingModule),getBuiltin:k,addError:(e,t)=>(a(e,t),se()),isOutOfLabelScope:e=>{let t=S.get(e);return t!==void 0&&t.scope.isDeclaredBefore[t.clause]&&t.scope.isSuffices===t.scope.isInProof},isOutOfClauseScope:(e,t)=>{let n=x.get(e);return n!==void 0&&n.isDeclaredBefore[t-1]&&(!n.hasGoal||n.isSuffices===n.isInProof)}}),pe=(e,n)=>{let r={value:n.start};return e.map(e=>{let i=e.op===`Name`?e.name:e.op===`Null`?`(`:String(e.op),a=fc(t,r.value,n.end,i);if(a===-1)return e;if(e.op===`Null`){let n=tc(t,a);return r.value=n+1,{...e,location:J(t,{start:a,end:n})}}r.value=a+1;let o=ac(t,a);if(e.args===void 0||!Zs(t,a+1,`(`))return{...e,location:o};let s=tc(t,a+1);return r.value=s+1,{...e,location:o,argsLocation:J(t,{start:a+1,end:s})}})},me=(e,n,r,i)=>{let a=zs(e);if(a===void 0)throw new w(`Expected a name, found ${e.kind}`);return fe(pe(a,q(t,e)),n,r,i,C(e))},he=e=>{let t=me(e,0,!1,!1);if(t.kind!==`OpAppl`)throw new w(`Expected an expression`);return t},ge=e=>{if(e.kind!==`OpAppl`)return;let t=d.find(t=>t.name===e.operator.name);t&&(t.node.operator=k(`$RecursiveFcnSpec`))},_e=e=>e.reduce((e,t)=>{let n=e[e.length-1];return n!==void 0&&n[0].set===t.set&&t.pattern.kind===`Name`&&n[0].pattern.kind===`Name`?n.push(t):e.push([t]),e},[]),ve=(e,t)=>Fe(e,t,_e(e).map(e=>N(e[0].set))),M=(e,t)=>{let n=g.at(-1);n?.params.push(e);let r=N(t);return n?.params.pop(),r},ye=e=>{let n=q(t,e),r=dc(t,n.start,n.end,e.params);return ne(Os(),()=>{let i=e.params.map((e,n)=>ie(e,0,ac(t,r[n]),!0)),a=M(i,e.body);return ae({name:`LAMBDA`,params:i,body:a,location:J(t,n),preComments:uc(t,n.start)})})},be=e=>e.kind===`OperatorReference`?e.operator:e.kind===`Lambda`&&e.body.kind===`Apply`?e.body.operator:t.tokens[$s(t,e.location)].text,xe=(e,t)=>{let n=C(e);if(e.kind===`Lambda`)return e.location.range===void 0?j(ue(be(e),n),n):j(ye(e),n);if(!kc(e))return a(n,`Arity ${t.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${t.name}'.`),se();if(e.kind===`OperatorReference`)return j(ue(e.operator,n),n);let r=me(e,t.arity,!1,!1);if(r.kind===`OpArg`||r.kind===`OpAppl`&&r.isNull===!0)return r;throw new w(`Expected an operator argument at line ${n.beginLine}, column ${n.beginColumn}`)},Se=(e,n,r,o)=>{let s=e.kind===`OpDef`&&(e.defKind===`UserDefined`||e.defKind===`ModuleInstance`)?e.params?.[n]?.arity??0:0;if(s===0)return N(r);let c=q(t,r),l=J(t,c),u=`${n+1} (counting from 1)`,d=ic(t,c);if(d!==c||!kc(r))return a(J(t,d),`An expression appears as argument number ${u} to operator '${e.name}', in a position an operator is required.`),se();if(r.kind===`Identifier`||r.kind===`Subexpression`||r.kind===`Apply`){let e=me(r,s,!1,!1);if(e.kind===`OpArg`||e.kind===`OpAppl`)return e;throw new w(`Expected an operator argument at ${vs(l)}`)}if(r.kind===`Lambda`&&r.location.range!==void 0){let t=ye(r),i=js(t);return i===s?j(t,l):(a(o,`Lambda expression with arity ${i} used as argument ${n+1} of operator \`${e.name}', \nbut an operator of arity ${s} is required.`),se())}let f=be(r),p=yc(i,mc(f));if(p===void 0)return a(l,`Could not find declaration or definition of symbol '${f}'.`),se();let m=js(p);return m===s?j(p,l):(a(o,`Operator with incorrect arity passed as argument. \nOperator '${p.name}' of arity ${m} is argument number ${u} to operator \`${vs(e.location)}', \nbut an operator of arity ${s} was expected.`),se())},Ce=e=>{let n=C(e);if(e.isBulleted)return A(e.kind===`And`?`$ConjList`:`$DisjList`,e.operands.map(N),n);let r=q(t,e),i=e.kind===`And`?`\\land`:`\\lor`,[a,...o]=e.operands;return o.reduce((e,n,a)=>{let s=rc(t,q(t,n)),c=a===o.length-1?r.end:s.end;return A(i,[e,N(n)],J(t,{start:r.start,end:c}))},N(a))},we=e=>{let n=q(t,e),r=e.arms.map((r,i)=>{let a=rc(t,q(t,r.condition)),o=i===e.arms.length-1&&e.other===void 0,s=rc(t,q(t,r.body)),c=[N(r.condition),N(r.body)];return A(`$Pair`,c,J(t,{start:a.start,end:o?n.end:s.end}))}),i=e.other;if(i){let e=rc(t,q(t,i)),a=Te(e.start,`OTHER`);r.push(A(`$Pair`,[void 0,N(i)],J(t,{start:a,end:n.end})))}return A(`$Case`,r,J(t,n))},Te=(e,n)=>{for(let r=e;r>=0;r--)if(Zs(t,r,n))return r;return e},Ee=e=>{let n=q(t,e),r=J(t,n),i=[N(e.function)],a=A(`$Except`,i,r),o=q(t,e.function),s={value:fc(t,o.end+1,n.end,`EXCEPT`)+1};return e.updates.forEach(e=>{let r=fc(t,s.value,n.end,`!`),o=rc(t,q(t,e.value)),c=J(t,{start:r,end:o.end}),l={value:r+1},u=e.path.map(e=>{if(e.kind===`Field`){let n=De(l.value,e.name);return l.value=n+1,le(e.name,ac(t,n))}let r=fc(t,l.value,n.end,`[`),i=tc(t,r);return l.value=i+1,e.args.length===1?N(e.args[0]):A(`$Tuple`,e.args.map(N),J(t,{start:r,end:i}))}),d=A(`$Seq`,u,c),p=A(`$Pair`,[d],c);m.push(p),f.push(a),p.operands.push(N(e.value)),m.pop(),f.pop(),i.push(p),s.value=o.end+1}),a},De=(e,n)=>{for(let r=e;r<t.tokens.length;r++)if(t.tokens[r].text===n&&t.tokens[r].kind!==`String`)return r;return e},Oe=(e,n)=>{let r=q(t,n),i={value:r.start+1},o=n.fields.map((e,r)=>{let o=De(i.value,e.name),s=rc(t,q(t,e.value));return i.value=s.end+1,n.fields.slice(0,r).some(t=>t.name===e.name)&&a(ac(t,o),`Non-unique fields in constructor.`),A(`$Pair`,[le(e.name,ac(t,o)),N(e.value)],J(t,{start:o,end:s.end}))}),s=A(e,o,J(t,r));return E.records.push(s),s},ke=e=>({line:t.tokens[e].line,column:t.tokens[e].column}),Ae=e=>{let n=[],r=e;for(;t.tokens[r]?.kind===`Identifier`;){let e=Zs(t,r+1,`(`)?tc(t,r+1):r,i=t.tokens.slice(r+1,e).filter(e=>e.text===`_`).length;if(n.push({name:t.tokens[r].text,arity:i,location:{...ke(r),range:{module:t.name,start:ke(r),end:ke(e)}}}),!Zs(t,e+1,`,`))break;r=e+2}return n},je=e=>{let n=[...e.definitions.map(e=>({unit:{kind:`Definition`,definition:e},span:Re(e)})),...(e.instances??[]).map(e=>({unit:{kind:`Instance`,instance:e},span:Re(e)}))],r=q(t,e).start,i=rc(t,q(t,e.body)).start,a=[];for(let e=r+1;e<i;e++){let r=n.some(t=>t.span.start<=e&&e<=t.span.end);Zs(t,e,`RECURSIVE`)&&!r&&a.push({unit:{kind:`Recursive`,declarations:Ae(e+1)},span:{start:e,end:e}})}return[...n,...a].toSorted((e,t)=>e.span.start-t.span.start).map(e=>e.unit)},Me=e=>{let t=Os();return ne(t,()=>{s.curLevel++,s.unresolvedCount[s.curLevel]=0;let n=[],r=[];je(e).forEach(e=>{e.kind===`Recursive`?Ue(e.declarations):e.kind===`Instance`?Ge(e.instance,n,r):e.definition.kind===`Function`?Ve(e.definition,n):ze(e.definition,n)}),P(),s.curLevel=Math.max(s.curLevel-1,0);let i=N(e.body);return{...K(c()),kind:`LetIn`,opDefs:n,instances:r,body:i,context:t,location:C(e)}})},Ne=e=>{let n=q(t,e),r=J(t,n);return ne(Os(),()=>{let i=e.pattern,a=i.kind===`Name`?[i.name]:i.names;if(e.set===void 0){let o=dc(t,n.start,n.end,a),s=a.map((e,r)=>ie(e,0,ac(t,i.kind===`Name`?n.start:o[r]),!0)),c=M(s,e.body);return A(`$UnboundedChoose`,[c],r,{unbounded:s})}let o=N(e.set),s=q(t,e.set),c=dc(t,n.start,s.start,a),l=a.map((e,n)=>ie(e,0,ac(t,c[n]),!0)),u=M(l,e.body);return A(`$BoundedChoose`,[u],r,{bounded:[l],tupleOrs:[i.kind===`Tuple`],ranges:[o]})})},Pe=e=>{if(gc(e.operator)||_c(e.operator)||e.args.length>2||yc(i,mc(e.operator))!==void 0)return;let n=q(t,e);if(t.tokens[n.start].text===e.operator&&Zs(t,n.start+1,`(`))return;let r=rc(t,q(t,e.args[0])),a=e.args.length===1&&r.start!==n.start,o=a?n.start:r.end+1,s=sc(t,o);return{index:o,name:a&&s===`-`?`-.`:s,fixity:a?`prefix`:e.args.length===2?`infix`:`postfix`}},N=e=>{let n=C(e);switch(e.kind){case`Number`:return{...K(c()),kind:`Numeral`,value:Fc(e.text??String(e.value)),location:n};case`Decimal`:{let[t,r]=e.text.split(`.`),i=BigInt(t+r),a=i<=9223372036854775807n;return{...K(c()),kind:`Decimal`,mantissa:i.toString(),exponent:String(a?-r.length:r.length),integralPart:t,fractionalPart:r,location:n}}case`String`:return le(e.value,n);case`Identifier`:{let t=he(e);return ge(t),t}case`Apply`:{let r=Pe(e);if(r!==void 0)return a(ac(t,r.index),`Could not find declaration or definition of symbol '${r.name}'.`),a(n,`Couldn't resolve ${r.fixity} operator symbol \`${r.name}'.`),{...se(),isAbsent:!0};let i=he(e);return(_c(e.operator)||gc(e.operator))&&ge(i),i}case`Bracket`:return a(ac(t,q(t,e).start),"Unsupported expression type `['."),{...se(),isAbsent:!0};case`OperatorReference`:case`Lambda`:{let r=t.tokens[q(t,e).start].text;return a(n,r===`LAMBDA`?`LAMBDA expression used where an expression is required.`:`Unsupported expression type \`${Nc(e,r)}'.`),{...se(),isAbsent:!0}}case`And`:case`Or`:return Ce(e);case`Prime`:return A(`'`,[N(e.expression)],n);case`Unchanged`:return A(`UNCHANGED`,[N(e.expression)],n);case`Enabled`:return A(`ENABLED`,[N(e.expression)],n);case`Always`:return A(`[]`,[N(e.expression)],n);case`Eventually`:return A(`<>`,[N(e.expression)],n);case`If`:return A(`$IfThenElse`,[N(e.condition),N(e.consequent),N(e.alternative)],n);case`Case`:return we(e);case`Let`:return Me(e);case`Forall`:case`Exists`:{let r=q(t,e);return ne(Os(),()=>{let t=ve(e.bounds,r.start),i=M(t.bounded.flat(),e.body);return A(e.kind===`Forall`?`$BoundedForall`:`$BoundedExists`,[i],n,t)})}case`UnboundedQuantifier`:{let r=q(t,e),i=q(t,e.body),a=dc(t,r.start,i.start,e.names),o=e.isTemporal?e.quantifier===`Forall`?`$TemporalForall`:`$TemporalExists`:e.quantifier===`Forall`?`$UnboundedForall`:`$UnboundedExists`;return ne(Os(),()=>{let r=e.names.map((e,n)=>ie(e,0,ac(t,a[n]),!0)),i=M(r,e.body);return A(o,[i],n,{unbounded:r})})}case`Choose`:return Ne(e);case`SetEnumeration`:return A(`$SetEnumerate`,e.elements.map(N),n);case`Tuple`:return A(`$Tuple`,e.elements.map(N),n);case`SetFilter`:{let r=N(e.bound.set),i=q(t,e);return ne(Os(),()=>{let t=Fe([e.bound],i.start,[r]),a=M(t.bounded.flat(),e.predicate);return A(`$SubsetOf`,[a],n,t)})}case`SetMap`:{let r=q(t,e.expression);return ne(Os(),()=>{let t=ve(e.bounds,r.end+1),i=M(t.bounded.flat(),e.expression);return A(`$SetOfAll`,[i],n,t)})}case`FunctionConstruction`:{let r=q(t,e);return ne(Os(),()=>{let t=ve(e.bounds,r.start),i=M(t.bounded.flat(),e.body);return A(`$FcnConstructor`,[i],n,t)})}case`FunctionSet`:return A(`$SetOfFcns`,[N(e.domain),N(e.range)],n);case`Record`:return Oe(`$RcdConstructor`,e);case`RecordSet`:return Oe(`$SetOfRcds`,e);case`Except`:return Ee(e);case`ExceptAt`:{let e=f[f.length-1],t=m[m.length-1];return e===void 0||t===void 0?(a(n,`@ used where its meaning is not defined.`),se()):{...K(c()),kind:`At`,except:e,component:t,location:t.location}}case`FunctionApplication`:{let t=N(e.function);if(ys(t))return t;ge(t);let r=e.args.length===1?N(e.args[0]):A(`$Tuple`,e.args.map(N),n);return A(`$FcnApply`,[t,r],n)}case`FieldAccess`:{let r=N(e.record),i=q(t,e);return A(`$RcdSelect`,[r,le(e.field,ac(t,i.end))],n)}case`Product`:return A(`$CartesianProd`,e.factors.map(N),n);case`BoxAction`:case`AngleAction`:return A(e.kind===`BoxAction`?`$SquareAct`:`$AngleAct`,[N(e.action),N(e.subscript)],n);case`WeakFairness`:case`StrongFairness`:return A(e.kind===`WeakFairness`?`$WF`:`$SF`,[N(e.subscript),N(e.action)],n);case`Label`:return Ie(e);case`Subexpression`:return he(e)}},Fe=(e,n,r)=>{let i=_e(e),a={value:n};return{bounded:i.map(e=>{let n=q(t,e[0].set),r=e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),i=dc(t,a.value,n.start,r);return a.value=n.end+1,r.map((e,n)=>ie(e,0,ac(t,i[n]),!0))}),tupleOrs:i.map(e=>e[0].pattern.kind===`Tuple`),ranges:r}},Ie=e=>{let n=C(e),r=g.at(-1);if(r===void 0)return a(n,`Label not in definition or proof step.`),se();if(b.isDeclared.slice(2,b.depth+1).some(Boolean))return a(n,`Label not allowed within scope of declaration in nested ASSUME/PROVE.`),se();if(f.length>0&&m.length>0)return a(n,`Labels inside EXCEPT clauses are not yet implemented.`),se();v();let o=N(e.body),s=y(),l=dc(t,q(t,e).start,q(t,e.body).start,e.params),u=e.params.map((n,r)=>{let o=yc(i,n);if(o?.kind===`FormalParam`)return o;let s=ac(t,l[r]);return a(s,`Illegal parameter ${n} of label \`${e.name}'.`),ie(n,0,s,!1)}),d={...K(c()),kind:`Label`,name:e.name,params:u,body:o,labels:s,isAssumeProve:!1,location:n},p=/* @__PURE__ */ new Set;if(u.forEach(e=>{p.has(e)&&a(n,`Repeated formal parameter ${e.name} \nin label \`${d.name}'.`),p.add(e)}),r.params.flat().forEach(e=>{p.delete(e)||a(n,`Label ${d.name} must contain formal parameter \`${e.name}'.`)}),p.size>0){let e=[...p].map(e=>`${e.name} `).join(``);a(n,`Label ${d.name} declares extra parameter(s) ${e}`)}r.labels.has(d.name)?a(n,`Duplicate label \`${d.name}'.`):r.labels.set(d.name,d);let h=b.goal;return h&&S.set(d,{scope:h,clause:b.goalClause}),d},Le=(e,n,r)=>{let i={value:n.start};return e.params.map(e=>{let n=e.location?$s(t,e.location):De(i.value,e.name),a=L(n,e.arity);return i.value=a.end+1,ie(mc(e.name),e.arity,J(t,a),r)})},Re=e=>{let n=T(e.location);return e.isLocal&&!Zs(t,n.start,`LOCAL`)&&Zs(t,n.start-1,`LOCAL`)?{start:n.start-1,end:n.end}:n},ze=(e,n)=>{let r=Re(e),o=J(t,r),c=mc(e.name),l={start:e.isLocal?r.start+1:r.start,end:r.end},d=ne(Os(),()=>{let t=Le(e,l,!0),n=yc(i,c);if(n?.kind===`OpDef`&&n.inRecursive&&!n.isDefined){let e=n.params?.length===t.length&&(t.length===0||t[t.length-1].arity===0);n.letInLevel===s.curLevel?e||a(o,`Definition of ${n.name} has different arity than its RECURSIVE declaration.`):a(o,`Recursive operator ${c} defined at wrong LET/IN level.`)}else n!==void 0&&a(o,`Operator ${c} already defined or declared.`);return v(),{params:t,body:N(e.body),existing:n}}),f=y(),p=d.existing,m=d.params,h=uc(t,r.start);if(p?.kind===`OpDef`&&p.inRecursive&&!p.isDefined&&p.letInLevel===s.curLevel){p.params=m,p.weights=m.map(()=>0),p.maxLevels=m.map(()=>3),p.isLeibnizArg=m.map(()=>!0),p.labels=f,Be(p,d.body,o,h),E.definitions.push(p),n?.push(p);return}let g=ae({name:c,params:m,body:d.body,isLocal:e.isLocal,location:o,preComments:h,labels:f});u(i,g),O(g),E.definitions.push(g),n?.push(g)},Be=(e,t,n,r)=>{e.isDefined=!0,e.body=t,e.location=n,e.preComments=r,e.inRecursive&&(s.unresolvedCount[s.curLevel]--,s.unresolvedSum--)},Ve=(e,n)=>{let r=Re(e),o=J(t,r),c=Os(),l=e.isLocal?r.start+1:r.start,f=ne(c,()=>ve(e.bounds,l+1)),p=yc(i,e.name),m=ne(c,()=>ie(e.name,0,o,p===void 0)),h=A(`$NonRecursiveFcnSpec`,[],o,{unbounded:[m],...f}),g=p?.kind===`OpDef`&&p.inRecursive&&!p.isDefined,_=g&&p.letInLevel===s.curLevel;_?p.arity!==0&&a(o,`Function ${p.name} has operator arguments in its RECURSIVE declaration.`):g?a(o,`Recursive function ${e.name} defined at wrong LET/IN level.`):p!==void 0&&a(o,`Function name \`${e.name}' already defined or declared.`);let b=uc(t,r.start),x=p===void 0?ae({name:e.name,params:[],body:h,isLocal:e.isLocal,location:o,preComments:b}):p.kind===`OpDef`&&(_||!g)?p:void 0;_?p.arity===0&&Be(p,h,o,b):p===void 0&&x!==void 0&&(u(i,x),O(x)),x!==void 0&&(E.definitions.push(x),n?.push(x)),d.unshift({name:e.name,node:h}),v();let S=()=>M(f.bounded.flat(),e.body),ee=x===void 0?S():ne(c,S),C=y();x!==void 0&&(x.labels=C),d.shift(),h.operands=[ee],h.operator.name===`$NonRecursiveFcnSpec`&&(h.unbounded=void 0)},He=[],Ue=e=>{s.unresolvedSum===0&&s.recursiveSectionCount++,s.unresolvedCount[s.curLevel]+=e.length,s.unresolvedSum+=e.length,e.forEach(e=>{let n=R(e);c();let r=Array.from({length:e.arity},()=>ie(``,0,void 0,!1)),a=ae({name:mc(e.name),params:r,location:J(t,n),isDefined:!1,inRecursive:!0,inRecursiveSection:!0,recursiveSection:s.recursiveSectionCount,letInLevel:s.curLevel});u(i,a),He.push(a),E.opDefsInRecursiveSection.push(a)})},P=()=>{s.unresolvedCount[s.curLevel]!==0&&(He.filter(e=>e.letInLevel===s.curLevel&&!e.isDefined).forEach(e=>a(e.location,`Symbol ${e.name} declared in RECURSIVE statement but not defined.`)),s.unresolvedSum-=s.unresolvedCount[s.curLevel])},We=(e,r,o)=>{c();let s=Es(r.table).filter(e=>e.kind===`OpDecl`),l=s.flatMap(e=>{let t=yc(i,e.name);return t===void 0?[]:[{op:e,expr:e.declKind===3||e.declKind===2&&e.arity===0?oe(t,[],o):j(t,o),isImplicit:!0}]}),u=(e,t)=>{let n=t.kind===`OpArg`?js(t.op):0,r=e.arity>0&&t.kind===`OpAppl`&&t.isNull===!0;n!==e.arity&&!r&&a(t.location,`An operator must be substituted for symbol '${e.name}', and it must have arity ${e.arity}.`)},d=Re(e),f={value:fc(t,d.start,d.end,`WITH`)+1};return e.substitutions.forEach(e=>{let n=fc(t,f.value,d.end,e.name);n!==-1&&(f.value=q(t,e.expression).end+1);let i=Ms(r,mc(e.name));if(i?.kind!==`OpDecl`){a(n===-1?o:ac(t,n),`Identifier '${n===-1?e.name:sc(t,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 s=i.arity===0?N(e.expression):xe(e.expression,i);u(i,s);let c=l.find(e=>e.op.name===i.name);c&&!c.isImplicit?a(C(e.expression),`Multiple substitutions for symbol '${i.name}' in substitution.`):c?(c.expr=s,c.isImplicit=!1):l.push({op:i,expr:s,isImplicit:!1})}),l.filter(e=>e.isImplicit&&n.version!==`1.7.4`).forEach(e=>u(e.op,e.expr)),s.filter(e=>!l.some(t=>t.op.name===e.name)).forEach(e=>a(o,`Substitution missing for symbol ${e.name} declared at ${vs(e.location)} \nand instantiated in module ${E.name}.`)),l},F=(e,t,n,r,i,o=E)=>(ys(n)&&a(i,e===`SubstIn`?`Substitution error, probably due to error
|
|
1347
1347
|
in module being instantiated.`:`Substitution error, probably due to error in module being instantiated.`),{...K(c()),kind:e,substs:t,body:n,instantiatingModule:o,instantiatedModule:r,location:i}),Ge=(e,r,a)=>{let o=Re(e),s=J(t,o),l=uc(t,o.start),d=e.name??``,f=Os(),p=e.isLocal?o.start+1:o.start;e.params.length>0&&i.contexts.push(f);let m=Le(e,{start:p,end:o.end},e.params.length>0),h=D(e.module),g=h.context,_=We(e,g,s);e.params.length>0&&i.contexts.pop(),Es(g.table).forEach(t=>{if(t.kind!==`OpDef`||t.isLocal||t.defKind!==`UserDefined`&&t.defKind!==`ModuleInstance`)return;let n=[...m,...t.params??[]],a=`${d}!${t.name}`,o=t.defKind===`UserDefined`?ae({name:a,params:n,body:_.length>0&&t.body?F(`SubstIn`,_,t.body,h,s):t.body,isLocal:e.isLocal,location:s,source:t.source??t,preComments:l,labels:t.labels}):ae({defKind:`ModuleInstance`,name:a,params:n,isLocal:e.isLocal,location:s,module:t.module,source:t.source??t,preComments:l});u(i,o),t.defKind===`UserDefined`&&O(o),(r??E.definitions).push(o)}),Es(g.table).forEach(t=>{if(t.kind!==`ThmOrAssumpDef`||t.isLocal)return;let n=_.length>0?F(`APSubstIn`,_,t.body,h,s):t.body,a={...K(c()),kind:`ThmOrAssumpDef`,name:`${d}!${t.name}`,isTheorem:t.isTheorem,body:n,params:[...m,...t.params],isLocal:e.isLocal,location:s,module:E,source:t.source??t,labels:t.labels,isLeibnizArg:[],isLeibniz:!1,opLevelCond:[],maxLevels:[],minMaxLevel:[]};u(i,a),(r??E.definitions).push(a)});let v={...K(c()),kind:`Instance`,name:d,isLocal:e.isLocal,params:m,module:h,substs:_,location:s};(a??E.topLevel).push(v);let y=ae({defKind:`ModuleInstance`,name:d,params:m,isLocal:e.isLocal,location:s,preComments:l});u(i,y),n.version!==`1.7.4`&&r?.push(y)},Ke=(e,n=!0,r)=>{let a=Re(e),o=r??J(t,a),s=uc(t,a.start),l=D(e.module),d=l.context,f=We(e,d,o),p=e.isLocal,m=Cc(l);Es(d.table).forEach(e=>{if(e.kind!==`OpDef`||e.defKind!==`UserDefined`||e.isLocal)return;let t=(t,n)=>{let r=ae({name:e.name,params:e.params,body:n,isLocal:p,location:o,module:t,source:e.source??e,preComments:s,labels:e.labels});return u(i,r),r},n=()=>(u(i,e),e),r=e.module===void 0||Cc(e.module),a=m||r?p?t(e.module,e.body):n():t(E,e.body&&F(`SubstIn`,f,e.body,l,o));E.definitions.push(a),O(a)}),Es(d.table).forEach(e=>{if(e.kind!==`ThmOrAssumpDef`||e.isLocal)return;let t=(t,n)=>{let r={...e,...K(c()),body:n,isLocal:p,location:o,module:t,source:e.source??e};return u(i,r),r},r=m?p?t(e.module,e.body):(u(i,e),e):Cc(e.module)?p?t(E,e.body):e:t(E,F(`APSubstIn`,f,e.body,l,o));n&&E.definitions.push(r)});let h={...K(c()),kind:`Instance`,name:void 0,isLocal:p,params:[],module:l,substs:f,location:o};return n&&E.topLevel.push(h),h},qe=e=>{let n=te(e.name)??(e.name===E.name?E:void 0);return n===void 0?(a(ac(t,$s(t,e.location)+1),`Module \`${e.name}' used without being extended or instantiated.`),[]):[n]},I=e=>e.flatMap(e=>{if(e.kind===`ModuleFact`)return qe(e);let t=zs(e);if(t===void 0||!Bs(t))return[N(e)];let n=me(e,0,!0,!1);if(n.kind===`ThmOrAssumpDef`)throw new w(`Expected a fact`);return[n]}),Je=e=>Zs(t,e.start,`(`)&&tc(t,e.start)===e.end,Ye=e=>rc(t,q(t,e)),Xe=(e,n)=>Ye(e.args[0]).start===n.start?e.args.length===2?`N_InfixExpr`:`N_PostfixExpr`:t.tokens[n.start].kind===`Identifier`?`N_OpApplication`:`N_PrefixExpr`,Ze=(e,n)=>Je(n)?`N_ParenExpr`:e.kind===`String`?sc(t,n.start):e.kind===`Apply`?Xe(e,n):Ac.get(e.kind),Qe=(e,t)=>{if(e.kind===`String`&&!Je(t))return!1;if(e.kind===`Identifier`&&!e.name.includes(`!`))return!0;let n=Ze(e,t);return n===void 0||jc.has(n)?void 0:!0},$e=(e,n)=>{let r=(e,t=Ye(e))=>({last:t,lastKind:Ze(e,t)});if(Je(n))return{hasChildlessFirstChild:!1,...r(e,{start:n.start+1,end:n.end-1})};switch(e.kind){case`If`:case`BoxAction`:case`AngleAction`:return{hasChildlessFirstChild:!1,...r(e.kind===`If`?e.condition:e.action)};case`Tuple`:case`SetEnumeration`:{let i=e.elements[0];return i===void 0?{hasChildlessFirstChild:!1,last:{start:n.end,end:n.end},lastKind:t.tokens[n.end].text}:{hasChildlessFirstChild:!1,...r(i)}}case`Always`:case`Eventually`:case`Enabled`:case`Unchanged`:return{hasChildlessFirstChild:!0,...r(e.expression,{start:n.start+1,end:n.end})};case`Prime`:return{hasChildlessFirstChild:Qe(e.expression,Ye(e.expression)),last:{start:n.end,end:n.end},lastKind:`N_GenPostfixOp`};case`FunctionApplication`:case`FieldAccess`:{let n=e.kind===`FunctionApplication`?e.function:e.record,r=Ye(n),i=r.end+1;return{hasChildlessFirstChild:Qe(n,r),last:{start:i,end:i},lastKind:t.tokens[i].text}}case`Apply`:{let t=Xe(e,n);if(t===`N_OpApplication`)return e.operator.includes(`!`)?void 0:{hasChildlessFirstChild:!0,last:{start:n.start+1,end:n.end},lastKind:`N_OpArgs`};if(t===`N_PrefixExpr`)return{hasChildlessFirstChild:!0,...r(e.args[0],{start:n.start+1,end:n.end})};let i=Ye(e.args[0]),a=i.end+1;return{hasChildlessFirstChild:Qe(e.args[0],i),last:{start:a,end:a},lastKind:t===`N_InfixExpr`?`N_GenInfixOp`:`N_GenPostfixOp`}}}},et=e=>{let n=rc(t,q(t,e));if((e.kind===`Identifier`||e.kind===`Subexpression`||e.kind===`OperatorReference`)&&!Je(n))return!1;let r=$e(e,n);if(r?.hasChildlessFirstChild===void 0||r.lastKind===void 0)return!1;let i=J(t,r.last);return r.hasChildlessFirstChild&&a(J(t,n),`Was expecting a GeneralId.`),r.lastKind===`N_OpArgs`?a(i,"Selector `!(...)' should not have argument(s)."):(a(i,`Unexpected token found.`),a(i,`Need name or step number here, not \`${r.lastKind}'.`)),a(J(t,n),`DEF clause entry should describe a defined operator.`),!0},tt=e=>e.flatMap(e=>{if(e.kind===`ModuleFact`)return qe(e);if(et(e))return[];let t=me(e.kind===`OperatorReference`?{kind:`Identifier`,name:e.operator,location:e.location}:e,-1,!1,!0);return t.kind===`OpDef`||t.kind===`ThmOrAssumpDef`&&!t.name.startsWith(`<`)?[t]:(a(C(e),`DEF clause entry should describe a defined operator.`),[])}),nt=(e,t)=>{e.isOnly||e.facts.length+e.defs.length>0||a(t,`Empty BY, USE, or HIDE`)},rt=e=>{let n=J(t,T(e.location));nt(e,n);let r=I(e.facts),i=tt(e.defs);return r.length+i.length===0&&a(n,`Empty USE or HIDE statement.`),e.kind===`Hide`&&r.filter(e=>e.kind===`OpAppl`&&e.operator.kind!==`ThmOrAssumpDef`).forEach(e=>a(e.location,`The only expression allowed as a fact in a HIDE is
|
|
1348
1348
|
the name of a theorem, assumption, or step.`)),{...K(c()),kind:`UseOrHide`,facts:r,defs:i,isOnly:e.isOnly,isHide:e.kind===`Hide`,location:n}},it=e=>{let n=T(e.location),r=e.set&&N(e.set),a=De(n.start,e.name),o=hc[e.level],s={...K(c()),levelChecked:1,level:o.level,kind:`OpDecl`,name:mc(e.name),arity:e.arity,declKind:o.declKind,location:J(t,L(a,e.arity)),module:E};return u(i,s),{...K(c()),kind:`NewSymb`,declaration:s,set:r,location:J(t,n)}},at=(e,n,r)=>{let o=T(e.location),s=cc(t,o.start-1),l=q(t,e.conclusion).start,u=t.tokens.findLastIndex((e,t)=>t<l&&e.kind===`Keyword`&&e.text===`PROVE`),d=J(t,{start:s?o.start-1:o.start,end:o.start});s!==cc(t,u-1)&&a(d,s?`[]ASSUME matched by PROVE instead of []PROVE`:`ASSUME matched by []PROVE instead of PROVE`);let f=c();n>1&&i.contexts.push(Os()),s&&i.contexts.some(e=>_.has(e))&&a(d,`[]ASSUME used within the scope of an ordinary ASSUME's assumptions`),s||_.add(vc(i));let p={isDeclaredBefore:[!1],hasGoal:r!==void 0,isSuffices:r?.isSuffices??!1,isInProof:!0};b.depth=n,b.isDeclared[n]=!1,n===1&&(b.goal=r&&p,b.goalClause=0);let m=e.assumptions.map((e,t)=>{let r=e.kind===`NewSymbol`,i=e.kind===`AssumeProve`?at(e,n+1):r?it(e):N(e);return b.depth=n,r&&(b.isDeclared[n]=!0),p.isDeclaredBefore.push(p.isDeclaredBefore[t]||r),n===1&&b.goalClause++,i}),h=N(e.conclusion);n>1&&i.contexts.pop(),b.depth=n-1,n===1&&(b.goal=void 0);let g={...K(f),kind:`AssumeProve`,assumptions:m,goal:h,isSuffices:p.isSuffices,isBoxed:s,location:J(t,{start:s?o.start-1:o.start,end:o.end})};return x.set(g,p),g},ot=(e,t,n,r,i,a=!0)=>({...K(e),kind:`ThmOrAssumpDef`,name:t,isTheorem:a,body:n,params:[],isLocal:!1,location:r,module:E,source:void 0,labels:i,isLeibnizArg:[],isLeibniz:!1,opLevelCond:[],maxLevels:[],minMaxLevel:[]}),st=e=>{let n=J(t,T(e.location));e.kind===`By`&&nt(e,n);let r=e.kind===`By`?I(e.facts):[],i=e.kind===`By`?tt(e.defs):[];return e.kind===`By`&&c(),e.kind===`By`&&r.length+i.length===0&&a(n,`Empty BY`),{...K(c()),kind:`LeafProof`,facts:r,defs:i,isOmitted:e.kind===`Omitted`,isOnly:e.kind===`By`&&e.isOnly,location:n}},ct=(e,n)=>{let r=e.body,a=J(t,n);switch(r.kind){case`Have`:return{node:A(`$Have`,[N(r.expression)],a),isPick:!1};case`Case`:return{node:A(`$Pfcase`,[N(r.expression)],a),isPick:!1};case`Witness`:return{node:A(`$Witness`,r.expressions.map(N),a),isPick:!1};case`Qed`:return{node:A(`$Qed`,[],a),isPick:!1};case`Take`:case`Pick`:{let e=r.kind===`Pick`,o=e?`$Pick`:`$Take`;e&&i.contexts.push(Os());let s=e=>r.kind===`Pick`?[M(e,r.body)]:[];if(r.bounds.length>0){let t=ve(r.bounds,n.start),i=s(t.bounded.flat());return{node:A(o,i,a,t),isPick:e}}let c=dc(t,n.start,n.end+1,r.names),l=r.names.map((e,n)=>ie(e,0,ac(t,c[n]),!0)),u=s(l);return{node:A(o,u,a,{unbounded:l}),isPick:e}}}},lt=e=>{if((e.kind===`And`||e.kind===`Or`)&&!e.isBulleted)return!0;if(e.kind!==`Apply`||e.args.length!==2)return!1;let n=rc(t,q(t,e.args[0])),r=q(t,e).start;return n.start===r&&!Zs(t,n.end+1,`(`)},ut=e=>{if(e.kind!==`Steps`)return st(e);let n=Os();i.contexts.push(n);let r=[],a=[],o={previousRight:void 0},s=(e,n,i)=>{if(e.kind===`Define`){let n=e.definitions.map(e=>{let t=[];e.kind===`Instance`?Ge(e,t,r):e.kind===`Function`?Ve(e,t):ze(e,t);let n=t[e.kind===`Instance`?t.length-1:0];if(n?.kind!==`OpDef`)throw new w(`A DEFINE step defines no operator`);return n});return{...K(c()),kind:`DefStep`,defs:n,location:J(t,i)}}if(e.kind===`Use`||e.kind===`Hide`)return{...rt(e),location:J(t,n)};if(e.kind===`Instance`)return Ke(e,!1,J(t,i))},l=e.steps.map(e=>{let n=T(e.location),r=nc(t,e.head),l={start:r.start+1,end:r.end},d=e.body;e.name!==void 0&&v();let f=e.name===void 0?void 0:c();d.kind!==`Assert`&&(o.previousRight=void 0);let p=s(d,n,l);if(p!==void 0)return e.name!==void 0&&u(i,ae({defKind:`NumberedProofStep`,name:e.name,location:J(t,n),labels:y(),step:p})),p;let m=d.kind===`Assert`&&d.statement.kind===`AssumeProve`;m&&(o.previousRight=void 0);let h=d.kind===`Assert`&&d.isSuffices,g=Os(),_=d.kind===`Assert`?{node:(n=>{if(n.kind===`AssumeProve`){let t=ne(g,()=>at(n,1,e.name===void 0?void 0:{isSuffices:h}));return t.isSuffices=h,t}if(h){let e=N(n);return A(`$Suffices`,[e],J(t,l))}let r=o.previousRight,i=r!==void 0&&n.kind===`Apply`&<(n)&&n.args[0].kind===`ExceptAt`,a=i?N(n.args[1]):void 0,s=i?oe(ue(n.operator,C(n)),[A(`$Nop`,[r],C(n.args[0])),a],C(n)):N(n),c=s.kind===`OpAppl`?s.operands[1]:void 0;return o.previousRight=lt(n)?c:void 0,s})(d.statement),isPick:!1}:ct(e,l);if(_===void 0)throw new w(`Unexpected proof step ${d.kind}`);let b=_.isPick?i.contexts.pop():void 0,x=e.name===void 0||f===void 0?void 0:ot(f,e.name,_.node,ac(t,$s(t,e.location)),y());x&&u(i,x);let S=m&&!h;S&&i.contexts.push(g);let E=e.proof&&ut(e.proof);return S&&i.contexts.pop(),ee(_.node),m&&h&&(a.push(g),i.contexts.push(g)),b?.symbols.forEach(e=>u(i,e)),{...K(c()),kind:`Theorem`,definition:x,body:_.node,proof:E,isSuffices:h,location:J(t,n)}});return a.forEach(()=>{i.contexts.pop()?.symbols.forEach(e=>As(n,e))}),i.contexts.pop(),{...K(c()),kind:`NonLeafProof`,steps:l,instances:r,proofLevel:e.level,location:J(t,T(e.location))}},dt=e=>{let n=J(t,T(e.location)),r=e.statement,a=Os();e.name!==void 0&&v();let o=e.name===void 0?void 0:c();r.kind===`AssumeProve`&&i.contexts.push(a);let s=r.kind===`AssumeProve`?at(r,1,e.name===void 0?void 0:{isSuffices:!1}):N(r),l=e.name===void 0||o===void 0?void 0:ot(o,e.name,s,n,y());l&&(r.kind===`AssumeProve`&&i.contexts.pop(),u(i,l),E.definitions.push(l),r.kind===`AssumeProve`&&i.contexts.push(a));let d=e.proof&&ut(e.proof);r.kind===`AssumeProve`&&i.contexts.pop(),ee(s);let f={...K(c()),kind:`Theorem`,definition:l,body:s,proof:d,isSuffices:!1,location:n};E.topLevel.push(f)},ft=e=>{let n=T(e.location),r=J(t,n);e.name!==void 0&&v();let a=N(e.expression),o=e.name===void 0?void 0:ot(c(),e.name,a,r,y(),!1);o&&(u(i,o),E.definitions.push(o));let s={...K(c()),kind:`Assume`,definition:o,body:a,location:r};E.topLevel.push(s)},L=(e,n)=>n===0?{start:e,end:e}:Zs(t,e,`_`)?{start:e,end:Zs(t,e+2,`_`)?e+2:e+1}:Zs(t,e+1,`(`)?{start:e,end:tc(t,e+1)}:{start:e,end:Zs(t,e+1,`_`)?e+1:e},R=e=>L(T(e.location).start,e.arity),pt=(e,n)=>{let r=R(e);e.name===`@`&&n===3&&a(J(t,r),`Attempted to declare '@' as a variable.`);let o={...K(c()),levelChecked:1,level:+(n===3),kind:`OpDecl`,name:mc(e.name),arity:e.arity,declKind:n,location:J(t,r),module:E};return n===2&&(o.levelParams.add(o),o.allParams.add(o)),u(i,o),o};e.extends.forEach(e=>{let t=D(e);E.extendees.push(t);let n=vc(i);t.context.symbols.forEach(e=>{if(e.kind!==`Module`&&e.kind!==`FormalParam`&&e.kind!==`OpDecl`&&e.isLocal)return;let t=e.kind===`Module`?Ns(n,e.name):Ms(n,e.name);t===void 0?As(n,e):t!==e&&t.kind!==e.kind?a(e.location,`The ${xc(e)} of '${e.name}' conflicts with \nits ${xc(t)} at ${vs(t.location)}.`):t!==e&&!Sc(t,e)&&o(e.location,`Warning: the ${xc(t)} of '${e.name}' conflicts with \nits ${xc(t)} at ${vs(t.location)}.`)}),E.topLevel.push(...t.topLevel)});let mt=(e,n)=>{s.unresolvedSum!==0&&a(J(t,T(e)),`${n} may not appear within a recursive definition section.`)};return e.units.forEach(e=>{switch(e.kind){case`Variables`:mt(e.location,`A VARIABLE declaration`),e.declarations.forEach(e=>pt(e,3));break;case`Constants`:mt(e.location,`A declaration`),e.declarations.forEach(e=>pt(e,2));break;case`Recursive`:Ue(e.declarations);break;case`Definition`:e.definition.kind===`Function`?Ve(e.definition,void 0):ze(e.definition,void 0);break;case`Instance`:e.instance.name===void 0?Ke(e.instance):Ge(e.instance,void 0,void 0);break;case`Assumption`:mt(e.assumption.location,`An ASSUME`),ft(e.assumption);break;case`Theorem`:mt(e.theorem.location,`A THEOREM`),dt(e.theorem);break;case`Use`:mt(e.use.location,`A USE or HIDE`),E.topLevel.push(rt(e.use));break;case`Module`:{mt(e.module.location,`A MODULE `);let n={contexts:[...i.contexts,Os()]},r=re(e.module,t,E,n),o=te(r.name);o===void 0?As(vc(i),r):o!==r&&a(r.location,`Multiply-defined module '${r.name}': this definition or declaration conflicts \nwith the one at ${vs(o.location)}.`);break}}}),P(),E},ae=y.map(e=>{n.onAnalyze?.(e),l.id=Array.from({length:4},c)[1];let t=v(e,void 0),i=Os();d.toReversed().forEach(e=>As(i,e));let a=re(t.module,t.file,void 0,{contexts:[i]});return h.set(e,a),n.onModule?.(a,r),a});return{root:ae[ae.length-1],modules:ae,messages:r}},Fc=e=>{let t=e.toLowerCase(),n=t.startsWith(`\\b`)?2:t.startsWith(`\\o`)?8:t.startsWith(`\\h`)?16:10;return[...n===10?t:t.slice(2)].reduce((e,t)=>e*BigInt(n)+BigInt(parseInt(t,n)),0n).toString()},Ic=(e,t,n,r)=>_s(e.messages,{location:t,text:n,isWarning:!1,...r!==void 0&&!e.isTlc174&&{code:r}}),Y=(e,t)=>{for(let n of t)e.add(n)},Lc=(e,t,n)=>`${e.id}:${t}:${n.id}`,Rc=(e,t,n,r)=>{e.set(Lc(t,n,r),{op:t,index:n,param:r})},zc=(e,t,n=()=>!0)=>{t.forEach((t,r)=>{n(t)&&e.set(r,t)})},Bc=(e,t,n)=>{e.set(t,Math.min(n,e.get(t)??3))},Vc=(e,t,n=()=>!0)=>{t.forEach((t,r)=>{n(r)&&Bc(e,r,t)})},Hc=(e,t)=>`${e.id}:${t}`,Uc=(e,t,n,r)=>{let i=Hc(t,n),a=e.get(i)?.level??0;e.set(i,{param:t,position:n,level:Math.max(r,a)})},Wc=(e,t,n=()=>!0)=>{t.forEach(t=>{n(t)&&Uc(e,t.param,t.position,t.level)})},Gc=(e,t)=>{e.levelParams=t.levelParams,e.allParams=t.allParams,e.levelConstraints=t.levelConstraints,e.argLevelConstraints=t.argLevelConstraints,e.argLevelParams=t.argLevelParams},Kc=(e,t)=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Vc(e.levelConstraints,t.levelConstraints),Wc(e.argLevelConstraints,t.argLevelConstraints),zc(e.argLevelParams,t.argLevelParams)},qc=(e,t)=>t.includes(e.op)||t.includes(e.param),Jc=e=>e.kind===`OpDecl`||e.kind===`FormalParam`,Yc=e=>e.kind!==`Module`,Xc=e=>e.kind===`OpDef`||e.kind===`ThmOrAssumpDef`,Zc=(e,t)=>e.kind===`OpDef`&&e.arity<0?0:t,Qc=(e,t)=>e.kind===`OpDef`?e.weights[Zc(e,t)]??0:0,$c=(e,t)=>e.maxLevels[Zc(e,t)]??3,el=(e,t,n)=>e.minMaxLevel?.[t]?.[n]??0,tl=(e,t)=>e.kind===`OpDef`?e.isLeibnizArg?.[Zc(e,t)]??!0:e.isLeibnizArg[t]??!0,nl=(e,t,n,r)=>e.opLevelCond?.[t]?.[n]?.[r]??!1,rl=e=>[...e.unbounded??[],...(e.bounded??[]).flat()],il=(e,t)=>t.find(t=>t.op===e)?.expr,al=(e,t,n)=>{let r=il(e,t);return r===void 0?/* @__PURE__ */ new Set([e]):n?r.allParams:r.levelParams},ol=(e,t)=>{let n=/* @__PURE__ */ new Map;return e.forEach((e,r)=>{let i=il(e.op,t);if(i===void 0){n.set(r,e);return}if(i.kind!==`OpArg`||!Jc(i.op))return;let a=i.op;al(e.param,t,!1).forEach(t=>Rc(n,a,e.index,t))}),n},sl=(e,t,n,r,i)=>{let a=/* @__PURE__ */ new Map;return e.levelConstraints.forEach((e,r)=>{let i=n||r.kind!==`OpDecl`?e:r.declKind===2?0:r.declKind===3?1:e;al(r,t,!1).forEach(e=>Bc(a,e,i))}),e.argLevelParams.forEach(e=>{let n=il(e.op,t);if(n?.kind!==`OpArg`||n.op.kind!==`OpDef`)return;X(n.op,r,i);let o=$c(n.op,e.index);al(e.param,t,!1).forEach(e=>Bc(a,e,o))}),a},cl=(e,t,n,r)=>{let i=/* @__PURE__ */ new Map;return e.argLevelConstraints.forEach(e=>{let n=il(e.param,t);n===void 0?Uc(i,e.param,e.position,e.level):n.kind===`OpArg`&&Jc(n.op)&&Uc(i,n.op,e.position,e.level)}),e.argLevelParams.forEach(e=>{let a=il(e.param,t);if(a===void 0)return;let o=il(e.op,t),s=o===void 0?e.op:o.kind===`OpArg`?o.op:void 0;s!==void 0&&Jc(s)&&(X(a,n,r),Uc(i,s,e.index,a.level))}),i},ll=(e,t)=>Fs(e,3).length>0||(vl(e,t),Ps(e).some(e=>(e.body?.level??0)!==0))?!1:e.topLevel.every(e=>e.kind!==`Theorem`||e.level===0),ul=(e,t,n)=>{e.minMaxLevel=t.map(e=>Array.from({length:e.arity},(t,r)=>n.argLevelConstraints.get(Hc(e,r))?.level??0)),e.opLevelCond=t.map(e=>t.map(t=>Array.from({length:e.arity},(r,i)=>n.argLevelParams.has(Lc(e,i,t))))),Y(e.levelParams,n.levelParams),Y(e.allParams,n.allParams),Y(e.nonLeibnizParams,n.nonLeibnizParams),t.forEach((t,n)=>{e.levelParams.delete(t),e.allParams.delete(t),e.nonLeibnizParams.has(t)&&(e.nonLeibnizParams.delete(t),e.isLeibnizArg&&(e.isLeibnizArg[n]=!1),e.isLeibniz=!1)}),e.levelConstraints=new Map(n.levelConstraints),t.forEach(t=>e.levelConstraints.delete(t)),e.argLevelConstraints=new Map(n.argLevelConstraints),t.forEach(t=>{for(let n=0;n<t.arity;n++)e.argLevelConstraints.delete(Hc(t,n))}),zc(e.argLevelParams,n.argLevelParams,e=>!t.some(t=>t===e.op)||!t.some(t=>t===e.param))},dl=(e,t,n,r,i)=>{e.operands.forEach((a,o)=>{if(a===void 0||(a.level>$c(t,o)&&(n&&X(a,r,i)&&Ic(i,e.location,`Level error in applying operator ${t.name}:\nThe level of argument ${o+1} exceeds the maximum level allowed by the operator.`),e.levelCorrect=!1),a.kind!==`OpArg`||!Xc(a.op)))return;let s=a.op;X(s,r,i);let c=js(s);for(let l=0;l<c;l++){let c=el(t,o,l);$c(s,l)>=c||(n&&X(a,r,i)&&Ic(i,e.location,`Level error in applying operator ${t.name}:\nThe permitted level of argument ${l+1} of the operator argument ${o+1} \nmust be at least ${c}.`),e.levelCorrect=!1)}e.operands.forEach((n,l)=>{for(let u=0;u<c;u++)n===void 0||!nl(t,o,l,u)||n.level<=$c(s,u)||(X(a,r,i)&&X(n,r,i)&&Ic(i,e.location,`Level error in applying operator ${t.name}:\nThe level of argument ${l+1} exceeds the maximum level allowed by the operator.`,`HIGHER_ORDER_OPERATOR_COPARAMETER_LEVEL_CONSTRAINTS_EXCEEDED`),e.levelCorrect=!1)})}),e.ranges.forEach((n,a)=>{let o=X(n,r,i);n.level<=2||(o&&Ic(i,e.location,`Level error in applying operator ${t.name}:\nThe level of the range for the bounded variable ${vs(e.bounded?.[a]?.[0]?.location)} \nexceeds the maximum level allowed by the operator.`),e.levelCorrect=!1)})},fl=(e,t,n,r,i)=>{let a=t.params??[],o=t=>e.operands.find((e,n)=>a[n]===t);Vc(e.levelConstraints,t.levelConstraints),e.operands.forEach(t=>{t!==void 0&&Vc(e.levelConstraints,t.levelConstraints,e=>!n.has(e))}),e.ranges.forEach(t=>Vc(e.levelConstraints,t.levelConstraints)),e.operands.forEach((n,r)=>{let i=$c(t,r);n?.levelParams.forEach(t=>Bc(e.levelConstraints,t,i))}),e.operands.forEach((n,a)=>{if(n?.kind!==`OpArg`||!Xc(n.op))return;let o=n.op;X(o,r,i);let s=js(o);e.operands.forEach((n,r)=>{for(let i=0;i<s;i++){if(!nl(t,a,r,i))continue;let s=$c(o,i);n?.levelParams.forEach(t=>Bc(e.levelConstraints,t,s)),!o.isLeibniz&&!tl(o,i)&&n&&Y(e.nonLeibnizParams,n.allParams)}})}),t.argLevelParams.forEach(t=>{let n=o(t.op);n?.kind===`OpArg`&&Xc(n.op)&&(X(n.op,r,i),Bc(e.levelConstraints,t.param,$c(n.op,t.index)))}),Wc(e.argLevelConstraints,t.argLevelConstraints),e.operands.forEach(t=>{t&&Wc(e.argLevelConstraints,t.argLevelConstraints)}),e.ranges.forEach(t=>Wc(e.argLevelConstraints,t.argLevelConstraints)),e.operands.forEach((n,r)=>{if(n?.kind!==`OpArg`||!Jc(n.op))return;let i=n.op;for(let n=0;n<i.arity;n++)Uc(e.argLevelConstraints,i,n,el(t,r,n));e.operands.forEach((n,a)=>{for(let o=0;o<i.arity;o++)n!==void 0&&nl(t,r,a,o)&&Uc(e.argLevelConstraints,i,o,n.level)})}),t.argLevelParams.forEach(t=>{let n=o(t.op);n!==void 0&&(X(n,r,i),Uc(e.argLevelConstraints,t.op,t.index,n.level))}),e.operands.forEach(t=>{t!==void 0&&zc(e.argLevelParams,t.argLevelParams,e=>!n.has(e.param))}),e.ranges.forEach(t=>zc(e.argLevelParams,t.argLevelParams)),t.argLevelParams.forEach((t,n)=>{let a=o(t.op);if(a===void 0){let a=o(t.param);a===void 0?e.argLevelParams.set(n,t):(X(a,r,i),a.levelParams.forEach(n=>Rc(e.argLevelParams,t.op,t.index,n)))}else a.kind===`OpArg`&&Jc(a.op)&&Rc(e.argLevelParams,a.op,t.index,t.param)}),e.operands.forEach((n,r)=>{if(n?.kind!==`OpArg`||!Jc(n.op))return;let i=n.op;e.operands.forEach((n,a)=>{for(let o=0;o<i.arity;o++)n!==void 0&&nl(t,r,a,o)&&n.levelParams.forEach(t=>Rc(e.argLevelParams,i,o,t))})})},pl=/* @__PURE__ */ new Map([[`\\land`,`\\land`],[`\\lor`,`\\lor`],[`=>`,`=>`],[`\\equiv`,`\\equiv`],[`$ConjList`,`Conjunction list`],[`$DisjList`,`Disjunction list`]]),ml=(e,t)=>{let n=(n,r)=>{Ic(t,n,r),t.isTlc174||(e.levelCorrect=!1)},r=e.operator.name,i=e.operands[0];if((r===`[]`||r===`<>`)&&i?.level===2&&i.kind===`OpAppl`){let t=r===`[]`;i.operator.name!==(t?`$SquareAct`:`$AngleAct`)&&n(e.location,t?`[] followed by action not of form [A]_v.`:`<> followed by action not of form <<A>>_v.`)}r!==`~>`&&r!==`-+->`||i?.level!==2&&e.operands[1]?.level!==2||n(e.location,`Action used where only temporal formula or state predicate allowed.`);let a=pl.get(r);a!==void 0&&e.operands.some(e=>e?.level===3)&&e.operands.some(e=>e?.level===2)&&n(e.location,`${a} has both temporal formula and action as arguments.`),e.level===3&&(r===`$BoundedExists`||r===`$BoundedForall`)&&e.ranges.forEach(e=>{e.level===2&&n(e.location,`Action-level bound of quantified temporal formula.`)})},hl=(e,t,n)=>{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.operands.filter(e=>e!==void 0);r.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),e.ranges.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)});let i=e.operator;if(Xc(i)){let r=X(i,t,n);dl(e,i,r,t,n),e.level=e.operands.reduce((e,t,n)=>t!==void 0&&Qc(i,n)===1?Math.max(e,t.level):e,i.level),e.ranges.forEach(t=>{e.level=Math.max(e.level,t.level)}),Y(e.levelParams,i.levelParams),Y(e.allParams,i.allParams),Y(e.nonLeibnizParams,i.nonLeibnizParams),e.operands.forEach((t,n)=>{t!==void 0&&(Qc(i,n)===1&&Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams),tl(i,n)||Y(e.nonLeibnizParams,t.allParams))}),e.ranges.forEach(t=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams)});let a=new Set(rl(e));a.forEach(t=>{e.levelParams.delete(t),e.allParams.delete(t),e.nonLeibnizParams.delete(t)}),fl(e,i,a,t,n)}else X(i,t,n),e.level=r.reduce((e,t)=>Math.max(e,t.level),i.kind===`Module`?0:i.level),e.levelParams=/* @__PURE__ */ new Set([i]),e.allParams.add(i),r.forEach((t,n)=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams),Vc(e.levelConstraints,t.levelConstraints),Uc(e.argLevelConstraints,i,n,t.level),Wc(e.argLevelConstraints,t.argLevelConstraints),t.levelParams.forEach(t=>Rc(e.argLevelParams,i,n,t)),zc(e.argLevelParams,t.argLevelParams)});return ml(e,n),e.levelCorrect},gl=(e,t,n)=>{if(e.levelChecked>=t||!e.inRecursiveSection&&e.levelChecked>0)return e.levelCorrect;e.levelChecked=t;let r=e.body;if(r===void 0)return e.levelCorrect=e.step===void 0||X(e.step,t,n),e.levelCorrect;e.levelCorrect=X(r,t,n),e.level=Math.max(e.level,r.level);let i=e.params??[];return i.forEach((t,n)=>{let i=r.levelConstraints.get(t);i!==void 0&&(e.maxLevels[n]=Math.min(e.maxLevels[n],i)),r.levelParams.has(t)&&(e.weights[n]=Math.max(e.weights[n],1))}),ul(e,i,r),e.levelCorrect},_l=(e,t,n)=>(e.levelChecked>=t||(e.levelChecked=t,e.maxLevels=e.params.map(()=>3),e.isLeibnizArg=e.params.map((t,n)=>n===e.params.length-1),e.params.length>0&&(e.isLeibniz=!0),e.levelCorrect=X(e.body,t,n),e.level=e.body.level,e.params.forEach((t,n)=>{let r=e.body.levelConstraints.get(t);r!==void 0&&(e.maxLevels[n]=r)}),ul(e,e.params,e.body)),e.levelCorrect),vl=(e,t)=>{if(e.isLevelChecked)return e.levelCorrect;e.isLevelChecked=!0;let n=e.opDefsInRecursiveSection,r=0;for(;r<n.length;){let e=n[r].recursiveSection,i=r;for(;i<n.length&&n[i].recursiveSection===e;){let e=n[i];e.inRecursive?(e.levelChecked=1,e.maxLevels=e.maxLevels.map(()=>2),e.weights=e.weights.map(()=>1)):e.levelChecked=0,i++}let a=n.slice(r,i),o=/* @__PURE__ */ new Set,s=/* @__PURE__ */ new Set,c=0;a.forEach(e=>{e.inRecursive&&(e.levelChecked=0),gl(e,1,t),e.inRecursive&&(e.maxLevels.forEach((n,r)=>{n>=2||Ic(t,e.location,`Argument ${r+1} of recursive operator ${e.name} is primed`)}),c=Math.max(c,e.level),Y(o,e.levelParams),Y(s,e.allParams))}),a.forEach(e=>{e.inRecursive&&(e.levelChecked=2),e.level=Math.max(e.level,c),Y(e.levelParams,o),Y(e.allParams,s)}),a.forEach(e=>{e.inRecursive&&(e.levelChecked=1),gl(e,2,t)}),r=i}e.levelCorrect=!0;let i=t=>{t||(e.levelCorrect=!1)};e.definitions.filter(e=>e.kind===`Module`).forEach(e=>i(vl(e,t)));let a=Ps(e);return a.forEach(e=>i(gl(e,1,t))),Is(e).forEach(e=>i(_l(e,1,t))),e.topLevel.forEach(e=>i(X(e,1,t))),ll(e,t)||Fs(e,2).forEach(t=>Bc(e.levelConstraints,t,0)),a.forEach(t=>{Vc(e.levelConstraints,t.levelConstraints),Wc(e.argLevelConstraints,t.argLevelConstraints),zc(e.argLevelParams,t.argLevelParams,e=>!qc(e,t.params??[]))}),e.topLevel.forEach(t=>{Vc(e.levelConstraints,t.levelConstraints),Wc(e.argLevelConstraints,t.argLevelConstraints),zc(e.argLevelParams,t.argLevelParams)}),e.levelCorrect},yl=(e,t,n,r)=>(e.levelChecked>=n||(e.levelChecked=n,t.forEach(t=>{Yc(t)&&(t.kind!==`OpDef`||t.defKind!==`ModuleInstance`)&&(e.levelCorrect=X(t,n,r)&&e.levelCorrect,e.level=Math.max(e.level,t.level),Kc(e,t),Y(e.nonLeibnizParams,t.nonLeibnizParams))})),e.levelCorrect),bl=(e,t)=>{e?.kind===`NonLeafProof`&&e.steps.forEach(e=>{if(e.kind!==`Theorem`||e.body.kind!==`OpAppl`)return;let n=e.body.operator.name;n===`$Take`||n===`$Witness`||n===`$Have`?e.body.level!==0&&Ic(t,e.body.location,`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`):n===`$Pfcase`?(e.body.level!==0&&Ic(t,e.body.location,`Non-constant CASE for temporal goal.`),bl(e.proof,t)):n===`$Qed`&&bl(e.proof,t)})},xl=(e,t,n,r,i,a)=>{e.levelConstraints=sl(t,n,r,i,a),e.argLevelConstraints=cl(t,n,i,a),e.argLevelParams=ol(t.argLevelParams,n)},Sl=(e,t,n)=>{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelParams=/* @__PURE__ */ new Set,e.levelCorrect=!0;let r=e.module;vl(r,n)||(e.levelCorrect=!1),e.substs.forEach(r=>{X(r.expr,t,n)||(e.levelCorrect=!1)});let i=ll(r,n);e.substs.forEach(a=>{!i&&a.expr.level>a.op.level&&(X(a.expr,t,n)&&Ic(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the expression or operator substituted for '${a.op.name}' \nmust be at most ${a.op.level}.`),e.levelCorrect=!1),a.expr.kind!==`OpArg`||a.expr.op.kind!==`OpDef`||a.expr.op.defKind!==`UserDefined`&&a.expr.op.defKind!==`BuiltIn`||a.expr.op.isLeibniz||Ic(n,e.location,`Error in instantiating module '${r.name}':\n A non-Leibniz operator substituted for '${a.op.name}'.`)}),e.substs.forEach(i=>{let a=r.levelConstraints.get(i.op);if(a!==void 0&&i.expr.level>a&&(X(i.expr,t,n)&&Ic(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the expression or operator substituted for '${i.op.name}' \nmust be at most ${a}.`),e.levelCorrect=!1),i.op.arity<=0||i.expr.kind!==`OpArg`||i.expr.op.kind!==`OpDef`)return;let o=i.expr.op,s=X(o,t,n);for(let t=0;t<i.op.arity;t++){let a=r.argLevelConstraints.get(Hc(i.op,t))?.level;a===void 0||$c(o,t)>=a||(s&&Ic(n,e.location,`Level error in instantiating module '${r.name}':\nThe level of the argument ${t+1} of the operator ${o.name} \nmust be at least ${a}.`),e.levelCorrect=!1)}}),r.argLevelParams.forEach(i=>{e.substs.forEach(a=>{e.substs.forEach(o=>{if(i.op!==a.op||i.param!==o.op||a.expr.kind!==`OpArg`)return;let s=a.expr.op,c=X(s,t,n);if(s.kind!==`OpDef`)return;let l=$c(s,i.index);o.expr.level<=l||(c&&X(o.expr,t,n)&&Ic(n,e.location,`Level error when instantiating module '${r.name}':\nThe level of the argument ${i.index} of the operator ${a.op.name}' \nmust be at most ${l}.`),e.levelCorrect=!1)})})});let a=t=>!e.params.some(e=>e===t);return Vc(e.levelConstraints,sl(r,e.substs,i,t,n),a),e.substs.forEach(t=>Vc(e.levelConstraints,t.expr.levelConstraints,a)),Wc(e.argLevelConstraints,cl(r,e.substs,t,n),e=>a(e.param)),e.substs.forEach(t=>Wc(e.argLevelConstraints,t.expr.argLevelConstraints,e=>a(e.param))),zc(e.argLevelParams,ol(r.argLevelParams,e.substs),t=>!qc(t,e.params)),e.substs.forEach(t=>zc(e.argLevelParams,t.expr.argLevelParams,t=>!qc(t,e.params))),e.levelCorrect},X=(e,t,n)=>{if(!Yc(e))return vl(e,n);switch(e.kind){case`OpAppl`:return hl(e,t,n);case`OpDef`:return gl(e,t,n);case`ThmOrAssumpDef`:return _l(e,t,n);case`FormalParam`:return e.levelChecked===0&&(e.levelChecked=t,e.levelParams.add(e),e.allParams.add(e)),!0;case`OpDecl`:return!0;case`Numeral`:case`String`:case`Decimal`:return e.levelChecked<t&&(e.levelChecked=t),!0;case`OpArg`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t;let r=e.op;return e.levelCorrect=X(r,t,n),r.kind===`Module`||(e.level=r.level,Gc(e,r)),e.levelCorrect}case`LetIn`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.opDefs.filter(e=>e.kind!==`OpDef`||e.defKind!==`ModuleInstance`);return r.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),X(e.body,t,n)||(e.levelCorrect=!1),e.instances.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),e.level=e.body.level,e.levelParams=new Set(e.body.levelParams),e.allParams=new Set(e.body.allParams),Vc(e.levelConstraints,e.body.levelConstraints),r.forEach(t=>Vc(e.levelConstraints,t.levelConstraints)),Wc(e.argLevelConstraints,e.body.argLevelConstraints),r.forEach(t=>Wc(e.argLevelConstraints,t.argLevelConstraints)),zc(e.argLevelParams,e.body.argLevelParams),r.forEach(t=>{let n=t.kind===`OpDef`?t.params??[]:[];zc(e.argLevelParams,t.argLevelParams,e=>!qc(e,n))}),e.instances.forEach(t=>zc(e.argLevelParams,t.argLevelParams)),e.levelCorrect}case`Label`:{if(e.levelChecked>=t)return!0;e.levelChecked=t,e.params.forEach(e=>X(e,t,n));let r=X(e.body,t,n);return e.level=e.body.level,Gc(e,e.body),r}case`At`:{if(e.levelChecked>=t)return!0;e.levelChecked=t;let r=e.except.operands,i=r[0];if(i===void 0)return!0;X(i,t,n),e.level=i.level;let a=[i];for(let i of r.slice(1))if(i!==void 0){if(X(i,t,n),i===e.component)break;e.level=Math.max(e.level,i.level),a.push(i)}return a.forEach(t=>Kc(e,t)),!0}case`SubstIn`:case`APSubstIn`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.body;X(r,t,n)||(e.levelCorrect=!1),e.substs.forEach(r=>{X(r.expr,t,n)||(e.levelCorrect=!1)}),e.level=e.substs.reduce((e,t)=>r.levelParams.has(t.op)?Math.max(e,t.expr.level):e,r.level),r.levelParams.forEach(t=>Y(e.levelParams,al(t,e.substs,!1))),e.kind===`APSubstIn`?r.allParams.forEach(t=>Y(e.allParams,al(t,e.substs,!0))):(e.allParams=new Set(r.allParams),e.nonLeibnizParams=new Set(r.nonLeibnizParams),e.substs.forEach(t=>{e.allParams.has(t.op)&&(e.allParams.delete(t.op),Y(e.allParams,t.expr.allParams),Y(e.nonLeibnizParams,t.expr.nonLeibnizParams),e.nonLeibnizParams.has(t.op)&&(e.nonLeibnizParams.delete(t.op),Y(e.nonLeibnizParams,t.expr.allParams)))}));let i=ll(e.instantiatedModule,n);return xl(e,r,e.substs,i,t,n),e.levelCorrect}case`Instance`:return Sl(e,t,n);case`Assume`:{if(e.levelChecked>=t)return!0;e.levelChecked=t;let r=X(e.body,t,n),i=!e.definition||X(e.definition,t,n);return e.level=e.body.level,Gc(e,e.body),e.level!==0&&Ic(n,e.location,`Level error: assumptions must be level 0 (Constant), \nbut this one has level ${e.level}.`),r&&i}case`Theorem`:{if(e.levelChecked>=t)return!0;let r=yl(e,[e.definition??e.body,...e.proof?[e.proof]:[]],t,n),i=e.body;return i.kind===`OpAppl`&&i.operator.name===`$Pick`&&i.level===3&&i.ranges.forEach(e=>{e.level!==0&&Ic(n,e.location,`Non-constant bound of temporal PICK.`)}),i.level===3&&bl(e.proof,n),r}case`LeafProof`:case`UseOrHide`:return yl(e,e.facts,t,n);case`NonLeafProof`:return yl(e,[...e.steps,...e.instances],t,n);case`DefStep`:return yl(e,e.defs,t,n);case`NewSymb`:return e.levelChecked>=t||(e.levelChecked=t,e.level=e.declaration.level,e.set===void 0)||(e.levelCorrect=X(e.set,t,n),e.level=Math.max(e.level,e.set.level),e.level===3&&(e.levelCorrect=!1,Ic(n,e.location,`Level error:
|
|
1349
|
-
Temporal formula used as set.`)),Gc(e,e.set)),e.levelCorrect;case`AssumeProve`:return e.levelChecked>=t||(e.levelChecked=t,e.levelCorrect=!0,e.assumptions.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),X(e.goal,t,n),e.level=e.assumptions.reduce((e,t)=>Math.max(e,t.level),e.goal.level),[e.goal,...e.assumptions].forEach(t=>Kc(e,t)),e.levelCorrect&&e.levelParams.forEach(t=>{t.kind===`OpDecl`&&t.declKind===2&&Bc(e.levelConstraints,t,2)})),e.levelCorrect}},Cl=e=>{switch(e.kind){case`OpAppl`:return[...e.ranges,...e.operands];case`OpDef`:case`ThmOrAssumpDef`:case`Label`:return[e.body];case`LetIn`:return[...e.opDefs,...e.instances,e.body];case`SubstIn`:case`APSubstIn`:return[e.body,...e.substs.map(e=>e.expr)];case`Instance`:return e.substs.map(e=>e.expr);case`AssumeProve`:return[...e.assumptions,e.goal];case`NewSymb`:return[e.set];default:return[]}},wl=/* @__PURE__ */ new Map([[`Integers`,`Int`],[`Naturals`,`Nat`],[`Reals`,`Reals`]]),Tl=e=>{let t=/* @__PURE__ */ new Set,n=e=>{if(e===void 0||t.has(e))return!1;if(t.add(e),e.kind===`OpAppl`){let t=e.operator;if(t.kind===`OpDecl`||t.kind===`FormalParam`)return!0;if(t.kind===`OpDef`){if(t.name===`BOOLEAN`)return!0;let e=t.module?.name;if(e!==void 0&&wl.get(e)===t.name||n(t))return!0}}return Cl(e).some(n)};return n(e)},El=e=>e.operands.filter(e=>e?.kind===`OpAppl`),Dl=e=>{let t=e.operands[0];return t?.kind===`String`?t:void 0},Ol=(e,t)=>{if(e===t)return!0;if(e.operands.length!==t.operands.length)return!1;let n=new Set(El(t).map(e=>Dl(e)?.value));return El(e).every(e=>n.has(Dl(e)?.value))},kl=(e,t=/* @__PURE__ */ new Set)=>(e.extendees.forEach(e=>{t.has(e)||(t.add(e),kl(e,t))}),t),Al=e=>{let t=[...[...kl(e)].flatMap(e=>e.records),...e.records];return e.records.flatMap(n=>t.filter(e=>Ol(e,n)).flatMap(El).some(Tl)?[]:El(n).flatMap(t=>{let n=Dl(t),r=n&&Ms(e.context,n.value);return n===void 0||r===void 0?[]:[{location:n.location,text:`The field name "${n.value}" in the record constructor is identical to the existing definition or declaration\nnamed ${n.value}, located at ${vs(r.location)}.\nThe field in the record will not take the value of the ${n.value} definition or declaration.\nIn TLA+, field names in records are strings, regardless of any similarly named declarations or definitions.\nTherefore, DOMAIN [${n.value} |-> ...] = {"${n.value}"} holds true.`,isWarning:!0}]}))},jl=e=>`${vs(e.location)}\n\n${e.text}`,Ml=e=>{let t=e.filter(e=>!e.isWarning),n=e.filter(e=>e.isWarning);return[t.length>0?`*** Errors: ${t.length}\n\n`:``,...t.map(e=>`${jl(e)}\n\n\n`),n.length>0?`*** Warnings: ${n.length}\n\n`:``,...n.map(e=>`${jl(e)}\n\n\n`)].join(``)},Nl=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),Pl=e=>{let t=/* @__PURE__ */ new Set,n=[],r=e=>{t.add(e.name),n.push(...e.extends),e.modules.forEach(r)};return r(e),n.filter(e=>!t.has(e))},Fl=e=>{try{return m(lc(e))}catch(e){if(e instanceof w)return;throw e}},Il=(e,t)=>t===`1.7.4`&&f(e)!==void 0?void 0:Fl(e)?.name,Ll=(e,t=()=>void 0,n={})=>{let i=ge(e,`.tla`),a=xa(n.version),o=n.fileName??i,s=xe(e)?we(e,`utf8`):a.get(i),c=[],l=e=>{c.push(e),n.onPrint?.(e)},u=e=>l(`${e}\n`),d=n.version===`1.7.4`,f=d&&n.isXmlExport,p=e=>{n.isXmlExport||u(e)},m=n.describeFile,h=/* @__PURE__ */ new Map([[i,xe(e)?`file`:`standard`]]),g={value:!1},_=[],v={isReported:!1,isAborted:!1},y=fo(Ca(),u),b=/* @__PURE__ */ new Map,x=[],S=()=>x.splice(0).forEach(e=>e.isError?n.onPrintError?.(`${e.text}\n`):u(e.text)),C=e=>{let t=b.get(e),r=t?.module.location.range;if(t===void 0||r===void 0)return;let i=t.text.split(/\r\n|\r|\n/),a=ps(y,i.slice(r.start.line-1,r.end.line),n.version),o=a.has(`TLA_DIVERGENCE_EXISTS`),s=a.has(`PCAL_DIVERGENCE_EXISTS`),c=o===s?void 0:`The ${o?`TLA+ translation`:`PlusCal algorithm`} in module ${e} has changed since its last translation.`;if(d){let t=o&&s?`The PlusCal algorithm and its TLA+ translation in module ${e} filename since the last translation.`:c;t===void 0?a.has(`ERROR_ENCOUNTERED`)&&x.push({text:`A unexpected problem was encountered attempting to validate the specification for ${e}`,isError:!0}):x.push({text:`!! WARNING: ${t}`,isError:!1});return}let l=o&&s?`Both the PlusCal algorithm and its TLA+ translation in module ${e} have changed since the last translation.`:c??(a.has(`ERROR_ENCOUNTERED`)?`An unexpected problem was encountered attempting to validate the specification for ${e}`:void 0);if(l===void 0)return;let u=!a.has(`ERROR_ENCOUNTERED`)||o||s;_.some(e=>e.text===l)||_.push({location:e,text:l,isWarning:u})},w=(e,t)=>{if(n.isXmlExport||b.has(e))return;let r=Fl(t);if(r===void 0||r.name!==e)return;let i=[...b.values()].filter(t=>Pl(t.module).includes(e));b.set(e,{text:t,module:r}),i.forEach(()=>C(e)),Pl(r).filter(t=>t!==e&&b.has(t)).forEach(C)},T=()=>{if(S(),v.isReported)return;v.isReported=!0;let e=_.filter(e=>e.isWarning);e.length>0&&(p(`Warnings (${e.length}) during syntax parsing of ${o}:\n\n`),e.forEach(e=>p(`${jl(e)}\n\n\n`))),e.length!==_.length&&(u(Ml(_)),g.value=!0,v.isAborted=!0)},E=e=>{let n=a.get(e),i=t(e),o=i===void 0&&n===void 0&&s!==void 0&&!d?r(s,e):void 0,c=i??o;return h.set(e,i===void 0?o===void 0?`standard`:`root file`:`file`),c!==void 0&&w(e,c),c??n},te=(()=>{try{if(s===void 0)throw new ee(`Cannot find source file for module ${o}`,void 0);return w(i,s),Pc(s,E,{rootFileName:i,version:n.version,rootExtendees:n.rootExtendees,onParse:e=>{m&&u(`Parsing file ${m(e,h.get(e)??`file`)}`),e===i&&C(i),S()},onAnalyze:e=>{T(),(m||f)&&!v.isAborted&&u(`Semantic processing of module ${e}`)},onModule:(e,t)=>{if(v.isAborted||(t.every(e=>e.isWarning)&&vl(e,{messages:t,isTlc174:d}),t.length===0))return;if(t.some(e=>!e.isWarning)&&(g.value=!0),d)return u(`Semantic errors:\n\n${Ml(t)}`);let n=t.filter(e=>e.isWarning);n.length>0&&(p(`*** Warnings: ${n.length}\n`),n.forEach(e=>p(`${jl(e)}\n\n\n`)));let r=t.filter(e=>!e.isWarning);r.length!==0&&(u(`Semantic errors:\n\n*** Errors: ${r.length}\n`),r.forEach(e=>u(`${jl(e)}\n\n`)))}})}catch(e){if(g.value=!0,e instanceof D){u(`\nFatal errors while parsing TLA+ spec in file ${o}\n`),u(e.message),u(Ml(_));return}if(!(e instanceof ee))throw e;let t={location:e.location,text:e.message,isWarning:!1},n=d&&e.parseError?.includes(` and token "" `);if(e.parseError!==void 0&&!n&&!f&&u(e.parseError),u(`\nFatal errors while parsing TLA+ spec in file ${o}\n`),n){u(`java.lang.NullPointerException: Cannot invoke "String.length()" because "str" is null`);return}if(d){u(`tla2sany.semantic.AbortException`),l(`*** Abort messages: 1\n\n${jl(t)}\n\n\n`);return}u(jl(t)),u(Ml(v.isReported?[t]:[..._,t]))}})();if(te!==void 0&&T(),te!==void 0&&!g.value&&!n.isXmlExport&&!d){let e=te.modules.filter(e=>!Nl.has(e.name));m&&e.forEach(e=>u(`Linting of module ${e.name}`)),e.flatMap(Al).forEach(e=>u(`${jl(e)}\n\n\n`))}return{text:c.join(``),isFailed:g.value,specification:v.isAborted?void 0:te}},Rl={uncaughtException:1,argsParsingFailure:1,specParsingFailure:2,unrepresentableCharacter:7},zl=e=>`java.lang.IllegalArgumentException: unsupported kind: ${e} in xml export`,Z=(e,t=[])=>({tag:e,children:t}),Q=(e,t)=>({tag:e,text:String(t),children:[]}),Bl={"&":`&`,"<":`<`,">":`>`,"\r":` `},Vl=e=>e.replace(/[&<>\r]|[\u{10000}-\u{10FFFF}]/gu,e=>e.length===2?`&#${e.codePointAt(0)};`:Bl[e]),Hl=/[^\t\n\r\u0020-\uD7FF\uE000-\uFFFD\u{10000}-\u{10FFFF}]/u,Ul=e=>{let t=(e.cdata??e.text)?.match(Hl)?.[0];if(t!==void 0)return{tag:e.tag,character:t};for(let t of e.children){let e=Ul(t);if(e)return e}},Wl=(e,t,n,r)=>{let i=` `.repeat(t*n);if(e.cdata){let t=e.cdata.replaceAll(`]]>`,`]]]]><![CDATA[>`);r.push(`${i}<${e.tag}><![CDATA[${t}]]></${e.tag}>`)}else if(e.text)r.push(`${i}<${e.tag}>${Vl(e.text)}</${e.tag}>`);else if(e.children.length===0)r.push(`${i}<${e.tag}/>`);else{r.push(`${i}<${e.tag}>`);for(let i of e.children)Wl(i,t+1,n,r);r.push(`${i}</${e.tag}>`)}},Gl=e=>Z(`location`,[Z(`column`,[Q(`begin`,e.beginColumn),Q(`end`,e.endColumn)]),Z(`line`,[Q(`begin`,e.beginLine),Q(`end`,e.endLine)]),Q(`filename`,e.file)]),Kl=e=>{switch(e.kind){case`FormalParam`:return`FormalParamNodeRef`;case`OpDecl`:return`OpDeclNodeRef`;case`Module`:return`ModuleNodeRef`;case`Theorem`:return`TheoremNodeRef`;case`Assume`:return`AssumeNodeRef`;case`ThmOrAssumpDef`:return e.isTheorem?`TheoremDefRef`:`AssumeDefRef`;case`OpDef`:return e.defKind===`UserDefined`?`UserDefinedOpKindRef`:e.defKind===`BuiltIn`?`BuiltInKindRef`:`ModuleInstanceKindRef`}},$={main:{at:`xml.XMLExporter.main(XMLExporter.java:145)`},constant:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1228)`},variable:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1236)`},definition:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1244)`},topLevel:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1268)`},body:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1392)`,nullType:`ExprNode`,nullValue:`"this.body"`},param:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1397)`},builtInParam:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1413)`},theoremDefinitionBody:{at:`semantic.ThmOrAssumpDefNode.getSymbolElement(ThmOrAssumpDefNode.java:663)`,nullType:`LevelNode`,nullValue:`"this.body"`},theoremDefinition:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:439)`},theorem:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:444)`,nullType:`LevelNode`,nullValue:`the return value of "tla2sany.semantic.TheoremNode.getTheorem()"`},proof:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:447)`},assumeDefinition:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:249)`},assume:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:254)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeNode.getAssume()"`},operator:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1315)`},operand:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1326)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.operands[i]"`},unbound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1337)`},bound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1347)`},range:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1349)`,nullType:`ExprNode`,nullValue:`"this.ranges[i]"`},letBody:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:301)`,nullType:`ExprNode`,nullValue:`"this.body"`},letDefinition:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:303)`},labelBody:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:341)`,nullType:`LevelNode`,nullValue:`"this.body"`},labelParam:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:343)`},argument:{at:`semantic.OpArgNode.getLevelElement(OpArgNode.java:150)`},exceptObject:{at:`semantic.AtNode.getLevelElement(AtNode.java:180)`},exceptComponents:{at:`semantic.AtNode.getLevelElement(AtNode.java:181)`},substOperator:{at:`semantic.Subst.export(Subst.java:258)`},substExpression:{at:`semantic.Subst.export(Subst.java:259)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.expr"`},instanceSubst:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:447)`},instanceParam:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:452)`},useFact:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:175)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},useDefinition:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:176)`},newDeclaration:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:202)`},newSet:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:204)`},assumption:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:404)`,nullType:`SemanticNode`,nullValue:`"assumes[i]"`},goal:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:406)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeProveNode.getProve()"`},byFact:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:154)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},byDefinition:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:155)`},step:{at:`semantic.NonLeafProofNode.getLevelElement(NonLeafProofNode.java:228)`,nullType:`LevelNode`,nullValue:`"this.steps[i]"`},defStep:{at:`semantic.DefStepNode.getLevelElement(DefStepNode.java:99)`}},ql={SubstIn:{subst:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:530)`},body:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:533)`,nullType:`ExprNode`,nullValue:`"this.body"`},from:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:536)`},to:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:540)`}},APSubstIn:{subst:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:460)`},body:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:463)`,nullType:`LevelNode`,nullValue:`"this.body"`},from:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:466)`},to:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:470)`}}},Jl={at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1424)`},Yl=vs(`--TLA+ BUILTINS--`),Xl=(e,t)=>{let[n,r,i]=e===`Theorem`?[`TheoremNode.export(TheoremNode.java:456)`,70,`TheoremNode.exportDefinition(TheoremNode.java:404)`]:e===`Assume`?[`AssumeNode.export(AssumeNode.java:263)`,80,`AssumeNode.exportDefinition(AssumeNode.java:207)`]:[e===`ThmOrAssumpDef`?`ThmOrAssumpDefNode.export(ThmOrAssumpDefNode.java:671)`:`SymbolNode.export(SymbolNode.java:177)`,60,`SymbolNode.exportDefinition(SymbolNode.java:138)`];return[{at:`semantic.${n}`},{at:`xml.SymbolContext.put(SymbolContext.java:${r})`},{at:`semantic.${i}`,failedFor:t}]},Zl=(e,t=16)=>e>t*.75?Zl(e,t*2):t,Ql=(e,t)=>(e^e>>>16)&t-1,$l=e=>{let t=e.split(/\r?\n/);for(;t.at(-1)===``;)t.pop();return t},eu=e=>e.replace(/^[\0-\x20]+|[\0-\x20]+$/g,``),tu=/[\t-\r\x1C-\x20\u1680\u2000-\u2006\u2008-\u200A\u2028\u2029\u205F\u3000]+$/,nu=e=>{let t=e.indexOf(`(**`),n=e.lastIndexOf(`**)`);if(t<0||n<=t)return e;let r=$l(e),i=r.findIndex(e=>e.includes(`(**`)),a=r.findLastIndex(e=>e.includes(`**)`));return i<0||i>=a?e:r.slice(i+1,a).map(e=>{let t=e.indexOf(`(*`),n=e.indexOf(`*)`);return t<0||n<=t?e:e.slice(t+3,Math.max(t+3,n)).replace(tu,``)}).join(`
|
|
1349
|
+
Temporal formula used as set.`)),Gc(e,e.set)),e.levelCorrect;case`AssumeProve`:return e.levelChecked>=t||(e.levelChecked=t,e.levelCorrect=!0,e.assumptions.forEach(r=>{X(r,t,n)||(e.levelCorrect=!1)}),X(e.goal,t,n),e.level=e.assumptions.reduce((e,t)=>Math.max(e,t.level),e.goal.level),[e.goal,...e.assumptions].forEach(t=>Kc(e,t)),e.levelCorrect&&e.levelParams.forEach(t=>{t.kind===`OpDecl`&&t.declKind===2&&Bc(e.levelConstraints,t,2)})),e.levelCorrect}},Cl=e=>{switch(e.kind){case`OpAppl`:return[...e.ranges,...e.operands];case`OpDef`:case`ThmOrAssumpDef`:case`Label`:return[e.body];case`LetIn`:return[...e.opDefs,...e.instances,e.body];case`SubstIn`:case`APSubstIn`:return[e.body,...e.substs.map(e=>e.expr)];case`Instance`:return e.substs.map(e=>e.expr);case`AssumeProve`:return[...e.assumptions,e.goal];case`NewSymb`:return[e.set];default:return[]}},wl=/* @__PURE__ */ new Map([[`Integers`,`Int`],[`Naturals`,`Nat`],[`Reals`,`Reals`]]),Tl=e=>{let t=/* @__PURE__ */ new Set,n=e=>{if(e===void 0||t.has(e))return!1;if(t.add(e),e.kind===`OpAppl`){let t=e.operator;if(t.kind===`OpDecl`||t.kind===`FormalParam`)return!0;if(t.kind===`OpDef`){if(t.name===`BOOLEAN`)return!0;let e=t.module?.name;if(e!==void 0&&wl.get(e)===t.name||n(t))return!0}}return Cl(e).some(n)};return n(e)},El=e=>e.operands.filter(e=>e?.kind===`OpAppl`),Dl=e=>{let t=e.operands[0];return t?.kind===`String`?t:void 0},Ol=(e,t)=>{if(e===t)return!0;if(e.operands.length!==t.operands.length)return!1;let n=new Set(El(t).map(e=>Dl(e)?.value));return El(e).every(e=>n.has(Dl(e)?.value))},kl=(e,t=/* @__PURE__ */ new Set)=>(e.extendees.forEach(e=>{t.has(e)||(t.add(e),kl(e,t))}),t),Al=e=>{let t=[...[...kl(e)].flatMap(e=>e.records),...e.records];return e.records.flatMap(n=>t.filter(e=>Ol(e,n)).flatMap(El).some(Tl)?[]:El(n).flatMap(t=>{let n=Dl(t),r=n&&Ms(e.context,n.value);return n===void 0||r===void 0?[]:[{location:n.location,text:`The field name "${n.value}" in the record constructor is identical to the existing definition or declaration\nnamed ${n.value}, located at ${vs(r.location)}.\nThe field in the record will not take the value of the ${n.value} definition or declaration.\nIn TLA+, field names in records are strings, regardless of any similarly named declarations or definitions.\nTherefore, DOMAIN [${n.value} |-> ...] = {"${n.value}"} holds true.`,isWarning:!0}]}))},jl=e=>`${vs(e.location)}\n\n${e.text}`,Ml=e=>{let t=e.filter(e=>!e.isWarning),n=e.filter(e=>e.isWarning);return[t.length>0?`*** Errors: ${t.length}\n\n`:``,...t.map(e=>`${jl(e)}\n\n\n`),n.length>0?`*** Warnings: ${n.length}\n\n`:``,...n.map(e=>`${jl(e)}\n\n\n`)].join(``)},Nl=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),Pl=e=>{let t=/* @__PURE__ */ new Set,n=[],r=e=>{t.add(e.name),n.push(...e.extends),e.modules.forEach(r)};return r(e),n.filter(e=>!t.has(e))},Fl=e=>{try{return m(lc(e))}catch(e){if(e instanceof w)return;throw e}},Il=(e,t)=>t===`1.7.4`&&f(e)!==void 0?void 0:Fl(e)?.name,Ll=(e,t=()=>void 0,n={})=>{let i=ge(e,`.tla`),a=xa(n.version),o=n.fileName??i,s=xe(e)?we(e,`utf8`):a.get(i),c=[],l=e=>{c.push(e),n.onPrint?.(e)},u=e=>l(`${e}\n`),d=n.version===`1.7.4`,f=d&&n.isXmlExport,p=e=>{n.isXmlExport||u(e)},m=n.describeFile,h=/* @__PURE__ */ new Map([[i,xe(e)?`file`:`standard`]]),g={value:!1},_=[],v={isReported:!1,isAborted:!1},y=fo(Ca(),u),b=/* @__PURE__ */ new Map,x=[],S=()=>x.splice(0).forEach(e=>e.isError?n.onPrintError?.(`${e.text}\n`):u(e.text)),C=e=>{let t=b.get(e),r=t?.module.location.range;if(t===void 0||r===void 0)return;let i=t.text.split(/\r\n|\r|\n/),a=ps(y,i.slice(r.start.line-1,r.end.line),n.version),o=a.has(`TLA_DIVERGENCE_EXISTS`),s=a.has(`PCAL_DIVERGENCE_EXISTS`),c=o===s?void 0:`The ${o?`TLA+ translation`:`PlusCal algorithm`} in module ${e} has changed since its last translation.`;if(d){let t=o&&s?`The PlusCal algorithm and its TLA+ translation in module ${e} filename since the last translation.`:c;t===void 0?a.has(`ERROR_ENCOUNTERED`)&&x.push({text:`A unexpected problem was encountered attempting to validate the specification for ${e}`,isError:!0}):x.push({text:`!! WARNING: ${t}`,isError:!1});return}let l=o&&s?`Both the PlusCal algorithm and its TLA+ translation in module ${e} have changed since the last translation.`:c??(a.has(`ERROR_ENCOUNTERED`)?`An unexpected problem was encountered attempting to validate the specification for ${e}`:void 0);if(l===void 0)return;let u=!a.has(`ERROR_ENCOUNTERED`)||o||s;_.some(e=>e.text===l)||_.push({location:e,text:l,isWarning:u})},w=(e,t)=>{if(n.isXmlExport||b.has(e))return;let r=Fl(t);if(r===void 0||r.name!==e)return;let i=[...b.values()].filter(t=>Pl(t.module).includes(e));b.set(e,{text:t,module:r}),i.forEach(()=>C(e)),Pl(r).filter(t=>t!==e&&b.has(t)).forEach(C)},T=()=>{if(S(),v.isReported)return;v.isReported=!0;let e=_.filter(e=>e.isWarning);e.length>0&&(p(`Warnings (${e.length}) during syntax parsing of ${o}:\n\n`),e.forEach(e=>p(`${jl(e)}\n\n\n`))),e.length!==_.length&&(u(Ml(_)),g.value=!0,v.isAborted=!0)},E=e=>{let n=a.get(e),i=t(e),o=i===void 0&&n===void 0&&s!==void 0&&!d?r(s,e):void 0,c=i??o;return h.set(e,i===void 0?o===void 0?`standard`:`root file`:`file`),c!==void 0&&w(e,c),c??n},te=(()=>{try{if(s===void 0)throw new ee(`Cannot find source file for module ${o}`,void 0);return w(i,s),Pc(s,E,{rootFileName:i,rootFilePath:n.isXmlExport?`${o.replace(/\.tla$/,``)}.tla`:void 0,version:n.version,rootExtendees:n.rootExtendees,onParse:e=>{m&&u(`Parsing file ${m(e,h.get(e)??`file`)}`),e===i&&C(i),S()},onAnalyze:e=>{T(),(m||f)&&!v.isAborted&&u(`Semantic processing of module ${e}`)},onModule:(e,t)=>{if(v.isAborted||(t.every(e=>e.isWarning)&&vl(e,{messages:t,isTlc174:d}),t.length===0))return;if(t.some(e=>!e.isWarning)&&(g.value=!0),d)return u(`Semantic errors:\n\n${Ml(t)}`);let n=t.filter(e=>e.isWarning);n.length>0&&(p(`*** Warnings: ${n.length}\n`),n.forEach(e=>p(`${jl(e)}\n\n\n`)));let r=t.filter(e=>!e.isWarning);r.length!==0&&(u(`Semantic errors:\n\n*** Errors: ${r.length}\n`),r.forEach(e=>u(`${jl(e)}\n\n`)))}})}catch(e){if(g.value=!0,e instanceof D){u(`\nFatal errors while parsing TLA+ spec in file ${o}\n`),u(e.message),u(Ml(_));return}if(!(e instanceof ee))throw e;let t={location:e.location,text:e.message,isWarning:!1},n=d&&e.parseError?.includes(` and token "" `);if(e.parseError!==void 0&&!n&&!f&&u(e.parseError),u(`\nFatal errors while parsing TLA+ spec in file ${o}\n`),n){u(`java.lang.NullPointerException: Cannot invoke "String.length()" because "str" is null`);return}if(d){u(`tla2sany.semantic.AbortException`),l(`*** Abort messages: 1\n\n${jl(t)}\n\n\n`);return}u(jl(t)),u(Ml(v.isReported?[t]:[..._,t]))}})();if(te!==void 0&&T(),te!==void 0&&!g.value&&!n.isXmlExport&&!d){let e=te.modules.filter(e=>!Nl.has(e.name));m&&e.forEach(e=>u(`Linting of module ${e.name}`)),e.flatMap(Al).forEach(e=>u(`${jl(e)}\n\n\n`))}return{text:c.join(``),isFailed:g.value,specification:v.isAborted?void 0:te}},Rl={uncaughtException:1,argsParsingFailure:1,specParsingFailure:2,unrepresentableCharacter:7},zl=e=>`java.lang.IllegalArgumentException: unsupported kind: ${e} in xml export`,Z=(e,t=[])=>({tag:e,children:t}),Q=(e,t)=>({tag:e,text:String(t),children:[]}),Bl={"&":`&`,"<":`<`,">":`>`,"\r":` `},Vl=e=>e.replace(/[&<>\r]|[\u{10000}-\u{10FFFF}]/gu,e=>e.length===2?`&#${e.codePointAt(0)};`:Bl[e]),Hl=/[^\t\n\r\u0020-\uD7FF\uE000-\uFFFD\u{10000}-\u{10FFFF}]/u,Ul=e=>{let t=(e.cdata??e.text)?.match(Hl)?.[0];if(t!==void 0)return{tag:e.tag,character:t};for(let t of e.children){let e=Ul(t);if(e)return e}},Wl=(e,t,n,r)=>{let i=` `.repeat(t*n);if(e.cdata){let t=e.cdata.replaceAll(`]]>`,`]]]]><![CDATA[>`);r.push(`${i}<${e.tag}><![CDATA[${t}]]></${e.tag}>`)}else if(e.text)r.push(`${i}<${e.tag}>${Vl(e.text)}</${e.tag}>`);else if(e.children.length===0)r.push(`${i}<${e.tag}/>`);else{r.push(`${i}<${e.tag}>`);for(let i of e.children)Wl(i,t+1,n,r);r.push(`${i}</${e.tag}>`)}},Gl=e=>Z(`location`,[Z(`column`,[Q(`begin`,e.beginColumn),Q(`end`,e.endColumn)]),Z(`line`,[Q(`begin`,e.beginLine),Q(`end`,e.endLine)]),Q(`filename`,e.file)]),Kl=e=>{switch(e.kind){case`FormalParam`:return`FormalParamNodeRef`;case`OpDecl`:return`OpDeclNodeRef`;case`Module`:return`ModuleNodeRef`;case`Theorem`:return`TheoremNodeRef`;case`Assume`:return`AssumeNodeRef`;case`ThmOrAssumpDef`:return e.isTheorem?`TheoremDefRef`:`AssumeDefRef`;case`OpDef`:return e.defKind===`UserDefined`?`UserDefinedOpKindRef`:e.defKind===`BuiltIn`?`BuiltInKindRef`:`ModuleInstanceKindRef`}},$={main:{at:`xml.XMLExporter.main(XMLExporter.java:145)`},constant:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1228)`},variable:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1236)`},definition:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1244)`},topLevel:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1268)`},body:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1392)`,nullType:`ExprNode`,nullValue:`"this.body"`},param:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1397)`},builtInParam:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1413)`},theoremDefinitionBody:{at:`semantic.ThmOrAssumpDefNode.getSymbolElement(ThmOrAssumpDefNode.java:663)`,nullType:`LevelNode`,nullValue:`"this.body"`},theoremDefinition:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:439)`},theorem:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:444)`,nullType:`LevelNode`,nullValue:`the return value of "tla2sany.semantic.TheoremNode.getTheorem()"`},proof:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:447)`},assumeDefinition:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:249)`},assume:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:254)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeNode.getAssume()"`},operator:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1315)`},operand:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1326)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.operands[i]"`},unbound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1337)`},bound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1347)`},range:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1349)`,nullType:`ExprNode`,nullValue:`"this.ranges[i]"`},letBody:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:301)`,nullType:`ExprNode`,nullValue:`"this.body"`},letDefinition:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:303)`},labelBody:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:341)`,nullType:`LevelNode`,nullValue:`"this.body"`},labelParam:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:343)`},argument:{at:`semantic.OpArgNode.getLevelElement(OpArgNode.java:150)`},exceptObject:{at:`semantic.AtNode.getLevelElement(AtNode.java:180)`},exceptComponents:{at:`semantic.AtNode.getLevelElement(AtNode.java:181)`},substOperator:{at:`semantic.Subst.export(Subst.java:258)`},substExpression:{at:`semantic.Subst.export(Subst.java:259)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.expr"`},instanceSubst:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:447)`},instanceParam:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:452)`},useFact:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:175)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},useDefinition:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:176)`},newDeclaration:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:202)`},newSet:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:204)`},assumption:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:404)`,nullType:`SemanticNode`,nullValue:`"assumes[i]"`},goal:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:406)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeProveNode.getProve()"`},byFact:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:154)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},byDefinition:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:155)`},step:{at:`semantic.NonLeafProofNode.getLevelElement(NonLeafProofNode.java:228)`,nullType:`LevelNode`,nullValue:`"this.steps[i]"`},defStep:{at:`semantic.DefStepNode.getLevelElement(DefStepNode.java:99)`}},ql={SubstIn:{subst:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:530)`},body:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:533)`,nullType:`ExprNode`,nullValue:`"this.body"`},from:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:536)`},to:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:540)`}},APSubstIn:{subst:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:460)`},body:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:463)`,nullType:`LevelNode`,nullValue:`"this.body"`},from:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:466)`},to:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:470)`}}},Jl={at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1424)`},Yl=vs(`--TLA+ BUILTINS--`),Xl=(e,t)=>{let[n,r,i]=e===`Theorem`?[`TheoremNode.export(TheoremNode.java:456)`,70,`TheoremNode.exportDefinition(TheoremNode.java:404)`]:e===`Assume`?[`AssumeNode.export(AssumeNode.java:263)`,80,`AssumeNode.exportDefinition(AssumeNode.java:207)`]:[e===`ThmOrAssumpDef`?`ThmOrAssumpDefNode.export(ThmOrAssumpDefNode.java:671)`:`SymbolNode.export(SymbolNode.java:177)`,60,`SymbolNode.exportDefinition(SymbolNode.java:138)`];return[{at:`semantic.${n}`},{at:`xml.SymbolContext.put(SymbolContext.java:${r})`},{at:`semantic.${i}`,failedFor:t}]},Zl=(e,t=16)=>e>t*.75?Zl(e,t*2):t,Ql=(e,t)=>(e^e>>>16)&t-1,$l=e=>{let t=e.split(/\r?\n/);for(;t.at(-1)===``;)t.pop();return t},eu=e=>e.replace(/^[\0-\x20]+|[\0-\x20]+$/g,``),tu=/[\t-\r\x1C-\x20\u1680\u2000-\u2006\u2008-\u200A\u2028\u2029\u205F\u3000]+$/,nu=e=>{let t=e.indexOf(`(**`),n=e.lastIndexOf(`**)`);if(t<0||n<=t)return e;let r=$l(e),i=r.findIndex(e=>e.includes(`(**`)),a=r.findLastIndex(e=>e.includes(`**)`));return i<0||i>=a?e:r.slice(i+1,a).map(e=>{let t=e.indexOf(`(*`),n=e.indexOf(`*)`);return t<0||n<=t?e:e.slice(t+3,Math.max(t+3,n)).replace(tu,``)}).join(`
|
|
1350
1350
|
`)},ru=e=>{let t=$l(e),n=e=>eu(e).startsWith(`\\*`);return t.filter(n).length<Math.floor(t.length/2)?e:t.map(e=>{if(!n(e))return e;let t=e.indexOf(`\\*`)+2;return e.slice(e[t]===` `?t+1:t)}).join(`
|
|
1351
1351
|
`)},iu=(e,t,n)=>{let r=n.version===`1.7.4`,i=/* @__PURE__ */ new Set,a=/* @__PURE__ */ new Map,o={isSet:!1},s=[],c=(e,t)=>{if(!r)return t();s.push(...e);let n=t();return s.length-=e.length,n},l=(e,t)=>{let n=[...s,...t].reverse(),r=[e,...n.map(e=>`\tat tla2sany.${e.at}`)].join(`
|
|
1352
1352
|
`),i=n.filter(e=>e.failedFor!==void 0).map(e=>`failed for node.toString(): ${e.failedFor}\n with error \n${r}\n`).join(``);return pe(new S(r,i),Rl.uncaughtException)},u=e=>l(`java.lang.NullPointerException: Cannot invoke "tla2sany.semantic.${e.nullType}.export(org.w3c.dom.Document, tla2sany.xml.SymbolContext)" because ${e.nullValue} is null`,[e]),d=(e,t)=>(i.has(e.id)||(i.add(e.id),a.set(e.id,c([...t?[t]:[],...Xl(e.kind,vs(e.location))],()=>h(e)))),Z(Kl(e),[Q(`UID`,e.id)])),f=(e,t,n)=>{let r=t.levelChecked===0?[]:[Q(`level`,t.level)],i=n?[Gl(n),...r]:r;return{...e,children:[...i,...e.children]}},p=(e,t,n)=>Z(`params`,e.map((e,r)=>Z(`leibnizparam`,[d(e,n),...t?.[r]?[Z(`leibniz`)]:[]]))),m=e=>{let t=e.map(e=>e.trimEnd()).filter(e=>e.length>0).join(`
|