About the Execution of ITS-Tools for ShieldRVt-PT-100B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14337.951 | 3600000.00 | 13856264.00 | 1951.00 | F?FTFFFFFFTTFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r222-tall-165286026201051.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVt-PT-100B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286026201051
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.4K Apr 30 01:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 30 01:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 01:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 30 01:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 9 09:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 9 09:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 09:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.3M May 10 09:34 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 ShieldRVt-PT-100B-LTLCardinality-00
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-01
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-02
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-03
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-04
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-05
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-06
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-07
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-08
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-09
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-10
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-11
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-12
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-13
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-14
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1653084572408
Running Version 202205111006
[2022-05-20 22:09:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 22:09:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 22:09:33] [INFO ] Load time of PNML (sax parser for PT used): 242 ms
[2022-05-20 22:09:34] [INFO ] Transformed 5003 places.
[2022-05-20 22:09:34] [INFO ] Transformed 5003 transitions.
[2022-05-20 22:09:34] [INFO ] Found NUPN structural information;
[2022-05-20 22:09:34] [INFO ] Parsed PT model containing 5003 places and 5003 transitions in 473 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVt-PT-100B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 5003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5003/5003 places, 5003/5003 transitions.
Discarding 1095 places :
Symmetric choice reduction at 0 with 1095 rule applications. Total rules 1095 place count 3908 transition count 3908
Iterating global reduction 0 with 1095 rules applied. Total rules applied 2190 place count 3908 transition count 3908
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2191 place count 3907 transition count 3907
Iterating global reduction 0 with 1 rules applied. Total rules applied 2192 place count 3907 transition count 3907
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2193 place count 3906 transition count 3906
Iterating global reduction 0 with 1 rules applied. Total rules applied 2194 place count 3906 transition count 3906
Applied a total of 2194 rules in 2317 ms. Remains 3906 /5003 variables (removed 1097) and now considering 3906/5003 (removed 1097) transitions.
// Phase 1: matrix 3906 rows 3906 cols
[2022-05-20 22:09:36] [INFO ] Computed 401 place invariants in 61 ms
[2022-05-20 22:09:37] [INFO ] Implicit Places using invariants in 1267 ms returned []
// Phase 1: matrix 3906 rows 3906 cols
[2022-05-20 22:09:37] [INFO ] Computed 401 place invariants in 16 ms
[2022-05-20 22:09:39] [INFO ] Implicit Places using invariants and state equation in 1509 ms returned []
Implicit Place search using SMT with State Equation took 2828 ms to find 0 implicit places.
// Phase 1: matrix 3906 rows 3906 cols
[2022-05-20 22:09:39] [INFO ] Computed 401 place invariants in 18 ms
[2022-05-20 22:09:42] [INFO ] Dead Transitions using invariants and state equation in 2963 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3906/5003 places, 3906/5003 transitions.
Finished structural reductions, in 1 iterations. Remains : 3906/5003 places, 3906/5003 transitions.
Support contains 21 out of 3906 places after structural reductions.
[2022-05-20 22:09:42] [INFO ] Flatten gal took : 239 ms
[2022-05-20 22:09:42] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA ShieldRVt-PT-100B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 22:09:43] [INFO ] Flatten gal took : 152 ms
[2022-05-20 22:09:43] [INFO ] Input system was already deterministic with 3906 transitions.
Support contains 19 out of 3906 places (down from 21) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 531 ms. (steps per millisecond=18 ) properties (out of 12) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 3906 rows 3906 cols
[2022-05-20 22:09:44] [INFO ] Computed 401 place invariants in 11 ms
[2022-05-20 22:09:45] [INFO ] [Real]Absence check using 401 positive place invariants in 248 ms returned sat
[2022-05-20 22:09:45] [INFO ] After 1203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 22:09:46] [INFO ] [Nat]Absence check using 401 positive place invariants in 260 ms returned sat
[2022-05-20 22:09:50] [INFO ] After 4081ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2022-05-20 22:09:52] [INFO ] Deduced a trap composed of 51 places in 939 ms of which 10 ms to minimize.
[2022-05-20 22:09:53] [INFO ] Deduced a trap composed of 61 places in 992 ms of which 3 ms to minimize.
[2022-05-20 22:09:54] [INFO ] Deduced a trap composed of 60 places in 908 ms of which 7 ms to minimize.
[2022-05-20 22:09:55] [INFO ] Deduced a trap composed of 45 places in 878 ms of which 4 ms to minimize.
[2022-05-20 22:09:56] [INFO ] Deduced a trap composed of 59 places in 1288 ms of which 18 ms to minimize.
[2022-05-20 22:09:57] [INFO ] Deduced a trap composed of 48 places in 910 ms of which 9 ms to minimize.
[2022-05-20 22:09:58] [INFO ] Deduced a trap composed of 48 places in 871 ms of which 3 ms to minimize.
[2022-05-20 22:09:59] [INFO ] Deduced a trap composed of 44 places in 878 ms of which 2 ms to minimize.
[2022-05-20 22:10:00] [INFO ] Deduced a trap composed of 43 places in 854 ms of which 2 ms to minimize.
[2022-05-20 22:10:01] [INFO ] Deduced a trap composed of 52 places in 861 ms of which 2 ms to minimize.
[2022-05-20 22:10:02] [INFO ] Deduced a trap composed of 57 places in 827 ms of which 2 ms to minimize.
[2022-05-20 22:10:03] [INFO ] Deduced a trap composed of 67 places in 797 ms of which 2 ms to minimize.
[2022-05-20 22:10:04] [INFO ] Deduced a trap composed of 65 places in 783 ms of which 2 ms to minimize.
[2022-05-20 22:10:05] [INFO ] Deduced a trap composed of 64 places in 792 ms of which 1 ms to minimize.
[2022-05-20 22:10:06] [INFO ] Deduced a trap composed of 64 places in 781 ms of which 2 ms to minimize.
[2022-05-20 22:10:07] [INFO ] Deduced a trap composed of 73 places in 787 ms of which 1 ms to minimize.
[2022-05-20 22:10:08] [INFO ] Deduced a trap composed of 76 places in 769 ms of which 2 ms to minimize.
[2022-05-20 22:10:09] [INFO ] Deduced a trap composed of 79 places in 771 ms of which 1 ms to minimize.
[2022-05-20 22:10:10] [INFO ] Deduced a trap composed of 83 places in 734 ms of which 1 ms to minimize.
[2022-05-20 22:10:10] [INFO ] Deduced a trap composed of 69 places in 732 ms of which 2 ms to minimize.
[2022-05-20 22:10:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 22:10:10] [INFO ] After 25567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 1526 ms.
Support contains 11 out of 3906 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3906/3906 places, 3906/3906 transitions.
Drop transitions removed 1087 transitions
Trivial Post-agglo rules discarded 1087 transitions
Performed 1087 trivial Post agglomeration. Transition count delta: 1087
Iterating post reduction 0 with 1087 rules applied. Total rules applied 1087 place count 3906 transition count 2819
Reduce places removed 1087 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 1090 rules applied. Total rules applied 2177 place count 2819 transition count 2816
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 2180 place count 2816 transition count 2816
Performed 797 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 797 Pre rules applied. Total rules applied 2180 place count 2816 transition count 2019
Deduced a syphon composed of 797 places in 5 ms
Reduce places removed 797 places and 0 transitions.
Iterating global reduction 3 with 1594 rules applied. Total rules applied 3774 place count 2019 transition count 2019
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 3776 place count 2017 transition count 2017
Iterating global reduction 3 with 2 rules applied. Total rules applied 3778 place count 2017 transition count 2017
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 3778 place count 2017 transition count 2016
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3780 place count 2016 transition count 2016
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 1 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 3 with 1802 rules applied. Total rules applied 5582 place count 1115 transition count 1115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5583 place count 1115 transition count 1114
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5585 place count 1114 transition count 1113
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5787 place count 1013 transition count 1210
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5989 place count 912 transition count 1310
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: -94
Deduced a syphon composed of 94 places in 1 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 4 with 188 rules applied. Total rules applied 6177 place count 818 transition count 1404
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6178 place count 818 transition count 1403
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 6179 place count 818 transition count 1403
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6180 place count 817 transition count 1402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6181 place count 816 transition count 1402
Applied a total of 6181 rules in 1122 ms. Remains 816 /3906 variables (removed 3090) and now considering 1402/3906 (removed 2504) transitions.
Finished structural reductions, in 1 iterations. Remains : 816/3906 places, 1402/3906 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 102187 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102187 steps, saw 65577 distinct states, run finished after 3002 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1402 rows 816 cols
[2022-05-20 22:10:17] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 22:10:17] [INFO ] [Real]Absence check using 400 positive place invariants in 60 ms returned sat
[2022-05-20 22:10:17] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-20 22:10:18] [INFO ] [Nat]Absence check using 400 positive place invariants in 53 ms returned sat
[2022-05-20 22:10:18] [INFO ] After 673ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-20 22:10:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 22:10:19] [INFO ] After 297ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-20 22:10:19] [INFO ] After 784ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 288 ms.
[2022-05-20 22:10:19] [INFO ] After 2061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 1 properties in 892 ms.
Support contains 10 out of 816 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 816/816 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 816 transition count 1401
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 815 transition count 1401
Applied a total of 2 rules in 33 ms. Remains 815 /816 variables (removed 1) and now considering 1401/1402 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 815/816 places, 1401/1402 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 107695 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107695 steps, saw 68927 distinct states, run finished after 3002 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1401 rows 815 cols
[2022-05-20 22:10:24] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-20 22:10:24] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 22:10:24] [INFO ] [Nat]Absence check using 400 positive place invariants in 52 ms returned sat
[2022-05-20 22:10:25] [INFO ] After 661ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-20 22:10:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 22:10:25] [INFO ] After 253ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-20 22:10:26] [INFO ] After 685ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 269 ms.
[2022-05-20 22:10:26] [INFO ] After 1906ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 984 ms.
Support contains 10 out of 815 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 815/815 places, 1401/1401 transitions.
Applied a total of 0 rules in 24 ms. Remains 815 /815 variables (removed 0) and now considering 1401/1401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 815/815 places, 1401/1401 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 815/815 places, 1401/1401 transitions.
Applied a total of 0 rules in 24 ms. Remains 815 /815 variables (removed 0) and now considering 1401/1401 (removed 0) transitions.
// Phase 1: matrix 1401 rows 815 cols
[2022-05-20 22:10:27] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 22:10:28] [INFO ] Implicit Places using invariants in 501 ms returned []
// Phase 1: matrix 1401 rows 815 cols
[2022-05-20 22:10:28] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 22:10:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 22:10:29] [INFO ] Implicit Places using invariants and state equation in 1084 ms returned []
Implicit Place search using SMT with State Equation took 1588 ms to find 0 implicit places.
[2022-05-20 22:10:29] [INFO ] Redundant transitions in 86 ms returned []
// Phase 1: matrix 1401 rows 815 cols
[2022-05-20 22:10:29] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-20 22:10:29] [INFO ] Dead Transitions using invariants and state equation in 549 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 815/815 places, 1401/1401 transitions.
Graph (trivial) has 390 edges and 815 vertex of which 4 / 815 are part of one of the 2 SCC in 10 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2800 edges and 813 vertex of which 811 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 387 edges and 809 vertex of which 4 / 809 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 807 transition count 1392
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 386 edges and 805 vertex of which 6 / 805 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 802 transition count 1383
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 384 edges and 799 vertex of which 8 / 799 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 795 transition count 1372
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 380 edges and 791 vertex of which 8 / 791 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 787 transition count 1358
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 376 edges and 783 vertex of which 8 / 783 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 779 transition count 1344
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 372 edges and 775 vertex of which 8 / 775 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 771 transition count 1330
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 368 edges and 767 vertex of which 8 / 767 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 763 transition count 1316
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 364 edges and 759 vertex of which 6 / 759 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 756 transition count 1302
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 361 edges and 753 vertex of which 6 / 753 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 144 place count 750 transition count 1292
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 358 edges and 747 vertex of which 6 / 747 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 160 place count 744 transition count 1280
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 356 edges and 741 vertex of which 8 / 741 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 15 rules applied. Total rules applied 175 place count 737 transition count 1269
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 353 edges and 733 vertex of which 10 / 733 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Iterating post reduction 11 with 20 rules applied. Total rules applied 195 place count 728 transition count 1254
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (trivial) has 347 edges and 723 vertex of which 8 / 723 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 24 rules applied. Total rules applied 219 place count 719 transition count 1236
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 343 edges and 715 vertex of which 8 / 715 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 238 place count 711 transition count 1222
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 339 edges and 707 vertex of which 8 / 707 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 257 place count 703 transition count 1208
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 335 edges and 699 vertex of which 8 / 699 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 276 place count 695 transition count 1194
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 331 edges and 691 vertex of which 8 / 691 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 295 place count 687 transition count 1180
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 327 edges and 683 vertex of which 8 / 683 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 314 place count 679 transition count 1166
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 323 edges and 675 vertex of which 8 / 675 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 333 place count 671 transition count 1152
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 319 edges and 667 vertex of which 8 / 667 are part of one of the 4 SCC in 2 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 352 place count 663 transition count 1138
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 315 edges and 659 vertex of which 8 / 659 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 371 place count 655 transition count 1124
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 311 edges and 651 vertex of which 8 / 651 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 390 place count 647 transition count 1110
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 307 edges and 643 vertex of which 8 / 643 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 409 place count 639 transition count 1096
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 303 edges and 635 vertex of which 8 / 635 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 428 place count 631 transition count 1082
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 299 edges and 627 vertex of which 8 / 627 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 447 place count 623 transition count 1068
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 295 edges and 619 vertex of which 8 / 619 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 466 place count 615 transition count 1054
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 291 edges and 611 vertex of which 8 / 611 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 485 place count 607 transition count 1040
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 287 edges and 603 vertex of which 8 / 603 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 504 place count 599 transition count 1026
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 283 edges and 595 vertex of which 8 / 595 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 523 place count 591 transition count 1012
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 279 edges and 587 vertex of which 8 / 587 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 542 place count 583 transition count 998
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 275 edges and 579 vertex of which 8 / 579 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 561 place count 575 transition count 984
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 271 edges and 571 vertex of which 8 / 571 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 580 place count 567 transition count 970
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 267 edges and 563 vertex of which 8 / 563 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 599 place count 559 transition count 956
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 263 edges and 555 vertex of which 8 / 555 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 618 place count 551 transition count 942
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 259 edges and 547 vertex of which 8 / 547 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 637 place count 543 transition count 928
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 255 edges and 539 vertex of which 8 / 539 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 656 place count 535 transition count 914
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 251 edges and 531 vertex of which 8 / 531 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 675 place count 527 transition count 900
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 247 edges and 523 vertex of which 6 / 523 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 694 place count 520 transition count 886
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 244 edges and 517 vertex of which 6 / 517 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 38 with 14 rules applied. Total rules applied 708 place count 514 transition count 876
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 241 edges and 511 vertex of which 6 / 511 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 39 with 16 rules applied. Total rules applied 724 place count 508 transition count 864
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 239 edges and 505 vertex of which 8 / 505 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 15 rules applied. Total rules applied 739 place count 501 transition count 853
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 236 edges and 497 vertex of which 10 / 497 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 41 with 20 rules applied. Total rules applied 759 place count 492 transition count 838
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (trivial) has 230 edges and 487 vertex of which 8 / 487 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 42 with 24 rules applied. Total rules applied 783 place count 483 transition count 820
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 226 edges and 479 vertex of which 8 / 479 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 43 with 19 rules applied. Total rules applied 802 place count 475 transition count 806
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 222 edges and 471 vertex of which 8 / 471 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 44 with 19 rules applied. Total rules applied 821 place count 467 transition count 792
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 218 edges and 463 vertex of which 8 / 463 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 45 with 19 rules applied. Total rules applied 840 place count 459 transition count 778
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 214 edges and 455 vertex of which 8 / 455 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 46 with 19 rules applied. Total rules applied 859 place count 451 transition count 764
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 210 edges and 447 vertex of which 8 / 447 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 47 with 19 rules applied. Total rules applied 878 place count 443 transition count 750
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 206 edges and 439 vertex of which 6 / 439 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 48 with 19 rules applied. Total rules applied 897 place count 436 transition count 736
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 202 edges and 433 vertex of which 4 / 433 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 49 with 14 rules applied. Total rules applied 911 place count 431 transition count 726
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 199 edges and 429 vertex of which 2 / 429 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 50 with 9 rules applied. Total rules applied 920 place count 428 transition count 720
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 51 with 5 rules applied. Total rules applied 925 place count 427 transition count 716
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 52 with 3 Pre rules applied. Total rules applied 925 place count 427 transition count 713
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 52 with 7 rules applied. Total rules applied 932 place count 423 transition count 713
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 52 with 9 rules applied. Total rules applied 941 place count 417 transition count 710
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 52 with 5 rules applied. Total rules applied 946 place count 417 transition count 705
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 53 with 4 rules applied. Total rules applied 950 place count 417 transition count 701
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 53 with 1 rules applied. Total rules applied 951 place count 417 transition count 701
Applied a total of 951 rules in 291 ms. Remains 417 /815 variables (removed 398) and now considering 701/1401 (removed 700) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 701 rows 417 cols
[2022-05-20 22:10:30] [INFO ] Computed 202 place invariants in 13 ms
[2022-05-20 22:10:30] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 22:10:30] [INFO ] [Nat]Absence check using 202 positive place invariants in 38 ms returned sat
[2022-05-20 22:10:30] [INFO ] After 305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-20 22:10:31] [INFO ] After 530ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 131 ms.
[2022-05-20 22:10:31] [INFO ] After 834ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2022-05-20 22:10:31] [INFO ] Flatten gal took : 29 ms
[2022-05-20 22:10:31] [INFO ] Flatten gal took : 26 ms
[2022-05-20 22:10:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2862503220551706419.gal : 11 ms
[2022-05-20 22:10:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8035938197556256485.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms1211716368706811321;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2862503220551706419.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8035938197556256485.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality8035938197556256485.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :24 after 51
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :51 after 102
Reachability property AtomicPropp6 is true.
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :102 after 187
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :187 after 636
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :636 after 19583
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :19583 after 6.7109e+07
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :6.7109e+07 after 2.04509e+14
Reachability property AtomicPropp9 is true.
Reachability property AtomicPropp7 is true.
Reachability property AtomicPropp2 is true.
Reachability property AtomicPropp1 is true.
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.04509e+14 after 3.1281e+25
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3.1281e+25 after 1.53127e+39
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6.94197e+62,0.32854,11504,2,633,19,30931,7,0,2375,32609,0
Total reachable state count : 6.941972351198837990341276238913822442896e+62
Verifying 6 reachability properties.
Reachability property AtomicPropp1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp1,1.38351e+19,0.329891,11768,2,483,19,30931,8,0,2385,32609,0
Reachability property AtomicPropp2 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp2,1.38351e+19,0.330308,11768,2,483,19,30931,9,0,2385,32609,0
Reachability property AtomicPropp6 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp6,1.34218e+08,0.330816,11768,2,445,19,30931,10,0,2390,32609,0
Reachability property AtomicPropp7 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp7,1.02003e+24,0.331396,11768,2,500,19,30931,11,0,2395,32609,0
Reachability property AtomicPropp9 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp9,9.8956e+12,0.331887,11768,2,462,19,30931,12,0,2398,32609,0
Reachability property AtomicPropp11 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp11,3.53087e+57,0.332255,11768,2,613,19,30931,12,0,2400,32609,0
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
FORMULA ShieldRVt-PT-100B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1198 stabilizing places and 1198 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 3906 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3906/3906 places, 3906/3906 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1096 transitions
Trivial Post-agglo rules discarded 1096 transitions
Performed 1096 trivial Post agglomeration. Transition count delta: 1096
Iterating post reduction 0 with 1096 rules applied. Total rules applied 1096 place count 3905 transition count 2809
Reduce places removed 1096 places and 0 transitions.
Iterating post reduction 1 with 1096 rules applied. Total rules applied 2192 place count 2809 transition count 2809
Performed 798 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 798 Pre rules applied. Total rules applied 2192 place count 2809 transition count 2011
Deduced a syphon composed of 798 places in 5 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 2 with 1596 rules applied. Total rules applied 3788 place count 2011 transition count 2011
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 3793 place count 2006 transition count 2006
Iterating global reduction 2 with 5 rules applied. Total rules applied 3798 place count 2006 transition count 2006
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 3798 place count 2006 transition count 2002
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 3806 place count 2002 transition count 2002
Performed 898 Post agglomeration using F-continuation condition.Transition count delta: 898
Deduced a syphon composed of 898 places in 1 ms
Reduce places removed 898 places and 0 transitions.
Iterating global reduction 2 with 1796 rules applied. Total rules applied 5602 place count 1104 transition count 1104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5603 place count 1104 transition count 1103
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5605 place count 1103 transition count 1102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5807 place count 1002 transition count 1202
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 6009 place count 901 transition count 1303
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 6203 place count 804 transition count 1400
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6205 place count 802 transition count 1398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6206 place count 801 transition count 1398
Applied a total of 6206 rules in 610 ms. Remains 801 /3906 variables (removed 3105) and now considering 1398/3906 (removed 2508) transitions.
// Phase 1: matrix 1398 rows 801 cols
[2022-05-20 22:10:32] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-20 22:10:32] [INFO ] Implicit Places using invariants in 430 ms returned []
// Phase 1: matrix 1398 rows 801 cols
[2022-05-20 22:10:32] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 22:10:33] [INFO ] Implicit Places using invariants and state equation in 974 ms returned []
Implicit Place search using SMT with State Equation took 1408 ms to find 0 implicit places.
[2022-05-20 22:10:33] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 1398 rows 801 cols
[2022-05-20 22:10:33] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 22:10:34] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 801/3906 places, 1398/3906 transitions.
Finished structural reductions, in 1 iterations. Remains : 801/3906 places, 1398/3906 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s619 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA ShieldRVt-PT-100B-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLCardinality-00 finished in 2796 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(p1 U p2)))'
Support contains 5 out of 3906 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3906/3906 places, 3906/3906 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1091 transitions
Trivial Post-agglo rules discarded 1091 transitions
Performed 1091 trivial Post agglomeration. Transition count delta: 1091
Iterating post reduction 0 with 1091 rules applied. Total rules applied 1091 place count 3905 transition count 2814
Reduce places removed 1091 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1093 rules applied. Total rules applied 2184 place count 2814 transition count 2812
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2186 place count 2812 transition count 2812
Performed 798 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 798 Pre rules applied. Total rules applied 2186 place count 2812 transition count 2014
Deduced a syphon composed of 798 places in 5 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 3 with 1596 rules applied. Total rules applied 3782 place count 2014 transition count 2014
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 3787 place count 2009 transition count 2009
Iterating global reduction 3 with 5 rules applied. Total rules applied 3792 place count 2009 transition count 2009
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 3792 place count 2009 transition count 2005
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 3800 place count 2005 transition count 2005
Performed 895 Post agglomeration using F-continuation condition.Transition count delta: 895
Deduced a syphon composed of 895 places in 0 ms
Reduce places removed 895 places and 0 transitions.
Iterating global reduction 3 with 1790 rules applied. Total rules applied 5590 place count 1110 transition count 1110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5591 place count 1110 transition count 1109
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5593 place count 1109 transition count 1108
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5795 place count 1008 transition count 1208
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5997 place count 907 transition count 1308
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 6189 place count 811 transition count 1404
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 6190 place count 811 transition count 1404
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 6192 place count 809 transition count 1402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6193 place count 808 transition count 1402
Applied a total of 6193 rules in 643 ms. Remains 808 /3906 variables (removed 3098) and now considering 1402/3906 (removed 2504) transitions.
// Phase 1: matrix 1402 rows 808 cols
[2022-05-20 22:10:35] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-20 22:10:35] [INFO ] Implicit Places using invariants in 451 ms returned []
// Phase 1: matrix 1402 rows 808 cols
[2022-05-20 22:10:35] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 22:10:36] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-20 22:10:36] [INFO ] Implicit Places using invariants and state equation in 1130 ms returned []
Implicit Place search using SMT with State Equation took 1583 ms to find 0 implicit places.
[2022-05-20 22:10:36] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 1402 rows 808 cols
[2022-05-20 22:10:36] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 22:10:37] [INFO ] Dead Transitions using invariants and state equation in 570 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 808/3906 places, 1402/3906 transitions.
Finished structural reductions, in 1 iterations. Remains : 808/3906 places, 1402/3906 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLCardinality-01 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=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(EQ s169 1), p1:(OR (EQ s126 0) (EQ s744 1)), p0:(AND (OR (EQ s503 0) (EQ s405 1)) (OR (EQ s126 0) (EQ s744 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 14636 reset in 1125 ms.
Product exploration explored 100000 steps with 14992 reset in 1230 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/808 stabilizing places and 2/1402 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1))))]
Knowledge based reduction with 13 factoid took 552 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1402 rows 808 cols
[2022-05-20 22:10:41] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-20 22:10:41] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2022-05-20 22:10:41] [INFO ] [Nat]Absence check using 400 positive place invariants in 56 ms returned sat
[2022-05-20 22:10:42] [INFO ] After 561ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2022-05-20 22:10:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-20 22:10:42] [INFO ] After 178ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2022-05-20 22:10:42] [INFO ] After 454ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 168 ms.
[2022-05-20 22:10:42] [INFO ] After 1421ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 833 ms.
Support contains 5 out of 808 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 808/808 places, 1402/1402 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 808 transition count 1401
Applied a total of 1 rules in 34 ms. Remains 808 /808 variables (removed 0) and now considering 1401/1402 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 808/808 places, 1401/1402 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 131539 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{1=1, 3=1}
Probabilistic random walk after 131539 steps, saw 85643 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :2
Running SMT prover for 2 properties.
// Phase 1: matrix 1401 rows 808 cols
[2022-05-20 22:10:47] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-20 22:10:47] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 22:10:47] [INFO ] [Nat]Absence check using 400 positive place invariants in 55 ms returned sat
[2022-05-20 22:10:48] [INFO ] After 466ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 22:10:48] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-20 22:10:48] [INFO ] After 88ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 22:10:48] [INFO ] After 229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 89 ms.
[2022-05-20 22:10:48] [INFO ] After 974ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 426 ms.
Support contains 3 out of 808 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 808/808 places, 1401/1401 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 808 transition count 1399
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 806 transition count 1399
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 805 transition count 1401
Applied a total of 6 rules in 36 ms. Remains 805 /808 variables (removed 3) and now considering 1401/1401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 805/808 places, 1401/1401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Finished probabilistic random walk after 59569 steps, run visited all 2 properties in 1392 ms. (steps per millisecond=42 )
Probabilistic random walk after 59569 steps, saw 36996 distinct states, run finished after 1392 ms. (steps per millisecond=42 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p2) p0)))]
False Knowledge obtained : [(X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (AND p1 (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT (AND p1 (NOT p2) p0))), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 14 factoid took 790 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 116 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), true, (NOT p2)]
Stuttering acceptance computed with spot in 94 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), true, (NOT p2)]
Support contains 5 out of 808 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 808/808 places, 1402/1402 transitions.
Applied a total of 0 rules in 18 ms. Remains 808 /808 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 808 cols
[2022-05-20 22:10:51] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-20 22:10:52] [INFO ] Implicit Places using invariants in 447 ms returned []
// Phase 1: matrix 1402 rows 808 cols
[2022-05-20 22:10:52] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 22:10:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-20 22:10:53] [INFO ] Implicit Places using invariants and state equation in 1111 ms returned []
Implicit Place search using SMT with State Equation took 1562 ms to find 0 implicit places.
[2022-05-20 22:10:53] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 1402 rows 808 cols
[2022-05-20 22:10:53] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-20 22:10:53] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 808/808 places, 1402/1402 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/808 stabilizing places and 2/1402 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 7 factoid took 406 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 81 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1402 rows 808 cols
[2022-05-20 22:10:54] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 22:10:54] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 22:10:54] [INFO ] [Nat]Absence check using 400 positive place invariants in 53 ms returned sat
[2022-05-20 22:10:55] [INFO ] After 462ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 22:10:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-20 22:10:55] [INFO ] After 90ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 22:10:55] [INFO ] After 232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 87 ms.
[2022-05-20 22:10:55] [INFO ] After 973ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 255 ms.
Support contains 5 out of 808 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 808/808 places, 1402/1402 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 808 transition count 1401
Applied a total of 1 rules in 20 ms. Remains 808 /808 variables (removed 0) and now considering 1401/1402 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 808/808 places, 1401/1402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 166590 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{1=1}
Probabilistic random walk after 166590 steps, saw 109510 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 1401 rows 808 cols
[2022-05-20 22:10:59] [INFO ] Computed 400 place invariants in 4 ms
[2022-05-20 22:10:59] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 22:10:59] [INFO ] [Nat]Absence check using 400 positive place invariants in 49 ms returned sat
[2022-05-20 22:10:59] [INFO ] After 394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 22:10:59] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-20 22:11:00] [INFO ] After 48ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 22:11:00] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2022-05-20 22:11:00] [INFO ] After 707ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 117 ms.
Support contains 3 out of 808 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 808/808 places, 1401/1401 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 808 transition count 1399
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 806 transition count 1399
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 805 transition count 1401
Applied a total of 6 rules in 34 ms. Remains 805 /808 variables (removed 3) and now considering 1401/1401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 805/808 places, 1401/1401 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Finished probabilistic random walk after 59569 steps, run visited all 1 properties in 1113 ms. (steps per millisecond=53 )
Probabilistic random walk after 59569 steps, saw 36996 distinct states, run finished after 1114 ms. (steps per millisecond=53 ) properties seen :1
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (NOT (AND (NOT p2) p1))), (F (NOT (AND p0 (NOT p2) p1))), (F (AND (NOT p0) (NOT p2) p1)), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 7 factoid took 420 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 88 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), true, (NOT p2)]
Stuttering acceptance computed with spot in 85 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), true, (NOT p2)]
Stuttering acceptance computed with spot in 87 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), true, (NOT p2)]
Product exploration explored 100000 steps with 14710 reset in 978 ms.
Product exploration explored 100000 steps with 14509 reset in 1138 ms.
Built C files in :
/tmp/ltsmin9353606324978741807
[2022-05-20 22:11:04] [INFO ] Computing symmetric may disable matrix : 1402 transitions.
[2022-05-20 22:11:04] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 22:11:04] [INFO ] Computing symmetric may enable matrix : 1402 transitions.
[2022-05-20 22:11:04] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 22:11:04] [INFO ] Computing Do-Not-Accords matrix : 1402 transitions.
[2022-05-20 22:11:04] [INFO ] Computation of Completed DNA matrix. took 71 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 22:11:04] [INFO ] Built C files in 316ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9353606324978741807
Running compilation step : cd /tmp/ltsmin9353606324978741807;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9353606324978741807;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9353606324978741807;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 5 out of 808 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 808/808 places, 1402/1402 transitions.
Applied a total of 0 rules in 19 ms. Remains 808 /808 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
// Phase 1: matrix 1402 rows 808 cols
[2022-05-20 22:11:07] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-20 22:11:08] [INFO ] Implicit Places using invariants in 439 ms returned []
// Phase 1: matrix 1402 rows 808 cols
[2022-05-20 22:11:08] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-20 22:11:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-20 22:11:09] [INFO ] Implicit Places using invariants and state equation in 1101 ms returned []
Implicit Place search using SMT with State Equation took 1544 ms to find 0 implicit places.
[2022-05-20 22:11:09] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 1402 rows 808 cols
[2022-05-20 22:11:09] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 22:11:09] [INFO ] Dead Transitions using invariants and state equation in 564 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 808/808 places, 1402/1402 transitions.
Built C files in :
/tmp/ltsmin4440030006042778371
[2022-05-20 22:11:09] [INFO ] Computing symmetric may disable matrix : 1402 transitions.
[2022-05-20 22:11:09] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 22:11:09] [INFO ] Computing symmetric may enable matrix : 1402 transitions.
[2022-05-20 22:11:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 22:11:10] [INFO ] Computing Do-Not-Accords matrix : 1402 transitions.
[2022-05-20 22:11:10] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 22:11:10] [INFO ] Built C files in 237ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4440030006042778371
Running compilation step : cd /tmp/ltsmin4440030006042778371;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4440030006042778371;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4440030006042778371;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 22:11:13] [INFO ] Flatten gal took : 62 ms
[2022-05-20 22:11:13] [INFO ] Flatten gal took : 63 ms
[2022-05-20 22:11:13] [INFO ] Time to serialize gal into /tmp/LTL5172691998073473398.gal : 9 ms
[2022-05-20 22:11:13] [INFO ] Time to serialize properties into /tmp/LTL4141457952957331836.ltl : 264 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5172691998073473398.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4141457952957331836.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5172691...266
Read 1 LTL properties
Checking formula 0 : !(((G("(((p3134==0)||(p2536==1))&&((p858==0)||(p4604==1)))"))||(("((p858==0)||(p4604==1))")U("(p1109==1)"))))
Formula 0 simplified : !(G"(((p3134==0)||(p2536==1))&&((p858==0)||(p4604==1)))" | ("((p858==0)||(p4604==1))" U "(p1109==1)"))
Reverse transition relation is NOT exact ! Due to transitions t5, t908, t910, t912, t914, t916, t918, t920, t922, t923, t926, t927, t930, t931, t934, t935,...1229
Computing Next relation with stutter on 4.28324e+77 deadlock states
Detected timeout of ITS tools.
[2022-05-20 22:11:28] [INFO ] Flatten gal took : 57 ms
[2022-05-20 22:11:28] [INFO ] Applying decomposition
[2022-05-20 22:11:28] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17509040265442010782.txt' '-o' '/tmp/graph17509040265442010782.bin' '-w' '/tmp/graph17509040265442010782.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17509040265442010782.bin' '-l' '-1' '-v' '-w' '/tmp/graph17509040265442010782.weights' '-q' '0' '-e' '0.001'
[2022-05-20 22:11:29] [INFO ] Decomposing Gal with order
[2022-05-20 22:11:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 22:11:29] [INFO ] Removed a total of 2771 redundant transitions.
[2022-05-20 22:11:29] [INFO ] Flatten gal took : 167 ms
[2022-05-20 22:11:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 1260 labels/synchronizations in 36 ms.
[2022-05-20 22:11:29] [INFO ] Time to serialize gal into /tmp/LTL14854929361290983979.gal : 9 ms
[2022-05-20 22:11:29] [INFO ] Time to serialize properties into /tmp/LTL16161519625038960695.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14854929361290983979.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16161519625038960695.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1485492...247
Read 1 LTL properties
Checking formula 0 : !(((G("(((i12.u247.p3134==0)||(i9.u198.p2536==1))&&((i3.u62.p858==0)||(i18.i0.i1.u367.p4604==1)))"))||(("((i3.u62.p858==0)||(i18.i0.i1...198
Formula 0 simplified : !(G"(((i12.u247.p3134==0)||(i9.u198.p2536==1))&&((i3.u62.p858==0)||(i18.i0.i1.u367.p4604==1)))" | ("((i3.u62.p858==0)||(i18.i0.i1.u3...193
Reverse transition relation is NOT exact ! Due to transitions t41_t35_t39, t50_t42_t47, t83_t78_t81, t92_t85_t91, t129_t124_t126, t138_t130_t135, t166_t160...1545
Computing Next relation with stutter on 4.28324e+77 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17970791994343292537
[2022-05-20 22:11:44] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17970791994343292537
Running compilation step : cd /tmp/ltsmin17970791994343292537;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2661 ms.
Running link step : cd /tmp/ltsmin17970791994343292537;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin17970791994343292537;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||((LTLAPp1==true) U (LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVt-PT-100B-LTLCardinality-01 finished in 85129 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 3906 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3906/3906 places, 3906/3906 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3901 transition count 3901
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3901 transition count 3901
Applied a total of 10 rules in 547 ms. Remains 3901 /3906 variables (removed 5) and now considering 3901/3906 (removed 5) transitions.
// Phase 1: matrix 3901 rows 3901 cols
[2022-05-20 22:12:00] [INFO ] Computed 401 place invariants in 14 ms
[2022-05-20 22:12:01] [INFO ] Implicit Places using invariants in 900 ms returned []
// Phase 1: matrix 3901 rows 3901 cols
[2022-05-20 22:12:01] [INFO ] Computed 401 place invariants in 12 ms
[2022-05-20 22:12:02] [INFO ] Implicit Places using invariants and state equation in 1452 ms returned []
Implicit Place search using SMT with State Equation took 2354 ms to find 0 implicit places.
// Phase 1: matrix 3901 rows 3901 cols
[2022-05-20 22:12:02] [INFO ] Computed 401 place invariants in 11 ms
[2022-05-20 22:12:04] [INFO ] Dead Transitions using invariants and state equation in 2248 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3901/3906 places, 3901/3906 transitions.
Finished structural reductions, in 1 iterations. Remains : 3901/3906 places, 3901/3906 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s3854 0) (EQ s2622 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][false, false]]
Product exploration explored 100000 steps with 143 reset in 492 ms.
Product exploration explored 100000 steps with 142 reset in 589 ms.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 567 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=141 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
// Phase 1: matrix 3901 rows 3901 cols
[2022-05-20 22:12:06] [INFO ] Computed 401 place invariants in 15 ms
[2022-05-20 22:12:09] [INFO ] [Real]Absence check using 401 positive place invariants in 913 ms returned sat
[2022-05-20 22:12:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:12:21] [INFO ] [Real]Absence check using state equation in 12163 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 3901 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3901/3901 places, 3901/3901 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1098 transitions
Trivial Post-agglo rules discarded 1098 transitions
Performed 1098 trivial Post agglomeration. Transition count delta: 1098
Iterating post reduction 0 with 1098 rules applied. Total rules applied 1098 place count 3900 transition count 2802
Reduce places removed 1098 places and 0 transitions.
Iterating post reduction 1 with 1098 rules applied. Total rules applied 2196 place count 2802 transition count 2802
Performed 798 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 798 Pre rules applied. Total rules applied 2196 place count 2802 transition count 2004
Deduced a syphon composed of 798 places in 5 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 2 with 1596 rules applied. Total rules applied 3792 place count 2004 transition count 2004
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 0 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 2 with 1798 rules applied. Total rules applied 5590 place count 1105 transition count 1105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5591 place count 1105 transition count 1104
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5593 place count 1104 transition count 1103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5795 place count 1003 transition count 1203
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5997 place count 902 transition count 1304
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 6189 place count 806 transition count 1399
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6191 place count 804 transition count 1397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6192 place count 803 transition count 1397
Applied a total of 6192 rules in 543 ms. Remains 803 /3901 variables (removed 3098) and now considering 1397/3901 (removed 2504) transitions.
// Phase 1: matrix 1397 rows 803 cols
[2022-05-20 22:12:22] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 22:12:22] [INFO ] Implicit Places using invariants in 457 ms returned []
// Phase 1: matrix 1397 rows 803 cols
[2022-05-20 22:12:22] [INFO ] Computed 400 place invariants in 1 ms
[2022-05-20 22:12:23] [INFO ] Implicit Places using invariants and state equation in 1115 ms returned []
Implicit Place search using SMT with State Equation took 1576 ms to find 0 implicit places.
[2022-05-20 22:12:23] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 1397 rows 803 cols
[2022-05-20 22:12:23] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 22:12:24] [INFO ] Dead Transitions using invariants and state equation in 540 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 803/3901 places, 1397/3901 transitions.
Finished structural reductions, in 1 iterations. Remains : 803/3901 places, 1397/3901 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 122 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 107 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
// Phase 1: matrix 1397 rows 803 cols
[2022-05-20 22:12:24] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-20 22:12:25] [INFO ] [Real]Absence check using 400 positive place invariants in 192 ms returned sat
[2022-05-20 22:12:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 22:12:26] [INFO ] [Real]Absence check using state equation in 1225 ms returned sat
[2022-05-20 22:12:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 22:12:27] [INFO ] [Nat]Absence check using 400 positive place invariants in 190 ms returned sat
[2022-05-20 22:12:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 22:12:29] [INFO ] [Nat]Absence check using state equation in 1215 ms returned sat
[2022-05-20 22:12:29] [INFO ] Computed and/alt/rep : 1392/4350/1392 causal constraints (skipped 0 transitions) in 77 ms.
[2022-05-20 22:12:42] [INFO ] Deduced a trap composed of 2 places in 432 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-20 22:12:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-100B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLCardinality-06 finished in 42718 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U F(G(!F(p0))))))'
Support contains 2 out of 3906 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3906/3906 places, 3906/3906 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1095 transitions
Trivial Post-agglo rules discarded 1095 transitions
Performed 1095 trivial Post agglomeration. Transition count delta: 1095
Iterating post reduction 0 with 1095 rules applied. Total rules applied 1095 place count 3905 transition count 2810
Reduce places removed 1095 places and 0 transitions.
Iterating post reduction 1 with 1095 rules applied. Total rules applied 2190 place count 2810 transition count 2810
Performed 798 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 798 Pre rules applied. Total rules applied 2190 place count 2810 transition count 2012
Deduced a syphon composed of 798 places in 5 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 2 with 1596 rules applied. Total rules applied 3786 place count 2012 transition count 2012
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 3791 place count 2007 transition count 2007
Iterating global reduction 2 with 5 rules applied. Total rules applied 3796 place count 2007 transition count 2007
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 3796 place count 2007 transition count 2003
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 3804 place count 2003 transition count 2003
Performed 897 Post agglomeration using F-continuation condition.Transition count delta: 897
Deduced a syphon composed of 897 places in 0 ms
Reduce places removed 897 places and 0 transitions.
Iterating global reduction 2 with 1794 rules applied. Total rules applied 5598 place count 1106 transition count 1106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5599 place count 1106 transition count 1105
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5601 place count 1105 transition count 1104
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5803 place count 1004 transition count 1204
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 6005 place count 903 transition count 1305
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 6197 place count 807 transition count 1400
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6199 place count 805 transition count 1398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6200 place count 804 transition count 1398
Applied a total of 6200 rules in 616 ms. Remains 804 /3906 variables (removed 3102) and now considering 1398/3906 (removed 2508) transitions.
// Phase 1: matrix 1398 rows 804 cols
[2022-05-20 22:12:43] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 22:12:43] [INFO ] Implicit Places using invariants in 431 ms returned []
// Phase 1: matrix 1398 rows 804 cols
[2022-05-20 22:12:43] [INFO ] Computed 400 place invariants in 2 ms
[2022-05-20 22:12:43] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-20 22:12:44] [INFO ] Implicit Places using invariants and state equation in 1198 ms returned []
Implicit Place search using SMT with State Equation took 1637 ms to find 0 implicit places.
[2022-05-20 22:12:44] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 1398 rows 804 cols
[2022-05-20 22:12:44] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-20 22:12:45] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 804/3906 places, 1398/3906 transitions.
Finished structural reductions, in 1 iterations. Remains : 804/3906 places, 1398/3906 transitions.
Stuttering acceptance computed with spot in 40 ms :[p0]
Running random walk in product with property : ShieldRVt-PT-100B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s619 0) (EQ s577 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-100B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLCardinality-08 finished in 2930 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 3906 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3906/3906 places, 3906/3906 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 3903 transition count 3903
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 3903 transition count 3903
Applied a total of 6 rules in 571 ms. Remains 3903 /3906 variables (removed 3) and now considering 3903/3906 (removed 3) transitions.
// Phase 1: matrix 3903 rows 3903 cols
[2022-05-20 22:12:45] [INFO ] Computed 401 place invariants in 16 ms
[2022-05-20 22:12:46] [INFO ] Implicit Places using invariants in 892 ms returned []
// Phase 1: matrix 3903 rows 3903 cols
[2022-05-20 22:12:46] [INFO ] Computed 401 place invariants in 11 ms
[2022-05-20 22:12:48] [INFO ] Implicit Places using invariants and state equation in 1436 ms returned []
Implicit Place search using SMT with State Equation took 2332 ms to find 0 implicit places.
// Phase 1: matrix 3903 rows 3903 cols
[2022-05-20 22:12:48] [INFO ] Computed 401 place invariants in 10 ms
[2022-05-20 22:12:50] [INFO ] Dead Transitions using invariants and state equation in 2065 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3903/3906 places, 3903/3906 transitions.
Finished structural reductions, in 1 iterations. Remains : 3903/3906 places, 3903/3906 transitions.
Stuttering acceptance computed with spot in 280 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100B-LTLCardinality-11 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 (EQ s355 0) (EQ s702 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2619 ms.
Product exploration explored 100000 steps with 50000 reset in 2658 ms.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-100B-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-100B-LTLCardinality-11 finished in 10709 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(((F(p2)||p1)&&p0)))))'
Support contains 4 out of 3906 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3906/3906 places, 3906/3906 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1093 transitions
Trivial Post-agglo rules discarded 1093 transitions
Performed 1093 trivial Post agglomeration. Transition count delta: 1093
Iterating post reduction 0 with 1093 rules applied. Total rules applied 1093 place count 3905 transition count 2812
Reduce places removed 1093 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1094 rules applied. Total rules applied 2187 place count 2812 transition count 2811
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2188 place count 2811 transition count 2811
Performed 798 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 798 Pre rules applied. Total rules applied 2188 place count 2811 transition count 2013
Deduced a syphon composed of 798 places in 5 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 3 with 1596 rules applied. Total rules applied 3784 place count 2013 transition count 2013
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 3789 place count 2008 transition count 2008
Iterating global reduction 3 with 5 rules applied. Total rules applied 3794 place count 2008 transition count 2008
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 3794 place count 2008 transition count 2004
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 3802 place count 2004 transition count 2004
Performed 896 Post agglomeration using F-continuation condition.Transition count delta: 896
Deduced a syphon composed of 896 places in 0 ms
Reduce places removed 896 places and 0 transitions.
Iterating global reduction 3 with 1792 rules applied. Total rules applied 5594 place count 1108 transition count 1108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5595 place count 1108 transition count 1107
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5597 place count 1107 transition count 1106
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5799 place count 1006 transition count 1204
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -102
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 6001 place count 905 transition count 1306
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -94
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 6191 place count 810 transition count 1400
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 6193 place count 808 transition count 1398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6194 place count 807 transition count 1398
Applied a total of 6194 rules in 559 ms. Remains 807 /3906 variables (removed 3099) and now considering 1398/3906 (removed 2508) transitions.
// Phase 1: matrix 1398 rows 807 cols
[2022-05-20 22:12:56] [INFO ] Computed 400 place invariants in 3 ms
[2022-05-20 22:12:57] [INFO ] Implicit Places using invariants in 446 ms returned []
// Phase 1: matrix 1398 rows 807 cols
[2022-05-20 22:12:57] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-20 22:12:57] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-20 22:12:58] [INFO ] Implicit Places using invariants and state equation in 1237 ms returned []
Implicit Place search using SMT with State Equation took 1701 ms to find 0 implicit places.
[2022-05-20 22:12:58] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 1398 rows 807 cols
[2022-05-20 22:12:58] [INFO ] Computed 400 place invariants in 5 ms
[2022-05-20 22:12:58] [INFO ] Dead Transitions using invariants and state equation in 556 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 807/3906 places, 1398/3906 transitions.
Finished structural reductions, in 1 iterations. Remains : 807/3906 places, 1398/3906 transitions.
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-100B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s85 0) (EQ s159 1)), p1:(OR (EQ s638 0) (EQ s215 1)), p2:(OR (EQ s159 0) (EQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-100B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-100B-LTLCardinality-12 finished in 2951 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(p1 U p2)))'
[2022-05-20 22:12:59] [INFO ] Flatten gal took : 86 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9139427246369747096
[2022-05-20 22:12:59] [INFO ] Too many transitions (3906) to apply POR reductions. Disabling POR matrices.
[2022-05-20 22:12:59] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9139427246369747096
Running compilation step : cd /tmp/ltsmin9139427246369747096;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-20 22:12:59] [INFO ] Applying decomposition
[2022-05-20 22:12:59] [INFO ] Flatten gal took : 86 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13608696838940335178.txt' '-o' '/tmp/graph13608696838940335178.bin' '-w' '/tmp/graph13608696838940335178.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13608696838940335178.bin' '-l' '-1' '-v' '-w' '/tmp/graph13608696838940335178.weights' '-q' '0' '-e' '0.001'
[2022-05-20 22:12:59] [INFO ] Decomposing Gal with order
[2022-05-20 22:13:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 22:13:01] [INFO ] Removed a total of 991 redundant transitions.
[2022-05-20 22:13:01] [INFO ] Flatten gal took : 217 ms
[2022-05-20 22:13:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2022-05-20 22:13:01] [INFO ] Time to serialize gal into /tmp/LTLCardinality7471843784539980092.gal : 39 ms
[2022-05-20 22:13:01] [INFO ] Time to serialize properties into /tmp/LTLCardinality16520847699803942687.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7471843784539980092.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16520847699803942687.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...268
Read 1 LTL properties
Checking formula 0 : !(((G("(((i36.u972.p3134==0)||(i31.i1.i3.u788.p2536==1))&&((i17.i0.i2.u276.p858==0)||(i49.i0.i4.u1419.p4604==1)))"))||(("((i17.i0.i2.u...231
Formula 0 simplified : !(G"(((i36.u972.p3134==0)||(i31.i1.i3.u788.p2536==1))&&((i17.i0.i2.u276.p858==0)||(i49.i0.i4.u1419.p4604==1)))" | ("((i17.i0.i2.u276...226
Compilation finished in 10955 ms.
Running link step : cd /tmp/ltsmin9139427246369747096;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin9139427246369747096;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((LTLAPp0==true))||((LTLAPp1==true) U (LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-20 22:34:10] [INFO ] Applying decomposition
[2022-05-20 22:34:10] [INFO ] Flatten gal took : 244 ms
[2022-05-20 22:34:10] [INFO ] Decomposing Gal with order
[2022-05-20 22:34:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 22:34:13] [INFO ] Removed a total of 298 redundant transitions.
[2022-05-20 22:34:13] [INFO ] Flatten gal took : 354 ms
[2022-05-20 22:34:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 23 ms.
[2022-05-20 22:34:14] [INFO ] Time to serialize gal into /tmp/LTLCardinality1964200632149697.gal : 81 ms
[2022-05-20 22:34:14] [INFO ] Time to serialize properties into /tmp/LTLCardinality16321805961860540165.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1964200632149697.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16321805961860540165.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...265
Read 1 LTL properties
Checking formula 0 : !(((G("(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u534.p3...1257
Formula 0 simplified : !(G"(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u534.p31...1252
Detected timeout of ITS tools.
[2022-05-20 22:55:23] [INFO ] Flatten gal took : 247 ms
[2022-05-20 22:55:24] [INFO ] Input system was already deterministic with 3906 transitions.
[2022-05-20 22:55:24] [INFO ] Transformed 3906 places.
[2022-05-20 22:55:24] [INFO ] Transformed 3906 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-20 22:55:26] [INFO ] Time to serialize gal into /tmp/LTLCardinality13549225131329483401.gal : 30 ms
[2022-05-20 22:55:26] [INFO ] Time to serialize properties into /tmp/LTLCardinality9410625322074465543.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13549225131329483401.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9410625322074465543.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G("(((p3134==0)||(p2536==1))&&((p858==0)||(p4604==1)))"))||(("((p858==0)||(p4604==1))")U("(p1109==1)"))))
Formula 0 simplified : !(G"(((p3134==0)||(p2536==1))&&((p858==0)||(p4604==1)))" | ("((p858==0)||(p4604==1))" U "(p1109==1)"))
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="ShieldRVt-PT-100B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVt-PT-100B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286026201051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-100B.tgz
mv ShieldRVt-PT-100B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;