tla-ts 0.0.9-dev.4ce0657 → 0.0.9-dev.8298a52
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/README.md +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +27 -27
- package/dist/prove.js +6 -6
- package/dist/run.cjs +2 -2
- package/dist/run.js +2 -2
- package/dist/transfer.cjs +25 -25
- package/dist/transfer.js +3 -3
- package/package.json +1 -1
- package/src/cli/tlc.ts +1 -1
- package/src/parallel-worker.ts +5 -6
- package/src/parallel.ts +5 -4
- package/src/values.ts +28 -6
package/README.md
CHANGED
|
@@ -75,7 +75,7 @@ result.violation?.trace;
|
|
|
75
75
|
| `loadModule` | Returns the source of an imported module |
|
|
76
76
|
| `workers` | The number of worker threads. Defaults to 1 |
|
|
77
77
|
|
|
78
|
-
A check with several workers starts over on one worker when the search
|
|
78
|
+
A check with several workers starts over on one worker when it orders two strings that the search created, such as with `\o` or `ToString`. This happens when both strings go into one set or one function's domain. TLC orders strings by when it first sees them, and workers share that order only for strings that exist before the search. The CLI prints a warning when this happens, and `check` passes `onProgress` a `sequential-fallback` event.
|
|
79
79
|
|
|
80
80
|
### `prove`
|
|
81
81
|
|
package/dist/parallel-worker.cjs
CHANGED
|
@@ -6,4 +6,4 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=(n,r)=>{let i=new Map(n.modules),a=e=>i.get(e),o=new Map(n.classes),s=t.N(n.source,a);t.Bt(s.getStringOrder(n.config)),t.Vt(n.version);let c=t.
|
|
9
|
+
const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=(n,r)=>{let i=new Map(n.modules),a=e=>i.get(e),o=new Map(n.classes),s=t.N(n.source,a);t.Bt(s.getStringOrder(n.config)),t.Vt(n.version),t.Mt();let c=t.M(n.config,{source:n.source,loadModule:a,order:s,loadClass:e=>o.get(e),print:()=>{},files:{readFile:void 0,writeFile:void 0},isTool:n.isTool,isTraceRecorded:n.isTraceRecorded,isWarningEnabled:n.isWarningEnabled,version:n.version}).environment,l=t.h(n.config,c,()=>s.getDeclarationOrder(`variable`)),u=l?.spec.next;if(!l||u===void 0)return r.postMessage({type:`abort`});let d=n.index,f=t.Tt(),p=t.t(c.variables.length),m={fingerprints:n.fingerprints},h=n.requests,g=n.remaining,_=l.isSymmetric?t.r():void 0,v=/* @__PURE__ */ new Int32Array(2),y={resume:()=>{},loot:e=>{}};n.ports.forEach(e=>{e?.addEventListener(`message`,e=>y.loot(e.data)),e?.start?.()});let b={states:p(n.seed).map(f)},x=e.t(),S=(e,r)=>{let i=Atomics.load(h,d)-1,a=Math.floor((e.end-e.origin-1)/2),o=t.n(),s=e.states.slice(e.end-a,e.end),c=a>0&&s.every(o.encode);c&&(e.end-=a);let l=c?o.finish():t.n().finish();n.ports[i]?.postMessage(l,[l.words.buffer]),Atomics.store(h,d,r),Atomics.notify(h,d)},C=e=>{Atomics.store(g,d,0),Atomics.compareExchange(h,d,0,-1)!==0&&S(e,-1)},w=e=>{Atomics.store(g,d,e.end-e.origin),Atomics.store(h,d,0)},T=e=>{for(;e.origin<e.end;e.origin++){let r=e.states[e.origin];if(!e.successors){if(performance.now()>=e.breakAt)return`break`;if(Atomics.load(h,d)>0&&S(e,0),Atomics.store(g,d,e.end-e.origin-1),e.successors=t.st(u,r,c,l.spec.scope),e.generated+=e.successors.length,e.successors.length===0&&n.config.checkDeadlock)return}let i=e.successors;for(;e.index<i.length;e.index++){if(t.s(m.fingerprints))return`paused`;let n=i[e.index];if(l.findViolatedActionProperty(r,n.state))return;if(!l.satisfiesActionConstraints(r,n.state)){if(l.findViolatedInvariant(n.state,r))return;continue}if(_&&(t.c(n.state,v),!_.insert(v[0],v[1])))continue;f(n.state);let a=l.getFingerprintState(n.state);if(t.c(a,v),t.o(m.fingerprints,v[0],v[1])){if(l.findViolatedInvariant(n.state,r))return;l.satisfiesConstraints(n.state,r)&&(e.next.push(n.state),e.fingerprintStates.push(a),e.added++)}}e.outDegrees[Math.min(e.added,31)]++,e.successors=void 0,e.index=0,e.added=0}return`done`},E=async e=>{let t=/* @__PURE__ */ new Set;for(;;){let r=n.ports.reduce((e,n,r)=>!n||t.has(r)||Atomics.load(g,r)<2?e:e===void 0||Atomics.load(g,r)>Atomics.load(g,e)?r:e,void 0);if(r===void 0)return!1;let i=Atomics.compareExchange(h,r,0,d+1);if(i===-1&&t.add(r),i>0&&Atomics.wait(h,r,i),i!==0)continue;let a=await new Promise(e=>y.loot=e);if(a.count===0)t.add(r);else return e.states=p(a).map(f),e.origin=0,e.end=e.states.length,w(e),!0}},D=e=>r.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),O=async()=>{let e={states:b.states,origin:0,end:b.states.length,successors:void 0,index:0,added:0,generated:0,outDegrees:Array.from({length:32},()=>0),next:[],fingerprintStates:[],breakAt:performance.now()+100};for(;;){let t=T(e);if(t===void 0)return;if(t===`break`)await x(),e.breakAt=performance.now()+100;else if(C(e),t===`paused`){let t=new Promise(e=>y.resume=e);D({type:`paused`}),await t,w(e)}else if(!await E(e))break}let n=t.Ft();return n===void 0?(b.states=e.next,Atomics.store(g,d,b.states.length),{type:`level`,generated:e.generated,added:e.next.length,outDegrees:e.outDegrees,fingerprints:l.getStoredFingerprints(e.next,e.fingerprintStates)}):{type:`abort`,string:n}},k=()=>{O().then(e=>D(e??{type:`abort`}),()=>D({type:`abort`}))};r.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&k(),t.type===`resize`&&(m.fingerprints=t.fingerprints,y.resume())}),Atomics.store(g,d,b.states.length),D({type:`ready`})};e.n().then(e=>{let t=r=>{let i=r.data;if(i.type===`start`){e.removeEventListener?.(`message`,t);try{n(i,e)}catch{e.postMessage({type:`abort`})}}};e.addEventListener(`message`,t),e.start?.()});
|
package/dist/parallel-worker.js
CHANGED
|
@@ -6,4 +6,4 @@
|
|
|
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{n as e,t}from"./worker.js";import{Bt as n,Ft as r,M as i,
|
|
9
|
+
import{n as e,t}from"./worker.js";import{Bt as n,Ft as r,M as i,Mt as a,N as o,Tt as s,Vt as c,c as l,h as u,n as d,o as f,r as p,s as m,st as h,t as g}from"./transfer.js";const _=(e,_)=>{let v=new Map(e.modules),y=e=>v.get(e),b=new Map(e.classes),x=o(e.source,y);n(x.getStringOrder(e.config)),c(e.version),a();let S=i(e.config,{source:e.source,loadModule:y,order:x,loadClass:e=>b.get(e),print:()=>{},files:{readFile:void 0,writeFile:void 0},isTool:e.isTool,isTraceRecorded:e.isTraceRecorded,isWarningEnabled:e.isWarningEnabled,version:e.version}).environment,C=u(e.config,S,()=>x.getDeclarationOrder(`variable`)),w=C?.spec.next;if(!C||w===void 0)return _.postMessage({type:`abort`});let T=e.index,E=s(),D=g(S.variables.length),O={fingerprints:e.fingerprints},k=e.requests,A=e.remaining,j=C.isSymmetric?p():void 0,M=/* @__PURE__ */ new Int32Array(2),N={resume:()=>{},loot:e=>{}};e.ports.forEach(e=>{e?.addEventListener(`message`,e=>N.loot(e.data)),e?.start?.()});let P={states:D(e.seed).map(E)},F=t(),I=(t,n)=>{let r=Atomics.load(k,T)-1,i=Math.floor((t.end-t.origin-1)/2),a=d(),o=t.states.slice(t.end-i,t.end),s=i>0&&o.every(a.encode);s&&(t.end-=i);let c=s?a.finish():d().finish();e.ports[r]?.postMessage(c,[c.words.buffer]),Atomics.store(k,T,n),Atomics.notify(k,T)},L=e=>{Atomics.store(A,T,0),Atomics.compareExchange(k,T,0,-1)!==0&&I(e,-1)},R=e=>{Atomics.store(A,T,e.end-e.origin),Atomics.store(k,T,0)},z=t=>{for(;t.origin<t.end;t.origin++){let n=t.states[t.origin];if(!t.successors){if(performance.now()>=t.breakAt)return`break`;if(Atomics.load(k,T)>0&&I(t,0),Atomics.store(A,T,t.end-t.origin-1),t.successors=h(w,n,S,C.spec.scope),t.generated+=t.successors.length,t.successors.length===0&&e.config.checkDeadlock)return}let r=t.successors;for(;t.index<r.length;t.index++){if(m(O.fingerprints))return`paused`;let e=r[t.index];if(C.findViolatedActionProperty(n,e.state))return;if(!C.satisfiesActionConstraints(n,e.state)){if(C.findViolatedInvariant(e.state,n))return;continue}if(j&&(l(e.state,M),!j.insert(M[0],M[1])))continue;E(e.state);let i=C.getFingerprintState(e.state);if(l(i,M),f(O.fingerprints,M[0],M[1])){if(C.findViolatedInvariant(e.state,n))return;C.satisfiesConstraints(e.state,n)&&(t.next.push(e.state),t.fingerprintStates.push(i),t.added++)}}t.outDegrees[Math.min(t.added,31)]++,t.successors=void 0,t.index=0,t.added=0}return`done`},B=async t=>{let n=/* @__PURE__ */ new Set;for(;;){let r=e.ports.reduce((e,t,r)=>!t||n.has(r)||Atomics.load(A,r)<2?e:e===void 0||Atomics.load(A,r)>Atomics.load(A,e)?r:e,void 0);if(r===void 0)return!1;let i=Atomics.compareExchange(k,r,0,T+1);if(i===-1&&n.add(r),i>0&&Atomics.wait(k,r,i),i!==0)continue;let a=await new Promise(e=>N.loot=e);if(a.count===0)n.add(r);else return t.states=D(a).map(E),t.origin=0,t.end=t.states.length,R(t),!0}},V=e=>_.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),H=async()=>{let e={states:P.states,origin:0,end:P.states.length,successors:void 0,index:0,added:0,generated:0,outDegrees:Array.from({length:32},()=>0),next:[],fingerprintStates:[],breakAt:performance.now()+100};for(;;){let t=z(e);if(t===void 0)return;if(t===`break`)await F(),e.breakAt=performance.now()+100;else if(L(e),t===`paused`){let t=new Promise(e=>N.resume=e);V({type:`paused`}),await t,R(e)}else if(!await B(e))break}let t=r();return t===void 0?(P.states=e.next,Atomics.store(A,T,P.states.length),{type:`level`,generated:e.generated,added:e.next.length,outDegrees:e.outDegrees,fingerprints:C.getStoredFingerprints(e.next,e.fingerprintStates)}):{type:`abort`,string:t}},U=()=>{H().then(e=>V(e??{type:`abort`}),()=>V({type:`abort`}))};_.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&U(),t.type===`resize`&&(O.fingerprints=t.fingerprints,N.resume())}),Atomics.store(A,T,P.states.length),V({type:`ready`})};e().then(e=>{let t=n=>{let r=n.data;if(r.type===`start`){e.removeEventListener?.(`message`,t);try{_(r,e)}catch{e.postMessage({type:`abort`})}}};e.addEventListener(`message`,t),e.start?.()});
|