tla-ts 0.0.8-dev.d9bffda → 0.0.9-dev.2813db5
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 +2 -0
- package/dist/index.d.cts +8 -0
- package/dist/index.d.ts +8 -0
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +7 -7
- package/dist/prove.js +32 -32
- package/dist/run.cjs +7 -7
- package/dist/run.js +25 -25
- package/dist/transfer.cjs +18 -18
- package/dist/transfer.js +18 -18
- package/package.json +1 -1
- package/src/check.ts +33 -15
- package/src/cli/options.ts +1 -0
- package/src/cli/tlc.ts +9 -0
- package/src/evaluate.ts +2 -1
- package/src/parallel-worker.ts +6 -3
- package/src/parallel.ts +15 -7
- package/src/sany/generator.ts +9 -7
- package/src/sany/linter.ts +30 -21
- package/src/search.ts +43 -24
- package/src/values.ts +29 -2
package/README.md
CHANGED
|
@@ -54,6 +54,8 @@ result.violation?.trace;
|
|
|
54
54
|
| `loadModule` | Returns the source of an imported module |
|
|
55
55
|
| `workers` | The number of worker threads. Defaults to 1 |
|
|
56
56
|
|
|
57
|
+
A check with several workers starts over on one worker when the search creates a string, such as with `\o` or `ToString`. 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.
|
|
58
|
+
|
|
57
59
|
### `prove`
|
|
58
60
|
|
|
59
61
|
```ts
|
package/dist/index.d.cts
CHANGED
|
@@ -695,6 +695,7 @@ interface CheckOptions {
|
|
|
695
695
|
livenessCheck?: "default" | "final";
|
|
696
696
|
dump?: StateDump;
|
|
697
697
|
isTool?: boolean;
|
|
698
|
+
isContinued?: boolean;
|
|
698
699
|
isTraceRecorded?: boolean;
|
|
699
700
|
isSanyReported?: boolean;
|
|
700
701
|
isWarningEnabled?: boolean;
|
|
@@ -743,10 +744,17 @@ type CheckProgress = {
|
|
|
743
744
|
statistics: SearchStatistics;
|
|
744
745
|
} | {
|
|
745
746
|
kind: "liveness-finished";
|
|
747
|
+
} | {
|
|
748
|
+
kind: "sequential-fallback";
|
|
749
|
+
string: string;
|
|
746
750
|
} | {
|
|
747
751
|
kind: "warning";
|
|
748
752
|
code: number;
|
|
749
753
|
text: string;
|
|
754
|
+
} | {
|
|
755
|
+
kind: "violation";
|
|
756
|
+
status: CheckStatus;
|
|
757
|
+
violation: Violation;
|
|
750
758
|
} | ({
|
|
751
759
|
kind: "java-override";
|
|
752
760
|
} & JavaOverride);
|
package/dist/index.d.ts
CHANGED
|
@@ -695,6 +695,7 @@ interface CheckOptions {
|
|
|
695
695
|
livenessCheck?: "default" | "final";
|
|
696
696
|
dump?: StateDump;
|
|
697
697
|
isTool?: boolean;
|
|
698
|
+
isContinued?: boolean;
|
|
698
699
|
isTraceRecorded?: boolean;
|
|
699
700
|
isSanyReported?: boolean;
|
|
700
701
|
isWarningEnabled?: boolean;
|
|
@@ -743,10 +744,17 @@ type CheckProgress = {
|
|
|
743
744
|
statistics: SearchStatistics;
|
|
744
745
|
} | {
|
|
745
746
|
kind: "liveness-finished";
|
|
747
|
+
} | {
|
|
748
|
+
kind: "sequential-fallback";
|
|
749
|
+
string: string;
|
|
746
750
|
} | {
|
|
747
751
|
kind: "warning";
|
|
748
752
|
code: number;
|
|
749
753
|
text: string;
|
|
754
|
+
} | {
|
|
755
|
+
kind: "violation";
|
|
756
|
+
status: CheckStatus;
|
|
757
|
+
violation: Violation;
|
|
750
758
|
} | ({
|
|
751
759
|
kind: "java-override";
|
|
752
760
|
} & JavaOverride);
|
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.
|
|
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.Ft(),l=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,u=t.h(n.config,l,()=>s.getDeclarationOrder(`variable`)),d=u?.spec.next;if(!u||d===void 0)return r.postMessage({type:`abort`});let f=n.index,p=t.Tt(),m=t.t(l.variables.length),h={fingerprints:n.fingerprints},g=n.requests,_=n.remaining,v=u.isSymmetric?t.r():void 0,y=/* @__PURE__ */ new Int32Array(2),b={resume:()=>{},loot:e=>{}};n.ports.forEach(e=>{e?.addEventListener(`message`,e=>b.loot(e.data)),e?.start?.()});let x={states:m(n.seed).map(p)},S=e.t(),C=(e,r)=>{let i=Atomics.load(g,f)-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(g,f,r),Atomics.notify(g,f)},w=e=>{Atomics.store(_,f,0),Atomics.compareExchange(g,f,0,-1)!==0&&C(e,-1)},T=e=>{Atomics.store(_,f,e.end-e.origin),Atomics.store(g,f,0)},E=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(g,f)>0&&C(e,0),Atomics.store(_,f,e.end-e.origin-1),e.successors=t.st(d,r,l,u.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(h.fingerprints))return`paused`;let n=i[e.index];if(u.findViolatedActionProperty(r,n.state))return;if(!u.satisfiesActionConstraints(r,n.state)){if(u.findViolatedInvariant(n.state,r))return;continue}if(v&&(t.c(n.state,y),!v.insert(y[0],y[1])))continue;p(n.state);let a=u.getFingerprintState(n.state);if(t.c(a,y),t.o(h.fingerprints,y[0],y[1])){if(u.findViolatedInvariant(n.state,r))return;u.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`},D=async e=>{let t=/* @__PURE__ */ new Set;for(;;){let r=n.ports.reduce((e,n,r)=>!n||t.has(r)||Atomics.load(_,r)<2?e:e===void 0||Atomics.load(_,r)>Atomics.load(_,e)?r:e,void 0);if(r===void 0)return!1;let i=Atomics.compareExchange(g,r,0,f+1);if(i===-1&&t.add(r),i>0&&Atomics.wait(g,r,i),i!==0)continue;let a=await new Promise(e=>b.loot=e);if(a.count===0)t.add(r);else return e.states=m(a).map(p),e.origin=0,e.end=e.states.length,T(e),!0}},O=e=>r.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),k=async()=>{let e={states:x.states,origin:0,end:x.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=E(e);if(t===void 0)return;if(t===`break`)await S(),e.breakAt=performance.now()+100;else if(w(e),t===`paused`){let t=new Promise(e=>b.resume=e);O({type:`paused`}),await t,T(e)}else if(!await D(e))break}return t.Ft()===c?(x.states=e.next,Atomics.store(_,f,x.states.length),{type:`level`,generated:e.generated,added:e.next.length,outDegrees:e.outDegrees,fingerprints:u.getStoredFingerprints(e.next,e.fingerprintStates)}):{type:`abort`,string:t.Pt(c)}},A=()=>{k().then(e=>O(e??{type:`abort`}),()=>O({type:`abort`}))};r.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&A(),t.type===`resize`&&(h.fingerprints=t.fingerprints,b.resume())}),Atomics.store(_,f,x.states.length),O({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,
|
|
9
|
+
import{n as e,t}from"./worker.js";import{Bt as n,Ft as r,M as i,N as a,Pt 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=a(e.source,y);n(x.getStringOrder(e.config)),c(e.version);let S=r(),C=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,w=u(e.config,C,()=>x.getDeclarationOrder(`variable`)),T=w?.spec.next;if(!w||T===void 0)return _.postMessage({type:`abort`});let E=e.index,D=s(),O=g(C.variables.length),k={fingerprints:e.fingerprints},A=e.requests,j=e.remaining,M=w.isSymmetric?p():void 0,N=/* @__PURE__ */ new Int32Array(2),P={resume:()=>{},loot:e=>{}};e.ports.forEach(e=>{e?.addEventListener(`message`,e=>P.loot(e.data)),e?.start?.()});let F={states:O(e.seed).map(D)},I=t(),L=(t,n)=>{let r=Atomics.load(A,E)-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(A,E,n),Atomics.notify(A,E)},R=e=>{Atomics.store(j,E,0),Atomics.compareExchange(A,E,0,-1)!==0&&L(e,-1)},z=e=>{Atomics.store(j,E,e.end-e.origin),Atomics.store(A,E,0)},B=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(A,E)>0&&L(t,0),Atomics.store(j,E,t.end-t.origin-1),t.successors=h(T,n,C,w.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(k.fingerprints))return`paused`;let e=r[t.index];if(w.findViolatedActionProperty(n,e.state))return;if(!w.satisfiesActionConstraints(n,e.state)){if(w.findViolatedInvariant(e.state,n))return;continue}if(M&&(l(e.state,N),!M.insert(N[0],N[1])))continue;D(e.state);let i=w.getFingerprintState(e.state);if(l(i,N),f(k.fingerprints,N[0],N[1])){if(w.findViolatedInvariant(e.state,n))return;w.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`},V=async t=>{let n=/* @__PURE__ */ new Set;for(;;){let r=e.ports.reduce((e,t,r)=>!t||n.has(r)||Atomics.load(j,r)<2?e:e===void 0||Atomics.load(j,r)>Atomics.load(j,e)?r:e,void 0);if(r===void 0)return!1;let i=Atomics.compareExchange(A,r,0,E+1);if(i===-1&&n.add(r),i>0&&Atomics.wait(A,r,i),i!==0)continue;let a=await new Promise(e=>P.loot=e);if(a.count===0)n.add(r);else return t.states=O(a).map(D),t.origin=0,t.end=t.states.length,z(t),!0}},H=e=>_.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),U=async()=>{let e={states:F.states,origin:0,end:F.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=B(e);if(t===void 0)return;if(t===`break`)await I(),e.breakAt=performance.now()+100;else if(R(e),t===`paused`){let t=new Promise(e=>P.resume=e);H({type:`paused`}),await t,z(e)}else if(!await V(e))break}return r()===S?(F.states=e.next,Atomics.store(j,E,F.states.length),{type:`level`,generated:e.generated,added:e.next.length,outDegrees:e.outDegrees,fingerprints:w.getStoredFingerprints(e.next,e.fingerprintStates)}):{type:`abort`,string:o(S)}},W=()=>{U().then(e=>H(e??{type:`abort`}),()=>H({type:`abort`}))};_.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&W(),t.type===`resize`&&(k.fingerprints=t.fingerprints,P.resume())}),Atomics.store(j,E,F.states.length),H({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?.()});
|