tla-ts 0.0.10-dev.68b2c4968 → 0.0.10-dev.6b2a6741a
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/deciders.cjs +1 -1
- package/dist/deciders.js +1 -1
- package/dist/index.d.cts +1 -0
- package/dist/index.d.ts +1 -0
- package/dist/prove.cjs +6 -6
- package/dist/prove.js +6 -6
- package/dist/run.cjs +7 -7
- package/dist/run.js +7 -7
- package/dist/transfer.cjs +33 -33
- package/dist/transfer.js +29 -29
- package/package.json +1 -1
- package/src/ast.ts +1 -0
- package/src/cli/xml-exporter.ts +1 -1
- package/src/codegen.ts +3 -3
- package/src/environment.ts +40 -33
- package/src/instances.ts +4 -4
- package/src/java-overrides.ts +2 -2
- package/src/levels.ts +4 -4
- package/src/obligations/index.ts +1 -1
- package/src/obligations/normalize.ts +1 -4
- package/src/obligations/printer.ts +5 -5
- package/src/parser.ts +35 -106
- package/src/prover/isabelle/isar/attrib.ts +4 -4
- package/src/prover/isabelle/pure/rewriter.ts +3 -3
- package/src/prover/isabelle/pure/term.ts +3 -3
- package/src/prover/prep/md5.ts +26 -29
- package/src/prover/smt/solver/logic-tactics.ts +2 -2
- package/src/prover/smt/solver/opt-preprocess.ts +1 -1
- package/src/prover/smt/solver/seq-decl-plugin.ts +1 -1
- package/src/prover/smt/solver/seq-rewriter.ts +1 -1
- package/src/prover/smt/solver/tactic.ts +4 -4
- package/src/prover/tlapm/cache.ts +8 -8
- package/src/resolve.ts +374 -125
- package/src/runtime.ts +1 -1
- package/src/sany/builtins.ts +10 -10
- package/src/sany/generation.ts +1 -0
- package/src/sany/generator-definitions.ts +1 -0
- package/src/sany/generator-expressions.ts +6 -3
- package/src/sany/generator-proofs.ts +4 -2
- package/src/sany/lexer.ts +3 -3
- package/src/sany/modules.ts +4 -2
- package/src/sany/selectors.ts +5 -1
- package/src/sany/xml.ts +2 -3
- package/src/subexpressions.ts +102 -18
- package/src/symmetry.ts +1 -1
- package/src/tlc/jar-data.ts +1 -3
- package/src/tlc/messages.ts +3 -3
- package/src/tlc/tlc-operators.ts +3 -1
- package/src/tlc/trace-spec.ts +3 -2
- package/src/values.ts +4 -4
package/dist/run.js
CHANGED
|
@@ -6,7 +6,7 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
import{t as e}from"./tlapm.js";import{$ as t,A as n,E as r,F as i,G as a,H as o,I as s,K as c,L as l,M as u,N as d,O as f,R as p,S as m,V as h,_ as g,at as _,b as v,c as y,et as b,j as x,k as S,nt as C,o as w,ot as T,rt as E,s as D,st as ee,v as O,w as k,x as A}from"./worker.js";import{$ as te,At as ne,E as re,Ft as ie,G as ae,K as oe,M as se,O as ce,Pt as le,Q as ue,S as de,Vt as j,Zt as fe,_n as pe,_t as me,an as he,b as ge,bn as _e,cn as ve,ct as ye,dn as be,en as M,fn as xe,ft as Se,gn as Ce,h as we,hn as Te,i as Ee,in as De,kt as Oe,lt as ke,m as Ae,mn as je,mt as Me,nn as N,o as Ne,on as P,ot as Pe,p as Fe,pn as Ie,pt as Le,qt as Re,r as ze,rn as Be,s as Ve,sn as He,tn as F,tt as Ue,un as We,ut as Ge,vn as Ke,vt as qe,w as Je,x as Ye,yn as Xe}from"./transfer.js";import{S as Ze,_ as Qe,a as $e,b as et,c as tt,d as nt,f as rt,g as it,h as at,i as ot,l as st,m as ct,n as lt,p as ut,r as dt,s as ft,t as pt,u as mt,v as ht,x as gt,y as _t}from"./prove.js";import{basename as vt,delimiter as yt,dirname as bt,isAbsolute as xt,join as St,resolve as Ct}from"node:path";import{appendFileSync as wt,closeSync as Tt,cpSync as Et,existsSync as I,globSync as Dt,mkdirSync as Ot,openSync as kt,readFileSync as At,readSync as jt,readdirSync as Mt,realpathSync as Nt,renameSync as Pt,rmSync as Ft,statSync as It,writeFileSync as Lt}from"node:fs";import{pathToFileURL as Rt}from"node:url";import{spawnSync as zt}from"node:child_process";import{arch as Bt,availableParallelism as Vt,release as Ht,tmpdir as Ut,type as Wt}from"node:os";import{getHeapStatistics as Gt}from"node:v8";const Kt=`META-INF/MANIFEST.MF`,qt=async e=>{if(e===void 0||!I(e))return`master`;let t=await import(`fflate`),n=t.unzipSync(At(e),{filter:e=>e.name===Kt})[Kt];return(n&&/^X-Git-Tag: *(\S*)/m.exec(t.strFromU8(n))?.[1])===`v1.7.4`?`1.7.4`:`master`},Jt=/[*?[{]/,Yt=e=>e.flatMap(e=>Jt.test(e)?Dt(e).sort().map(e=>({path:e,isGlobbed:!0})):[{path:e,isGlobbed:!1}]),Xt=(e,t)=>e.map(e=>St(e,`${t}.tla`)).find(I),Zt=e=>t=>{let n=Xt(e,t);return n===void 0?void 0:At(n,`utf8`)},Qt=(e,t,n)=>console.error(`File does not exist: ${e}/${t} while looking in these directories: ${e}, ${n.join(`, `)}, classpath:/tla2sany/StandardModules, classpath:/`),$t=e=>`jar:file:${Rt(Ct(e)).pathname}!/tla2sany/StandardModules/`,en=e=>e instanceof o?_(e.code):t(e),tn=(e,t)=>{if(e instanceof O||e instanceof A){let n=He(e.message),r=e instanceof o?e.code:n&&!n.isEvalException?n.code:M.general;return t.print(r,F.error,Be(r,e.message,t.isTool))}console.error(`${e.name}: ${e.message}`)},nn=async(e,t=N({isTool:!1}))=>{try{return await e()}catch(e){if(!(e instanceof v))throw e;return tn(e,t),en(e)}},rn=(e,t,n)=>console.error(`File does not exist: ${xt(e)?e:`${process.cwd()}/${e}`} while looking in these directories: ${[...t,...n===void 0?[]:[$t(n)]].join(`, `)}`),an=e=>e.endsWith(`/`)?e:`${e}/`,on=(e,t)=>n=>{let r=e(n);return r===void 0&&!ye.has(n)&&t(`${n}.tla`),r},sn=e=>e.classPath?.split(yt).find(e=>e.endsWith(`.jar`));var cn=`0.0.10-dev.68b2c4968`;const ln=2224400062,un={int8:0,int16:1,int32:2,shared8:4,shared16:5,shared32:6,block32:8,string8:9,string32:10,doubleLittle:12},dn={smallInt:64,smallString:32,smallBlock:128},L=(e,...t)=>({tag:e,fields:t}),fn=e=>typeof e==`object`&&`tag`in e,pn=(e,t)=>{let n=new DataView(e.buffer,e.byteOffset,e.byteLength);if(e.length<t+20||n.getUint32(t)!==ln)throw new x(`corrupted fingerprint file`);let r=t+20+n.getUint32(t+4),i=[],a=t+20,o=e=>{let t=a;if(a+=e,a>r)throw new x(`corrupted fingerprint file`);return t},s=new TextDecoder,c=t=>{let n=o(t),r=s.decode(e.subarray(n,n+t));return i.push(r),r},l=(e,t)=>{let n=L(e);t>0&&i.push(n);for(let e=0;e<t;e++)n.fields.push(d());return n},u=e=>i[i.length-e],d=()=>{let t=e[o(1)];if(t>=dn.smallBlock)return l(t&15,t>>4&7);if(t>=dn.smallInt)return t&63;if(t>=dn.smallString)return c(t&31);switch(t){case un.int8:return n.getInt8(o(1));case un.int16:return n.getInt16(o(2));case un.int32:return n.getInt32(o(4));case un.shared8:return u(n.getUint8(o(1)));case un.shared16:return u(n.getUint16(o(2)));case un.shared32:return u(n.getUint32(o(4)));case un.block32:{let e=n.getUint32(o(4));return l(e&255,e>>>10)}case un.string8:return c(n.getUint8(o(1)));case un.string32:return c(n.getUint32(o(4)));case un.doubleLittle:{let e={float:n.getFloat64(o(8),!0)};return i.push(e),e}}throw new x(`corrupted fingerprint file`)};return{value:d(),next:r}},mn=e=>{let t=[],n=0,r=0,i=0,a=(e,n)=>{for(let r=(n-1)*8;r>=0;r-=8)t.push(e>>>r&255)},o=new TextEncoder,s=e=>{if(typeof e==`number`)return e>=0&&e<64?t.push(dn.smallInt+e):e>=-128&&e<128?t.push(un.int8,e&255):e>=-32768&&e<32768?(t.push(un.int16),a(e,2)):(t.push(un.int32),a(e,4));if(n++,typeof e==`string`){let n=o.encode(e);n.length<32?t.push(dn.smallString+n.length):n.length<256?t.push(un.string8,n.length):(t.push(un.string32),a(n.length,4)),t.push(...n),r+=1+Math.floor((n.length+4)/4),i+=1+Math.floor((n.length+8)/8);return}if(!fn(e)){let n=/* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(8));n.setFloat64(0,e.float,!0),t.push(un.doubleLittle,...new Uint8Array(n.buffer)),r+=3,i+=2;return}let c=e.fields.length;c===0?n--:(r+=1+c,i+=1+c),e.tag<16&&c<8?t.push(dn.smallBlock+e.tag+(c<<4)):(t.push(un.block32),a(c*1024+e.tag,4)),e.fields.forEach(s)};s(e);let c=/* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(20));return[ln,t.length,n,r,i].forEach((e,t)=>c.setUint32(t*4,e)),new Uint8Array([...new Uint8Array(c.buffer),...t])},hn=20210223,gn=[...tt,`cooper`,`expandenabled`,`expandcdot`,`lambdify`,`enabledaxioms`,`levelcomparison`],_n={zenon:{field:1,tag:1},isabelle:{field:2,tag:0},cooper:{field:4,tag:3,isConstant:!0},smt:{field:10,tag:8},z3:{field:11,tag:9},ls4:{field:17,tag:16},expandenabled:{field:18,tag:6,isConstant:!0},expandcdot:{field:19,tag:8,isConstant:!0},lambdify:{field:20,tag:9,isConstant:!0},enabledaxioms:{field:21,tag:10,isConstant:!0},levelcomparison:{field:22,tag:11,isConstant:!0}},vn=[`false`,`timeout`],yn=`tla-ts ${cn}`,bn=/* @__PURE__ */ new Map([[_n.zenon.field,3],[_n.isabelle.field,4]]),xn=(e,t)=>e!==void 0&&fn(e)?e.fields[t]:void 0,Sn=e=>e!==void 0&&typeof e==`object`&&`float`in e?e.float:1/0,Cn=e=>{let t=new TextEncoder().encode(e),n=(e,t)=>e<<t|e>>>32-t,r=Array.from({length:Math.ceil(t.length/4)},(e,n)=>t[n*4]|t[n*4+1]<<8|t[n*4+2]<<16|t[n*4+3]<<24).reduce((e,t)=>{let r=Math.imul(n(Math.imul(t,3432918353),15),461845907);return Math.imul(n(e^r,13),5)+3864292196|0},0),i=Math.imul(r^t.length^(r^t.length)>>>16,2246822507),a=Math.imul(i^i>>>13,3266489909);return(a^a>>>16)&1073741823},wn=e=>e!==void 0&&fn(e)?[[e.fields[0],e.fields[1]],...wn(e.fields[2])]:[],Tn=(e,t,n)=>{let r=At(t),i=pn(r,0),a=pn(r,i.next).value;if(i.value!==hn||!fn(a)||a.tag!==0)throw new x(`corrupted fingerprint file`);let o=xn(xn(a,0),1),s=(e,t)=>{let r=bn.get(t);return!n||r===void 0||xn(xn(e,0),r)===yn};e.clear(),(o!==void 0&&fn(o)?o.fields:[]).flatMap(e=>wn(e).toReversed()).forEach(([t,n])=>{if(typeof t!=`string`||!fn(n))throw new x(`corrupted fingerprint file`);e.set(t,n.fields.map((e,t)=>s(e,t)?e:0))})},En=(e,t)=>{let n=xn(t,0),r=xn(n,0),i=xn(xn(n,1),0);if(r===void 0||r===1)return;let a=Sn(xn(e===`isabelle`?xn(i,0):i,0)),o=e===`isabelle`?xn(i,1):void 0,s=xn(xn(r,0),0);return{kind:`stored`,method:{prover:e,timeLimitMs:a*1e3,...typeof o==`string`&&{tactic:o}},isProved:r===0,...s!==void 0&&{reason:typeof s==`number`?vn[s]:String(xn(s,0))}}},Dn=(e,t)=>{let n=/* @__PURE__ */ new Date,r=t.method,i={float:mt(r)},a=e===`zenon`?L(0,i,5):e===`isabelle`?L(0,L(0,i),r.tactic??`auto`):L(0,i),o=ot(t),s=vn.indexOf(o??``),c=o===void 0?0:L(0,s===-1?L(0,o):s);return L(0,L(0,L(0,$e(t)?0:L(0,c),_n[e].isConstant?_n[e].tag:L(_n[e].tag,a)),L(0,n.getFullYear(),n.getMonth(),n.getDate(),n.getHours(),n.getMinutes(),n.getSeconds()),yn,yn,yn))},On=e=>{let t=2**Math.max(9,Math.ceil(Math.log2(e.size/2))),n=Array.from({length:t},()=>0);return e.forEach((e,r)=>{let i=Cn(r)&t-1;n[i]=L(0,r,L(0,...e),n[i])}),L(0,L(0,e.size,L(0,...n),0,512))},kn=e=>String(e).padStart(2,`0`),An=(e,t)=>{let n=/* @__PURE__ */ new Date,r=`${e}.history`,i=St(r,`${n.getFullYear()}-${kn(n.getMonth()+1)}-${kn(n.getDate())}_${kn(n.getHours())}_${kn(n.getMinutes())}_${kn(n.getSeconds())}`);Ot(i,{recursive:!0}),[e,...t].filter(e=>I(e)).forEach(e=>Et(e,St(i,vt(e)),{preserveTimestamps:!0})),Mt(r).map(e=>St(r,e)).sort((e,t)=>It(t).mtimeMs-It(e).mtimeMs).slice(10).forEach(e=>Ft(e,{recursive:!0,force:!0}))},jn=e=>{let t=/* @__PURE__ */ new Map,n=/* @__PURE__ */ new Map,r=new Map([...e].map(([e,r])=>{let i=new Map(gn.flatMap(e=>{let n=r[_n[e].field],i=En(e,xn(n,0));return i?(t.set(i,n),[[e,i]]):[]}));return n.set(i,r),[e,i]}));return{results:r,save:i=>{e.clear(),r.forEach((r,i)=>{let a=[...n.get(r)??Array(23).fill(0)];gn.forEach(e=>{let n=r.get(e);n&&(a[_n[e].field]=t.get(n)??Dn(e,n))}),e.set(i,a)}),Lt(`${i}.tmp`,Buffer.concat([mn(hn),mn(On(e))])),Pt(`${i}.tmp`,i)}}},Mn=((e,t)=>{let n=new Map(t.map(e=>{let[t,...n]=e.flag.split(` `);return[t,n.length]}));return{usage:e.replace(`{options}`,t.map(e=>`[${e.flag}]${e.isRepeatable?`...`:``}`).join(` `)),parse:e=>{let t=[],r=[],i=[];for(let a=0;a<e.length;a++){let o=n.get(e[a]);o===void 0?(e[a].startsWith(`-`)?i:r).push(e[a]):(t.push({name:e[a],values:e.slice(a+1,a+1+o)}),a+=o)}return{options:t,positionals:r,unknown:i,incomplete:t.find(e=>e.values.length<(n.get(e.name)??0)),has:e=>t.some(t=>t.name===e),get:e=>t.findLast(t=>t.name===e)?.values}}}})(`tla-ts tlapm {options} <Module.tla|glob>...`,[{flag:`-N`},{flag:`--summary`},{flag:`--strict`},{flag:`--toolbox <start> <end>`},{flag:`--line <num>`},{flag:`--printallobs`},{flag:`--threads <num>`},{flag:`--version`},{flag:`-I <directory>`,isRepeatable:!0},{flag:`-k`},{flag:`--noproving`},{flag:`--nofp`},{flag:`--nofpl <start> <end>`},{flag:`--safefp`},{flag:`--cleanfp`},{flag:`--usefp <file>`},{flag:`--cache-dir <directory>`},{flag:`--debug <flags>`,isRepeatable:!0},{flag:`--method <methods>`},{flag:`--solver <command>`},{flag:`--smt-logic <logic>`},{flag:`--stretch <factor>`},{flag:`--noflatten`}]),Nn=[`Usage: tla-ts <Spec.tla|Spec.cfg|spec.ts|glob>... [-config <Spec.cfg>] [-continue] [-deadlock] [-dump [<format>] <file>] [-fp <num>] [-lncheck <final|default|off>] [-maxSetSize <num>] [-metadir <directory>] [-nowarning] [-seed <num>] [-terse] [-tool] [-view] [-workers <count|auto>]`,` ${Mn.usage}`,` tla-ts [<JVM option>]... tlc2.TLC <TLC option>... <Spec>`,` (-cp tla2tools.jar or -Dtla-ts.tlc=1.7.4 picks the TLC to reproduce)`,` tla-ts [<JVM option>]... tla2sany.xml.XMLExporter [-I <directory>]... [-o] [-t] [-r] [-u] <Module.tla>`].join(`
|
|
9
|
+
import{t as e}from"./tlapm.js";import{$ as t,A as n,E as r,F as i,G as a,H as o,I as s,K as c,L as l,M as u,N as d,O as f,R as p,S as m,V as h,_ as g,at as _,b as v,c as y,et as b,j as x,k as S,nt as C,o as w,ot as T,rt as E,s as D,st as ee,v as O,w as k,x as A}from"./worker.js";import{$ as te,At as ne,E as re,Ft as ie,G as ae,K as oe,M as se,O as ce,Pt as le,Q as ue,S as de,Vt as j,Zt as fe,_n as pe,_t as me,an as he,b as ge,bn as _e,cn as ve,ct as ye,dn as be,en as M,fn as xe,ft as Se,gn as Ce,h as we,hn as Te,i as Ee,in as De,kt as Oe,lt as ke,m as Ae,mn as je,mt as Me,nn as N,o as Ne,on as P,ot as Pe,p as Fe,pn as Ie,pt as Le,qt as Re,r as ze,rn as Be,s as Ve,sn as He,tn as F,tt as Ue,un as We,ut as Ge,vn as Ke,vt as qe,w as Je,x as Ye,yn as Xe}from"./transfer.js";import{S as Ze,_ as Qe,a as $e,b as et,c as tt,d as nt,f as rt,g as it,h as at,i as ot,l as st,m as ct,n as lt,p as ut,r as dt,s as ft,t as pt,u as mt,v as ht,x as gt,y as _t}from"./prove.js";import{basename as vt,delimiter as yt,dirname as bt,isAbsolute as xt,join as St,resolve as Ct}from"node:path";import{appendFileSync as wt,closeSync as Tt,cpSync as Et,existsSync as I,globSync as Dt,mkdirSync as Ot,openSync as kt,readFileSync as At,readSync as jt,readdirSync as Mt,realpathSync as Nt,renameSync as Pt,rmSync as Ft,statSync as It,writeFileSync as Lt}from"node:fs";import{pathToFileURL as Rt}from"node:url";import{spawnSync as zt}from"node:child_process";import{arch as Bt,availableParallelism as Vt,release as Ht,tmpdir as Ut,type as Wt}from"node:os";import{getHeapStatistics as Gt}from"node:v8";const Kt=`META-INF/MANIFEST.MF`,qt=async e=>{if(e===void 0||!I(e))return`master`;let t=await import(`fflate`),n=t.unzipSync(At(e),{filter:e=>e.name===Kt})[Kt];return(n&&/^X-Git-Tag: *(\S*)/m.exec(t.strFromU8(n))?.[1])===`v1.7.4`?`1.7.4`:`master`},Jt=/[*?[{]/,Yt=e=>e.flatMap(e=>Jt.test(e)?Dt(e).sort().map(e=>({path:e,isGlobbed:!0})):[{path:e,isGlobbed:!1}]),Xt=(e,t)=>e.map(e=>St(e,`${t}.tla`)).find(I),Zt=e=>t=>{let n=Xt(e,t);return n===void 0?void 0:At(n,`utf8`)},Qt=(e,t,n)=>console.error(`File does not exist: ${e}/${t} while looking in these directories: ${e}, ${n.join(`, `)}, classpath:/tla2sany/StandardModules, classpath:/`),$t=e=>`jar:file:${Rt(Ct(e)).pathname}!/tla2sany/StandardModules/`,en=e=>e instanceof o?_(e.code):t(e),tn=(e,t)=>{if(e instanceof O||e instanceof A){let n=He(e.message),r=e instanceof o?e.code:n&&!n.isEvalException?n.code:M.general;return t.print(r,F.error,Be(r,e.message,t.isTool))}console.error(`${e.name}: ${e.message}`)},nn=async(e,t=N({isTool:!1}))=>{try{return await e()}catch(e){if(!(e instanceof v))throw e;return tn(e,t),en(e)}},rn=(e,t,n)=>console.error(`File does not exist: ${xt(e)?e:`${process.cwd()}/${e}`} while looking in these directories: ${[...t,...n===void 0?[]:[$t(n)]].join(`, `)}`),an=e=>e.endsWith(`/`)?e:`${e}/`,on=(e,t)=>n=>{let r=e(n);return r===void 0&&!ye.has(n)&&t(`${n}.tla`),r},sn=e=>e.classPath?.split(yt).find(e=>e.endsWith(`.jar`));var cn=`0.0.10-dev.6b2a6741a`;const ln=2224400062,un={int8:0,int16:1,int32:2,shared8:4,shared16:5,shared32:6,block32:8,string8:9,string32:10,doubleLittle:12},dn={smallInt:64,smallString:32,smallBlock:128},L=(e,...t)=>({tag:e,fields:t}),fn=e=>typeof e==`object`&&`tag`in e,pn=(e,t)=>{let n=new DataView(e.buffer,e.byteOffset,e.byteLength);if(e.length<t+20||n.getUint32(t)!==ln)throw new x(`corrupted fingerprint file`);let r=t+20+n.getUint32(t+4),i=[],a=t+20,o=e=>{let t=a;if(a+=e,a>r)throw new x(`corrupted fingerprint file`);return t},s=new TextDecoder,c=t=>{let n=o(t),r=s.decode(e.subarray(n,n+t));return i.push(r),r},l=(e,t)=>{let n=L(e);t>0&&i.push(n);for(let e=0;e<t;e++)n.fields.push(d());return n},u=e=>i[i.length-e],d=()=>{let t=e[o(1)];if(t>=dn.smallBlock)return l(t&15,t>>4&7);if(t>=dn.smallInt)return t&63;if(t>=dn.smallString)return c(t&31);switch(t){case un.int8:return n.getInt8(o(1));case un.int16:return n.getInt16(o(2));case un.int32:return n.getInt32(o(4));case un.shared8:return u(n.getUint8(o(1)));case un.shared16:return u(n.getUint16(o(2)));case un.shared32:return u(n.getUint32(o(4)));case un.block32:{let e=n.getUint32(o(4));return l(e&255,e>>>10)}case un.string8:return c(n.getUint8(o(1)));case un.string32:return c(n.getUint32(o(4)));case un.doubleLittle:{let e={float:n.getFloat64(o(8),!0)};return i.push(e),e}}throw new x(`corrupted fingerprint file`)};return{value:d(),next:r}},mn=e=>{let t=[],n=0,r=0,i=0,a=(e,n)=>{for(let r=(n-1)*8;r>=0;r-=8)t.push(e>>>r&255)},o=new TextEncoder,s=e=>{if(typeof e==`number`)return e>=0&&e<64?t.push(dn.smallInt+e):e>=-128&&e<128?t.push(un.int8,e&255):e>=-32768&&e<32768?(t.push(un.int16),a(e,2)):(t.push(un.int32),a(e,4));if(n++,typeof e==`string`){let n=o.encode(e);n.length<32?t.push(dn.smallString+n.length):n.length<256?t.push(un.string8,n.length):(t.push(un.string32),a(n.length,4)),t.push(...n),r+=1+Math.floor((n.length+4)/4),i+=1+Math.floor((n.length+8)/8);return}if(!fn(e)){let n=/* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(8));n.setFloat64(0,e.float,!0),t.push(un.doubleLittle,...new Uint8Array(n.buffer)),r+=3,i+=2;return}let c=e.fields.length;c===0?n--:(r+=1+c,i+=1+c),e.tag<16&&c<8?t.push(dn.smallBlock+e.tag+(c<<4)):(t.push(un.block32),a(c*1024+e.tag,4)),e.fields.forEach(s)};s(e);let c=/* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(20));return[ln,t.length,n,r,i].forEach((e,t)=>c.setUint32(t*4,e)),new Uint8Array([...new Uint8Array(c.buffer),...t])},hn=20210223,gn=[...tt,`cooper`,`expandenabled`,`expandcdot`,`lambdify`,`enabledaxioms`,`levelcomparison`],_n={zenon:{field:1,tag:1},isabelle:{field:2,tag:0},cooper:{field:4,tag:3,isConstant:!0},smt:{field:10,tag:8},z3:{field:11,tag:9},ls4:{field:17,tag:16},expandenabled:{field:18,tag:6,isConstant:!0},expandcdot:{field:19,tag:8,isConstant:!0},lambdify:{field:20,tag:9,isConstant:!0},enabledaxioms:{field:21,tag:10,isConstant:!0},levelcomparison:{field:22,tag:11,isConstant:!0}},vn=[`false`,`timeout`],yn=`tla-ts ${cn}`,bn=/* @__PURE__ */ new Map([[_n.zenon.field,3],[_n.isabelle.field,4]]),xn=(e,t)=>e!==void 0&&fn(e)?e.fields[t]:void 0,Sn=e=>e!==void 0&&typeof e==`object`&&`float`in e?e.float:1/0,Cn=e=>{let t=new TextEncoder().encode(e),n=(e,t)=>e<<t|e>>>32-t,r=Array.from({length:Math.ceil(t.length/4)},(e,n)=>t[n*4]|t[n*4+1]<<8|t[n*4+2]<<16|t[n*4+3]<<24).reduce((e,t)=>{let r=Math.imul(n(Math.imul(t,3432918353),15),461845907);return Math.imul(n(e^r,13),5)+3864292196|0},0),i=Math.imul(r^t.length^(r^t.length)>>>16,2246822507),a=Math.imul(i^i>>>13,3266489909);return(a^a>>>16)&1073741823},wn=e=>e!==void 0&&fn(e)?[[e.fields[0],e.fields[1]],...wn(e.fields[2])]:[],Tn=(e,t,n)=>{let r=At(t),i=pn(r,0),a=pn(r,i.next).value;if(i.value!==hn||!fn(a)||a.tag!==0)throw new x(`corrupted fingerprint file`);let o=xn(xn(a,0),1),s=(e,t)=>{let r=bn.get(t);return!n||r===void 0||xn(xn(e,0),r)===yn};e.clear(),(o!==void 0&&fn(o)?o.fields:[]).flatMap(e=>wn(e).toReversed()).forEach(t=>{if(typeof t[0]!=`string`||!fn(t[1]))throw new x(`corrupted fingerprint file`);e.set(t[0],t[1].fields.map((e,t)=>s(e,t)?e:0))})},En=(e,t)=>{let n=xn(t,0),r=xn(n,0),i=xn(xn(n,1),0);if(r===void 0||r===1)return;let a=Sn(xn(e===`isabelle`?xn(i,0):i,0)),o=e===`isabelle`?xn(i,1):void 0,s=xn(xn(r,0),0);return{kind:`stored`,method:{prover:e,timeLimitMs:a*1e3,...typeof o==`string`&&{tactic:o}},isProved:r===0,...s!==void 0&&{reason:typeof s==`number`?vn[s]:String(xn(s,0))}}},Dn=(e,t)=>{let n=/* @__PURE__ */ new Date,r=t.method,i={float:mt(r)},a=e===`zenon`?L(0,i,5):e===`isabelle`?L(0,L(0,i),r.tactic??`auto`):L(0,i),o=ot(t),s=vn.indexOf(o??``),c=o===void 0?0:L(0,s===-1?L(0,o):s);return L(0,L(0,L(0,$e(t)?0:L(0,c),_n[e].isConstant?_n[e].tag:L(_n[e].tag,a)),L(0,n.getFullYear(),n.getMonth(),n.getDate(),n.getHours(),n.getMinutes(),n.getSeconds()),yn,yn,yn))},On=e=>{let t=2**Math.max(9,Math.ceil(Math.log2(e.size/2))),n=Array.from({length:t},()=>0);return e.forEach((e,r)=>{let i=Cn(r)&t-1;n[i]=L(0,r,L(0,...e),n[i])}),L(0,L(0,e.size,L(0,...n),0,512))},kn=e=>String(e).padStart(2,`0`),An=(e,t)=>{let n=/* @__PURE__ */ new Date,r=`${e}.history`,i=St(r,`${n.getFullYear()}-${kn(n.getMonth()+1)}-${kn(n.getDate())}_${kn(n.getHours())}_${kn(n.getMinutes())}_${kn(n.getSeconds())}`);Ot(i,{recursive:!0}),[e,...t].filter(e=>I(e)).forEach(e=>Et(e,St(i,vt(e)),{preserveTimestamps:!0})),Mt(r).map(e=>St(r,e)).sort((e,t)=>It(t).mtimeMs-It(e).mtimeMs).slice(10).forEach(e=>Ft(e,{recursive:!0,force:!0}))},jn=e=>{let t=/* @__PURE__ */ new Map,n=/* @__PURE__ */ new Map,r=new Map([...e].map(e=>{let r=new Map(gn.flatMap(n=>{let r=e[1][_n[n].field],i=En(n,xn(r,0));return i?(t.set(i,r),[[n,i]]):[]}));return n.set(r,e[1]),[e[0],r]}));return{results:r,save:i=>{e.clear(),r.forEach((r,i)=>{let a=[...n.get(r)??Array(23).fill(0)];gn.forEach(e=>{let n=r.get(e);n&&(a[_n[e].field]=t.get(n)??Dn(e,n))}),e.set(i,a)}),Lt(`${i}.tmp`,Buffer.concat([mn(hn),mn(On(e))])),Pt(`${i}.tmp`,i)}}},Mn=((e,t)=>{let n=new Map(t.map(e=>{let[t,...n]=e.flag.split(` `);return[t,n.length]}));return{usage:e.replace(`{options}`,t.map(e=>`[${e.flag}]${e.isRepeatable?`...`:``}`).join(` `)),parse:e=>{let t=[],r=[],i=[];for(let a=0;a<e.length;a++){let o=n.get(e[a]);o===void 0?(e[a].startsWith(`-`)?i:r).push(e[a]):(t.push({name:e[a],values:e.slice(a+1,a+1+o)}),a+=o)}return{options:t,positionals:r,unknown:i,incomplete:t.find(e=>e.values.length<(n.get(e.name)??0)),has:e=>t.some(t=>t.name===e),get:e=>t.findLast(t=>t.name===e)?.values}}}})(`tla-ts tlapm {options} <Module.tla|glob>...`,[{flag:`-N`},{flag:`--summary`},{flag:`--strict`},{flag:`--toolbox <start> <end>`},{flag:`--line <num>`},{flag:`--printallobs`},{flag:`--threads <num>`},{flag:`--version`},{flag:`-I <directory>`,isRepeatable:!0},{flag:`-k`},{flag:`--noproving`},{flag:`--nofp`},{flag:`--nofpl <start> <end>`},{flag:`--safefp`},{flag:`--cleanfp`},{flag:`--usefp <file>`},{flag:`--cache-dir <directory>`},{flag:`--debug <flags>`,isRepeatable:!0},{flag:`--method <methods>`},{flag:`--solver <command>`},{flag:`--smt-logic <logic>`},{flag:`--stretch <factor>`},{flag:`--noflatten`}]),Nn=[`Usage: tla-ts <Spec.tla|Spec.cfg|spec.ts|glob>... [-config <Spec.cfg>] [-continue] [-deadlock] [-dump [<format>] <file>] [-fp <num>] [-lncheck <final|default|off>] [-maxSetSize <num>] [-metadir <directory>] [-nowarning] [-seed <num>] [-terse] [-tool] [-view] [-workers <count|auto>]`,` ${Mn.usage}`,` tla-ts [<JVM option>]... tlc2.TLC <TLC option>... <Spec>`,` (-cp tla2tools.jar or -Dtla-ts.tlc=1.7.4 picks the TLC to reproduce)`,` tla-ts [<JVM option>]... tla2sany.xml.XMLExporter [-I <directory>]... [-o] [-t] [-r] [-u] <Module.tla>`].join(`
|
|
10
10
|
`),Pn={name:``,values:[],doc:` `},Fn=[Pn,{name:`(basic options)`,values:[],doc:` `},Pn,{name:`--help`,values:[],doc:` show this help message and exit`},{name:`-help`,values:[],doc:` (same as --help)`},{name:`--version`,values:[],doc:` show version number and exit`},{name:`--verbose`,values:[],doc:` produce verbose messages`},{name:`-v`,values:[],doc:` (same as --verbose)`},Pn,{name:`--where`,values:[],doc:` show location of standard library and exit`},{name:`--config`,values:[],doc:` show configuration and exit`},{name:`--summary`,values:[],doc:` show summary of theorems (implies -N and not -C)`},{name:`--strict`,values:[],doc:` report incomplete proofs, empty proof targets and failed obligations as errors and exit with a non-zero status`},{name:`--timing`,values:[],doc:` show runtime statistics`},Pn,{name:`-I`,values:[`string`],doc:`<dir> add <dir> to search path`},{name:`-d`,values:[`string`],doc:``},Pn,{name:`-k`,values:[],doc:` keep going on backend failures`},{name:`-N`,values:[],doc:` do not run any backend verifiers`},{name:`-C`,values:[],doc:` check proofs in Isabelle/TLA+`},Pn,{name:`--threads`,values:[`int`],doc:`<int> set number of worker threads to <int>`},{name:`--method`,values:[`string`],doc:`<meth> set default method to <meth> (try --method help)`},{name:`--solver`,values:[`string`],doc:`<solver> set SMT solver to <solver>`},{name:`--smt-logic`,values:[`string`],doc:`<logic> set SMT logic to <logic>`},{name:`--stretch`,values:[`float`],doc:`<f> multiply all timeouts by <f>`},{name:`--fast-isabelle`,values:[],doc:``},Pn,{name:`(advanced options)`,values:[],doc:` `},Pn,{name:`--noflatten`,values:[],doc:` do not flatten obligations`},{name:`--nonormal`,values:[],doc:` do not normalize obligations before printing`},{name:`--debug`,values:[`string`],doc:`{[-]<flag>} enable/disable debugging flags`},{name:`--paranoid`,values:[],doc:``},{name:`--isaprove`,values:[],doc:``},Pn,{name:`--toolbox`,values:[`int`,`int`],doc:`<int><int> toolbox mode`},{name:`--toolbox-vsn`,values:[`int`],doc:`<int> Toolbox protocol version, 1|2, 1 by default.`},{name:`--line`,values:[`int`],doc:`<int> line to prove`},{name:`--wait`,values:[`int`],doc:`<time> wait for <time> before printing obligations in progress`},{name:`--stdin`,values:[],doc:` read the tla file from stdin instead of file system. Only applies if single tla file is provided as input.`},{name:`--prefer-stdlib`,values:[],doc:` prefer built-in standard modules if the module search path contains files with the same names as modules in stdlib.`},{name:`--parser`,values:[`string`],doc:` Set parser backend to use: TLAPM (default) or SANY.`},{name:`--module-jar`,values:[`string`],doc:` Add a path to a .jar file containing additional TLA+ modules, such
|
|
11
11
|
as the community modules. Multiple .jar files can be added by using
|
|
12
12
|
this option multiple times.`},{name:`--noproving`,values:[],doc:` do not prove, report fingerprinted results only`},Pn,{name:`--printallobs`,values:[],doc:` print obligations in all toolbox messages`},Pn,{name:`--fpdir`,values:[`string`],doc:``},{name:`--safefp`,values:[],doc:` check tlapm, zenon, Isabelle versions for fingerprints`},{name:`--nofp`,values:[],doc:` do not use existing fingerprints, but overwrite any preexisting fingerprints associated with the current proof obligations, using the newly computed fingerprints and results`},{name:`--nofpl`,values:[`int`,`int`],doc:`<int><int> disable fingerprint use between given lines`},{name:`--cleanfp`,values:[],doc:` erase fingerprint file before starting`},Pn,{name:`--erasefp`,values:[`string`,`string`],doc:`<f><back> erase from file <f> all results of backend <back>`},{name:`--printfp`,values:[`string`],doc:`<f> print the fingerprints stored in file <f> and quit`},{name:`--usefp`,values:[`string`],doc:`<f> load fingerprints from file <f> (save as usual)`},{name:`--fpp`,values:[],doc:` print the fingerprints of obligations in toolbox messages`},{name:`--cache-dir`,values:[`string`],doc:'<directory> save auxiliary and temporary files under <directory>. Alternatively, this directory can be defined via the variable `TLAPM_CACHE_DIR` of the runtime environment. The command-line parameter takes precedence over the environment variable. If neither is specified, the default value is ".tlacache".'}],In=e=>/^[^ ]* */.exec(e)?.[0].length??0,Ln=()=>{let e=Math.max(...Fn.map(e=>e.name.length+In(e.doc)));return`Usage: tla-ts tlapm <options> FILE ...\noptions are:\n${Fn.filter(e=>e.doc!==``).map(t=>{let n=In(t.doc);return` ${t.name} ${t.doc.slice(0,n)}${` `.repeat(e-t.name.length-n)}${t.doc.slice(n)}\n`}).join(``)}`},Rn=e=>{for(let t=0;t<e.length;t++){let n=e[t];if(n===`--version`)return;if(!n.startsWith(`-`))continue;let r=Fn.find(e=>e.name===n);if(!r)return`unknown option '${n}'`;for(let i of r.values){if(t++,t===e.length)return`option '${n}' needs an argument`;let r=e[t];if(i===`int`&&ut(r)===void 0)return`wrong argument '${r}'; option '${n}' expects an integer`;if(i===`float`&&rt(r)===void 0)return`wrong argument '${r}'; option '${n}' expects a float`}let i=e[t];if(n===`--threads`&&(ut(i)??0)<0)return`--threads requires a positive argument`;if(n===`--debug`&&i.split(`,`).includes(`oldsmt`))return`--debug oldsmt: the old SMT encoding has been removed`;if(n===`--method`)try{nt(i)}catch(e){if(!(e instanceof u))throw e;return e.message}}},zn=t=>[`.`,...e().map(e=>St(bt(bt(Nt(e))),`lib/tlapm/stdlib`)).filter(I).slice(0,1),...t.options.flatMap(e=>e.name===`-I`?e.values:[]).toReversed()],Bn=e=>console.error(`@!!BEGIN\n${e.map(e=>`@!!${e}\n`).join(``)}@!!END\n`),Vn=(e,t,n)=>Bn([`type:obligation`,`id:${e.id}`,`loc:${e.location}`,`status:${t}`,...n]),Hn=e=>/^[+,\-./0-9:=@A-Z_a-z]+$/.test(e)?e:`'${e.replaceAll(`'`,`'\\''`)}'`,Un={failed:10,incomplete:11,emptyTarget:12},Wn=(e,t,n)=>{let r=e.summary;n||(r.absent.forEach(e=>console.error(`Missing proof at ${gt(e)}`)),r.omitted.forEach(e=>console.error(`Omitted proof at ${gt(e)}`)));let i=r.absent.length+r.omitted.length>0;i&&console.error(`${et(e.location)}[ERROR]: Proof incomplete in module ${JSON.stringify(e.name)}: ${r.absent.length} missing, ${r.omitted.length} omitted proof step(s).`);let a=t&&e.obligations.length===0;return a&&console.error(`${et(e.location)}[ERROR]: No proof obligation found for the selected target.`),[...i?[Un.incomplete]:[],...a?[Un.emptyTarget]:[]]},Gn=(e,t,n)=>{console.error(` tlapm ending abnormally with ${e.exception}\n`),n&&Bn(t.message===``?[`type:error`,`url:http://tla.msr-inria.inria.fr/bugs`,`msg:Oops, this seems to be a bug in TLAPM.\nPlease give feedback to developers.\n\n\n ${e.exception}\n`]:[`type:warning`,`msg:${t.location===void 0?``:`${t.location}\n\n`}${t.message}`])},Kn=e=>{if(!(e instanceof x))throw e;return{kind:`aborted`,error:e}},qn=e=>{try{return{kind:`done`,value:e()}}catch(e){return Kn(e)}},Jn=(e,t,n)=>{let r=t.method.timeLimitMs,i=t.kind===`decided`?`; time-used: ${(t.timeUsedMs/1e3).toFixed(1)} (${Math.round(100*t.timeUsedMs/r)}%)`:``,a=r===0?``:`time-limit: ${r===1/0?`inf`:Number((r/1e3).toPrecision(6))}${i}`,o=[t.method.tactic,a].filter(Boolean).join(`; `),s=ot(t),c=$e(t),l=t.kind===`reused`,u=t.kind===`decided`?t.note:t.kind===`refused`?`${t.reason}\nObligation:\n\n`:t.kind===`unavailable`?`\n\\* ${t.warning}\n`:void 0,d=t.kind===`unavailable`||l?t.shipped:void 0;Vn(e,c?`proved`:`failed`,[`prover:${t.method.prover}`,...o===``?[]:[`meth:${o}`],...s===void 0?[]:[`reason:${s}`],`already:${l}`,...c?[]:[`obl:${l?``:u??`
|
|
@@ -29,12 +29,12 @@ Called from Tlapm_lib.init in file "src/tlapm_lib.ml", line 659, characters 8-59
|
|
|
29
29
|
`&&Wr(t),Or(i)},ri=(e,t,n)=>ni(e,t,!0,n),ii=(e,t)=>(ni(e,t,!1,!1),e.delimiter),ai=(e,t)=>({params:e,tokenizer:ti(),lookahead:{tokens:Array.from({length:10},()=>``),columns:Array.from({length:10},()=>0),lines:Array.from({length:10},()=>0)},lastToken:{column:0,line:0,text:``},isInMacro:!1,log:t}),oi=()=>Or([[wr(`defaultInitValue`,0,0)]]),si=(e,t)=>[...e,...t.filter((n,r)=>!e.includes(n)&&t.indexOf(n)===r)],ci=(e,t)=>!t.some(t=>e.includes(t)),li=(e,t)=>{t.splice(0,t.length,...e)},ui=(e,t,n)=>{let r=e.params,i=e.lookahead,a=e.lastToken,o=0,s=[],c=[],l=1,u=/* @__PURE__ */ new Set,d=!1,f=!1,p,m=[],h=!1,g=[],_=[],v=[],b=!1,x=!1,S=r.inputVersionNumber>=1500,C=e=>{throw new D(`${e}\n line ${a.line}, column ${a.column}`)},T=()=>{if(o===0)return Gr(t),a.column=t.vcolumn+1,a.line=t.line+1,a.text=ii(e.tokenizer,t),a.text;a.column=i.columns[0]+1,a.line=i.lines[0]+1;let n=i.tokens[0];for(let e=1;e<o;e++)i.tokens[e-1]=i.tokens[e],i.columns[e-1]=i.columns[e],i.lines[e-1]=i.lines[e];return--o,a.text=n,n},E=n=>{for(;o<n;){let n=o;if(Gr(t)===` `)throw new D(`Premature end of file, perhaps because of unclosed comment, near\n line ${i.lines[n]+1}, column ${i.columns[n]+1}`);i.columns[n]=t.vcolumn,i.lines[n]=t.line,i.tokens[n]=ii(e.tokenizer,t),o+=1}return i.tokens[n-1]},ee=n=>{if(n<o)throw new w(`ParseAlgorithm.PeekPastAlgToken called to peek after a token
|
|
30
30
|
it has already peeked at`);for(;n>o;)i.tokens[o]=ii(e.tokenizer,t),o+=1;return Gr(t)},O=(n=!1)=>{if(o!==0)throw new w(`ParseAlgorithm: GetExpr called after lookahead`);let r=ri(e.tokenizer,t,n);return i.tokens[0]=e.tokenizer.delimiter,i.columns[0]=e.tokenizer.delimiterCol,i.lines[0]=e.tokenizer.delimiterLine,o=1,r},k=(e,t)=>{let n=T();n!==e&&n!==t&&C(`Expected "${e}" but found "${n}"`)},A=(e,t)=>{if(e===`;`){let e=E(1);if(`end begin else elsif or do macro procedure process fair define } {`.split(` `).includes(e))return;if(`if either while with call return goto print assert skip`.split(` `).includes(e))throw new D(`Missing \`;' before line ${i.lines[0]+1}, column ${i.columns[0]+1}`)}k(e,t)},te=()=>{let e=T();return e===`=`?!0:e===`\\in`||e===`∈`?!1:C(`Expected "=" or "\\in" but found "${e}"`)},ne=()=>A(E(1)===`,`?`,`:`;`),re=()=>A(h?`{`:`begin`),ie=e=>{h?A(`}`):(A(`end`),A(e))},ae=()=>{E(1)===`variables`?k(`variables`):A(`variable`)},oe=()=>{let e={...R(),kind:`VarDecl`,var:T(),col:a.column,line:a.line,isEq:!0,val:oi()};if(![`=`,`\\in`,`∈`].includes(E(1)))return f=!0,e;if(e.isEq=te(),e.val=O(),e.val.tokens.length===0)throw new y(`NullPointerException`);return e},se=()=>{ae();let e=[],t=[`begin`,`{`,`procedure`,`process`,`fair`,`define`,`macro`];for(;!t.includes(E(1));)e.push(oe()),ne();return e},ce=()=>{let e={...R(),kind:`PVarDecl`,var:T(),col:a.column,line:a.line,val:oi()};if(E(1)!==`=`)return f=!0,e;if(A(`=`),e.val=O(),e.val.tokens.length===0)throw new y(`NullPointerException`);return e},le=()=>{ae();let e=[];for(;E(1)!==`begin`&&E(1)!==`{`;)e.push(ce()),ne();return e},ue=()=>{if(`while if assert print else elsif either or end with when await skip call return goto`.split(` `).includes(E(1)))return!1;let e=Gr(t);return e.length>0&&e[0]===`:`&&!(e.length>1&&e[1]===`=`)},de=()=>{if(!ue())return``;let t=T();e.isInMacro&&C(`A label may not appear in a macro.`),t===`Done`&&C("Cannot use `Done' as a label."),t===`Error`&&C("Cannot use `Error' as a label."),A(`:`),d=!0,u.add(t);let n=E(1);return n!==`+`&&n!==`-`||(A(n),(n===`+`?g:_).push(t),S=!1),t},j=()=>{let e=[],t=e=>!h&&[`end`,`else`,`elsif`,`or`].includes(e)||h&&e===`}`;for(;!t(E(1));)e.push(...pe());return h&&e.length===0&&C(`Empty statement list`),e},fe=e=>{k(`{`);let t=j();if(A(`}`),A(`;`),e!==``){if(t[0].lbl!==``)throw new D(`Duplicate labeling of statement`,t[0]);t[0].lbl=e}return t},pe=()=>{let e=de();if(h&&E(1)===`{`)return fe(e);let t=me();return t.lbl=e,[t]},me=()=>{let e=E(1);if(e===`if`)return ge(0);if(e===`either`)return _e();if(e===`with`)return ve(0);if(e===`when`||e===`await`){k(e);let t=a.column,n=a.line,r=O();if(r.tokens.length===0)throw new y(`NullPointerException`);return A(`;`),{...R(),kind:`When`,col:t,line:n,exp:r}}if(e===`print`||e===`assert`){k(e);let t=a.column,n=a.line,r=O();return r.tokens.length===0&&C(`Empty expression in ${e} statement at `),A(`;`),{...R(),kind:e===`print`?`PrintS`:`Assert`,col:t,line:n,exp:r}}if(e===`skip`){k(`skip`);let e={...R(),kind:`Skip`,col:a.column,line:a.line};return A(`;`),e}if(e===`call`)return Se();if(e===`return`){k(`return`);let e={...R(),kind:`Return`,col:a.column,line:a.line,from:p};return A(`;`),e}if(e===`goto`){k(`goto`);let e=a.column,t=a.line,n=T();return b=!0,(n===`Done`||n===`"Done"`)&&(x=!0),A(`;`),{...R(),kind:`Goto`,col:e,line:t,to:n}}return e===`while`?he():ee(1)[0]===`(`?Ce():be()},he=()=>{k(`while`);let e=a.column,t=a.line;h&&A(`(`);let n=O();h&&A(`)`),n.tokens.length===0&&C(`Empty while test at `),h||A(`do`);let r=h?pe():j();return h||(A(`end`),A(`while`),A(`;`)),r.length===0&&C(`Missing body of while statement at`),{...R(),kind:`While`,col:e,line:t,test:n,unlabDo:r,labDo:[]}},ge=e=>{k(e===0?`if`:`elsif`);let t={...R(),kind:`LabelIf`,col:a.column,line:a.line,test:Er(),unlabThen:[],labThen:[],unlabElse:[],labElse:[]};h&&A(`(`),t.test=O(),h&&A(`)`),t.test.tokens.length===0&&C(`Empty if test at `),h||A(`then`),t.unlabThen=h?pe():j();let n=E(1);return n===`else`&&(k(`else`),t.unlabElse=h?pe():j()),!h&&n===`elsif`&&(t.unlabElse=[ge(e+1)]),!h&&![`else`,`elsif`,`end`].includes(n)&&C(`Expecting "else", "elsif", or "end"`),!h&&e===0&&(A(`end`),A(`if`),A(`;`)),t.unlabElse.length===0&&Cr(t.unlabThen,t.unlabThen.length-1),t},_e=()=>{k(`either`);let e={...R(),kind:`LabelEither`,col:a.column,line:a.line,clauses:[]};for(;;){let t={...R(),kind:`Clause`,unlabOr:h?pe():j(),labOr:[]};if(t.unlabOr.length===0)throw new D("`either' statement with empty `or' clause",e);if(e.clauses.push(t),E(1)!==`or`)break;k(`or`)}if(h||(k(`end`),A(`either`),A(`;`)),e.clauses.length===1)throw new D("`either' statement has no `or'",e);return e},ve=e=>{e===0&&(A(`with`),h&&A(`(`));let t={...R(),kind:`With`,col:a.column,line:a.line,var:T(),isEq:!0,exp:Er(),Do:[]};t.isEq=te(),t.exp=O(),h&&E(1)===`)`||ne(),t.exp.tokens.length===0&&C(`Empty with expression at `);let n=!h&&E(1)===`do`,r=h&&E(1)===`)`;if(n&&A(`do`),r&&k(`)`),t.Do=n?j():r?pe():[ve(e+1)],n&&(A(`end`),A(`with`),A(`;`)),t.Do.length===0)throw new D(`Missing body of with statement`,t);return t},ye=()=>{let e=i.columns[0]+1,t=i.lines[0]+1,n={...R(),kind:`Lhs`,col:e,line:t,var:T(),sub:O()};A(`:=`,`≔`);let r=O();return r.tokens.length===0&&C(`Empty right-hand side of assignment at `),{...R(),kind:`SingleAssign`,col:e,line:t,lhs:n,rhs:r}},be=()=>{let e={...R(),kind:`Assign`,col:i.columns[0]+1,line:i.lines[0]+1,ass:[ye()]};for(;E(1)===`||`||E(1)===`‖`;){T();try{e.ass.push(ye())}catch(e){if(!(e instanceof D))throw e;C(`Bad assignment statement at `)}}return A(`;`),e},M=()=>{let e=[];if(ee(0)[0]!==`)`)for(;;){let t=O();if(e.push(t),t.tokens.length===0&&C(`Empty argument in call statement at `),E(1)===`)`)break;A(`,`)}return A(`)`),A(`;`),e},xe=()=>{k(`call`);let e={...R(),kind:`Call`,col:a.column,line:a.line,returnTo:``,to:T(),args:[]};return A(`(`),e.args=M(),v.includes(e.to)||v.push(e.to),e},Se=()=>{let e=xe();if(E(1)===`return`)return k(`return`),A(`;`),{...R(),kind:`CallReturn`,col:e.col,line:e.line,to:e.to,from:p,args:e.args};if(E(1)!==`goto`)return e;k(`goto`);let t={...R(),kind:`CallGoto`,col:e.col,line:e.line,to:e.to,after:T(),args:e.args};return b=!0,(t.to===`Done`||t.to===`"Done"`)&&(x=!0),A(`;`),t},Ce=()=>{let e={...R(),kind:`MacroCall`,name:T(),col:a.column,line:a.line,args:[]};return k(`(`),e.args=M(),e},we=t=>{e.isInMacro=!0,k(`macro`);let n={...R(),kind:`Macro`,col:a.column,line:a.line,name:T(),params:[],body:[]};for(A(`(`);E(1)!==`)`;)n.params.length>0&&A(`,`),n.params.push(T());return k(`)`),re(),n.body=j(),ie(`macro`),E(1)===`;`&&T(),Fe(n.body,t),e.isInMacro=!1,n},Te=()=>{A(`procedure`);let e={...R(),kind:`Procedure`,col:a.column,line:a.line,name:T(),minusLabels:[],plusLabels:[],proceduresCalled:[],params:[],decls:[],body:[]};for(p=e.name,g=[],_=[],v=[],A(`(`);E(1)!==`)`;)e.params.length>0&&A(`,`),e.params.push(ce());return k(`)`),E(1)!==`begin`&&E(1)!==`{`&&(e.decls=le()),re(),e.body=j(),ie(`procedure`),E(1)===`;`&&T(),p=void 0,e.plusLabels=g,e.minusLabels=_,e.proceduresCalled=v,e},Ee=()=>{A(`process`);let e=a.column,t=a.line;h&&A(`(`);let n=T(),r=te(),i=O();g=[],_=[],v=[],h&&A(`)`),i.tokens.length===0&&C(`Empty process id at `);let o=E(1)===`begin`||E(1)===`{`?[]:se();re();let s=j();return ie(`process`),E(1)===`;`&&T(),{...R(),kind:`Process`,col:e,line:t,name:n,fairness:0,minusLabels:_,plusLabels:g,proceduresCalled:v,isEq:r,id:i,decls:o,body:s}},De=()=>{let e=`${r.labelRoot}${l}`;return l+=1,u.has(e)?De():e},Oe=e=>{e.lbl===``&&(e.lbl=De(),s.push(e.lbl),c.push(xr(e)))},ke=(e,t,n,r,i)=>{li(r,i);let a=t,o=!1,s=e=>{Oe(e),o=!0,i.length=0};return e.forEach(e=>{if(e.lbl!==``&&(o=!0,i.length=0,n))throw new D("Label in `with' statement",e);if(a){if(n)throw new D("Statement follows `call' or `return' inside a `with' statement.",e);s(e),a=!1}switch(e.kind){case`LabelIf`:{let t=[],r=[],o=ke(e.unlabThen,!1,n,i,t);a=ke(e.unlabElse,!1,n,i,r)||o,li(si(t,r),i);return}case`LabelEither`:{let t=[];e.clauses.forEach(e=>{let r=[];a=ke(e.unlabOr,!1,n,i,r)||a,li(si(r,t),t)}),li(t,i);return}case`While`:if(n)throw new D("`while' inside a `with' statement",e);s(e),ke(e.unlabDo,!1,!1,i,[]),a=!1;return;case`With`:{let t=[];a=ke(e.Do,!1,!0,n?[...r]:[],t),li(t,i),!n&&!ci(r,i)&&s(e);return}}let t=e.kind===`Call`||e.kind===`CallGoto`,c=e.kind===`Return`||e.kind===`CallReturn`,l=e.kind===`Assign`?si([],e.ass.map(e=>e.lhs.var)):t||c?[`stack`,...c||e.to===p?m.flatMap(e=>[...e.params,...e.decls].map(e=>e.var)):[]]:[];if(a=t||c||e.kind===`Goto`,ci(i,l))li(si(i,l),i);else{if(n)throw new D(e.kind===`Assign`?"Second assignment to same variable inside a `with' statement":"Call or return makes second assignment to a variable inside a `with' statement",e);s(e),li(l,i)}}),o||a},Ae=e=>{let t=e=>{let t=e.findIndex(e=>e.lbl!==``),n=t===-1?e:e.slice(0,t);return Ae(n),{unlabeled:n,labeled:je(t===-1?[]:e.slice(t))}};e.forEach(e=>{switch(e.kind){case`LabelIf`:{let n=t(e.unlabThen);e.unlabThen=n.unlabeled,e.labThen=n.labeled;let r=t(e.unlabElse);e.unlabElse=r.unlabeled,e.labElse=r.labeled;return}case`LabelEither`:e.clauses.forEach(e=>{let n=t(e.unlabOr);e.unlabOr=n.unlabeled,e.labOr=n.labeled});return;case`While`:{let n=t(e.unlabDo);e.unlabDo=n.unlabeled,e.labDo=n.labeled}}})},je=e=>{let t=[];return e.forEach(e=>{if(e.lbl===``&&t.length>0)t[t.length-1].stmts.push(e);else{if(e.lbl===``)throw new w(`Failure of assertion: Missing Label in MakeLabeledStmtSeq`);t.push({...R(),kind:`LabeledStmt`,col:e.col,line:e.line,macroCol:e.macroCol,macroLine:e.macroLine,label:e.lbl,stmts:[e]})}}),t.forEach(e=>Ae(e.stmts)),t},Me=(e,t)=>{let n=e[t];switch(n.kind){case`LabelIf`:{let r=N(n.unlabThen);n.labThen.forEach(e=>N(e.stmts));let i=N(n.unlabElse);return n.labElse.forEach(e=>N(e.stmts)),n.labThen.length>0||n.labElse.length>0||r===2||i===2?2:(e[t]={...R(),kind:`If`,test:n.test,Then:n.unlabThen,Else:n.unlabElse},+(r+i>0))}case`LabelEither`:{let r=n.clauses.reduce((e,t)=>{let n=Math.max(e,N(t.unlabOr));return t.labOr.forEach(e=>N(e.stmts)),t.labOr.length>0?2:n},0);return r===2?2:(e[t]={...R(),kind:`Either`,ors:n.clauses.map(e=>e.unlabOr)},r)}case`With`:{let e=N(n.Do);if(e===2)throw new D(`with statement at ${xr(n)} contains a labeled statement`);return e}case`While`:if(t!==0)throw new w("ParseAlgorithm.ClassifyStmtSeq encountered `while' not at beginning of StmtSeq.");return N(n.unlabDo),n.labDo.forEach(e=>N(e.stmts)),0;case`Call`:return e[t+1]?.kind===`Return`?0:1;case`Return`:case`CallReturn`:if(p===void 0)throw new D(`return statement not in a procedure at ${xr(n)}`);return 1;case`Goto`:case`CallGoto`:return 1;case`Assign`:case`When`:case`PrintS`:case`Assert`:case`Skip`:case`MacroCall`:return 0;default:throw new w(`ParseAlgorithm.ClassifyStmtSeq encountered the unexpected statement type ${n.kind}`)}},N=e=>{for(let t=0;t<e.length;t++){let n=Me(e,t);if(n!==0){if(t===e.length-1)return n;throw new w(`Translator discovered later than it should have that\n Statement at ${xr(e[t+1])} must have a label`)}}return 0},Ne=e=>{ke(e,!0,!1,[],[]);let t=je(e);return t.forEach(e=>N(e.stmts)),t},P=(e,t,n,r,i)=>{let a=e=>Rr(e,t,n),o=e=>e.map(e=>P(e,t,n,r,i)),s=e=>e.map(e=>({...R(),kind:`LabeledStmt`,label:e.label,stmts:e.stmts.map(e=>P(e,t,n,-1,0))})),c={...R(),col:e.col,line:e.line,macroCol:r>0?i:e.macroCol,macroLine:r>0?r:e.macroLine};switch(e.kind){case`Assign`:return{...c,kind:`Assign`,ass:e.ass.map(e=>Pe(e,t,n,r,i))};case`If`:return{...c,kind:`If`,test:a(e.test),Then:o(e.Then),Else:o(e.Else)};case`Either`:return{...c,kind:`Either`,ors:e.ors.map(o)};case`With`:return{...c,kind:`With`,var:e.var,isEq:e.isEq,exp:a(e.exp),Do:o(e.Do)};case`When`:case`Assert`:case`PrintS`:return{...c,kind:e.kind,exp:a(e.exp)};case`Skip`:return{...c,kind:`Skip`,macroCol:r>0?i:0,macroLine:r>0?r:-1};case`While`:return{...c,kind:`While`,test:a(e.test),unlabDo:o(e.unlabDo),labDo:s(e.labDo)};case`LabelIf`:return{...c,kind:`LabelIf`,test:a(e.test),unlabThen:o(e.unlabThen),labThen:s(e.labThen),unlabElse:o(e.unlabElse),labElse:s(e.labElse)};case`LabelEither`:return{...c,kind:`LabelEither`,clauses:e.clauses.map(e=>({...R(),kind:`Clause`,labOr:s(e.labOr),unlabOr:o(e.unlabOr)}))};case`Call`:return{...c,kind:`Call`,to:e.to,returnTo:e.returnTo,args:zr(e.args,t,n)};case`Return`:return{...c,kind:`Return`,from:e.from};case`CallReturn`:return{...c,kind:`CallReturn`,to:e.to,from:e.from,args:zr(e.args,t,n)};case`CallGoto`:return{...c,kind:`CallGoto`,to:e.to,after:e.after,args:zr(e.args,t,n)};case`Goto`:return{...c,kind:`Goto`,to:e.to};default:throw new w(`Found unexpected statement type in macro at${xr(e)}`)}},Pe=(e,t,n,r,i)=>{let a=Rr(e.rhs,t,n),o={...R(),kind:`Lhs`,var:e.lhs.var,sub:e.lhs.sub.tokens.length===0?e.lhs.sub:Rr(e.lhs.sub,t,n)},s={...R(),kind:`SingleAssign`,col:e.col,line:e.line,macroCol:r>0?i:e.macroCol,macroLine:r>0?r:e.macroLine,lhs:o,rhs:a},c=n.indexOf(o.var);if(c===-1)return s;let l=t[c],u=Nr(l,{line:0,item:0});if(u.type!==_r.ident)throw new D(`Macro expansion substitutes \`${u.string}' for assignment variable\n at ${xr(s)}`);if(o.var=u.string,Pr(l,{line:0,item:0},1)===void 0)return s;let d=Ar(l);return d.tokens[0].splice(0,1),Dr(d),o.sub.tokens.length===0?o.sub=d:jr(o.sub,d,0),s},Fe=(e,t)=>{let n=e.flatMap(e=>{switch(e.kind){case`LabelIf`:return Fe(e.unlabThen,t),Fe(e.unlabElse,t),[e];case`LabelEither`:return e.clauses.forEach(e=>Fe(e.unlabOr,t)),[e];case`With`:return Fe(e.Do,t),[e];case`While`:return Fe(e.unlabDo,t),[e];case`MacroCall`:return Ie(e,t);default:return[e]}});e.splice(0,e.length,...n)},Ie=(e,t)=>{let n=t.findLast(t=>t.name===e.name);if(n===void 0)throw new D(`Macro ${e.name} undefined,\n at ${xr(e)}`);if(n.params.length!==e.args.length)throw new D(`Macro ${e.name} called with wrong number of arguments at \n ${xr(e)}`);let r=n.body.map(t=>P(t,e.args,n.params,e.line,e.col));return r.length>0&&(r[0].lbl=e.lbl),r},Le=e=>{e.forEach((t,n)=>{if(e.slice(n+1).some(e=>e.name===t.name))throw new D(`Multiple definitions of macro name \`${t.name}'`)})},Re=e=>{if(e.length===0)return;let t=()=>{S=!1},n=e[0];if(e.length>1||n.kind!==`LabeledStmt`)return t();if(n.stmts.length===0)return;let r=n.stmts[0];if(n.stmts.length>1||r.kind!==`While`||!Mr(r.test)||r.test.tokens[0][0].string!==`TRUE`)return t();r.labDo.length>0&&(S=!1),r.unlabDo.some(e=>[`LabelIf`,`LabelEither`,`LabeledStmt`].includes(e.kind))&&(S=!1)},ze=()=>{let e=s.length>1?`Missing labels at the following locations:`:`Missing label at the following location:`;throw new D([e,...c].join(`
|
|
31
31
|
`))},Be=e=>m.forEach(t=>{p=t.name,Fe(t.body,e),t.body=Ne(t.body)}),Ve=()=>{n&&T()!==`algorithm`&&C("`--fair' not followed by `algorithm'");let t=T();h=E(1)===`{`,h&&k(`{`);let i=E(1)===`variable`||E(1)===`variables`?se():[],a=Er();E(1)===`define`&&(k(`define`),h&&A(`{`),a=O(!0),ie(`define`),A(`;`));let o=[];for(;E(1)===`macro`;)o.push(we(o));for(;E(1)===`procedure`;)m.push(Te()),S=!1;if(E(1)===`fair`&&(E(2)===`process`||E(2)===`+`&&E(3)===`process`)||E(1)===`process`){let n=[];for(;E(1)===`fair`||E(1)===`process`;){let e=E(1)===`fair`;e&&k(`fair`);let t=e&&E(1)===`+`;t&&k(`+`);let i=t||!e&&r.fairnessOption===`sf`?2:e||r.fairnessOption===`wf`?1:0;n.push({...Ee(),fairness:i})}return ie(`algorithm`),Le(o),n.forEach(e=>{Fe(e.body,o),e.body=Ne(e.body),Re(e.body)}),Be(o),s.length>0&&(r.labelFlag||ze(),e.log(`Labels added.`)),(x||b)&&(S=!1),{...R(),kind:`Multiprocess`,name:t,decls:i,defs:a,macros:o,prcds:m,procs:n}}r.inputVersionNumber===1500&&E(1)===`fair`&&(A(`fair`),E(1)===`+`&&A(`+`),r.fairnessOption=`wf`),n&&([``,`wf`,`wfNext`].includes(r.fairnessOption)||e.log(`Warning: Option \`${r.fairnessOption}' specified for --fair algorithm.`),r.fairnessOption=`wf`),re();let c=j();Le(o),Fe(c,o),Be(o),h&&A(`}`),ie(`algorithm`);let l=Ne(c);return s.length>0&&(d&&!r.labelFlag&&ze(),e.log(`Labels added.`)),(b||x)&&(S=!1),Re(l),{...R(),kind:`Uniprocess`,name:t,decls:i,defs:a,macros:o,prcds:m,body:l}};try{return{ast:Ve(),shouldOmitPC:S,hasDefaultInitialization:f}}catch(e){if(!(e instanceof y))throw e;return C(`Unknown error at or before`)}},B={global:0,label:1,procedure:2,process:3,processVar:4,procedureVar:5,parameter:6},di=[`Global variable`,`Label`,`Procedure`,`Process`,`Process variable`,`Procedure variable`,`Parameter`],fi=/* @__PURE__ */ new Set([B.global,B.processVar,B.procedureVar,B.parameter]),pi=(e,t,n,r)=>e.symbols.find(e=>e.id===n&&e.context===r&&e.type===t),mi=(e,t,n)=>e.symbols.find(e=>e.id===t&&e.context===n),hi=(e,t)=>{let n=e.procedures.findIndex(e=>e.name===t);return n===-1?e.procedures.length:n},gi=(e,t,n,r)=>!(t===B.procedureVar||t===B.processVar||t===B.parameter?pi(e,B.global,n,``)!==void 0||mi(e,n,r)!==void 0:pi(e,t,n,r)!==void 0)&&(e.symbols.push({type:t,id:n,context:r,useThis:n}),!0),_i=(e,t,n,r)=>pi(e,t,n,r)?.useThis??n,vi=(e,t,n)=>{let r=mi(e,t,n);return r===void 0?t:fi.has(r.type)?r.useThis:t},yi=e=>{let t={symbols:[],procedures:[],processNames:[],errorReport:``},n=(e,n)=>{gi(t,B.label,e.label,n)||(t.errorReport+=`\nLabel ${e.label} redefined at line ${e.line}, column ${e.col}`),e.stmts.forEach(e=>r(e,n))},r=(e,t)=>{let i=e=>e.forEach(e=>r(e,t)),a=e=>e.forEach(e=>n(e,t));switch(e.kind){case`While`:i(e.unlabDo),a(e.labDo);return;case`If`:i(e.Then),i(e.Else);return;case`With`:i(e.Do);return;case`LabelIf`:i(e.unlabThen),a(e.labThen),i(e.unlabElse),a(e.labElse);return;case`Either`:e.ors.forEach(i);return;case`LabelEither`:e.clauses.forEach(e=>{i(e.unlabOr),a(e.labOr)});return;case`Assign`:case`When`:case`PrintS`:case`Assert`:case`Skip`:case`Call`:case`Return`:case`CallReturn`:case`CallGoto`:case`Goto`:return;default:throw new w(`Unexpected AST type ${e.kind}`)}},i=(e,n,r=n===``?B.global:B.processVar)=>{gi(t,r,e.var,n)||(t.errorReport+=`\n${di[r]} ${e.var} redefined at line ${e.line}, column ${e.col}`)};if(gi(t,B.global,`pc`,``),e.prcds.length>0&&gi(t,B.global,`stack`,``),e.decls.forEach(e=>i(e,``)),e.prcds.forEach(e=>{let r=hi(t,e.name)<t.procedures.length;r&&(t.errorReport+=`\nProcedure ${e.name} redefined at line ${e.line}, column ${e.col}`),r||t.procedures.push({name:e.name,params:e.params,decls:e.decls,initialPC:e.body.length===0?void 0:Sr(e.body[0]).label}),gi(t,B.procedure,e.name,``),e.decls.forEach(t=>i(t,e.name,B.procedureVar)),e.params.forEach(t=>i(t,e.name,B.parameter)),e.body.forEach(t=>n(Sr(t),e.name))}),e.kind===`Multiprocess`&&e.procs.forEach(e=>{let r=t.processNames.includes(e.name);r&&(t.errorReport+=`\nProcess ${e.name} redefined at line ${e.line}, column ${e.col}`),r||t.processNames.push(e.name),gi(t,B.process,e.name,``),e.decls.forEach(t=>i(t,e.name)),e.body.forEach(t=>n(Sr(t),e.name))}),e.kind===`Uniprocess`&&e.body.forEach(e=>n(Sr(e),``)),t.errorReport.length>0)throw new D(t.errorReport);return t},bi=e=>{let t=t=>e.symbols.filter(e=>e.useThis===t).length>1,n=!1;for(let r=0;r<=7;r+=1)e.symbols.forEach(e=>{if(e.type===r){e.useThis=e.id;for(let n=1;r>0&&t(e.useThis);n+=1)e.useThis+=n===1?`_`:e.context[n-2]??String(r);e.id!==e.useThis&&(n=!0)}});return n},xi=e=>{let t=e.symbols.filter(e=>e.id===`defaultInitValue`).map(e=>`${di[e.type]} name`);if(t.length>0)throw new D(`Cannot use \`defaultInitValue' as ${t.join(` or `)}`)},Si=(e,t,n)=>{let r=(e,n)=>{let r=[],i=[];e.tokens.forEach(e=>e.forEach(e=>{if(e.type!==_r.ident)return;let a=vi(t,e.string,n);r.includes(e.string)||a===e.string||(r.push(e.string),i.push(Or([[Ei(a)]])))})),i.length>0&&Lr(e,i,r,!1)},i=(e,n)=>{e.var=vi(t,e.var,n),r(e.val,n)},a=(e,n)=>e.forEach((r,i)=>{e[i]=_i(t,B.label,r,n)}),o=(e,n)=>e===void 0?void 0:_i(t,B.procedure,e,n),s=(e,n)=>{e.label=_i(t,B.label,e.label,n),e.stmts.forEach(e=>c(e,n))},c=(e,n)=>{let i=e=>e.forEach(e=>c(e,n)),a=e=>e.forEach(e=>s(e,n)),l=e=>e.forEach(e=>r(e,n));switch(e.kind){case`LabeledStmt`:s(e,n);return;case`While`:i(e.unlabDo),a(e.labDo),r(e.test,n);return;case`Assign`:e.ass.forEach(e=>{e.lhs.var=vi(t,e.lhs.var,n),r(e.lhs.sub,n),r(e.rhs,n)});return;case`If`:i(e.Then),i(e.Else),r(e.test,n);return;case`With`:r(e.exp,n),i(e.Do);return;case`When`:case`PrintS`:case`Assert`:r(e.exp,n);return;case`Skip`:return;case`LabelIf`:r(e.test,n),i(e.unlabThen),a(e.labThen),i(e.unlabElse),a(e.labElse);return;case`Call`:e.returnTo=_i(t,B.procedure,e.returnTo,n),e.to=_i(t,B.procedure,e.to,n),l(e.args);return;case`Return`:e.from=o(e.from,n);return;case`CallReturn`:e.from=o(e.from,n),e.to=_i(t,B.procedure,e.to,n),l(e.args);return;case`CallGoto`:e.after=_i(t,B.procedure,e.after,n),e.to=_i(t,B.procedure,e.to,n),l(e.args);return;case`Goto`:if(pi(t,B.label,e.to,n)===void 0&&e.to!==`Done`)throw new D(`goto to non-existent label \`${e.to}' at line ${e.line}, column ${e.col}`);e.to=_i(t,B.label,e.to,n);return;case`Either`:e.ors.forEach(i);return;case`LabelEither`:e.clauses.forEach(e=>{i(e.unlabOr),a(e.labOr)});return;default:throw new w(`Unexpected AST type${e.kind}`)}},l=e=>{e.decls.forEach(t=>i(t,e.name)),e.params.forEach(t=>i(t,e.name)),e.body.forEach(t=>s(Sr(t),e.name));let n=Cr(t.procedures,hi(t,e.name));a(e.plusLabels,e.name),a(e.minusLabels,e.name),n.initialPC!==void 0&&(n.initialPC=_i(t,B.label,n.initialPC,e.name)),e.name=_i(t,B.procedure,e.name,``),n.name=e.name},u=e=>{e.decls.forEach(t=>i(t,e.name)),e.body.forEach(t=>s(Sr(t),e.name)),a(e.plusLabels,e.name),a(e.minusLabels,e.name),e.name=_i(t,B.process,e.name,``)};e.decls.forEach(e=>i(e,``)),e.kind===`Multiprocess`&&((e,t)=>{e.forEach(l);let r=e.map(e=>e.name),i=e.map(e=>r.map(t=>e.proceduresCalled.includes(t)));r.forEach((e,t)=>i.forEach(e=>e.forEach((n,r)=>{e[r]=n||e[t]&&i[t][r]}))),e.forEach((e,t)=>{e.proceduresCalled=r.filter((e,n)=>i[t][n])});for(let e of t){u(e);let t=e.proceduresCalled;for(let e=0;e<t.length;e+=1){let a=r.indexOf(t[e]);if(a===-1){n(`\nUnrecoverable error:\n -- Could not find procedure name \`${t[e]}'.\n`);return}r.forEach((e,n)=>{i[a][n]&&!t.includes(e)&&t.push(e)})}}})(e.prcds,e.procs),e.kind===`Uniprocess`&&(e.prcds.forEach(l),e.body.forEach(e=>s(Sr(e),``)))},Ci=e=>wr(e,0,_r.string),wi=e=>wr(e,0,_r.added),Ti=e=>wr(e,0,_r.builtin),Ei=e=>wr(e,0,_r.ident),Di=(e,t)=>{let n=[];return e.forEach(e=>{let r=n.at(-1),i=r===void 0?0:r.column+Tr(r)+t;n.push(wr(e.string,i,e.type))}),Or([n])},Oi=e=>e.tokens.forEach((t,n)=>{let r=n===0||n===e.tokens.length-1?1:6;t.forEach(e=>{if(e.column=r,r+=Tr(e),e.type===_r.builtin)switch(e.string){case`|->`:case`↦`:e.column=Math.max(16,e.column+1),r=e.column+5;return;case`[`:case`<<`:r+=1;return;case`]`:case`>>`:e.column+=1,r+=1;return;case`\\o`:e.column+=1,r+=2}})}),ki=(e,t,n,r=0,i=0)=>({...R(),kind:`SingleAssign`,line:r,col:i,lhs:{...R(),kind:`Lhs`,var:e,sub:t},rhs:n}),Ai=(e,t=0,n=0)=>({...R(),kind:`Assign`,line:t,col:n,ass:e}),ji=(e,t,n=0,r=0)=>Ai([ki(e,Or([]),t,n,r)],n,r),Mi=e=>{if(e.tokens.length>1)return!1;let t=Cr(e.tokens,0);return t.length===1?t[0].string===`TRUE`:t.length===3&&t[0].string===`(`&&t[1].string===`TRUE`&&t[2].string===`)`},Ni=e=>({...R(),kind:`When`,exp:Di([wi(`pc`),Ti(`=`),Ci(e)],1)}),Pi=e=>ji(`pc`,Or([[Ci(e??`null`)]])),Fi=e=>[Ei(`Head`),Ti(`(`),wi(`stack`),Ti(`)`),Ti(`.`),Ei(e)],Ii=()=>[Ei(`Tail`),Ti(`(`),wi(`stack`),Ti(`)`)],Li=e=>Or([Fi(e)]),Ri=(e,t,n,r)=>{let i=[[Ti(`<<`),Ti(`[`),Ei(`procedure`),Ti(`|->`),Ci(e),Ti(`,`)],[Ei(`pc`),Ti(`|->`),...t]];n.forEach(e=>{i[i.length-1].push(Ti(`,`)),i.push([Ei(e.var),Ti(`|->`),Ei(e.var)])}),i[i.length-1].push(Ti(`]`),Ti(`>>`)),i.push(r);let a=Er(i);return Oi(a),Dr(a),a},zi=(e,t,n)=>{if(t.params.length!==n.args.length)throw new D(`Procedure ${n.to} called with wrong number of arguments`,n);return t.params.forEach((t,r)=>e.ass.push(ki(t.var,Or([]),n.args[r],n.line,n.col))),[e,...t.decls.map(e=>ji(e.var,e.val,n.line,n.col)),Pi(t.initialPC)]},Bi=(e,t,n)=>{let r,i=(e,n)=>{let r=hi(t,e.to);if(r===t.procedures.length)throw new D(`Call of non-existent procedure ${e.to}`,e);let i=t.procedures[r],a=Ri(e.to,[Ci(n)],[...i.decls,...i.params],[Ti(`\\o`),wi(`stack`)]);return zi(ji(`stack`,a,e.line,e.col),i,e)},a=e=>{e.from??=r;let n=e.from;if(n===void 0)throw new D("`return' statement not in procedure",e);let i=hi(t,n);if(i>=t.procedures.length)throw new D(`Error in procedure (perhaps name used elsewhere)`,e);let a=t.procedures[i],o=(t,n)=>Ai([ki(t,Er(),n,e.line,e.col)],e.line,e.col);return[o(`pc`,Li(`pc`)),...a.decls.map(e=>o(e.var,Li(e.var))),...a.params.map(e=>o(e.var,Li(e.var))),o(`stack`,Or([Ii()]))]},o=e=>{let n=e.from;if(n===void 0)throw new D(`\`return' statement following \`call' at ${xr(e)} not in a procedure`);let r=Cr(t.procedures,hi(t,n)),i=hi(t,e.to);if(i===t.procedures.length)throw new D(`Call of non-existent procedure ${e.to}`,e);let a=t.procedures[i],o=Ai([],e.line,e.col);if(n!==e.to){r.decls.forEach(t=>o.ass.push(ki(t.var,Er(),Li(t.var),e.line,e.col)));let t=Ri(e.to,Fi(`pc`),[...a.decls,...a.params],[Ti(`\\o`),...Ii()]);o.ass.push(ki(`stack`,Or([]),t,e.line,e.col))}return zi(o,a,e)},s=(e,t)=>{if(e.length===0)return{stmts:[],labeledStmts:[],needsGoto:!n};let r={stmts:e,labeledStmts:[],needsGoto:!1},c=e[e.length-1];switch(c.kind){case`LabelIf`:case`LabelEither`:{let n=c.kind===`LabelIf`?f(c,t):p(c,t);e.pop(),e.push(n.stmt),r.labeledStmts=n.labeledStmts;break}case`Goto`:e.pop(),e.push(Pi(c.to));break;case`Call`:e.pop(),e.push(...i(c,t));break;case`Return`:e.pop(),e.push(...a(c));break;case`CallReturn`:e.pop(),e.push(...o(c));break;case`CallGoto`:e.pop(),e.push(...i({...R(),kind:`Call`,returnTo:``,to:c.to,args:c.args,line:c.line,col:c.col},c.after));break;case`If`:{let e=s(c.Then,t),i=s(c.Else,t);r.labeledStmts.push(...e.labeledStmts,...i.labeledStmts),c.Then=e.stmts,c.Else=i.stmts,n||(r.needsGoto=e.needsGoto&&i.needsGoto,r.needsGoto||(e.needsGoto&&c.Then.push(Pi(t)),i.needsGoto&&c.Else.push(Pi(t))));break}case`Either`:{let e=c.ors.map((e,n)=>{let i=s(e,t);return c.ors[n]=i.stmts,r.labeledStmts.push(...i.labeledStmts),i});r.needsGoto=e.every(e=>e.needsGoto),!n&&!r.needsGoto&&e.forEach((e,n)=>{e.needsGoto&&c.ors[n].push(Pi(t))});break}case`With`:{let e=s(c.Do,t);c.Do=e.stmts,r.labeledStmts.push(...e.labeledStmts),r.needsGoto=e.needsGoto;break}default:r.needsGoto=!0}return n&&(r.needsGoto=!1),r},c=(e,t)=>{let n=s(e,t);return n.needsGoto&&n.stmts.push(Pi(t)),n},l=(e,t)=>{let r=e.stmts.at(0);if(r?.kind===`While`)return d(e,r,t);let i=c([...e.stmts],t),a=[];return n||(i.stmts.unshift(Ni(e.label)),a.push({...R(),kind:`LabeledStmt`,col:e.col,line:e.line,label:e.label,stmts:i.stmts})),a.push(...i.labeledStmts),a},u=(e,t)=>e.flatMap((n,r)=>l(n,r<e.length-1?e[r+1].label:t)),d=(e,t,r)=>{let i=t.labDo.length===0?e.label:t.labDo[0].label,a=c([...t.unlabDo],i),o=c(e.stmts.slice(1),r),s=Mi(t.test),l=s?a.stmts:[{...R(),kind:`If`,test:t.test,Then:a.stmts,Else:o.stmts}];return[{...R(),kind:`LabeledStmt`,col:e.col,line:e.line,label:e.label,stmts:[...n?[]:[Ni(e.label)],...l]},...u(t.labDo,e.label),...a.labeledStmts,...s?[]:o.labeledStmts]},f=(e,t)=>{let n=c(e.unlabThen,e.labThen.length===0?t:e.labThen[0].label),r=c(e.unlabElse,e.labElse.length===0?t:e.labElse[0].label),i=u(e.labThen,t);return i.push(...u(e.labElse,t)),i.push(...n.labeledStmts,...r.labeledStmts),{stmt:{...R(),kind:`If`,col:e.col,line:e.line,test:e.test,Then:n.stmts,Else:r.stmts},labeledStmts:i}},p=(e,t)=>{let n=[],r=[];return e.clauses.forEach(e=>{let i=c(e.unlabOr,e.labOr.length>0?e.labOr[0].label:t);n.push(i.stmts),r.push(...i.labeledStmts),r.push(...u(e.labOr,t))}),{stmt:{...R(),kind:`Either`,col:e.col,line:e.line,ors:n},labeledStmts:r}},m=(e,t)=>u(e.map(Sr),t),h=e=>{r=e.name;let n=m(e.body,_i(t,B.label,`Error`,``));return r=void 0,{...R(),kind:`Procedure`,col:e.col,line:e.line,name:e.name,minusLabels:[],plusLabels:[],proceduresCalled:[],params:e.params,decls:e.decls,body:n}},g=e=>({...R(),kind:`Process`,col:e.col,line:e.line,name:e.name,fairness:0,minusLabels:[],plusLabels:[],proceduresCalled:[],isEq:e.isEq,id:e.id,decls:e.decls,body:m(e.body,`Done`)}),_=e.prcds.map(h);return e.kind===`Uniprocess`?{...R(),kind:`Uniprocess`,col:e.col,line:e.line,name:e.name,decls:e.decls,defs:e.defs,macros:[],prcds:_,body:m(e.body,`Done`)}:{...R(),kind:`Multiprocess`,col:e.col,line:e.line,name:e.name,decls:e.decls,defs:e.defs,macros:[],prcds:_,procs:e.procs.map(g)}},Vi=(e,t)=>{let n=t?[]:[`pc`];if(n.push(...e.decls.map(e=>e.var)),e.prcds.length>0&&n.push(`stack`),e.prcds.forEach(e=>{n.push(...e.params.map(e=>e.var)),n.push(...e.decls.map(e=>e.var))}),e.kind===`Multiprocess`&&e.procs.forEach(e=>n.push(...e.decls.map(e=>e.var))),n.length===0)throw new D(`The algorithm has no variables.`);let r=(e,t)=>{let r=n.indexOf(t);return r===-1?0:(e[r]+=1,e[r])},i=(e,t)=>t.forEach((t,n)=>{e[n]=Math.max(e[n],t)}),a=e=>[...e].sort((e,t)=>e.lhs.var<t.lhs.var?-1:+(e.lhs.var>t.lhs.var)),o=(e,t)=>{let o=[...t];e.ass=a(e.ass),new Set(e.ass.map(e=>e.lhs.var)).forEach(t=>{let i=e.ass.filter(e=>e.lhs.var===t);if(!n.includes(t))throw new D(`Assignment to undeclared variable ${t}`,i[0]);let a=i.some(e=>e.lhs.sub.tokens.length===0);if(r(o,t)>1||i.length>1&&a)throw new D(`Multiple assignment to ${t}`,e)}),i(t,o)},s=(e,t)=>{switch(e.kind){case`Assign`:o(e,t);return;case`If`:{let n=[...t],r=[...t];e.Then.forEach(e=>s(e,n)),e.Else.forEach(e=>s(e,r)),i(t,n),i(t,r);return}case`Either`:{let n=[...t];e.ors.forEach(e=>{let r=[...t];e.forEach(e=>s(e,r)),i(n,r)}),i(t,n);return}case`With`:e.Do.forEach(e=>s(e,t));return;case`When`:case`PrintS`:case`Assert`:case`Skip`:return;default:throw new w(`Unexpected AST type ${e.kind}`)}},c=e=>e.forEach(e=>{let t=n.map(()=>0);Sr(e).stmts.forEach(e=>s(e,t))});e.prcds.forEach(e=>c(e.body)),(e.kind===`Uniprocess`?[e.body]:e.procs.map(e=>e.body)).forEach(c)},Hi=(e,t,n,r)=>{let i=yi(e);bi(i)&&r(`Warning: symbols were renamed.`),Si(e,i,r),Vi(Bi(e,i,t),t),n&&xi(i)},Ui=`[ \\t\\n\\x0B\\f\\r]`,Wi=RegExp(`\\\\\\* BEGIN TRANSLATION${Ui}+\\(${Ui}*([cC][hH]([eE][cC])?[kK][sS][uU][mM]\\([pP]([lL][uU][sS])?[cC][aA][lL]\\))${Ui}*(=${Ui}*"(?<pcal>[0-9A-Fa-f]*)"|\\\\in${Ui}*STRING)${Ui}*\\/\\\\${Ui}*([cC][hH]([eE][cC])?[kK][sS][uU][mM]\\([tT][lL][aA]\\+?\\))${Ui}*(=${Ui}*"(?<tla>[0-9A-Fa-f]*)"|\\\\in${Ui}*STRING)${Ui}*\\)`),Gi=e=>process.getBuiltinModule(`node:zlib`).crc32(Buffer.from(e,`utf8`)).toString(16),Ki=(e,t)=>e.log(`\nUnrecoverable error:\n -- ${t}.\n`),qi=(e,t)=>Ki(e,t.node===void 0||t.node.line===0?t.message:`${t.message}\n at ${xr(t.node)}`),Ji=e=>e.map(e=>`${Array.from(e).reduce((e,t)=>t===` `?e+` `.repeat(8-e.length%8):e+t,``)} `),Yi=(e,t,n,r)=>{for(let i=Math.max(t,0);i<e.length;i++){let t=e[i],a=t.indexOf(n);if(a===-1)continue;let o=a+n.length,s=t.slice(o).search(/[^ ]/);if(s!==-1&&o+s===t.indexOf(r))return i}return-1},Xi=(e,t)=>{for(;t.line<e.length;){let n=e[t.line];for(;t.column<n.length&&n[t.column]===` `;)t.column+=1;if(t.column<n.length)return n;t.line+=1,t.column=0}return``},Zi=(e,t,n)=>{let r=Array.from(e.slice(t)).findIndex(e=>n.includes(e));return r===-1?e.length:t+e.slice(t,t+r).length},Qi=e=>/^[\p{L}\p{Nd}_]$/u.test(e),$i=(e,t,n)=>{for(;t.line<e.length;){let r=Xi(e,t);if(r.slice(t.column).startsWith(n)){let e=t.column+n.length;if(e>=r.length||!/^[\p{L}_]$/u.test(r[e]))return t.column=Zi(r,e,` `),!0}t.column=Zi(r,t.column,` `)}return!1},ea=(e,t)=>Ki(e,`Command-line error: ${t}`),ta=(e,t)=>{let n=e.params,r=!0,i=!1,a=t=>(r&&=(n.fairnessOption=``,!1),n.fairnessOption===``?(n.fairnessOption=t,!0):(ea(e,`Can only have one of -wf, -sf, -wfNext, and -nof options`),!1));for(let r=0;r<t.length;r++){let o=t[r],s=t[r+1];switch(o){case`-spec`:case`spec`:case`-myspec`:case`myspec`:{let t=o.endsWith(`myspec`);if(n[t?`myspecOption`:`specOption`]=!0,n.specOption&&n.myspecOption){ea(e,`
|
|
32
|
-
Can have at most one of the options -spec, -myspec, -spec2, -myspec2, writeAST`);return}if(s===void 0){ea(e,`Specification name must follow \`-${t?`myspec`:`spec`}' option`);return}r+=1;continue}case`-termination`:case`termination`:n.checkTermination=!0;continue;case`-noold`:case`-nocfg`:case`-noDoneDisjunct`:case`noDoneDisjunct`:continue;case`-wf`:case`wf`:case`-sf`:case`sf`:case`-wfNext`:case`wfNext`:case`-nof`:case`nof`:if(!a(o.replace(/^-/,``)))return;o.endsWith(`nof`)&&(i=!0);continue;case`-label`:case`label`:n.labelFlag=!0;continue;case`-labelRoot`:case`labelRoot`:if(s===void 0){ea(e,"Label root must follow `-labelRoot' option");return}if(!/^[a-zA-Z][a-zA-Z0-9_]*$/.test(s)){ea(e,`Label root must be a valid PlusCal identifier (must start with a letter and contain only letters, numbers, and underscores)`);return}n.labelRoot=s,r+=1;continue;case`-version`:case`version`:{if(s===void 0){ea(e,"Version number must follow `-version' option");return}let t=yr(s);if(t<0||t>1903){Ki(e,t<0?`Illegal version ${s} specified.`:`Specified version ${s} later than current version 1.12`),ea(e,`Bad version number`);return}n.inputVersionNumber=t,r+=1;continue}case`-lineWidth`:if(!/^[+-]?\d+$/.test(s??``)||Number(s)<60){ea(e,"Integer value at least 60 must follow `-lineWidth' option");return}r+=1;continue;default:ea(e,`Unknown or illegal option in options statement: ${o}`);return}}n.checkTermination&&n.fairnessOption===``&&!i&&(n.fairnessOption=`wf`)},na=(e,t,n)=>{if(Xi(t,n),n.column+=7,!Xi(t,n).slice(n.column).startsWith(`(`)){Ki(e,"`PlusCal options' not followed by '('");return}n.column+=1;let r=[];for(;;){let e=Xi(t,n);if(n.line>=t.length||e[n.column]===`)`)break;if(e[n.column]===`,`){n.column+=1;continue}let i=Zi(e,n.column,` ,)`);r.push(e.slice(n.column,i)),n.column=i}n.line>=t.length?Ki(e,`No closing ')' found in options statement`):ta(e,r)},ra=(e,t,n)=>{let r=0,i=!1,a=!1;for(let o=t;!i&&o<e.length;o++){let s=e[o],c=o===t?n:0,l=[s.slice(0,c)];a=!1;for(let e=c;!i&&e<s.length;e++){let t=s[e],n=s.slice(e,e+2);if(n===`(*`&&!a)r+=1,l.push(` `),e+=1;else if(n===`*)`&&!a&&r===0)l.push(n),i=!0;else if(n===`*)`&&!a)--r,l.push(` `),e+=1;else if(r>0)l.push(` `);else if(a&&t===`\\`&&n.length===2)l.push(n),e+=1;else{if(!a&&n===`\\*`){l.push(` `);break}t===`"`&&(a=!a),l.push(t)}}if(a)return new D(`Unterminated string in line ${o+1}`);e[o]=l.join(``)}},ia=(e,t)=>{let n=10*2**Math.max(0,Math.ceil(Math.log2(t/10)));throw new y(`java.lang.ArrayIndexOutOfBoundsException: Index ${e} out of bounds for length ${n}`)},aa=(e,t,n)=>{if(!t.some(e=>e.indexOf(`algorithm`)>0))return/* @__PURE__ */ new Set([`NO_PLUSCAL_EXISTS`]);let r=Ji(t),i={line:0,column:0};for(;$i(r,i,`PlusCal`);){let t=Xi(r,i).slice(i.column),n=Array.from(t).findIndex(e=>!Qi(e));if(t.startsWith(`options`)&&(n===-1?t.length:n)===7){na(e,r,i);break}}let a=0,o=-1,s=!1;for(;a<r.length;a++){let e=r[a];if(/^=+$/.test(e))break;let t=e.indexOf(`--algorithm`),n=e.indexOf(`--fair`);if(t!==-1){o=t+11;break}if(n!==-1){o=n+6,s=!0;break}}let c=/* @__PURE__ */ new Set,l=Yi(r,0,`BEGIN`,`TRANSLATION`);l===-1&&c.add(`NO_TRANSLATION_EXISTS`);let u=Yi(r,l+1,`END`,`TRANSLATION`);if(u===-1&&c.add(`NO_TRANSLATION_EXISTS`),l===-1&&u===-1)return c;if(o===-1)return c.add(`NO_PLUSCAL_EXISTS`),c;let d=ra(r,a,o);if(d!==void 0)return qi(e,d),/* @__PURE__ */ new Set([`ERROR_ENCOUNTERED`]);let f;try{let t=ui(e,Hr(r,a,o),s);f=t.ast,Hi(t.ast,t.shouldOmitPC,t.hasDefaultInitialization,e.log)}catch(t){if(!(t instanceof D))throw t;qi(e,t)}l===-1&&ia(-1,r.length);let p=Wi.exec(r[l]);if(p===null)return c.add(`NO_PCAL_CHECKSUMS_EXIST`),c;let m=p.groups?.pcal,h=s&&n!==`1.7.4`?`fair`:f===void 0?void 0:Vr(f,e.params.inputVersionNumber,n);m!==void 0&&(h===void 0||m!==Gi(h))&&c.add(`PCAL_DIVERGENCE_EXISTS`);let g=p.groups?.tla;if(g!==void 0){if(u===-1)throw new y(`java.lang.IllegalArgumentException: fromIndex(${l+1}) > toIndex(-1)`);let e=t.slice(l+1,u).join(``);g!==Gi(e)&&c.add(`TLA_DIVERGENCE_EXISTS`)}return c.size===0?/* @__PURE__ */ new Set([`NO_DIVERGENCE`]):c},oa=[[`STRING`,0,0,[],[]],[`FALSE`,0,0,[],[]],[`TRUE`,0,0,[],[]],[`BOOLEAN`,0,0,[],[]],[`=`,2,0,[2,2],[1,1]],[`/=`,2,0,[2,2],[1,1]],[`.`,2,0,void 0,void 0],[`'`,1,2,[1],[0]],[`\\lnot`,1,0,[3],[1]],[`\\neg`,1,0,void 0,void 0],[`\\land`,2,0,[3,3],[1,1]],[`\\lor`,2,0,[3,3],[1,1]],[`\\equiv`,2,0,[3,3],[1,1]],[`=>`,2,0,[3,3],[1,1]],[`SUBSET`,1,0,[2],[1]],[`UNION`,1,0,[2],[1]],[`DOMAIN`,1,0,[2],[1]],[`\\subseteq`,2,0,[2,2],[1,1]],[`\\in`,2,0,[2,2],[1,1]],[`\\notin`,2,0,[2,2],[1,1]],[`\\`,2,0,[2,2],[1,1]],[`\\intersect`,2,0,[2,2],[1,1]],[`\\union`,2,0,[2,2],[1,1]],[`\\times`,2,0,[2,2],[1,1]],[`~>`,2,3,[3,3],[0,0]],[`[]`,1,3,[3],[0]],[`<>`,1,3,[3],[0]],[`ENABLED`,1,1,[2],[0]],[`UNCHANGED`,1,2,[1],[0]],[`\\cdot`,2,2,[2,2],[0,0]],[`-+->`,2,3,[3,3],[0,0]],[`$AngleAct`,2,2,[2,1],[0,0]],[`$BoundedChoose`,-1,0,[2],[1]],[`$BoundedExists`,-1,0,[3],[1]],[`$BoundedForall`,-1,0,[3],[1]],[`$CartesianProd`,-1,0,[2],[1]],[`$Case`,-1,0,[3],[1]],[`$ConjList`,-1,0,[3],[1]],[`$DisjList`,-1,0,[3],[1]],[`$Except`,-1,0,[2],[1]],[`$FcnApply`,2,0,[2,2],[1,1]],[`$FcnConstructor`,-1,0,[3],[1]],[`$IfThenElse`,3,0,[3,3,3],[1,1,1]],[`$NonRecursiveFcnSpec`,1,0,[3],[1]],[`$Pair`,2,0,[3,3],[1,1]],[`$RcdConstructor`,-1,0,[3],[1]],[`$RcdSelect`,2,0,[2,0],[1,1]],[`$RecursiveFcnSpec`,1,0,[3],[1]],[`$Seq`,-1,0,[2],[1]],[`$SetEnumerate`,-1,0,[2],[1]],[`$SetOfAll`,-1,0,[2],[1]],[`$SetOfFcns`,-1,0,[2],[1]],[`$SetOfRcds`,-1,0,[2],[1]],[`$SF`,2,3,[1,2],[0,0]],[`$SquareAct`,2,2,[2,1],[0,0]],[`$SubsetOf`,1,0,[2],[1]],[`$TemporalExists`,1,3,[3],[0]],[`$TemporalForall`,1,3,[3],[0]],[`$TemporalWhile`,2,3,[3,3],[0,0]],[`$Tuple`,-1,0,[2],[1]],[`$UnboundedChoose`,1,0,[2],[1]],[`$UnboundedExists`,1,0,[3],[1]],[`$UnboundedForall`,1,0,[3],[1]],[`$WF`,2,3,[1,2],[0,0]],[`$Nop`,1,0,[3],[1]],[`$Qed`,0,0,[],[]],[`$Pfcase`,1,0,[3],[1]],[`$Have`,1,0,[3],[1]],[`$Take`,1,0,[3],[1]],[`$Pick`,1,0,[3],[1]],[`$Witness`,-1,0,[2],[1]],[`$Suffices`,1,0,[3],[1]]],sa={file:`--TLA+ BUILTINS--`,beginLine:0,beginColumn:0,endLine:0,endColumn:0},V=e=>({id:e,levelChecked:0,level:0,levelParams:/* @__PURE__ */ new Set,allParams:/* @__PURE__ */ new Set,nonLeibnizParams:/* @__PURE__ */ new Set,argLevelParams:/* @__PURE__ */ new Map,levelCorrect:!0,levelConstraints:/* @__PURE__ */ new Map,argLevelConstraints:/* @__PURE__ */ new Map}),ca=e=>oa.map(([t,n,r,i,a])=>{let o=e(),s=n<0?void 0:Array.from({length:n},(t,n)=>({...V(e()),kind:`FormalParam`,name:`Formal_${n}`,arity:0,location:void 0})),c=i!==void 0&&a!==void 0,l=a?.map(e=>e>0);return{...V(o),levelChecked:c?99:0,level:r,kind:`OpDef`,defKind:`BuiltIn`,name:t,arity:n,params:s,body:void 0,isLocal:!1,location:sa,module:void 0,source:void 0,preComments:[],isDefined:!0,inRecursive:!1,inRecursiveSection:!1,recursiveSection:-1,letInLevel:0,weights:n<0?(a??[]).slice(0,1):a??[],isLeibnizArg:c?l:void 0,isLeibniz:l?.every(Boolean)??!0,opLevelCond:void 0,maxLevels:n<0?(i??[]).slice(0,1):i??[],minMaxLevel:void 0,labels:/* @__PURE__ */ new Map,step:void 0}}),la=(e,t)=>{let n=JSON.stringify(t);e.some(e=>JSON.stringify(e)===n)||e.push(t)},ua=e=>e===void 0?`Unknown location`:typeof e==`string`?`In module ${e}`:e.beginLine===0&&e.beginColumn===0&&e.endLine===0&&e.endColumn===0?`In module ${e.file}`:`line ${e.beginLine}, col ${e.beginColumn} to line ${e.endLine}, col ${e.endColumn} of module ${e.file}`,da=e=>e?.kind===`OpAppl`&&e.nullKind===`absent`,fa=()=>({buckets:Array.from({length:11},()=>[]),count:0,threshold:8}),pa=(e,t)=>(e&2147483647)%t,ma=e=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let r=e.buckets.length-1;r>=0;r--)e.buckets[r].forEach(e=>n[pa(e.hash,t)].unshift(e));e.buckets=n,e.threshold=Math.floor(t*.75)},ha=(e,t,n=t)=>e.buckets[pa(je(n),e.buckets.length)].find(e=>e.key===t)?.value,ga=(e,t,n,r=t)=>{let i=je(r),a=e.buckets[pa(i,e.buckets.length)].find(e=>e.key===t);a?a.value=n:(e.count>=e.threshold&&ma(e),e.buckets[pa(i,e.buckets.length)].unshift({hash:i,key:t,value:n}),e.count++)},_a=e=>e.buckets.toReversed().flatMap(e=>e.map(e=>e.value)),va=`\0module `,ya=()=>({table:fa(),symbols:[]}),ba=e=>e.kind===`Module`?va+e.name:e.name,xa=(e,t)=>{ga(e.table,ba(t),t,t.name),e.symbols.push(t)},Sa=e=>e.kind===`ThmOrAssumpDef`?e.params.length:e.kind===`Module`?0:e.arity,Ca=(e,t)=>ha(e.table,t),wa=(e,t)=>ha(e.table,va+t,t),Ta=e=>e.context.symbols.filter(e=>e.kind===`OpDef`&&e.defKind===`UserDefined`),Ea=(e,t)=>_a(e.context.table).filter(e=>e.kind===`OpDecl`&&e.declKind===t).toReversed(),Da=e=>e.context.symbols.filter(e=>e.kind===`ThmOrAssumpDef`),Oa=/* @__PURE__ */ new Map([[`$Qed`,`QED step`],[`$Pfcase`,`CASE`],[`$Have`,`HAVE`],[`$Take`,`TAKE`],[`$Pick`,`PICK`],[`$Witness`,`WITNESS`],[`$Suffices`,`SUFFICES`]]),ka=e=>{if(e.length>3&&e.endsWith(`!!!`))return[...ka(e.slice(0,-3)),`!!`];let t=e.split(`!`);return t.some(e=>e.length===0)?[e]:t},Aa=e=>{switch(e.kind){case`Identifier`:return ka(e.name).map(e=>({op:`Name`,name:e,args:void 0}));case`Apply`:{let t=ka(e.operator),n=e.argumentCounts??t.map((n,r)=>r===t.length-1?e.args.length:0),r=0;return t.map((t,i)=>{let a=e.args.slice(r,r+n[i]);return r+=n[i],{op:`Name`,name:t,args:a.length>0?a:void 0}})}case`Subexpression`:return e.selectors.map(e=>{switch(e.kind){case`Name`:return{op:`Name`,name:e.name,args:e.args.length>0?e.args:void 0};case`Operand`:return{op:e.operand,name:String(e.operand),args:void 0};case`Bound`:return{op:`Null`,name:`!(...)`,args:e.args};case`At`:return{op:`@`,name:`@`,args:void 0};case`Colon`:return{op:`:`,name:`:`,args:void 0}}})}},ja=e=>{let t=e[e.length-1];return t.op!==`Name`||t.args===void 0},Ma=e=>typeof e.op==`number`?`argument selector ${e.name}`:e.name,Na=(e,t)=>typeof e==`number`?e>0&&e<=t?e:-1:e===`<<`?t>0?1:-1:e===`>>`&&t===2?2:-1,Pa=e=>e.kind===`OpDecl`||e.kind===`FormalParam`||e.kind===`OpDef`&&(e.defKind===`BuiltIn`||e.defKind===`NumberedProofStep`),Fa=e=>e.kind===`FormalParam`||e.kind===`OpDecl`||e.kind===`OpDef`||e.kind===`ThmOrAssumpDef`||e.kind===`Module`,Ia=e=>(e.bounded?.length??0)>0?(e.bounded??[]).flat():e.unbounded??[],La=(e,t)=>e===void 0?t:{...e,endLine:t.endLine,endColumn:t.endColumn},Ra=e=>(t,n,r,i,a)=>{let o=[],s=[],c=[],l={name:void 0,nameLocation:void 0,node:void 0,index:0,mode:`FindingOpName`,previousMode:void 0,letInContext:void 0,definitionArityFound:0,definitionArgs:[],isInSuffices:!1},u=()=>t[l.index].location??a,d=e=>e.args??[];for(;l.index<t.length;){let f=t[l.index];if((f.op!==`Name`&&f.op!==`Null`||n!==0)&&f.args!==void 0)return e.addError(u(),`Selector \`${f.name}' should not have argument(s).`);switch(l.mode){case`FindingOpName`:{let f,p,m=[];for(;f===void 0&&l.index<t.length;){let n=t[l.index];if(p=n.op===`Name`?l.name===void 0?e.resolveSynonym(n.name):`${l.name}!${e.resolveSynonym(n.name)}`:void 0,l.name===void 0&&n.op!==`Name`)return e.addError(u(),`Need name or step number here, not \`${n.name}'.`);p!==void 0&&(f=l.letInContext===void 0?e.resolveSymbol(p):Ca(l.letInContext,p)),f===void 0&&(p!==void 0&&(l.name=p,l.nameLocation=La(l.nameLocation,u())),m.push(...d(n)),l.index++)}if(f===void 0&&e.version===`1.7.4`){let n=t.length-1;return e.addError(t[n].location??a,`Unknown operator: \`${Ma(t[n])}'.`)}if(f===void 0)return e.addError(l.nameLocation??a,`Unknown operator: \`${l.name}'.`);if(f.kind===`Module`)return e.addError(u(),`Module name (${t[l.index].name}) not allowed here.`);if(l.node=f,l.nameLocation=La(l.nameLocation,u()),l.name=p,Pa(f)&&t.length!==1)return e.addError(u(),`Cannot take subexpression of \`${l.name}'.`);let h=Sa(f);if(n===0){if(m.push(...d(t[l.index])),l.definitionArityFound+m.length!==h)return e.addError(t[l.index].argsLocation??a,`The operator ${l.name} requires ${h-l.definitionArityFound} arguments.`);m.forEach((t,n)=>l.definitionArgs.push(e.generateArgument(f,n+l.definitionArityFound,t,u())))}if(l.definitionArityFound=h,f.kind===`OpDef`&&f.defKind===`ModuleInstance`){if(l.index===t.length-1&&!(i||r))return e.addError(u(),`Operator name ${l.name} is incomplete.`)}else{let n=f.kind===`OpDef`&&f.defKind===`UserDefined`||f.kind===`ThmOrAssumpDef`?f:void 0;if(f.kind===`OpDef`&&f.defKind===`UserDefined`&&!f.isDefined&&t.length!==1)return e.addError(u(),`Subexpression of \`${l.name}' used inside the operator's definition.`);if(l.index!==t.length-1&&n!==void 0){s.push(...n.params??[]),l.name=void 0,l.nameLocation=void 0,l.mode=t[l.index+1].op===`Name`?`FollowingLabels`:`FindingSubExpr`,c.push(...l.definitionArgs),l.definitionArityFound=0,l.definitionArgs=[];let e=n.body;for(;e?.kind===`SubstIn`;)o.push(e),e=e.body;for(;e?.kind===`APSubstIn`;)o.push(e),e=e.body;l.mode===`FindingSubExpr`&&(l.node=e)}}l.previousMode=`FindingOpName`;break}case`FollowingLabels`:{let r=l.node,i=r?.kind===`OpDef`||r?.kind===`ThmOrAssumpDef`||r?.kind===`Label`?r.labels.get(f.name):void 0;if(i===void 0)return e.addError(u(),`Cannot find label \`${f.name}'.`);if(l.node=i,e.isOutOfLabelScope(i))return e.addError(u(),`Accessing subexpression labeled \`${f.name}' of ASSUME/PROVE clause within the scope of a declaration\n from outside that declaration's scope.`);if(n===0){if(i.params.length!==d(f).length)return e.addError(u(),`Label \`${f.name}' used with wrong number of arguments.`);c.push(...d(f).map(e.generateExpression))}s.push(...i.params),l.index<t.length-1&&t[l.index+1].op!==`Name`&&(l.mode=`FindingSubExpr`),l.mode===`FindingSubExpr`&&(l.node=i.body),l.previousMode=`FollowingLabels`;break}case`FindingSubExpr`:{let n=l.node,r=()=>e.addError(u(),`Nonexistent operand specified by \`${Ma(f)}'.`);if(f.op===`:`){if(!(l.previousMode!==`FindingSubExpr`&&(l.index===t.length-1&&l.previousMode===`FindingOpName`||l.index<t.length-1&&t[l.index+1].op===`Name`)))return e.addError(u(),`\`!:' can be used only after a name and either at the end after an
|
|
33
|
-
operator name or before an operator name.`)}else if(n===void 0||da(n))return e.addError(u(),`Subexpression selection failed, probably due to an error in the selected expression.`);else if(n.kind===`LetIn`){if(Na(f.op,1)!==1)return e.addError(u(),`A LET/IN expression has only one operand.`);l.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(u(),`Internal error: Expecting $Pair and didn't find it.`),m=e=>e?.kind===`OpAppl`&&e.operator.name===`$Pair`,h=Na(f.op,a.length);if(o){let e=Na(f.op,i.arity);if(e===-1)return r();l.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();l.node=e.operands[1]}else if(i.name===`$Case`){if(l.index===t.length-1)return e.addError(u(),`Subexpression of CASE must have form !i!j.`);if(h===-1)return r();let n=a[h-1];if(!m(n))return p();l.index++;let i=Na(t[l.index].op,2);if(i===-1)return e.addError(u(),`Second selector for CASE subexpression must specify one of two operands.`);if(l.node=n.operands[i-1],l.node===void 0||da(l.node))return e.addError(u(),`Selecting OTHER in a CASE statement.`)}else if(i.name===`$Except`){if(h>1)return e.addError(u(),`Selecting subexpression of an EXCEPT not yet implemented.`);if(h===-1)return r();l.node=a[h-1]}else if((n.bounded?.length??0)===0&&(n.unbounded?.length??0)===0){if(h===-1)return r();l.node=a[h-1]}else if(f.op===`Null`||f.op===`@`){let t=Ia(n);if(s.push(...t),f.op===`Null`){if(d(f).length!==t.length)return e.addError(u(),`Selector with ${d(f).length} argument(s) used for quantifier with ${t.length} bound identifier(s).`);c.push(...d(f).map(e.generateExpression))}l.node=a[0]}else{let e=Na(f.op,n.ranges.length);if(e===-1)return r();l.node=n.ranges[e-1]}}else return e.addError(u(),`Choosing operand \`${Ma(f)}' of subexpression with no operands.`)}else if(n.kind===`AssumeProve`){if(n.isSuffices&&!l.isInSuffices){if(Na(f.op,1)!==1)return e.addError(u(),`Accessing non-existent subexpression of a SUFFICES`);l.isInSuffices=!0}else{l.isInSuffices=!1;let i=Na(f.op,1+n.assumptions.length);if(i===-1)return r();if(e.isOutOfClauseScope(n,i))return e.addError(u(),`Accessing ASSUME/PROVE clause within the scope of a declaration
|
|
32
|
+
Can have at most one of the options -spec, -myspec, -spec2, -myspec2, writeAST`);return}if(s===void 0){ea(e,`Specification name must follow \`-${t?`myspec`:`spec`}' option`);return}r+=1;continue}case`-termination`:case`termination`:n.checkTermination=!0;continue;case`-noold`:case`-nocfg`:case`-noDoneDisjunct`:case`noDoneDisjunct`:continue;case`-wf`:case`wf`:case`-sf`:case`sf`:case`-wfNext`:case`wfNext`:case`-nof`:case`nof`:if(!a(o.replace(/^-/,``)))return;o.endsWith(`nof`)&&(i=!0);continue;case`-label`:case`label`:n.labelFlag=!0;continue;case`-labelRoot`:case`labelRoot`:if(s===void 0){ea(e,"Label root must follow `-labelRoot' option");return}if(!/^[a-zA-Z][a-zA-Z0-9_]*$/.test(s)){ea(e,`Label root must be a valid PlusCal identifier (must start with a letter and contain only letters, numbers, and underscores)`);return}n.labelRoot=s,r+=1;continue;case`-version`:case`version`:{if(s===void 0){ea(e,"Version number must follow `-version' option");return}let t=yr(s);if(t<0||t>1903){Ki(e,t<0?`Illegal version ${s} specified.`:`Specified version ${s} later than current version 1.12`),ea(e,`Bad version number`);return}n.inputVersionNumber=t,r+=1;continue}case`-lineWidth`:if(!/^[+-]?\d+$/.test(s??``)||Number(s)<60){ea(e,"Integer value at least 60 must follow `-lineWidth' option");return}r+=1;continue;default:ea(e,`Unknown or illegal option in options statement: ${o}`);return}}n.checkTermination&&n.fairnessOption===``&&!i&&(n.fairnessOption=`wf`)},na=(e,t,n)=>{if(Xi(t,n),n.column+=7,!Xi(t,n).slice(n.column).startsWith(`(`)){Ki(e,"`PlusCal options' not followed by '('");return}n.column+=1;let r=[];for(;;){let e=Xi(t,n);if(n.line>=t.length||e[n.column]===`)`)break;if(e[n.column]===`,`){n.column+=1;continue}let i=Zi(e,n.column,` ,)`);r.push(e.slice(n.column,i)),n.column=i}n.line>=t.length?Ki(e,`No closing ')' found in options statement`):ta(e,r)},ra=(e,t,n)=>{let r=0,i=!1,a=!1;for(let o=t;!i&&o<e.length;o++){let s=e[o],c=o===t?n:0,l=[s.slice(0,c)];a=!1;for(let e=c;!i&&e<s.length;e++){let t=s[e],n=s.slice(e,e+2);if(n===`(*`&&!a)r+=1,l.push(` `),e+=1;else if(n===`*)`&&!a&&r===0)l.push(n),i=!0;else if(n===`*)`&&!a)--r,l.push(` `),e+=1;else if(r>0)l.push(` `);else if(a&&t===`\\`&&n.length===2)l.push(n),e+=1;else{if(!a&&n===`\\*`){l.push(` `);break}t===`"`&&(a=!a),l.push(t)}}if(a)return new D(`Unterminated string in line ${o+1}`);e[o]=l.join(``)}},ia=(e,t)=>{let n=10*2**Math.max(0,Math.ceil(Math.log2(t/10)));throw new y(`java.lang.ArrayIndexOutOfBoundsException: Index ${e} out of bounds for length ${n}`)},aa=(e,t,n)=>{if(!t.some(e=>e.indexOf(`algorithm`)>0))return/* @__PURE__ */ new Set([`NO_PLUSCAL_EXISTS`]);let r=Ji(t),i={line:0,column:0};for(;$i(r,i,`PlusCal`);){let t=Xi(r,i).slice(i.column),n=Array.from(t).findIndex(e=>!Qi(e));if(t.startsWith(`options`)&&(n===-1?t.length:n)===7){na(e,r,i);break}}let a=0,o=-1,s=!1;for(;a<r.length;a++){let e=r[a];if(/^=+$/.test(e))break;let t=e.indexOf(`--algorithm`),n=e.indexOf(`--fair`);if(t!==-1){o=t+11;break}if(n!==-1){o=n+6,s=!0;break}}let c=/* @__PURE__ */ new Set,l=Yi(r,0,`BEGIN`,`TRANSLATION`);l===-1&&c.add(`NO_TRANSLATION_EXISTS`);let u=Yi(r,l+1,`END`,`TRANSLATION`);if(u===-1&&c.add(`NO_TRANSLATION_EXISTS`),l===-1&&u===-1)return c;if(o===-1)return c.add(`NO_PLUSCAL_EXISTS`),c;let d=ra(r,a,o);if(d!==void 0)return qi(e,d),/* @__PURE__ */ new Set([`ERROR_ENCOUNTERED`]);let f;try{let t=ui(e,Hr(r,a,o),s);f=t.ast,Hi(t.ast,t.shouldOmitPC,t.hasDefaultInitialization,e.log)}catch(t){if(!(t instanceof D))throw t;qi(e,t)}l===-1&&ia(-1,r.length);let p=Wi.exec(r[l]);if(p===null)return c.add(`NO_PCAL_CHECKSUMS_EXIST`),c;let m=p.groups?.pcal,h=s&&n!==`1.7.4`?`fair`:f===void 0?void 0:Vr(f,e.params.inputVersionNumber,n);m!==void 0&&(h===void 0||m!==Gi(h))&&c.add(`PCAL_DIVERGENCE_EXISTS`);let g=p.groups?.tla;if(g!==void 0){if(u===-1)throw new y(`java.lang.IllegalArgumentException: fromIndex(${l+1}) > toIndex(-1)`);let e=t.slice(l+1,u).join(``);g!==Gi(e)&&c.add(`TLA_DIVERGENCE_EXISTS`)}return c.size===0?/* @__PURE__ */ new Set([`NO_DIVERGENCE`]):c},oa=[[`STRING`,0,0,[],[]],[`FALSE`,0,0,[],[]],[`TRUE`,0,0,[],[]],[`BOOLEAN`,0,0,[],[]],[`=`,2,0,[2,2],[1,1]],[`/=`,2,0,[2,2],[1,1]],[`.`,2,0,void 0,void 0],[`'`,1,2,[1],[0]],[`\\lnot`,1,0,[3],[1]],[`\\neg`,1,0,void 0,void 0],[`\\land`,2,0,[3,3],[1,1]],[`\\lor`,2,0,[3,3],[1,1]],[`\\equiv`,2,0,[3,3],[1,1]],[`=>`,2,0,[3,3],[1,1]],[`SUBSET`,1,0,[2],[1]],[`UNION`,1,0,[2],[1]],[`DOMAIN`,1,0,[2],[1]],[`\\subseteq`,2,0,[2,2],[1,1]],[`\\in`,2,0,[2,2],[1,1]],[`\\notin`,2,0,[2,2],[1,1]],[`\\`,2,0,[2,2],[1,1]],[`\\intersect`,2,0,[2,2],[1,1]],[`\\union`,2,0,[2,2],[1,1]],[`\\times`,2,0,[2,2],[1,1]],[`~>`,2,3,[3,3],[0,0]],[`[]`,1,3,[3],[0]],[`<>`,1,3,[3],[0]],[`ENABLED`,1,1,[2],[0]],[`UNCHANGED`,1,2,[1],[0]],[`\\cdot`,2,2,[2,2],[0,0]],[`-+->`,2,3,[3,3],[0,0]],[`$AngleAct`,2,2,[2,1],[0,0]],[`$BoundedChoose`,-1,0,[2],[1]],[`$BoundedExists`,-1,0,[3],[1]],[`$BoundedForall`,-1,0,[3],[1]],[`$CartesianProd`,-1,0,[2],[1]],[`$Case`,-1,0,[3],[1]],[`$ConjList`,-1,0,[3],[1]],[`$DisjList`,-1,0,[3],[1]],[`$Except`,-1,0,[2],[1]],[`$FcnApply`,2,0,[2,2],[1,1]],[`$FcnConstructor`,-1,0,[3],[1]],[`$IfThenElse`,3,0,[3,3,3],[1,1,1]],[`$NonRecursiveFcnSpec`,1,0,[3],[1]],[`$Pair`,2,0,[3,3],[1,1]],[`$RcdConstructor`,-1,0,[3],[1]],[`$RcdSelect`,2,0,[2,0],[1,1]],[`$RecursiveFcnSpec`,1,0,[3],[1]],[`$Seq`,-1,0,[2],[1]],[`$SetEnumerate`,-1,0,[2],[1]],[`$SetOfAll`,-1,0,[2],[1]],[`$SetOfFcns`,-1,0,[2],[1]],[`$SetOfRcds`,-1,0,[2],[1]],[`$SF`,2,3,[1,2],[0,0]],[`$SquareAct`,2,2,[2,1],[0,0]],[`$SubsetOf`,1,0,[2],[1]],[`$TemporalExists`,1,3,[3],[0]],[`$TemporalForall`,1,3,[3],[0]],[`$TemporalWhile`,2,3,[3,3],[0,0]],[`$Tuple`,-1,0,[2],[1]],[`$UnboundedChoose`,1,0,[2],[1]],[`$UnboundedExists`,1,0,[3],[1]],[`$UnboundedForall`,1,0,[3],[1]],[`$WF`,2,3,[1,2],[0,0]],[`$Nop`,1,0,[3],[1]],[`$Qed`,0,0,[],[]],[`$Pfcase`,1,0,[3],[1]],[`$Have`,1,0,[3],[1]],[`$Take`,1,0,[3],[1]],[`$Pick`,1,0,[3],[1]],[`$Witness`,-1,0,[2],[1]],[`$Suffices`,1,0,[3],[1]]],sa={file:`--TLA+ BUILTINS--`,beginLine:0,beginColumn:0,endLine:0,endColumn:0},V=e=>({id:e,levelChecked:0,level:0,levelParams:/* @__PURE__ */ new Set,allParams:/* @__PURE__ */ new Set,nonLeibnizParams:/* @__PURE__ */ new Set,argLevelParams:/* @__PURE__ */ new Map,levelCorrect:!0,levelConstraints:/* @__PURE__ */ new Map,argLevelConstraints:/* @__PURE__ */ new Map}),ca=e=>oa.map(t=>{let n=e(),r=t[1]<0?void 0:Array.from({length:t[1]},(t,n)=>({...V(e()),kind:`FormalParam`,name:`Formal_${n}`,arity:0,location:void 0})),i=t[3]!==void 0&&t[4]!==void 0,a=t[4]?.map(e=>e>0);return{...V(n),levelChecked:i?99:0,level:t[2],kind:`OpDef`,defKind:`BuiltIn`,name:t[0],arity:t[1],params:r,body:void 0,isLocal:!1,location:sa,module:void 0,source:void 0,preComments:[],isDefined:!0,inRecursive:!1,inRecursiveSection:!1,recursiveSection:-1,letInLevel:0,weights:t[1]<0?(t[4]??[]).slice(0,1):t[4]??[],isLeibnizArg:i?a:void 0,isLeibniz:a?.every(Boolean)??!0,opLevelCond:void 0,maxLevels:t[1]<0?(t[3]??[]).slice(0,1):t[3]??[],minMaxLevel:void 0,labels:/* @__PURE__ */ new Map,step:void 0}}),la=(e,t)=>{let n=JSON.stringify(t);e.some(e=>JSON.stringify(e)===n)||e.push(t)},ua=e=>e===void 0?`Unknown location`:typeof e==`string`?`In module ${e}`:e.beginLine===0&&e.beginColumn===0&&e.endLine===0&&e.endColumn===0?`In module ${e.file}`:`line ${e.beginLine}, col ${e.beginColumn} to line ${e.endLine}, col ${e.endColumn} of module ${e.file}`,da=e=>e?.kind===`OpAppl`&&e.nullKind===`absent`,fa=()=>({buckets:Array.from({length:11},()=>[]),count:0,threshold:8}),pa=(e,t)=>(e&2147483647)%t,ma=e=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let r=e.buckets.length-1;r>=0;r--)e.buckets[r].forEach(e=>n[pa(e.hash,t)].unshift(e));e.buckets=n,e.threshold=Math.floor(t*.75)},ha=(e,t,n=t)=>e.buckets[pa(je(n),e.buckets.length)].find(e=>e.key===t)?.value,ga=(e,t,n,r=t)=>{let i=je(r),a=e.buckets[pa(i,e.buckets.length)].find(e=>e.key===t);a?a.value=n:(e.count>=e.threshold&&ma(e),e.buckets[pa(i,e.buckets.length)].unshift({hash:i,key:t,value:n}),e.count++)},_a=e=>e.buckets.toReversed().flatMap(e=>e.map(e=>e.value)),va=`\0module `,ya=()=>({table:fa(),symbols:[]}),ba=e=>e.kind===`Module`?va+e.name:e.name,xa=(e,t)=>{ga(e.table,ba(t),t,t.name),e.symbols.push(t)},Sa=e=>e.kind===`ThmOrAssumpDef`?e.params.length:e.kind===`Module`?0:e.arity,Ca=(e,t)=>ha(e.table,t),wa=(e,t)=>ha(e.table,va+t,t),Ta=e=>e.context.symbols.filter(e=>e.kind===`OpDef`&&e.defKind===`UserDefined`),Ea=(e,t)=>_a(e.context.table).filter(e=>e.kind===`OpDecl`&&e.declKind===t).toReversed(),Da=e=>e.context.symbols.filter(e=>e.kind===`ThmOrAssumpDef`),Oa=/* @__PURE__ */ new Map([[`$Qed`,`QED step`],[`$Pfcase`,`CASE`],[`$Have`,`HAVE`],[`$Take`,`TAKE`],[`$Pick`,`PICK`],[`$Witness`,`WITNESS`],[`$Suffices`,`SUFFICES`]]),ka=e=>{if(e.length>3&&e.endsWith(`!!!`))return[...ka(e.slice(0,-3)),`!!`];let t=e.split(`!`);return t.some(e=>e.length===0)?[e]:t},Aa=e=>{switch(e.kind){case`Identifier`:return ka(e.name).map(e=>({op:`Name`,name:e,args:void 0}));case`Apply`:{let t=ka(e.operator),n=e.argumentCounts??t.map((n,r)=>r===t.length-1?e.args.length:0),r=0;return t.map((t,i)=>{let a=e.args.slice(r,r+n[i]);return r+=n[i],{op:`Name`,name:t,args:a.length>0?a:void 0}})}case`Subexpression`:return e.selectors.map(e=>{switch(e.kind){case`Name`:return{op:`Name`,name:e.name,args:e.args.length>0?e.args:void 0};case`Operand`:return{op:e.operand,name:String(e.operand),args:void 0};case`Bound`:return{op:`Null`,name:`!(...)`,args:e.args};case`At`:return{op:`@`,name:`@`,args:void 0};case`Colon`:return{op:`:`,name:`:`,args:void 0}}})}},ja=e=>{let t=e[e.length-1];return t.op!==`Name`||t.args===void 0},Ma=e=>typeof e.op==`number`?`argument selector ${e.name}`:e.name,Na=(e,t)=>typeof e==`number`?e>0&&e<=t?e:-1:e===`<<`?t>0?1:-1:e===`>>`&&t===2?2:-1,Pa=e=>e.kind===`OpDecl`||e.kind===`FormalParam`||e.kind===`OpDef`&&(e.defKind===`BuiltIn`||e.defKind===`NumberedProofStep`),Fa=e=>e.kind===`FormalParam`||e.kind===`OpDecl`||e.kind===`OpDef`||e.kind===`ThmOrAssumpDef`||e.kind===`Module`,Ia=e=>(e.bounded?.length??0)>0?(e.bounded??[]).flat():e.unbounded??[],La=(e,t)=>e===void 0?t:{...e,endLine:t.endLine,endColumn:t.endColumn},Ra=e=>(t,n,r,i,a)=>{let o=[],s=[],c=[],l={name:void 0,nameLocation:void 0,node:void 0,index:0,mode:`FindingOpName`,previousMode:void 0,letInContext:void 0,definitionArityFound:0,definitionArgs:[],isInSuffices:!1},u=()=>t[l.index].location??a,d=e=>e.args??[];for(;l.index<t.length;){let f=t[l.index];if((f.op!==`Name`&&f.op!==`Null`||n!==0)&&f.args!==void 0)return e.addError(u(),`Selector \`${f.name}' should not have argument(s).`);switch(l.mode){case`FindingOpName`:{let f,p,m=[];for(;f===void 0&&l.index<t.length;){let n=t[l.index];if(p=n.op===`Name`?l.name===void 0?e.resolveSynonym(n.name):`${l.name}!${e.resolveSynonym(n.name)}`:void 0,l.name===void 0&&n.op!==`Name`)return e.addError(u(),`Need name or step number here, not \`${n.name}'.`);p!==void 0&&(f=l.letInContext===void 0?e.resolveSymbol(p):Ca(l.letInContext,p)),f===void 0&&(p!==void 0&&(l.name=p,l.nameLocation=La(l.nameLocation,u())),m.push(...d(n)),l.index++)}if(f===void 0&&e.version===`1.7.4`){let n=t.length-1;return e.addError(t[n].location??a,`Unknown operator: \`${Ma(t[n])}'.`)}if(f===void 0)return e.addError(l.nameLocation??a,`Unknown operator: \`${l.name}'.`);if(f.kind===`Module`)return e.addError(u(),`Module name (${t[l.index].name}) not allowed here.`);if(l.node=f,l.nameLocation=La(l.nameLocation,u()),l.name=p,Pa(f)&&t.length!==1)return e.addError(u(),`Cannot take subexpression of \`${l.name}'.`);let h=Sa(f);if(n===0){if(m.push(...d(t[l.index])),l.definitionArityFound+m.length!==h)return e.addError(t[l.index].argsLocation??a,`The operator ${l.name} requires ${h-l.definitionArityFound} arguments.`);m.forEach((t,n)=>l.definitionArgs.push(e.generateArgument(f,n+l.definitionArityFound,t,u())))}if(l.definitionArityFound=h,f.kind===`OpDef`&&f.defKind===`ModuleInstance`){if(l.index===t.length-1&&!(i||r))return e.addError(u(),`Operator name ${l.name} is incomplete.`)}else{let n=f.kind===`OpDef`&&f.defKind===`UserDefined`||f.kind===`ThmOrAssumpDef`?f:void 0;if(f.kind===`OpDef`&&f.defKind===`UserDefined`&&!f.isDefined&&t.length!==1)return e.addError(u(),`Subexpression of \`${l.name}' used inside the operator's definition.`);if(l.index!==t.length-1&&n!==void 0){s.push(...n.params??[]),l.name=void 0,l.nameLocation=void 0,l.mode=t[l.index+1].op===`Name`?`FollowingLabels`:`FindingSubExpr`,c.push(...l.definitionArgs),l.definitionArityFound=0,l.definitionArgs=[];let e=n.body;for(;e?.kind===`SubstIn`;)o.push(e),e=e.body;for(;e?.kind===`APSubstIn`;)o.push(e),e=e.body;l.mode===`FindingSubExpr`&&(l.node=e)}}l.previousMode=`FindingOpName`;break}case`FollowingLabels`:{let r=l.node,i=r?.kind===`OpDef`||r?.kind===`ThmOrAssumpDef`||r?.kind===`Label`?r.labels.get(f.name):void 0;if(i===void 0)return e.addError(u(),`Cannot find label \`${f.name}'.`);if(l.node=i,e.isOutOfLabelScope(i))return e.addError(u(),`Accessing subexpression labeled \`${f.name}' of ASSUME/PROVE clause within the scope of a declaration\n from outside that declaration's scope.`);if(n===0){if(i.params.length!==d(f).length)return e.addError(u(),`Label \`${f.name}' used with wrong number of arguments.`);c.push(...d(f).map(e.generateExpression))}s.push(...i.params),l.index<t.length-1&&t[l.index+1].op!==`Name`&&(l.mode=`FindingSubExpr`),l.mode===`FindingSubExpr`&&(l.node=i.body),l.previousMode=`FollowingLabels`;break}case`FindingSubExpr`:{let n=l.node,r=()=>e.addError(u(),`Nonexistent operand specified by \`${Ma(f)}'.`);if(f.op===`:`){if(!(l.previousMode!==`FindingSubExpr`&&(l.index===t.length-1&&l.previousMode===`FindingOpName`||l.index<t.length-1&&t[l.index+1].op===`Name`)))return e.addError(u(),`\`!:' can be used only after a name and either at the end after an
|
|
33
|
+
operator name or before an operator name.`)}else if(n===void 0||da(n))return e.addError(u(),`Subexpression selection failed, probably due to an error in the selected expression.`);else if(n.kind===`LetIn`){if(Na(f.op,1)!==1)return e.addError(u(),`A LET/IN expression has only one operand.`);l.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(u(),`Internal error: Expecting $Pair and didn't find it.`),m=e=>e?.kind===`OpAppl`&&e.operator.name===`$Pair`,h=Na(f.op,a.length);if(o){let e=Na(f.op,i.arity);if(e===-1)return r();l.node=a[e-1]}else if(i.kind===`OpDef`&&i.defKind===`BuiltIn`&&n.nullKind!==`null`){if(i.name===`$RcdConstructor`||i.name===`$SetOfRcds`){if(h===-1)return r();let e=a[h-1];if(!m(e))return p();l.node=e.operands[1]}else if(i.name===`$Case`){if(l.index===t.length-1)return e.addError(u(),`Subexpression of CASE must have form !i!j.`);if(h===-1)return r();let n=a[h-1];if(!m(n))return p();l.index++;let i=Na(t[l.index].op,2);if(i===-1)return e.addError(u(),`Second selector for CASE subexpression must specify one of two operands.`);if(l.node=n.operands[i-1],l.node===void 0||da(l.node))return e.addError(u(),`Selecting OTHER in a CASE statement.`)}else if(i.name===`$Except`){if(h>1)return e.addError(u(),`Selecting subexpression of an EXCEPT not yet implemented.`);if(h===-1)return r();l.node=a[h-1]}else if((n.bounded?.length??0)===0&&(n.unbounded?.length??0)===0){if(h===-1)return r();l.node=a[h-1]}else if(f.op===`Null`||f.op===`@`){let t=Ia(n);if(s.push(...t),f.op===`Null`){if(d(f).length!==t.length)return e.addError(u(),`Selector with ${d(f).length} argument(s) used for quantifier with ${t.length} bound identifier(s).`);c.push(...d(f).map(e.generateExpression))}l.node=a[0]}else{let e=Na(f.op,n.ranges.length);if(e===-1)return r();l.node=n.ranges[e-1]}}else return e.addError(u(),`Choosing operand \`${Ma(f)}' of subexpression with no operands.`)}else if(n.kind===`AssumeProve`){if(n.isSuffices&&!l.isInSuffices){if(Na(f.op,1)!==1)return e.addError(u(),`Accessing non-existent subexpression of a SUFFICES`);l.isInSuffices=!0}else{l.isInSuffices=!1;let i=Na(f.op,1+n.assumptions.length);if(i===-1)return r();if(e.isOutOfClauseScope(n,i))return e.addError(u(),`Accessing ASSUME/PROVE clause within the scope of a declaration
|
|
34
34
|
from outside that declaration's scope.`);if(i<=n.assumptions.length){if(l.node=n.assumptions[i-1],l.node.kind===`NewSymb`&&l.index!==t.length-1)return e.addError(u(),`Selected a subexpression of a NEW clause of an ASSUME.`)}else l.node=n.goal}}else if(n.kind===`OpArg`){let t=n.op;if(t.kind!==`OpDef`||t.name!==`LAMBDA`)return e.addError(u(),`Trying to select subexpression of an operator argument.`);if(f.op!==`Null`&&f.op!==`@`)return e.addError(u(),`Cannot use !${f.name} to select subexpression of a LAMBDA.`);if(f.op===`Null`){if(t.arity!==d(f).length)return e.addError(u(),`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??[]),l.node=t.body}else if(n.kind===`Label`)l.node=n.body,l.index--;else return e.addError(u(),`Selecting subexpression of expression that has none.`);if(l.node===void 0||da(l.node))return e.addError(u(),`An unexpected null node specified by '${Ma(f)}'.\nThis is probably due to a previous error.`);if(l.index!==t.length-1){let n=t[l.index+1];if(n.op===`Name`){for(;l.node?.kind===`Label`;)l.node=l.node.body;if(l.node?.kind!==`LetIn`)return e.addError(u(),`A name selector here must be from a LET clause.`);l.letInContext=l.node.context,l.mode=`FindingOpName`}else if(n.op===`:`)return e.addError(u(),`!: should not follow an operand selector.`)}l.previousMode=`FindingSubExpr`;break}}l.index++}let f=l.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 l.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`?Sa(f.op):l.previousMode===`FindingOpName`&&Fa(f)?Sa(f):0);if(n!==t)return e.addError(a,`Expected arity ${n} but found operator of arity ${t}.`)}let p=f;if(l.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(...l.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:Sa(t)},(t,n)=>e.createFormalParam(`NewParam${n}`,0,void 0))),p=e.createOpAppl(t,l.definitionArgs,a)}}if(!r){if(p.kind===`ThmOrAssumpDef`&&p.body.kind===`AssumeProve`)return e.addError(a,`ASSUME/PROVE used where an expression is required.`);if(p.kind===`ThmOrAssumpDef`&&p.body.kind===`OpAppl`){let t=Oa.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,l.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}.`)},za=/* @__PURE__ */ new Map([[`(`,`)`],[`[`,`]`],[`{`,`}`],[`<<`,`>>`]]),Ba=(e,t)=>`${e}:${t}`,Va=(e,t)=>{let n=_e(t).filter(e=>e.kind!==`End`).map(Xe),r=[0,0];for(let e=0;e<t.length;e++)t[e]===`
|
|
35
35
|
`&&r.push(e+1);return{name:e,source:t,tokens:n,lineOffsets:r,tokenIndexes:new Map(n.map((e,t)=>[Ba(e.line,e.column),t]))}},H=(e,t,n)=>e.tokens[t]!==void 0&&e.tokens[t].text===n&&e.tokens[t].kind!==`String`,Ha=(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},Ua=(e,t)=>e.tokenIndexes.get(Ba(t.line,t.column))??Math.min(Ha(e,t,!1),e.tokens.length-1),Wa=(e,t)=>Math.max(Ha(e,t,!0)-1,0),Ga=(e,t)=>{let n=e.tokens[t].text,r=za.get(n);if(r===void 0)return t;let i=0;for(let a=t;a<e.tokens.length;a++)if(H(e,a,n))i++;else if(H(e,a,r)&&(i--,i===0))return a;return t},Ka=(e,t)=>({start:Ua(e,t.start),end:Wa(e,t.end)}),U=(e,t)=>{let n=t.location.range;if(n)return Ka(e,n);let r=Ua(e,t.location);return{start:r,end:Ga(e,r)}},qa=(e,t)=>{let n=t.start-1,r=t.end+1;return H(e,n,`(`)&&H(e,r,`)`)&&Ga(e,n)===r?qa(e,{start:n,end:r}):t},Ja=(e,t)=>{let n=t.start-1,r=t.end+1;return H(e,n,`(`)&&Ga(e,n)===r&&(H(e,n-1,`(`)||H(e,n-1,`,`))?Ja(e,{start:n,end:r}):t},W=(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}),G=(e,t)=>W(e,{start:t,end:t}),Ya=(e,t,n)=>{let r=0,i=e.lineOffsets[t];for(;i<e.source.length;){if(r=e.source[i]===` `?Ke(r):r+1,r>=n)return i;i++}return i},Xa=(e,t)=>{let n=e.tokens[t],r=Ya(e,n.line,n.column);return e.source.slice(r,Ya(e,n.line,n.endColumn)+1)},Za=(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},Qa=e=>{let t=Va(``,e),n=t.tokens.reduce((e,n,r)=>{if(!Za(t,r))return e;let i=Ya(t,n.line,n.column);return`${e.slice(0,i)} ${e.slice(i+2)}`},e);if(n!==e&&Je(e)!==void 0)throw new s(`SANY rejects a []ASSUME or []PROVE outside an ASSUME/PROVE`);return n},$a=(e,t)=>{let n=e.tokens[t-1],r=e.tokens[t],i=n===void 0?0:Ya(e,n.line,n.endColumn)+1,a=e.source.slice(i,Ya(e,r.line,r.column)),o=[],s=0;for(;s<a.length;)if(a.startsWith(`\\*`,s)){let e=a.indexOf(`
|
|
36
|
-
`,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},eo=(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},to=(e,t,n,r)=>{for(let i=t;i<=n;i++)if(H(e,i,r))return i;return-1},no=e=>e[e.length-1],ro=(e,t)=>{for(let n=e.length-1;n>=0;n--){let r=Ca(e[n],t);if(r)return r}},io=e=>e.kind===`OpDecl`?`${e.kind}${e.declKind}`:e.kind===`OpDef`?e.defKind:e.kind,ao=(e,t)=>{if(e.kind===`OpDef`&&t.kind===`OpDef`){let n=e.source??e;return n===(t.source??t)?n.module===void 0||oo(n.module):!1}if(e.kind===`ThmOrAssumpDef`&&t.kind===`ThmOrAssumpDef`){let n=e.source??e;return n===(t.source??t)&&oo(n.module)}return!1},oo=e=>Ea(e,2).length===0&&Ea(e,3).length===0,so=(e,t)=>{let n=ro(e.contexts,t.name);if(n===t)return;if(n===void 0){xa(no(e.contexts),t);return}let r=t.kind===`FormalParam`||io(n)!==io(t)||Sa(n)!==Sa(t);n.kind===`OpDef`&&n.defKind===`BuiltIn`&&!(r&&e.version===`1.7.4`)?e.addError(t.location,`Symbol ${t.name} is a built-in operator, and cannot be redefined.`):r?e.addError(t.location,`Multiply-defined symbol '${t.name}': this definition or declaration conflicts \nwith the one at ${ua(n.location)}.`):ao(t,n)||e.addWarning(t.location,`Multiple declarations or definitions for symbol ${t.name}. \nThis duplicates the one at ${ua(n.location)}.`)},co=e=>e.labelScopes.push({labels:/* @__PURE__ */ new Map,params:[]}),lo=e=>e.labelScopes.pop()?.labels??/* @__PURE__ */ new Map,uo=(e,t)=>{let n=t.kind===`AssumeProve`?e.assumeProveScopes.get(t):void 0;n&&(n.isInProof=!1)},fo=(e,t)=>W(e,U(e,t)),po=(e,t)=>t.range?Ka(e,t.range):{start:Ua(e,t),end:Ua(e,t)},mo=(e,t)=>W(e,po(e,t)),ho=(e,t)=>{for(let n=e.contexts.length-1;n>=0;n--){let r=wa(e.contexts[n],t);if(r?.kind===`Module`)return r}return e.externalModules.get(t)},go=(e,t)=>{let n=ho(e,t);if(n===void 0)throw new s(`Could not find module ${t}`);return n},_o=(e,t,n)=>{e.contexts.push(t);let r=n();return e.contexts.pop(),r},vo=(e,t,n,r,i)=>{let a={...V(e.getId()),kind:`FormalParam`,name:t,arity:n,location:r};return i&&so(e,a),a},yo=(e,t)=>({...V(e.getId()),kind:`OpDef`,defKind:`UserDefined`,arity:t.params?.length??0,params:[],body:void 0,isLocal:!1,module:e.currentModule,source:void 0,preComments:[],isDefined:!0,inRecursive:!1,inRecursiveSection:!1,recursiveSection:-1,letInLevel:0,weights:(t.params??[]).map(()=>0),isLeibnizArg:(t.params??[]).map(()=>!0),isLeibniz:!0,opLevelCond:void 0,maxLevels:(t.params??[]).map(()=>3),minMaxLevel:void 0,labels:/* @__PURE__ */ new Map,step:void 0,...t}),bo=(e,t)=>{t.letInLevel=e.curLevel,e.unresolvedSum>0&&(t.recursiveSection=e.recursiveSectionCount,t.inRecursiveSection=e.unresolvedCount[e.curLevel]>0,e.currentModule.opDefsInRecursiveSection.push(t))},xo=(e,t,n,r,i={},a=e.getId())=>({...V(a),kind:`OpAppl`,operator:t,operands:n,unbounded:i.unbounded,bounded:i.bounded,tupleOrs:i.tupleOrs,ranges:i.ranges??[],location:r}),So=e=>({...xo(e,Co(e,`$Nop`),[],sa,{},e.nullApplicationId),nullKind:`null`}),Co=(e,t)=>{let n=e.builtinsByName.get(t);if(!n)throw new h(`SANY has no builtin operator ${t}`);return n},K=(e,t,n,r,i={})=>xo(e,Co(e,t),n,r,i),wo=(e,t,n)=>({...V(e.getId()),kind:`String`,value:t,location:n}),To=(e,t,n)=>({...V(e.getId()),kind:`OpArg`,op:t,location:n}),Eo=(e,t,n)=>{let r=ro(e.contexts,qe(t));if(r===void 0||r.kind===`Module`)throw new s(`Unknown operator: \`${t}' at line ${n.beginLine}, column ${n.beginColumn} of module ${n.file}`);return r},Do=(e,t,n,r)=>{if(t.kind!==`OpDef`||t.defKind!==`UserDefined`)return;let i=t.params??[];i.length===n.length?i.forEach((i,a)=>{let o=n[a];i.arity===0&&o.kind===`OpArg`&&e.addError(r,`Operator used in argument number ${a+1} has incorrect number of arguments.`);let s=o.kind===`OpArg`&&Sa(o.op)===i.arity&&!(o.op.kind===`OpDef`&&(o.op.params??[]).some(e=>e.arity>0));i.arity>0&&!s&&e.addError(r,`Argument number ${a+1} to operator '${t.name}' \nshould be a ${i.arity}-parameter operator.`)}):e.addError(r,`Wrong number of arguments (${n.length}) given to operator '${t.name}', \nwhich requires ${i.length} arguments.`)},Oo=/* @__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`]]),ko=/* @__PURE__ */ new Set([`N_GeneralId`,`N_OpApplication`,`N_PrefixExpr`,`N_InfixExpr`,`N_PostfixExpr`,`N_FcnAppl`,`N_RecordComponent`]),Ao=(e,t)=>H(e,t.start,`(`)&&Ga(e,t.start)===t.end,jo=(e,t)=>qa(e,U(e,t)),Mo=(e,t,n)=>jo(e,t.args[0]).start===n.start?t.args.length===2?`N_InfixExpr`:`N_PostfixExpr`:e.tokens[n.start].kind===`Identifier`?`N_OpApplication`:`N_PrefixExpr`,No=(e,t,n)=>Ao(e,n)?`N_ParenExpr`:t.kind===`String`?Xa(e,n.start):t.kind===`Apply`?Mo(e,t,n):Oo.get(t.kind),Po=(e,t,n)=>{if(t.kind===`String`&&!Ao(e,n))return!1;if(t.kind===`Identifier`&&!t.name.includes(`!`))return!0;let r=No(e,t,n);return r===void 0||ko.has(r)?void 0:!0},Fo=(e,t,n)=>{let r=(t,n=jo(e,t))=>({last:n,lastKind:No(e,t,n)});if(Ao(e,n))return{hasChildlessFirstChild:!1,...r(t,{start:n.start+1,end:n.end-1})};switch(t.kind){case`If`:case`BoxAction`:case`AngleAction`:return{hasChildlessFirstChild:!1,...r(t.kind===`If`?t.condition:t.action)};case`Tuple`:case`SetEnumeration`:{let i=t.elements[0];return i===void 0?{hasChildlessFirstChild:!1,last:{start:n.end,end:n.end},lastKind:e.tokens[n.end].text}:{hasChildlessFirstChild:!1,...r(i)}}case`Always`:case`Eventually`:case`Enabled`:case`Unchanged`:return{hasChildlessFirstChild:!0,...r(t.expression,{start:n.start+1,end:n.end})};case`Prime`:return{hasChildlessFirstChild:Po(e,t.expression,jo(e,t.expression)),last:{start:n.end,end:n.end},lastKind:`N_GenPostfixOp`};case`FunctionApplication`:case`FieldAccess`:{let n=t.kind===`FunctionApplication`?t.function:t.record,r=jo(e,n),i=r.end+1;return{hasChildlessFirstChild:Po(e,n,r),last:{start:i,end:i},lastKind:e.tokens[i].text}}case`Apply`:{let i=Mo(e,t,n);if(i===`N_OpApplication`)return t.operator.includes(`!`)?void 0:{hasChildlessFirstChild:!0,last:{start:n.start+1,end:n.end},lastKind:`N_OpArgs`};if(i===`N_PrefixExpr`)return{hasChildlessFirstChild:!0,...r(t.args[0],{start:n.start+1,end:n.end})};let a=jo(e,t.args[0]),o=a.end+1;return{hasChildlessFirstChild:Po(e,t.args[0],a),last:{start:o,end:o},lastKind:i===`N_InfixExpr`?`N_GenInfixOp`:`N_GenPostfixOp`}}}},Io=(e,t)=>{let n=jo(e.file,t);if((t.kind===`Identifier`||t.kind===`Subexpression`||t.kind===`OperatorReference`)&&!Ao(e.file,n))return!1;let r=Fo(e.file,t,n);if(r?.hasChildlessFirstChild===void 0||r.lastKind===void 0)return!1;let i=W(e.file,r.last);return r.hasChildlessFirstChild&&e.addError(W(e.file,n),`Was expecting a GeneralId.`),r.lastKind===`N_OpArgs`?e.addError(i,"Selector `!(...)' should not have argument(s)."):(e.addError(i,`Unexpected token found.`),e.addError(i,`Need name or step number here, not \`${r.lastKind}'.`)),e.addError(W(e.file,n),`DEF clause entry should describe a defined operator.`),!0},Lo=e=>/^[A-Za-z0-9_]+$/.test(e),Ro=e=>e!==`!!`&&e.includes(`!`),zo=e=>BigInt(e.startsWith(`\\`)?`0${e.slice(1).replace(/^h/i,`x`)}`:e).toString(),Bo=/* @__PURE__ */ new Set([`Identifier`,`Subexpression`,`OperatorReference`,`Lambda`]),Vo=e=>{let t=e.kind===`Apply`?Aa(e):void 0;return Bo.has(e.kind)||t!==void 0&&ja(t)},Ho=(e,t,n)=>{let r=n.start;return t.map(t=>{let i=t.op===`Name`?t.name:t.op===`Null`?`(`:String(t.op),a=to(e,r,n.end,i);if(a===-1)return t;if(t.op===`Null`){let n=Ga(e,a);return r=n+1,{...t,location:W(e,{start:a,end:n})}}r=a+1;let o=G(e,a);if(t.args===void 0||!H(e,a+1,`(`))return{...t,location:o};let s=Ga(e,a+1);return r=s+1,{...t,location:o,argsLocation:W(e,{start:a+1,end:s})}})},Uo=(e,t,n,r,i)=>{let a=Aa(t);if(a===void 0)throw new s(`Expected a name, found ${t.kind}`);return e.selectorToNode(Ho(e.file,a,U(e.file,t)),n,r,i,fo(e.file,t))},Wo=(e,t)=>{let n=Uo(e,t,0,!1,!1);if(n.kind!==`OpAppl`)throw new s(`Expected an expression`);return n},Go=(e,t)=>{if(t.kind!==`OpAppl`)return;let n=e.functions.find(e=>e.name===t.operator.name);n&&(n.node.operator=Co(e,`$RecursiveFcnSpec`))},Ko=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},[]),qo=(e,t,n)=>ps(e,t,n,Ko(t).map(t=>q(e,t[0].set))),Jo=(e,t,n)=>{let r=e.labelScopes.at(-1);r?.params.push(t);let i=q(e,n);return r?.params.pop(),i},Yo=(e,t,n,r,i,a)=>_o(e,ya(),()=>{let o=qo(e,n,r),s=Jo(e,o.bounded.flat(),i);return K(e,t,[s],a,o)}),Xo=(e,t)=>{let n=U(e.file,t),r=eo(e.file,n.start,n.end,t.params);return _o(e,ya(),()=>{let i=t.params.map((t,n)=>vo(e,t,0,G(e.file,r[n]),!0)),a=Jo(e,i,t.body);return yo(e,{name:`LAMBDA`,params:i,body:a,location:W(e.file,n),preComments:$a(e.file,n.start)})})},Zo=(e,t)=>t.kind===`OperatorReference`?t.operator:t.kind===`Lambda`&&t.body.kind===`Apply`?t.body.operator:e.tokens[Ua(e,t.location)].text,Qo=(e,t,n)=>{let r=Zo(e.file,t),i=ro(e.contexts,qe(r));return i===void 0?(e.addError(n,`Could not find declaration or definition of symbol '${r}'.`),So(e)):To(e,i,n)},$o=(e,t,n)=>{let r=U(e.file,t),i=qa(e.file,r),a=W(e.file,i),o=i!==r;if(t.kind===`Lambda`&&!o)return t.location.range!==void 0&&t.operator===void 0?To(e,Xo(e,t),a):Qo(e,t,a);if(o||!Vo(t))return e.addError(a,`Arity ${n.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${n.name}'.`),So(e);if(t.kind===`OperatorReference`)return Qo(e,t,a);let c=Uo(e,t,n.arity,!1,!1);if(c.kind===`OpArg`||c.kind===`OpAppl`&&c.nullKind!==void 0)return c;throw new s(`Expected an operator argument at line ${a.beginLine}, column ${a.beginColumn}`)},es=(e,t,n,r,i)=>{let a=t.kind===`OpDef`&&(t.defKind===`UserDefined`||t.defKind===`ModuleInstance`)?t.params?.[n]?.arity??0:0;if(a===0)return q(e,r);let o=U(e.file,r),c=W(e.file,o),l=`${n+1} (counting from 1)`,u=Ja(e.file,o);if(u!==o||!Vo(r))return e.addError(W(e.file,u),`An expression appears as argument number ${l} to operator '${t.name}', in a position an operator is required.`),So(e);if(r.kind===`Identifier`||r.kind===`Subexpression`||r.kind===`Apply`){let t=Uo(e,r,a,!1,!1);if(t.kind===`OpArg`||t.kind===`OpAppl`)return t;throw new s(`Expected an operator argument at ${ua(c)}`)}if(r.kind===`Lambda`&&r.location.range!==void 0&&r.operator===void 0){let o=Xo(e,r),s=Sa(o);return s===a?To(e,o,c):(e.addError(i,`Lambda expression with arity ${s} used as argument ${n+1} of operator \`${t.name}', \nbut an operator of arity ${a} is required.`),So(e))}let d=Zo(e.file,r),f=ro(e.contexts,qe(d));if(f===void 0)return e.addError(c,`Could not find declaration or definition of symbol '${d}'.`),So(e);let p=Sa(f);return p===a?To(e,f,c):(e.addError(i,`Operator with incorrect arity passed as argument. \nOperator '${f.name}' of arity ${p} is argument number ${l} to operator \`${ua(t.location)}', \nbut an operator of arity ${a} was expected.`),So(e))},ts=(e,t)=>{let n=fo(e.file,t);if(t.isBulleted)return K(e,t.kind===`And`?`$ConjList`:`$DisjList`,t.operands.map(t=>q(e,t)),n);let r=U(e.file,t),i=t.kind===`And`?`\\land`:`\\lor`,[a,...o]=t.operands;return o.reduce((t,n,a)=>{let s=jo(e.file,n),c=a===o.length-1?r.end:s.end;return K(e,i,[t,q(e,n)],W(e.file,{start:r.start,end:c}))},q(e,a))},ns=(e,t)=>{let n=U(e.file,t),r=t.arms.map((r,i)=>{let a=jo(e.file,r.condition),o=i===t.arms.length-1&&t.other===void 0,s=jo(e.file,r.body),c=[q(e,r.condition),q(e,r.body)];return K(e,`$Pair`,c,W(e.file,{start:a.start,end:o?n.end:s.end}))}),i=t.other;if(i){let t=jo(e.file,i),a=rs(e.file,t.start,`OTHER`);r.push(K(e,`$Pair`,[void 0,q(e,i)],W(e.file,{start:a,end:n.end})))}return K(e,`$Case`,r,W(e.file,n))},rs=(e,t,n)=>{for(let r=t;r>=0;r--)if(H(e,r,n))return r;return t},is=(e,t)=>{let n=U(e.file,t),r=W(e.file,n),i=[q(e,t.function)],a=K(e,`$Except`,i,r),o=U(e.file,t.function),s=to(e.file,o.end+1,n.end,`EXCEPT`)+1;return t.updates.forEach(t=>{let r=to(e.file,s,n.end,`!`),o=jo(e.file,t.value),c=W(e.file,{start:r,end:o.end}),l=r+1,u=t.path.map(t=>{if(t.kind===`Field`){let n=as(e.file,l,t.name);return l=n+1,wo(e,t.name,G(e.file,n))}let r=to(e.file,l,n.end,`[`),i=Ga(e.file,r);return l=i+1,t.args.length===1?q(e,t.args[0]):K(e,`$Tuple`,t.args.map(t=>q(e,t)),W(e.file,{start:r,end:i}))}),d=K(e,`$Seq`,u,c),f=K(e,`$Pair`,[d],c);e.exceptSpecStack.push(f),e.exceptStack.push(a),f.operands.push(q(e,t.value)),e.exceptSpecStack.pop(),e.exceptStack.pop(),i.push(f),s=o.end+1}),a},as=(e,t,n)=>{for(let r=t;r<e.tokens.length;r++)if(e.tokens[r].text===n&&e.tokens[r].kind!==`String`)return r;return t},os=(e,t,n)=>{let r=U(e.file,n),i=r.start+1,a=n.fields.map((t,r)=>{let a=as(e.file,i,t.name),o=jo(e.file,t.value);return i=o.end+1,n.fields.slice(0,r).some(e=>e.name===t.name)&&e.addError(G(e.file,a),`Non-unique fields in constructor.`),K(e,`$Pair`,[wo(e,t.name,G(e.file,a)),q(e,t.value)],W(e.file,{start:a,end:o.end}))}),o=K(e,t,a,W(e.file,r));return e.currentModule.records.push(o),o},ss=(e,t)=>({line:e.tokens[t].line,column:e.tokens[t].column}),cs=(e,t)=>{let n=[],r=t;for(;e.tokens[r]?.kind===`Identifier`;){let t=H(e,r+1,`(`)?Ga(e,r+1):r,i=e.tokens.slice(r+1,t).filter(e=>e.text===`_`).length;if(n.push({name:e.tokens[r].text,arity:i,location:{...ss(e,r),range:{module:e.name,start:ss(e,r),end:ss(e,t)}}}),!H(e,t+1,`,`))break;r=t+2}return n},ls=(e,t)=>{let n=[...t.definitions.map(t=>({unit:{kind:`Definition`,definition:t},span:gs(e,t)})),...(t.instances??[]).map(t=>({unit:{kind:`Instance`,instance:t},span:gs(e,t)}))],r=U(e,t).start,i=jo(e,t.body).start,a=[];for(let t=r+1;t<i;t++){let r=n.some(e=>e.span.start<=t&&t<=e.span.end);H(e,t,`RECURSIVE`)&&!r&&a.push({unit:{kind:`Recursive`,declarations:cs(e,t+1)},span:{start:t,end:t}})}return[...n,...a].toSorted((e,t)=>e.span.start-t.span.start).map(e=>e.unit)},us=(e,t)=>{let n=ya();return _o(e,n,()=>{e.curLevel++,e.unresolvedCount[e.curLevel]=0;let r=[],i=[];ls(e.file,t).forEach(t=>{t.kind===`Recursive`?bs(e,t.declarations):t.kind===`Instance`?ws(e,t.instance,r,i):t.definition.kind===`Function`?ys(e,t.definition,r):_s(e,t.definition,r)}),xs(e),e.curLevel=Math.max(e.curLevel-1,0);let a=q(e,t.body);return{...V(e.getId()),kind:`LetIn`,opDefs:r,instances:i,body:a,context:n,location:fo(e.file,t)}})},ds=(e,t)=>{let n=U(e.file,t),r=W(e.file,n);return _o(e,ya(),()=>{let i=t.pattern,a=i.kind===`Name`?[i.name]:i.names;if(t.set===void 0){let o=eo(e.file,n.start,n.end,a),s=a.map((t,r)=>vo(e,t,0,G(e.file,i.kind===`Name`?n.start:o[r]),!0)),c=Jo(e,s,t.body);return K(e,`$UnboundedChoose`,[c],r,{unbounded:s})}let o=q(e,t.set),s=U(e.file,t.set),c=eo(e.file,n.start,s.start,a),l=a.map((t,n)=>vo(e,t,0,G(e.file,c[n]),!0)),u=Jo(e,l,t.body);return K(e,`$BoundedChoose`,[u],r,{bounded:[l],tupleOrs:[i.kind===`Tuple`],ranges:[o]})})},fs=(e,t)=>{if(Lo(t.operator)||Ro(t.operator)||t.args.length>2||ro(e.contexts,qe(t.operator))!==void 0)return;let n=U(e.file,t);if(e.file.tokens[n.start].text===t.operator&&H(e.file,n.start+1,`(`))return;let r=jo(e.file,t.args[0]),i=t.args.length===1&&r.start!==n.start,a=i?n.start:r.end+1,o=Xa(e.file,a);return{index:a,name:i&&o===`-`?`-.`:o,fixity:i?`prefix`:t.args.length===2?`infix`:`postfix`}},q=(e,t)=>{let n=fo(e.file,t);switch(t.kind){case`Number`:return{...V(e.getId()),kind:`Numeral`,value:zo(t.text??String(t.value)),location:n};case`Decimal`:{let[r,i]=t.text.split(`.`),a=BigInt(r+i),o=a<=9223372036854775807n;return{...V(e.getId()),kind:`Decimal`,mantissa:a.toString(),exponent:String(o?-i.length:i.length),integralPart:r,fractionalPart:i,location:n}}case`String`:return wo(e,t.value,n);case`Identifier`:{let n=Wo(e,t);return Go(e,n),n}case`Apply`:{let r=fs(e,t);if(r!==void 0)return e.addError(G(e.file,r.index),`Could not find declaration or definition of symbol '${r.name}'.`),e.addError(n,`Couldn't resolve ${r.fixity} operator symbol \`${r.name}'.`),{...So(e),nullKind:`absent`};let i=Wo(e,t);return(Ro(t.operator)||Lo(t.operator))&&Go(e,i),i}case`Bracket`:return e.addError(G(e.file,U(e.file,t).start),"Unsupported expression type `['."),{...So(e),nullKind:`absent`};case`OperatorReference`:case`Lambda`:{let r=e.file.tokens[U(e.file,t).start],i=t.operator??r.text,a=ro(e.contexts,qe(i));return e.addError(n,r.text===`LAMBDA`?`LAMBDA expression used where an expression is required.`:a===void 0?`Could not find declaration or definition of symbol '${r.spelling??i}'.`:`The operator ${qe(i)} requires ${Sa(a)} arguments.`),{...So(e),nullKind:`absent`}}case`And`:case`Or`:return ts(e,t);case`Prime`:return K(e,`'`,[q(e,t.expression)],n);case`Unchanged`:return K(e,`UNCHANGED`,[q(e,t.expression)],n);case`Enabled`:return K(e,`ENABLED`,[q(e,t.expression)],n);case`Always`:return K(e,`[]`,[q(e,t.expression)],n);case`Eventually`:return K(e,`<>`,[q(e,t.expression)],n);case`If`:return K(e,`$IfThenElse`,[q(e,t.condition),q(e,t.consequent),q(e,t.alternative)],n);case`Case`:return ns(e,t);case`Let`:return us(e,t);case`Forall`:case`Exists`:return Yo(e,t.kind===`Forall`?`$BoundedForall`:`$BoundedExists`,t.bounds,U(e.file,t).start,t.body,n);case`UnboundedQuantifier`:{let r=U(e.file,t),i=U(e.file,t.body),a=eo(e.file,r.start,i.start,t.names),o=t.isTemporal?t.quantifier===`Forall`?`$TemporalForall`:`$TemporalExists`:t.quantifier===`Forall`?`$UnboundedForall`:`$UnboundedExists`;return _o(e,ya(),()=>{let r=t.names.map((t,n)=>vo(e,t,0,G(e.file,a[n]),!0)),i=Jo(e,r,t.body);return K(e,o,[i],n,{unbounded:r})})}case`Choose`:return ds(e,t);case`SetEnumeration`:return K(e,`$SetEnumerate`,t.elements.map(t=>q(e,t)),n);case`Tuple`:return K(e,`$Tuple`,t.elements.map(t=>q(e,t)),n);case`SetFilter`:{let r=q(e,t.bound.set),i=U(e.file,t);return _o(e,ya(),()=>{let a=ps(e,[t.bound],i.start,[r]),o=Jo(e,a.bounded.flat(),t.predicate);return K(e,`$SubsetOf`,[o],n,a)})}case`SetMap`:return Yo(e,`$SetOfAll`,t.bounds,U(e.file,t.expression).end+1,t.expression,n);case`FunctionConstruction`:return Yo(e,`$FcnConstructor`,t.bounds,U(e.file,t).start,t.body,n);case`FunctionSet`:return K(e,`$SetOfFcns`,[q(e,t.domain),q(e,t.range)],n);case`Record`:return os(e,`$RcdConstructor`,t);case`RecordSet`:return os(e,`$SetOfRcds`,t);case`Except`:return is(e,t);case`ExceptAt`:{let t=e.exceptStack[e.exceptStack.length-1],r=e.exceptSpecStack[e.exceptSpecStack.length-1];return t===void 0||r===void 0?(e.addError(n,`@ used where its meaning is not defined.`),So(e)):{...V(e.getId()),kind:`At`,except:t,component:r,location:r.location}}case`FunctionApplication`:{let r=q(e,t.function);if(da(r))return r;Go(e,r);let i=r.kind===`OpAppl`?r.operator:void 0,a=i?.kind===`OpDef`&&i.defKind===`UserDefined`?i.body:void 0;if(a?.kind===`OpAppl`&&(a.operator.name===`$NonRecursiveFcnSpec`||a.operator.name===`$RecursiveFcnSpec`)){let r=(a.bounded??[]).reduce((e,t,n)=>e+(a.tupleOrs?.[n]?1:t.length),0);if(t.args.length>=2&&r!==t.args.length)return e.addError(n,`Function '${i?.name}' is defined with ${r} parameters, but is applied to ${t.args.length} arguments.`),So(e)}let o=t.args.length===1?q(e,t.args[0]):K(e,`$Tuple`,t.args.map(t=>q(e,t)),n);return K(e,`$FcnApply`,[r,o],n)}case`FieldAccess`:{let r=q(e,t.record),i=U(e.file,t);return K(e,`$RcdSelect`,[r,wo(e,t.field,G(e.file,i.end))],n)}case`Product`:return K(e,`$CartesianProd`,t.factors.map(t=>q(e,t)),n);case`BoxAction`:case`AngleAction`:return K(e,t.kind===`BoxAction`?`$SquareAct`:`$AngleAct`,[q(e,t.action),q(e,t.subscript)],n);case`WeakFairness`:case`StrongFairness`:return K(e,t.kind===`WeakFairness`?`$WF`:`$SF`,[q(e,t.subscript),q(e,t.action)],n);case`Label`:return ms(e,t);case`Subexpression`:return Wo(e,t)}},ps=(e,t,n,r)=>{let i=Ko(t),a=n;return{bounded:i.map(t=>{let n=U(e.file,t[0].set),r=t.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),i=eo(e.file,a,n.start,r);return a=n.end+1,r.map((t,n)=>vo(e,t,0,G(e.file,i[n]),!0))}),tupleOrs:i.map(e=>e[0].pattern.kind===`Tuple`),ranges:r}},ms=(e,t)=>{let n=fo(e.file,t),r=e.labelScopes.at(-1);if(r===void 0)return e.addError(n,`Label not in definition or proof step.`),So(e);if(e.assumeProveState.isDeclared.slice(2,e.assumeProveState.depth+1).some(Boolean))return e.addError(n,`Label not allowed within scope of declaration in nested ASSUME/PROVE.`),So(e);if(e.exceptStack.length>0&&e.exceptSpecStack.length>0)return e.addError(n,`Labels inside EXCEPT clauses are not yet implemented.`),So(e);co(e);let i=q(e,t.body),a=lo(e),o=eo(e.file,U(e.file,t).start,U(e.file,t.body).start,t.params),s=t.params.map((n,r)=>{let i=ro(e.contexts,n);if(i?.kind===`FormalParam`)return i;let a=G(e.file,o[r]);return e.addError(a,`Illegal parameter ${n} of label \`${t.name}'.`),vo(e,n,0,a,!1)}),c={...V(e.getId()),kind:`Label`,name:t.name,params:s,body:i,labels:a,isAssumeProve:!1,location:n},l=/* @__PURE__ */ new Set;if(s.forEach(t=>{l.has(t)&&e.addError(n,`Repeated formal parameter ${t.name} \nin label \`${c.name}'.`),l.add(t)}),r.params.flat().forEach(t=>{l.delete(t)||e.addError(n,`Label ${c.name} must contain formal parameter \`${t.name}'.`)}),l.size>0){let t=[...l].map(e=>`${e.name} `).join(``);e.addError(n,`Label ${c.name} declares extra parameter(s) ${t}`)}r.labels.has(c.name)?e.addError(n,`Duplicate label \`${c.name}'.`):r.labels.set(c.name,c);let u=e.assumeProveState.goal;return u&&e.labelGoals.set(c,{scope:u,clause:e.assumeProveState.goalClause}),c},hs=(e,t,n,r)=>{let i=n.start;return t.params.map(t=>{let n=t.location?Ua(e.file,t.location):as(e.file,i,t.name),a=Ds(e.file,n,t.arity);i=a.end+1;let o=t.arity===1&&H(e.file,n+1,`_`);return vo(e,o?e.file.tokens[n].spelling??t.name:qe(t.name),t.arity,W(e.file,a),r)})},gs=(e,t)=>{let n=po(e,t.location);return t.isLocal&&!H(e,n.start,`LOCAL`)&&H(e,n.start-1,`LOCAL`)?{start:n.start-1,end:n.end}:n},_s=(e,t,n)=>{let r=gs(e.file,t),i=W(e.file,r),a=qe(t.name),o={start:t.isLocal?r.start+1:r.start,end:r.end},s=_o(e,ya(),()=>{let n=hs(e,t,o,!0),r=ro(e.contexts,a);if(r?.kind===`OpDef`&&r.inRecursive&&!r.isDefined){let t=r.params?.length===n.length&&n.every(e=>e.arity===0);r.letInLevel===e.curLevel?(t||e.addError(i,`Definition of ${r.name} has different arity than its RECURSIVE declaration.`),r.params=n):e.addError(i,`Recursive operator ${a} defined at wrong LET/IN level.`)}else r!==void 0&&e.addError(i,`Operator ${a} already defined or declared.`);return co(e),{params:n,body:q(e,t.body),existing:r}}),c=lo(e),l=s.existing,u=s.params,d=$a(e.file,r.start);if(l?.kind===`OpDef`&&l.inRecursive&&!l.isDefined&&l.letInLevel===e.curLevel){l.weights=u.map(()=>0),l.maxLevels=u.map(()=>3),l.isLeibnizArg=u.map(()=>!0),l.labels=c,vs(e,l,s.body,i,d),e.currentModule.definitions.push(l),n?.push(l);return}let f=yo(e,{name:a,params:u,body:s.body,isLocal:t.isLocal,location:i,preComments:d,labels:c});so(e,f),bo(e,f),e.currentModule.definitions.push(f),n?.push(f)},vs=(e,t,n,r,i)=>{t.isDefined=!0,t.body=n,t.location=r,t.preComments=i,t.inRecursive&&(e.unresolvedCount[e.curLevel]--,e.unresolvedSum--)},ys=(e,t,n)=>{let r=gs(e.file,t),i=W(e.file,r),a=ya(),o=t.isLocal?r.start+1:r.start,s=_o(e,a,()=>qo(e,t.bounds,o+1)),c=_o(e,a,()=>ro(e.contexts,t.name)),l=_o(e,a,()=>vo(e,t.name,0,i,c===void 0)),u=K(e,`$NonRecursiveFcnSpec`,[],i,{unbounded:[l],...s}),d=c?.kind===`OpDef`&&c.inRecursive&&!c.isDefined,f=d&&c.letInLevel===e.curLevel;f?c.arity!==0&&e.addError(i,`Function ${c.name} has operator arguments in its RECURSIVE declaration.`):d?e.addError(i,`Recursive function ${t.name} defined at wrong LET/IN level.`):c!==void 0&&e.addError(i,`Function name \`${t.name}' already defined or declared.`);let p=$a(e.file,r.start),m=c===void 0?yo(e,{name:t.name,params:[],body:u,isLocal:t.isLocal,location:i,preComments:p}):c.kind===`OpDef`&&(f||!d)?c:void 0;f?c.arity===0&&vs(e,c,u,i,p):c===void 0&&m!==void 0&&(so(e,m),bo(e,m)),m!==void 0&&(e.currentModule.definitions.push(m),n?.push(m)),e.functions.unshift({name:t.name,node:u}),co(e);let h=()=>Jo(e,s.bounded.flat(),t.body),g=m===void 0?h():_o(e,a,h),_=lo(e);m!==void 0&&(m.labels=_),e.functions.shift(),u.operands=[g],u.operator.name===`$NonRecursiveFcnSpec`&&(u.unbounded=void 0)},bs=(e,t)=>{e.unresolvedSum===0&&e.recursiveSectionCount++,e.unresolvedCount[e.curLevel]+=t.length,e.unresolvedSum+=t.length,t.forEach(t=>{let n=Os(e.file,t);e.getId();let r=Array.from({length:t.arity},()=>vo(e,``,0,void 0,!1)),i=yo(e,{name:qe(t.name),params:r,location:W(e.file,n),isDefined:!1,inRecursive:!0,inRecursiveSection:!0,recursiveSection:e.recursiveSectionCount,letInLevel:e.curLevel});so(e,i),e.recursiveDeclarations.push(i),e.currentModule.opDefsInRecursiveSection.push(i)})},xs=e=>{e.unresolvedCount[e.curLevel]!==0&&(e.recursiveDeclarations.filter(t=>t.letInLevel===e.curLevel&&!t.isDefined).forEach(t=>e.addError(t.location,`Symbol ${t.name} declared in RECURSIVE statement but not defined.`)),e.unresolvedSum-=e.unresolvedCount[e.curLevel])},Ss=(e,t,n,r)=>{e.getId();let i=_a(n.table).filter(e=>e.kind===`OpDecl`),a=i.flatMap(t=>{let n=ro(e.contexts,t.name);if(n===void 0)return[];let i=t.declKind===3||t.declKind===2&&t.arity===0;return i&&Do(e,n,[],r),[{op:t,expr:i?xo(e,n,[],r):To(e,n,r),isImplicit:!0}]}),o=(t,n)=>{(n.kind===`OpArg`?Sa(n.op):0)!==t.arity&&e.addError(n.location,`An operator must be substituted for symbol '${t.name}', and it must have arity ${t.arity}.`)},s=gs(e.file,t),c=to(e.file,s.start,s.end,`WITH`)+1;return t.substitutions.forEach(t=>{let i=to(e.file,c,s.end,t.name);i!==-1&&(c=U(e.file,t.expression).end+1);let l=Ca(n,qe(t.name));if(l?.kind!==`OpDecl`){e.addError(i===-1?r:G(e.file,i),`Identifier '${i===-1?t.name:Xa(e.file,i)}' 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 u=l.arity===0?q(e,t.expression):$o(e,t.expression,l);o(l,u);let d=a.find(e=>e.op.name===l.name);d&&!d.isImplicit?e.addError(fo(e.file,t.expression),`Multiple substitutions for symbol '${l.name}' in substitution.`):d?(d.expr=u,d.isImplicit=!1):a.push({op:l,expr:u,isImplicit:!1})}),a.filter(t=>t.isImplicit&&e.version!==`1.7.4`).forEach(e=>o(e.op,e.expr)),i.filter(e=>!a.some(t=>t.op.name===e.name)).forEach(t=>e.addError(r,`Substitution missing for symbol ${t.name} declared at ${ua(t.location)} \nand instantiated in module ${e.currentModule.name}.`)),a},Cs=(e,t,n,r,i,a,o=e.currentModule)=>(da(r)&&e.addError(a,t===`SubstIn`?`Substitution error, probably due to error
|
|
37
|
-
in module being instantiated.`:`Substitution error, probably due to error in module being instantiated.`),{...V(e.getId()),kind:t,substs:n,body:r,instantiatingModule:o,instantiatedModule:i,location:a}),ws=(e,t,n,r)=>{let i=gs(e.file,t),a=W(e.file,i),o=$a(e.file,i.start),s=t.name??``,c=ya(),l=t.isLocal?i.start+1:i.start;t.params.length>0&&e.contexts.push(c);let u=hs(e,t,{start:l,end:i.end},t.params.length>0),d=go(e,t.module),f=d.context,p=Ss(e,t,f,a);t.params.length>0&&e.contexts.pop(),_a(f.table).forEach(r=>{if(r.kind!==`OpDef`||r.isLocal||r.defKind!==`UserDefined`&&r.defKind!==`ModuleInstance`)return;let i=[...u,...r.params??[]],c=`${s}!${r.name}`,l=r.defKind===`UserDefined`?yo(e,{name:c,params:i,body:p.length>0&&r.body?Cs(e,`SubstIn`,p,r.body,d,a):r.body,isLocal:t.isLocal,location:a,source:r.source??r,preComments:o,labels:r.labels}):yo(e,{defKind:`ModuleInstance`,name:c,params:i,isLocal:t.isLocal,location:a,module:r.module,source:r.source??r,preComments:o});so(e,l),r.defKind===`UserDefined`&&bo(e,l),(n??e.currentModule.definitions).push(l)}),_a(f.table).forEach(r=>{if(r.kind!==`ThmOrAssumpDef`||r.isLocal)return;let i=p.length>0?Cs(e,`APSubstIn`,p,r.body,d,a):r.body,o={...V(e.getId()),kind:`ThmOrAssumpDef`,name:`${s}!${r.name}`,isTheorem:r.isTheorem,body:i,params:[...u,...r.params],isLocal:t.isLocal,location:a,module:e.currentModule,source:r.source??r,labels:r.labels,isLeibnizArg:[],isLeibniz:!1,opLevelCond:[],maxLevels:[],minMaxLevel:[]};so(e,o),(n??e.currentModule.definitions).push(o)});let m={...V(e.getId()),kind:`Instance`,name:s,isLocal:t.isLocal,params:u,module:d,substs:p,location:a};(r??e.currentModule.topLevel).push(m);let h=yo(e,{defKind:`ModuleInstance`,name:s,params:u,isLocal:t.isLocal,location:a,preComments:o});so(e,h),e.version!==`1.7.4`&&n?.push(h)},Ts=(e,t)=>(so(e,t),t),Es=(e,t,n=!0,r)=>{let i=gs(e.file,t),a=r??W(e.file,i),o=$a(e.file,i.start),s=go(e,t.module),c=s.context,l=Ss(e,t,c,a),u=t.isLocal,d=oo(s);_a(c.table).forEach(t=>{if(t.kind!==`OpDef`||t.defKind!==`UserDefined`||t.isLocal)return;let n=(n,r)=>{let i=yo(e,{name:t.name,params:t.params,body:r,isLocal:u,location:a,module:n,source:t.source??t,preComments:o,labels:t.labels});return so(e,i),i},r=t.module===void 0||oo(t.module),i=d||r?u?n(t.module,t.body):Ts(e,t):n(e.currentModule,t.body&&Cs(e,`SubstIn`,l,t.body,s,a));e.currentModule.definitions.push(i),bo(e,i)}),_a(c.table).forEach(t=>{if(t.kind!==`ThmOrAssumpDef`||t.isLocal)return;let r=(n,r)=>{let i={...t,...V(e.getId()),body:r,isLocal:u,location:a,module:n,source:t.source??t};return so(e,i),i},i=d?u?r(t.module,t.body):Ts(e,t):oo(t.module)?u?r(e.currentModule,t.body):t:r(e.currentModule,Cs(e,`APSubstIn`,l,t.body,s,a));n&&e.currentModule.definitions.push(i)});let f={...V(e.getId()),kind:`Instance`,name:void 0,isLocal:u,params:[],module:s,substs:l,location:a};return n&&e.currentModule.topLevel.push(f),f},Ds=(e,t,n)=>n===0?{start:t,end:t}:H(e,t,`_`)?{start:t,end:H(e,t+2,`_`)?t+2:t+1}:H(e,t+1,`(`)?{start:t,end:Ga(e,t+1)}:{start:t,end:H(e,t+1,`_`)?t+1:t},Os=(e,t)=>Ds(e,po(e,t.location).start,t.arity),ks=(e,t,n)=>{let r=Os(e.file,t);t.name===`@`&&n===3&&e.addError(W(e.file,r),`Attempted to declare '@' as a variable.`);let i={...V(e.getId()),levelChecked:1,level:+(n===3),kind:`OpDecl`,name:qe(t.name),arity:t.arity,declKind:n,location:W(e.file,r),module:e.currentModule};return n===2&&(i.levelParams.add(i),i.allParams.add(i)),so(e,i),i},As=(e,t,n)=>{e.unresolvedSum!==0&&e.addError(mo(e.file,t),`${n} may not appear within a recursive definition section.`)},js={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}},Ms=(e,t)=>{let n=ho(e,t.name)??(t.name===e.currentModule.name?e.currentModule:void 0);return n===void 0?(e.addError(G(e.file,Ua(e.file,t.location)+1),`Module \`${t.name}' used without being extended or instantiated.`),[]):[n]},Ns=(e,t)=>t.flatMap(t=>{if(t.kind===`ModuleFact`)return Ms(e,t);let n=Aa(
|
|
36
|
+
`,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},eo=(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},to=(e,t,n,r)=>{for(let i=t;i<=n;i++)if(H(e,i,r))return i;return-1},no=e=>e[e.length-1],ro=(e,t)=>{for(let n=e.length-1;n>=0;n--){let r=Ca(e[n],t);if(r)return r}},io=e=>e.kind===`OpDecl`?`${e.kind}${e.declKind}`:e.kind===`OpDef`?e.defKind:e.kind,ao=(e,t)=>{if(e.kind===`OpDef`&&t.kind===`OpDef`){let n=e.source??e;return n===(t.source??t)?n.module===void 0||oo(n.module):!1}if(e.kind===`ThmOrAssumpDef`&&t.kind===`ThmOrAssumpDef`){let n=e.source??e;return n===(t.source??t)&&oo(n.module)}return!1},oo=e=>Ea(e,2).length===0&&Ea(e,3).length===0,so=(e,t)=>{let n=ro(e.contexts,t.name);if(n===t)return;if(n===void 0){xa(no(e.contexts),t);return}let r=t.kind===`FormalParam`||io(n)!==io(t)||Sa(n)!==Sa(t);n.kind===`OpDef`&&n.defKind===`BuiltIn`&&!(r&&e.version===`1.7.4`)?e.addError(t.location,`Symbol ${t.name} is a built-in operator, and cannot be redefined.`):r?e.addError(t.location,`Multiply-defined symbol '${t.name}': this definition or declaration conflicts \nwith the one at ${ua(n.location)}.`):ao(t,n)||e.addWarning(t.location,`Multiple declarations or definitions for symbol ${t.name}. \nThis duplicates the one at ${ua(n.location)}.`)},co=e=>e.labelScopes.push({labels:/* @__PURE__ */ new Map,params:[]}),lo=e=>e.labelScopes.pop()?.labels??/* @__PURE__ */ new Map,uo=(e,t)=>{let n=t.kind===`AssumeProve`?e.assumeProveScopes.get(t):void 0;n&&(n.isInProof=!1)},fo=(e,t)=>W(e,U(e,t)),po=(e,t)=>t.range?Ka(e,t.range):{start:Ua(e,t),end:Ua(e,t)},mo=(e,t)=>W(e,po(e,t)),ho=(e,t)=>{for(let n=e.contexts.length-1;n>=0;n--){let r=wa(e.contexts[n],t);if(r?.kind===`Module`)return r}return e.externalModules.get(t)},go=(e,t)=>{let n=ho(e,t);if(n===void 0)throw new s(`Could not find module ${t}`);return n},_o=(e,t,n)=>{e.contexts.push(t);let r=n();return e.contexts.pop(),r},vo=(e,t,n,r,i)=>{let a={...V(e.getId()),kind:`FormalParam`,name:t,arity:n,location:r};return i&&so(e,a),a},yo=(e,t)=>({...V(e.getId()),kind:`OpDef`,defKind:`UserDefined`,arity:t.params?.length??0,params:[],body:void 0,isLocal:!1,module:e.currentModule,source:void 0,preComments:[],isDefined:!0,inRecursive:!1,inRecursiveSection:!1,recursiveSection:-1,letInLevel:0,weights:(t.params??[]).map(()=>0),isLeibnizArg:(t.params??[]).map(()=>!0),isLeibniz:!0,opLevelCond:void 0,maxLevels:(t.params??[]).map(()=>3),minMaxLevel:void 0,labels:/* @__PURE__ */ new Map,step:void 0,...t}),bo=(e,t)=>{t.letInLevel=e.curLevel,e.unresolvedSum>0&&(t.recursiveSection=e.recursiveSectionCount,t.inRecursiveSection=e.unresolvedCount[e.curLevel]>0,e.currentModule.opDefsInRecursiveSection.push(t))},xo=(e,t,n,r,i={},a=e.getId())=>({...V(a),kind:`OpAppl`,operator:t,operands:n,unbounded:i.unbounded,bounded:i.bounded,tupleOrs:i.tupleOrs,ranges:i.ranges??[],location:r}),So=e=>({...xo(e,Co(e,`$Nop`),[],sa,{},e.nullApplicationId),nullKind:`null`}),Co=(e,t)=>{let n=e.builtinsByName.get(t);if(!n)throw new h(`SANY has no builtin operator ${t}`);return n},K=(e,t,n,r,i={})=>xo(e,Co(e,t),n,r,i),wo=(e,t,n)=>({...V(e.getId()),kind:`String`,value:t,location:n}),To=(e,t,n)=>({...V(e.getId()),kind:`OpArg`,op:t,location:n}),Eo=(e,t,n)=>{let r=ro(e.contexts,qe(t));if(r===void 0||r.kind===`Module`)throw new s(`Unknown operator: \`${t}' at line ${n.beginLine}, column ${n.beginColumn} of module ${n.file}`);return r},Do=(e,t,n,r)=>{if(t.kind!==`OpDef`||t.defKind!==`UserDefined`)return;let i=t.params??[];i.length===n.length?i.forEach((i,a)=>{let o=n[a];i.arity===0&&o.kind===`OpArg`&&e.addError(r,`Operator used in argument number ${a+1} has incorrect number of arguments.`);let s=o.kind===`OpArg`&&Sa(o.op)===i.arity&&!(o.op.kind===`OpDef`&&(o.op.params??[]).some(e=>e.arity>0));i.arity>0&&!s&&e.addError(r,`Argument number ${a+1} to operator '${t.name}' \nshould be a ${i.arity}-parameter operator.`)}):e.addError(r,`Wrong number of arguments (${n.length}) given to operator '${t.name}', \nwhich requires ${i.length} arguments.`)},Oo=/* @__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`]]),ko=/* @__PURE__ */ new Set([`N_GeneralId`,`N_OpApplication`,`N_PrefixExpr`,`N_InfixExpr`,`N_PostfixExpr`,`N_FcnAppl`,`N_RecordComponent`]),Ao=(e,t)=>H(e,t.start,`(`)&&Ga(e,t.start)===t.end,jo=(e,t)=>qa(e,U(e,t)),Mo=(e,t,n)=>jo(e,t.args[0]).start===n.start?t.args.length===2?`N_InfixExpr`:`N_PostfixExpr`:e.tokens[n.start].kind===`Identifier`?`N_OpApplication`:`N_PrefixExpr`,No=(e,t,n)=>Ao(e,n)?`N_ParenExpr`:t.kind===`String`?Xa(e,n.start):t.kind===`Apply`?Mo(e,t,n):Oo.get(t.kind),Po=(e,t,n)=>{if(t.kind===`String`&&!Ao(e,n))return!1;if(t.kind===`Identifier`&&!t.name.includes(`!`))return!0;let r=No(e,t,n);return r===void 0||ko.has(r)?void 0:!0},Fo=(e,t,n)=>{let r=(t,n=jo(e,t))=>({last:n,lastKind:No(e,t,n)});if(Ao(e,n))return{hasChildlessFirstChild:!1,...r(t,{start:n.start+1,end:n.end-1})};switch(t.kind){case`If`:case`BoxAction`:case`AngleAction`:return{hasChildlessFirstChild:!1,...r(t.kind===`If`?t.condition:t.action)};case`Tuple`:case`SetEnumeration`:{let i=t.elements[0];return i===void 0?{hasChildlessFirstChild:!1,last:{start:n.end,end:n.end},lastKind:e.tokens[n.end].text}:{hasChildlessFirstChild:!1,...r(i)}}case`Always`:case`Eventually`:case`Enabled`:case`Unchanged`:return{hasChildlessFirstChild:!0,...r(t.expression,{start:n.start+1,end:n.end})};case`Prime`:return{hasChildlessFirstChild:Po(e,t.expression,jo(e,t.expression)),last:{start:n.end,end:n.end},lastKind:`N_GenPostfixOp`};case`FunctionApplication`:case`FieldAccess`:{let n=t.kind===`FunctionApplication`?t.function:t.record,r=jo(e,n),i=r.end+1;return{hasChildlessFirstChild:Po(e,n,r),last:{start:i,end:i},lastKind:e.tokens[i].text}}case`Apply`:{let i=Mo(e,t,n);if(i===`N_OpApplication`)return t.operator.includes(`!`)?void 0:{hasChildlessFirstChild:!0,last:{start:n.start+1,end:n.end},lastKind:`N_OpArgs`};if(i===`N_PrefixExpr`)return{hasChildlessFirstChild:!0,...r(t.args[0],{start:n.start+1,end:n.end})};let a=jo(e,t.args[0]),o=a.end+1;return{hasChildlessFirstChild:Po(e,t.args[0],a),last:{start:o,end:o},lastKind:i===`N_InfixExpr`?`N_GenInfixOp`:`N_GenPostfixOp`}}}},Io=(e,t)=>{let n=jo(e.file,t);if((t.kind===`Identifier`||t.kind===`Subexpression`||t.kind===`OperatorReference`)&&!Ao(e.file,n))return!1;let r=Fo(e.file,t,n);if(r?.hasChildlessFirstChild===void 0||r.lastKind===void 0)return!1;let i=W(e.file,r.last);return r.hasChildlessFirstChild&&e.addError(W(e.file,n),`Was expecting a GeneralId.`),r.lastKind===`N_OpArgs`?e.addError(i,"Selector `!(...)' should not have argument(s)."):(e.addError(i,`Unexpected token found.`),e.addError(i,`Need name or step number here, not \`${r.lastKind}'.`)),e.addError(W(e.file,n),`DEF clause entry should describe a defined operator.`),!0},Lo=e=>/^[A-Za-z0-9_]+$/.test(e),Ro=e=>e!==`!!`&&e.includes(`!`),zo=e=>BigInt(e.startsWith(`\\`)?`0${e.slice(1).replace(/^h/i,`x`)}`:e).toString(),Bo=/* @__PURE__ */ new Set([`Identifier`,`Subexpression`,`OperatorReference`,`Lambda`]),Vo=e=>{let t=e.kind===`Apply`?Aa(e):void 0;return Bo.has(e.kind)||t!==void 0&&ja(t)},Ho=(e,t,n)=>{let r=n.start;return t.map(t=>{let i=t.op===`Name`?t.name:t.op===`Null`?`(`:String(t.op),a=to(e,r,n.end,i);if(a===-1)return t;if(t.op===`Null`){let n=Ga(e,a);return r=n+1,{...t,location:W(e,{start:a,end:n})}}r=a+1;let o=G(e,a);if(t.args===void 0||!H(e,a+1,`(`))return{...t,location:o};let s=Ga(e,a+1);return r=s+1,{...t,location:o,argsLocation:W(e,{start:a+1,end:s})}})},Uo=(e,t,n,r,i)=>{let a=Aa(t);if(a===void 0)throw new s(`Expected a name, found ${t.kind}`);return e.selectorToNode(Ho(e.file,a,U(e.file,t)),n,r,i,fo(e.file,t))},Wo=(e,t)=>{let n=Uo(e,t,0,!1,!1);if(n.kind!==`OpAppl`)throw new s(`Expected an expression`);return n},Go=(e,t)=>{if(t.kind!==`OpAppl`)return;let n=e.functions.find(e=>e.name===t.operator.name);n&&(n.node.operator=Co(e,`$RecursiveFcnSpec`))},Ko=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},[]),qo=(e,t,n)=>ps(e,t,n,Ko(t).map(t=>q(e,t[0].set))),Jo=(e,t,n)=>{let r=e.labelScopes.at(-1);r?.params.push(t);let i=q(e,n);return r?.params.pop(),i},Yo=(e,t,n,r,i,a)=>_o(e,ya(),()=>{let o=qo(e,n,r),s=Jo(e,o.bounded.flat(),i);return K(e,t,[s],a,o)}),Xo=(e,t)=>{let n=U(e.file,t),r=eo(e.file,n.start,n.end,t.params);return _o(e,ya(),()=>{let i=t.params.map((t,n)=>vo(e,t,0,G(e.file,r[n]),!0)),a=Jo(e,i,t.body);return yo(e,{name:`LAMBDA`,params:i,body:a,location:W(e.file,n),preComments:$a(e.file,n.start)})})},Zo=(e,t)=>t.kind===`OperatorReference`?t.operator:t.kind===`Lambda`&&t.body.kind===`Apply`?t.body.operator:e.tokens[Ua(e,t.location)].text,Qo=(e,t,n)=>{let r=Zo(e.file,t),i=ro(e.contexts,qe(r));return i===void 0?(e.addError(n,`Could not find declaration or definition of symbol '${r}'.`),So(e)):To(e,i,n)},$o=(e,t,n)=>{let r=U(e.file,t),i=qa(e.file,r),a=W(e.file,i),o=i!==r;if(t.kind===`Lambda`&&!o)return t.location.range!==void 0&&t.operator===void 0?To(e,Xo(e,t),a):Qo(e,t,a);if(o||!Vo(t))return e.addError(a,`Arity ${n.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${n.name}'.`),So(e);if(t.kind===`OperatorReference`)return Qo(e,t,a);let c=Uo(e,t,n.arity,!1,!1);if(c.kind===`OpArg`||c.kind===`OpAppl`&&c.nullKind!==void 0)return c;throw new s(`Expected an operator argument at line ${a.beginLine}, column ${a.beginColumn}`)},es=(e,t,n,r,i)=>{let a=t.kind===`OpDef`&&(t.defKind===`UserDefined`||t.defKind===`ModuleInstance`)?t.params??[]:void 0;if(a!==void 0&&a.length<=n)return So(e);let o=a?.[n]?.arity??0;if(o===0)return q(e,r);let c=U(e.file,r),l=W(e.file,c),u=`${n+1} (counting from 1)`,d=Ja(e.file,c);if(d!==c||!Vo(r))return e.addError(W(e.file,d),`An expression appears as argument number ${u} to operator '${t.name}', in a position an operator is required.`),So(e);if(r.kind===`Identifier`||r.kind===`Subexpression`||r.kind===`Apply`){let t=Uo(e,r,o,!1,!1);if(t.kind===`OpArg`||t.kind===`OpAppl`)return t;throw new s(`Expected an operator argument at ${ua(l)}`)}if(r.kind===`Lambda`&&r.location.range!==void 0&&r.operator===void 0){let a=Xo(e,r),s=Sa(a);return s===o?To(e,a,l):(e.addError(i,`Lambda expression with arity ${s} used as argument ${n+1} of operator \`${t.name}', \nbut an operator of arity ${o} is required.`),So(e))}let f=Zo(e.file,r),p=ro(e.contexts,qe(f));if(p===void 0)return e.addError(l,`Could not find declaration or definition of symbol '${f}'.`),So(e);let m=Sa(p);return m===o?To(e,p,l):(e.addError(i,`Operator with incorrect arity passed as argument. \nOperator '${p.name}' of arity ${m} is argument number ${u} to operator \`${ua(t.location)}', \nbut an operator of arity ${o} was expected.`),So(e))},ts=(e,t)=>{let n=fo(e.file,t);if(t.isBulleted)return K(e,t.kind===`And`?`$ConjList`:`$DisjList`,t.operands.map(t=>q(e,t)),n);let r=U(e.file,t),i=t.kind===`And`?`\\land`:`\\lor`,[a,...o]=t.operands;return o.reduce((t,n,a)=>{let s=jo(e.file,n),c=a===o.length-1?r.end:s.end;return K(e,i,[t,q(e,n)],W(e.file,{start:r.start,end:c}))},q(e,a))},ns=(e,t)=>{let n=U(e.file,t),r=t.arms.map((r,i)=>{let a=jo(e.file,r.condition),o=i===t.arms.length-1&&t.other===void 0,s=jo(e.file,r.body),c=[q(e,r.condition),q(e,r.body)];return K(e,`$Pair`,c,W(e.file,{start:a.start,end:o?n.end:s.end}))}),i=t.other;if(i){let t=jo(e.file,i),a=rs(e.file,t.start,`OTHER`);r.push(K(e,`$Pair`,[void 0,q(e,i)],W(e.file,{start:a,end:n.end})))}return K(e,`$Case`,r,W(e.file,n))},rs=(e,t,n)=>{for(let r=t;r>=0;r--)if(H(e,r,n))return r;return t},is=(e,t)=>{let n=U(e.file,t),r=W(e.file,n),i=[q(e,t.function)],a=K(e,`$Except`,i,r),o=U(e.file,t.function),s=to(e.file,o.end+1,n.end,`EXCEPT`)+1;return t.updates.forEach(t=>{let r=to(e.file,s,n.end,`!`),o=jo(e.file,t.value),c=W(e.file,{start:r,end:o.end}),l=r+1,u=t.path.map(t=>{if(t.kind===`Field`){let n=as(e.file,l,t.name);return l=n+1,wo(e,t.name,G(e.file,n))}let r=to(e.file,l,n.end,`[`),i=Ga(e.file,r);return l=i+1,t.args.length===1?q(e,t.args[0]):K(e,`$Tuple`,t.args.map(t=>q(e,t)),W(e.file,{start:r,end:i}))}),d=K(e,`$Seq`,u,c),f=K(e,`$Pair`,[d],c);e.exceptSpecStack.push(f),e.exceptStack.push(a),f.operands.push(q(e,t.value)),e.exceptSpecStack.pop(),e.exceptStack.pop(),i.push(f),s=o.end+1}),a},as=(e,t,n)=>{for(let r=t;r<e.tokens.length;r++)if(e.tokens[r].text===n&&e.tokens[r].kind!==`String`)return r;return t},os=(e,t,n)=>{let r=U(e.file,n),i=r.start+1,a=n.fields.map((t,r)=>{let a=as(e.file,i,t.name),o=jo(e.file,t.value);return i=o.end+1,n.fields.slice(0,r).some(e=>e.name===t.name)&&e.addError(G(e.file,a),`Non-unique fields in constructor.`),K(e,`$Pair`,[wo(e,t.name,G(e.file,a)),q(e,t.value)],W(e.file,{start:a,end:o.end}))}),o=K(e,t,a,W(e.file,r));return e.currentModule.records.push(o),o},ss=(e,t)=>({line:e.tokens[t].line,column:e.tokens[t].column}),cs=(e,t)=>{let n=[],r=t;for(;e.tokens[r]?.kind===`Identifier`;){let t=H(e,r+1,`(`)?Ga(e,r+1):r,i=e.tokens.slice(r+1,t).filter(e=>e.text===`_`).length;if(n.push({name:e.tokens[r].text,arity:i,location:{...ss(e,r),range:{module:e.name,start:ss(e,r),end:ss(e,t)}}}),!H(e,t+1,`,`))break;r=t+2}return n},ls=(e,t)=>{let n=[...t.definitions.map(t=>({unit:{kind:`Definition`,definition:t},span:gs(e,t)})),...(t.instances??[]).map(t=>({unit:{kind:`Instance`,instance:t},span:gs(e,t)}))],r=U(e,t).start,i=jo(e,t.body).start,a=[];for(let t=r+1;t<i;t++){let r=n.some(e=>e.span.start<=t&&t<=e.span.end);H(e,t,`RECURSIVE`)&&!r&&a.push({unit:{kind:`Recursive`,declarations:cs(e,t+1)},span:{start:t,end:t}})}return[...n,...a].toSorted((e,t)=>e.span.start-t.span.start).map(e=>e.unit)},us=(e,t)=>{let n=ya();return _o(e,n,()=>{e.curLevel++,e.unresolvedCount[e.curLevel]=0;let r=[],i=[];ls(e.file,t).forEach(t=>{t.kind===`Recursive`?bs(e,t.declarations):t.kind===`Instance`?ws(e,t.instance,r,i):t.definition.kind===`Function`?ys(e,t.definition,r):_s(e,t.definition,r)}),xs(e),e.curLevel=Math.max(e.curLevel-1,0);let a=q(e,t.body);return{...V(e.getId()),kind:`LetIn`,opDefs:r,instances:i,body:a,context:n,location:fo(e.file,t)}})},ds=(e,t)=>{let n=U(e.file,t),r=W(e.file,n);return _o(e,ya(),()=>{let i=t.pattern,a=i.kind===`Name`?[i.name]:i.names;if(t.set===void 0){let o=eo(e.file,n.start,n.end,a),s=a.map((t,r)=>vo(e,t,0,G(e.file,i.kind===`Name`?n.start:o[r]),!0)),c=Jo(e,s,t.body);return K(e,`$UnboundedChoose`,[c],r,{unbounded:s})}let o=q(e,t.set),s=U(e.file,t.set),c=eo(e.file,n.start,s.start,a),l=a.map((t,n)=>vo(e,t,0,G(e.file,c[n]),!0)),u=Jo(e,l,t.body);return K(e,`$BoundedChoose`,[u],r,{bounded:[l],tupleOrs:[i.kind===`Tuple`],ranges:[o]})})},fs=(e,t)=>{if(Lo(t.operator)||Ro(t.operator)||t.args.length>2||ro(e.contexts,qe(t.operator))!==void 0)return;let n=U(e.file,t);if(e.file.tokens[n.start].text===t.operator&&H(e.file,n.start+1,`(`))return;let r=jo(e.file,t.args[0]),i=t.args.length===1&&r.start!==n.start,a=i?n.start:r.end+1,o=Xa(e.file,a);return{index:a,name:i&&o===`-`?`-.`:o,fixity:i?`prefix`:t.args.length===2?`infix`:`postfix`}},q=(e,t)=>{let n=fo(e.file,t);switch(t.kind){case`Number`:return{...V(e.getId()),kind:`Numeral`,value:zo(t.text??String(t.value)),location:n};case`Decimal`:{let[r,i]=t.text.split(`.`),a=BigInt(r+i),o=a<=9223372036854775807n;return{...V(e.getId()),kind:`Decimal`,mantissa:a.toString(),exponent:String(o?-i.length:i.length),integralPart:r,fractionalPart:i,location:n}}case`String`:return wo(e,t.value,n);case`Identifier`:{let n=Wo(e,t);return Go(e,n),n}case`Apply`:{let r=fs(e,t);if(r!==void 0)return e.addError(G(e.file,r.index),`Could not find declaration or definition of symbol '${r.name}'.`),e.addError(n,`Couldn't resolve ${r.fixity} operator symbol \`${r.name}'.`),{...So(e),nullKind:`absent`};let i=Wo(e,t);return(Ro(t.operator)||Lo(t.operator))&&Go(e,i),i}case`Bracket`:return e.addError(G(e.file,U(e.file,t).start),"Unsupported expression type `['."),{...So(e),nullKind:`absent`};case`OperatorReference`:case`Lambda`:{let r=e.file.tokens[U(e.file,t).start],i=t.operator??r.text,a=ro(e.contexts,qe(i));return e.addError(n,r.text===`LAMBDA`?`LAMBDA expression used where an expression is required.`:a===void 0?`Could not find declaration or definition of symbol '${r.spelling??i}'.`:`The operator ${qe(i)} requires ${Sa(a)} arguments.`),{...So(e),nullKind:`absent`}}case`And`:case`Or`:return ts(e,t);case`Prime`:return K(e,`'`,[q(e,t.expression)],n);case`Unchanged`:return K(e,`UNCHANGED`,[q(e,t.expression)],n);case`Enabled`:return K(e,`ENABLED`,[q(e,t.expression)],n);case`Always`:return K(e,`[]`,[q(e,t.expression)],n);case`Eventually`:return K(e,`<>`,[q(e,t.expression)],n);case`If`:return K(e,`$IfThenElse`,[q(e,t.condition),q(e,t.consequent),q(e,t.alternative)],n);case`Case`:return ns(e,t);case`Let`:return us(e,t);case`Forall`:case`Exists`:return Yo(e,t.kind===`Forall`?`$BoundedForall`:`$BoundedExists`,t.bounds,U(e.file,t).start,t.body,n);case`UnboundedQuantifier`:{let r=U(e.file,t),i=U(e.file,t.body),a=eo(e.file,r.start,i.start,t.names),o=t.isTemporal?t.quantifier===`Forall`?`$TemporalForall`:`$TemporalExists`:t.quantifier===`Forall`?`$UnboundedForall`:`$UnboundedExists`;return _o(e,ya(),()=>{let r=t.names.map((t,n)=>vo(e,t,0,G(e.file,a[n]),!0)),i=Jo(e,r,t.body);return K(e,o,[i],n,{unbounded:r})})}case`Choose`:return ds(e,t);case`SetEnumeration`:return K(e,`$SetEnumerate`,t.elements.map(t=>q(e,t)),n);case`Tuple`:return K(e,`$Tuple`,t.elements.map(t=>q(e,t)),n);case`SetFilter`:{let r=q(e,t.bound.set),i=U(e.file,t);return _o(e,ya(),()=>{let a=ps(e,[t.bound],i.start,[r]),o=Jo(e,a.bounded.flat(),t.predicate);return K(e,`$SubsetOf`,[o],n,a)})}case`SetMap`:return Yo(e,`$SetOfAll`,t.bounds,U(e.file,t.expression).end+1,t.expression,n);case`FunctionConstruction`:return Yo(e,`$FcnConstructor`,t.bounds,U(e.file,t).start,t.body,n);case`FunctionSet`:return K(e,`$SetOfFcns`,[q(e,t.domain),q(e,t.range)],n);case`Record`:return os(e,`$RcdConstructor`,t);case`RecordSet`:return os(e,`$SetOfRcds`,t);case`Except`:return is(e,t);case`ExceptAt`:{let t=e.exceptStack[e.exceptStack.length-1],r=e.exceptSpecStack[e.exceptSpecStack.length-1];return t===void 0||r===void 0?(e.addError(n,`@ used where its meaning is not defined.`),So(e)):{...V(e.getId()),kind:`At`,except:t,component:r,location:r.location}}case`FunctionApplication`:{let r=q(e,t.function);if(da(r))return r;Go(e,r);let i=r.kind===`OpAppl`?r.operator:void 0,a=i?.kind===`OpDef`&&i.defKind===`UserDefined`?i.body:void 0;if(a?.kind===`OpAppl`&&(a.operator.name===`$NonRecursiveFcnSpec`||a.operator.name===`$RecursiveFcnSpec`)){let r=(a.bounded??[]).reduce((e,t,n)=>e+(a.tupleOrs?.[n]?1:t.length),0);if(t.args.length>=2&&r!==t.args.length)return e.addError(n,`Function '${i?.name}' is defined with ${r} parameters, but is applied to ${t.args.length} arguments.`),So(e)}let o=t.args.length===1?q(e,t.args[0]):K(e,`$Tuple`,t.args.map(t=>q(e,t)),n);return K(e,`$FcnApply`,[r,o],n)}case`FieldAccess`:{let r=q(e,t.record),i=U(e.file,t);return K(e,`$RcdSelect`,[r,wo(e,t.field,G(e.file,i.end))],n)}case`Product`:return K(e,`$CartesianProd`,t.factors.map(t=>q(e,t)),n);case`BoxAction`:case`AngleAction`:return K(e,t.kind===`BoxAction`?`$SquareAct`:`$AngleAct`,[q(e,t.action),q(e,t.subscript)],n);case`WeakFairness`:case`StrongFairness`:return K(e,t.kind===`WeakFairness`?`$WF`:`$SF`,[q(e,t.subscript),q(e,t.action)],n);case`Label`:return ms(e,t);case`Subexpression`:return Wo(e,t)}},ps=(e,t,n,r)=>{let i=Ko(t),a=n;return{bounded:i.map(t=>{let n=U(e.file,t[0].set),r=t.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),i=eo(e.file,a,n.start,r);return a=n.end+1,r.map((t,n)=>vo(e,t,0,G(e.file,i[n]),!0))}),tupleOrs:i.map(e=>e[0].pattern.kind===`Tuple`),ranges:r}},ms=(e,t)=>{let n=fo(e.file,t),r=e.labelScopes.at(-1);if(r===void 0)return e.addError(n,`Label not in definition or proof step.`),So(e);if(e.assumeProveState.isDeclared.slice(2,e.assumeProveState.depth+1).some(Boolean))return e.addError(n,`Label not allowed within scope of declaration in nested ASSUME/PROVE.`),So(e);if(e.exceptStack.length>0&&e.exceptSpecStack.length>0)return e.addError(n,`Labels inside EXCEPT clauses are not yet implemented.`),So(e);co(e);let i=q(e,t.body),a=lo(e),o=eo(e.file,U(e.file,t).start,U(e.file,t.body).start,t.params),s=t.params.map((n,r)=>{let i=ro(e.contexts,n);if(i?.kind===`FormalParam`)return i;let a=G(e.file,o[r]);return e.addError(a,`Illegal parameter ${n} of label \`${t.name}'.`),vo(e,n,0,a,!1)}),c={...V(e.getId()),kind:`Label`,name:t.name,params:s,body:i,labels:a,isAssumeProve:!1,location:n},l=/* @__PURE__ */ new Set;if(s.forEach(t=>{l.has(t)&&e.addError(n,`Repeated formal parameter ${t.name} \nin label \`${c.name}'.`),l.add(t)}),r.params.flat().forEach(t=>{l.delete(t)||e.addError(n,`Label ${c.name} must contain formal parameter \`${t.name}'.`)}),l.size>0){let t=[...l].map(e=>`${e.name} `).join(``);e.addError(n,`Label ${c.name} declares extra parameter(s) ${t}`)}r.labels.has(c.name)?e.addError(n,`Duplicate label \`${c.name}'.`):r.labels.set(c.name,c);let u=e.assumeProveState.goal;return u&&e.labelGoals.set(c,{scope:u,clause:e.assumeProveState.goalClause}),c},hs=(e,t,n,r)=>{let i=n.start;return t.params.map(t=>{let n=t.location?Ua(e.file,t.location):as(e.file,i,t.name),a=Ds(e.file,n,t.arity);i=a.end+1;let o=t.arity===1&&H(e.file,n+1,`_`);return vo(e,o?e.file.tokens[n].spelling??t.name:qe(t.name),t.arity,W(e.file,a),r)})},gs=(e,t)=>{let n=po(e,t.location);return t.isLocal&&!H(e,n.start,`LOCAL`)&&H(e,n.start-1,`LOCAL`)?{start:n.start-1,end:n.end}:n},_s=(e,t,n)=>{let r=gs(e.file,t),i=W(e.file,r),a=qe(t.name),o={start:t.isLocal?r.start+1:r.start,end:r.end},s=_o(e,ya(),()=>{let n=hs(e,t,o,!0),r=ro(e.contexts,a);if(r?.kind===`OpDef`&&r.inRecursive&&!r.isDefined){let t=r.params?.length===n.length&&n.every(e=>e.arity===0);r.letInLevel===e.curLevel?(t||e.addError(i,`Definition of ${r.name} has different arity than its RECURSIVE declaration.`),r.params=n):e.addError(i,`Recursive operator ${a} defined at wrong LET/IN level.`)}else r!==void 0&&e.addError(i,`Operator ${a} already defined or declared.`);return co(e),{params:n,body:q(e,t.body),existing:r}}),c=lo(e),l=s.existing,u=s.params,d=$a(e.file,r.start);if(l?.kind===`OpDef`&&l.inRecursive&&!l.isDefined&&l.letInLevel===e.curLevel){l.weights=u.map(()=>0),l.maxLevels=u.map(()=>3),l.isLeibnizArg=u.map(()=>!0),l.labels=c,vs(e,l,s.body,i,d),e.currentModule.definitions.push(l),n?.push(l);return}let f=yo(e,{name:a,params:u,body:s.body,isLocal:t.isLocal,location:i,preComments:d,labels:c});so(e,f),bo(e,f),e.currentModule.definitions.push(f),n?.push(f)},vs=(e,t,n,r,i)=>{t.isDefined=!0,t.body=n,t.location=r,t.preComments=i,t.inRecursive&&(e.unresolvedCount[e.curLevel]--,e.unresolvedSum--)},ys=(e,t,n)=>{let r=gs(e.file,t),i=W(e.file,r),a=ya(),o=t.isLocal?r.start+1:r.start,s=_o(e,a,()=>qo(e,t.bounds,o+1)),c=_o(e,a,()=>ro(e.contexts,t.name)),l=_o(e,a,()=>vo(e,t.name,0,i,c===void 0)),u=K(e,`$NonRecursiveFcnSpec`,[],i,{unbounded:[l],...s}),d=c?.kind===`OpDef`&&c.inRecursive&&!c.isDefined,f=d&&c.letInLevel===e.curLevel;f?c.arity!==0&&e.addError(i,`Function ${c.name} has operator arguments in its RECURSIVE declaration.`):d?e.addError(i,`Recursive function ${t.name} defined at wrong LET/IN level.`):c!==void 0&&e.addError(i,`Function name \`${t.name}' already defined or declared.`);let p=$a(e.file,r.start),m=c===void 0?yo(e,{name:t.name,params:[],body:u,isLocal:t.isLocal,location:i,preComments:p}):c.kind===`OpDef`&&(f||!d)?c:void 0;f?c.arity===0&&vs(e,c,u,i,p):c===void 0&&m!==void 0&&(so(e,m),bo(e,m)),m!==void 0&&(e.currentModule.definitions.push(m),n?.push(m)),e.functions.unshift({name:t.name,node:u}),co(e);let h=()=>Jo(e,s.bounded.flat(),t.body),g=m===void 0?h():_o(e,a,h),_=lo(e);m!==void 0&&(m.labels=_),e.functions.shift(),u.operands=[g],u.operator.name===`$NonRecursiveFcnSpec`&&(u.unbounded=void 0)},bs=(e,t)=>{e.unresolvedSum===0&&e.recursiveSectionCount++,e.unresolvedCount[e.curLevel]+=t.length,e.unresolvedSum+=t.length,t.forEach(t=>{let n=Os(e.file,t);e.getId();let r=Array.from({length:t.arity},()=>vo(e,``,0,void 0,!1)),i=yo(e,{name:qe(t.name),params:r,location:W(e.file,n),isDefined:!1,inRecursive:!0,inRecursiveSection:!0,recursiveSection:e.recursiveSectionCount,letInLevel:e.curLevel});so(e,i),e.recursiveDeclarations.push(i),e.currentModule.opDefsInRecursiveSection.push(i)})},xs=e=>{e.unresolvedCount[e.curLevel]!==0&&(e.recursiveDeclarations.filter(t=>t.letInLevel===e.curLevel&&!t.isDefined).forEach(t=>e.addError(t.location,`Symbol ${t.name} declared in RECURSIVE statement but not defined.`)),e.unresolvedSum-=e.unresolvedCount[e.curLevel])},Ss=(e,t,n,r)=>{e.getId();let i=_a(n.table).filter(e=>e.kind===`OpDecl`),a=i.flatMap(t=>{let n=ro(e.contexts,t.name);if(n===void 0)return[];let i=t.declKind===3||t.declKind===2&&t.arity===0;return i&&Do(e,n,[],r),[{op:t,expr:i?xo(e,n,[],r):To(e,n,r),isImplicit:!0}]}),o=(t,n)=>{(n.kind===`OpArg`?Sa(n.op):0)!==t.arity&&e.addError(n.location,`An operator must be substituted for symbol '${t.name}', and it must have arity ${t.arity}.`)},s=gs(e.file,t),c=to(e.file,s.start,s.end,`WITH`)+1;return t.substitutions.forEach(t=>{let i=to(e.file,c,s.end,t.name);i!==-1&&(c=U(e.file,t.expression).end+1);let l=Ca(n,qe(t.name));if(l?.kind!==`OpDecl`){e.addError(i===-1?r:G(e.file,i),`Identifier '${i===-1?t.name:Xa(e.file,i)}' 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 u=l.arity===0?q(e,t.expression):$o(e,t.expression,l);o(l,u);let d=a.find(e=>e.op.name===l.name);d&&!d.isImplicit?e.addError(fo(e.file,t.expression),`Multiple substitutions for symbol '${l.name}' in substitution.`):d?(d.expr=u,d.isImplicit=!1):a.push({op:l,expr:u,isImplicit:!1})}),a.filter(t=>t.isImplicit&&e.version!==`1.7.4`).forEach(e=>o(e.op,e.expr)),i.filter(e=>!a.some(t=>t.op.name===e.name)).forEach(t=>e.addError(r,`Substitution missing for symbol ${t.name} declared at ${ua(t.location)} \nand instantiated in module ${e.currentModule.name}.`)),a},Cs=(e,t,n,r,i,a,o=e.currentModule)=>(da(r)&&e.addError(a,t===`SubstIn`?`Substitution error, probably due to error
|
|
37
|
+
in module being instantiated.`:`Substitution error, probably due to error in module being instantiated.`),{...V(e.getId()),kind:t,substs:n,body:r,instantiatingModule:o,instantiatedModule:i,location:a}),ws=(e,t,n,r)=>{let i=gs(e.file,t),a=W(e.file,i),o=$a(e.file,i.start),s=t.name??``,c=ya(),l=t.isLocal?i.start+1:i.start;t.params.length>0&&e.contexts.push(c);let u=hs(e,t,{start:l,end:i.end},t.params.length>0),d=go(e,t.module),f=d.context,p=Ss(e,t,f,a);t.params.length>0&&e.contexts.pop(),_a(f.table).forEach(r=>{if(r.kind!==`OpDef`||r.isLocal||r.defKind!==`UserDefined`&&r.defKind!==`ModuleInstance`)return;let i=[...u,...r.params??[]],c=`${s}!${r.name}`,l=r.defKind===`UserDefined`?yo(e,{name:c,params:i,body:p.length>0&&r.body?Cs(e,`SubstIn`,p,r.body,d,a):r.body,isLocal:t.isLocal,location:a,source:r.source??r,preComments:o,labels:r.labels}):yo(e,{defKind:`ModuleInstance`,name:c,params:i,isLocal:t.isLocal,location:a,module:r.module,source:r.source??r,preComments:o});so(e,l),r.defKind===`UserDefined`&&bo(e,l),(n??e.currentModule.definitions).push(l)}),_a(f.table).forEach(r=>{if(r.kind!==`ThmOrAssumpDef`||r.isLocal)return;let i=p.length>0?Cs(e,`APSubstIn`,p,r.body,d,a):r.body,o={...V(e.getId()),kind:`ThmOrAssumpDef`,name:`${s}!${r.name}`,isTheorem:r.isTheorem,body:i,params:[...u,...r.params],isLocal:t.isLocal,location:a,module:e.currentModule,source:r.source??r,labels:r.labels,isLeibnizArg:[],isLeibniz:!1,opLevelCond:[],maxLevels:[],minMaxLevel:[]};so(e,o),(n??e.currentModule.definitions).push(o)});let m={...V(e.getId()),kind:`Instance`,name:s,isLocal:t.isLocal,params:u,module:d,substs:p,location:a};(r??e.currentModule.topLevel).push(m);let h=yo(e,{defKind:`ModuleInstance`,name:s,params:u,isLocal:t.isLocal,location:a,preComments:o});so(e,h),e.version!==`1.7.4`&&n?.push(h)},Ts=(e,t)=>(so(e,t),t),Es=(e,t,n=!0,r)=>{let i=gs(e.file,t),a=r??W(e.file,i),o=$a(e.file,i.start),s=go(e,t.module),c=s.context,l=Ss(e,t,c,a),u=t.isLocal,d=oo(s);_a(c.table).forEach(t=>{if(t.kind!==`OpDef`||t.defKind!==`UserDefined`||t.isLocal)return;let n=(n,r)=>{let i=yo(e,{name:t.name,params:t.params,body:r,isLocal:u,location:a,module:n,source:t.source??t,preComments:o,labels:t.labels});return so(e,i),i},r=t.module===void 0||oo(t.module),i=d||r?u?n(t.module,t.body):Ts(e,t):n(e.currentModule,t.body&&Cs(e,`SubstIn`,l,t.body,s,a));e.currentModule.definitions.push(i),bo(e,i)}),_a(c.table).forEach(t=>{if(t.kind!==`ThmOrAssumpDef`||t.isLocal)return;let r=(n,r)=>{let i={...t,...V(e.getId()),body:r,isLocal:u,location:a,module:n,source:t.source??t};return so(e,i),i},i=d?u?r(t.module,t.body):Ts(e,t):oo(t.module)?u?r(e.currentModule,t.body):t:r(e.currentModule,Cs(e,`APSubstIn`,l,t.body,s,a));n&&e.currentModule.definitions.push(i)});let f={...V(e.getId()),kind:`Instance`,name:void 0,isLocal:u,params:[],module:s,substs:l,location:a};return n&&e.currentModule.topLevel.push(f),f},Ds=(e,t,n)=>n===0?{start:t,end:t}:H(e,t,`_`)?{start:t,end:H(e,t+2,`_`)?t+2:t+1}:H(e,t+1,`(`)?{start:t,end:Ga(e,t+1)}:{start:t,end:H(e,t+1,`_`)?t+1:t},Os=(e,t)=>Ds(e,po(e,t.location).start,t.arity),ks=(e,t,n)=>{let r=Os(e.file,t);t.name===`@`&&n===3&&e.addError(W(e.file,r),`Attempted to declare '@' as a variable.`);let i={...V(e.getId()),levelChecked:1,level:+(n===3),kind:`OpDecl`,name:qe(t.name),arity:t.arity,declKind:n,location:W(e.file,r),module:e.currentModule};return n===2&&(i.levelParams.add(i),i.allParams.add(i)),so(e,i),i},As=(e,t,n)=>{e.unresolvedSum!==0&&e.addError(mo(e.file,t),`${n} may not appear within a recursive definition section.`)},js={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}},Ms=(e,t)=>{let n=ho(e,t.name)??(t.name===e.currentModule.name?e.currentModule:void 0);return n===void 0?(e.addError(G(e.file,Ua(e.file,t.location)+1),`Module \`${t.name}' used without being extended or instantiated.`),[]):[n]},Ns=(e,t)=>t.flatMap(t=>{if(t.kind===`ModuleFact`)return Ms(e,t);let n=t.kind===`ExceptAt`?{kind:`Identifier`,name:`@`,location:t.location}:t,r=Aa(n);if(r===void 0||!ja(r))return[q(e,t)];let i=Uo(e,n,0,!0,!1);if(i.kind===`ThmOrAssumpDef`)throw new s(`Expected a fact`);return[i]}),Ps=(e,t)=>t.flatMap(t=>{if(t.kind===`ModuleFact`)return Ms(e,t);if(Io(e,t))return[];let n=Uo(e,t.kind===`OperatorReference`?{kind:`Identifier`,name:t.operator,location:t.location}:t,-1,!1,!0);return n.kind===`OpDef`||n.kind===`ThmOrAssumpDef`&&!n.name.startsWith(`<`)?[n]:(e.addError(fo(e.file,t),`DEF clause entry should describe a defined operator.`),[])}),Fs=(e,t,n)=>{t.isOnly||t.facts.length+t.defs.length>0||e.addError(n,`Empty BY, USE, or HIDE`)},Is=(e,t)=>{let n=mo(e.file,t.location);Fs(e,t,n);let r=Ns(e,t.facts),i=Ps(e,t.defs);return r.length+i.length===0&&e.addError(n,`Empty USE or HIDE statement.`),t.kind===`Hide`&&r.filter(e=>e.kind===`OpAppl`&&e.operator.kind!==`ThmOrAssumpDef`).forEach(t=>e.addError(t.location,`The only expression allowed as a fact in a HIDE is
|
|
38
38
|
the name of a theorem, assumption, or step.`)),{...V(e.getId()),kind:`UseOrHide`,facts:r,defs:i,isOnly:t.isOnly,isHide:t.kind===`Hide`,location:n}},Ls=(e,t)=>{let n=po(e.file,t.location),r=t.set&&q(e,t.set),i=as(e.file,n.start,t.name),a=js[t.level],o={...V(e.getId()),levelChecked:1,level:a.level,kind:`OpDecl`,name:qe(t.name),arity:t.arity,declKind:a.declKind,location:W(e.file,Ds(e.file,i,t.arity)),module:e.currentModule};return so(e,o),{...V(e.getId()),kind:`NewSymb`,declaration:o,set:r,location:W(e.file,n)}},Rs=(e,t,n,r)=>{let i=po(e.file,t.location),a=Za(e.file,i.start-1),o=U(e.file,t.conclusion).start,s=e.file.tokens.findLastIndex((e,t)=>t<o&&e.kind===`Keyword`&&e.text===`PROVE`),c=W(e.file,{start:a?i.start-1:i.start,end:i.start});a!==Za(e.file,s-1)&&e.addError(c,a?`[]ASSUME matched by PROVE instead of []PROVE`:`ASSUME matched by []PROVE instead of PROVE`);let l=e.getId();n>1&&e.contexts.push(ya()),a&&e.contexts.some(t=>e.assumeContexts.has(t))&&e.addError(c,`[]ASSUME used within the scope of an ordinary ASSUME's assumptions`),a||e.assumeContexts.add(no(e.contexts));let u={isDeclaredBefore:[!1],hasGoal:r!==void 0,isSuffices:r?.isSuffices??!1,isInProof:!0};e.assumeProveState.depth=n,e.assumeProveState.isDeclared[n]=!1,n===1&&(e.assumeProveState.goal=r&&u,e.assumeProveState.goalClause=0);let d=t.assumptions.map((t,r)=>{let i=t.kind===`NewSymbol`,a=t.kind===`AssumeProve`?Rs(e,t,n+1):i?Ls(e,t):q(e,t);return e.assumeProveState.depth=n,i&&(e.assumeProveState.isDeclared[n]=!0),u.isDeclaredBefore.push(u.isDeclaredBefore[r]||i),n===1&&e.assumeProveState.goalClause++,a}),f=q(e,t.conclusion);n>1&&e.contexts.pop(),e.assumeProveState.depth=n-1,n===1&&(e.assumeProveState.goal=void 0);let p={...V(l),kind:`AssumeProve`,assumptions:d,goal:f,isSuffices:u.isSuffices,isBoxed:a,location:W(e.file,{start:a?i.start-1:i.start,end:i.end})};return e.assumeProveScopes.set(p,u),p},zs=(e,t,n,r,i,a,o=!0)=>({...V(t),kind:`ThmOrAssumpDef`,name:n,isTheorem:o,body:r,params:[],isLocal:!1,location:i,module:e.currentModule,source:void 0,labels:a,isLeibnizArg:[],isLeibniz:!1,opLevelCond:[],maxLevels:[],minMaxLevel:[]}),Bs=(e,t)=>{let n=mo(e.file,t.location);t.kind===`By`&&Fs(e,t,n);let r=t.kind===`By`?Ns(e,t.facts):[],i=t.kind===`By`?Ps(e,t.defs):[];return t.kind===`By`&&e.getId(),t.kind===`By`&&r.length+i.length===0&&e.addError(n,`Empty BY`),{...V(e.getId()),kind:`LeafProof`,facts:r,defs:i,isOmitted:t.kind===`Omitted`,isOnly:t.kind===`By`&&t.isOnly,location:n}},Vs=(e,t,n)=>{let r=W(e.file,n);switch(t.kind){case`Have`:return K(e,`$Have`,[q(e,t.expression)],r);case`Case`:return K(e,`$Pfcase`,[q(e,t.expression)],r);case`Witness`:return K(e,`$Witness`,t.expressions.map(t=>q(e,t)),r);case`Qed`:return K(e,`$Qed`,[],r);case`Take`:case`Pick`:{let i=t.kind===`Pick`,a=i?`$Pick`:`$Take`;i&&e.contexts.push(ya());let o=n=>t.kind===`Pick`?[Jo(e,n,t.body)]:[];if(t.bounds.length>0){let i=qo(e,t.bounds,n.start),s=o(i.bounded.flat());return K(e,a,s,r,i)}let s=eo(e.file,n.start,n.end+1,t.names),c=t.names.map((t,n)=>vo(e,t,0,G(e.file,s[n]),!0)),l=o(c);return K(e,a,l,r,{unbounded:c})}}},Hs=(e,t)=>{if((t.kind===`And`||t.kind===`Or`)&&!t.isBulleted)return!0;if(t.kind!==`Apply`||t.args.length!==2)return!1;let n=jo(e,t.args[0]),r=U(e,t).start;return n.start===r&&!H(e,n.end+1,`(`)},Us=(e,t)=>{if(t.kind!==`Steps`)return Bs(e,t);let n=ya();e.contexts.push(n);let r=[],i=[],a,o=(t,n,i)=>{if(t.kind===`Define`){let n=t.definitions.map(t=>{let n=[];t.kind===`Instance`?ws(e,t,n,r):t.kind===`Function`?ys(e,t,n):_s(e,t,n);let i=n[t.kind===`Instance`?n.length-1:0];if(i?.kind!==`OpDef`)throw new s(`A DEFINE step defines no operator`);return i});return{...V(e.getId()),kind:`DefStep`,defs:n,location:W(e.file,i)}}if(t.kind===`Use`||t.kind===`Hide`)return{...Is(e,t),location:W(e.file,n)};if(t.kind===`Instance`)return Es(e,t,!1,W(e.file,i))},c=t.steps.map(t=>{let n=po(e.file,t.location),r=Ka(e.file,t.head),c={start:r.start+1,end:r.end},l=t.body;t.name!==void 0&&/^<[*+]>/.test(t.token)&&e.addError(G(e.file,n.start),`<*> and <+> cannot be used for a named step.`),t.name!==void 0&&co(e);let u=t.name===void 0?void 0:e.getId();l.kind!==`Assert`&&(a=void 0);let d=o(l,n,c);if(d!==void 0)return t.name!==void 0&&so(e,yo(e,{defKind:`NumberedProofStep`,name:t.name,location:W(e.file,n),labels:lo(e),step:d})),d;let f=l.kind===`Assert`&&l.statement.kind===`AssumeProve`;f&&(a=void 0);let p=l.kind===`Assert`&&l.isSuffices,m=ya(),h=l.kind===`Assert`?(n=>{if(n.kind===`AssumeProve`){let r=_o(e,m,()=>Rs(e,n,1,t.name===void 0?void 0:{isSuffices:p}));return r.isSuffices=p,r}if(p){let t=q(e,n);return K(e,`$Suffices`,[t],W(e.file,c))}let r=a!==void 0&&n.kind===`Apply`&&Hs(e.file,n)&&n.args[0].kind===`ExceptAt`,i=r?q(e,n.args[1]):void 0,o=r?xo(e,Eo(e,n.operator,fo(e.file,n)),[K(e,`$Nop`,[a],fo(e.file,n.args[0])),i],fo(e.file,n)):q(e,n),s=o.kind===`OpAppl`?o.operands[1]:void 0;return a=Hs(e.file,n)?s:void 0,o})(l.statement):Vs(e,l,c);if(h===void 0)throw new s(`Unexpected proof step ${l.kind}`);let g=l.kind===`Pick`?e.contexts.pop():void 0,_=t.name===void 0||u===void 0?void 0:zs(e,u,t.name,h,G(e.file,Ua(e.file,t.location)),lo(e));_&&so(e,_);let v=f&&!p;v&&e.contexts.push(m);let y=t.proof&&Us(e,t.proof);return v&&e.contexts.pop(),uo(e,h),f&&p&&(i.push(m),e.contexts.push(m)),g?.symbols.forEach(t=>so(e,t)),{...V(e.getId()),kind:`Theorem`,definition:_,body:h,proof:y,isSuffices:p,location:W(e.file,n)}});return i.forEach(()=>{e.contexts.pop()?.symbols.forEach(e=>xa(n,e))}),e.contexts.pop(),{...V(e.getId()),kind:`NonLeafProof`,steps:c,instances:r,proofLevel:t.level,location:mo(e.file,t.location)}},Ws=(e,t)=>{let n=mo(e.file,t.location),r=t.statement,i=ya();t.name!==void 0&&co(e);let a=t.name===void 0?void 0:e.getId();r.kind===`AssumeProve`&&e.contexts.push(i);let o=r.kind===`AssumeProve`?Rs(e,r,1,t.name===void 0?void 0:{isSuffices:!1}):q(e,r),s=t.name===void 0||a===void 0?void 0:zs(e,a,t.name,o,n,lo(e));s&&(r.kind===`AssumeProve`&&e.contexts.pop(),so(e,s),e.currentModule.definitions.push(s),r.kind===`AssumeProve`&&e.contexts.push(i));let c=t.proof&&Us(e,t.proof);r.kind===`AssumeProve`&&e.contexts.pop(),uo(e,o);let l={...V(e.getId()),kind:`Theorem`,definition:s,body:o,proof:c,isSuffices:!1,location:n};e.currentModule.topLevel.push(l)},Gs=(e,t)=>{let n=mo(e.file,t.location);t.name!==void 0&&co(e);let r=q(e,t.expression),i=t.name===void 0?void 0:zs(e,e.getId(),t.name,r,n,lo(e),!1);i&&(so(e,i),e.currentModule.definitions.push(i));let a={...V(e.getId()),kind:`Assume`,definition:i,body:r,location:n};e.currentModule.topLevel.push(a)},Ks=e=>e.kind===`OpDef`||e.kind===`FormalParam`?`definition`:`declaration`,qs=e=>[...e.kind===`Let`?e.instances??[]:[],...Te(e).flatMap(qs)],Js=e=>e.kind===`AssumeProve`?[...e.assumptions,e.conclusion].flatMap(e=>e.kind===`NewSymbol`?[]:Js(e)):qs(e),Ys=e=>e?.kind===`Steps`?e.steps.flatMap(e=>[...e.body.kind===`Instance`?[e.body]:[],...e.body.kind===`Define`?e.body.definitions.flatMap(e=>e.kind===`Instance`?[e]:[]):[],...Ys(e.proof)]):[],Xs=(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.module)return n.has(t.module);return e.modules.some(e=>e.name===t.module&&me(e.location,t.location))},Zs=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`?qs(e.definition.body):e.kind===`Theorem`&&s?[...Js(e.theorem.statement),...Ys(e.theorem.proof)]:e.kind===`Assumption`&&s?qs(e.assumption.expression):[]).filter(e=>l(e.module)&&!Xs(a,e)).map(e=>e.module),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}},Qs=(e,t,n={})=>{let r=[],i=(e,t)=>la(r,{location:e,text:t,isWarning:!1}),a=(e,t)=>la(r,{location:e,text:t,isWarning:!0}),o=n.version===`1.7.4`?-1:0,c=()=>++o,l=0;n.version!==`1.7.4`&&ca(c);let u=ca(c);c();let f=new Map(u.map(e=>[e.name,e])),p=/* @__PURE__ */ new Map,m=/* @__PURE__ */ new Map,h=(e,t)=>{let r=e===n.rootFileName&&n.rootFilePath||`${e}.tla`,i=t=>new d(`Could not parse module ${e} from file ${r}`,e,t),a=n.version===`1.7.4`?pe(t):void 0;if(a!==void 0)throw i(a);try{return de(Qa(t))}catch(e){throw e instanceof s?i(Je(t)??`***Parse Error***\n${e.message}`):e}},g=(e,t,r)=>{let i=m.get(e);if(i)return i;if(t===void 0)throw new S(e,r,n.version!==`1.7.4`);n.onParse?.(e);let a=h(e,t);if(a.name!==e)throw new d(`File name '${e}' does not match the name '${a.name}' of the top level module it contains.`,void 0);let o={file:Va(a.name,t),module:a};return m.set(e,o),o},_=[],v=/* @__PURE__ */ new Set,y=[],b=(e,n,r)=>{let i=y.indexOf(e);if(i!==-1)throw new d(`Circular dependency among .tla files; dependency cycle is:\n\n ${[...y.slice(i),e].map(e=>`${e}.tla`).join(` --> `)}`,void 0);if(v.has(e))return;v.add(e),y.push(e);let a=D(e,g(e,n,r).module);[...a.extendees,...a.instancees].forEach(n=>b(n,t(n),e)),y.pop(),_.push(e)},x=/* @__PURE__ */ new Set,C=(e,t)=>x.has(`${e} ${t}`),w=(e,t,n)=>{let r=m.get(e);if(!r||n.has(e))return;n.add(e);let i=D(e,r.module),a=i[t].find(t=>!C(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=C(e,r)?w(r,t,n):void 0;if(i)return i}},T=n=>{g(n,e);let r=()=>w(n,`extendees`,/* @__PURE__ */ new Set)??w(n,`instancees`,/* @__PURE__ */ new Set);for(let e=r();e!==void 0;e=r())m.has(e.name)||g(e.name,t(e.name),e.namingModule),x.add(`${e.importer} ${e.name}`)},E=n.rootFileName??h(``,e).name,D=(e,t)=>{let r=Zs(t);return e!==E||n.rootExtendees===void 0||(r.extendees.splice(t.extends.length,0,...n.rootExtendees),n.rootExtendees.forEach(t=>{r.importers.has(t)||r.importers.set(t,e)})),r};T(E),b(E,e);let ee=(e,t,r,o)=>{let s={kind:`Module`,id:c(),name:e.name,location:mo(t,e.location),extendees:[],context:no(o),topLevel:[],definitions:[],opDefsInRecursiveSection:[],isLevelChecked:!1,levelCorrect:!0,argLevelParams:/* @__PURE__ */ new Map,levelConstraints:/* @__PURE__ */ new Map,argLevelConstraints:/* @__PURE__ */ new Map,records:[]};r&&r.definitions.push(s);let u={version:n.version,addError:i,addWarning:a,getId:c,builtinsByName:f,externalModules:p,nullApplicationId:l,file:t,contexts:o,currentModule:s,curLevel:0,unresolvedCount:[0],unresolvedSum:0,recursiveSectionCount:0,functions:[],exceptStack:[],exceptSpecStack:[],labelScopes:[],assumeContexts:/* @__PURE__ */ new WeakSet,assumeProveState:{depth:0,isDeclared:[],goal:void 0,goalClause:0},assumeProveScopes:/* @__PURE__ */ new WeakMap,labelGoals:/* @__PURE__ */ new WeakMap,recursiveDeclarations:[],selectorToNode:Ra({version:n.version,resolveSymbol:e=>ro(o,e),resolveSynonym:qe,generateExpression:e=>q(u,e),generateArgument:(e,t,n,r)=>es(u,e,t,n,r),createOpAppl:(e,t,n)=>{let r=xo(u,e,t,n);return Do(u,e,t,n),r},createOpArg:(e,t)=>To(u,e,t),createFormalParam:(e,t,n)=>vo(u,e,t,n,!1),createLambda:(e,n,r)=>yo(u,{name:`LAMBDA`,params:e,body:n,location:r,preComments:$a(t,Ua(t,{line:r.beginLine,column:r.beginColumn}))}),copySubstIn:(e,t)=>Cs(u,`SubstIn`,e.substs,t,e.instantiatedModule,e.location,e.instantiatingModule),getBuiltin:e=>Co(u,e),addError:(e,t)=>(i(e,t),So(u)),isOutOfLabelScope:e=>{let t=u.labelGoals.get(e);return t!==void 0&&t.scope.isDeclaredBefore[t.clause]&&t.scope.isSuffices===t.scope.isInProof},isOutOfClauseScope:(e,t)=>{let n=u.assumeProveScopes.get(e);return n!==void 0&&n.isDeclaredBefore[t-1]&&(!n.hasGoal||n.isSuffices===n.isInProof)}})};return e.extends.forEach(e=>{let t=go(u,e);s.extendees.push(t);let n=no(o);t.context.symbols.forEach(e=>{if(e.kind!==`Module`&&e.kind!==`FormalParam`&&e.kind!==`OpDecl`&&e.isLocal)return;let t=e.kind===`Module`?wa(n,e.name):Ca(n,e.name);t===void 0?xa(n,e):t!==e&&t.kind!==e.kind?i(e.location,`The ${Ks(e)} of '${e.name}' conflicts with \nits ${Ks(t)} at ${ua(t.location)}.`):t!==e&&!ao(t,e)&&a(e.location,`Warning: the ${Ks(t)} of '${e.name}' conflicts with \nits ${Ks(t)} at ${ua(t.location)}.`)}),s.topLevel.push(...t.topLevel)}),e.units.forEach(e=>{switch(e.kind){case`Variables`:As(u,e.location,`A VARIABLE declaration`),e.declarations.forEach(e=>ks(u,e,3));break;case`Constants`:As(u,e.location,`A declaration`),e.declarations.forEach(e=>ks(u,e,2));break;case`Recursive`:bs(u,e.declarations);break;case`Definition`:e.definition.kind===`Function`?ys(u,e.definition,void 0):_s(u,e.definition,void 0);break;case`Instance`:e.instance.name===void 0?Es(u,e.instance):ws(u,e.instance,void 0,void 0);break;case`Assumption`:As(u,e.assumption.location,`An ASSUME`),Gs(u,e.assumption);break;case`Theorem`:As(u,e.theorem.location,`A THEOREM`),Ws(u,e.theorem);break;case`Use`:As(u,e.use.location,`A USE or HIDE`),s.topLevel.push(Is(u,e.use));break;case`Module`:{As(u,e.module.location,`A MODULE `);let n=ee(e.module,t,s,[...o,ya()]),r=ho(u,n.name);r===void 0?xa(no(o),n):r!==n&&i(n.location,`Multiply-defined module '${n.name}': this definition or declaration conflicts \nwith the one at ${ua(r.location)}.`);break}}}),xs(u),s},O=_.map(e=>{n.onAnalyze?.(e),l=Array.from({length:4},c)[1];let t=g(e,void 0),i=ya();u.toReversed().forEach(e=>xa(i,e));let a=ee(t.module,t.file,void 0,[i]);return p.set(e,a),n.onModule?.(a,r),a});return{root:O[O.length-1],modules:O,messages:r}},$s=(e,t,n,r)=>la(e.messages,{location:t,text:n,isWarning:!1,...r!==void 0&&!e.isTlc174&&{code:r}}),J=(e,t)=>{for(let n of t)e.add(n)},ec=(e,t,n)=>`${e.id}:${t}:${n.id}`,tc=(e,t,n,r)=>{e.set(ec(t,n,r),{op:t,index:n,param:r})},nc=(e,t,n=()=>!0)=>{t.forEach((t,r)=>{n(t)&&e.set(r,t)})},rc=(e,t,n)=>{e.set(t,Math.min(n,e.get(t)??3))},ic=(e,t,n=()=>!0)=>{t.forEach((t,r)=>{n(r)&&rc(e,r,t)})},ac=(e,t)=>`${e.id}:${t}`,oc=(e,t,n,r)=>{let i=ac(t,n),a=e.get(i)?.level??0;e.set(i,{param:t,position:n,level:Math.max(r,a)})},sc=(e,t,n=()=>!0)=>{t.forEach(t=>{n(t)&&oc(e,t.param,t.position,t.level)})},cc=(e,t)=>{e.levelParams=t.levelParams,e.allParams=t.allParams,e.levelConstraints=t.levelConstraints,e.argLevelConstraints=t.argLevelConstraints,e.argLevelParams=t.argLevelParams},lc=(e,t)=>{J(e.levelParams,t.levelParams),J(e.allParams,t.allParams),ic(e.levelConstraints,t.levelConstraints),sc(e.argLevelConstraints,t.argLevelConstraints),nc(e.argLevelParams,t.argLevelParams)},uc=(e,t)=>t.includes(e.op)||t.includes(e.param),dc=e=>e.kind===`OpDecl`||e.kind===`FormalParam`,fc=e=>e.kind!==`Module`,pc=e=>e.kind===`OpDef`||e.kind===`ThmOrAssumpDef`,mc=(e,t)=>e.kind===`OpDef`&&e.arity<0?0:t,hc=(e,t)=>e.kind===`OpDef`?e.weights[mc(e,t)]??0:0,gc=(e,t)=>e.maxLevels[mc(e,t)]??3,_c=(e,t,n)=>e.minMaxLevel?.[t]?.[n]??0,vc=(e,t)=>e.kind===`OpDef`?e.isLeibnizArg?.[mc(e,t)]??!0:e.isLeibnizArg[t]??!0,yc=(e,t,n,r)=>e.opLevelCond?.[t]?.[n]?.[r]??!1,bc=e=>[...e.unbounded??[],...(e.bounded??[]).flat()],xc=(e,t)=>t.find(t=>t.op===e)?.expr,Sc=(e,t,n)=>{let r=xc(e,t);return r===void 0?/* @__PURE__ */ new Set([e]):n?r.allParams:r.levelParams},Cc=(e,t)=>{let n=/* @__PURE__ */ new Map;return e.forEach((e,r)=>{let i=xc(e.op,t);if(i===void 0){n.set(r,e);return}if(i.kind!==`OpArg`||!dc(i.op))return;let a=i.op;Sc(e.param,t,!1).forEach(t=>tc(n,a,e.index,t))}),n},wc=(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;Sc(r,t,!1).forEach(e=>rc(a,e,i))}),e.argLevelParams.forEach(e=>{let n=xc(e.op,t);if(n?.kind!==`OpArg`||n.op.kind!==`OpDef`)return;Y(n.op,r,i);let o=gc(n.op,e.index);Sc(e.param,t,!1).forEach(e=>rc(a,e,o))}),a},Tc=(e,t,n,r)=>{let i=/* @__PURE__ */ new Map;return e.argLevelConstraints.forEach(e=>{let n=xc(e.param,t);n===void 0?oc(i,e.param,e.position,e.level):n.kind===`OpArg`&&dc(n.op)&&oc(i,n.op,e.position,e.level)}),e.argLevelParams.forEach(e=>{let a=xc(e.param,t);if(a===void 0)return;let o=xc(e.op,t),s=o===void 0?e.op:o.kind===`OpArg`?o.op:void 0;s!==void 0&&dc(s)&&(Y(a,n,r),oc(i,s,e.index,a.level))}),i},Ec=(e,t)=>Ea(e,3).length>0||(Fc(e,t),Ta(e).some(e=>(e.body?.level??0)!==0))?!1:e.topLevel.every(e=>e.kind!==`Theorem`||e.level===0),Dc=(e,t,n)=>{e.minMaxLevel=t.map(e=>Array.from({length:e.arity},(t,r)=>n.argLevelConstraints.get(ac(e,r))?.level??0)),e.opLevelCond=t.map(e=>t.map(t=>Array.from({length:e.arity},(r,i)=>n.argLevelParams.has(ec(e,i,t))))),J(e.levelParams,n.levelParams),J(e.allParams,n.allParams),J(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(ac(t,n))}),nc(e.argLevelParams,n.argLevelParams,e=>!t.some(t=>t===e.op)||!t.some(t=>t===e.param))},Oc=(e,t,n,r,i)=>{e.operands.forEach((a,o)=>{if(a===void 0||(a.level>gc(t,o)&&(n&&Y(a,r,i)&&$s(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`||!pc(a.op)))return;let s=a.op;Y(s,r,i);let c=Sa(s);for(let l=0;l<c;l++){let c=_c(t,o,l);gc(s,l)>=c||(n&&Y(a,r,i)&&$s(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||!yc(t,o,l,u)||n.level<=gc(s,u)||(Y(a,r,i)&&Y(n,r,i)&&$s(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=Y(n,r,i);n.level<=2||(o&&$s(i,e.location,`Level error in applying operator ${t.name}:\nThe level of the range for the bounded variable ${ua(e.bounded?.[a]?.[0]?.location)} \nexceeds the maximum level allowed by the operator.`),e.levelCorrect=!1)})},kc=(e,t,n,r,i)=>{let a=t.params??[],o=t=>e.operands.find((e,n)=>a[n]===t);ic(e.levelConstraints,t.levelConstraints),e.operands.forEach(t=>{t!==void 0&&ic(e.levelConstraints,t.levelConstraints,e=>!n.has(e))}),e.ranges.forEach(t=>ic(e.levelConstraints,t.levelConstraints)),e.operands.forEach((n,r)=>{let i=gc(t,r);n?.levelParams.forEach(t=>rc(e.levelConstraints,t,i))}),e.operands.forEach((n,a)=>{if(n?.kind!==`OpArg`||!pc(n.op))return;let o=n.op;Y(o,r,i);let s=Sa(o);e.operands.forEach((n,r)=>{for(let i=0;i<s;i++){if(!yc(t,a,r,i))continue;let s=gc(o,i);n?.levelParams.forEach(t=>rc(e.levelConstraints,t,s)),!o.isLeibniz&&!vc(o,i)&&n&&J(e.nonLeibnizParams,n.allParams)}})}),t.argLevelParams.forEach(t=>{let n=o(t.op);n?.kind===`OpArg`&&pc(n.op)&&(Y(n.op,r,i),rc(e.levelConstraints,t.param,gc(n.op,t.index)))}),sc(e.argLevelConstraints,t.argLevelConstraints),e.operands.forEach(t=>{t&&sc(e.argLevelConstraints,t.argLevelConstraints)}),e.ranges.forEach(t=>sc(e.argLevelConstraints,t.argLevelConstraints)),e.operands.forEach((n,r)=>{if(n?.kind!==`OpArg`||!dc(n.op))return;let i=n.op;for(let n=0;n<i.arity;n++)oc(e.argLevelConstraints,i,n,_c(t,r,n));e.operands.forEach((n,a)=>{for(let o=0;o<i.arity;o++)n!==void 0&&yc(t,r,a,o)&&oc(e.argLevelConstraints,i,o,n.level)})}),t.argLevelParams.forEach(t=>{let n=o(t.op);n!==void 0&&(Y(n,r,i),oc(e.argLevelConstraints,t.op,t.index,n.level))}),e.operands.forEach(t=>{t!==void 0&&nc(e.argLevelParams,t.argLevelParams,e=>!n.has(e.param))}),e.ranges.forEach(t=>nc(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):(Y(a,r,i),a.levelParams.forEach(n=>tc(e.argLevelParams,t.op,t.index,n)))}else a.kind===`OpArg`&&dc(a.op)&&tc(e.argLevelParams,a.op,t.index,t.param)}),e.operands.forEach((n,r)=>{if(n?.kind!==`OpArg`||!dc(n.op))return;let i=n.op;e.operands.forEach((n,a)=>{for(let o=0;o<i.arity;o++)n!==void 0&&yc(t,r,a,o)&&n.levelParams.forEach(t=>tc(e.argLevelParams,i,o,t))})})},Ac=/* @__PURE__ */ new Map([[`\\land`,`\\land`],[`\\lor`,`\\lor`],[`=>`,`=>`],[`\\equiv`,`\\equiv`],[`$ConjList`,`Conjunction list`],[`$DisjList`,`Disjunction list`]]),jc=(e,t)=>{let n=(n,r)=>{$s(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.`)})},Mc=(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=>{Y(r,t,n)||(e.levelCorrect=!1)}),e.ranges.forEach(r=>{Y(r,t,n)||(e.levelCorrect=!1)});let i=e.operator;if(pc(i)){let r=Y(i,t,n);Oc(e,i,r,t,n),e.level=e.operands.reduce((e,t,n)=>t!==void 0&&hc(i,n)===1?Math.max(e,t.level):e,i.level),e.ranges.forEach(t=>{e.level=Math.max(e.level,t.level)}),J(e.levelParams,i.levelParams),J(e.allParams,i.allParams),J(e.nonLeibnizParams,i.nonLeibnizParams),e.operands.forEach((t,n)=>{t!==void 0&&(hc(i,n)===1&&J(e.levelParams,t.levelParams),J(e.allParams,t.allParams),J(e.nonLeibnizParams,t.nonLeibnizParams),vc(i,n)||J(e.nonLeibnizParams,t.allParams))}),e.ranges.forEach(t=>{J(e.levelParams,t.levelParams),J(e.allParams,t.allParams),J(e.nonLeibnizParams,t.nonLeibnizParams)});let a=new Set(bc(e));a.forEach(t=>{e.levelParams.delete(t),e.allParams.delete(t),e.nonLeibnizParams.delete(t)}),kc(e,i,a,t,n)}else Y(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)=>{J(e.levelParams,t.levelParams),J(e.allParams,t.allParams),J(e.nonLeibnizParams,t.nonLeibnizParams),ic(e.levelConstraints,t.levelConstraints),oc(e.argLevelConstraints,i,n,t.level),sc(e.argLevelConstraints,t.argLevelConstraints),t.levelParams.forEach(t=>tc(e.argLevelParams,i,n,t)),nc(e.argLevelParams,t.argLevelParams)});return jc(e,n),e.levelCorrect},Nc=(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||Y(e.step,t,n),e.levelCorrect;e.levelCorrect=Y(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))}),Dc(e,i,r),e.levelCorrect},Pc=(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=Y(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)}),Dc(e,e.params,e.body)),e.levelCorrect),Fc=(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),Nc(e,1,t),e.inRecursive&&(e.maxLevels.forEach((n,r)=>{n>=2||$s(t,e.location,`Argument ${r+1} of recursive operator ${e.name} is primed`)}),c=Math.max(c,e.level),J(o,e.levelParams),J(s,e.allParams))}),a.forEach(e=>{e.inRecursive&&(e.levelChecked=2),e.level=Math.max(e.level,c),J(e.levelParams,o),J(e.allParams,s)}),a.forEach(e=>{e.inRecursive&&(e.levelChecked=1),Nc(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(Fc(e,t)));let a=Ta(e);return a.forEach(e=>i(Nc(e,1,t))),Da(e).forEach(e=>i(Pc(e,1,t))),e.topLevel.forEach(e=>i(Y(e,1,t))),Ec(e,t)||Ea(e,2).forEach(t=>rc(e.levelConstraints,t,0)),a.forEach(t=>{ic(e.levelConstraints,t.levelConstraints),sc(e.argLevelConstraints,t.argLevelConstraints),nc(e.argLevelParams,t.argLevelParams,e=>!uc(e,t.params??[]))}),e.topLevel.forEach(t=>{ic(e.levelConstraints,t.levelConstraints),sc(e.argLevelConstraints,t.argLevelConstraints),nc(e.argLevelParams,t.argLevelParams)}),e.levelCorrect},Ic=(e,t,n,r)=>(e.levelChecked>=n||(e.levelChecked=n,t.forEach(t=>{fc(t)&&(t.kind!==`OpDef`||t.defKind!==`ModuleInstance`)&&(e.levelCorrect=Y(t,n,r)&&e.levelCorrect,e.level=Math.max(e.level,t.level),lc(e,t),J(e.nonLeibnizParams,t.nonLeibnizParams))})),e.levelCorrect),Lc=(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&&$s(t,e.body.location,`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`):n===`$Pfcase`?(e.body.level!==0&&$s(t,e.body.location,`Non-constant CASE for temporal goal.`),Lc(e.proof,t)):n===`$Qed`&&Lc(e.proof,t)})},Rc=(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;Fc(r,n)||(e.levelCorrect=!1),e.substs.forEach(r=>{Y(r.expr,t,n)||(e.levelCorrect=!1)});let i=Ec(r,n);e.substs.forEach(a=>{!i&&a.expr.level>a.op.level&&(Y(a.expr,t,n)&&$s(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||$s(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&&(Y(i.expr,t,n)&&$s(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=Y(o,t,n);for(let t=0;t<i.op.arity;t++){let a=r.argLevelConstraints.get(ac(i.op,t))?.level;a===void 0||gc(o,t)>=a||(s&&$s(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=Y(s,t,n);if(s.kind!==`OpDef`)return;let l=gc(s,i.index);o.expr.level<=l||(c&&Y(o.expr,t,n)&&$s(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 ic(e.levelConstraints,wc(r,e.substs,i,t,n),a),e.substs.forEach(t=>ic(e.levelConstraints,t.expr.levelConstraints,a)),sc(e.argLevelConstraints,Tc(r,e.substs,t,n),e=>a(e.param)),e.substs.forEach(t=>sc(e.argLevelConstraints,t.expr.argLevelConstraints,e=>a(e.param))),nc(e.argLevelParams,Cc(r.argLevelParams,e.substs),t=>!uc(t,e.params)),e.substs.forEach(t=>nc(e.argLevelParams,t.expr.argLevelParams,t=>!uc(t,e.params))),e.levelCorrect},Y=(e,t,n)=>{if(!fc(e))return Fc(e,n);switch(e.kind){case`OpAppl`:return Mc(e,t,n);case`OpDef`:return Nc(e,t,n);case`ThmOrAssumpDef`:return Pc(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=Y(r,t,n),r.kind===`Module`||(e.level=r.level,cc(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=>{Y(r,t,n)||(e.levelCorrect=!1)}),Y(e.body,t,n)||(e.levelCorrect=!1),e.instances.forEach(r=>{Y(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),ic(e.levelConstraints,e.body.levelConstraints),r.forEach(t=>ic(e.levelConstraints,t.levelConstraints)),sc(e.argLevelConstraints,e.body.argLevelConstraints),r.forEach(t=>sc(e.argLevelConstraints,t.argLevelConstraints)),nc(e.argLevelParams,e.body.argLevelParams),r.forEach(t=>{let n=t.kind===`OpDef`?t.params??[]:[];nc(e.argLevelParams,t.argLevelParams,e=>!uc(e,n))}),e.instances.forEach(t=>nc(e.argLevelParams,t.argLevelParams)),e.levelCorrect}case`Label`:{if(e.levelChecked>=t)return!0;e.levelChecked=t,e.params.forEach(e=>Y(e,t,n));let r=Y(e.body,t,n);return e.level=e.body.level,cc(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;Y(i,t,n),e.level=i.level;let a=[i];for(let i of r.slice(1))if(i!==void 0){if(Y(i,t,n),i===e.component)break;e.level=Math.max(e.level,i.level),a.push(i)}return a.forEach(t=>lc(e,t)),!0}case`SubstIn`:case`APSubstIn`:{if(e.levelChecked>=t)return e.levelCorrect;e.levelChecked=t,e.levelCorrect=!0;let r=e.body;Y(r,t,n)||(e.levelCorrect=!1),e.substs.forEach(r=>{Y(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=>J(e.levelParams,Sc(t,e.substs,!1))),e.kind===`APSubstIn`?r.allParams.forEach(t=>J(e.allParams,Sc(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),J(e.allParams,t.expr.allParams),J(e.nonLeibnizParams,t.expr.nonLeibnizParams),e.nonLeibnizParams.has(t.op)&&(e.nonLeibnizParams.delete(t.op),J(e.nonLeibnizParams,t.expr.allParams)))}));let i=Ec(e.instantiatedModule,n);return e.levelConstraints=wc(r,e.substs,i,t,n),e.argLevelConstraints=Tc(r,e.substs,t,n),e.argLevelParams=Cc(r.argLevelParams,e.substs),e.levelCorrect}case`Instance`:return Rc(e,t,n);case`Assume`:{if(e.levelChecked>=t)return!0;e.levelChecked=t;let r=Y(e.body,t,n),i=!e.definition||Y(e.definition,t,n);return e.level=e.body.level,cc(e,e.body),e.level!==0&&$s(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=Ic(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&&$s(n,e.location,`Non-constant bound of temporal PICK.`)}),i.level===3&&Lc(e.proof,n),r}case`LeafProof`:case`UseOrHide`:return Ic(e,e.facts,t,n);case`NonLeafProof`:return Ic(e,[...e.steps,...e.instances],t,n);case`DefStep`:return Ic(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=Y(e.set,t,n),e.level=Math.max(e.level,e.set.level),e.level===3&&(e.levelCorrect=!1,$s(n,e.location,`Level error:
|
|
39
39
|
Temporal formula used as set.`)),cc(e,e.set)),e.levelCorrect;case`AssumeProve`:return e.levelChecked>=t||(e.levelChecked=t,e.levelCorrect=!0,e.assumptions.forEach(r=>{Y(r,t,n)||(e.levelCorrect=!1)}),Y(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=>lc(e,t)),e.levelCorrect&&e.levelParams.forEach(t=>{t.kind===`OpDecl`&&t.declKind===2&&rc(e.levelConstraints,t,2)})),e.levelCorrect}},zc=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[]}},Bc=/* @__PURE__ */ new Map([[`Integers`,`Int`],[`Naturals`,`Nat`],[`Reals`,`Reals`]]),Vc=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&&Bc.get(e)===t.name||n(t))return!0}}return zc(e).some(n)};return n(e)},Hc=e=>e.operands.filter(e=>e?.kind===`OpAppl`),Uc=e=>{let t=e.operands[0];return t?.kind===`String`?t:void 0},Wc=e=>JSON.stringify([e.operands.length,...Hc(e).map(e=>Uc(e)?.value).sort()]),Gc=(e,t=/* @__PURE__ */ new Set)=>(e.extendees.forEach(e=>{t.has(e)||(t.add(e),Gc(e,t))}),t),Kc=e=>{let t=e.records.map(t=>({domain:Wc(t),warnings:Hc(t).flatMap(t=>{let n=Uc(t),r=n&&Ca(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 ${ua(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}]})})),n=new Set(t.flatMap(e=>e.warnings.length>0?[e.domain]:[])),r=/* @__PURE__ */ new Set;return[...[...Gc(e)].flatMap(e=>e.records),...e.records].forEach(e=>{let t=Wc(e);n.has(t)&&!r.has(t)&&Hc(e).some(Vc)&&r.add(t)}),t.flatMap(e=>r.has(e.domain)?[]:e.warnings)},qc=e=>`${ua(e.location)}\n\n${e.text}`,Jc=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=>`${qc(e)}\n\n\n`),n.length>0?`*** Warnings: ${n.length}\n\n`:``,...n.map(e=>`${qc(e)}\n\n\n`)].join(``)},Yc=4802,Xc=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),Zc=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))},Qc=e=>{try{return de(Qa(e))}catch(e){if(e instanceof s)return;throw e}},$c=(e,t)=>t===`1.7.4`&&pe(e)!==void 0?void 0:Qc(e)?.name,el=(e,t,n={})=>{let r=vt(e,`.tla`),i=Ge(n.version),a=n.fileName??r,o=I(e),s=o?At(e,`utf8`):i.get(r),c=[],l=e=>{c.push(e),n.onPrint?.(e)},u=e=>l(`${e}\n`),f=n.version===`1.7.4`,p=f&&n.isXmlExport,m=e=>{n.isXmlExport||u(e)},h=n.describeFile,g=/* @__PURE__ */ new Map([[r,o?`file`:`standard`]]),_=!1,v=[],b=!1,x=!1,S=ai(vr(),u),C=/* @__PURE__ */ new Map,w=[],T=()=>w.splice(0).forEach(e=>e.isError?n.onPrintError?.(`${e.text}\n`):u(e.text)),E=e=>{let t=C.get(e),r=t?.module.location.range;if(t===void 0||r===void 0)return;let i=t.text.split(/\r\n|\r|\n/),a=aa(S,i.slice(r.start.line-1,r.end.line),n.version),o=a.has(`TLA_DIVERGENCE_EXISTS`),s=a.has(`PCAL_DIVERGENCE_EXISTS`),c=o===s?void 0:`The ${o?`TLA+ translation`:`PlusCal algorithm`} in module ${e} has changed since its last translation.`;if(f){let t=o&&s?`The PlusCal algorithm and its TLA+ translation in module ${e} filename since the last translation.`:c;t===void 0?a.has(`ERROR_ENCOUNTERED`)&&w.push({text:`A unexpected problem was encountered attempting to validate the specification for ${e}`,isError:!0}):w.push({text:`!! WARNING: ${t}`,isError:!1});return}let l=o&&s?`Both the PlusCal algorithm and its TLA+ translation in module ${e} have changed since the last translation.`:c??(a.has(`ERROR_ENCOUNTERED`)?`An unexpected problem was encountered attempting to validate the specification for ${e}`:void 0);if(l===void 0)return;let u=!a.has(`ERROR_ENCOUNTERED`)||o||s;v.some(e=>e.text===l)||v.push({location:e,text:l,isWarning:u})},D=(e,t)=>{if(n.isXmlExport||C.has(e))return;let r=Qc(t);if(r===void 0||r.name!==e)return;let i=[...C.values()].filter(t=>Zc(t.module).includes(e));C.set(e,{text:t,module:r}),i.forEach(()=>E(e)),Zc(r).filter(t=>t!==e&&C.has(t)).forEach(E)},ee=()=>{if(T(),b)return;b=!0;let e=v.filter(e=>e.isWarning);e.length>0&&(m(`Warnings (${e.length}) during syntax parsing of ${a}:\n\n`),e.forEach(e=>m(`${qc(e)}\n\n\n`))),e.length!==v.length&&(u(Jc(v)),_=!0,x=!0)},O=e=>{let n=i.get(e),r=t(e),a=r===void 0&&n===void 0&&s!==void 0&&!f?ge(s,e):void 0,o=r??a;return g.set(e,r===void 0?a===void 0?`standard`:`root file`:`file`),o!==void 0&&D(e,o),o??n},k=(()=>{try{if(s===void 0)throw new d(`Cannot find source file for module ${a}`,void 0);return D(r,s),Qs(s,O,{rootFileName:r,rootFilePath:n.isXmlExport?`${a.replace(/\.tla$/,``)}.tla`:void 0,version:n.version,rootExtendees:n.rootExtendees,onParse:e=>{h&&u(`Parsing file ${h(e,g.get(e)??`file`)}`),e===r&&E(r),T()},onAnalyze:e=>{ee(),(h||p)&&!x&&u(`Semantic processing of module ${e}`)},onModule:(e,t)=>{if(x||(t.every(e=>e.isWarning)&&Fc(e,{messages:t,isTlc174:f}),t.length===0))return;if(t.some(e=>!e.isWarning)&&(_=!0),f)return u(`Semantic errors:\n\n${Jc(t)}`);let n=t.filter(e=>e.isWarning);n.length>0&&(m(`*** Warnings: ${n.length}\n`),n.forEach(e=>m(`${qc(e)}\n\n\n`)));let r=t.filter(e=>!e.isWarning);r.length!==0&&(u(`Semantic errors:\n\n*** Errors: ${r.length}\n`),r.forEach(e=>u(`${qc(e)}\n\n`)))}})}catch(e){if(_=!0,e instanceof y){u(`\nFatal errors while parsing TLA+ spec in file ${a}\n`),u(e.message),u(Jc(v));return}if(!(e instanceof d))throw e;let t={location:e.location,text:e.message,isWarning:!1},n=f&&e.parseError?.includes(` and token "" `);if(e.parseError!==void 0&&!n&&!p&&u(e.parseError),u(`\nFatal errors while parsing TLA+ spec in file ${a}\n`),n){u(`java.lang.NullPointerException: Cannot invoke "String.length()" because "str" is null`);return}if(f){u(`tla2sany.semantic.AbortException`),l(`*** Abort messages: 1\n\n${qc(t)}\n\n\n`);return}u(qc(t)),u(Jc(b?[t]:[...v,t]))}})();if(k!==void 0&&ee(),k!==void 0&&!_&&!n.isXmlExport&&!f){let e=k.modules.filter(e=>!Xc.has(e.name));h&&e.forEach(e=>u(`Linting of module ${e.name}`));let t=n.suppressedCodes?.includes(Yc)?[]:e.flatMap(Kc),r=n.errorCodes?.includes(Yc)?`Warning treated as error: `:``;t.forEach(e=>u(`${r}${qc(e)}\n\n\n`)),r&&t.length>0&&(_=!0)}return{text:c.join(``),isFailed:_,specification:x?void 0:k}},tl=e=>e.kind===`OpDef`&&e.defKind!==`BuiltIn`&&e.defKind!==`ModuleInstance`,nl=(e,t)=>e.context.symbols.find(e=>tl(e)&&e.name===t),rl=e=>T(new A(`Parsing or semantic analysis failed.Parsing or semantic analysis failed.${e}`),E.specParseError),il=(e,t,n,r,i,a)=>{let o=e=>rl(`Unknown location\n\n${e} while parsing breakpoint expression "${r}"`);try{Ye(e)}catch(e){throw e instanceof s?rl(`Syntax error while parsing breakpoint expression "${r}"`):e}let c=!1,l=!1,u=(()=>{try{return Qs(e,i,{version:a,onModule:(e,n)=>{let r=()=>n.every(e=>e.isWarning);if(!r())return;let i=Fc(e,{messages:n,isTlc174:a===`1.7.4`});e.name===t&&(c=!0,l=i&&r())}})}catch(e){throw e instanceof s?o(`Semantic error`):e}})();if(!c)throw o(`Semantic error`);if(!l)throw o(`Level-checking error`);let d=nl(u.root,n)?.level??0;if(d===3)throw rl(`Unknown location\n\nDebug expressions must be action-level or below; actual level: ${d} (Temporal)`)},al=(e,t,n,r,i)=>{let a=n=>n===t.name?e:r(n),o=Date.now();return n.map((e,n)=>{if(nl(t,e.expression))return{name:e.expression,module:void 0,source:void 0};let r=`__DebuggerModule__${o+n}`,s=`__DebuggerExpr__${o+n}`,c=`---- MODULE ${r} ----\nEXTENDS ${t.name}\n\n${s} == ${e.expression}\n====`;return il(c,r,s,e.expression,a,i),{name:s,module:r,source:c}})},ol=(1n<<63n)-1n,sl=[[-123456,-123456],[-1,0],[1e3,1003],[1005,1005],[1101,1102],[2e3,2001],[2100,2149],[2154,2274],[2279,2287],[2300,2301],[2400,2405],[2501,2502],[2772,2780],[3e3,3002],[3100,3114],[4e3,4002],[5001,5007],[7e3,7010],[2e4,2e4]],cl=[[4003,4005],[4200,4206],[4220,4224],[4240,4247],[4260,4262],[4270,4275],[4290,4294],[4310,4315],[4330,4337],[4350,4357]],ll=/* @__PURE__ */ new Map([[4800,`EXTENDED_MODULES_SYMBOL_UNIFICATION_AMBIGUITY`],[4801,`INSTANCED_MODULES_SYMBOL_UNIFICATION_AMBIGUITY`],[4802,`RECORD_CONSTRUCTOR_FIELD_NAME_CLASH`],[4803,`PLUSCAL_ALGORITHM_AND_TRANSLATION_CHANGED_SINCE_LAST_TRANSLATION`],[4804,`PLUSCAL_ALGORITHM_CHANGED_SINCE_LAST_TRANSLATION`],[4805,`PLUSCAL_TRANSLATION_CHANGED_SINCE_LAST_TRANSLATION`]]),ul=(e,t,n)=>({module:e,constant:n,operators:[{kind:`postcondition`,operator:t}]}),dl={json:ul(`_JsonTrace`,`_JsonTrace`,`_JsonTraceFile`),tla:ul(`_TLAPlusCounterExample`,`_TLAPlusCounterExample`,`_TLAPlusCounterExampleFile`),tlc:ul(`_TLCTrace`,`_TLCTrace`,`_TLCTraceFile`),tlcplain:ul(`_TLCTracePlain`,`_TLCTrace`,`_TLCTraceFile`),tlctespec:ul(`_TLCTESpec`,`_TLCTrace`,`_TLCTraceFile`),tlcaction:ul(`_TLCActionTrace`,`_TLCTrace`,`_TLCTraceFile`),dot:ul(`_DotTrace`,`_DotTrace`,`_DotTraceFile`)},fl=(e,t)=>({module:e,constant:`${t}InputFile`,operators:[{kind:`constraint`,operator:`${t}Constraint`},{kind:`view`,operator:`${t}View`}]}),pl={tlc:fl(`_TLCTrace`,`_TLCTrace`),json:fl(`_JsonTrace`,`_JsonTrace`)},ml=(e,t)=>e.some(e=>t>=e[0]&&t<=e[1]),hl=(e,t)=>{if(e===``)return[e];let n=e.split(t);for(;n.at(-1)===``;)n.pop();return n},gl=(e,t)=>[...new Set(e.filter(e=>t.includes(e)))].sort((e,t)=>e-t),_l=(e,t)=>{if(!/^[+-]?\d+$/.test(e))return;let n=BigInt(e);return BigInt.asIntN(t,n)===n?n:void 0},vl=e=>/^[+-]?(NaN|Infinity|(\d+\.?\d*|\.\d+)([eE][+-]?\d+)?[fFdD]?)$/.test(e.trim())?Number.parseFloat(e.trim().replace(/[fFdD]$/,``)):void 0,yl=()=>({specs:[],configPath:void 0,seed:0n,aril:0n,workers:1,coverage:void 0,livenessCheck:`default`,dump:void 0,fingerprintIndex:0,maxSetSize:void 0,isLazyValueExpanded:!0,isViewPrinted:!1,metadir:void 0,recoverDirectory:void 0,mode:`model-check`,dfidDepth:void 0,traceDepth:100,traceCount:void 0,scheduler:`random`,isTool:!1,isContinued:!1,isDeadlockChecked:!0,isWarningEnabled:!0,isTraceSpecForced:!1,isTraceSpecDisabled:!1,isTraceBinaryDisabled:!1,traceSpecPath:void 0,isDiffTrace:!1,suppressedCodes:[],errorCodes:[],userFile:void 0,invariants:[],moduleOperators:[]}),bl={"-modelcheck":()=>{},"-difftrace":e=>{e.isDiffTrace=!0},"-deadlock":e=>{e.isDeadlockChecked=!1},"-cleanup":()=>{},"-nowarning":e=>{e.isWarningEnabled=!1},"-gzip":()=>{},"-terse":e=>{e.isLazyValueExpanded=!1},"-continue":e=>{e.isContinued=!0},"-view":e=>{e.isViewPrinted=!0},"-debug":()=>{},"-tool":e=>{e.isTool=!0}},xl=(e,t,n)=>(r,i)=>{let a=_l(i,e);return a===void 0?`${t} But encountered ${i}`:n(r,a,i)},Sl=(e,t,n,r)=>({missing:t,apply:xl(32,n,(t,n)=>{let i=BigInt.asIntN(32,n*60000n);if(i<0n)return`Error: expect a nonnegative integer for -${e} option.`;r(t,Number(i)/6e4)})}),Cl={"-teSpecOutDir":{missing:`Error: expected a path for -teSpecOutDir option.`,apply:(e,t)=>{e.traceSpecPath=t}},"-userFile":{missing:`Error: need to specify the full qualified file.`,apply:(e,t)=>{try{Tt(kt(t,`w`))}catch{return`Error: Failed to create user output log file.`}e.userFile=t}},"-lncheck":{missing:`Error: expect a strategy such as final for -lncheck option.`,apply:(e,t)=>{e.livenessCheck=t.toLowerCase()}},"-config":{missing:`Error: expect a file name for -config option.`,apply:(e,t)=>{let n=t.replace(/\.cfg$/,``);e.configPath=n.endsWith(`.tla`)?n:`${n}.cfg`}},"-coverage":Sl(`coverage`,`Error: coverage report interval required.`,`Error: An integer for coverage report interval required.`,(e,t)=>{e.coverage=t}),"-checkpoint":Sl(`checkpoint`,`Error: checkpoint interval required.`,`Error: An integer for checkpoint interval is required.`,()=>{}),"-depth":{missing:`Error: trace length required.`,apply:xl(32,`Error: An integer for trace length required.`,(e,t)=>{e.traceDepth=Number(t)})},"-seed":{missing:`Error: seed required.`,apply:xl(64,`Error: An integer for seed required.`,(e,t)=>{e.seed=t})},"-aril":{missing:`Error: aril required.`,apply:xl(64,`Error: An integer for aril required.`,(e,t)=>{e.aril=t})},"-maxSetSize":{missing:`Error: maxSetSize required.`,apply:xl(32,`Error: An integer for maxSetSize required.`,(e,t,n)=>{if(t<1n)return`Error: Value in interval [0, ${ne}] for maxSetSize required. But encountered ${n}`;e.maxSetSize=Number(t)})},"-recover":{missing:`Error: need to specify the metadata directory for recovery.`,apply:(e,t)=>{e.recoverDirectory=t}},"-metadir":{missing:`Error: need to specify the metadata directory.`,apply:(e,t)=>{e.metadir=t}},"-workers":{missing:`Error: expect an integer or 'auto' for -workers option.`,apply:(e,t)=>{let n=t.trim().toLowerCase()===`auto`?BigInt(Vt()):_l(t,32);if(n===void 0)return`Error: worker number or 'auto' required. But encountered ${t}`;if(n<1n)return`Error: at least one worker required.`;e.workers=Number(n)}},"-dfid":{missing:`Error: expect a nonnegative integer for -dfid option.`,apply:xl(32,`Error: expect a nonnegative integer for -dfid option.`,(e,t)=>{if(t<0n)return`Error: expect a nonnegative integer for -dfid option.`;e.dfidDepth=Number(t)})},"-fp":{missing:`Error: expect an integer for -fp option.`,apply:xl(32,`Error: A number for -fp is required.`,(e,t)=>{if(t<0n||t>=131)return`Error: The number for -fp must be between 0 and 130 (inclusive).`;e.fingerprintIndex=Number(t)})},"-fpmem":{missing:`Error: fpset memory size required.`,apply:(e,t)=>{let n=vl(t);if(n===void 0||n<0)return`Error: An positive integer or a fraction for fpset memory size/percentage required. But encountered ${t}`;n>1&&process.stdout.write(`Using -fpmem with an abolute memory value has been deprecated. Please allocate memory for the TLC process via the JVM mechanisms and use -fpmem to set the fraction to be used for fingerprint storage.
|
|
40
40
|
`)}},"-fpbits":{missing:`Error: fpbits required.`,apply:xl(32,`Error: An integer for fpbits required.`,(e,t,n)=>t<0n||t>30n?`Error: Value in interval [0, 30] for fpbits required. But encountered ${n}`:void 0)}},wl={"-loadtrace":{name:`-loadTrace`,missing:`Error: A format and a file name for loading traces required.`,formats:pl},"-dumptrace":{name:`-dumpTrace`,missing:`Error: A format and a file name for dumping traces required.`,formats:dl}},Tl=e=>{let t=yl(),n=0,r=e=>({kind:`command-line`,error:e,isTool:t.isTool}),i=()=>({kind:`uncaught`,error:`java.lang.ArrayIndexOutOfBoundsException: Index ${e.length} out of bounds for length ${e.length}`,isTool:t.isTool}),a={tlc:[],sany:[]},o={tlc:[],sany:[]},s=()=>e[n],c=()=>e[n++];for(;n<e.length;){let l=c();if(Object.hasOwn(bl,l))bl[l](t);else if(Object.hasOwn(Cl,l)){let e=c();if(e===void 0)return r(Cl[l].missing);let n=Cl[l].apply(t,e);if(n!==void 0)return r(n)}else if(l===`-simulate`||l===`-generate`){t.mode=l===`-generate`?`generate`:`simulate`;let e=s();if(e===void 0||![`stats=`,`file=`,`num=`,`sched`].some(t=>e.includes(t)))continue;n++;let i=e.split(`,`).some(e=>e.startsWith(`file=`));t.scheduler=e.split(`,`).includes(`sched=rl`)?`rl`:e.split(`,`).includes(`sched=rlaction`)?`rlaction`:`random`;for(let n of e.split(`,`).filter(e=>e.startsWith(`num=`))){let e=n.replace(`num=`,``);if(t.traceCount=_l(e,64),t.traceCount===void 0)return{kind:`uncaught`,error:`java.lang.NumberFormatException: For input string: "${e}"`,isTool:t.isTool}}if((t.traceCount??ol)===ol&&i)return r(`Error: You need to specify a 'num' argument when using the 'file' argument, for example: '"num=5,file=test.txt"'.`)}else if(l===`-suppressMessages`||l===`-messagesAsErrors`){let e=c();if(e===void 0)return r(`Error: ${l} requires a comma-separated list of message codes.`);let t=l===`-suppressMessages`?a:o;for(let n of hl(e,`,`)){let e=n.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``),i=_l(e,32);if(i===void 0)return r(`Error: For input string: "${e}"`);let o=Number(i);if(ml(sl,o))t.tlc.push(o);else{if(!ll.has(o)&&!ml(cl,o))return r(`Error: unknown message code: ${o}`);if(t===a&&!ll.has(o))return r(`Error: code ${o} is an error and cannot be suppressed.`);t.sany.push(o)}}}else if(l===`-inv`){let e=c();if(e===void 0)return i();t.invariants.push({modules:[...new Set([...e.matchAll(/INSTANCE\s+(\w+)/g)].map(e=>e[1]))],expression:e})}else if(l===`-invlevel`){let e=c();if(e===void 0)return i();if(_l(e,32)===void 0)return r(`Error: An integer for -invlevel required. But encountered ${e}`);t.invariants.push({modules:[`TLC`,`Naturals`],expression:`LET _T == INSTANCE TLC _N == INSTANCE Naturals IN _N!<(_T!TLCGet("level"), ${e})`})}else if(l===`-debugger`){let e=s();e!==void 0&&[`port=`,`nosuspend`,`nohalt`,`suspend`,`halt`].some(t=>e.includes(t))&&n++}else if(l===`-generateSpecTE`)t.isTraceSpecForced=!0,s()===`nomonolith`&&n++;else if(l===`-noGenerateSpecTE`||l.toLowerCase()===`-note`)t.isTraceSpecDisabled=!0;else if(l===`-noGenerateSpecTEBin`||l.toLowerCase()===`-notebin`)t.isTraceBinaryDisabled=!0;else{if(l===`-help`||l===`-h`)return`usage`;if(l===`-dump`){let i=s();if(i?.startsWith(`class,`))return r(`Trying to instantiate a custom IStateWriter implementation ${i.replaceAll(`class,`,``)}.`);let a=i?.startsWith(`dot`)&&n+1<e.length?2:1;if(t.dump=e.slice(n,n+a),n+=a,t.dump.length===0)return r(`Error: A file name for dumping states required.`)}else if(Object.hasOwn(wl,l.toLowerCase())){let i=wl[l.toLowerCase()];if(n+1>=e.length)return r(i.missing);let a=c(),o=c();if(!Object.hasOwn(i.formats,a.toLowerCase()))return r(`Error: Unknown format ${a} given to ${i.name}.`);let s=i.formats[a.toLowerCase()];t.moduleOperators.push(...s.operators.map(e=>({...e,module:s.module,constants:{[s.constant]:o}})))}else if(l.toLowerCase()===`-postcondition`){let e=c();if(e===void 0)return r(`Error: Module!Operator for postCondition required.`);if(!e.includes(`!`))return r(`Module!Operator for postCondition required. Encountered: ${e}`);let n=hl(e,`!`);if(n.length!==2)return r(`Module!Operator for postCondition must be of the form module!operator. Encountered: ${e}`);if(n[0]===``)return r(`Module name for postCondition required. Encountered: ${e}`);if(n[0].includes(`.`))return r(`Module name for postCondition must not contain a dot. Encountered: ${n[0]}`);if(n[1].includes(`.`))return r(`Operator name for postCondition must not contain a dot. Encountered: ${n[1]}`);t.moduleOperators.push({kind:`postcondition`,module:n[0],operator:n[1]})}else{if(l.startsWith(`-`))return r(`Error: unrecognized option: ${l}`);t.specs.push(l)}}}if(!t.isWarningEnabled&&a.tlc.length+a.sany.length>0)return r(`Error: -nowarning already suppresses all warnings, making -suppressMessages redundant. Remove -nowarning to suppress only the specified messages, or remove -suppressMessages to suppress all warnings.`);let l=gl(a.tlc,o.tlc),u=l.length>0?l.map(String):gl(a.sany,o.sany).map(e=>ll.get(e)??String(e));return u.length>0?r(`Error: The following codes were set to both -suppressMessages and -messagesAsErrors: [${u.join(`, `)}]`):(t.suppressedCodes=[...a.tlc,...a.sany],t.errorCodes=[...o.tlc,...o.sany],t)},El=(e,t)=>e.print(M.computingInitProgress,F.none,`Computed ${t} initial states...`),Dl=(e,t)=>e===`invariant-violation`?{code:M.invariantViolatedInitial,text:`Invariant ${t} is violated by the initial state:`}:{code:M.propertyViolatedInitial,text:`Property ${t} is violated by the initial state:`},Ol=(e,t)=>t?.forEach(t=>{if(typeof t==`string`)return console.log(t);if(t.kind===`initial-states-progress`)return El(e,t.count);let n=Dl(t.status,t.name);e.print(n.code,F.error,`${n.text}\n${j(t.state)}`)}),kl={code:M.behaviorUpToThisPoint,text:`The behavior up to this point is:`},Al={code:M.counterExample,text:`The following behavior constitutes a counter-example:
|
|
@@ -153,6 +153,6 @@ A pretty-printed and in-depth description of TLC can be found at:
|
|
|
153
153
|
`)},Xu=e=>{let t=Ku(e),n=e=>qu(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(`
|
|
154
154
|
`)},Zu=(e,t,n)=>{let i=n.version===`1.7.4`,a=/* @__PURE__ */ new Set,o=/* @__PURE__ */ new Map,s=!1,c=[],l=(e,t)=>{if(!i)return t();c.push(...e);let n=t();return c.length-=e.length,n},u=(e,t)=>{let n=[...c,...t].reverse(),i=[e,...n.map(e=>`\tat tla2sany.${e.at}`)].join(`
|
|
155
155
|
`),a=n.filter(e=>e.failedFor!==void 0).map(e=>`failed for node.toString(): ${e.failedFor}\n with error \n${i}\n`).join(``);return T(new r(i,a),ju.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]:[],...Uu(e.kind,ua(e.location))],()=>_(e)))),Z(zu(e),[Q(`UID`,e.id)])),p=(e,t)=>{let n=t.levelChecked===0?[]:[Q(`level`,t.level)],r=t.location?[Ru(t.location),...n]:n;return{...e,children:[...r,...e.children]}},m=(e,t,n)=>Z(`params`,e.map((e,r)=>Z(`leibnizparam`,[f(e,n),...t?.[r]?[Z(`leibniz`)]:[]]))),g=e=>{let t=e.map(e=>e.trimEnd()).filter(e=>e.length>0).join(`
|
|
156
|
-
`),r=n.isUncommented?Xu(Yu(t)):t;return e.length>0?[{tag:`pre-comments`,cdata:r,children:[]}]:[]},_=e=>{switch(e.kind){case`FormalParam`:return p(Z(`FormalParamNode`,[Q(`uniquename`,e.name),Q(`arity`,e.arity)]),e);case`OpDecl`:return p(Z(`OpDeclNode`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),Q(`kind`,e.declKind)]),e);case`OpDef`:{if(e.defKind===`NumberedProofStep`)throw i?u(Mu(37),[Vu]):T(new h(Mu(37)),ju.uncaughtException);if(e.defKind===`ModuleInstance`)return p(Z(`ModuleInstanceKind`,[Q(`uniquename`,e.name),...e.isLocal&&!i?[Z(`local`)]:[]]),e);let t=e.params??[];if(e.defKind===`BuiltIn`)return p(Z(`BuiltInKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),...e.params?[m(t,e.isLeibnizArg,$.builtInParam)]:[]]),e);let n=e.body,r=e.module;if(n===void 0&&i)throw d($.body);if(n===void 0||r===void 0)throw Error(`The definition of ${e.name} has no body`);return p(Z(`UserDefinedOpKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),...i?[]:[Z(`originalOperator`,[f(e.source??e)]),Z(`originallyDefinedInModule`,[f(r)])],Z(`body`,[S(n,$.body)]),...e.params||!i?[m(t,e.isLeibnizArg,$.param)]:[],...i?[]:g(e.preComments),...e.inRecursive?[Z(`recursive`)]:[],...e.recursiveSection>=0&&!i?[Q(`recursiveSection`,e.recursiveSection)]:[],...e.isLocal&&!i?[Z(`local`)]:[]]),e)}case`ThmOrAssumpDef`:return p(Z(e.isTheorem?`TheoremDefNode`:`AssumeDef`,[Q(`uniquename`,e.name),S(e.body,$.theoremDefinitionBody)]),e);case`Module`:return Z(`ModuleNode`,[Ru(e.location),...v(e)]);case`Theorem`:return p(Z(`TheoremNode`,[...e.definition?[Z(`definition`,[f(e.definition,$.theoremDefinition)])]:[],Z(`body`,[S(e.body,$.theorem)]),...e.proof?[S(e.proof,$.proof)]:[],...e.isSuffices?[Z(`suffices`)]:[]]),e);case`Assume`:return Z(`AssumeNode`,[Ru(e.location),...e.body.levelChecked===0?[]:[Q(`level`,e.body.level)],...e.definition?[Z(`definition`,[f(e.definition,$.assumeDefinition)])]:[],Z(`body`,[S(e.body,$.assume)])])}},v=e=>{let t=t=>!n.isRestricted||t.module===e;return[Q(`uniquename`,e.name),...i?[]:[Z(`extends`,[...new Set(e.extendees.map(e=>e.name))].toSorted().map(e=>Q(`uniquename`,e)))],...Ea(e,2).filter(t).map(e=>f(e,$.constant)),...Ea(e,3).filter(t).map(e=>f(e,$.variable)),...Ta(e).filter(t).map(e=>f(e,$.definition)),...e.topLevel.map(e=>e.kind===`Instance`||e.kind===`UseOrHide`?S(e,$.topLevel):f(e,$.topLevel)),...e.definitions.filter(e=>!i&&e.kind===`Module`).map(e=>f(e))]},y=(e,t)=>l([t],()=>Z(`Subst`,[f(e.op,$.substOperator),S(e.expr,$.substExpression)])),b=e=>{if(e.nullKind!==void 0&&i)throw u(Mu(0),[$.operator,...Uu(`OpDef`,Hu),Vu]);let t=e.operands[e.operands.length-1];e.operator.name===`$Case`&&e.operands.length>1&&t?.kind===`OpAppl`&&t.operator.name===`$Pair`&&t.operands[0]===void 0&&(s=!0);let n=f(e.operator,$.operator),r=e.operands.map((e,t)=>e===void 0||t===0&&s&&da(e)?i?Q(`StringNode`,`$Other`):Z(`StringNode`,[Q(`StringValue`,`$Other`)]):S(e,$.operand)),a=e.tupleOrs,o=e.unbounded===void 0&&e.bounded===void 0?[]:[Z(`boundSymbols`,[...(e.unbounded??[]).map((e,t)=>Z(`unbound`,[f(e,$.unbound),...a?.[t]?[Z(`tuple`)]:[]])),...(e.bounded??[]).map((t,n)=>Z(`bound`,[...t.map(e=>f(e,$.bound)),...a?.[n]?[Z(`tuple`)]:[],S(e.ranges[n],$.range)]))])];return Z(`OpApplNode`,[Z(`operator`,[n]),Z(`operands`,r),...o])},x=(e,t)=>e.kind===`Module`||e.kind===`OpDef`?f(e,t):S(e,t),S=(e,t)=>{if(!i)return C(e);if(e.kind===`OpAppl`&&e.nullKind===`absent`&&`nullType`in t)throw d(t);return l([t,{at:`semantic.SemanticNode.export(SemanticNode.java:379)`,failedFor:ua(e.location)},{at:`semantic.LevelNode.getSemanticElement(LevelNode.java:333)`}],()=>C(e))},C=e=>{switch(e.kind){case`OpAppl`:return p(b(e),e);case`Numeral`:return p(Z(`NumeralNode`,[Q(`IntValue`,e.value)]),e);case`String`:return p(Z(`StringNode`,[Q(`StringValue`,e.value)]),e);case`Decimal`:return p(Z(`DecimalNode`,[Q(`mantissa`,e.mantissa),Q(`exponent`,e.exponent),...i?[]:[Q(`integralPart`,e.integralPart),Q(`fractionalPart`,e.fractionalPart)]]),e);case`LetIn`:{let t=S(e.body,$.letBody);return p(Z(`LetInNode`,[Z(`body`,[t]),Z(`opDefs`,e.opDefs.map(e=>f(e,$.letDefinition)))]),e)}case`Label`:return p(Z(`LabelNode`,[Q(`uniquename`,e.name),Q(`arity`,e.params.length),Z(`body`,[S(e.body,$.labelBody)]),Z(`params`,e.params.map(e=>f(e,$.labelParam)))]),e);case`OpArg`:return p(Z(`OpArgNode`,[Z(`argument`,[f(e.op,$.argument)])]),e);case`At`:{let t=e.except.operands[0],n=e.component.operands[0];if(t===void 0||n===void 0)throw Error(`An @ refers to an incomplete EXCEPT`);return p(Z(`AtNode`,[S(t,$.exceptObject),S(n,$.exceptComponents)]),e)}case`SubstIn`:case`APSubstIn`:{let t=Bu[e.kind],n=e.substs.map(e=>y(e,t.subst)),r=S(e.body,t.body);return p(Z(e.kind===`SubstIn`?`SubstInNode`:`APSubstInNode`,[Z(`substs`,n),Z(`body`,[r]),Z(`instFrom`,[f(e.instantiatingModule,t.from)]),Z(`instTo`,[f(e.instantiatedModule,t.to)])]),e)}case`Instance`:{let t=e.substs.map(e=>y(e,$.instanceSubst)),n=e.params.map(e=>f(e,$.instanceParam));return Z(`InstanceNode`,[Ru(e.location),Q(`level`,0),...e.name===void 0?[]:[Q(`uniquename`,e.name)],Q(`module`,e.module.name),Z(`substs`,t),Z(`params`,n),...e.isLocal&&!i?[Z(`local`)]:[]])}case`UseOrHide`:return p(Z(`UseOrHideNode`,[Z(`facts`,e.facts.map(e=>x(e,$.useFact))),Z(`defs`,e.defs.map(e=>f(e,$.useDefinition))),...e.isOnly?[Z(`only`)]:[],...e.isHide?[Z(`hide`)]:[]]),e);case`NewSymb`:return p(Z(`NewSymbNode`,[f(e.declaration,$.newDeclaration),...e.set&&!(i&&da(e.set))?[S(e.set,$.newSet)]:[]]),e);case`AssumeProve`:return p(Z(`AssumeProveNode`,[Z(`assumes`,e.assumptions.map(e=>S(e,$.assumption))),Z(`prove`,[S(e.goal,$.goal)]),...e.isSuffices?[Z(`suffices`)]:[],...e.isBoxed?[Z(`boxed`)]:[]]),e);case`LeafProof`:{let t=e.facts.length===0&&e.defs.length===0,n=e.isOmitted?Z(`omitted`):t?Z(`obvious`):Z(`by`,[Z(`facts`,e.facts.map(e=>x(e,$.byFact))),Z(`defs`,e.defs.map(e=>f(e,$.byDefinition))),...e.isOnly?[Z(`only`)]:[]]);return p(n,e)}case`NonLeafProof`:return p(Z(`steps`,[...i?[]:[Q(`proofLevel`,e.proofLevel)],...e.steps.map(e=>e.kind===`Theorem`?f(e,$.step):S(e,$.step))]),e);case`DefStep`:return p(Z(`DefStepNode`,e.defs.map(e=>f(e,$.defStep))),e)}},w=(n.isRestricted?[t]:e).map(e=>f(e,$.main)),E=Wu(o.size),D=Z(`context`,[...o.entries()].toSorted((
|
|
157
|
-
`)}\n`},$u=(()=>{let e=[[`-I`,`Include; use given directory path to resolve module dependencies.`],[`-help`,`Print this usage information.`],[`-o`,`Offline mode; skip XML schema validation step.`],[`-r`,`Restrict mode; include only declarations and definitions of the specified module, excluding extended or instantiated modules.`],[`-t`,`Terse; format XML output without tabs or newlines.`],[`-u`,`Uncomment; process boxed comments and single-line comments (\\*) in pre-comments to extract their content.`]],t=[`Only one root TLA+ file can be parsed per run.`,`Multiple directory search paths can be given by providing multiple -I arguments.`,`XML schema validation does not require network access.`];return[``,X(`NAME`),``,` tla2sany.xml.XMLExporter - Emit SANY's parse tree as XML - Version 2.2 created 08 July 2020`,``,``,X(`SYNOPSIS`),``,`\t${X(`tla2sany.xml.XMLExporter`)} [${X(`-Iortu`)}] [${X(`-help`)}] FILE`,``,X(`DESCRIPTION`),``,` Given a TLA+ file, parse that file with SANY then translate the module's semantic parse tree to XML, including all the modules depended on. The XML is printed to stdout and its output format is given by an XML Schema file (.xsd) found at https://proofs.tlapl.us/doc/web/sany.xsd.`,``,X(`OPTIONS`),``,...e.map(
|
|
156
|
+
`),r=n.isUncommented?Xu(Yu(t)):t;return e.length>0?[{tag:`pre-comments`,cdata:r,children:[]}]:[]},_=e=>{switch(e.kind){case`FormalParam`:return p(Z(`FormalParamNode`,[Q(`uniquename`,e.name),Q(`arity`,e.arity)]),e);case`OpDecl`:return p(Z(`OpDeclNode`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),Q(`kind`,e.declKind)]),e);case`OpDef`:{if(e.defKind===`NumberedProofStep`)throw i?u(Mu(37),[Vu]):T(new h(Mu(37)),ju.uncaughtException);if(e.defKind===`ModuleInstance`)return p(Z(`ModuleInstanceKind`,[Q(`uniquename`,e.name),...e.isLocal&&!i?[Z(`local`)]:[]]),e);let t=e.params??[];if(e.defKind===`BuiltIn`)return p(Z(`BuiltInKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),...e.params?[m(t,e.isLeibnizArg,$.builtInParam)]:[]]),e);let n=e.body,r=e.module;if(n===void 0&&i)throw d($.body);if(n===void 0||r===void 0)throw Error(`The definition of ${e.name} has no body`);return p(Z(`UserDefinedOpKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),...i?[]:[Z(`originalOperator`,[f(e.source??e)]),Z(`originallyDefinedInModule`,[f(r)])],Z(`body`,[S(n,$.body)]),...e.params||!i?[m(t,e.isLeibnizArg,$.param)]:[],...i?[]:g(e.preComments),...e.inRecursive?[Z(`recursive`)]:[],...e.recursiveSection>=0&&!i?[Q(`recursiveSection`,e.recursiveSection)]:[],...e.isLocal&&!i?[Z(`local`)]:[]]),e)}case`ThmOrAssumpDef`:return p(Z(e.isTheorem?`TheoremDefNode`:`AssumeDef`,[Q(`uniquename`,e.name),S(e.body,$.theoremDefinitionBody)]),e);case`Module`:return Z(`ModuleNode`,[Ru(e.location),...v(e)]);case`Theorem`:return p(Z(`TheoremNode`,[...e.definition?[Z(`definition`,[f(e.definition,$.theoremDefinition)])]:[],Z(`body`,[S(e.body,$.theorem)]),...e.proof?[S(e.proof,$.proof)]:[],...e.isSuffices?[Z(`suffices`)]:[]]),e);case`Assume`:return Z(`AssumeNode`,[Ru(e.location),...e.body.levelChecked===0?[]:[Q(`level`,e.body.level)],...e.definition?[Z(`definition`,[f(e.definition,$.assumeDefinition)])]:[],Z(`body`,[S(e.body,$.assume)])])}},v=e=>{let t=t=>!n.isRestricted||t.module===e;return[Q(`uniquename`,e.name),...i?[]:[Z(`extends`,[...new Set(e.extendees.map(e=>e.name))].toSorted().map(e=>Q(`uniquename`,e)))],...Ea(e,2).filter(t).map(e=>f(e,$.constant)),...Ea(e,3).filter(t).map(e=>f(e,$.variable)),...Ta(e).filter(t).map(e=>f(e,$.definition)),...e.topLevel.map(e=>e.kind===`Instance`||e.kind===`UseOrHide`?S(e,$.topLevel):f(e,$.topLevel)),...e.definitions.filter(e=>!i&&e.kind===`Module`).map(e=>f(e))]},y=(e,t)=>l([t],()=>Z(`Subst`,[f(e.op,$.substOperator),S(e.expr,$.substExpression)])),b=e=>{if(e.nullKind!==void 0&&i)throw u(Mu(0),[$.operator,...Uu(`OpDef`,Hu),Vu]);let t=e.operands[e.operands.length-1];e.operator.name===`$Case`&&e.operands.length>1&&t?.kind===`OpAppl`&&t.operator.name===`$Pair`&&t.operands[0]===void 0&&(s=!0);let n=f(e.operator,$.operator),r=e.operands.map((e,t)=>e===void 0||t===0&&s&&da(e)?i?Q(`StringNode`,`$Other`):Z(`StringNode`,[Q(`StringValue`,`$Other`)]):S(e,$.operand)),a=e.tupleOrs,o=e.unbounded===void 0&&e.bounded===void 0?[]:[Z(`boundSymbols`,[...(e.unbounded??[]).map((e,t)=>Z(`unbound`,[f(e,$.unbound),...a?.[t]?[Z(`tuple`)]:[]])),...(e.bounded??[]).map((t,n)=>Z(`bound`,[...t.map(e=>f(e,$.bound)),...a?.[n]?[Z(`tuple`)]:[],S(e.ranges[n],$.range)]))])];return Z(`OpApplNode`,[Z(`operator`,[n]),Z(`operands`,r),...o])},x=(e,t)=>e.kind===`Module`||e.kind===`OpDef`?f(e,t):S(e,t),S=(e,t)=>{if(!i)return C(e);if(e.kind===`OpAppl`&&e.nullKind===`absent`&&`nullType`in t)throw d(t);return l([t,{at:`semantic.SemanticNode.export(SemanticNode.java:379)`,failedFor:ua(e.location)},{at:`semantic.LevelNode.getSemanticElement(LevelNode.java:333)`}],()=>C(e))},C=e=>{switch(e.kind){case`OpAppl`:return p(b(e),e);case`Numeral`:return p(Z(`NumeralNode`,[Q(`IntValue`,e.value)]),e);case`String`:return p(Z(`StringNode`,[Q(`StringValue`,e.value)]),e);case`Decimal`:return p(Z(`DecimalNode`,[Q(`mantissa`,e.mantissa),Q(`exponent`,e.exponent),...i?[]:[Q(`integralPart`,e.integralPart),Q(`fractionalPart`,e.fractionalPart)]]),e);case`LetIn`:{let t=S(e.body,$.letBody);return p(Z(`LetInNode`,[Z(`body`,[t]),Z(`opDefs`,e.opDefs.map(e=>f(e,$.letDefinition)))]),e)}case`Label`:return p(Z(`LabelNode`,[Q(`uniquename`,e.name),Q(`arity`,e.params.length),Z(`body`,[S(e.body,$.labelBody)]),Z(`params`,e.params.map(e=>f(e,$.labelParam)))]),e);case`OpArg`:return p(Z(`OpArgNode`,[Z(`argument`,[f(e.op,$.argument)])]),e);case`At`:{let t=e.except.operands[0],n=e.component.operands[0];if(t===void 0||n===void 0)throw Error(`An @ refers to an incomplete EXCEPT`);return p(Z(`AtNode`,[S(t,$.exceptObject),S(n,$.exceptComponents)]),e)}case`SubstIn`:case`APSubstIn`:{let t=Bu[e.kind],n=e.substs.map(e=>y(e,t.subst)),r=S(e.body,t.body);return p(Z(e.kind===`SubstIn`?`SubstInNode`:`APSubstInNode`,[Z(`substs`,n),Z(`body`,[r]),Z(`instFrom`,[f(e.instantiatingModule,t.from)]),Z(`instTo`,[f(e.instantiatedModule,t.to)])]),e)}case`Instance`:{let t=e.substs.map(e=>y(e,$.instanceSubst)),n=e.params.map(e=>f(e,$.instanceParam));return Z(`InstanceNode`,[Ru(e.location),Q(`level`,0),...e.name===void 0?[]:[Q(`uniquename`,e.name)],Q(`module`,e.module.name),Z(`substs`,t),Z(`params`,n),...e.isLocal&&!i?[Z(`local`)]:[]])}case`UseOrHide`:return p(Z(`UseOrHideNode`,[Z(`facts`,e.facts.map(e=>x(e,$.useFact))),Z(`defs`,e.defs.map(e=>f(e,$.useDefinition))),...e.isOnly?[Z(`only`)]:[],...e.isHide?[Z(`hide`)]:[]]),e);case`NewSymb`:return p(Z(`NewSymbNode`,[f(e.declaration,$.newDeclaration),...e.set&&!(i&&da(e.set))?[S(e.set,$.newSet)]:[]]),e);case`AssumeProve`:return p(Z(`AssumeProveNode`,[Z(`assumes`,e.assumptions.map(e=>S(e,$.assumption))),Z(`prove`,[S(e.goal,$.goal)]),...e.isSuffices?[Z(`suffices`)]:[],...e.isBoxed?[Z(`boxed`)]:[]]),e);case`LeafProof`:{let t=e.facts.length===0&&e.defs.length===0,n=e.isOmitted?Z(`omitted`):t?Z(`obvious`):Z(`by`,[Z(`facts`,e.facts.map(e=>x(e,$.byFact))),Z(`defs`,e.defs.map(e=>f(e,$.byDefinition))),...e.isOnly?[Z(`only`)]:[]]);return p(n,e)}case`NonLeafProof`:return p(Z(`steps`,[...i?[]:[Q(`proofLevel`,e.proofLevel)],...e.steps.map(e=>e.kind===`Theorem`?f(e,$.step):S(e,$.step))]),e);case`DefStep`:return p(Z(`DefStepNode`,e.defs.map(e=>f(e,$.defStep))),e)}},w=(n.isRestricted?[t]:e).map(e=>f(e,$.main)),E=Wu(o.size),D=Z(`context`,[...o.entries()].toSorted((e,t)=>Gu(e[0],E)-Gu(t[0],E)).map(e=>Z(`entry`,[Q(`UID`,e[0]),e[1]])));return Z(`modules`,[Q(`RootModule`,t.name),D,...w])},Qu=(e,t={version:`master`,isRestricted:!1,isUncommented:!1,isTerse:!1})=>{let n=Zu(e.modules,e.root,t),r=Iu(n);if(r){let e=r.character.codePointAt(0)??0;throw T(new h(`The spec contains the character U+${e.toString(16).toUpperCase().padStart(4,`0`)} in the ${r.tag} element. XML 1.0 cannot represent that character in character data, not even as a numeric character reference, so the spec cannot be exported until the character is removed from it.`),ju.unrepresentableCharacter)}let i=[`<?xml version="1.0" encoding="UTF-8" standalone="no"?>`];return Lu(n,0,t.isTerse?0:2,i),t.isTerse?i.join(``):`${i.join(`
|
|
157
|
+
`)}\n`},$u=(()=>{let e=[[`-I`,`Include; use given directory path to resolve module dependencies.`],[`-help`,`Print this usage information.`],[`-o`,`Offline mode; skip XML schema validation step.`],[`-r`,`Restrict mode; include only declarations and definitions of the specified module, excluding extended or instantiated modules.`],[`-t`,`Terse; format XML output without tabs or newlines.`],[`-u`,`Uncomment; process boxed comments and single-line comments (\\*) in pre-comments to extract their content.`]],t=[`Only one root TLA+ file can be parsed per run.`,`Multiple directory search paths can be given by providing multiple -I arguments.`,`XML schema validation does not require network access.`];return[``,X(`NAME`),``,` tla2sany.xml.XMLExporter - Emit SANY's parse tree as XML - Version 2.2 created 08 July 2020`,``,``,X(`SYNOPSIS`),``,`\t${X(`tla2sany.xml.XMLExporter`)} [${X(`-Iortu`)}] [${X(`-help`)}] FILE`,``,X(`DESCRIPTION`),``,` Given a TLA+ file, parse that file with SANY then translate the module's semantic parse tree to XML, including all the modules depended on. The XML is printed to stdout and its output format is given by an XML Schema file (.xsd) found at https://proofs.tlapl.us/doc/web/sany.xsd.`,``,X(`OPTIONS`),``,...e.map(e=>`\t${X(e[0])}\n\t\t${e[1]}`),``,X(`TIPS`),``,...t.flatMap(e=>[`\t${e}`,``]),``].join(`
|
|
158
158
|
`)})(),ed=e=>(process.stderr.write(`ERROR: ${e}\n${$u}`),ju.argsParsingFailure),td=(e,n)=>{try{return process.stdout.write(Qu(e,n)),E.success}catch(e){if(!(e instanceof h))throw e;let n=t(e),i=e instanceof r?e.unwound:``;return console.error(n===ju.uncaughtException?`${i}Exception in thread "main" ${e.message}`:`ERROR: ${e.message}`),n}},nd={"no-file":{message:`at least one .tla file must be given`,line174:59},"missing-include":{message:`the -I flag must be followed by a directory and at least one .tla file`,line174:71},"several-files":{message:`Only one TLA file to check allowed!`,line174:83}},rd=(e,t)=>{let n={flags:/* @__PURE__ */ new Set,includes:[],error:void 0};if(e.length===0)return{...n,error:`no-file`};let r=-1;for(let i=0;i<e.length-1;i++)if(t.has(e[i]))n.flags.add(e[i]),r=i;else if(e[i]===`-I`){if(i++,i>e.length-2)return{...n,error:`missing-include`};n.includes.push(e[i]),r=i}return r===e.length-2?n:{...n,error:`several-files`}},id=e=>{let t=rd(e,/* @__PURE__ */ new Set([`-o`,`-t`,`-r`,`-u`]));if(t.error)return ed(nd[t.error].message);let n=e[e.length-1];if(n===`-help`)return process.stdout.write($u),E.success;let r=n.endsWith(`.tla`)?n:`${n}.tla`,i=[`.`,...t.includes],a=i.map(e=>Ct(e,r)).find(I);a===void 0&&!ke.has(r.slice(0,-4))&&Qt(process.cwd(),`./${r}`,t.includes);let o=el(a??r,Zt(i),{fileName:n,isXmlExport:!0});return process.stderr.write(o.text),o.isFailed||o.specification===void 0?(console.error(`ERROR: Failed to parse module.`),ju.specParsingFailure):td(o.specification,{version:`master`,isRestricted:t.flags.has(`-r`),isUncommented:t.flags.has(`-u`),isTerse:t.flags.has(`-t`)})},ad=(e,t)=>(console.error(`Exception in thread "main" ${e}\n\tat tla2sany.xml.XMLExporter.main(XMLExporter.java:${t})`),ju.uncaughtException),od=(e,t)=>{let n=rd(e,/* @__PURE__ */ new Set([`-o`]));if(n.error)return ad(`java.lang.IllegalArgumentException: ${nd[n.error].message}`,nd[n.error].line174);let r=e[e.length-1],i=`${r.replace(/\.tla$/i,``)}.tla`,a=(n.includes.length===0?[`/`]:n.includes).map(an),o=[`.`,...a],s=e=>rn(`${a[a.length-1]}${e}`,a,t),c=o.map(e=>Ct(e,i)).find(I);if(c===void 0&&!ye.has(vt(i,`.tla`)))return s(i),E.success;let l=el(c??i,on(Zt(o),s),{fileName:r,isXmlExport:!0,version:`1.7.4`});return process.stderr.write(l.text),l.specification===void 0?ad(`tla2sany.xml.XMLExportingException: spec ${(c&&$c(At(c,`utf8`),`1.7.4`))??`null`} is malformed - does not have a root module`,110):td(l.specification,{version:`1.7.4`,isRestricted:!1,isUncommented:!1,isTerse:!0})},sd=[`tlc2.TLC`,`tla2sany.xml.XMLExporter`],cd=e=>{let t={libraries:[]};for(let n=0;n<e.length;n++){let r=e[n];if(r===`-cp`||r===`-classpath`||r===`--class-path`)n++,t.classPath=e[n];else if(r===`-jar`)return t.classPath=e[n+1],{mainClass:`tlc2.TLC`,args:e.slice(n+2),java:t};else if(r.startsWith(`-DTLA-Library=`))t.libraries.push(...r.slice(14).split(yt));else if(r.startsWith(`-Djava.io.tmpdir=`))t.temporaryDirectory=r.slice(17);else if(r.startsWith(`-Dtla-ts.tlc=`))t.tlcVersion=r.slice(13)===`1.7.4`?`1.7.4`:`master`;else if(!r.startsWith(`-D`)&&!r.startsWith(`-X`))return n>0||sd.includes(r)?{mainClass:r,args:e.slice(n+1),java:t}:void 0}},ld=async e=>{if(e[0]===`tlapm`)return nn(()=>nr(e.slice(1)));let t=cd(e);return t===void 0?ku(e,{libraries:[]}):(t.java.tlcVersion??=await qt(sn(t.java)),t.mainClass===`tlc2.TLC`?ku(t.args,t.java):t.mainClass===`tla2sany.xml.XMLExporter`?nn(()=>t.java.tlcVersion===`1.7.4`?od(t.args,sn(t.java)):id(t.args)):(console.error(`Error: tla-ts runs the Java classes ${sd.join(` and `)}, not ${t.mainClass}.`),1))},ud=async()=>{process.exitCode=await ld(process.argv.slice(2))};export{ud as runCli};
|