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.cjs
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
|
-
const e=require("./transfer.cjs"),t=require("./parallel.cjs");let n=require("node:path"),r=require("node:fs"),i=require("node:child_process"),a=require("node:crypto"),o=require("node:os"),s=require("node:url"),c=require("node:v8"),l=require("fflate");var u=`0.0.3-dev.b4e335d`;const d=e=>{let t=e.isRequired?e.flag:`[${e.flag}]`;return e.isRepeatable?`${t}...`:t},f=(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(d).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}}}},p=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}`},m=e=>`File ${JSON.stringify(e.file)}, ${p(e)}`,h=e=>`${e?m(e):`<unknown location>`}:\n`,g=(e,t)=>({text:`${h(e)}Error: ${t}`,channel:`stderr`}),_=e=>e?`${m(e)} :\n`:``,v=e=>({kind:`Shift`,amount:e}),y=(e,t)=>({kind:`Cons`,expression:e,rest:t}),b=(e,t)=>e.reduce((e,t)=>y(t,e),t),x=(e,t)=>t.kind===`Bump`?{kind:`Bump`,amount:t.amount+e,rest:t.rest}:{kind:`Bump`,amount:e,rest:t},S=(e,t)=>{let n=t.location?{...e,location:t.location}:e;return t.isAtomic?{...n,isAtomic:!0}:n},C=e=>{switch(e.kind){case`Fresh`:case`Flex`:return e.name;case`Defn`:return e.definition.name;case`Fact`:return}},w=(e,t,n)=>S({kind:`Apply`,operator:S({kind:`Internal`,builtin:e},n),args:t},n),T=e=>e.context.length===0?e.active:{kind:`Sequent`,sequent:e},E=(e,t)=>({hyp:t,rest:e,size:(e?.size??0)+1}),ee=(e,t)=>t.reduce(E,e),D=e=>{let t=[];for(let n=e;n;n=n.rest)t.push(n.hyp);return t.reverse()},te=(e,t)=>{let n=0;for(let r=e;r;r=r.rest){if(C(r.hyp)===t)return{depth:n,hyp:r.hyp};n++}},ne=(e,t)=>{let n=e;for(let e=0;e<t&&n;e++)n=n.rest;return n},O=(e,t,n)=>{let r=[];return[t.reduce((e,t)=>{let[i,a]=n(e,t);return r.push(a),i},e),r]},k=(e,t,n=0)=>({kind:`Fresh`,name:e,shape:n,level:t,domain:void 0,domainVisibility:`Visible`}),re=(e,t)=>({kind:`Fresh`,name:e,shape:0,level:`Constant`,domain:t,domainVisibility:`Visible`}),ie=(e,t,n)=>{switch(e.kind){case`Shift`:return S({kind:`Ix`,index:e.amount+t},n);case`Cons`:return t===1?S(M(e.expression),n):ie(e.rest,t-1,n);case`Compose`:return P(e.outer,ie(e.inner,t,n));case`Bump`:return t<=e.amount?S({kind:`Ix`,index:t},n):P(v(e.amount),ie(e.rest,t-e.amount,n))}},A=(e,t)=>t.map(t=>P(e,t)),j=(t,n)=>{if(t.kind===`Lambda`){if(t.params.length!==n.length)throw new e.ut(`Arity mismatch`);return M(P(b(n,v(0)),t.body))}return t.kind===`Apply`?{kind:`Apply`,operator:t.operator,args:[...t.args,...n]}:n.length===0?M(t):{kind:`Apply`,operator:t,args:n}},M=e=>{if(!e.location&&!e.isAtomic)return e;let{location:t,isAtomic:n,...r}=e;return r},N=(e,t)=>[x(t.length,e),me(t,t=>P(e,t))],ae=(e,t)=>{switch(t.kind){case`Recursive`:case`Operator`:case`Bpragma`:return _e(t,t=>P(e,t));case`Instance`:{let n=x(t.instance.args.length,e);return{...t,instance:{...t.instance,substitutions:t.instance.substitutions.map(e=>({name:e.name,expression:P(n,e.expression)}))}}}}},oe=(e,t)=>{switch(t.kind){case`Fresh`:return t.domain?{...t,domain:P(e,t.domain)}:t;case`Flex`:return t;case`Defn`:return{...t,definition:ae(e,t.definition)};case`Fact`:return{...t,expression:P(e,t.expression)}}},se=(e,t)=>{let[n,r]=O(e,t.context,(e,t)=>[x(1,e),oe(e,t)]);return{context:r,active:P(n,t.active)}},P=(e,t)=>{let n=t=>P(e,t);switch(t.kind){case`Internal`:case`Opaque`:case`String`:case`Num`:case`At`:return t;case`Ix`:return ie(e,t.index,t);case`Apply`:return S(j(n(t.operator),A(e,t.args)),t);case`Bang`:return{...t,expression:n(t.expression),selectors:t.selectors.map(e=>he(e,n))};case`Lambda`:return{...t,body:P(x(t.params.length,e),t.body)};case`Let`:{let[n,r]=O(e,t.definitions,(e,t)=>[x(1,e),ae(e,t)]);return{...t,definitions:r,body:P(n,t.body)}}case`Sequent`:return{...t,sequent:se(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:A(e,t.items)};case`Quant`:{let[n,r]=N(e,t.bounds);return{...t,bounds:r,body:P(n,t.body)}}case`Tquant`:return{...t,body:P(x(t.names.length,e),t.body)};case`Choose`:return{...t,domain:t.domain&&n(t.domain),body:P(x(1,e),t.body)};case`SetSt`:return{...t,domain:n(t.domain),body:P(x(1,e),t.body)};case`SetOf`:{let[n,r]=N(e,t.bounds);return{...t,bounds:r,element:P(n,t.element)}}case`SetEnum`:return{...t,elements:A(e,t.elements)};case`Arrow`:return{...t,domain:n(t.domain),range:n(t.range)};case`Fcn`:{let[n,r]=N(e,t.bounds);return{...t,bounds:r,body:P(n,t.body)}}case`FcnApp`:return{...t,function:n(t.function),args:A(e,t.args)};case`Product`:return{...t,factors:A(e,t.factors)};case`Tuple`:return{...t,elements:A(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:ge(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)}}},F=(e,t)=>e===0?t:P(v(e),t),I=(e,t,n)=>e.length===t.length&&e.every((e,r)=>n(e,t[r])),ce=(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||!L(t,n))return!1}return!0},le=(e,t)=>e.level===t.level&&e.domain.kind===t.domain.kind&&(e.domain.kind!==`Domain`||t.domain.kind===`Domain`&&L(e.domain.expression,t.domain.expression)),ue=(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`&&I(e.args,t.args,L);case`Label`:return t.kind===`Label`&&e.label===t.label&&I(e.args,t.args,L);default:return!0}},de=(e,t)=>{if(e.kind===`Operator`&&t.kind===`Operator`||e.kind===`Bpragma`&&t.kind===`Bpragma`)return L(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 I(e.instance.args,t.instance.args,(e,t)=>e===t)&&e.instance.module===t.instance.module&&ce(n,r)}return!1},fe=(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:L(e.domain,t.domain):e.kind===`Flex`&&t.kind===`Flex`?!0:e.kind===`Defn`&&t.kind===`Defn`?de(e.definition,t.definition)&&e.isLocal===t.isLocal:e.kind===`Fact`&&t.kind===`Fact`&&L(e.expression,t.expression),pe=(e,t)=>I(e.context,t.context,fe)&&L(e.active,t.active),L=(e,t)=>{if(e.kind===`Parens`)return L(e.expression,t);if(t.kind===`Parens`)return L(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&&L(e.body,t.body);case`Apply`:return t.kind===`Apply`&&L(e.operator,t.operator)&&I(e.args,t.args,L);case`Sequent`:return t.kind===`Sequent`&&pe(e.sequent,t.sequent);case`Bang`:return t.kind===`Bang`&&L(e.expression,t.expression)&&I(e.selectors,t.selectors,ue);case`With`:return t.kind===`With`&&L(e.expression,t.expression);case`Let`:return t.kind===`Let`&&I(e.definitions,t.definitions,de)&&L(e.body,t.body);case`If`:return t.kind===`If`&&L(e.condition,t.condition)&&L(e.consequent,t.consequent)&&L(e.alternative,t.alternative);case`List`:return t.kind===`List`&&e.bullet===t.bullet&&I(e.items,t.items,L);case`Quant`:return t.kind===`Quant`&&e.quantifier===t.quantifier&&I(e.bounds,t.bounds,le)&&L(e.body,t.body);case`Tquant`:return t.kind===`Tquant`&&e.quantifier===t.quantifier&&I(e.names,t.names,(e,t)=>e===t)&&L(e.body,t.body);case`Choose`:return t.kind===`Choose`?e.domain&&t.domain?L(e.domain,t.domain)&&L(e.body,t.body):!e.domain&&!t.domain&&L(e.body,t.body):!1;case`SetSt`:return t.kind===`SetSt`&&L(e.domain,t.domain)&&L(e.body,t.body);case`SetOf`:return t.kind===`SetOf`&&L(e.element,t.element)&&I(e.bounds,t.bounds,le);case`SetEnum`:return t.kind===`SetEnum`&&I(e.elements,t.elements,L);case`Arrow`:return t.kind===`Arrow`&&L(e.domain,t.domain)&&L(e.range,t.range);case`Fcn`:return t.kind===`Fcn`&&I(e.bounds,t.bounds,le)&&L(e.body,t.body);case`FcnApp`:return t.kind===`FcnApp`&&I([e.function,...e.args],[t.function,...t.args],L);case`Tuple`:return t.kind===`Tuple`&&I(e.elements,t.elements,L);case`Product`:return t.kind===`Product`&&I(e.factors,t.factors,L);case`Rect`:return t.kind===`Rect`&&ce(e.fields,t.fields);case`Record`:return t.kind===`Record`&&ce(e.fields,t.fields);case`Except`:return t.kind===`Except`&&L(e.function,t.function)&&I(e.specs,t.specs,(e,t)=>I(e.trail,t.trail,(e,t)=>e.kind===`Dot`?t.kind===`Dot`&&e.field===t.field:t.kind===`Apply`&&L(e.expression,t.expression))&&L(e.value,t.value));case`Dot`:return t.kind===`Dot`&&L(e.expression,t.expression)&&e.field===t.field;case`Sub`:case`Tsub`:return t.kind===e.kind&&e.modal===t.modal&&L(e.action,t.action)&&L(e.subscript,t.subscript);case`Fair`:return t.kind===`Fair`&&e.fairness===t.fairness&&L(e.subscript,t.subscript)&&L(e.action,t.action);case`Case`:return t.kind!==`Case`||!(e.arms.length===0||t.arms.length===0?e.arms.length===t.arms.length:L(e.arms[0].condition,t.arms[0].condition)&&L(e.arms[0].body,t.arms[0].body))?!1:e.other&&t.other?L(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}},me=(e,t)=>e.map(e=>e.domain.kind===`Domain`?{...e,domain:{kind:`Domain`,expression:t(e.domain.expression)}}:e),he=(e,t)=>e.kind===`Instance`||e.kind===`Label`?{...e,args:e.args.map(t)}:e,ge=(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}}),_e=(e,t)=>e.kind===`Operator`||e.kind===`Bpragma`?{...e,body:t(e.body)}:e,ve=(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:_e(e.definition,t)}:{...e,expression:t(e.expression)},ye=(e,t,n,r,i=`visible`)=>{let a=t=>n(e,t),o=t=>t.reduce((e,t)=>r(e,k(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=k(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]=O(e,t.sequent.context,(e,t)=>{let a=ve(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]=O(e,t.definitions,(e,t)=>{let i=_e(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=me(t.bounds,a);return{...t,bounds:e,body:n(o(e),t.body)}}case`SetOf`:{let e=me(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?re(t.name,i):k(t.name,`Constant`);return{...t,domain:i,body:n(r(e,o),t.body)}}case`SetSt`:{let i=a(t.domain),o=re(t.name,i);return{...t,domain:i,body:n(r(e,o),t.body)}}case`Bang`:{let e=t.selectors.map(e=>he(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=ge(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}}}},be=(e,t)=>ye(void 0,e,(e,n)=>t(n),()=>void 0,`all`),xe=e=>{let t=[];return be(e,e=>(t.push(e),e)),t},Se={kind:`Opaque`,name:`$Bad`},Ce=e=>e.kind===`Opaque`&&e.name===Se.name,we=e=>{let t=e.kind===`Parens`?we(e.expression):be(e,we);if(!t.isAtomic)return t;let{isAtomic:n,...r}=t;return r},Te=e=>e.kind===`Let`?S({kind:`Let`,definitions:e.definitions,body:Te(e.body)},e.body):e.kind===`Parens`?Te(e.expression):be(e,Te),Ee=e=>e.kind===`Ix`?e.index<=0:xe(e).some(Ee),De=(e,t,n)=>{let r=(e,r=n)=>De(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=>k(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=>k(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,k(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 xe(e)){let e=r(t);if(e)return e}return}},Oe=(e,t)=>b(Array.from({length:e},(e,t)=>({kind:`Ix`,index:t+1})),v(e+t)),R=e=>Array.from({length:e},(t,n)=>({kind:`Ix`,index:e-n})),ke=(t,n,r)=>{switch(n.kind){case`Quant`:case`Fcn`:case`SetOf`:{if(n.bounds.length!==r.length){let i=n.bounds.length,a=`Arity mismatch in subexpression instance.\nExpected ${i} argument${i===1?``:`s`}, but found${r.length<i?` only`:``} ${r.length}.`;throw t(g(n.location,a)),new e.ut(a,{failure:`Expr.Deref.deref_inst`})}let i=n.kind===`SetOf`?n.element:n.body;return P(b(r,v(0)),i)}case`Tquant`:return ke(t,S({kind:`Quant`,quantifier:n.quantifier,bounds:n.names.map(e=>({name:e,level:`State`,domain:{kind:`NoDomain`}})),body:n.body},n),r);case`Lambda`:return ke(t,S({kind:`Quant`,quantifier:`Forall`,bounds:n.params.map(e=>({name:e.name,level:`Unknown`,domain:{kind:`NoDomain`}})),body:n.body},n),r);case`SetSt`:case`Choose`:if(r.length!==1){let i=`Arity mismatch in subexpression instance.\nExpected 1 argument, but found ${r.length}.`;throw t(g(n.location,i)),new e.ut(i,{failure:`Expr.Deref.deref_inst`})}return P(b(r,v(0)),n.body);default:{let r=`Cannot instantiate non-binding expression`;throw t(g(n.location,r)),new e.ut(r,{failure:`Expr.Deref.deref_inst`})}}},Ae=(t,n,r)=>{let i=(()=>{switch(r.kind){case`Quant`:case`Fcn`:case`SetOf`:return r.bounds.map(e=>({name:e.name,shape:0}));case`Tquant`:return r.names.map(e=>({name:e,shape:0}));case`Lambda`:return r.params;case`SetSt`:case`Choose`:return[{name:r.name,shape:0}];default:{let n=`Cannot abstract over bound variables in a non-binding expression`;throw t(g(r.location,n)),new e.ut(n,{failure:`Expr.Deref.deref_at`})}}})(),a=P(Oe(n,i.length),r);return[i,ke(t,a,R(i.length))]},je=(t,n,r,i,a,o)=>{let s=n=>{if(!(i<=n))throw t(g(a.location,o)),new e.ut(o,{failure:`Expr.Deref.deref_num`})},c=e=>(s(e.length),e[i-1]),l=(()=>{switch(r.kind){case`Sequent`:{let a=r.sequent;s(a.context.length+1);let o=a.context[i-1];if(o&&o.kind!==`Fact`){let n=`subexpression reference does not resolve to an expression`;throw t(g(r.location,n)),new e.ut(n,{failure:`Expr.Deref.deref_num`})}let c=P(v(-(i-1)),o?o.expression:a.active);if(Ee(c))throw t(g(r.location,`subexpression of ASSUME/PROVE uses identifiers declared therein
|
|
9
|
+
const e=require("./transfer.cjs"),t=require("./parallel.cjs");let n=require("node:path"),r=require("node:fs"),i=require("node:child_process"),a=require("node:crypto"),o=require("node:os"),s=require("node:url"),c=require("node:v8"),l=require("fflate");var u=`0.0.3-dev.baa5e34`;const d=e=>{let t=e.isRequired?e.flag:`[${e.flag}]`;return e.isRepeatable?`${t}...`:t},f=(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(d).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}}}},p=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}`},m=e=>`File ${JSON.stringify(e.file)}, ${p(e)}`,h=e=>`${e?m(e):`<unknown location>`}:\n`,g=(e,t)=>({text:`${h(e)}Error: ${t}`,channel:`stderr`}),_=e=>e?`${m(e)} :\n`:``,v=e=>({kind:`Shift`,amount:e}),y=(e,t)=>({kind:`Cons`,expression:e,rest:t}),b=(e,t)=>e.reduce((e,t)=>y(t,e),t),x=(e,t)=>t.kind===`Bump`?{kind:`Bump`,amount:t.amount+e,rest:t.rest}:{kind:`Bump`,amount:e,rest:t},S=(e,t)=>{let n=t.location?{...e,location:t.location}:e;return t.isAtomic?{...n,isAtomic:!0}:n},C=e=>{switch(e.kind){case`Fresh`:case`Flex`:return e.name;case`Defn`:return e.definition.name;case`Fact`:return}},w=(e,t,n)=>S({kind:`Apply`,operator:S({kind:`Internal`,builtin:e},n),args:t},n),T=e=>e.context.length===0?e.active:{kind:`Sequent`,sequent:e},E=(e,t)=>({hyp:t,rest:e,size:(e?.size??0)+1}),ee=(e,t)=>t.reduce(E,e),D=e=>{let t=[];for(let n=e;n;n=n.rest)t.push(n.hyp);return t.reverse()},te=(e,t)=>{let n=0;for(let r=e;r;r=r.rest){if(C(r.hyp)===t)return{depth:n,hyp:r.hyp};n++}},ne=(e,t)=>{let n=e;for(let e=0;e<t&&n;e++)n=n.rest;return n},O=(e,t,n)=>{let r=[];return[t.reduce((e,t)=>{let[i,a]=n(e,t);return r.push(a),i},e),r]},k=(e,t,n=0)=>({kind:`Fresh`,name:e,shape:n,level:t,domain:void 0,domainVisibility:`Visible`}),re=(e,t)=>({kind:`Fresh`,name:e,shape:0,level:`Constant`,domain:t,domainVisibility:`Visible`}),ie=(e,t,n)=>{switch(e.kind){case`Shift`:return S({kind:`Ix`,index:e.amount+t},n);case`Cons`:return t===1?S(M(e.expression),n):ie(e.rest,t-1,n);case`Compose`:return P(e.outer,ie(e.inner,t,n));case`Bump`:return t<=e.amount?S({kind:`Ix`,index:t},n):P(v(e.amount),ie(e.rest,t-e.amount,n))}},A=(e,t)=>t.map(t=>P(e,t)),j=(t,n)=>{if(t.kind===`Lambda`){if(t.params.length!==n.length)throw new e.ut(`Arity mismatch`);return M(P(b(n,v(0)),t.body))}return t.kind===`Apply`?{kind:`Apply`,operator:t.operator,args:[...t.args,...n]}:n.length===0?M(t):{kind:`Apply`,operator:t,args:n}},M=e=>{if(!e.location&&!e.isAtomic)return e;let{location:t,isAtomic:n,...r}=e;return r},N=(e,t)=>[x(t.length,e),me(t,t=>P(e,t))],ae=(e,t)=>{switch(t.kind){case`Recursive`:case`Operator`:case`Bpragma`:return _e(t,t=>P(e,t));case`Instance`:{let n=x(t.instance.args.length,e);return{...t,instance:{...t.instance,substitutions:t.instance.substitutions.map(e=>({name:e.name,expression:P(n,e.expression)}))}}}}},oe=(e,t)=>{switch(t.kind){case`Fresh`:return t.domain?{...t,domain:P(e,t.domain)}:t;case`Flex`:return t;case`Defn`:return{...t,definition:ae(e,t.definition)};case`Fact`:return{...t,expression:P(e,t.expression)}}},se=(e,t)=>{let[n,r]=O(e,t.context,(e,t)=>[x(1,e),oe(e,t)]);return{context:r,active:P(n,t.active)}},P=(e,t)=>{let n=t=>P(e,t);switch(t.kind){case`Internal`:case`Opaque`:case`String`:case`Num`:case`At`:return t;case`Ix`:return ie(e,t.index,t);case`Apply`:return S(j(n(t.operator),A(e,t.args)),t);case`Bang`:return{...t,expression:n(t.expression),selectors:t.selectors.map(e=>he(e,n))};case`Lambda`:return{...t,body:P(x(t.params.length,e),t.body)};case`Let`:{let[n,r]=O(e,t.definitions,(e,t)=>[x(1,e),ae(e,t)]);return{...t,definitions:r,body:P(n,t.body)}}case`Sequent`:return{...t,sequent:se(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:A(e,t.items)};case`Quant`:{let[n,r]=N(e,t.bounds);return{...t,bounds:r,body:P(n,t.body)}}case`Tquant`:return{...t,body:P(x(t.names.length,e),t.body)};case`Choose`:return{...t,domain:t.domain&&n(t.domain),body:P(x(1,e),t.body)};case`SetSt`:return{...t,domain:n(t.domain),body:P(x(1,e),t.body)};case`SetOf`:{let[n,r]=N(e,t.bounds);return{...t,bounds:r,element:P(n,t.element)}}case`SetEnum`:return{...t,elements:A(e,t.elements)};case`Arrow`:return{...t,domain:n(t.domain),range:n(t.range)};case`Fcn`:{let[n,r]=N(e,t.bounds);return{...t,bounds:r,body:P(n,t.body)}}case`FcnApp`:return{...t,function:n(t.function),args:A(e,t.args)};case`Product`:return{...t,factors:A(e,t.factors)};case`Tuple`:return{...t,elements:A(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:ge(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)}}},F=(e,t)=>e===0?t:P(v(e),t),I=(e,t,n)=>e.length===t.length&&e.every((e,r)=>n(e,t[r])),ce=(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||!L(t,n))return!1}return!0},le=(e,t)=>e.level===t.level&&e.domain.kind===t.domain.kind&&(e.domain.kind!==`Domain`||t.domain.kind===`Domain`&&L(e.domain.expression,t.domain.expression)),ue=(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`&&I(e.args,t.args,L);case`Label`:return t.kind===`Label`&&e.label===t.label&&I(e.args,t.args,L);default:return!0}},de=(e,t)=>{if(e.kind===`Operator`&&t.kind===`Operator`||e.kind===`Bpragma`&&t.kind===`Bpragma`)return L(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 I(e.instance.args,t.instance.args,(e,t)=>e===t)&&e.instance.module===t.instance.module&&ce(n,r)}return!1},fe=(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:L(e.domain,t.domain):e.kind===`Flex`&&t.kind===`Flex`?!0:e.kind===`Defn`&&t.kind===`Defn`?de(e.definition,t.definition)&&e.isLocal===t.isLocal:e.kind===`Fact`&&t.kind===`Fact`&&L(e.expression,t.expression),pe=(e,t)=>I(e.context,t.context,fe)&&L(e.active,t.active),L=(e,t)=>{if(e.kind===`Parens`)return L(e.expression,t);if(t.kind===`Parens`)return L(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&&L(e.body,t.body);case`Apply`:return t.kind===`Apply`&&L(e.operator,t.operator)&&I(e.args,t.args,L);case`Sequent`:return t.kind===`Sequent`&&pe(e.sequent,t.sequent);case`Bang`:return t.kind===`Bang`&&L(e.expression,t.expression)&&I(e.selectors,t.selectors,ue);case`With`:return t.kind===`With`&&L(e.expression,t.expression);case`Let`:return t.kind===`Let`&&I(e.definitions,t.definitions,de)&&L(e.body,t.body);case`If`:return t.kind===`If`&&L(e.condition,t.condition)&&L(e.consequent,t.consequent)&&L(e.alternative,t.alternative);case`List`:return t.kind===`List`&&e.bullet===t.bullet&&I(e.items,t.items,L);case`Quant`:return t.kind===`Quant`&&e.quantifier===t.quantifier&&I(e.bounds,t.bounds,le)&&L(e.body,t.body);case`Tquant`:return t.kind===`Tquant`&&e.quantifier===t.quantifier&&I(e.names,t.names,(e,t)=>e===t)&&L(e.body,t.body);case`Choose`:return t.kind===`Choose`?e.domain&&t.domain?L(e.domain,t.domain)&&L(e.body,t.body):!e.domain&&!t.domain&&L(e.body,t.body):!1;case`SetSt`:return t.kind===`SetSt`&&L(e.domain,t.domain)&&L(e.body,t.body);case`SetOf`:return t.kind===`SetOf`&&L(e.element,t.element)&&I(e.bounds,t.bounds,le);case`SetEnum`:return t.kind===`SetEnum`&&I(e.elements,t.elements,L);case`Arrow`:return t.kind===`Arrow`&&L(e.domain,t.domain)&&L(e.range,t.range);case`Fcn`:return t.kind===`Fcn`&&I(e.bounds,t.bounds,le)&&L(e.body,t.body);case`FcnApp`:return t.kind===`FcnApp`&&I([e.function,...e.args],[t.function,...t.args],L);case`Tuple`:return t.kind===`Tuple`&&I(e.elements,t.elements,L);case`Product`:return t.kind===`Product`&&I(e.factors,t.factors,L);case`Rect`:return t.kind===`Rect`&&ce(e.fields,t.fields);case`Record`:return t.kind===`Record`&&ce(e.fields,t.fields);case`Except`:return t.kind===`Except`&&L(e.function,t.function)&&I(e.specs,t.specs,(e,t)=>I(e.trail,t.trail,(e,t)=>e.kind===`Dot`?t.kind===`Dot`&&e.field===t.field:t.kind===`Apply`&&L(e.expression,t.expression))&&L(e.value,t.value));case`Dot`:return t.kind===`Dot`&&L(e.expression,t.expression)&&e.field===t.field;case`Sub`:case`Tsub`:return t.kind===e.kind&&e.modal===t.modal&&L(e.action,t.action)&&L(e.subscript,t.subscript);case`Fair`:return t.kind===`Fair`&&e.fairness===t.fairness&&L(e.subscript,t.subscript)&&L(e.action,t.action);case`Case`:return t.kind!==`Case`||!(e.arms.length===0||t.arms.length===0?e.arms.length===t.arms.length:L(e.arms[0].condition,t.arms[0].condition)&&L(e.arms[0].body,t.arms[0].body))?!1:e.other&&t.other?L(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}},me=(e,t)=>e.map(e=>e.domain.kind===`Domain`?{...e,domain:{kind:`Domain`,expression:t(e.domain.expression)}}:e),he=(e,t)=>e.kind===`Instance`||e.kind===`Label`?{...e,args:e.args.map(t)}:e,ge=(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}}),_e=(e,t)=>e.kind===`Operator`||e.kind===`Bpragma`?{...e,body:t(e.body)}:e,ve=(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:_e(e.definition,t)}:{...e,expression:t(e.expression)},ye=(e,t,n,r,i=`visible`)=>{let a=t=>n(e,t),o=t=>t.reduce((e,t)=>r(e,k(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=k(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]=O(e,t.sequent.context,(e,t)=>{let a=ve(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]=O(e,t.definitions,(e,t)=>{let i=_e(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=me(t.bounds,a);return{...t,bounds:e,body:n(o(e),t.body)}}case`SetOf`:{let e=me(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?re(t.name,i):k(t.name,`Constant`);return{...t,domain:i,body:n(r(e,o),t.body)}}case`SetSt`:{let i=a(t.domain),o=re(t.name,i);return{...t,domain:i,body:n(r(e,o),t.body)}}case`Bang`:{let e=t.selectors.map(e=>he(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=ge(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}}}},be=(e,t)=>ye(void 0,e,(e,n)=>t(n),()=>void 0,`all`),xe=e=>{let t=[];return be(e,e=>(t.push(e),e)),t},Se={kind:`Opaque`,name:`$Bad`},Ce=e=>e.kind===`Opaque`&&e.name===Se.name,we=e=>{let t=e.kind===`Parens`?we(e.expression):be(e,we);if(!t.isAtomic)return t;let{isAtomic:n,...r}=t;return r},Te=e=>e.kind===`Let`?S({kind:`Let`,definitions:e.definitions,body:Te(e.body)},e.body):e.kind===`Parens`?Te(e.expression):be(e,Te),Ee=e=>e.kind===`Ix`?e.index<=0:xe(e).some(Ee),De=(e,t,n)=>{let r=(e,r=n)=>De(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=>k(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=>k(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,k(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 xe(e)){let e=r(t);if(e)return e}return}},Oe=(e,t)=>b(Array.from({length:e},(e,t)=>({kind:`Ix`,index:t+1})),v(e+t)),R=e=>Array.from({length:e},(t,n)=>({kind:`Ix`,index:e-n})),ke=(t,n,r)=>{switch(n.kind){case`Quant`:case`Fcn`:case`SetOf`:{if(n.bounds.length!==r.length){let i=n.bounds.length,a=`Arity mismatch in subexpression instance.\nExpected ${i} argument${i===1?``:`s`}, but found${r.length<i?` only`:``} ${r.length}.`;throw t(g(n.location,a)),new e.ut(a,{failure:`Expr.Deref.deref_inst`})}let i=n.kind===`SetOf`?n.element:n.body;return P(b(r,v(0)),i)}case`Tquant`:return ke(t,S({kind:`Quant`,quantifier:n.quantifier,bounds:n.names.map(e=>({name:e,level:`State`,domain:{kind:`NoDomain`}})),body:n.body},n),r);case`Lambda`:return ke(t,S({kind:`Quant`,quantifier:`Forall`,bounds:n.params.map(e=>({name:e.name,level:`Unknown`,domain:{kind:`NoDomain`}})),body:n.body},n),r);case`SetSt`:case`Choose`:if(r.length!==1){let i=`Arity mismatch in subexpression instance.\nExpected 1 argument, but found ${r.length}.`;throw t(g(n.location,i)),new e.ut(i,{failure:`Expr.Deref.deref_inst`})}return P(b(r,v(0)),n.body);default:{let r=`Cannot instantiate non-binding expression`;throw t(g(n.location,r)),new e.ut(r,{failure:`Expr.Deref.deref_inst`})}}},Ae=(t,n,r)=>{let i=(()=>{switch(r.kind){case`Quant`:case`Fcn`:case`SetOf`:return r.bounds.map(e=>({name:e.name,shape:0}));case`Tquant`:return r.names.map(e=>({name:e,shape:0}));case`Lambda`:return r.params;case`SetSt`:case`Choose`:return[{name:r.name,shape:0}];default:{let n=`Cannot abstract over bound variables in a non-binding expression`;throw t(g(r.location,n)),new e.ut(n,{failure:`Expr.Deref.deref_at`})}}})(),a=P(Oe(n,i.length),r);return[i,ke(t,a,R(i.length))]},je=(t,n,r,i,a,o)=>{let s=n=>{if(!(i<=n))throw t(g(a.location,o)),new e.ut(o,{failure:`Expr.Deref.deref_num`})},c=e=>(s(e.length),e[i-1]),l=(()=>{switch(r.kind){case`Sequent`:{let a=r.sequent;s(a.context.length+1);let o=a.context[i-1];if(o&&o.kind!==`Fact`){let n=`subexpression reference does not resolve to an expression`;throw t(g(r.location,n)),new e.ut(n,{failure:`Expr.Deref.deref_num`})}let c=P(v(-(i-1)),o?o.expression:a.active);if(Ee(c))throw t(g(r.location,`subexpression of ASSUME/PROVE uses identifiers declared therein
|
|
10
10
|
Tlapm does not handle yet such subexpression namings.`)),new e.ut(`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[n,c]}case`Apply`:return[n,c(r.args)];case`With`:return je(t,n,r.expression,i,a,o);case`If`:return[n,c([r.condition,r.consequent,r.alternative])];case`List`:return[n,c(r.items)];case`SetEnum`:case`Tuple`:return[n,c(r.elements)];case`Product`:return[n,c(r.factors)];case`Let`:return s(1),[[...n,...r.definitions],r.body];case`Quant`:case`SetOf`:case`Fcn`:return[n,c(r.bounds.flatMap(e=>e.domain.kind===`Domain`?[e.domain.expression]:[]))];case`Choose`:case`SetSt`:if(!r.domain)break;return[n,c([r.domain])];case`Arrow`:return[n,c([r.domain,r.range])];case`FcnApp`:{let e=r.args.length===1?r.args[0]:S({kind:`Tuple`,elements:r.args},r);return[n,c([r.function,e])]}case`Rect`:case`Record`:return[n,c(r.fields.map(e=>e.value))];case`Dot`:return[n,c([r.expression,S({kind:`String`,value:r.field},r)])];case`Except`:return[n,c([r.function,...r.specs.map(e=>e.value)])];case`Sub`:case`Tsub`:return[n,c([r.action,r.subscript])];case`Fair`:return[n,c([r.subscript,r.action])];case`Case`:return[n,c([...r.arms.map(e=>S({kind:`Tuple`,elements:[e.condition,e.body]},e.body)),...r.other?[S({kind:`Tuple`,elements:[Se,r.other]},r.other)]:[]])]}let l=`Expression has no subexpressions`;throw t(g(r.location,l)),new e.ut(l,{failure:`Expr.Deref.deref_num`})})();if(Ce(l[1])){let n=`Cannot resolve subexpression reference !${i}`;throw t(g(r.location,n)),new e.ut(n,{failure:`Expr.Deref.deref_num`})}return l},Me=(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])},Ne=(t,n,r,i,a)=>{let o=De(r,i,[]);if(!o)return t(g(r.location,`Could not find label ${i}`)),{params:[],definitions:[],expression:Se};let s=o.indices;if(s.length!==a.length&&a.length>0){let n=s.length===1?``:`s`,r=`Expected ${s.length} argument${n} for labelled reference !${i}, but found ${a.length}`;throw t(g(o.expression.location,r)),new e.ut(r,{failure:`Expr.Deref.deref_lsub`})}let c=a.length===0?s.map(e=>({name:e.name,shape:0})):[],l=a.length===0?R(s.length):a,u=o.context.reduceRight((e,t)=>t.kind===`Defn`?S({kind:`Let`,definitions:[t.definition],body:e},e):t.kind===`Fresh`?S({kind:`Quant`,quantifier:`Forall`,bounds:[{name:t.name,level:`Constant`,domain:{kind:`NoDomain`}}],body:e},e):P(v(-1),e),o.expression),d=P(Oe(n,c.length),u),f=[],p=d,m=Me(s.map(e=>e.index),l);for(;m.length>0;)if(p.kind===`Let`&&p.definitions.length===1)f.push(p.definitions[0]),p=p.body,m=m.map(e=>P(v(1),e));else{if(p.kind!==`Quant`||p.bounds.length!==1)throw new e.mt(`File "src/expr/e_deref.ml", line 477, characters 21-33: Assertion failed`);p=P(y(m[0],v(0)),p.body),m=m.slice(1)}return{params:c,definitions:f,expression:p}},Pe=(t,n,r,i,a)=>{if(r.kind!==`Let`)throw t(g(r.location,`not a LET expression`)),new e.ut(`not a LET expression`,{failure:`Expr.Deref.deref_letop`});let o=r.definitions.findIndex(e=>e.kind===`Operator`&&e.name===i),s=r.definitions[o];if(!s||s.kind!==`Operator`){let n=`no definition of operator ${i}`;throw t(g(r.location,n)),new e.ut(n,{failure:`Expr.Deref.deref_letop`})}let c=s.body,l=c.kind===`Lambda`?S({...c,body:S({kind:`Parens`,expression:c.body,form:{kind:`Xlabel`,label:i,indices:c.params.map((e,t)=>({name:e.name,index:c.params.length-t}))}},c.body)},c):S({kind:`Parens`,expression:c,form:{kind:`Xlabel`,label:i,indices:[]}},c);return Ne(t,n,S({kind:`Let`,definitions:r.definitions.slice(0,o),body:l},c),i,a)},Fe=(t,n,r,i)=>{let[a,...o]=i;if(!a){let e=r.definitions.length===0?r.expression:S({kind:`Let`,definitions:r.definitions,body:r.expression},r.expression),t=r.params.length===0?e:S({kind:`Lambda`,params:r.params,body:e},e);return{...we(t),isAtomic:!0}}if(r.expression.isAtomic)return t(g(r.expression.location,`Expression has no subexpressions`)),Se;let s=n?r.expression:Te(r.expression),c=r.definitions.length,l=(()=>{let i=(e,n)=>{let[i,a]=je(t,[],s,e,r.expression,n);return{params:[],definitions:i,expression:a,rest:o,isLabel:!1}};switch(a.kind){case`Down`:{let[r,...i]=o;if(s.kind===`Let`&&r?.kind===`Label`&&n)return{...Pe(t,c,s,r.label,r.args),rest:i,isLabel:!0};if(n)return{params:[],definitions:[],expression:s,rest:o,isLabel:!1};throw new e.ut(`!: 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(Fo(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=Fo(f.op,a.length);if(o){let e=Fo(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=Fo(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=Ro(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=Fo(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(Fo(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=Fo(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`?wo(f.op):u.previousMode===`FindingOpName`&&Lo(f)?wo(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:wo(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=Ao.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}.`)},Vo=/* @__PURE__ */ new Map([[`(`,`)`],[`[`,`]`],[`{`,`}`],[`<<`,`>>`]]),Ho=(e,t)=>`${e}:${t}`,Uo=(t,n)=>{let r=e.tt(n).filter(e=>e.kind!==`End`).map(e.et),i=[0,0];for(let e=0;e<n.length;e++)n[e]===`
|
|
1345
1345
|
`&&i.push(e+1);return{name:t,source:n,tokens:r,lineOffsets:i,tokenIndexes:new Map(r.map((e,t)=>[Ho(e.line,e.column),t]))}},K=(e,t,n)=>e.tokens[t]!==void 0&&e.tokens[t].text===n&&e.tokens[t].kind!==`String`,Wo=(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},Go=(e,t)=>e.tokenIndexes.get(Ho(t.line,t.column))??Math.min(Wo(e,t,!1),e.tokens.length-1),Ko=(e,t)=>Math.max(Wo(e,t,!0)-1,0),qo=(e,t)=>{let n=e.tokens[t].text,r=Vo.get(n);if(r===void 0)return t;let i=0;for(let a=t;a<e.tokens.length;a++)if(K(e,a,n))i++;else if(K(e,a,r)&&(i--,i===0))return a;return t},Jo=(e,t)=>({start:Go(e,t.start),end:Ko(e,t.end)}),q=(e,t)=>{let n=t.location.range;if(n)return Jo(e,n);let r=Go(e,t.location);return{start:r,end:qo(e,r)}},Yo=(e,t)=>{let n=t.start-1,r=t.end+1;return K(e,n,`(`)&&K(e,r,`)`)&&qo(e,n)===r?Yo(e,{start:n,end:r}):t},Xo=(e,t)=>{let n=t.start-1,r=t.end+1;return K(e,n,`(`)&&qo(e,n)===r&&(K(e,n-1,`(`)||K(e,n-1,`,`))?Xo(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}),Zo=(e,t)=>J(e,{start:t,end:t}),Qo=(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},$o=(e,t)=>{let n=e.tokens[t],r=Qo(e,n.line,n.column);return e.source.slice(r,Qo(e,n.line,n.endColumn)+1)},es=(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},ts=t=>{let n=Uo(``,t),r=n.tokens.reduce((e,t,r)=>{if(!es(n,r))return e;let i=Qo(n,t.line,t.column);return`${e.slice(0,i)} ${e.slice(i+2)}`},t);if(r!==t&&e.D(t)!==void 0)throw new e.ft(`SANY rejects a []ASSUME or []PROVE outside an ASSUME/PROVE`);return r},ns=(e,t)=>{let n=e.tokens[t-1],r=e.tokens[t],i=n===void 0?0:Qo(e,n.line,n.endColumn)+1,a=e.source.slice(i,Qo(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},rs=(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},is=(e,t,n,r)=>{for(let i=t;i<=n;i++)if(K(e,i,r))return i;return-1},as=new Map(e.O.flatMap(([e,...t])=>t.map(t=>[t,e]))),os=e=>e.split(`!`).map(e=>as.get(e)??(e===`~`?`\\lnot`:e)).join(`!`),ss={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}},cs=e=>/^[A-Za-z0-9_]+$/.test(e),ls=e=>e!==`!!`&&e.includes(`!`),us=e=>e.contexts[e.contexts.length-1],ds=(e,t)=>{for(let n=e.contexts.length-1;n>=0;n--){let r=To(e.contexts[n],t);if(r)return r}},fs=e=>e.kind===`OpDecl`?`${e.kind}${e.declKind}`:e.kind===`OpDef`?e.defKind:e.kind,ps=e=>e.kind===`OpDef`||e.kind===`FormalParam`?`definition`:`declaration`,ms=(e,t)=>{if(e.kind===`OpDef`&&t.kind===`OpDef`){let n=e.source??e;return n===(t.source??t)?n.module===void 0||hs(n.module):!1}if(e.kind===`ThmOrAssumpDef`&&t.kind===`ThmOrAssumpDef`){let n=e.source??e;return n===(t.source??t)&&hs(n.module)}return!1},hs=e=>Oo(e,2).length===0&&Oo(e,3).length===0,gs=t=>[...t.kind===`Let`?t.instances??[]:[],...e.W(t).flatMap(gs)],_s=e=>e.kind===`AssumeProve`?[...e.assumptions,e.conclusion].flatMap(e=>e.kind===`NewSymbol`?[]:_s(e)):gs(e),vs=(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},ys=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`?gs(e.definition.body):e.kind===`Theorem`&&s?_s(e.theorem.statement):e.kind===`Assumption`&&s?gs(e.assumption.expression):[]).map(e=>e.module).filter(e=>l(e)&&!vs(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}},bs=/* @__PURE__ */ new Set([`Identifier`,`Subexpression`,`OperatorReference`,`Lambda`]),xs=e=>{let t=e.kind===`Apply`?Mo(e):void 0;return bs.has(e.kind)||t!==void 0&&No(t)},Ss=/* @__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`]]),Cs=/* @__PURE__ */ new Set([`N_GeneralId`,`N_OpApplication`,`N_PrefixExpr`,`N_InfixExpr`,`N_PostfixExpr`,`N_FcnAppl`,`N_RecordComponent`]),ws=/* @__PURE__ */ new Set([`'`,`^+`,`^*`,`^#`]),Ts=(e,t)=>ws.has(t)?`N_GenPostfixOp`:e.kind===`Lambda`||t===`~`||t===`-.`?`N_GenNonExpPrefixOp`:`N_GenInfixOp`,Es=(t,n,r={})=>{let i=[],a=(e,t)=>lo(i,{location:e,text:t,isWarning:!1}),o=(e,t)=>lo(i,{location:e,text:t,isWarning:!0}),s={value:r.version===`1.7.4`?-1:0},c=()=>++s.value,l={id:0},u=(e,t)=>{let n=ds(e,t.name);if(n===t)return;if(n===void 0){Co(us(e),t);return}let i=t.kind===`FormalParam`||fs(n)!==fs(t)||wo(n)!==wo(t);n.kind===`OpDef`&&n.defKind===`BuiltIn`&&!(i&&r.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 ${uo(n.location)}.`):ms(t,n)||o(t.location,`Multiple declarations or definitions for symbol ${t.name}. \nThis duplicates the one at ${uo(n.location)}.`)};r.version!==`1.7.4`&&co(c);let d=co(c);c();let f=new Map(d.map(e=>[e.name,e])),p=/* @__PURE__ */ new Map,m=/* @__PURE__ */ new Map,h=(t,n)=>{let i=n=>new e.dt(`Could not parse module ${t} from file ${t}.tla`,t,n),a=r.version===`1.7.4`?e.Q(n):void 0;if(a!==void 0)throw i(a);try{return e.T(ts(n))}catch(t){throw t instanceof e.ft?i(e.D(n)??`***Parse Error***\n${t.message}`):t}},g=(t,n,i)=>{let a=m.get(t);if(a)return a;if(n===void 0)throw new e.lt(t,i,r.version!==`1.7.4`);r.onParse?.(t);let o=h(t,n);if(o.name!==t)throw new e.dt(`File name '${t}' does not match the name '${o.name}' of the top level module it contains.`,void 0);let s={file:Uo(o.name,n),module:o};return m.set(t,s),s},_=[],v=/* @__PURE__ */ new Set,y=[],b=(t,r,i)=>{let a=y.indexOf(t);if(a!==-1)throw new e.dt(`Circular dependency among .tla files; dependency cycle is:\n\n ${[...y.slice(a),t].map(e=>`${e}.tla`).join(` --> `)}`,void 0);if(v.has(t))return;v.add(t),y.push(t);let o=E(t,g(t,r,i).module);[...o.extendees,...o.instancees].forEach(e=>b(e,n(e),t)),y.pop(),_.push(t)},x=/* @__PURE__ */ new Set,S=(e,t)=>x.has(`${e} ${t}`),C=(e,t,n)=>{let r=m.get(e);if(!r||n.has(e))return;n.add(e);let i=E(e,r.module),a=i[t].find(t=>!S(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=S(e,r)?C(r,t,n):void 0;if(i)return i}},w=e=>{g(e,t);let r=()=>C(e,`extendees`,/* @__PURE__ */ new Set)??C(e,`instancees`,/* @__PURE__ */ new Set);for(let e=r();e!==void 0;e=r())m.has(e.name)||g(e.name,n(e.name),e.namingModule),x.add(`${e.importer} ${e.name}`)},T=r.rootFileName??h(``,t).name,E=(e,t)=>{let n=ys(t);return e!==T||r.rootExtendees===void 0||(n.extendees.splice(t.extends.length,0,...r.rootExtendees),r.rootExtendees.forEach(t=>{n.importers.has(t)||n.importers.set(t,e)})),n};w(T),b(T,t);let ee=(t,n,i,s)=>{let d={curLevel:0,unresolvedCount:[0],unresolvedSum:0,recursiveSectionCount:0},m=[],h=[],g=[],_=[],v=/* @__PURE__ */ new WeakSet,y=()=>_.push({labels:/* @__PURE__ */ new Map,params:[]}),b=()=>_.pop()?.labels??/* @__PURE__ */ new Map,x={depth:0,isDeclared:[],goal:void 0,goalClause:0},S=/* @__PURE__ */ new WeakMap,C=/* @__PURE__ */ new WeakMap,w=e=>{let t=e.kind===`AssumeProve`?S.get(e):void 0;t&&(t.isInProof=!1)},T=e=>J(n,q(n,e)),E=e=>e.range?Jo(n,e.range):{start:Go(n,e),end:Go(n,e)},D={kind:`Module`,id:c(),name:t.name,location:J(n,E(t.location)),extendees:[],context:us(s),topLevel:[],definitions:[],opDefsInRecursiveSection:[],isLevelChecked:!1,levelCorrect:!0,argLevelParams:/* @__PURE__ */ new Map,levelConstraints:/* @__PURE__ */ new Map,argLevelConstraints:/* @__PURE__ */ new Map,records:[]};i&&i.definitions.push(D);let te=e=>{for(let t=s.contexts.length-1;t>=0;t--){let n=Eo(s.contexts[t],e);if(n?.kind===`Module`)return n}return p.get(e)},ne=t=>{let n=te(t);if(n===void 0)throw new e.ft(`Could not find module ${t}`);return n},O=(e,t)=>{s.contexts.push(e);let n=t();return s.contexts.pop(),n},k=(e,t,n,r)=>{let i={...G(c()),kind:`FormalParam`,name:e,arity:t,location:n};return r&&u(s,i),i},re=e=>({...G(c()),kind:`OpDef`,defKind:`UserDefined`,arity:e.params?.length??0,params:[],body:void 0,isLocal:!1,module:D,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}),ie=e=>{e.letInLevel=d.curLevel,d.unresolvedSum>0&&(e.recursiveSection=d.recursiveSectionCount,e.inRecursiveSection=d.unresolvedCount[d.curLevel]>0,D.opDefsInRecursiveSection.push(e))},A=(e,t,n,r={},i=c())=>({...G(i),kind:`OpAppl`,operator:e,operands:t,unbounded:r.unbounded,bounded:r.bounded,tupleOrs:r.tupleOrs,ranges:r.ranges??[],location:n}),j=()=>({...A(M(`$Nop`),[],so,{},l.id),isNull:!0}),M=t=>{let n=f.get(t);if(!n)throw new e.pt(`SANY has no builtin operator ${t}`);return n},N=(e,t,n,r={})=>A(M(e),t,n,r),ae=(e,t)=>({...G(c()),kind:`String`,value:e,location:t}),oe=(e,t)=>({...G(c()),kind:`OpArg`,op:e,location:t}),se=(t,n)=>{let r=ds(s,os(t));if(r===void 0||r.kind===`Module`)throw new e.ft(`Unknown operator: \`${t}' at line ${n.beginLine}, column ${n.beginColumn} of module ${n.file}`);return r},P=(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`&&wo(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.`)},F=Bo({version:r.version,resolveSymbol:e=>ds(s,e),resolveSynonym:os,generateExpression:e=>R(e),generateArgument:(e,t,n,r)=>ge(e,t,n,r),createOpAppl:(e,t,n)=>{let r=A(e,t,n);return P(e,t,n),r},createOpArg:oe,createFormalParam:(e,t,n)=>k(e,t,n,!1),createLambda:(e,t,r)=>re({name:`LAMBDA`,params:e,body:t,location:r,preComments:ns(n,Go(n,{line:r.beginLine,column:r.beginColumn}))}),copySubstIn:(e,t)=>Be(`SubstIn`,e.substs,t,e.instantiatedModule,e.location,e.instantiatingModule),getBuiltin:M,addError:(e,t)=>(a(e,t),j()),isOutOfLabelScope:e=>{let t=C.get(e);return t!==void 0&&t.scope.isDeclaredBefore[t.clause]&&t.scope.isSuffices===t.scope.isInProof},isOutOfClauseScope:(e,t)=>{let n=S.get(e);return n!==void 0&&n.isDeclaredBefore[t-1]&&(!n.hasGoal||n.isSuffices===n.isInProof)}}),I=(e,t)=>{let r={value:t.start};return e.map(e=>{let i=e.op===`Name`?e.name:e.op===`Null`?`(`:String(e.op),a=is(n,r.value,t.end,i);if(a===-1)return e;if(e.op===`Null`){let t=qo(n,a);return r.value=t+1,{...e,location:J(n,{start:a,end:t})}}r.value=a+1;let o=Zo(n,a);if(e.args===void 0||!K(n,a+1,`(`))return{...e,location:o};let s=qo(n,a+1);return r.value=s+1,{...e,location:o,argsLocation:J(n,{start:a+1,end:s})}})},ce=(t,r,i,a)=>{let o=Mo(t);if(o===void 0)throw new e.ft(`Expected a name, found ${t.kind}`);return F(I(o,q(n,t)),r,i,a,T(t))},le=t=>{let n=ce(t,0,!1,!1);if(n.kind!==`OpAppl`)throw new e.ft(`Expected an expression`);return n},ue=e=>{if(e.kind!==`OpAppl`)return;let t=m.find(t=>t.name===e.operator.name);t&&(t.node.operator=M(`$RecursiveFcnSpec`))},de=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},[]),fe=(e,t)=>ke(e,t,de(e).map(e=>R(e[0].set))),pe=(e,t)=>{let n=_.at(-1);n?.params.push(e);let r=R(t);return n?.params.pop(),r},L=e=>{let t=q(n,e),r=rs(n,t.start,t.end,e.params);return O(xo(),()=>{let i=e.params.map((e,t)=>k(e,0,Zo(n,r[t]),!0)),a=pe(i,e.body);return re({name:`LAMBDA`,params:i,body:a,location:J(n,t),preComments:ns(n,t.start)})})},me=e=>e.kind===`OperatorReference`?e.operator:e.kind===`Lambda`&&e.body.kind===`Apply`?e.body.operator:n.tokens[Go(n,e.location)].text,he=(t,n)=>{let r=T(t);if(t.kind===`Lambda`)return t.location.range===void 0?oe(se(me(t),r),r):oe(L(t),r);if(!xs(t))return a(r,`Arity ${n.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${n.name}'.`),j();if(t.kind===`OperatorReference`)return oe(se(t.operator,r),r);let i=ce(t,n.arity,!1,!1);if(i.kind===`OpArg`||i.kind===`OpAppl`&&i.isNull===!0)return i;throw new e.ft(`Expected an operator argument at line ${r.beginLine}, column ${r.beginColumn}`)},ge=(t,r,i,o)=>{let c=t.kind===`OpDef`&&(t.defKind===`UserDefined`||t.defKind===`ModuleInstance`)?t.params?.[r]?.arity??0:0;if(c===0)return R(i);let l=q(n,i),u=J(n,l),d=`${r+1} (counting from 1)`,f=Xo(n,l);if(f!==l||!xs(i))return a(J(n,f),`An expression appears as argument number ${d} to operator '${t.name}', in a position an operator is required.`),j();if(i.kind===`Identifier`||i.kind===`Subexpression`||i.kind===`Apply`){let t=ce(i,c,!1,!1);if(t.kind===`OpArg`||t.kind===`OpAppl`)return t;throw new e.ft(`Expected an operator argument at ${uo(u)}`)}if(i.kind===`Lambda`&&i.location.range!==void 0){let e=L(i),n=wo(e);return n===c?oe(e,u):(a(o,`Lambda expression with arity ${n} used as argument ${r+1} of operator \`${t.name}', \nbut an operator of arity ${c} is required.`),j())}let p=me(i),m=ds(s,os(p));if(m===void 0)return a(u,`Could not find declaration or definition of symbol '${p}'.`),j();let h=wo(m);return h===c?oe(m,u):(a(o,`Operator with incorrect arity passed as argument. \nOperator '${m.name}' of arity ${h} is argument number ${d} to operator \`${uo(t.location)}', \nbut an operator of arity ${c} was expected.`),j())},_e=e=>{let t=T(e);if(e.isBulleted)return N(e.kind===`And`?`$ConjList`:`$DisjList`,e.operands.map(R),t);let r=q(n,e),i=e.kind===`And`?`\\land`:`\\lor`,[a,...o]=e.operands;return o.reduce((e,t,a)=>{let s=Yo(n,q(n,t)),c=a===o.length-1?r.end:s.end;return N(i,[e,R(t)],J(n,{start:r.start,end:c}))},R(a))},ve=e=>{let t=q(n,e),r=e.arms.map((r,i)=>{let a=Yo(n,q(n,r.condition)),o=i===e.arms.length-1&&e.other===void 0,s=Yo(n,q(n,r.body)),c=[R(r.condition),R(r.body)];return N(`$Pair`,c,J(n,{start:a.start,end:o?t.end:s.end}))}),i=e.other;if(i){let e=Yo(n,q(n,i)),a=ye(e.start,`OTHER`);r.push(N(`$Pair`,[void 0,R(i)],J(n,{start:a,end:t.end})))}return N(`$Case`,r,J(n,t))},ye=(e,t)=>{for(let r=e;r>=0;r--)if(K(n,r,t))return r;return e},be=e=>{let t=q(n,e),r=J(n,t),i=[R(e.function)],a=N(`$Except`,i,r),o=q(n,e.function),s={value:is(n,o.end+1,t.end,`EXCEPT`)+1};return e.updates.forEach(e=>{let r=is(n,s.value,t.end,`!`),o=Yo(n,q(n,e.value)),c=J(n,{start:r,end:o.end}),l={value:r+1},u=e.path.map(e=>{if(e.kind===`Field`){let t=xe(l.value,e.name);return l.value=t+1,ae(e.name,Zo(n,t))}let r=is(n,l.value,t.end,`[`),i=qo(n,r);return l.value=i+1,e.args.length===1?R(e.args[0]):N(`$Tuple`,e.args.map(R),J(n,{start:r,end:i}))}),d=N(`$Seq`,u,c),f=N(`$Pair`,[d],c);g.push(f),h.push(a),f.operands.push(R(e.value)),g.pop(),h.pop(),i.push(f),s.value=o.end+1}),a},xe=(e,t)=>{for(let r=e;r<n.tokens.length;r++)if(n.tokens[r].text===t&&n.tokens[r].kind!==`String`)return r;return e},Se=(e,t)=>{let r=q(n,t),i={value:r.start+1},o=t.fields.map((e,r)=>{let o=xe(i.value,e.name),s=Yo(n,q(n,e.value));return i.value=s.end+1,t.fields.slice(0,r).some(t=>t.name===e.name)&&a(Zo(n,o),`Non-unique fields in constructor.`),N(`$Pair`,[ae(e.name,Zo(n,o)),R(e.value)],J(n,{start:o,end:s.end}))}),s=N(e,o,J(n,r));return D.records.push(s),s},Ce=e=>({line:n.tokens[e].line,column:n.tokens[e].column}),we=e=>{let t=[],r=e;for(;n.tokens[r]?.kind===`Identifier`;){let e=K(n,r+1,`(`)?qo(n,r+1):r,i=n.tokens.slice(r+1,e).filter(e=>e.text===`_`).length;if(t.push({name:n.tokens[r].text,arity:i,location:{...Ce(r),range:{module:n.name,start:Ce(r),end:Ce(e)}}}),!K(n,e+1,`,`))break;r=e+2}return t},Te=e=>{let t=[...e.definitions.map(e=>({unit:{kind:`Definition`,definition:e},span:Me(e)})),...(e.instances??[]).map(e=>({unit:{kind:`Instance`,instance:e},span:Me(e)}))],r=q(n,e).start,i=Yo(n,q(n,e.body)).start,a=[];for(let e=r+1;e<i;e++){let r=t.some(t=>t.span.start<=e&&e<=t.span.end);K(n,e,`RECURSIVE`)&&!r&&a.push({unit:{kind:`Recursive`,declarations:we(e+1)},span:{start:e,end:e}})}return[...t,...a].toSorted((e,t)=>e.span.start-t.span.start).map(e=>e.unit)},Ee=e=>{let t=xo();return O(t,()=>{d.curLevel++,d.unresolvedCount[d.curLevel]=0;let n=[],r=[];Te(e).forEach(e=>{e.kind===`Recursive`?Le(e.declarations):e.kind===`Instance`?Ve(e.instance,n,r):e.definition.kind===`Function`?Fe(e.definition,n):Ne(e.definition,n)}),Re(),d.curLevel=Math.max(d.curLevel-1,0);let i=R(e.body);return{...G(c()),kind:`LetIn`,opDefs:n,instances:r,body:i,context:t,location:T(e)}})},De=e=>{let t=q(n,e),r=J(n,t);return O(xo(),()=>{let i=e.pattern,a=i.kind===`Name`?[i.name]:i.names;if(e.set===void 0){let o=rs(n,t.start,t.end,a),s=a.map((e,r)=>k(e,0,Zo(n,i.kind===`Name`?t.start:o[r]),!0)),c=pe(s,e.body);return N(`$UnboundedChoose`,[c],r,{unbounded:s})}let o=R(e.set),s=q(n,e.set),c=rs(n,t.start,s.start,a),l=a.map((e,t)=>k(e,0,Zo(n,c[t]),!0)),u=pe(l,e.body);return N(`$BoundedChoose`,[u],r,{bounded:[l],tupleOrs:[i.kind===`Tuple`],ranges:[o]})})},Oe=e=>{if(cs(e.operator)||ls(e.operator)||e.args.length>2||ds(s,os(e.operator))!==void 0)return;let t=q(n,e);if(n.tokens[t.start].text===e.operator&&K(n,t.start+1,`(`))return;let r=Yo(n,q(n,e.args[0])),i=e.args.length===1&&r.start!==t.start,a=i?t.start:r.end+1,o=$o(n,a);return{index:a,name:i&&o===`-`?`-.`:o,fixity:i?`prefix`:e.args.length===2?`infix`:`postfix`}},R=e=>{let t=T(e);switch(e.kind){case`Number`:return{...G(c()),kind:`Numeral`,value:Ds(e.text??String(e.value)),location:t};case`Decimal`:{let[n,r]=e.text.split(`.`),i=BigInt(n+r),a=i<=9223372036854775807n;return{...G(c()),kind:`Decimal`,mantissa:i.toString(),exponent:String(a?-r.length:r.length),integralPart:n,fractionalPart:r,location:t}}case`String`:return ae(e.value,t);case`Identifier`:{let t=le(e);return ue(t),t}case`Apply`:{let r=Oe(e);if(r!==void 0)return a(Zo(n,r.index),`Could not find declaration or definition of symbol '${r.name}'.`),a(t,`Couldn't resolve ${r.fixity} operator symbol \`${r.name}'.`),{...j(),isAbsent:!0};let i=le(e);return(ls(e.operator)||cs(e.operator))&&ue(i),i}case`Bracket`:return a(Zo(n,q(n,e).start),"Unsupported expression type `['."),{...j(),isAbsent:!0};case`OperatorReference`:case`Lambda`:{let r=n.tokens[q(n,e).start].text;return a(t,r===`LAMBDA`?`LAMBDA expression used where an expression is required.`:`Unsupported expression type \`${Ts(e,r)}'.`),{...j(),isAbsent:!0}}case`And`:case`Or`:return _e(e);case`Prime`:return N(`'`,[R(e.expression)],t);case`Unchanged`:return N(`UNCHANGED`,[R(e.expression)],t);case`Enabled`:return N(`ENABLED`,[R(e.expression)],t);case`Always`:return N(`[]`,[R(e.expression)],t);case`Eventually`:return N(`<>`,[R(e.expression)],t);case`If`:return N(`$IfThenElse`,[R(e.condition),R(e.consequent),R(e.alternative)],t);case`Case`:return ve(e);case`Let`:return Ee(e);case`Forall`:case`Exists`:{let r=q(n,e);return O(xo(),()=>{let n=fe(e.bounds,r.start),i=pe(n.bounded.flat(),e.body);return N(e.kind===`Forall`?`$BoundedForall`:`$BoundedExists`,[i],t,n)})}case`UnboundedQuantifier`:{let r=q(n,e),i=q(n,e.body),a=rs(n,r.start,i.start,e.names),o=e.isTemporal?e.quantifier===`Forall`?`$TemporalForall`:`$TemporalExists`:e.quantifier===`Forall`?`$UnboundedForall`:`$UnboundedExists`;return O(xo(),()=>{let r=e.names.map((e,t)=>k(e,0,Zo(n,a[t]),!0)),i=pe(r,e.body);return N(o,[i],t,{unbounded:r})})}case`Choose`:return De(e);case`SetEnumeration`:return N(`$SetEnumerate`,e.elements.map(R),t);case`Tuple`:return N(`$Tuple`,e.elements.map(R),t);case`SetFilter`:{let r=R(e.bound.set),i=q(n,e);return O(xo(),()=>{let n=ke([e.bound],i.start,[r]),a=pe(n.bounded.flat(),e.predicate);return N(`$SubsetOf`,[a],t,n)})}case`SetMap`:{let r=q(n,e.expression);return O(xo(),()=>{let n=fe(e.bounds,r.end+1),i=pe(n.bounded.flat(),e.expression);return N(`$SetOfAll`,[i],t,n)})}case`FunctionConstruction`:{let r=q(n,e);return O(xo(),()=>{let n=fe(e.bounds,r.start),i=pe(n.bounded.flat(),e.body);return N(`$FcnConstructor`,[i],t,n)})}case`FunctionSet`:return N(`$SetOfFcns`,[R(e.domain),R(e.range)],t);case`Record`:return Se(`$RcdConstructor`,e);case`RecordSet`:return Se(`$SetOfRcds`,e);case`Except`:return be(e);case`ExceptAt`:{let e=h[h.length-1],n=g[g.length-1];return e===void 0||n===void 0?(a(t,`@ used where its meaning is not defined.`),j()):{...G(c()),kind:`At`,except:e,component:n,location:n.location}}case`FunctionApplication`:{let n=R(e.function);if(fo(n))return n;ue(n);let r=e.args.length===1?R(e.args[0]):N(`$Tuple`,e.args.map(R),t);return N(`$FcnApply`,[n,r],t)}case`FieldAccess`:{let r=R(e.record),i=q(n,e);return N(`$RcdSelect`,[r,ae(e.field,Zo(n,i.end))],t)}case`Product`:return N(`$CartesianProd`,e.factors.map(R),t);case`BoxAction`:case`AngleAction`:return N(e.kind===`BoxAction`?`$SquareAct`:`$AngleAct`,[R(e.action),R(e.subscript)],t);case`WeakFairness`:case`StrongFairness`:return N(e.kind===`WeakFairness`?`$WF`:`$SF`,[R(e.subscript),R(e.action)],t);case`Label`:return Ae(e);case`Subexpression`:return le(e)}},ke=(e,t,r)=>{let i=de(e),a={value:t};return{bounded:i.map(e=>{let t=q(n,e[0].set),r=e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),i=rs(n,a.value,t.start,r);return a.value=t.end+1,r.map((e,t)=>k(e,0,Zo(n,i[t]),!0))}),tupleOrs:i.map(e=>e[0].pattern.kind===`Tuple`),ranges:r}},Ae=e=>{let t=T(e),r=_.at(-1);if(r===void 0)return a(t,`Label not in definition or proof step.`),j();if(x.isDeclared.slice(2,x.depth+1).some(Boolean))return a(t,`Label not allowed within scope of declaration in nested ASSUME/PROVE.`),j();if(h.length>0&&g.length>0)return a(t,`Labels inside EXCEPT clauses are not yet implemented.`),j();y();let i=R(e.body),o=b(),l=rs(n,q(n,e).start,q(n,e.body).start,e.params),u=e.params.map((t,r)=>{let i=ds(s,t);if(i?.kind===`FormalParam`)return i;let o=Zo(n,l[r]);return a(o,`Illegal parameter ${t} of label \`${e.name}'.`),k(t,0,o,!1)}),d={...G(c()),kind:`Label`,name:e.name,params:u,body:i,labels:o,isAssumeProve:!1,location:t},f=/* @__PURE__ */ new Set;if(u.forEach(e=>{f.has(e)&&a(t,`Repeated formal parameter ${e.name} \nin label \`${d.name}'.`),f.add(e)}),r.params.flat().forEach(e=>{f.delete(e)||a(t,`Label ${d.name} must contain formal parameter \`${e.name}'.`)}),f.size>0){let e=[...f].map(e=>`${e.name} `).join(``);a(t,`Label ${d.name} declares extra parameter(s) ${e}`)}r.labels.has(d.name)?a(t,`Duplicate label \`${d.name}'.`):r.labels.set(d.name,d);let p=x.goal;return p&&C.set(d,{scope:p,clause:x.goalClause}),d},je=(e,t,r)=>{let i={value:t.start};return e.params.map(e=>{let t=e.location?Go(n,e.location):xe(i.value,e.name),a=ut(t,e.arity);return i.value=a.end+1,k(os(e.name),e.arity,J(n,a),r)})},Me=e=>{let t=E(e.location);return e.isLocal&&!K(n,t.start,`LOCAL`)&&K(n,t.start-1,`LOCAL`)?{start:t.start-1,end:t.end}:t},Ne=(e,t)=>{let r=Me(e),i=J(n,r),o=os(e.name),c={start:e.isLocal?r.start+1:r.start,end:r.end},l=O(xo(),()=>{let t=je(e,c,!0),n=ds(s,o);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===d.curLevel?e||a(i,`Definition of ${n.name} has different arity than its RECURSIVE declaration.`):a(i,`Recursive operator ${o} defined at wrong LET/IN level.`)}else n!==void 0&&a(i,`Operator ${o} already defined or declared.`);return y(),{params:t,body:R(e.body),existing:n}}),f=b(),p=l.existing,m=l.params,h=ns(n,r.start);if(p?.kind===`OpDef`&&p.inRecursive&&!p.isDefined&&p.letInLevel===d.curLevel){p.params=m,p.weights=m.map(()=>0),p.maxLevels=m.map(()=>3),p.isLeibnizArg=m.map(()=>!0),p.labels=f,Pe(p,l.body,i,h),D.definitions.push(p),t?.push(p);return}let g=re({name:o,params:m,body:l.body,isLocal:e.isLocal,location:i,preComments:h,labels:f});u(s,g),ie(g),D.definitions.push(g),t?.push(g)},Pe=(e,t,n,r)=>{e.isDefined=!0,e.body=t,e.location=n,e.preComments=r,e.inRecursive&&(d.unresolvedCount[d.curLevel]--,d.unresolvedSum--)},Fe=(e,t)=>{let r=Me(e),i=J(n,r),o=xo(),c=e.isLocal?r.start+1:r.start,l=O(o,()=>fe(e.bounds,c+1)),f=ds(s,e.name),p=O(o,()=>k(e.name,0,i,f===void 0)),h=N(`$NonRecursiveFcnSpec`,[],i,{unbounded:[p],...l}),g=f?.kind===`OpDef`&&f.inRecursive&&!f.isDefined,_=g&&f.letInLevel===d.curLevel;_?f.arity!==0&&a(i,`Function ${f.name} has operator arguments in its RECURSIVE declaration.`):g?a(i,`Recursive function ${e.name} defined at wrong LET/IN level.`):f!==void 0&&a(i,`Function name \`${e.name}' already defined or declared.`);let v=ns(n,r.start),x=f===void 0?re({name:e.name,params:[],body:h,isLocal:e.isLocal,location:i,preComments:v}):f.kind===`OpDef`&&(_||!g)?f:void 0;_?f.arity===0&&Pe(f,h,i,v):f===void 0&&x!==void 0&&(u(s,x),ie(x)),x!==void 0&&(D.definitions.push(x),t?.push(x)),m.unshift({name:e.name,node:h}),y();let S=()=>pe(l.bounded.flat(),e.body),C=x===void 0?S():O(o,S),w=b();x!==void 0&&(x.labels=w),m.shift(),h.operands=[C],h.operator.name===`$NonRecursiveFcnSpec`&&(h.unbounded=void 0)},Ie=[],Le=e=>{d.unresolvedSum===0&&d.recursiveSectionCount++,d.unresolvedCount[d.curLevel]+=e.length,d.unresolvedSum+=e.length,e.forEach(e=>{let t=dt(e);c();let r=Array.from({length:e.arity},()=>k(``,0,void 0,!1)),i=re({name:os(e.name),params:r,location:J(n,t),isDefined:!1,inRecursive:!0,inRecursiveSection:!0,recursiveSection:d.recursiveSectionCount,letInLevel:d.curLevel});u(s,i),Ie.push(i),D.opDefsInRecursiveSection.push(i)})},Re=()=>{d.unresolvedCount[d.curLevel]!==0&&(Ie.filter(e=>e.letInLevel===d.curLevel&&!e.isDefined).forEach(e=>a(e.location,`Symbol ${e.name} declared in RECURSIVE statement but not defined.`)),d.unresolvedSum-=d.unresolvedCount[d.curLevel])},ze=(e,t,i)=>{c();let o=yo(t.table).filter(e=>e.kind===`OpDecl`),l=o.flatMap(e=>{let t=ds(s,e.name);return t===void 0?[]:[{op:e,expr:e.declKind===3||e.declKind===2&&e.arity===0?A(t,[],i):oe(t,i),isImplicit:!0}]}),u=(e,t)=>{let n=t.kind===`OpArg`?wo(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=Me(e),f={value:is(n,d.start,d.end,`WITH`)+1};return e.substitutions.forEach(e=>{let r=is(n,f.value,d.end,e.name);r!==-1&&(f.value=q(n,e.expression).end+1);let o=To(t,os(e.name));if(o?.kind!==`OpDecl`){a(r===-1?i:Zo(n,r),`Identifier '${r===-1?e.name:$o(n,r)}' 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=o.arity===0?R(e.expression):he(e.expression,o);u(o,s);let c=l.find(e=>e.op.name===o.name);c&&!c.isImplicit?a(T(e.expression),`Multiple substitutions for symbol '${o.name}' in substitution.`):c?(c.expr=s,c.isImplicit=!1):l.push({op:o,expr:s,isImplicit:!1})}),l.filter(e=>e.isImplicit&&r.version!==`1.7.4`).forEach(e=>u(e.op,e.expr)),o.filter(e=>!l.some(t=>t.op.name===e.name)).forEach(e=>a(i,`Substitution missing for symbol ${e.name} declared at ${uo(e.location)} \nand instantiated in module ${D.name}.`)),l},Be=(e,t,n,r,i,o=D)=>(fo(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},rs=(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},is=(e,t,n,r)=>{for(let i=t;i<=n;i++)if(K(e,i,r))return i;return-1},as=new Map(e.O.flatMap(([e,...t])=>t.map(t=>[t,e]))),os=e=>e.split(`!`).map(e=>as.get(e)??(e===`~`?`\\lnot`:e)).join(`!`),ss={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}},cs=e=>/^[A-Za-z0-9_]+$/.test(e),ls=e=>e!==`!!`&&e.includes(`!`),us=e=>e.contexts[e.contexts.length-1],ds=(e,t)=>{for(let n=e.contexts.length-1;n>=0;n--){let r=To(e.contexts[n],t);if(r)return r}},fs=e=>e.kind===`OpDecl`?`${e.kind}${e.declKind}`:e.kind===`OpDef`?e.defKind:e.kind,ps=e=>e.kind===`OpDef`||e.kind===`FormalParam`?`definition`:`declaration`,ms=(e,t)=>{if(e.kind===`OpDef`&&t.kind===`OpDef`){let n=e.source??e;return n===(t.source??t)?n.module===void 0||hs(n.module):!1}if(e.kind===`ThmOrAssumpDef`&&t.kind===`ThmOrAssumpDef`){let n=e.source??e;return n===(t.source??t)&&hs(n.module)}return!1},hs=e=>Oo(e,2).length===0&&Oo(e,3).length===0,gs=t=>[...t.kind===`Let`?t.instances??[]:[],...e.W(t).flatMap(gs)],_s=e=>e.kind===`AssumeProve`?[...e.assumptions,e.conclusion].flatMap(e=>e.kind===`NewSymbol`?[]:_s(e)):gs(e),vs=(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},ys=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`?gs(e.definition.body):e.kind===`Theorem`&&s?_s(e.theorem.statement):e.kind===`Assumption`&&s?gs(e.assumption.expression):[]).map(e=>e.module).filter(e=>l(e)&&!vs(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}},bs=/* @__PURE__ */ new Set([`Identifier`,`Subexpression`,`OperatorReference`,`Lambda`]),xs=e=>{let t=e.kind===`Apply`?Mo(e):void 0;return bs.has(e.kind)||t!==void 0&&No(t)},Ss=/* @__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`]]),Cs=/* @__PURE__ */ new Set([`N_GeneralId`,`N_OpApplication`,`N_PrefixExpr`,`N_InfixExpr`,`N_PostfixExpr`,`N_FcnAppl`,`N_RecordComponent`]),ws=/* @__PURE__ */ new Set([`'`,`^+`,`^*`,`^#`]),Ts=(e,t)=>ws.has(t)?`N_GenPostfixOp`:e.kind===`Lambda`||t===`~`||t===`-.`?`N_GenNonExpPrefixOp`:`N_GenInfixOp`,Es=(t,n,r={})=>{let i=[],a=(e,t)=>lo(i,{location:e,text:t,isWarning:!1}),o=(e,t)=>lo(i,{location:e,text:t,isWarning:!0}),s={value:r.version===`1.7.4`?-1:0},c=()=>++s.value,l={id:0},u=(e,t)=>{let n=ds(e,t.name);if(n===t)return;if(n===void 0){Co(us(e),t);return}let i=t.kind===`FormalParam`||fs(n)!==fs(t)||wo(n)!==wo(t);n.kind===`OpDef`&&n.defKind===`BuiltIn`&&!(i&&r.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 ${uo(n.location)}.`):ms(t,n)||o(t.location,`Multiple declarations or definitions for symbol ${t.name}. \nThis duplicates the one at ${uo(n.location)}.`)};r.version!==`1.7.4`&&co(c);let d=co(c);c();let f=new Map(d.map(e=>[e.name,e])),p=/* @__PURE__ */ new Map,m=/* @__PURE__ */ new Map,h=(t,n)=>{let i=t===r.rootFileName&&r.rootFilePath||`${t}.tla`,a=n=>new e.dt(`Could not parse module ${t} from file ${i}`,t,n),o=r.version===`1.7.4`?e.Q(n):void 0;if(o!==void 0)throw a(o);try{return e.T(ts(n))}catch(t){throw t instanceof e.ft?a(e.D(n)??`***Parse Error***\n${t.message}`):t}},g=(t,n,i)=>{let a=m.get(t);if(a)return a;if(n===void 0)throw new e.lt(t,i,r.version!==`1.7.4`);r.onParse?.(t);let o=h(t,n);if(o.name!==t)throw new e.dt(`File name '${t}' does not match the name '${o.name}' of the top level module it contains.`,void 0);let s={file:Uo(o.name,n),module:o};return m.set(t,s),s},_=[],v=/* @__PURE__ */ new Set,y=[],b=(t,r,i)=>{let a=y.indexOf(t);if(a!==-1)throw new e.dt(`Circular dependency among .tla files; dependency cycle is:\n\n ${[...y.slice(a),t].map(e=>`${e}.tla`).join(` --> `)}`,void 0);if(v.has(t))return;v.add(t),y.push(t);let o=E(t,g(t,r,i).module);[...o.extendees,...o.instancees].forEach(e=>b(e,n(e),t)),y.pop(),_.push(t)},x=/* @__PURE__ */ new Set,S=(e,t)=>x.has(`${e} ${t}`),C=(e,t,n)=>{let r=m.get(e);if(!r||n.has(e))return;n.add(e);let i=E(e,r.module),a=i[t].find(t=>!S(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=S(e,r)?C(r,t,n):void 0;if(i)return i}},w=e=>{g(e,t);let r=()=>C(e,`extendees`,/* @__PURE__ */ new Set)??C(e,`instancees`,/* @__PURE__ */ new Set);for(let e=r();e!==void 0;e=r())m.has(e.name)||g(e.name,n(e.name),e.namingModule),x.add(`${e.importer} ${e.name}`)},T=r.rootFileName??h(``,t).name,E=(e,t)=>{let n=ys(t);return e!==T||r.rootExtendees===void 0||(n.extendees.splice(t.extends.length,0,...r.rootExtendees),r.rootExtendees.forEach(t=>{n.importers.has(t)||n.importers.set(t,e)})),n};w(T),b(T,t);let ee=(t,n,i,s)=>{let d={curLevel:0,unresolvedCount:[0],unresolvedSum:0,recursiveSectionCount:0},m=[],h=[],g=[],_=[],v=/* @__PURE__ */ new WeakSet,y=()=>_.push({labels:/* @__PURE__ */ new Map,params:[]}),b=()=>_.pop()?.labels??/* @__PURE__ */ new Map,x={depth:0,isDeclared:[],goal:void 0,goalClause:0},S=/* @__PURE__ */ new WeakMap,C=/* @__PURE__ */ new WeakMap,w=e=>{let t=e.kind===`AssumeProve`?S.get(e):void 0;t&&(t.isInProof=!1)},T=e=>J(n,q(n,e)),E=e=>e.range?Jo(n,e.range):{start:Go(n,e),end:Go(n,e)},D={kind:`Module`,id:c(),name:t.name,location:J(n,E(t.location)),extendees:[],context:us(s),topLevel:[],definitions:[],opDefsInRecursiveSection:[],isLevelChecked:!1,levelCorrect:!0,argLevelParams:/* @__PURE__ */ new Map,levelConstraints:/* @__PURE__ */ new Map,argLevelConstraints:/* @__PURE__ */ new Map,records:[]};i&&i.definitions.push(D);let te=e=>{for(let t=s.contexts.length-1;t>=0;t--){let n=Eo(s.contexts[t],e);if(n?.kind===`Module`)return n}return p.get(e)},ne=t=>{let n=te(t);if(n===void 0)throw new e.ft(`Could not find module ${t}`);return n},O=(e,t)=>{s.contexts.push(e);let n=t();return s.contexts.pop(),n},k=(e,t,n,r)=>{let i={...G(c()),kind:`FormalParam`,name:e,arity:t,location:n};return r&&u(s,i),i},re=e=>({...G(c()),kind:`OpDef`,defKind:`UserDefined`,arity:e.params?.length??0,params:[],body:void 0,isLocal:!1,module:D,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}),ie=e=>{e.letInLevel=d.curLevel,d.unresolvedSum>0&&(e.recursiveSection=d.recursiveSectionCount,e.inRecursiveSection=d.unresolvedCount[d.curLevel]>0,D.opDefsInRecursiveSection.push(e))},A=(e,t,n,r={},i=c())=>({...G(i),kind:`OpAppl`,operator:e,operands:t,unbounded:r.unbounded,bounded:r.bounded,tupleOrs:r.tupleOrs,ranges:r.ranges??[],location:n}),j=()=>({...A(M(`$Nop`),[],so,{},l.id),isNull:!0}),M=t=>{let n=f.get(t);if(!n)throw new e.pt(`SANY has no builtin operator ${t}`);return n},N=(e,t,n,r={})=>A(M(e),t,n,r),ae=(e,t)=>({...G(c()),kind:`String`,value:e,location:t}),oe=(e,t)=>({...G(c()),kind:`OpArg`,op:e,location:t}),se=(t,n)=>{let r=ds(s,os(t));if(r===void 0||r.kind===`Module`)throw new e.ft(`Unknown operator: \`${t}' at line ${n.beginLine}, column ${n.beginColumn} of module ${n.file}`);return r},P=(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`&&wo(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.`)},F=Bo({version:r.version,resolveSymbol:e=>ds(s,e),resolveSynonym:os,generateExpression:e=>R(e),generateArgument:(e,t,n,r)=>ge(e,t,n,r),createOpAppl:(e,t,n)=>{let r=A(e,t,n);return P(e,t,n),r},createOpArg:oe,createFormalParam:(e,t,n)=>k(e,t,n,!1),createLambda:(e,t,r)=>re({name:`LAMBDA`,params:e,body:t,location:r,preComments:ns(n,Go(n,{line:r.beginLine,column:r.beginColumn}))}),copySubstIn:(e,t)=>Be(`SubstIn`,e.substs,t,e.instantiatedModule,e.location,e.instantiatingModule),getBuiltin:M,addError:(e,t)=>(a(e,t),j()),isOutOfLabelScope:e=>{let t=C.get(e);return t!==void 0&&t.scope.isDeclaredBefore[t.clause]&&t.scope.isSuffices===t.scope.isInProof},isOutOfClauseScope:(e,t)=>{let n=S.get(e);return n!==void 0&&n.isDeclaredBefore[t-1]&&(!n.hasGoal||n.isSuffices===n.isInProof)}}),I=(e,t)=>{let r={value:t.start};return e.map(e=>{let i=e.op===`Name`?e.name:e.op===`Null`?`(`:String(e.op),a=is(n,r.value,t.end,i);if(a===-1)return e;if(e.op===`Null`){let t=qo(n,a);return r.value=t+1,{...e,location:J(n,{start:a,end:t})}}r.value=a+1;let o=Zo(n,a);if(e.args===void 0||!K(n,a+1,`(`))return{...e,location:o};let s=qo(n,a+1);return r.value=s+1,{...e,location:o,argsLocation:J(n,{start:a+1,end:s})}})},ce=(t,r,i,a)=>{let o=Mo(t);if(o===void 0)throw new e.ft(`Expected a name, found ${t.kind}`);return F(I(o,q(n,t)),r,i,a,T(t))},le=t=>{let n=ce(t,0,!1,!1);if(n.kind!==`OpAppl`)throw new e.ft(`Expected an expression`);return n},ue=e=>{if(e.kind!==`OpAppl`)return;let t=m.find(t=>t.name===e.operator.name);t&&(t.node.operator=M(`$RecursiveFcnSpec`))},de=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},[]),fe=(e,t)=>ke(e,t,de(e).map(e=>R(e[0].set))),pe=(e,t)=>{let n=_.at(-1);n?.params.push(e);let r=R(t);return n?.params.pop(),r},L=e=>{let t=q(n,e),r=rs(n,t.start,t.end,e.params);return O(xo(),()=>{let i=e.params.map((e,t)=>k(e,0,Zo(n,r[t]),!0)),a=pe(i,e.body);return re({name:`LAMBDA`,params:i,body:a,location:J(n,t),preComments:ns(n,t.start)})})},me=e=>e.kind===`OperatorReference`?e.operator:e.kind===`Lambda`&&e.body.kind===`Apply`?e.body.operator:n.tokens[Go(n,e.location)].text,he=(t,n)=>{let r=T(t);if(t.kind===`Lambda`)return t.location.range===void 0?oe(se(me(t),r),r):oe(L(t),r);if(!xs(t))return a(r,`Arity ${n.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${n.name}'.`),j();if(t.kind===`OperatorReference`)return oe(se(t.operator,r),r);let i=ce(t,n.arity,!1,!1);if(i.kind===`OpArg`||i.kind===`OpAppl`&&i.isNull===!0)return i;throw new e.ft(`Expected an operator argument at line ${r.beginLine}, column ${r.beginColumn}`)},ge=(t,r,i,o)=>{let c=t.kind===`OpDef`&&(t.defKind===`UserDefined`||t.defKind===`ModuleInstance`)?t.params?.[r]?.arity??0:0;if(c===0)return R(i);let l=q(n,i),u=J(n,l),d=`${r+1} (counting from 1)`,f=Xo(n,l);if(f!==l||!xs(i))return a(J(n,f),`An expression appears as argument number ${d} to operator '${t.name}', in a position an operator is required.`),j();if(i.kind===`Identifier`||i.kind===`Subexpression`||i.kind===`Apply`){let t=ce(i,c,!1,!1);if(t.kind===`OpArg`||t.kind===`OpAppl`)return t;throw new e.ft(`Expected an operator argument at ${uo(u)}`)}if(i.kind===`Lambda`&&i.location.range!==void 0){let e=L(i),n=wo(e);return n===c?oe(e,u):(a(o,`Lambda expression with arity ${n} used as argument ${r+1} of operator \`${t.name}', \nbut an operator of arity ${c} is required.`),j())}let p=me(i),m=ds(s,os(p));if(m===void 0)return a(u,`Could not find declaration or definition of symbol '${p}'.`),j();let h=wo(m);return h===c?oe(m,u):(a(o,`Operator with incorrect arity passed as argument. \nOperator '${m.name}' of arity ${h} is argument number ${d} to operator \`${uo(t.location)}', \nbut an operator of arity ${c} was expected.`),j())},_e=e=>{let t=T(e);if(e.isBulleted)return N(e.kind===`And`?`$ConjList`:`$DisjList`,e.operands.map(R),t);let r=q(n,e),i=e.kind===`And`?`\\land`:`\\lor`,[a,...o]=e.operands;return o.reduce((e,t,a)=>{let s=Yo(n,q(n,t)),c=a===o.length-1?r.end:s.end;return N(i,[e,R(t)],J(n,{start:r.start,end:c}))},R(a))},ve=e=>{let t=q(n,e),r=e.arms.map((r,i)=>{let a=Yo(n,q(n,r.condition)),o=i===e.arms.length-1&&e.other===void 0,s=Yo(n,q(n,r.body)),c=[R(r.condition),R(r.body)];return N(`$Pair`,c,J(n,{start:a.start,end:o?t.end:s.end}))}),i=e.other;if(i){let e=Yo(n,q(n,i)),a=ye(e.start,`OTHER`);r.push(N(`$Pair`,[void 0,R(i)],J(n,{start:a,end:t.end})))}return N(`$Case`,r,J(n,t))},ye=(e,t)=>{for(let r=e;r>=0;r--)if(K(n,r,t))return r;return e},be=e=>{let t=q(n,e),r=J(n,t),i=[R(e.function)],a=N(`$Except`,i,r),o=q(n,e.function),s={value:is(n,o.end+1,t.end,`EXCEPT`)+1};return e.updates.forEach(e=>{let r=is(n,s.value,t.end,`!`),o=Yo(n,q(n,e.value)),c=J(n,{start:r,end:o.end}),l={value:r+1},u=e.path.map(e=>{if(e.kind===`Field`){let t=xe(l.value,e.name);return l.value=t+1,ae(e.name,Zo(n,t))}let r=is(n,l.value,t.end,`[`),i=qo(n,r);return l.value=i+1,e.args.length===1?R(e.args[0]):N(`$Tuple`,e.args.map(R),J(n,{start:r,end:i}))}),d=N(`$Seq`,u,c),f=N(`$Pair`,[d],c);g.push(f),h.push(a),f.operands.push(R(e.value)),g.pop(),h.pop(),i.push(f),s.value=o.end+1}),a},xe=(e,t)=>{for(let r=e;r<n.tokens.length;r++)if(n.tokens[r].text===t&&n.tokens[r].kind!==`String`)return r;return e},Se=(e,t)=>{let r=q(n,t),i={value:r.start+1},o=t.fields.map((e,r)=>{let o=xe(i.value,e.name),s=Yo(n,q(n,e.value));return i.value=s.end+1,t.fields.slice(0,r).some(t=>t.name===e.name)&&a(Zo(n,o),`Non-unique fields in constructor.`),N(`$Pair`,[ae(e.name,Zo(n,o)),R(e.value)],J(n,{start:o,end:s.end}))}),s=N(e,o,J(n,r));return D.records.push(s),s},Ce=e=>({line:n.tokens[e].line,column:n.tokens[e].column}),we=e=>{let t=[],r=e;for(;n.tokens[r]?.kind===`Identifier`;){let e=K(n,r+1,`(`)?qo(n,r+1):r,i=n.tokens.slice(r+1,e).filter(e=>e.text===`_`).length;if(t.push({name:n.tokens[r].text,arity:i,location:{...Ce(r),range:{module:n.name,start:Ce(r),end:Ce(e)}}}),!K(n,e+1,`,`))break;r=e+2}return t},Te=e=>{let t=[...e.definitions.map(e=>({unit:{kind:`Definition`,definition:e},span:Me(e)})),...(e.instances??[]).map(e=>({unit:{kind:`Instance`,instance:e},span:Me(e)}))],r=q(n,e).start,i=Yo(n,q(n,e.body)).start,a=[];for(let e=r+1;e<i;e++){let r=t.some(t=>t.span.start<=e&&e<=t.span.end);K(n,e,`RECURSIVE`)&&!r&&a.push({unit:{kind:`Recursive`,declarations:we(e+1)},span:{start:e,end:e}})}return[...t,...a].toSorted((e,t)=>e.span.start-t.span.start).map(e=>e.unit)},Ee=e=>{let t=xo();return O(t,()=>{d.curLevel++,d.unresolvedCount[d.curLevel]=0;let n=[],r=[];Te(e).forEach(e=>{e.kind===`Recursive`?Le(e.declarations):e.kind===`Instance`?Ve(e.instance,n,r):e.definition.kind===`Function`?Fe(e.definition,n):Ne(e.definition,n)}),Re(),d.curLevel=Math.max(d.curLevel-1,0);let i=R(e.body);return{...G(c()),kind:`LetIn`,opDefs:n,instances:r,body:i,context:t,location:T(e)}})},De=e=>{let t=q(n,e),r=J(n,t);return O(xo(),()=>{let i=e.pattern,a=i.kind===`Name`?[i.name]:i.names;if(e.set===void 0){let o=rs(n,t.start,t.end,a),s=a.map((e,r)=>k(e,0,Zo(n,i.kind===`Name`?t.start:o[r]),!0)),c=pe(s,e.body);return N(`$UnboundedChoose`,[c],r,{unbounded:s})}let o=R(e.set),s=q(n,e.set),c=rs(n,t.start,s.start,a),l=a.map((e,t)=>k(e,0,Zo(n,c[t]),!0)),u=pe(l,e.body);return N(`$BoundedChoose`,[u],r,{bounded:[l],tupleOrs:[i.kind===`Tuple`],ranges:[o]})})},Oe=e=>{if(cs(e.operator)||ls(e.operator)||e.args.length>2||ds(s,os(e.operator))!==void 0)return;let t=q(n,e);if(n.tokens[t.start].text===e.operator&&K(n,t.start+1,`(`))return;let r=Yo(n,q(n,e.args[0])),i=e.args.length===1&&r.start!==t.start,a=i?t.start:r.end+1,o=$o(n,a);return{index:a,name:i&&o===`-`?`-.`:o,fixity:i?`prefix`:e.args.length===2?`infix`:`postfix`}},R=e=>{let t=T(e);switch(e.kind){case`Number`:return{...G(c()),kind:`Numeral`,value:Ds(e.text??String(e.value)),location:t};case`Decimal`:{let[n,r]=e.text.split(`.`),i=BigInt(n+r),a=i<=9223372036854775807n;return{...G(c()),kind:`Decimal`,mantissa:i.toString(),exponent:String(a?-r.length:r.length),integralPart:n,fractionalPart:r,location:t}}case`String`:return ae(e.value,t);case`Identifier`:{let t=le(e);return ue(t),t}case`Apply`:{let r=Oe(e);if(r!==void 0)return a(Zo(n,r.index),`Could not find declaration or definition of symbol '${r.name}'.`),a(t,`Couldn't resolve ${r.fixity} operator symbol \`${r.name}'.`),{...j(),isAbsent:!0};let i=le(e);return(ls(e.operator)||cs(e.operator))&&ue(i),i}case`Bracket`:return a(Zo(n,q(n,e).start),"Unsupported expression type `['."),{...j(),isAbsent:!0};case`OperatorReference`:case`Lambda`:{let r=n.tokens[q(n,e).start].text;return a(t,r===`LAMBDA`?`LAMBDA expression used where an expression is required.`:`Unsupported expression type \`${Ts(e,r)}'.`),{...j(),isAbsent:!0}}case`And`:case`Or`:return _e(e);case`Prime`:return N(`'`,[R(e.expression)],t);case`Unchanged`:return N(`UNCHANGED`,[R(e.expression)],t);case`Enabled`:return N(`ENABLED`,[R(e.expression)],t);case`Always`:return N(`[]`,[R(e.expression)],t);case`Eventually`:return N(`<>`,[R(e.expression)],t);case`If`:return N(`$IfThenElse`,[R(e.condition),R(e.consequent),R(e.alternative)],t);case`Case`:return ve(e);case`Let`:return Ee(e);case`Forall`:case`Exists`:{let r=q(n,e);return O(xo(),()=>{let n=fe(e.bounds,r.start),i=pe(n.bounded.flat(),e.body);return N(e.kind===`Forall`?`$BoundedForall`:`$BoundedExists`,[i],t,n)})}case`UnboundedQuantifier`:{let r=q(n,e),i=q(n,e.body),a=rs(n,r.start,i.start,e.names),o=e.isTemporal?e.quantifier===`Forall`?`$TemporalForall`:`$TemporalExists`:e.quantifier===`Forall`?`$UnboundedForall`:`$UnboundedExists`;return O(xo(),()=>{let r=e.names.map((e,t)=>k(e,0,Zo(n,a[t]),!0)),i=pe(r,e.body);return N(o,[i],t,{unbounded:r})})}case`Choose`:return De(e);case`SetEnumeration`:return N(`$SetEnumerate`,e.elements.map(R),t);case`Tuple`:return N(`$Tuple`,e.elements.map(R),t);case`SetFilter`:{let r=R(e.bound.set),i=q(n,e);return O(xo(),()=>{let n=ke([e.bound],i.start,[r]),a=pe(n.bounded.flat(),e.predicate);return N(`$SubsetOf`,[a],t,n)})}case`SetMap`:{let r=q(n,e.expression);return O(xo(),()=>{let n=fe(e.bounds,r.end+1),i=pe(n.bounded.flat(),e.expression);return N(`$SetOfAll`,[i],t,n)})}case`FunctionConstruction`:{let r=q(n,e);return O(xo(),()=>{let n=fe(e.bounds,r.start),i=pe(n.bounded.flat(),e.body);return N(`$FcnConstructor`,[i],t,n)})}case`FunctionSet`:return N(`$SetOfFcns`,[R(e.domain),R(e.range)],t);case`Record`:return Se(`$RcdConstructor`,e);case`RecordSet`:return Se(`$SetOfRcds`,e);case`Except`:return be(e);case`ExceptAt`:{let e=h[h.length-1],n=g[g.length-1];return e===void 0||n===void 0?(a(t,`@ used where its meaning is not defined.`),j()):{...G(c()),kind:`At`,except:e,component:n,location:n.location}}case`FunctionApplication`:{let n=R(e.function);if(fo(n))return n;ue(n);let r=e.args.length===1?R(e.args[0]):N(`$Tuple`,e.args.map(R),t);return N(`$FcnApply`,[n,r],t)}case`FieldAccess`:{let r=R(e.record),i=q(n,e);return N(`$RcdSelect`,[r,ae(e.field,Zo(n,i.end))],t)}case`Product`:return N(`$CartesianProd`,e.factors.map(R),t);case`BoxAction`:case`AngleAction`:return N(e.kind===`BoxAction`?`$SquareAct`:`$AngleAct`,[R(e.action),R(e.subscript)],t);case`WeakFairness`:case`StrongFairness`:return N(e.kind===`WeakFairness`?`$WF`:`$SF`,[R(e.subscript),R(e.action)],t);case`Label`:return Ae(e);case`Subexpression`:return le(e)}},ke=(e,t,r)=>{let i=de(e),a={value:t};return{bounded:i.map(e=>{let t=q(n,e[0].set),r=e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),i=rs(n,a.value,t.start,r);return a.value=t.end+1,r.map((e,t)=>k(e,0,Zo(n,i[t]),!0))}),tupleOrs:i.map(e=>e[0].pattern.kind===`Tuple`),ranges:r}},Ae=e=>{let t=T(e),r=_.at(-1);if(r===void 0)return a(t,`Label not in definition or proof step.`),j();if(x.isDeclared.slice(2,x.depth+1).some(Boolean))return a(t,`Label not allowed within scope of declaration in nested ASSUME/PROVE.`),j();if(h.length>0&&g.length>0)return a(t,`Labels inside EXCEPT clauses are not yet implemented.`),j();y();let i=R(e.body),o=b(),l=rs(n,q(n,e).start,q(n,e.body).start,e.params),u=e.params.map((t,r)=>{let i=ds(s,t);if(i?.kind===`FormalParam`)return i;let o=Zo(n,l[r]);return a(o,`Illegal parameter ${t} of label \`${e.name}'.`),k(t,0,o,!1)}),d={...G(c()),kind:`Label`,name:e.name,params:u,body:i,labels:o,isAssumeProve:!1,location:t},f=/* @__PURE__ */ new Set;if(u.forEach(e=>{f.has(e)&&a(t,`Repeated formal parameter ${e.name} \nin label \`${d.name}'.`),f.add(e)}),r.params.flat().forEach(e=>{f.delete(e)||a(t,`Label ${d.name} must contain formal parameter \`${e.name}'.`)}),f.size>0){let e=[...f].map(e=>`${e.name} `).join(``);a(t,`Label ${d.name} declares extra parameter(s) ${e}`)}r.labels.has(d.name)?a(t,`Duplicate label \`${d.name}'.`):r.labels.set(d.name,d);let p=x.goal;return p&&C.set(d,{scope:p,clause:x.goalClause}),d},je=(e,t,r)=>{let i={value:t.start};return e.params.map(e=>{let t=e.location?Go(n,e.location):xe(i.value,e.name),a=ut(t,e.arity);return i.value=a.end+1,k(os(e.name),e.arity,J(n,a),r)})},Me=e=>{let t=E(e.location);return e.isLocal&&!K(n,t.start,`LOCAL`)&&K(n,t.start-1,`LOCAL`)?{start:t.start-1,end:t.end}:t},Ne=(e,t)=>{let r=Me(e),i=J(n,r),o=os(e.name),c={start:e.isLocal?r.start+1:r.start,end:r.end},l=O(xo(),()=>{let t=je(e,c,!0),n=ds(s,o);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===d.curLevel?e||a(i,`Definition of ${n.name} has different arity than its RECURSIVE declaration.`):a(i,`Recursive operator ${o} defined at wrong LET/IN level.`)}else n!==void 0&&a(i,`Operator ${o} already defined or declared.`);return y(),{params:t,body:R(e.body),existing:n}}),f=b(),p=l.existing,m=l.params,h=ns(n,r.start);if(p?.kind===`OpDef`&&p.inRecursive&&!p.isDefined&&p.letInLevel===d.curLevel){p.params=m,p.weights=m.map(()=>0),p.maxLevels=m.map(()=>3),p.isLeibnizArg=m.map(()=>!0),p.labels=f,Pe(p,l.body,i,h),D.definitions.push(p),t?.push(p);return}let g=re({name:o,params:m,body:l.body,isLocal:e.isLocal,location:i,preComments:h,labels:f});u(s,g),ie(g),D.definitions.push(g),t?.push(g)},Pe=(e,t,n,r)=>{e.isDefined=!0,e.body=t,e.location=n,e.preComments=r,e.inRecursive&&(d.unresolvedCount[d.curLevel]--,d.unresolvedSum--)},Fe=(e,t)=>{let r=Me(e),i=J(n,r),o=xo(),c=e.isLocal?r.start+1:r.start,l=O(o,()=>fe(e.bounds,c+1)),f=ds(s,e.name),p=O(o,()=>k(e.name,0,i,f===void 0)),h=N(`$NonRecursiveFcnSpec`,[],i,{unbounded:[p],...l}),g=f?.kind===`OpDef`&&f.inRecursive&&!f.isDefined,_=g&&f.letInLevel===d.curLevel;_?f.arity!==0&&a(i,`Function ${f.name} has operator arguments in its RECURSIVE declaration.`):g?a(i,`Recursive function ${e.name} defined at wrong LET/IN level.`):f!==void 0&&a(i,`Function name \`${e.name}' already defined or declared.`);let v=ns(n,r.start),x=f===void 0?re({name:e.name,params:[],body:h,isLocal:e.isLocal,location:i,preComments:v}):f.kind===`OpDef`&&(_||!g)?f:void 0;_?f.arity===0&&Pe(f,h,i,v):f===void 0&&x!==void 0&&(u(s,x),ie(x)),x!==void 0&&(D.definitions.push(x),t?.push(x)),m.unshift({name:e.name,node:h}),y();let S=()=>pe(l.bounded.flat(),e.body),C=x===void 0?S():O(o,S),w=b();x!==void 0&&(x.labels=w),m.shift(),h.operands=[C],h.operator.name===`$NonRecursiveFcnSpec`&&(h.unbounded=void 0)},Ie=[],Le=e=>{d.unresolvedSum===0&&d.recursiveSectionCount++,d.unresolvedCount[d.curLevel]+=e.length,d.unresolvedSum+=e.length,e.forEach(e=>{let t=dt(e);c();let r=Array.from({length:e.arity},()=>k(``,0,void 0,!1)),i=re({name:os(e.name),params:r,location:J(n,t),isDefined:!1,inRecursive:!0,inRecursiveSection:!0,recursiveSection:d.recursiveSectionCount,letInLevel:d.curLevel});u(s,i),Ie.push(i),D.opDefsInRecursiveSection.push(i)})},Re=()=>{d.unresolvedCount[d.curLevel]!==0&&(Ie.filter(e=>e.letInLevel===d.curLevel&&!e.isDefined).forEach(e=>a(e.location,`Symbol ${e.name} declared in RECURSIVE statement but not defined.`)),d.unresolvedSum-=d.unresolvedCount[d.curLevel])},ze=(e,t,i)=>{c();let o=yo(t.table).filter(e=>e.kind===`OpDecl`),l=o.flatMap(e=>{let t=ds(s,e.name);return t===void 0?[]:[{op:e,expr:e.declKind===3||e.declKind===2&&e.arity===0?A(t,[],i):oe(t,i),isImplicit:!0}]}),u=(e,t)=>{let n=t.kind===`OpArg`?wo(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=Me(e),f={value:is(n,d.start,d.end,`WITH`)+1};return e.substitutions.forEach(e=>{let r=is(n,f.value,d.end,e.name);r!==-1&&(f.value=q(n,e.expression).end+1);let o=To(t,os(e.name));if(o?.kind!==`OpDecl`){a(r===-1?i:Zo(n,r),`Identifier '${r===-1?e.name:$o(n,r)}' 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=o.arity===0?R(e.expression):he(e.expression,o);u(o,s);let c=l.find(e=>e.op.name===o.name);c&&!c.isImplicit?a(T(e.expression),`Multiple substitutions for symbol '${o.name}' in substitution.`):c?(c.expr=s,c.isImplicit=!1):l.push({op:o,expr:s,isImplicit:!1})}),l.filter(e=>e.isImplicit&&r.version!==`1.7.4`).forEach(e=>u(e.op,e.expr)),o.filter(e=>!l.some(t=>t.op.name===e.name)).forEach(e=>a(i,`Substitution missing for symbol ${e.name} declared at ${uo(e.location)} \nand instantiated in module ${D.name}.`)),l},Be=(e,t,n,r,i,o=D)=>(fo(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.`),{...G(c()),kind:e,substs:t,body:n,instantiatingModule:o,instantiatedModule:r,location:i}),Ve=(e,t,i)=>{let a=Me(e),o=J(n,a),l=ns(n,a.start),d=e.name??``,f=xo(),p=e.isLocal?a.start+1:a.start;e.params.length>0&&s.contexts.push(f);let m=je(e,{start:p,end:a.end},e.params.length>0),h=ne(e.module),g=h.context,_=ze(e,g,o);e.params.length>0&&s.contexts.pop(),yo(g.table).forEach(n=>{if(n.kind!==`OpDef`||n.isLocal||n.defKind!==`UserDefined`&&n.defKind!==`ModuleInstance`)return;let r=[...m,...n.params??[]],i=`${d}!${n.name}`,a=n.defKind===`UserDefined`?re({name:i,params:r,body:_.length>0&&n.body?Be(`SubstIn`,_,n.body,h,o):n.body,isLocal:e.isLocal,location:o,source:n.source??n,preComments:l,labels:n.labels}):re({defKind:`ModuleInstance`,name:i,params:r,isLocal:e.isLocal,location:o,module:n.module,source:n.source??n,preComments:l});u(s,a),n.defKind===`UserDefined`&&ie(a),(t??D.definitions).push(a)}),yo(g.table).forEach(n=>{if(n.kind!==`ThmOrAssumpDef`||n.isLocal)return;let r=_.length>0?Be(`APSubstIn`,_,n.body,h,o):n.body,i={...G(c()),kind:`ThmOrAssumpDef`,name:`${d}!${n.name}`,isTheorem:n.isTheorem,body:r,params:[...m,...n.params],isLocal:e.isLocal,location:o,module:D,source:n.source??n,labels:n.labels,isLeibnizArg:[],isLeibniz:!1,opLevelCond:[],maxLevels:[],minMaxLevel:[]};u(s,i),(t??D.definitions).push(i)});let v={...G(c()),kind:`Instance`,name:d,isLocal:e.isLocal,params:m,module:h,substs:_,location:o};(i??D.topLevel).push(v);let y=re({defKind:`ModuleInstance`,name:d,params:m,isLocal:e.isLocal,location:o,preComments:l});u(s,y),r.version!==`1.7.4`&&t?.push(y)},He=(e,t=!0,r)=>{let i=Me(e),a=r??J(n,i),o=ns(n,i.start),l=ne(e.module),d=l.context,f=ze(e,d,a),p=e.isLocal,m=hs(l);yo(d.table).forEach(e=>{if(e.kind!==`OpDef`||e.defKind!==`UserDefined`||e.isLocal)return;let t=(t,n)=>{let r=re({name:e.name,params:e.params,body:n,isLocal:p,location:a,module:t,source:e.source??e,preComments:o,labels:e.labels});return u(s,r),r},n=()=>(u(s,e),e),r=e.module===void 0||hs(e.module),i=m||r?p?t(e.module,e.body):n():t(D,e.body&&Be(`SubstIn`,f,e.body,l,a));D.definitions.push(i),ie(i)}),yo(d.table).forEach(e=>{if(e.kind!==`ThmOrAssumpDef`||e.isLocal)return;let n=(t,n)=>{let r={...e,...G(c()),body:n,isLocal:p,location:a,module:t,source:e.source??e};return u(s,r),r},r=m?p?n(e.module,e.body):(u(s,e),e):hs(e.module)?p?n(D,e.body):e:n(D,Be(`APSubstIn`,f,e.body,l,a));t&&D.definitions.push(r)});let h={...G(c()),kind:`Instance`,name:void 0,isLocal:p,params:[],module:l,substs:f,location:a};return t&&D.topLevel.push(h),h},Ue=e=>{let t=te(e.name)??(e.name===D.name?D:void 0);return t===void 0?(a(Zo(n,Go(n,e.location)+1),`Module \`${e.name}' used without being extended or instantiated.`),[]):[t]},We=t=>t.flatMap(t=>{if(t.kind===`ModuleFact`)return Ue(t);let n=Mo(t);if(n===void 0||!No(n))return[R(t)];let r=ce(t,0,!0,!1);if(r.kind===`ThmOrAssumpDef`)throw new e.ft(`Expected a fact`);return[r]}),Ge=e=>K(n,e.start,`(`)&&qo(n,e.start)===e.end,Ke=e=>Yo(n,q(n,e)),qe=(e,t)=>Ke(e.args[0]).start===t.start?e.args.length===2?`N_InfixExpr`:`N_PostfixExpr`:n.tokens[t.start].kind===`Identifier`?`N_OpApplication`:`N_PrefixExpr`,Je=(e,t)=>Ge(t)?`N_ParenExpr`:e.kind===`String`?$o(n,t.start):e.kind===`Apply`?qe(e,t):Ss.get(e.kind),Ye=(e,t)=>{if(e.kind===`String`&&!Ge(t))return!1;if(e.kind===`Identifier`&&!e.name.includes(`!`))return!0;let n=Je(e,t);return n===void 0||Cs.has(n)?void 0:!0},Xe=(e,t)=>{let r=(e,t=Ke(e))=>({last:t,lastKind:Je(e,t)});if(Ge(t))return{hasChildlessFirstChild:!1,...r(e,{start:t.start+1,end:t.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:t.end,end:t.end},lastKind:n.tokens[t.end].text}:{hasChildlessFirstChild:!1,...r(i)}}case`Always`:case`Eventually`:case`Enabled`:case`Unchanged`:return{hasChildlessFirstChild:!0,...r(e.expression,{start:t.start+1,end:t.end})};case`Prime`:return{hasChildlessFirstChild:Ye(e.expression,Ke(e.expression)),last:{start:t.end,end:t.end},lastKind:`N_GenPostfixOp`};case`FunctionApplication`:case`FieldAccess`:{let t=e.kind===`FunctionApplication`?e.function:e.record,r=Ke(t),i=r.end+1;return{hasChildlessFirstChild:Ye(t,r),last:{start:i,end:i},lastKind:n.tokens[i].text}}case`Apply`:{let n=qe(e,t);if(n===`N_OpApplication`)return e.operator.includes(`!`)?void 0:{hasChildlessFirstChild:!0,last:{start:t.start+1,end:t.end},lastKind:`N_OpArgs`};if(n===`N_PrefixExpr`)return{hasChildlessFirstChild:!0,...r(e.args[0],{start:t.start+1,end:t.end})};let i=Ke(e.args[0]),a=i.end+1;return{hasChildlessFirstChild:Ye(e.args[0],i),last:{start:a,end:a},lastKind:n===`N_InfixExpr`?`N_GenInfixOp`:`N_GenPostfixOp`}}}},Ze=e=>{let t=Yo(n,q(n,e));if((e.kind===`Identifier`||e.kind===`Subexpression`||e.kind===`OperatorReference`)&&!Ge(t))return!1;let r=Xe(e,t);if(r?.hasChildlessFirstChild===void 0||r.lastKind===void 0)return!1;let i=J(n,r.last);return r.hasChildlessFirstChild&&a(J(n,t),`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(n,t),`DEF clause entry should describe a defined operator.`),!0},Qe=e=>e.flatMap(e=>{if(e.kind===`ModuleFact`)return Ue(e);if(Ze(e))return[];let t=ce(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(T(e),`DEF clause entry should describe a defined operator.`),[])}),$e=(e,t)=>{e.isOnly||e.facts.length+e.defs.length>0||a(t,`Empty BY, USE, or HIDE`)},et=e=>{let t=J(n,E(e.location));$e(e,t);let r=We(e.facts),i=Qe(e.defs);return r.length+i.length===0&&a(t,`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.`)),{...G(c()),kind:`UseOrHide`,facts:r,defs:i,isOnly:e.isOnly,isHide:e.kind===`Hide`,location:t}},tt=e=>{let t=E(e.location),r=e.set&&R(e.set),i=xe(t.start,e.name),a=ss[e.level],o={...G(c()),levelChecked:1,level:a.level,kind:`OpDecl`,name:os(e.name),arity:e.arity,declKind:a.declKind,location:J(n,ut(i,e.arity)),module:D};return u(s,o),{...G(c()),kind:`NewSymb`,declaration:o,set:r,location:J(n,t)}},nt=(e,t,r)=>{let i=E(e.location),o=es(n,i.start-1),l=q(n,e.conclusion).start,u=n.tokens.findLastIndex((e,t)=>t<l&&e.kind===`Keyword`&&e.text===`PROVE`),d=J(n,{start:o?i.start-1:i.start,end:i.start});o!==es(n,u-1)&&a(d,o?`[]ASSUME matched by PROVE instead of []PROVE`:`ASSUME matched by []PROVE instead of PROVE`);let f=c();t>1&&s.contexts.push(xo()),o&&s.contexts.some(e=>v.has(e))&&a(d,`[]ASSUME used within the scope of an ordinary ASSUME's assumptions`),o||v.add(us(s));let p={isDeclaredBefore:[!1],hasGoal:r!==void 0,isSuffices:r?.isSuffices??!1,isInProof:!0};x.depth=t,x.isDeclared[t]=!1,t===1&&(x.goal=r&&p,x.goalClause=0);let m=e.assumptions.map((e,n)=>{let r=e.kind===`NewSymbol`,i=e.kind===`AssumeProve`?nt(e,t+1):r?tt(e):R(e);return x.depth=t,r&&(x.isDeclared[t]=!0),p.isDeclaredBefore.push(p.isDeclaredBefore[n]||r),t===1&&x.goalClause++,i}),h=R(e.conclusion);t>1&&s.contexts.pop(),x.depth=t-1,t===1&&(x.goal=void 0);let g={...G(f),kind:`AssumeProve`,assumptions:m,goal:h,isSuffices:p.isSuffices,isBoxed:o,location:J(n,{start:o?i.start-1:i.start,end:i.end})};return S.set(g,p),g},rt=(e,t,n,r,i,a=!0)=>({...G(e),kind:`ThmOrAssumpDef`,name:t,isTheorem:a,body:n,params:[],isLocal:!1,location:r,module:D,source:void 0,labels:i,isLeibnizArg:[],isLeibniz:!1,opLevelCond:[],maxLevels:[],minMaxLevel:[]}),it=e=>{let t=J(n,E(e.location));e.kind===`By`&&$e(e,t);let r=e.kind===`By`?We(e.facts):[],i=e.kind===`By`?Qe(e.defs):[];return e.kind===`By`&&c(),e.kind===`By`&&r.length+i.length===0&&a(t,`Empty BY`),{...G(c()),kind:`LeafProof`,facts:r,defs:i,isOmitted:e.kind===`Omitted`,isOnly:e.kind===`By`&&e.isOnly,location:t}},at=(e,t)=>{let r=e.body,i=J(n,t);switch(r.kind){case`Have`:return{node:N(`$Have`,[R(r.expression)],i),isPick:!1};case`Case`:return{node:N(`$Pfcase`,[R(r.expression)],i),isPick:!1};case`Witness`:return{node:N(`$Witness`,r.expressions.map(R),i),isPick:!1};case`Qed`:return{node:N(`$Qed`,[],i),isPick:!1};case`Take`:case`Pick`:{let e=r.kind===`Pick`,a=e?`$Pick`:`$Take`;e&&s.contexts.push(xo());let o=e=>r.kind===`Pick`?[pe(e,r.body)]:[];if(r.bounds.length>0){let n=fe(r.bounds,t.start),s=o(n.bounded.flat());return{node:N(a,s,i,n),isPick:e}}let c=rs(n,t.start,t.end+1,r.names),l=r.names.map((e,t)=>k(e,0,Zo(n,c[t]),!0)),u=o(l);return{node:N(a,u,i,{unbounded:l}),isPick:e}}}},ot=e=>{if((e.kind===`And`||e.kind===`Or`)&&!e.isBulleted)return!0;if(e.kind!==`Apply`||e.args.length!==2)return!1;let t=Yo(n,q(n,e.args[0])),r=q(n,e).start;return t.start===r&&!K(n,t.end+1,`(`)},st=t=>{if(t.kind!==`Steps`)return it(t);let r=xo();s.contexts.push(r);let i=[],a=[],o={previousRight:void 0},l=(t,r,a)=>{if(t.kind===`Define`){let r=t.definitions.map(t=>{let n=[];t.kind===`Instance`?Ve(t,n,i):t.kind===`Function`?Fe(t,n):Ne(t,n);let r=n[t.kind===`Instance`?n.length-1:0];if(r?.kind!==`OpDef`)throw new e.ft(`A DEFINE step defines no operator`);return r});return{...G(c()),kind:`DefStep`,defs:r,location:J(n,a)}}if(t.kind===`Use`||t.kind===`Hide`)return{...et(t),location:J(n,r)};if(t.kind===`Instance`)return He(t,!1,J(n,a))},d=t.steps.map(t=>{let r=E(t.location),i=Jo(n,t.head),d={start:i.start+1,end:i.end},f=t.body;t.name!==void 0&&y();let p=t.name===void 0?void 0:c();f.kind!==`Assert`&&(o.previousRight=void 0);let m=l(f,r,d);if(m!==void 0)return t.name!==void 0&&u(s,re({defKind:`NumberedProofStep`,name:t.name,location:J(n,r),labels:b(),step:m})),m;let h=f.kind===`Assert`&&f.statement.kind===`AssumeProve`;h&&(o.previousRight=void 0);let g=f.kind===`Assert`&&f.isSuffices,_=xo(),v=f.kind===`Assert`?{node:(e=>{if(e.kind===`AssumeProve`){let n=O(_,()=>nt(e,1,t.name===void 0?void 0:{isSuffices:g}));return n.isSuffices=g,n}if(g){let t=R(e);return N(`$Suffices`,[t],J(n,d))}let r=o.previousRight,i=r!==void 0&&e.kind===`Apply`&&ot(e)&&e.args[0].kind===`ExceptAt`,a=i?R(e.args[1]):void 0,s=i?A(se(e.operator,T(e)),[N(`$Nop`,[r],T(e.args[0])),a],T(e)):R(e),c=s.kind===`OpAppl`?s.operands[1]:void 0;return o.previousRight=ot(e)?c:void 0,s})(f.statement),isPick:!1}:at(t,d);if(v===void 0)throw new e.ft(`Unexpected proof step ${f.kind}`);let x=v.isPick?s.contexts.pop():void 0,S=t.name===void 0||p===void 0?void 0:rt(p,t.name,v.node,Zo(n,Go(n,t.location)),b());S&&u(s,S);let C=h&&!g;C&&s.contexts.push(_);let ee=t.proof&&st(t.proof);return C&&s.contexts.pop(),w(v.node),h&&g&&(a.push(_),s.contexts.push(_)),x?.symbols.forEach(e=>u(s,e)),{...G(c()),kind:`Theorem`,definition:S,body:v.node,proof:ee,isSuffices:g,location:J(n,r)}});return a.forEach(()=>{s.contexts.pop()?.symbols.forEach(e=>Co(r,e))}),s.contexts.pop(),{...G(c()),kind:`NonLeafProof`,steps:d,instances:i,proofLevel:t.level,location:J(n,E(t.location))}},ct=e=>{let t=J(n,E(e.location)),r=e.statement,i=xo();e.name!==void 0&&y();let a=e.name===void 0?void 0:c();r.kind===`AssumeProve`&&s.contexts.push(i);let o=r.kind===`AssumeProve`?nt(r,1,e.name===void 0?void 0:{isSuffices:!1}):R(r),l=e.name===void 0||a===void 0?void 0:rt(a,e.name,o,t,b());l&&(r.kind===`AssumeProve`&&s.contexts.pop(),u(s,l),D.definitions.push(l),r.kind===`AssumeProve`&&s.contexts.push(i));let d=e.proof&&st(e.proof);r.kind===`AssumeProve`&&s.contexts.pop(),w(o);let f={...G(c()),kind:`Theorem`,definition:l,body:o,proof:d,isSuffices:!1,location:t};D.topLevel.push(f)},lt=e=>{let t=E(e.location),r=J(n,t);e.name!==void 0&&y();let i=R(e.expression),a=e.name===void 0?void 0:rt(c(),e.name,i,r,b(),!1);a&&(u(s,a),D.definitions.push(a));let o={...G(c()),kind:`Assume`,definition:a,body:i,location:r};D.topLevel.push(o)},ut=(e,t)=>t===0?{start:e,end:e}:K(n,e,`_`)?{start:e,end:K(n,e+2,`_`)?e+2:e+1}:K(n,e+1,`(`)?{start:e,end:qo(n,e+1)}:{start:e,end:K(n,e+1,`_`)?e+1:e},dt=e=>ut(E(e.location).start,e.arity),ft=(e,t)=>{let r=dt(e);e.name===`@`&&t===3&&a(J(n,r),`Attempted to declare '@' as a variable.`);let i={...G(c()),levelChecked:1,level:+(t===3),kind:`OpDecl`,name:os(e.name),arity:e.arity,declKind:t,location:J(n,r),module:D};return t===2&&(i.levelParams.add(i),i.allParams.add(i)),u(s,i),i};t.extends.forEach(e=>{let t=ne(e);D.extendees.push(t);let n=us(s);t.context.symbols.forEach(e=>{if(e.kind!==`Module`&&e.kind!==`FormalParam`&&e.kind!==`OpDecl`&&e.isLocal)return;let t=e.kind===`Module`?Eo(n,e.name):To(n,e.name);t===void 0?Co(n,e):t!==e&&t.kind!==e.kind?a(e.location,`The ${ps(e)} of '${e.name}' conflicts with \nits ${ps(t)} at ${uo(t.location)}.`):t!==e&&!ms(t,e)&&o(e.location,`Warning: the ${ps(t)} of '${e.name}' conflicts with \nits ${ps(t)} at ${uo(t.location)}.`)}),D.topLevel.push(...t.topLevel)});let pt=(e,t)=>{d.unresolvedSum!==0&&a(J(n,E(e)),`${t} may not appear within a recursive definition section.`)};return t.units.forEach(e=>{switch(e.kind){case`Variables`:pt(e.location,`A VARIABLE declaration`),e.declarations.forEach(e=>ft(e,3));break;case`Constants`:pt(e.location,`A declaration`),e.declarations.forEach(e=>ft(e,2));break;case`Recursive`:Le(e.declarations);break;case`Definition`:e.definition.kind===`Function`?Fe(e.definition,void 0):Ne(e.definition,void 0);break;case`Instance`:e.instance.name===void 0?He(e.instance):Ve(e.instance,void 0,void 0);break;case`Assumption`:pt(e.assumption.location,`An ASSUME`),lt(e.assumption);break;case`Theorem`:pt(e.theorem.location,`A THEOREM`),ct(e.theorem);break;case`Use`:pt(e.use.location,`A USE or HIDE`),D.topLevel.push(et(e.use));break;case`Module`:{pt(e.module.location,`A MODULE `);let t={contexts:[...s.contexts,xo()]},r=ee(e.module,n,D,t),i=te(r.name);i===void 0?Co(us(s),r):i!==r&&a(r.location,`Multiply-defined module '${r.name}': this definition or declaration conflicts \nwith the one at ${uo(i.location)}.`);break}}}),Re(),D},D=_.map(e=>{r.onAnalyze?.(e),l.id=Array.from({length:4},c)[1];let t=g(e,void 0),n=xo();d.toReversed().forEach(e=>Co(n,e));let a=ee(t.module,t.file,void 0,{contexts:[n]});return p.set(e,a),r.onModule?.(a,i),a});return{root:D[D.length-1],modules:D,messages:i}},Ds=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()},Os=(e,t,n,r)=>lo(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)},ks=(e,t,n)=>`${e.id}:${t}:${n.id}`,As=(e,t,n,r)=>{e.set(ks(t,n,r),{op:t,index:n,param:r})},js=(e,t,n=()=>!0)=>{t.forEach((t,r)=>{n(t)&&e.set(r,t)})},Ms=(e,t,n)=>{e.set(t,Math.min(n,e.get(t)??3))},Ns=(e,t,n=()=>!0)=>{t.forEach((t,r)=>{n(r)&&Ms(e,r,t)})},Ps=(e,t)=>`${e.id}:${t}`,Fs=(e,t,n,r)=>{let i=Ps(t,n),a=e.get(i)?.level??0;e.set(i,{param:t,position:n,level:Math.max(r,a)})},Is=(e,t,n=()=>!0)=>{t.forEach(t=>{n(t)&&Fs(e,t.param,t.position,t.level)})},Ls=(e,t)=>{e.levelParams=t.levelParams,e.allParams=t.allParams,e.levelConstraints=t.levelConstraints,e.argLevelConstraints=t.argLevelConstraints,e.argLevelParams=t.argLevelParams},Rs=(e,t)=>{Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Ns(e.levelConstraints,t.levelConstraints),Is(e.argLevelConstraints,t.argLevelConstraints),js(e.argLevelParams,t.argLevelParams)},zs=(e,t)=>t.includes(e.op)||t.includes(e.param),Bs=e=>e.kind===`OpDecl`||e.kind===`FormalParam`,Vs=e=>e.kind!==`Module`,Hs=e=>e.kind===`OpDef`||e.kind===`ThmOrAssumpDef`,Us=(e,t)=>e.kind===`OpDef`&&e.arity<0?0:t,Ws=(e,t)=>e.kind===`OpDef`?e.weights[Us(e,t)]??0:0,Gs=(e,t)=>e.maxLevels[Us(e,t)]??3,Ks=(e,t,n)=>e.minMaxLevel?.[t]?.[n]??0,qs=(e,t)=>e.kind===`OpDef`?e.isLeibnizArg?.[Us(e,t)]??!0:e.isLeibnizArg[t]??!0,Js=(e,t,n,r)=>e.opLevelCond?.[t]?.[n]?.[r]??!1,Ys=e=>[...e.unbounded??[],...(e.bounded??[]).flat()],Xs=(e,t)=>t.find(t=>t.op===e)?.expr,Zs=(e,t,n)=>{let r=Xs(e,t);return r===void 0?/* @__PURE__ */ new Set([e]):n?r.allParams:r.levelParams},Qs=(e,t)=>{let n=/* @__PURE__ */ new Map;return e.forEach((e,r)=>{let i=Xs(e.op,t);if(i===void 0){n.set(r,e);return}if(i.kind!==`OpArg`||!Bs(i.op))return;let a=i.op;Zs(e.param,t,!1).forEach(t=>As(n,a,e.index,t))}),n},$s=(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;Zs(r,t,!1).forEach(e=>Ms(a,e,i))}),e.argLevelParams.forEach(e=>{let n=Xs(e.op,t);if(n?.kind!==`OpArg`||n.op.kind!==`OpDef`)return;X(n.op,r,i);let o=Gs(n.op,e.index);Zs(e.param,t,!1).forEach(e=>Ms(a,e,o))}),a},ec=(e,t,n,r)=>{let i=/* @__PURE__ */ new Map;return e.argLevelConstraints.forEach(e=>{let n=Xs(e.param,t);n===void 0?Fs(i,e.param,e.position,e.level):n.kind===`OpArg`&&Bs(n.op)&&Fs(i,n.op,e.position,e.level)}),e.argLevelParams.forEach(e=>{let a=Xs(e.param,t);if(a===void 0)return;let o=Xs(e.op,t),s=o===void 0?e.op:o.kind===`OpArg`?o.op:void 0;s!==void 0&&Bs(s)&&(X(a,n,r),Fs(i,s,e.index,a.level))}),i},tc=(e,t)=>Oo(e,3).length>0||(uc(e,t),Do(e).some(e=>(e.body?.level??0)!==0))?!1:e.topLevel.every(e=>e.kind!==`Theorem`||e.level===0),nc=(e,t,n)=>{e.minMaxLevel=t.map(e=>Array.from({length:e.arity},(t,r)=>n.argLevelConstraints.get(Ps(e,r))?.level??0)),e.opLevelCond=t.map(e=>t.map(t=>Array.from({length:e.arity},(r,i)=>n.argLevelParams.has(ks(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(Ps(t,n))}),js(e.argLevelParams,n.argLevelParams,e=>!t.some(t=>t===e.op)||!t.some(t=>t===e.param))},rc=(e,t,n,r,i)=>{e.operands.forEach((a,o)=>{if(a===void 0||(a.level>Gs(t,o)&&(n&&X(a,r,i)&&Os(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`||!Hs(a.op)))return;let s=a.op;X(s,r,i);let c=wo(s);for(let l=0;l<c;l++){let c=Ks(t,o,l);Gs(s,l)>=c||(n&&X(a,r,i)&&Os(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||!Js(t,o,l,u)||n.level<=Gs(s,u)||(X(a,r,i)&&X(n,r,i)&&Os(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&&Os(i,e.location,`Level error in applying operator ${t.name}:\nThe level of the range for the bounded variable ${uo(e.bounded?.[a]?.[0]?.location)} \nexceeds the maximum level allowed by the operator.`),e.levelCorrect=!1)})},ic=(e,t,n,r,i)=>{let a=t.params??[],o=t=>e.operands.find((e,n)=>a[n]===t);Ns(e.levelConstraints,t.levelConstraints),e.operands.forEach(t=>{t!==void 0&&Ns(e.levelConstraints,t.levelConstraints,e=>!n.has(e))}),e.ranges.forEach(t=>Ns(e.levelConstraints,t.levelConstraints)),e.operands.forEach((n,r)=>{let i=Gs(t,r);n?.levelParams.forEach(t=>Ms(e.levelConstraints,t,i))}),e.operands.forEach((n,a)=>{if(n?.kind!==`OpArg`||!Hs(n.op))return;let o=n.op;X(o,r,i);let s=wo(o);e.operands.forEach((n,r)=>{for(let i=0;i<s;i++){if(!Js(t,a,r,i))continue;let s=Gs(o,i);n?.levelParams.forEach(t=>Ms(e.levelConstraints,t,s)),!o.isLeibniz&&!qs(o,i)&&n&&Y(e.nonLeibnizParams,n.allParams)}})}),t.argLevelParams.forEach(t=>{let n=o(t.op);n?.kind===`OpArg`&&Hs(n.op)&&(X(n.op,r,i),Ms(e.levelConstraints,t.param,Gs(n.op,t.index)))}),Is(e.argLevelConstraints,t.argLevelConstraints),e.operands.forEach(t=>{t&&Is(e.argLevelConstraints,t.argLevelConstraints)}),e.ranges.forEach(t=>Is(e.argLevelConstraints,t.argLevelConstraints)),e.operands.forEach((n,r)=>{if(n?.kind!==`OpArg`||!Bs(n.op))return;let i=n.op;for(let n=0;n<i.arity;n++)Fs(e.argLevelConstraints,i,n,Ks(t,r,n));e.operands.forEach((n,a)=>{for(let o=0;o<i.arity;o++)n!==void 0&&Js(t,r,a,o)&&Fs(e.argLevelConstraints,i,o,n.level)})}),t.argLevelParams.forEach(t=>{let n=o(t.op);n!==void 0&&(X(n,r,i),Fs(e.argLevelConstraints,t.op,t.index,n.level))}),e.operands.forEach(t=>{t!==void 0&&js(e.argLevelParams,t.argLevelParams,e=>!n.has(e.param))}),e.ranges.forEach(t=>js(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=>As(e.argLevelParams,t.op,t.index,n)))}else a.kind===`OpArg`&&Bs(a.op)&&As(e.argLevelParams,a.op,t.index,t.param)}),e.operands.forEach((n,r)=>{if(n?.kind!==`OpArg`||!Bs(n.op))return;let i=n.op;e.operands.forEach((n,a)=>{for(let o=0;o<i.arity;o++)n!==void 0&&Js(t,r,a,o)&&n.levelParams.forEach(t=>As(e.argLevelParams,i,o,t))})})},ac=/* @__PURE__ */ new Map([[`\\land`,`\\land`],[`\\lor`,`\\lor`],[`=>`,`=>`],[`\\equiv`,`\\equiv`],[`$ConjList`,`Conjunction list`],[`$DisjList`,`Disjunction list`]]),oc=(e,t)=>{let n=(n,r)=>{Os(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=ac.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.`)})},sc=(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(Hs(i)){let r=X(i,t,n);rc(e,i,r,t,n),e.level=e.operands.reduce((e,t,n)=>t!==void 0&&Ws(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&&(Ws(i,n)===1&&Y(e.levelParams,t.levelParams),Y(e.allParams,t.allParams),Y(e.nonLeibnizParams,t.nonLeibnizParams),qs(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(Ys(e));a.forEach(t=>{e.levelParams.delete(t),e.allParams.delete(t),e.nonLeibnizParams.delete(t)}),ic(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),Ns(e.levelConstraints,t.levelConstraints),Fs(e.argLevelConstraints,i,n,t.level),Is(e.argLevelConstraints,t.argLevelConstraints),t.levelParams.forEach(t=>As(e.argLevelParams,i,n,t)),js(e.argLevelParams,t.argLevelParams)});return oc(e,n),e.levelCorrect},cc=(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))}),nc(e,i,r),e.levelCorrect},lc=(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)}),nc(e,e.params,e.body)),e.levelCorrect),uc=(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),cc(e,1,t),e.inRecursive&&(e.maxLevels.forEach((n,r)=>{n>=2||Os(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),cc(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(uc(e,t)));let a=Do(e);return a.forEach(e=>i(cc(e,1,t))),ko(e).forEach(e=>i(lc(e,1,t))),e.topLevel.forEach(e=>i(X(e,1,t))),tc(e,t)||Oo(e,2).forEach(t=>Ms(e.levelConstraints,t,0)),a.forEach(t=>{Ns(e.levelConstraints,t.levelConstraints),Is(e.argLevelConstraints,t.argLevelConstraints),js(e.argLevelParams,t.argLevelParams,e=>!zs(e,t.params??[]))}),e.topLevel.forEach(t=>{Ns(e.levelConstraints,t.levelConstraints),Is(e.argLevelConstraints,t.argLevelConstraints),js(e.argLevelParams,t.argLevelParams)}),e.levelCorrect},dc=(e,t,n,r)=>(e.levelChecked>=n||(e.levelChecked=n,t.forEach(t=>{Vs(t)&&(t.kind!==`OpDef`||t.defKind!==`ModuleInstance`)&&(e.levelCorrect=X(t,n,r)&&e.levelCorrect,e.level=Math.max(e.level,t.level),Rs(e,t),Y(e.nonLeibnizParams,t.nonLeibnizParams))})),e.levelCorrect),fc=(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&&Os(t,e.body.location,`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`):n===`$Pfcase`?(e.body.level!==0&&Os(t,e.body.location,`Non-constant CASE for temporal goal.`),fc(e.proof,t)):n===`$Qed`&&fc(e.proof,t)})},pc=(e,t,n,r,i,a)=>{e.levelConstraints=$s(t,n,r,i,a),e.argLevelConstraints=ec(t,n,i,a),e.argLevelParams=Qs(t.argLevelParams,n)},mc=(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;uc(r,n)||(e.levelCorrect=!1),e.substs.forEach(r=>{X(r.expr,t,n)||(e.levelCorrect=!1)});let i=tc(r,n);e.substs.forEach(a=>{!i&&a.expr.level>a.op.level&&(X(a.expr,t,n)&&Os(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||Os(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)&&Os(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(Ps(i.op,t))?.level;a===void 0||Gs(o,t)>=a||(s&&Os(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=Gs(s,i.index);o.expr.level<=l||(c&&X(o.expr,t,n)&&Os(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 Ns(e.levelConstraints,$s(r,e.substs,i,t,n),a),e.substs.forEach(t=>Ns(e.levelConstraints,t.expr.levelConstraints,a)),Is(e.argLevelConstraints,ec(r,e.substs,t,n),e=>a(e.param)),e.substs.forEach(t=>Is(e.argLevelConstraints,t.expr.argLevelConstraints,e=>a(e.param))),js(e.argLevelParams,Qs(r.argLevelParams,e.substs),t=>!zs(t,e.params)),e.substs.forEach(t=>js(e.argLevelParams,t.expr.argLevelParams,t=>!zs(t,e.params))),e.levelCorrect},X=(e,t,n)=>{if(!Vs(e))return uc(e,n);switch(e.kind){case`OpAppl`:return sc(e,t,n);case`OpDef`:return cc(e,t,n);case`ThmOrAssumpDef`:return lc(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,Ls(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),Ns(e.levelConstraints,e.body.levelConstraints),r.forEach(t=>Ns(e.levelConstraints,t.levelConstraints)),Is(e.argLevelConstraints,e.body.argLevelConstraints),r.forEach(t=>Is(e.argLevelConstraints,t.argLevelConstraints)),js(e.argLevelParams,e.body.argLevelParams),r.forEach(t=>{let n=t.kind===`OpDef`?t.params??[]:[];js(e.argLevelParams,t.argLevelParams,e=>!zs(e,n))}),e.instances.forEach(t=>js(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,Ls(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=>Rs(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,Zs(t,e.substs,!1))),e.kind===`APSubstIn`?r.allParams.forEach(t=>Y(e.allParams,Zs(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=tc(e.instantiatedModule,n);return pc(e,r,e.substs,i,t,n),e.levelCorrect}case`Instance`:return mc(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,Ls(e,e.body),e.level!==0&&Os(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=dc(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&&Os(n,e.location,`Non-constant bound of temporal PICK.`)}),i.level===3&&fc(e.proof,n),r}case`LeafProof`:case`UseOrHide`:return dc(e,e.facts,t,n);case`NonLeafProof`:return dc(e,[...e.steps,...e.instances],t,n);case`DefStep`:return dc(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,Os(n,e.location,`Level error:
|
|
1349
|
-
Temporal formula used as set.`)),Ls(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=>Rs(e,t)),e.levelCorrect&&e.levelParams.forEach(t=>{t.kind===`OpDecl`&&t.declKind===2&&Ms(e.levelConstraints,t,2)})),e.levelCorrect}},hc=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[]}},gc=/* @__PURE__ */ new Map([[`Integers`,`Int`],[`Naturals`,`Nat`],[`Reals`,`Reals`]]),_c=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&&gc.get(e)===t.name||n(t))return!0}}return hc(e).some(n)};return n(e)},vc=e=>e.operands.filter(e=>e?.kind===`OpAppl`),yc=e=>{let t=e.operands[0];return t?.kind===`String`?t:void 0},bc=(e,t)=>{if(e===t)return!0;if(e.operands.length!==t.operands.length)return!1;let n=new Set(vc(t).map(e=>yc(e)?.value));return vc(e).every(e=>n.has(yc(e)?.value))},xc=(e,t=/* @__PURE__ */ new Set)=>(e.extendees.forEach(e=>{t.has(e)||(t.add(e),xc(e,t))}),t),Sc=e=>{let t=[...[...xc(e)].flatMap(e=>e.records),...e.records];return e.records.flatMap(n=>t.filter(e=>bc(e,n)).flatMap(vc).some(_c)?[]:vc(n).flatMap(t=>{let n=yc(t),r=n&&To(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 ${uo(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}]}))},Cc=e=>`${uo(e.location)}\n\n${e.text}`,wc=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=>`${Cc(e)}\n\n\n`),n.length>0?`*** Warnings: ${n.length}\n\n`:``,...n.map(e=>`${Cc(e)}\n\n\n`)].join(``)},Tc=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),Ec=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))},Dc=t=>{try{return e.T(ts(t))}catch(t){if(t instanceof e.ft)return;throw t}},Oc=(t,n)=>n===`1.7.4`&&e.Q(t)!==void 0?void 0:Dc(t)?.name,kc=(t,i=()=>void 0,a={})=>{let o=(0,n.basename)(t,`.tla`),s=mi(a.version),c=a.fileName??o,l=(0,r.existsSync)(t)?(0,r.readFileSync)(t,`utf8`):s.get(o),u=[],d=e=>{u.push(e),a.onPrint?.(e)},f=e=>d(`${e}\n`),p=a.version===`1.7.4`,m=p&&a.isXmlExport,h=e=>{a.isXmlExport||f(e)},g=a.describeFile,_=/* @__PURE__ */ new Map([[o,(0,r.existsSync)(t)?`file`:`standard`]]),v={value:!1},y=[],b={isReported:!1,isAborted:!1},x=ia(gi(),f),S=/* @__PURE__ */ new Map,C=[],w=()=>C.splice(0).forEach(e=>e.isError?a.onPrintError?.(`${e.text}\n`):f(e.text)),T=e=>{let t=S.get(e),n=t?.module.location.range;if(t===void 0||n===void 0)return;let r=t.text.split(/\r\n|\r|\n/),i=ao(x,r.slice(n.start.line-1,n.end.line),a.version),o=i.has(`TLA_DIVERGENCE_EXISTS`),s=i.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(p){let t=o&&s?`The PlusCal algorithm and its TLA+ translation in module ${e} filename since the last translation.`:c;t===void 0?i.has(`ERROR_ENCOUNTERED`)&&C.push({text:`A unexpected problem was encountered attempting to validate the specification for ${e}`,isError:!0}):C.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??(i.has(`ERROR_ENCOUNTERED`)?`An unexpected problem was encountered attempting to validate the specification for ${e}`:void 0);if(l===void 0)return;let u=!i.has(`ERROR_ENCOUNTERED`)||o||s;y.some(e=>e.text===l)||y.push({location:e,text:l,isWarning:u})},E=(e,t)=>{if(a.isXmlExport||S.has(e))return;let n=Dc(t);if(n===void 0||n.name!==e)return;let r=[...S.values()].filter(t=>Ec(t.module).includes(e));S.set(e,{text:t,module:n}),r.forEach(()=>T(e)),Ec(n).filter(t=>t!==e&&S.has(t)).forEach(T)},ee=()=>{if(w(),b.isReported)return;b.isReported=!0;let e=y.filter(e=>e.isWarning);e.length>0&&(h(`Warnings (${e.length}) during syntax parsing of ${c}:\n\n`),e.forEach(e=>h(`${Cc(e)}\n\n\n`))),e.length!==y.length&&(f(wc(y)),v.value=!0,b.isAborted=!0)},D=t=>{let n=s.get(t),r=i(t),a=r===void 0&&n===void 0&&l!==void 0&&!p?e.C(l,t):void 0,o=r??a;return _.set(t,r===void 0?a===void 0?`standard`:`root file`:`file`),o!==void 0&&E(t,o),o??n},te=(()=>{try{if(l===void 0)throw new e.dt(`Cannot find source file for module ${c}`,void 0);return E(o,l),Es(l,D,{rootFileName:o,version:a.version,rootExtendees:a.rootExtendees,onParse:e=>{g&&f(`Parsing file ${g(e,_.get(e)??`file`)}`),e===o&&T(o),w()},onAnalyze:e=>{ee(),(g||m)&&!b.isAborted&&f(`Semantic processing of module ${e}`)},onModule:(e,t)=>{if(b.isAborted||(t.every(e=>e.isWarning)&&uc(e,{messages:t,isTlc174:p}),t.length===0))return;if(t.some(e=>!e.isWarning)&&(v.value=!0),p)return f(`Semantic errors:\n\n${wc(t)}`);let n=t.filter(e=>e.isWarning);n.length>0&&(h(`*** Warnings: ${n.length}\n`),n.forEach(e=>h(`${Cc(e)}\n\n\n`)));let r=t.filter(e=>!e.isWarning);r.length!==0&&(f(`Semantic errors:\n\n*** Errors: ${r.length}\n`),r.forEach(e=>f(`${Cc(e)}\n\n`)))}})}catch(t){if(v.value=!0,t instanceof e.it){f(`\nFatal errors while parsing TLA+ spec in file ${c}\n`),f(t.message),f(wc(y));return}if(!(t instanceof e.dt))throw t;let n={location:t.location,text:t.message,isWarning:!1},r=p&&t.parseError?.includes(` and token "" `);if(t.parseError!==void 0&&!r&&!m&&f(t.parseError),f(`\nFatal errors while parsing TLA+ spec in file ${c}\n`),r){f(`java.lang.NullPointerException: Cannot invoke "String.length()" because "str" is null`);return}if(p){f(`tla2sany.semantic.AbortException`),d(`*** Abort messages: 1\n\n${Cc(n)}\n\n\n`);return}f(Cc(n)),f(wc(b.isReported?[n]:[...y,n]))}})();if(te!==void 0&&ee(),te!==void 0&&!v.value&&!a.isXmlExport&&!p){let e=te.modules.filter(e=>!Tc.has(e.name));g&&e.forEach(e=>f(`Linting of module ${e.name}`)),e.flatMap(Sc).forEach(e=>f(`${Cc(e)}\n\n\n`))}return{text:u.join(``),isFailed:v.value,specification:b.isAborted?void 0:te}},Ac={uncaughtException:1,argsParsingFailure:1,specParsingFailure:2,unrepresentableCharacter:7},jc=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:[]}),Mc={"&":`&`,"<":`<`,">":`>`,"\r":` `},Nc=e=>e.replace(/[&<>\r]|[\u{10000}-\u{10FFFF}]/gu,e=>e.length===2?`&#${e.codePointAt(0)};`:Mc[e]),Pc=/[^\t\n\r\u0020-\uD7FF\uE000-\uFFFD\u{10000}-\u{10FFFF}]/u,Fc=e=>{let t=(e.cdata??e.text)?.match(Pc)?.[0];if(t!==void 0)return{tag:e.tag,character:t};for(let t of e.children){let e=Fc(t);if(e)return e}},Ic=(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}>${Nc(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)Ic(i,t+1,n,r);r.push(`${i}</${e.tag}>`)}},Lc=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)]),Rc=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)`}},zc={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)`}}},Bc={at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1424)`},Vc=uo(`--TLA+ BUILTINS--`),Hc=(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}]},Uc=(e,t=16)=>e>t*.75?Uc(e,t*2):t,Wc=(e,t)=>(e^e>>>16)&t-1,Gc=e=>{let t=e.split(/\r?\n/);for(;t.at(-1)===``;)t.pop();return t},Kc=e=>e.replace(/^[\0-\x20]+|[\0-\x20]+$/g,``),qc=/[\t-\r\x1C-\x20\u1680\u2000-\u2006\u2008-\u200A\u2028\u2029\u205F\u3000]+$/,Jc=e=>{let t=e.indexOf(`(**`),n=e.lastIndexOf(`**)`);if(t<0||n<=t)return e;let r=Gc(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(qc,``)}).join(`
|
|
1349
|
+
Temporal formula used as set.`)),Ls(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=>Rs(e,t)),e.levelCorrect&&e.levelParams.forEach(t=>{t.kind===`OpDecl`&&t.declKind===2&&Ms(e.levelConstraints,t,2)})),e.levelCorrect}},hc=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[]}},gc=/* @__PURE__ */ new Map([[`Integers`,`Int`],[`Naturals`,`Nat`],[`Reals`,`Reals`]]),_c=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&&gc.get(e)===t.name||n(t))return!0}}return hc(e).some(n)};return n(e)},vc=e=>e.operands.filter(e=>e?.kind===`OpAppl`),yc=e=>{let t=e.operands[0];return t?.kind===`String`?t:void 0},bc=(e,t)=>{if(e===t)return!0;if(e.operands.length!==t.operands.length)return!1;let n=new Set(vc(t).map(e=>yc(e)?.value));return vc(e).every(e=>n.has(yc(e)?.value))},xc=(e,t=/* @__PURE__ */ new Set)=>(e.extendees.forEach(e=>{t.has(e)||(t.add(e),xc(e,t))}),t),Sc=e=>{let t=[...[...xc(e)].flatMap(e=>e.records),...e.records];return e.records.flatMap(n=>t.filter(e=>bc(e,n)).flatMap(vc).some(_c)?[]:vc(n).flatMap(t=>{let n=yc(t),r=n&&To(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 ${uo(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}]}))},Cc=e=>`${uo(e.location)}\n\n${e.text}`,wc=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=>`${Cc(e)}\n\n\n`),n.length>0?`*** Warnings: ${n.length}\n\n`:``,...n.map(e=>`${Cc(e)}\n\n\n`)].join(``)},Tc=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),Ec=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))},Dc=t=>{try{return e.T(ts(t))}catch(t){if(t instanceof e.ft)return;throw t}},Oc=(t,n)=>n===`1.7.4`&&e.Q(t)!==void 0?void 0:Dc(t)?.name,kc=(t,i=()=>void 0,a={})=>{let o=(0,n.basename)(t,`.tla`),s=mi(a.version),c=a.fileName??o,l=(0,r.existsSync)(t)?(0,r.readFileSync)(t,`utf8`):s.get(o),u=[],d=e=>{u.push(e),a.onPrint?.(e)},f=e=>d(`${e}\n`),p=a.version===`1.7.4`,m=p&&a.isXmlExport,h=e=>{a.isXmlExport||f(e)},g=a.describeFile,_=/* @__PURE__ */ new Map([[o,(0,r.existsSync)(t)?`file`:`standard`]]),v={value:!1},y=[],b={isReported:!1,isAborted:!1},x=ia(gi(),f),S=/* @__PURE__ */ new Map,C=[],w=()=>C.splice(0).forEach(e=>e.isError?a.onPrintError?.(`${e.text}\n`):f(e.text)),T=e=>{let t=S.get(e),n=t?.module.location.range;if(t===void 0||n===void 0)return;let r=t.text.split(/\r\n|\r|\n/),i=ao(x,r.slice(n.start.line-1,n.end.line),a.version),o=i.has(`TLA_DIVERGENCE_EXISTS`),s=i.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(p){let t=o&&s?`The PlusCal algorithm and its TLA+ translation in module ${e} filename since the last translation.`:c;t===void 0?i.has(`ERROR_ENCOUNTERED`)&&C.push({text:`A unexpected problem was encountered attempting to validate the specification for ${e}`,isError:!0}):C.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??(i.has(`ERROR_ENCOUNTERED`)?`An unexpected problem was encountered attempting to validate the specification for ${e}`:void 0);if(l===void 0)return;let u=!i.has(`ERROR_ENCOUNTERED`)||o||s;y.some(e=>e.text===l)||y.push({location:e,text:l,isWarning:u})},E=(e,t)=>{if(a.isXmlExport||S.has(e))return;let n=Dc(t);if(n===void 0||n.name!==e)return;let r=[...S.values()].filter(t=>Ec(t.module).includes(e));S.set(e,{text:t,module:n}),r.forEach(()=>T(e)),Ec(n).filter(t=>t!==e&&S.has(t)).forEach(T)},ee=()=>{if(w(),b.isReported)return;b.isReported=!0;let e=y.filter(e=>e.isWarning);e.length>0&&(h(`Warnings (${e.length}) during syntax parsing of ${c}:\n\n`),e.forEach(e=>h(`${Cc(e)}\n\n\n`))),e.length!==y.length&&(f(wc(y)),v.value=!0,b.isAborted=!0)},D=t=>{let n=s.get(t),r=i(t),a=r===void 0&&n===void 0&&l!==void 0&&!p?e.C(l,t):void 0,o=r??a;return _.set(t,r===void 0?a===void 0?`standard`:`root file`:`file`),o!==void 0&&E(t,o),o??n},te=(()=>{try{if(l===void 0)throw new e.dt(`Cannot find source file for module ${c}`,void 0);return E(o,l),Es(l,D,{rootFileName:o,rootFilePath:a.isXmlExport?`${c.replace(/\.tla$/,``)}.tla`:void 0,version:a.version,rootExtendees:a.rootExtendees,onParse:e=>{g&&f(`Parsing file ${g(e,_.get(e)??`file`)}`),e===o&&T(o),w()},onAnalyze:e=>{ee(),(g||m)&&!b.isAborted&&f(`Semantic processing of module ${e}`)},onModule:(e,t)=>{if(b.isAborted||(t.every(e=>e.isWarning)&&uc(e,{messages:t,isTlc174:p}),t.length===0))return;if(t.some(e=>!e.isWarning)&&(v.value=!0),p)return f(`Semantic errors:\n\n${wc(t)}`);let n=t.filter(e=>e.isWarning);n.length>0&&(h(`*** Warnings: ${n.length}\n`),n.forEach(e=>h(`${Cc(e)}\n\n\n`)));let r=t.filter(e=>!e.isWarning);r.length!==0&&(f(`Semantic errors:\n\n*** Errors: ${r.length}\n`),r.forEach(e=>f(`${Cc(e)}\n\n`)))}})}catch(t){if(v.value=!0,t instanceof e.it){f(`\nFatal errors while parsing TLA+ spec in file ${c}\n`),f(t.message),f(wc(y));return}if(!(t instanceof e.dt))throw t;let n={location:t.location,text:t.message,isWarning:!1},r=p&&t.parseError?.includes(` and token "" `);if(t.parseError!==void 0&&!r&&!m&&f(t.parseError),f(`\nFatal errors while parsing TLA+ spec in file ${c}\n`),r){f(`java.lang.NullPointerException: Cannot invoke "String.length()" because "str" is null`);return}if(p){f(`tla2sany.semantic.AbortException`),d(`*** Abort messages: 1\n\n${Cc(n)}\n\n\n`);return}f(Cc(n)),f(wc(b.isReported?[n]:[...y,n]))}})();if(te!==void 0&&ee(),te!==void 0&&!v.value&&!a.isXmlExport&&!p){let e=te.modules.filter(e=>!Tc.has(e.name));g&&e.forEach(e=>f(`Linting of module ${e.name}`)),e.flatMap(Sc).forEach(e=>f(`${Cc(e)}\n\n\n`))}return{text:u.join(``),isFailed:v.value,specification:b.isAborted?void 0:te}},Ac={uncaughtException:1,argsParsingFailure:1,specParsingFailure:2,unrepresentableCharacter:7},jc=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:[]}),Mc={"&":`&`,"<":`<`,">":`>`,"\r":` `},Nc=e=>e.replace(/[&<>\r]|[\u{10000}-\u{10FFFF}]/gu,e=>e.length===2?`&#${e.codePointAt(0)};`:Mc[e]),Pc=/[^\t\n\r\u0020-\uD7FF\uE000-\uFFFD\u{10000}-\u{10FFFF}]/u,Fc=e=>{let t=(e.cdata??e.text)?.match(Pc)?.[0];if(t!==void 0)return{tag:e.tag,character:t};for(let t of e.children){let e=Fc(t);if(e)return e}},Ic=(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}>${Nc(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)Ic(i,t+1,n,r);r.push(`${i}</${e.tag}>`)}},Lc=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)]),Rc=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)`}},zc={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)`}}},Bc={at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1424)`},Vc=uo(`--TLA+ BUILTINS--`),Hc=(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}]},Uc=(e,t=16)=>e>t*.75?Uc(e,t*2):t,Wc=(e,t)=>(e^e>>>16)&t-1,Gc=e=>{let t=e.split(/\r?\n/);for(;t.at(-1)===``;)t.pop();return t},Kc=e=>e.replace(/^[\0-\x20]+|[\0-\x20]+$/g,``),qc=/[\t-\r\x1C-\x20\u1680\u2000-\u2006\u2008-\u200A\u2028\u2029\u205F\u3000]+$/,Jc=e=>{let t=e.indexOf(`(**`),n=e.lastIndexOf(`**)`);if(t<0||n<=t)return e;let r=Gc(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(qc,``)}).join(`
|
|
1350
1350
|
`)},Yc=e=>{let t=Gc(e),n=e=>Kc(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
|
`)},Xc=(t,n,r)=>{let i=r.version===`1.7.4`,a=/* @__PURE__ */ new Set,o=/* @__PURE__ */ new Map,s={isSet:!1},c=[],l=(e,t)=>{if(!i)return t();c.push(...e);let n=t();return c.length-=e.length,n},u=(t,n)=>{let r=[...c,...n].reverse(),i=[t,...r.map(e=>`\tat tla2sany.${e.at}`)].join(`
|
|
1352
1352
|
`),a=r.filter(e=>e.failedFor!==void 0).map(e=>`failed for node.toString(): ${e.failedFor}\n with error \n${i}\n`).join(``);return e.yt(new e.ct(i,a),Ac.uncaughtException)},d=e=>u(`java.lang.NullPointerException: Cannot invoke "tla2sany.semantic.${e.nullType}.export(org.w3c.dom.Document, tla2sany.xml.SymbolContext)" because ${e.nullValue} is null`,[e]),f=(e,t)=>(a.has(e.id)||(a.add(e.id),o.set(e.id,l([...t?[t]:[],...Hc(e.kind,uo(e.location))],()=>g(e)))),Z(Rc(e),[Q(`UID`,e.id)])),p=(e,t,n)=>{let r=t.levelChecked===0?[]:[Q(`level`,t.level)],i=n?[Lc(n),...r]:r;return{...e,children:[...i,...e.children]}},m=(e,t,n)=>Z(`params`,e.map((e,r)=>Z(`leibnizparam`,[f(e,n),...t?.[r]?[Z(`leibniz`)]:[]]))),h=e=>{let t=e.map(e=>e.trimEnd()).filter(e=>e.length>0).join(`
|