About the Execution of LTSMin+red for Philosophers-PT-005000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16204.092 | 3432624.00 | 7535996.00 | 112995.90 | F??TTFTTF??TFFF? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r297-tall-167873950200260.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Philosophers-PT-005000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950200260
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 226M
-rw-r--r-- 1 mcc users 8.4M Feb 25 22:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 43M Feb 25 22:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2M Feb 25 17:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 32M Feb 25 17:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2M Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12M Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.1M Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1M Feb 26 08:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 41M Feb 26 08:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9M Feb 26 03:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46M Feb 26 03:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 477K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 1.3M Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 11M Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Philosophers-PT-005000-LTLFireability-00
FORMULA_NAME Philosophers-PT-005000-LTLFireability-01
FORMULA_NAME Philosophers-PT-005000-LTLFireability-02
FORMULA_NAME Philosophers-PT-005000-LTLFireability-03
FORMULA_NAME Philosophers-PT-005000-LTLFireability-04
FORMULA_NAME Philosophers-PT-005000-LTLFireability-05
FORMULA_NAME Philosophers-PT-005000-LTLFireability-06
FORMULA_NAME Philosophers-PT-005000-LTLFireability-07
FORMULA_NAME Philosophers-PT-005000-LTLFireability-08
FORMULA_NAME Philosophers-PT-005000-LTLFireability-09
FORMULA_NAME Philosophers-PT-005000-LTLFireability-10
FORMULA_NAME Philosophers-PT-005000-LTLFireability-11
FORMULA_NAME Philosophers-PT-005000-LTLFireability-12
FORMULA_NAME Philosophers-PT-005000-LTLFireability-13
FORMULA_NAME Philosophers-PT-005000-LTLFireability-14
FORMULA_NAME Philosophers-PT-005000-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679474812672
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-005000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 08:46:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 08:46:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 08:46:55] [INFO ] Load time of PNML (sax parser for PT used): 768 ms
[2023-03-22 08:46:55] [INFO ] Transformed 25000 places.
[2023-03-22 08:46:56] [INFO ] Transformed 25000 transitions.
[2023-03-22 08:46:56] [INFO ] Parsed PT model containing 25000 places and 25000 transitions and 80000 arcs in 1053 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 232 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA Philosophers-PT-005000-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 159 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-22 08:47:03] [INFO ] Computed 10000 place invariants in 198 ms
[2023-03-22 08:47:06] [INFO ] Implicit Places using invariants in 3688 ms returned []
Implicit Place search using SMT only with invariants took 3757 ms to find 0 implicit places.
[2023-03-22 08:47:06] [INFO ] Invariant cache hit.
[2023-03-22 08:47:09] [INFO ] Dead Transitions using invariants and state equation in 2502 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6431 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Support contains 25000 out of 25000 places after structural reductions.
[2023-03-22 08:47:11] [INFO ] Flatten gal took : 1189 ms
[2023-03-22 08:47:13] [INFO ] Flatten gal took : 963 ms
[2023-03-22 08:47:16] [INFO ] Input system was already deterministic with 25000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14200 ms. (steps per millisecond=0 ) properties (out of 20) seen :15
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5242 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 6101 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5426 ms. (steps per millisecond=0 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1688 ms. (steps per millisecond=5 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1514 ms. (steps per millisecond=6 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-22 08:47:51] [INFO ] Invariant cache hit.
[2023-03-22 08:48:04] [INFO ] [Real]Absence check using 10000 positive place invariants in 7241 ms returned sat
[2023-03-22 08:48:08] [INFO ] After 17234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 08:48:22] [INFO ] [Nat]Absence check using 10000 positive place invariants in 8292 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 08:48:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 08:48:33] [INFO ] After 25181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 15001 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2985 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2991 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13424 ms. (steps per millisecond=0 ) properties (out of 5) seen :1
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5660 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 6426 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5674 ms. (steps per millisecond=0 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1633 ms. (steps per millisecond=6 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-22 08:49:09] [INFO ] Invariant cache hit.
[2023-03-22 08:49:22] [INFO ] [Real]Absence check using 10000 positive place invariants in 6928 ms returned sat
[2023-03-22 08:49:25] [INFO ] After 15882ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 08:49:38] [INFO ] [Nat]Absence check using 10000 positive place invariants in 7352 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 08:49:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 08:49:50] [INFO ] After 25173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 209 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 25000/25000 places, 25000/25000 transitions.
FORMULA Philosophers-PT-005000-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 10000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1020 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-22 08:49:54] [INFO ] Invariant cache hit.
[2023-03-22 08:49:57] [INFO ] Implicit Places using invariants in 2654 ms returned []
Implicit Place search using SMT only with invariants took 2656 ms to find 0 implicit places.
[2023-03-22 08:49:57] [INFO ] Invariant cache hit.
[2023-03-22 08:49:59] [INFO ] Dead Transitions using invariants and state equation in 2623 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6306 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Stuttering acceptance computed with spot in 225 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-005000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s6252 1) (LT s12226 1)) (OR (LT s5324 1) (LT s11135 1)) (OR (LT s7453 1) (LT s13112 1)) (OR (LT s5457 1) (LT s9716 1)) (OR (LT s8370 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 10 ms.
FORMULA Philosophers-PT-005000-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-005000-LTLFireability-00 finished in 6685 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(!p1)))))'
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1497 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-22 08:50:01] [INFO ] Invariant cache hit.
[2023-03-22 08:50:04] [INFO ] Implicit Places using invariants in 2519 ms returned []
Implicit Place search using SMT only with invariants took 2525 ms to find 0 implicit places.
[2023-03-22 08:50:04] [INFO ] Invariant cache hit.
[2023-03-22 08:50:07] [INFO ] Dead Transitions using invariants and state equation in 2760 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6787 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : Philosophers-PT-005000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s5339 1) (LT s16139 1)) (OR (LT s6956 1) (LT s17751 1)) (OR (LT s5652 1) (LT s15812 1)) (OR (LT s5606 1) (LT s14420 1)) (OR (LT s8123 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 5750 steps with 1919 reset in 10022 ms.
Product exploration timeout after 5660 steps with 1871 reset in 10009 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 1 factoid took 145 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 3335 steps, including 1 resets, run visited all 2 properties in 4497 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 133 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1647 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-22 08:50:40] [INFO ] Invariant cache hit.
[2023-03-22 08:50:42] [INFO ] Implicit Places using invariants in 2603 ms returned []
Implicit Place search using SMT only with invariants took 2621 ms to find 0 implicit places.
[2023-03-22 08:50:42] [INFO ] Invariant cache hit.
[2023-03-22 08:50:45] [INFO ] Dead Transitions using invariants and state equation in 2518 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6788 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 6668 steps, including 2 resets, run visited all 2 properties in 8985 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 155 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration timeout after 6030 steps with 1989 reset in 10003 ms.
Product exploration timeout after 5970 steps with 1968 reset in 10011 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2250 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-22 08:51:23] [INFO ] Invariant cache hit.
[2023-03-22 08:51:25] [INFO ] Dead Transitions using invariants and state equation in 2392 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4654 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1313 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-22 08:51:27] [INFO ] Invariant cache hit.
[2023-03-22 08:51:29] [INFO ] Implicit Places using invariants in 2355 ms returned []
Implicit Place search using SMT only with invariants took 2366 ms to find 0 implicit places.
[2023-03-22 08:51:29] [INFO ] Invariant cache hit.
[2023-03-22 08:51:32] [INFO ] Dead Transitions using invariants and state equation in 2347 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6037 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Treatment of property Philosophers-PT-005000-LTLFireability-01 finished in 96275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((p1&&F(p2))))))'
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 56 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-22 08:51:36] [INFO ] Invariant cache hit.
[2023-03-22 08:51:38] [INFO ] Implicit Places using invariants in 2330 ms returned []
Implicit Place search using SMT only with invariants took 2331 ms to find 0 implicit places.
[2023-03-22 08:51:38] [INFO ] Invariant cache hit.
[2023-03-22 08:51:41] [INFO ] Dead Transitions using invariants and state equation in 2260 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4652 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : Philosophers-PT-005000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LT s20785 1) (LT s21305 1) (LT s21825 1) (LT s22345 1) (LT s19225 1) (LT s23385 1) (LT s24425 1) (LT s20606 1) (LT s19404 1) (LT s24246 1) (LT s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 5970 steps with 48 reset in 10015 ms.
Product exploration timeout after 5750 steps with 40 reset in 10003 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 (NOT p2)))), (X p1)]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13989 ms. (steps per millisecond=0 ) properties (out of 4) seen :1
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5466 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 5641 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 6136 ms. (steps per millisecond=0 ) properties seen 0
Running SMT prover for 3 properties.
[2023-03-22 08:52:37] [INFO ] Invariant cache hit.
[2023-03-22 08:52:51] [INFO ] [Real]Absence check using 10000 positive place invariants in 8552 ms returned sat
[2023-03-22 08:52:53] [INFO ] After 16055ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 08:53:07] [INFO ] [Nat]Absence check using 10000 positive place invariants in 8497 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 08:53:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 08:53:18] [INFO ] After 25116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 160 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13901 ms. (steps per millisecond=0 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5542 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 5675 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 6312 ms. (steps per millisecond=0 ) properties seen 0
Probabilistic random walk after 188918 steps, saw 188878 distinct states, run finished after 93416 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-22 08:55:26] [INFO ] Invariant cache hit.
[2023-03-22 08:55:44] [INFO ] [Real]Absence check using 10000 positive place invariants in 9222 ms returned sat
[2023-03-22 08:55:46] [INFO ] After 19825ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 08:56:01] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9216 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 08:56:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 08:56:13] [INFO ] After 27300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 435 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 436 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 206 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-22 08:56:14] [INFO ] Invariant cache hit.
[2023-03-22 08:56:16] [INFO ] Implicit Places using invariants in 2640 ms returned []
Implicit Place search using SMT only with invariants took 2650 ms to find 0 implicit places.
[2023-03-22 08:56:16] [INFO ] Invariant cache hit.
[2023-03-22 08:56:19] [INFO ] Dead Transitions using invariants and state equation in 2495 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5367 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 (NOT p2)))), (X p1)]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 324 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 188 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 52 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-22 08:56:21] [INFO ] Invariant cache hit.
[2023-03-22 08:56:24] [INFO ] Implicit Places using invariants in 2619 ms returned []
Implicit Place search using SMT only with invariants took 2625 ms to find 0 implicit places.
[2023-03-22 08:56:24] [INFO ] Invariant cache hit.
[2023-03-22 08:56:27] [INFO ] Dead Transitions using invariants and state equation in 2573 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5257 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 (NOT p2)))), (X p1)]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14112 ms. (steps per millisecond=0 ) properties (out of 4) seen :1
Interrupted Best-First random walk after 3001 steps, including 0 resets, run timeout after 5267 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6263 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6375 ms. (steps per millisecond=0 ) properties seen 0
Running SMT prover for 3 properties.
[2023-03-22 08:57:04] [INFO ] Invariant cache hit.
[2023-03-22 08:57:22] [INFO ] [Real]Absence check using 10000 positive place invariants in 9161 ms returned sat
[2023-03-22 08:57:24] [INFO ] After 19569ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 08:57:41] [INFO ] [Nat]Absence check using 10000 positive place invariants in 10789 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 08:57:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 08:57:49] [INFO ] After 25342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 412 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 413 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17111 ms. (steps per millisecond=0 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 3001 steps, including 0 resets, run timeout after 5350 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 5638 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 6342 ms. (steps per millisecond=0 ) properties seen 0
Probabilistic random walk after 186918 steps, saw 186878 distinct states, run finished after 105773 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-22 09:00:12] [INFO ] Invariant cache hit.
[2023-03-22 09:00:34] [INFO ] [Real]Absence check using 10000 positive place invariants in 11260 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 09:00:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 09:00:38] [INFO ] After 25796ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 335 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 348 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2025 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-22 09:00:41] [INFO ] Invariant cache hit.
[2023-03-22 09:00:49] [INFO ] Implicit Places using invariants in 8070 ms returned []
Implicit Place search using SMT only with invariants took 8080 ms to find 0 implicit places.
[2023-03-22 09:00:49] [INFO ] Invariant cache hit.
[2023-03-22 09:00:51] [INFO ] Dead Transitions using invariants and state equation in 2868 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12992 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 (NOT p2)))), (X p1)]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 341 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 2435 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 7026 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 315 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Product exploration timeout after 5730 steps with 45 reset in 10004 ms.
Product exploration timeout after 5650 steps with 49 reset in 10017 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 153 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 165 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-22 09:01:25] [INFO ] Invariant cache hit.
[2023-03-22 09:01:27] [INFO ] Dead Transitions using invariants and state equation in 2490 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2660 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 54 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-22 09:01:27] [INFO ] Invariant cache hit.
[2023-03-22 09:01:30] [INFO ] Implicit Places using invariants in 2758 ms returned []
Implicit Place search using SMT only with invariants took 2761 ms to find 0 implicit places.
[2023-03-22 09:01:30] [INFO ] Invariant cache hit.
[2023-03-22 09:01:33] [INFO ] Dead Transitions using invariants and state equation in 2654 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5472 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Treatment of property Philosophers-PT-005000-LTLFireability-02 finished in 599439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 10000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 51 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-22 09:01:36] [INFO ] Invariant cache hit.
[2023-03-22 09:01:38] [INFO ] Implicit Places using invariants in 2845 ms returned []
Implicit Place search using SMT only with invariants took 2848 ms to find 0 implicit places.
[2023-03-22 09:01:38] [INFO ] Invariant cache hit.
[2023-03-22 09:01:41] [INFO ] Dead Transitions using invariants and state equation in 2578 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5478 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-005000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s644 1) (GEQ s5981 1)) (AND (GEQ s3113 1) (GEQ s8903 1)) (AND (GEQ s1533 1) (GEQ s6233 1)) (AND (GEQ s3838 1) (GEQ s8466 1)) (AND (GEQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 10880 steps with 5440 reset in 10006 ms.
Product exploration timeout after 9960 steps with 4980 reset in 10006 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-PT-005000-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-PT-005000-LTLFireability-04 finished in 27273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F((F(G((p2 U p0)))&&G(p3)))&&p1)))'
Support contains 7 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Performed 4993 Post agglomeration using F-continuation condition.Transition count delta: 4993
Deduced a syphon composed of 4993 places in 7 ms
Reduce places removed 4993 places and 0 transitions.
Iterating global reduction 0 with 9986 rules applied. Total rules applied 9986 place count 20007 transition count 20007
Applied a total of 9986 rules in 7867 ms. Remains 20007 /25000 variables (removed 4993) and now considering 20007/25000 (removed 4993) transitions.
// Phase 1: matrix 20007 rows 20007 cols
[2023-03-22 09:02:11] [INFO ] Computed 10000 place invariants in 64 ms
[2023-03-22 09:02:13] [INFO ] Implicit Places using invariants in 2246 ms returned []
Implicit Place search using SMT only with invariants took 2248 ms to find 0 implicit places.
[2023-03-22 09:02:13] [INFO ] Invariant cache hit.
[2023-03-22 09:02:15] [INFO ] Dead Transitions using invariants and state equation in 2295 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20007/25000 places, 20007/25000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12419 ms. Remains : 20007/25000 places, 20007/25000 transitions.
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p1) (NOT p0) (NOT p3)), true, (OR (NOT p0) (NOT p3)), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-005000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(AND p1 p3 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p1 p3 (NOT p0) p2), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p3, acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(AND p3 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p3 (NOT p0) p2), acceptance={} source=2 dest: 4}], [{ cond=(OR p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s2161 1) (GEQ s7561 1)), p0:(AND (GEQ s1637 1) (GEQ s6174 1)), p3:(GEQ s20000 1), p2:(AND (GEQ s8864 1) (GEQ s14167 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration timeout after 8400 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 5841 steps with 0 reset with depth 5842 and stack size 5842 in 7809 ms.
FORMULA Philosophers-PT-005000-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-005000-LTLFireability-08 finished in 30568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p1||G(F(p2))))))'
Support contains 6 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 3668 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-22 09:02:37] [INFO ] Computed 10000 place invariants in 312 ms
[2023-03-22 09:02:40] [INFO ] Implicit Places using invariants in 2872 ms returned []
Implicit Place search using SMT only with invariants took 2888 ms to find 0 implicit places.
[2023-03-22 09:02:40] [INFO ] Invariant cache hit.
[2023-03-22 09:02:42] [INFO ] Dead Transitions using invariants and state equation in 2652 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9214 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Philosophers-PT-005000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s3991 1) (GEQ s8336 1)), p1:(AND (GEQ s7486 1) (GEQ s13143 1) (GEQ s3991 1) (GEQ s8336 1)), p2:(AND (GEQ s4340 1) (GEQ s10057 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 12390 steps with 1 reset in 10017 ms.
Product exploration timeout after 10750 steps with 1 reset in 10012 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1)]
Knowledge based reduction with 2 factoid took 320 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Finished random walk after 1527 steps, including 0 resets, run visited all 5 properties in 2284 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (F (NOT p0)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (NOT p2)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 577 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2097 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-22 09:03:10] [INFO ] Invariant cache hit.
[2023-03-22 09:03:13] [INFO ] Implicit Places using invariants in 2403 ms returned []
Implicit Place search using SMT only with invariants took 2413 ms to find 0 implicit places.
[2023-03-22 09:03:13] [INFO ] Invariant cache hit.
[2023-03-22 09:03:15] [INFO ] Dead Transitions using invariants and state equation in 2330 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6869 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2)]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 152 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Finished random walk after 3217 steps, including 0 resets, run visited all 5 properties in 4322 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p0 (NOT p1) p2)]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (F (NOT p0)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (NOT p2)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 288 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Product exploration timeout after 13640 steps with 1 reset in 10013 ms.
Product exploration timeout after 9550 steps with 1 reset in 10005 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Performed 4994 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4994 places in 5 ms
Iterating global reduction 0 with 4994 rules applied. Total rules applied 4994 place count 25000 transition count 25000
Deduced a syphon composed of 4994 places in 5 ms
Applied a total of 4994 rules in 7999 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-22 09:03:50] [INFO ] Computed 10000 place invariants in 96 ms
[2023-03-22 09:03:53] [INFO ] Dead Transitions using invariants and state equation in 2881 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25000/25000 places, 25000/25000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10894 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Support contains 6 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2293 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-22 09:03:55] [INFO ] Computed 10000 place invariants in 129 ms
[2023-03-22 09:03:58] [INFO ] Implicit Places using invariants in 2507 ms returned []
Implicit Place search using SMT only with invariants took 2513 ms to find 0 implicit places.
[2023-03-22 09:03:58] [INFO ] Invariant cache hit.
[2023-03-22 09:04:00] [INFO ] Dead Transitions using invariants and state equation in 2457 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7287 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Treatment of property Philosophers-PT-005000-LTLFireability-09 finished in 88105 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)))))'
Support contains 5 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2188 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-22 09:04:04] [INFO ] Invariant cache hit.
[2023-03-22 09:04:06] [INFO ] Implicit Places using invariants in 2365 ms returned []
Implicit Place search using SMT only with invariants took 2380 ms to find 0 implicit places.
[2023-03-22 09:04:06] [INFO ] Invariant cache hit.
[2023-03-22 09:04:09] [INFO ] Dead Transitions using invariants and state equation in 2854 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7433 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Philosophers-PT-005000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s19128 1) (AND (GEQ s3441 1) (GEQ s9061 1)) (AND (GEQ s4694 1) (GEQ s9453 1))), p1:(GEQ s19128 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 12500 steps with 0 reset in 10004 ms.
Product exploration timeout after 13810 steps with 0 reset in 10002 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 9908 steps, including 2 resets, run visited all 3 properties in 13287 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-22 09:04:45] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 5 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2265 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-22 09:05:02] [INFO ] Invariant cache hit.
[2023-03-22 09:05:04] [INFO ] Implicit Places using invariants in 2470 ms returned []
Implicit Place search using SMT only with invariants took 2476 ms to find 0 implicit places.
[2023-03-22 09:05:04] [INFO ] Invariant cache hit.
[2023-03-22 09:05:07] [INFO ] Dead Transitions using invariants and state equation in 2415 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7168 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 8177 steps, including 2 resets, run visited all 3 properties in 11083 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 198 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-22 09:05:20] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration timeout after 16170 steps with 0 reset in 10003 ms.
Product exploration timeout after 14710 steps with 0 reset in 10003 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 5 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Performed 4995 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4995 places in 5 ms
Iterating global reduction 0 with 4995 rules applied. Total rules applied 4995 place count 25000 transition count 25000
Deduced a syphon composed of 4995 places in 4 ms
Applied a total of 4995 rules in 7035 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-22 09:06:03] [INFO ] Computed 10000 place invariants in 68 ms
[2023-03-22 09:06:05] [INFO ] Dead Transitions using invariants and state equation in 2424 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25000/25000 places, 25000/25000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9467 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Support contains 5 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2185 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-22 09:06:07] [INFO ] Computed 10000 place invariants in 67 ms
[2023-03-22 09:06:10] [INFO ] Implicit Places using invariants in 2635 ms returned []
Implicit Place search using SMT only with invariants took 2637 ms to find 0 implicit places.
[2023-03-22 09:06:10] [INFO ] Invariant cache hit.
[2023-03-22 09:06:12] [INFO ] Dead Transitions using invariants and state equation in 2557 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7395 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Treatment of property Philosophers-PT-005000-LTLFireability-10 finished in 132590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1 U p2))))'
Support contains 6 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2287 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-22 09:06:16] [INFO ] Invariant cache hit.
[2023-03-22 09:06:19] [INFO ] Implicit Places using invariants in 2626 ms returned []
Implicit Place search using SMT only with invariants took 2632 ms to find 0 implicit places.
[2023-03-22 09:06:19] [INFO ] Invariant cache hit.
[2023-03-22 09:06:21] [INFO ] Dead Transitions using invariants and state equation in 2587 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7509 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : Philosophers-PT-005000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(AND (GEQ s6313 1) (GEQ s17571 1)), p1:(AND (GEQ s4216 1) (GEQ s9938 1)), p0:(AND (GEQ s2965 1) (GEQ s7954 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 558 steps with 0 reset in 855 ms.
FORMULA Philosophers-PT-005000-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-005000-LTLFireability-13 finished in 8639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(X(F(p0))))))))'
Support contains 2 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2284 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-22 09:06:25] [INFO ] Invariant cache hit.
[2023-03-22 09:06:27] [INFO ] Implicit Places using invariants in 2356 ms returned []
Implicit Place search using SMT only with invariants took 2358 ms to find 0 implicit places.
[2023-03-22 09:06:27] [INFO ] Invariant cache hit.
[2023-03-22 09:06:30] [INFO ] Dead Transitions using invariants and state equation in 2842 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7488 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Stuttering acceptance computed with spot in 309 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-005000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(OR (LT s8070 1) (LT s12961 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration timeout after 6220 steps with 646 reset in 10013 ms.
Product exploration timeout after 7310 steps with 1044 reset in 10010 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 62 ms. Reduced automaton from 7 states, 7 edges and 1 AP (stutter sensitive) to 7 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13416 ms. (steps per millisecond=0 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1246 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2237 steps, run visited all 1 properties in 426 ms. (steps per millisecond=5 )
Probabilistic random walk after 2237 steps, saw 2239 distinct states, run finished after 467 ms. (steps per millisecond=4 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 7 states, 7 edges and 1 AP (stutter sensitive) to 7 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 263 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2323 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-22 09:07:10] [INFO ] Invariant cache hit.
[2023-03-22 09:07:13] [INFO ] Implicit Places using invariants in 2567 ms returned []
Implicit Place search using SMT only with invariants took 2573 ms to find 0 implicit places.
[2023-03-22 09:07:13] [INFO ] Invariant cache hit.
[2023-03-22 09:07:15] [INFO ] Dead Transitions using invariants and state equation in 2550 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7448 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 51 ms. Reduced automaton from 7 states, 7 edges and 1 AP (stutter sensitive) to 7 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 7106 steps, including 2 resets, run visited all 1 properties in 9497 ms. (steps per millisecond=0 )
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 88 ms. Reduced automaton from 7 states, 7 edges and 1 AP (stutter sensitive) to 7 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 250 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 7330 steps with 781 reset in 10025 ms.
Product exploration timeout after 7260 steps with 1037 reset in 10008 ms.
Applying partial POR strategy [true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 292 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Performed 4998 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4998 places in 4 ms
Iterating global reduction 0 with 4998 rules applied. Total rules applied 4998 place count 25000 transition count 25000
Deduced a syphon composed of 4998 places in 4 ms
Applied a total of 4998 rules in 6630 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-22 09:07:55] [INFO ] Computed 10000 place invariants in 67 ms
[2023-03-22 09:07:57] [INFO ] Dead Transitions using invariants and state equation in 2741 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25000/25000 places, 25000/25000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9373 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Support contains 2 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2233 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2023-03-22 09:08:00] [INFO ] Computed 10000 place invariants in 82 ms
[2023-03-22 09:08:02] [INFO ] Implicit Places using invariants in 2667 ms returned []
Implicit Place search using SMT only with invariants took 2669 ms to find 0 implicit places.
[2023-03-22 09:08:02] [INFO ] Invariant cache hit.
[2023-03-22 09:08:05] [INFO ] Dead Transitions using invariants and state equation in 2411 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7314 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Treatment of property Philosophers-PT-005000-LTLFireability-15 finished in 103163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(!p1)))))'
Found a Shortening insensitive property : Philosophers-PT-005000-LTLFireability-01
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 2243 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-22 09:08:08] [INFO ] Invariant cache hit.
[2023-03-22 09:08:11] [INFO ] Implicit Places using invariants in 2619 ms returned []
Implicit Place search using SMT only with invariants took 2621 ms to find 0 implicit places.
[2023-03-22 09:08:11] [INFO ] Invariant cache hit.
[2023-03-22 09:08:13] [INFO ] Dead Transitions using invariants and state equation in 2450 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 7318 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Running random walk in product with property : Philosophers-PT-005000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s5339 1) (LT s16139 1)) (OR (LT s6956 1) (LT s17751 1)) (OR (LT s5652 1) (LT s15812 1)) (OR (LT s5606 1) (LT s14420 1)) (OR (LT s8123 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 6210 steps with 2087 reset in 10014 ms.
Product exploration timeout after 5880 steps with 1983 reset in 10027 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 3335 steps, including 1 resets, run visited all 2 properties in 4390 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 139 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1324 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-22 09:08:46] [INFO ] Invariant cache hit.
[2023-03-22 09:08:48] [INFO ] Implicit Places using invariants in 2470 ms returned []
Implicit Place search using SMT only with invariants took 2473 ms to find 0 implicit places.
[2023-03-22 09:08:48] [INFO ] Invariant cache hit.
[2023-03-22 09:08:51] [INFO ] Dead Transitions using invariants and state equation in 2533 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6332 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 1 factoid took 120 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 177 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration timeout after 6140 steps with 2015 reset in 10013 ms.
Product exploration timeout after 5990 steps with 1969 reset in 10006 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1425 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-22 09:09:18] [INFO ] Invariant cache hit.
[2023-03-22 09:09:21] [INFO ] Dead Transitions using invariants and state equation in 2848 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4275 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1345 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-22 09:09:23] [INFO ] Invariant cache hit.
[2023-03-22 09:09:25] [INFO ] Implicit Places using invariants in 2760 ms returned []
Implicit Place search using SMT only with invariants took 2761 ms to find 0 implicit places.
[2023-03-22 09:09:25] [INFO ] Invariant cache hit.
[2023-03-22 09:09:28] [INFO ] Dead Transitions using invariants and state equation in 2771 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6879 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Treatment of property Philosophers-PT-005000-LTLFireability-01 finished in 85493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((p1&&F(p2))))))'
Found a Lengthening insensitive property : Philosophers-PT-005000-LTLFireability-02
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 172 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-22 09:09:32] [INFO ] Invariant cache hit.
[2023-03-22 09:09:35] [INFO ] Implicit Places using invariants in 2850 ms returned []
Implicit Place search using SMT only with invariants took 2853 ms to find 0 implicit places.
[2023-03-22 09:09:35] [INFO ] Invariant cache hit.
[2023-03-22 09:09:37] [INFO ] Dead Transitions using invariants and state equation in 2759 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5788 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Running random walk in product with property : Philosophers-PT-005000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LT s20785 1) (LT s21305 1) (LT s21825 1) (LT s22345 1) (LT s19225 1) (LT s23385 1) (LT s24425 1) (LT s20606 1) (LT s19404 1) (LT s24246 1) (LT s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 5760 steps with 44 reset in 10016 ms.
Product exploration timeout after 5560 steps with 44 reset in 10004 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 (NOT p2)))), (X p1)]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14238 ms. (steps per millisecond=0 ) properties (out of 4) seen :1
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5265 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7864 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 3001 steps, including 0 resets, run timeout after 6418 ms. (steps per millisecond=0 ) properties seen 0
Running SMT prover for 3 properties.
[2023-03-22 09:10:36] [INFO ] Invariant cache hit.
[2023-03-22 09:10:53] [INFO ] [Real]Absence check using 10000 positive place invariants in 10743 ms returned sat
[2023-03-22 09:10:56] [INFO ] After 19131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 09:11:13] [INFO ] [Nat]Absence check using 10000 positive place invariants in 11060 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 09:11:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 09:11:21] [INFO ] After 25125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 255 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13540 ms. (steps per millisecond=0 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5913 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 9400 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 3001 steps, including 0 resets, run timeout after 5146 ms. (steps per millisecond=0 ) properties seen 0
Probabilistic random walk after 207904 steps, saw 207858 distinct states, run finished after 111504 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-22 09:13:48] [INFO ] Invariant cache hit.
[2023-03-22 09:14:06] [INFO ] [Real]Absence check using 10000 positive place invariants in 9248 ms returned sat
[2023-03-22 09:14:09] [INFO ] After 20880ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 09:14:26] [INFO ] [Nat]Absence check using 10000 positive place invariants in 8964 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 09:14:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 09:14:34] [INFO ] After 25208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 1351 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1351 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 161 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-22 09:14:36] [INFO ] Invariant cache hit.
[2023-03-22 09:14:38] [INFO ] Implicit Places using invariants in 2590 ms returned []
Implicit Place search using SMT only with invariants took 2592 ms to find 0 implicit places.
[2023-03-22 09:14:38] [INFO ] Invariant cache hit.
[2023-03-22 09:14:41] [INFO ] Dead Transitions using invariants and state equation in 2752 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5520 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 (NOT p2)))), (X p1)]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 252 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 137 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 76 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2023-03-22 09:14:45] [INFO ] Invariant cache hit.
[2023-03-22 09:14:48] [INFO ] Implicit Places using invariants in 3103 ms returned []
Implicit Place search using SMT only with invariants took 3105 ms to find 0 implicit places.
[2023-03-22 09:14:48] [INFO ] Invariant cache hit.
[2023-03-22 09:14:51] [INFO ] Dead Transitions using invariants and state equation in 3001 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6186 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 (NOT p2)))), (X p1)]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 268 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14637 ms. (steps per millisecond=0 ) properties (out of 4) seen :1
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5574 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6106 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 6345 ms. (steps per millisecond=0 ) properties seen 0
Running SMT prover for 3 properties.
[2023-03-22 09:15:30] [INFO ] Invariant cache hit.
[2023-03-22 09:15:48] [INFO ] [Real]Absence check using 10000 positive place invariants in 11569 ms returned sat
[2023-03-22 09:15:50] [INFO ] After 20013ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 09:16:05] [INFO ] [Nat]Absence check using 10000 positive place invariants in 9542 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 09:16:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 09:16:15] [INFO ] After 25151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 156 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14783 ms. (steps per millisecond=0 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5450 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 5642 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 6373 ms. (steps per millisecond=0 ) properties seen 0
Probabilistic random walk after 193912 steps, saw 193869 distinct states, run finished after 100700 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-22 09:18:30] [INFO ] Invariant cache hit.
[2023-03-22 09:19:03] [INFO ] [Real]Absence check using 10000 positive place invariants in 17244 ms returned unknown
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 09:19:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 09:19:03] [INFO ] After 32228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 15000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 369 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 370 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2201/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2201/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 223 seconds
MemTotal: 16393216 kB
MemFree: 12985624 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16238932 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2201/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 223 seconds
MemTotal: 16393216 kB
MemFree: 9677204 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16236600 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2201/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2201/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2201/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2201/ltl_6_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 223 seconds
MemTotal: 16393216 kB
MemFree: 13859380 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16192060 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2201/ltl_7_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2201/ltl_8_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2201/ltl_9_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2201/ltl_10_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2201/ltl_11_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2201/ltl_12_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2201/ltl_13_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2201/ltl_14_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2201/ltl_15_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Philosophers-PT-005000-LTLFireability-00
Could not compute solution for formula : Philosophers-PT-005000-LTLFireability-01
Could not compute solution for formula : Philosophers-PT-005000-LTLFireability-02
Could not compute solution for formula : Philosophers-PT-005000-LTLFireability-03
Could not compute solution for formula : Philosophers-PT-005000-LTLFireability-04
Could not compute solution for formula : Philosophers-PT-005000-LTLFireability-05
Could not compute solution for formula : Philosophers-PT-005000-LTLFireability-06
Could not compute solution for formula : Philosophers-PT-005000-LTLFireability-07
Could not compute solution for formula : Philosophers-PT-005000-LTLFireability-08
Could not compute solution for formula : Philosophers-PT-005000-LTLFireability-09
Could not compute solution for formula : Philosophers-PT-005000-LTLFireability-10
Could not compute solution for formula : Philosophers-PT-005000-LTLFireability-11
Could not compute solution for formula : Philosophers-PT-005000-LTLFireability-12
Could not compute solution for formula : Philosophers-PT-005000-LTLFireability-13
Could not compute solution for formula : Philosophers-PT-005000-LTLFireability-14
Could not compute solution for formula : Philosophers-PT-005000-LTLFireability-15
BK_STOP 1679478245296
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name Philosophers-PT-005000-LTLFireability-00
ltl formula formula --ltl=/tmp/2201/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25000 places, 25000 transitions and 80000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-005000 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.580 real 1.020 user 1.250 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2201/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2201/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2201/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2201/ltl_0_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name Philosophers-PT-005000-LTLFireability-01
ltl formula formula --ltl=/tmp/2201/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25000 places, 25000 transitions and 80000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-005000 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.270 real 1.030 user 1.100 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2201/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2201/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2201/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2201/ltl_1_
Killing (15) : 2215 2216 2217 2218 2219
Killing (9) : 2215 2216 2217 2218 2219
ltl formula name Philosophers-PT-005000-LTLFireability-02
ltl formula formula --ltl=/tmp/2201/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25000 places, 25000 transitions and 80000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-005000 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.320 real 1.010 user 1.230 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2201/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2201/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2201/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2201/ltl_2_
Killing (15) : 2225 2226 2227 2228 2229
Killing (9) : 2225 2226 2227 2228 2229
ltl formula name Philosophers-PT-005000-LTLFireability-03
ltl formula formula --ltl=/tmp/2201/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25000 places, 25000 transitions and 80000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-005000 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.690 real 1.070 user 1.220 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2201/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2201/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2201/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2201/ltl_3_
terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula
ltl formula name Philosophers-PT-005000-LTLFireability-04
ltl formula formula --ltl=/tmp/2201/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25000 places, 25000 transitions and 80000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-005000 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2201/ltl_4_
pnml2lts-mc( 0/ 4): Loading Petri net took 3.380 real 1.030 user 1.180 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2201/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2201/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2201/ltl_4_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
ltl formula name Philosophers-PT-005000-LTLFireability-05
ltl formula formula --ltl=/tmp/2201/ltl_5_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25000 places, 25000 transitions and 80000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-005000 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.190 real 1.100 user 1.050 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2201/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2201/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2201/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2201/ltl_5_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name Philosophers-PT-005000-LTLFireability-06
ltl formula formula --ltl=/tmp/2201/ltl_6_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25000 places, 25000 transitions and 80000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-005000 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.210 real 0.990 user 1.110 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2201/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2201/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2201/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2201/ltl_6_
Killing (15) : 2317 2318 2319 2320 2321
Killing (9) : 2317 2318 2319 2320 2321
ltl formula name Philosophers-PT-005000-LTLFireability-07
ltl formula formula --ltl=/tmp/2201/ltl_7_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25000 places, 25000 transitions and 80000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-005000 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.460 real 0.970 user 1.230 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2201/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2201/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2201/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2201/ltl_7_
terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula
ltl formula name Philosophers-PT-005000-LTLFireability-08
ltl formula formula --ltl=/tmp/2201/ltl_8_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25000 places, 25000 transitions and 80000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-005000 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.390 real 1.000 user 1.280 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2201/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2201/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2201/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2201/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x564a5a77a3f4]
1: pnml2lts-mc(+0xa2496) [0x564a5a77a496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f1e77c37140]
3: pnml2lts-mc(+0x405be5) [0x564a5aaddbe5]
4: pnml2lts-mc(+0x164ad3) [0x564a5a83cad3]
5: pnml2lts-mc(+0x272e0a) [0x564a5a94ae0a]
6: pnml2lts-mc(+0xb61f0) [0x564a5a78e1f0]
7: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f1e77a8a4d7]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f1e77a8a67a]
9: pnml2lts-mc(+0xa1581) [0x564a5a779581]
10: pnml2lts-mc(+0xa1910) [0x564a5a779910]
11: pnml2lts-mc(+0xa32a2) [0x564a5a77b2a2]
12: pnml2lts-mc(+0xa50f4) [0x564a5a77d0f4]
13: pnml2lts-mc(+0xa516b) [0x564a5a77d16b]
14: pnml2lts-mc(+0x3f34b3) [0x564a5aacb4b3]
15: pnml2lts-mc(+0x7c63d) [0x564a5a75463d]
16: pnml2lts-mc(+0x67d86) [0x564a5a73fd86]
17: pnml2lts-mc(+0x60a8a) [0x564a5a738a8a]
18: pnml2lts-mc(+0x5eb15) [0x564a5a736b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f1e77a72d0a]
20: pnml2lts-mc(+0x6075e) [0x564a5a73875e]
ltl formula name Philosophers-PT-005000-LTLFireability-09
ltl formula formula --ltl=/tmp/2201/ltl_9_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25000 places, 25000 transitions and 80000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-005000 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.330 real 1.140 user 1.070 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2201/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2201/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2201/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2201/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name Philosophers-PT-005000-LTLFireability-10
ltl formula formula --ltl=/tmp/2201/ltl_10_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25000 places, 25000 transitions and 80000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-005000 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.300 real 1.020 user 1.150 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2201/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2201/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2201/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2201/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name Philosophers-PT-005000-LTLFireability-11
ltl formula formula --ltl=/tmp/2201/ltl_11_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25000 places, 25000 transitions and 80000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-005000 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.330 real 1.050 user 1.150 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2201/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2201/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2201/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2201/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name Philosophers-PT-005000-LTLFireability-12
ltl formula formula --ltl=/tmp/2201/ltl_12_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25000 places, 25000 transitions and 80000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-005000 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.360 real 1.010 user 1.220 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2201/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2201/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2201/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2201/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name Philosophers-PT-005000-LTLFireability-13
ltl formula formula --ltl=/tmp/2201/ltl_13_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25000 places, 25000 transitions and 80000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-005000 analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2201/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2201/ltl_13_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 6.510 real 1.440 user 1.350 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2201/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2201/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name Philosophers-PT-005000-LTLFireability-14
ltl formula formula --ltl=/tmp/2201/ltl_14_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25000 places, 25000 transitions and 80000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-005000 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.580 real 1.100 user 1.180 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2201/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2201/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2201/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2201/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name Philosophers-PT-005000-LTLFireability-15
ltl formula formula --ltl=/tmp/2201/ltl_15_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25000 places, 25000 transitions and 80000 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-005000 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.470 real 0.950 user 1.170 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2201/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2201/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2201/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2201/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-PT-005000"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is Philosophers-PT-005000, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r297-tall-167873950200260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-005000.tgz
mv Philosophers-PT-005000 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;