About the Execution of ITS-Tools for ShieldIIPt-PT-040B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16199.684 | 3600000.00 | 8106646.00 | 18488.40 | FFFFFFFFF?FFFFFF | 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-165286025000316.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 ShieldIIPt-PT-040B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025000316
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 932K
-rw-r--r-- 1 mcc users 6.0K Apr 29 18:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 29 18:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 29 18:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 29 18:28 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.8K May 9 08:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:51 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 686K 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 ShieldIIPt-PT-040B-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652963592636
Running Version 202205111006
[2022-05-19 12:33:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-19 12:33:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 12:33:14] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2022-05-19 12:33:14] [INFO ] Transformed 2803 places.
[2022-05-19 12:33:14] [INFO ] Transformed 2603 transitions.
[2022-05-19 12:33:14] [INFO ] Found NUPN structural information;
[2022-05-19 12:33:14] [INFO ] Parsed PT model containing 2803 places and 2603 transitions in 398 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPt-PT-040B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 2803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Discarding 435 places :
Symmetric choice reduction at 0 with 435 rule applications. Total rules 435 place count 2368 transition count 2168
Iterating global reduction 0 with 435 rules applied. Total rules applied 870 place count 2368 transition count 2168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 871 place count 2367 transition count 2167
Iterating global reduction 0 with 1 rules applied. Total rules applied 872 place count 2367 transition count 2167
Applied a total of 872 rules in 978 ms. Remains 2367 /2803 variables (removed 436) and now considering 2167/2603 (removed 436) transitions.
// Phase 1: matrix 2167 rows 2367 cols
[2022-05-19 12:33:15] [INFO ] Computed 361 place invariants in 50 ms
[2022-05-19 12:33:16] [INFO ] Implicit Places using invariants in 888 ms returned []
// Phase 1: matrix 2167 rows 2367 cols
[2022-05-19 12:33:16] [INFO ] Computed 361 place invariants in 11 ms
[2022-05-19 12:33:18] [INFO ] Implicit Places using invariants and state equation in 2163 ms returned []
Implicit Place search using SMT with State Equation took 3078 ms to find 0 implicit places.
// Phase 1: matrix 2167 rows 2367 cols
[2022-05-19 12:33:18] [INFO ] Computed 361 place invariants in 12 ms
[2022-05-19 12:33:19] [INFO ] Dead Transitions using invariants and state equation in 1271 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2367/2803 places, 2167/2603 transitions.
Finished structural reductions, in 1 iterations. Remains : 2367/2803 places, 2167/2603 transitions.
Support contains 47 out of 2367 places after structural reductions.
[2022-05-19 12:33:20] [INFO ] Flatten gal took : 173 ms
[2022-05-19 12:33:20] [INFO ] Flatten gal took : 101 ms
[2022-05-19 12:33:20] [INFO ] Input system was already deterministic with 2167 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 744 ms. (steps per millisecond=13 ) properties (out of 36) seen :18
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
// Phase 1: matrix 2167 rows 2367 cols
[2022-05-19 12:33:21] [INFO ] Computed 361 place invariants in 17 ms
[2022-05-19 12:33:22] [INFO ] [Real]Absence check using 361 positive place invariants in 124 ms returned sat
[2022-05-19 12:33:22] [INFO ] After 1515ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2022-05-19 12:33:23] [INFO ] [Nat]Absence check using 361 positive place invariants in 128 ms returned sat
[2022-05-19 12:33:27] [INFO ] After 2497ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2022-05-19 12:33:27] [INFO ] Deduced a trap composed of 17 places in 527 ms of which 6 ms to minimize.
[2022-05-19 12:33:28] [INFO ] Deduced a trap composed of 20 places in 586 ms of which 3 ms to minimize.
[2022-05-19 12:33:29] [INFO ] Deduced a trap composed of 18 places in 519 ms of which 2 ms to minimize.
[2022-05-19 12:33:29] [INFO ] Deduced a trap composed of 21 places in 498 ms of which 3 ms to minimize.
[2022-05-19 12:33:30] [INFO ] Deduced a trap composed of 20 places in 485 ms of which 2 ms to minimize.
[2022-05-19 12:33:30] [INFO ] Deduced a trap composed of 33 places in 495 ms of which 2 ms to minimize.
[2022-05-19 12:33:31] [INFO ] Deduced a trap composed of 28 places in 469 ms of which 2 ms to minimize.
[2022-05-19 12:33:31] [INFO ] Deduced a trap composed of 25 places in 466 ms of which 1 ms to minimize.
[2022-05-19 12:33:32] [INFO ] Deduced a trap composed of 19 places in 460 ms of which 2 ms to minimize.
[2022-05-19 12:33:32] [INFO ] Deduced a trap composed of 22 places in 455 ms of which 1 ms to minimize.
[2022-05-19 12:33:33] [INFO ] Deduced a trap composed of 17 places in 437 ms of which 3 ms to minimize.
[2022-05-19 12:33:33] [INFO ] Deduced a trap composed of 29 places in 451 ms of which 1 ms to minimize.
[2022-05-19 12:33:34] [INFO ] Deduced a trap composed of 26 places in 428 ms of which 1 ms to minimize.
[2022-05-19 12:33:34] [INFO ] Deduced a trap composed of 16 places in 432 ms of which 1 ms to minimize.
[2022-05-19 12:33:35] [INFO ] Deduced a trap composed of 17 places in 426 ms of which 1 ms to minimize.
[2022-05-19 12:33:35] [INFO ] Deduced a trap composed of 23 places in 403 ms of which 1 ms to minimize.
[2022-05-19 12:33:36] [INFO ] Deduced a trap composed of 21 places in 405 ms of which 1 ms to minimize.
[2022-05-19 12:33:36] [INFO ] Deduced a trap composed of 42 places in 417 ms of which 1 ms to minimize.
[2022-05-19 12:33:37] [INFO ] Deduced a trap composed of 16 places in 405 ms of which 1 ms to minimize.
[2022-05-19 12:33:37] [INFO ] Deduced a trap composed of 34 places in 372 ms of which 1 ms to minimize.
[2022-05-19 12:33:38] [INFO ] Deduced a trap composed of 25 places in 369 ms of which 1 ms to minimize.
[2022-05-19 12:33:38] [INFO ] Deduced a trap composed of 30 places in 379 ms of which 1 ms to minimize.
[2022-05-19 12:33:39] [INFO ] Deduced a trap composed of 21 places in 378 ms of which 1 ms to minimize.
[2022-05-19 12:33:39] [INFO ] Deduced a trap composed of 29 places in 381 ms of which 1 ms to minimize.
[2022-05-19 12:33:40] [INFO ] Deduced a trap composed of 44 places in 390 ms of which 1 ms to minimize.
[2022-05-19 12:33:40] [INFO ] Deduced a trap composed of 29 places in 402 ms of which 1 ms to minimize.
[2022-05-19 12:33:41] [INFO ] Deduced a trap composed of 36 places in 347 ms of which 1 ms to minimize.
[2022-05-19 12:33:41] [INFO ] Deduced a trap composed of 26 places in 349 ms of which 2 ms to minimize.
[2022-05-19 12:33:41] [INFO ] Deduced a trap composed of 28 places in 344 ms of which 1 ms to minimize.
[2022-05-19 12:33:42] [INFO ] Deduced a trap composed of 23 places in 324 ms of which 1 ms to minimize.
[2022-05-19 12:33:42] [INFO ] Deduced a trap composed of 33 places in 328 ms of which 1 ms to minimize.
[2022-05-19 12:33:43] [INFO ] Deduced a trap composed of 40 places in 321 ms of which 1 ms to minimize.
[2022-05-19 12:33:43] [INFO ] Deduced a trap composed of 35 places in 309 ms of which 1 ms to minimize.
[2022-05-19 12:33:43] [INFO ] Deduced a trap composed of 41 places in 302 ms of which 4 ms to minimize.
[2022-05-19 12:33:44] [INFO ] Deduced a trap composed of 38 places in 303 ms of which 1 ms to minimize.
[2022-05-19 12:33:44] [INFO ] Deduced a trap composed of 41 places in 331 ms of which 1 ms to minimize.
[2022-05-19 12:33:45] [INFO ] Deduced a trap composed of 40 places in 306 ms of which 0 ms to minimize.
[2022-05-19 12:33:45] [INFO ] Deduced a trap composed of 41 places in 293 ms of which 1 ms to minimize.
[2022-05-19 12:33:45] [INFO ] Deduced a trap composed of 48 places in 308 ms of which 1 ms to minimize.
[2022-05-19 12:33:46] [INFO ] Deduced a trap composed of 42 places in 279 ms of which 1 ms to minimize.
[2022-05-19 12:33:46] [INFO ] Deduced a trap composed of 49 places in 264 ms of which 1 ms to minimize.
[2022-05-19 12:33:46] [INFO ] Deduced a trap composed of 44 places in 242 ms of which 1 ms to minimize.
[2022-05-19 12:33:47] [INFO ] Deduced a trap composed of 46 places in 251 ms of which 1 ms to minimize.
[2022-05-19 12:33:47] [INFO ] Deduced a trap composed of 48 places in 240 ms of which 0 ms to minimize.
[2022-05-19 12:33:47] [INFO ] Deduced a trap composed of 47 places in 248 ms of which 1 ms to minimize.
[2022-05-19 12:33:49] [INFO ] Deduced a trap composed of 16 places in 1146 ms of which 4 ms to minimize.
[2022-05-19 12:33:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 12:33:49] [INFO ] After 26164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:18
Parikh walk visited 0 properties in 1840 ms.
Support contains 25 out of 2367 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2367/2367 places, 2167/2167 transitions.
Drop transitions removed 466 transitions
Trivial Post-agglo rules discarded 466 transitions
Performed 466 trivial Post agglomeration. Transition count delta: 466
Iterating post reduction 0 with 466 rules applied. Total rules applied 466 place count 2367 transition count 1701
Reduce places removed 466 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 471 rules applied. Total rules applied 937 place count 1901 transition count 1696
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 942 place count 1896 transition count 1696
Performed 311 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 311 Pre rules applied. Total rules applied 942 place count 1896 transition count 1385
Deduced a syphon composed of 311 places in 2 ms
Reduce places removed 311 places and 0 transitions.
Iterating global reduction 3 with 622 rules applied. Total rules applied 1564 place count 1585 transition count 1385
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1565 place count 1584 transition count 1384
Iterating global reduction 3 with 1 rules applied. Total rules applied 1566 place count 1584 transition count 1384
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1566 place count 1584 transition count 1383
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1568 place count 1583 transition count 1383
Performed 676 Post agglomeration using F-continuation condition.Transition count delta: 676
Deduced a syphon composed of 676 places in 3 ms
Reduce places removed 676 places and 0 transitions.
Iterating global reduction 3 with 1352 rules applied. Total rules applied 2920 place count 907 transition count 707
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2921 place count 907 transition count 706
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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2923 place count 906 transition count 705
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -64
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3125 place count 805 transition count 769
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 3149 place count 793 transition count 776
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3150 place count 793 transition count 775
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3151 place count 793 transition count 774
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3152 place count 792 transition count 774
Partial Free-agglomeration rule applied 38 times.
Drop transitions removed 38 transitions
Iterating global reduction 6 with 38 rules applied. Total rules applied 3190 place count 792 transition count 774
Applied a total of 3190 rules in 539 ms. Remains 792 /2367 variables (removed 1575) and now considering 774/2167 (removed 1393) transitions.
Finished structural reductions, in 1 iterations. Remains : 792/2367 places, 774/2167 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 66763 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66763 steps, saw 40937 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 18 properties.
// Phase 1: matrix 774 rows 792 cols
[2022-05-19 12:33:54] [INFO ] Computed 361 place invariants in 4 ms
[2022-05-19 12:33:55] [INFO ] [Real]Absence check using 361 positive place invariants in 47 ms returned sat
[2022-05-19 12:33:55] [INFO ] After 538ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2022-05-19 12:33:55] [INFO ] [Nat]Absence check using 361 positive place invariants in 54 ms returned sat
[2022-05-19 12:33:57] [INFO ] After 992ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2022-05-19 12:33:57] [INFO ] State equation strengthened by 331 read => feed constraints.
[2022-05-19 12:34:02] [INFO ] After 5375ms SMT Verify possible using 331 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2022-05-19 12:34:02] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 0 ms to minimize.
[2022-05-19 12:34:02] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2022-05-19 12:34:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 203 ms
[2022-05-19 12:34:12] [INFO ] After 15836ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 737 ms.
[2022-05-19 12:34:13] [INFO ] After 18165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 18 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 924 ms.
Support contains 25 out of 792 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 792/792 places, 774/774 transitions.
Applied a total of 0 rules in 33 ms. Remains 792 /792 variables (removed 0) and now considering 774/774 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 792/792 places, 774/774 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 792/792 places, 774/774 transitions.
Applied a total of 0 rules in 30 ms. Remains 792 /792 variables (removed 0) and now considering 774/774 (removed 0) transitions.
// Phase 1: matrix 774 rows 792 cols
[2022-05-19 12:34:14] [INFO ] Computed 361 place invariants in 2 ms
[2022-05-19 12:34:15] [INFO ] Implicit Places using invariants in 413 ms returned [784, 785]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 416 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 790/792 places, 774/774 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 790 transition count 773
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 789 transition count 773
Applied a total of 2 rules in 22 ms. Remains 789 /790 variables (removed 1) and now considering 773/774 (removed 1) transitions.
// Phase 1: matrix 773 rows 789 cols
[2022-05-19 12:34:15] [INFO ] Computed 359 place invariants in 2 ms
[2022-05-19 12:34:15] [INFO ] Implicit Places using invariants in 389 ms returned [778]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 391 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 788/792 places, 773/774 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 787 transition count 772
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 787 transition count 772
Applied a total of 2 rules in 29 ms. Remains 787 /788 variables (removed 1) and now considering 772/773 (removed 1) transitions.
// Phase 1: matrix 772 rows 787 cols
[2022-05-19 12:34:15] [INFO ] Computed 358 place invariants in 5 ms
[2022-05-19 12:34:15] [INFO ] Implicit Places using invariants in 408 ms returned []
// Phase 1: matrix 772 rows 787 cols
[2022-05-19 12:34:15] [INFO ] Computed 358 place invariants in 6 ms
[2022-05-19 12:34:16] [INFO ] State equation strengthened by 328 read => feed constraints.
[2022-05-19 12:34:19] [INFO ] Implicit Places using invariants and state equation in 3350 ms returned []
Implicit Place search using SMT with State Equation took 3760 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 787/792 places, 772/774 transitions.
Finished structural reductions, in 3 iterations. Remains : 787/792 places, 772/774 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 536 ms. (steps per millisecond=18 ) properties (out of 18) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 772 rows 787 cols
[2022-05-19 12:34:20] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:34:20] [INFO ] [Real]Absence check using 358 positive place invariants in 55 ms returned sat
[2022-05-19 12:34:20] [INFO ] After 439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-19 12:34:20] [INFO ] [Nat]Absence check using 358 positive place invariants in 53 ms returned sat
[2022-05-19 12:34:21] [INFO ] After 896ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-05-19 12:34:21] [INFO ] State equation strengthened by 328 read => feed constraints.
[2022-05-19 12:34:27] [INFO ] After 5682ms SMT Verify possible using 328 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2022-05-19 12:34:27] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2022-05-19 12:34:27] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2022-05-19 12:34:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 225 ms
[2022-05-19 12:34:32] [INFO ] After 10489ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 6683 ms.
[2022-05-19 12:34:39] [INFO ] After 18579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 0 properties in 768 ms.
Support contains 22 out of 787 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 787/787 places, 772/772 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 787 transition count 771
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 786 transition count 771
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 786 transition count 770
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 785 transition count 770
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 2 with 2 rules applied. Total rules applied 6 place count 784 transition count 769
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 2 with 2 rules applied. Total rules applied 8 place count 783 transition count 770
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 783 transition count 770
Applied a total of 9 rules in 63 ms. Remains 783 /787 variables (removed 4) and now considering 770/772 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 783/787 places, 770/772 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 92546 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92546 steps, saw 58418 distinct states, run finished after 3002 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 770 rows 783 cols
[2022-05-19 12:34:43] [INFO ] Computed 358 place invariants in 5 ms
[2022-05-19 12:34:43] [INFO ] [Real]Absence check using 358 positive place invariants in 52 ms returned sat
[2022-05-19 12:34:43] [INFO ] After 449ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-19 12:34:44] [INFO ] [Nat]Absence check using 358 positive place invariants in 53 ms returned sat
[2022-05-19 12:34:45] [INFO ] After 919ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-05-19 12:34:45] [INFO ] State equation strengthened by 331 read => feed constraints.
[2022-05-19 12:34:55] [INFO ] After 10157ms SMT Verify possible using 331 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2022-05-19 12:34:55] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2022-05-19 12:34:55] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2022-05-19 12:34:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 199 ms
[2022-05-19 12:34:56] [INFO ] After 11432ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 570 ms.
[2022-05-19 12:34:57] [INFO ] After 13444ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 1 properties in 538 ms.
Support contains 20 out of 783 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 783/783 places, 770/770 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 783 transition count 769
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 782 transition count 769
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 780 transition count 767
Applied a total of 6 rules in 30 ms. Remains 780 /783 variables (removed 3) and now considering 767/770 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 780/783 places, 767/770 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 102811 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102811 steps, saw 64613 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 767 rows 780 cols
[2022-05-19 12:35:02] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:35:02] [INFO ] [Real]Absence check using 358 positive place invariants in 53 ms returned sat
[2022-05-19 12:35:02] [INFO ] After 407ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-05-19 12:35:03] [INFO ] [Nat]Absence check using 358 positive place invariants in 51 ms returned sat
[2022-05-19 12:35:03] [INFO ] After 807ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2022-05-19 12:35:04] [INFO ] State equation strengthened by 331 read => feed constraints.
[2022-05-19 12:35:12] [INFO ] After 8850ms SMT Verify possible using 331 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2022-05-19 12:35:12] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2022-05-19 12:35:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-19 12:35:22] [INFO ] After 18904ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 694 ms.
[2022-05-19 12:35:23] [INFO ] After 20851ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 584 ms.
Support contains 19 out of 780 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 780/780 places, 767/767 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 780 transition count 766
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 779 transition count 766
Applied a total of 2 rules in 22 ms. Remains 779 /780 variables (removed 1) and now considering 766/767 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 779/780 places, 766/767 transitions.
FORMULA ShieldIIPt-PT-040B-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 640 stabilizing places and 640 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(G((X(!(G(p0) U F(X(p1))))&&F(p2)))))))'
Support contains 2 out of 2367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2367/2367 places, 2167/2167 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2361 transition count 2161
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2361 transition count 2161
Applied a total of 12 rules in 274 ms. Remains 2361 /2367 variables (removed 6) and now considering 2161/2167 (removed 6) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:35:24] [INFO ] Computed 361 place invariants in 16 ms
[2022-05-19 12:35:25] [INFO ] Implicit Places using invariants in 643 ms returned []
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:35:25] [INFO ] Computed 361 place invariants in 7 ms
[2022-05-19 12:35:27] [INFO ] Implicit Places using invariants and state equation in 2221 ms returned []
Implicit Place search using SMT with State Equation took 2865 ms to find 0 implicit places.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:35:27] [INFO ] Computed 361 place invariants in 11 ms
[2022-05-19 12:35:28] [INFO ] Dead Transitions using invariants and state equation in 1196 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2367 places, 2161/2167 transitions.
Finished structural reductions, in 1 iterations. Remains : 2361/2367 places, 2161/2167 transitions.
Stuttering acceptance computed with spot in 386 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (NOT p2), p1, p1, true]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s1722 0), p1:(EQ s858 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16616 reset in 447 ms.
Product exploration explored 100000 steps with 16572 reset in 387 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Detected a total of 638/2361 stabilizing places and 638/2161 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1)), true, (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 187 ms. Reduced automaton from 7 states, 9 edges and 2 AP to 7 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (NOT p2), p1, p1, true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:35:30] [INFO ] Computed 361 place invariants in 16 ms
[2022-05-19 12:35:30] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:35:31] [INFO ] [Nat]Absence check using 361 positive place invariants in 123 ms returned sat
[2022-05-19 12:35:32] [INFO ] After 1088ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:35:33] [INFO ] Deduced a trap composed of 19 places in 493 ms of which 1 ms to minimize.
[2022-05-19 12:35:33] [INFO ] Deduced a trap composed of 17 places in 521 ms of which 1 ms to minimize.
[2022-05-19 12:35:34] [INFO ] Deduced a trap composed of 18 places in 515 ms of which 2 ms to minimize.
[2022-05-19 12:35:34] [INFO ] Deduced a trap composed of 18 places in 494 ms of which 1 ms to minimize.
[2022-05-19 12:35:35] [INFO ] Deduced a trap composed of 16 places in 501 ms of which 2 ms to minimize.
[2022-05-19 12:35:35] [INFO ] Deduced a trap composed of 20 places in 490 ms of which 3 ms to minimize.
[2022-05-19 12:35:36] [INFO ] Deduced a trap composed of 18 places in 475 ms of which 2 ms to minimize.
[2022-05-19 12:35:37] [INFO ] Deduced a trap composed of 18 places in 470 ms of which 2 ms to minimize.
[2022-05-19 12:35:37] [INFO ] Deduced a trap composed of 23 places in 467 ms of which 1 ms to minimize.
[2022-05-19 12:35:38] [INFO ] Deduced a trap composed of 22 places in 455 ms of which 1 ms to minimize.
[2022-05-19 12:35:38] [INFO ] Deduced a trap composed of 28 places in 458 ms of which 1 ms to minimize.
[2022-05-19 12:35:39] [INFO ] Deduced a trap composed of 43 places in 461 ms of which 2 ms to minimize.
[2022-05-19 12:35:39] [INFO ] Deduced a trap composed of 23 places in 465 ms of which 1 ms to minimize.
[2022-05-19 12:35:40] [INFO ] Deduced a trap composed of 23 places in 441 ms of which 1 ms to minimize.
[2022-05-19 12:35:40] [INFO ] Deduced a trap composed of 15 places in 438 ms of which 1 ms to minimize.
[2022-05-19 12:35:41] [INFO ] Deduced a trap composed of 16 places in 438 ms of which 1 ms to minimize.
[2022-05-19 12:35:41] [INFO ] Deduced a trap composed of 26 places in 437 ms of which 1 ms to minimize.
[2022-05-19 12:35:42] [INFO ] Deduced a trap composed of 23 places in 433 ms of which 2 ms to minimize.
[2022-05-19 12:35:42] [INFO ] Deduced a trap composed of 26 places in 414 ms of which 2 ms to minimize.
[2022-05-19 12:35:43] [INFO ] Deduced a trap composed of 24 places in 428 ms of which 2 ms to minimize.
[2022-05-19 12:35:43] [INFO ] Deduced a trap composed of 25 places in 409 ms of which 1 ms to minimize.
[2022-05-19 12:35:44] [INFO ] Deduced a trap composed of 21 places in 405 ms of which 1 ms to minimize.
[2022-05-19 12:35:44] [INFO ] Deduced a trap composed of 42 places in 389 ms of which 1 ms to minimize.
[2022-05-19 12:35:45] [INFO ] Deduced a trap composed of 47 places in 394 ms of which 1 ms to minimize.
[2022-05-19 12:35:45] [INFO ] Deduced a trap composed of 45 places in 389 ms of which 1 ms to minimize.
[2022-05-19 12:35:46] [INFO ] Deduced a trap composed of 24 places in 396 ms of which 1 ms to minimize.
[2022-05-19 12:35:46] [INFO ] Deduced a trap composed of 16 places in 366 ms of which 1 ms to minimize.
[2022-05-19 12:35:47] [INFO ] Deduced a trap composed of 17 places in 387 ms of which 1 ms to minimize.
[2022-05-19 12:35:47] [INFO ] Deduced a trap composed of 16 places in 368 ms of which 1 ms to minimize.
[2022-05-19 12:35:48] [INFO ] Deduced a trap composed of 31 places in 360 ms of which 1 ms to minimize.
[2022-05-19 12:35:48] [INFO ] Deduced a trap composed of 50 places in 348 ms of which 1 ms to minimize.
[2022-05-19 12:35:48] [INFO ] Deduced a trap composed of 27 places in 343 ms of which 1 ms to minimize.
[2022-05-19 12:35:49] [INFO ] Deduced a trap composed of 25 places in 343 ms of which 1 ms to minimize.
[2022-05-19 12:35:49] [INFO ] Deduced a trap composed of 22 places in 337 ms of which 1 ms to minimize.
[2022-05-19 12:35:50] [INFO ] Deduced a trap composed of 23 places in 323 ms of which 1 ms to minimize.
[2022-05-19 12:35:50] [INFO ] Deduced a trap composed of 28 places in 318 ms of which 1 ms to minimize.
[2022-05-19 12:35:50] [INFO ] Deduced a trap composed of 29 places in 323 ms of which 1 ms to minimize.
[2022-05-19 12:35:51] [INFO ] Deduced a trap composed of 29 places in 328 ms of which 1 ms to minimize.
[2022-05-19 12:35:51] [INFO ] Deduced a trap composed of 33 places in 319 ms of which 1 ms to minimize.
[2022-05-19 12:35:52] [INFO ] Deduced a trap composed of 29 places in 317 ms of which 1 ms to minimize.
[2022-05-19 12:35:52] [INFO ] Deduced a trap composed of 32 places in 314 ms of which 1 ms to minimize.
[2022-05-19 12:35:52] [INFO ] Deduced a trap composed of 31 places in 305 ms of which 1 ms to minimize.
[2022-05-19 12:35:53] [INFO ] Deduced a trap composed of 32 places in 296 ms of which 1 ms to minimize.
[2022-05-19 12:35:53] [INFO ] Deduced a trap composed of 33 places in 288 ms of which 1 ms to minimize.
[2022-05-19 12:35:54] [INFO ] Deduced a trap composed of 30 places in 305 ms of which 1 ms to minimize.
[2022-05-19 12:35:54] [INFO ] Deduced a trap composed of 22 places in 286 ms of which 0 ms to minimize.
[2022-05-19 12:35:54] [INFO ] Deduced a trap composed of 22 places in 284 ms of which 1 ms to minimize.
[2022-05-19 12:35:55] [INFO ] Deduced a trap composed of 44 places in 276 ms of which 0 ms to minimize.
[2022-05-19 12:35:55] [INFO ] Deduced a trap composed of 51 places in 263 ms of which 0 ms to minimize.
[2022-05-19 12:35:55] [INFO ] Deduced a trap composed of 46 places in 259 ms of which 1 ms to minimize.
[2022-05-19 12:35:56] [INFO ] Deduced a trap composed of 44 places in 248 ms of which 1 ms to minimize.
[2022-05-19 12:35:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 12:35:56] [INFO ] After 25105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 2361 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Drop transitions removed 477 transitions
Trivial Post-agglo rules discarded 477 transitions
Performed 477 trivial Post agglomeration. Transition count delta: 477
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2361 transition count 1684
Reduce places removed 477 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 478 rules applied. Total rules applied 955 place count 1884 transition count 1683
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 956 place count 1883 transition count 1683
Performed 321 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 321 Pre rules applied. Total rules applied 956 place count 1883 transition count 1362
Deduced a syphon composed of 321 places in 2 ms
Reduce places removed 321 places and 0 transitions.
Iterating global reduction 3 with 642 rules applied. Total rules applied 1598 place count 1562 transition count 1362
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 1 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 3 with 1360 rules applied. Total rules applied 2958 place count 882 transition count 682
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2959 place count 882 transition count 681
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 2961 place count 881 transition count 680
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 3163 place count 780 transition count 746
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 3197 place count 763 transition count 757
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3198 place count 763 transition count 756
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3238 place count 763 transition count 756
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3239 place count 762 transition count 755
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3241 place count 760 transition count 755
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3241 place count 760 transition count 754
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3243 place count 759 transition count 754
Applied a total of 3243 rules in 381 ms. Remains 759 /2361 variables (removed 1602) and now considering 754/2161 (removed 1407) transitions.
Finished structural reductions, in 1 iterations. Remains : 759/2361 places, 754/2161 transitions.
Finished random walk after 476 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=95 )
Knowledge obtained : [(AND p2 (NOT p1)), true, (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F p1)]
Knowledge based reduction with 4 factoid took 316 ms. Reduced automaton from 7 states, 9 edges and 2 AP to 7 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (NOT p2), p1, p1, true]
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (NOT p2), p1, p1, true]
Support contains 2 out of 2361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Applied a total of 0 rules in 112 ms. Remains 2361 /2361 variables (removed 0) and now considering 2161/2161 (removed 0) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:35:57] [INFO ] Computed 361 place invariants in 13 ms
[2022-05-19 12:35:58] [INFO ] Implicit Places using invariants in 652 ms returned []
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:35:58] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:36:00] [INFO ] Implicit Places using invariants and state equation in 2092 ms returned []
Implicit Place search using SMT with State Equation took 2756 ms to find 0 implicit places.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:36:00] [INFO ] Computed 361 place invariants in 8 ms
[2022-05-19 12:36:01] [INFO ] Dead Transitions using invariants and state equation in 1218 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2361/2361 places, 2161/2161 transitions.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Detected a total of 638/2361 stabilizing places and 638/2161 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1)), true, (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 292 ms. Reduced automaton from 7 states, 9 edges and 2 AP to 7 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (NOT p2), p1, p1, true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:36:02] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:36:02] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:36:02] [INFO ] [Nat]Absence check using 361 positive place invariants in 114 ms returned sat
[2022-05-19 12:36:03] [INFO ] After 1077ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:36:04] [INFO ] Deduced a trap composed of 19 places in 534 ms of which 1 ms to minimize.
[2022-05-19 12:36:05] [INFO ] Deduced a trap composed of 17 places in 525 ms of which 1 ms to minimize.
[2022-05-19 12:36:05] [INFO ] Deduced a trap composed of 18 places in 530 ms of which 1 ms to minimize.
[2022-05-19 12:36:06] [INFO ] Deduced a trap composed of 18 places in 494 ms of which 1 ms to minimize.
[2022-05-19 12:36:06] [INFO ] Deduced a trap composed of 16 places in 496 ms of which 2 ms to minimize.
[2022-05-19 12:36:07] [INFO ] Deduced a trap composed of 20 places in 482 ms of which 1 ms to minimize.
[2022-05-19 12:36:08] [INFO ] Deduced a trap composed of 18 places in 473 ms of which 1 ms to minimize.
[2022-05-19 12:36:08] [INFO ] Deduced a trap composed of 18 places in 479 ms of which 1 ms to minimize.
[2022-05-19 12:36:09] [INFO ] Deduced a trap composed of 23 places in 498 ms of which 1 ms to minimize.
[2022-05-19 12:36:09] [INFO ] Deduced a trap composed of 22 places in 468 ms of which 1 ms to minimize.
[2022-05-19 12:36:10] [INFO ] Deduced a trap composed of 28 places in 489 ms of which 1 ms to minimize.
[2022-05-19 12:36:10] [INFO ] Deduced a trap composed of 43 places in 519 ms of which 6 ms to minimize.
[2022-05-19 12:36:11] [INFO ] Deduced a trap composed of 23 places in 448 ms of which 1 ms to minimize.
[2022-05-19 12:36:11] [INFO ] Deduced a trap composed of 23 places in 442 ms of which 2 ms to minimize.
[2022-05-19 12:36:12] [INFO ] Deduced a trap composed of 15 places in 427 ms of which 1 ms to minimize.
[2022-05-19 12:36:12] [INFO ] Deduced a trap composed of 16 places in 456 ms of which 1 ms to minimize.
[2022-05-19 12:36:13] [INFO ] Deduced a trap composed of 26 places in 428 ms of which 2 ms to minimize.
[2022-05-19 12:36:14] [INFO ] Deduced a trap composed of 23 places in 453 ms of which 1 ms to minimize.
[2022-05-19 12:36:14] [INFO ] Deduced a trap composed of 26 places in 416 ms of which 1 ms to minimize.
[2022-05-19 12:36:15] [INFO ] Deduced a trap composed of 24 places in 441 ms of which 36 ms to minimize.
[2022-05-19 12:36:15] [INFO ] Deduced a trap composed of 25 places in 415 ms of which 1 ms to minimize.
[2022-05-19 12:36:16] [INFO ] Deduced a trap composed of 21 places in 418 ms of which 1 ms to minimize.
[2022-05-19 12:36:16] [INFO ] Deduced a trap composed of 42 places in 401 ms of which 1 ms to minimize.
[2022-05-19 12:36:16] [INFO ] Deduced a trap composed of 47 places in 412 ms of which 1 ms to minimize.
[2022-05-19 12:36:17] [INFO ] Deduced a trap composed of 45 places in 401 ms of which 1 ms to minimize.
[2022-05-19 12:36:17] [INFO ] Deduced a trap composed of 24 places in 382 ms of which 1 ms to minimize.
[2022-05-19 12:36:18] [INFO ] Deduced a trap composed of 16 places in 370 ms of which 1 ms to minimize.
[2022-05-19 12:36:18] [INFO ] Deduced a trap composed of 17 places in 371 ms of which 1 ms to minimize.
[2022-05-19 12:36:19] [INFO ] Deduced a trap composed of 16 places in 396 ms of which 1 ms to minimize.
[2022-05-19 12:36:19] [INFO ] Deduced a trap composed of 31 places in 355 ms of which 1 ms to minimize.
[2022-05-19 12:36:20] [INFO ] Deduced a trap composed of 50 places in 354 ms of which 1 ms to minimize.
[2022-05-19 12:36:20] [INFO ] Deduced a trap composed of 27 places in 352 ms of which 1 ms to minimize.
[2022-05-19 12:36:20] [INFO ] Deduced a trap composed of 25 places in 337 ms of which 1 ms to minimize.
[2022-05-19 12:36:21] [INFO ] Deduced a trap composed of 22 places in 336 ms of which 1 ms to minimize.
[2022-05-19 12:36:21] [INFO ] Deduced a trap composed of 23 places in 337 ms of which 1 ms to minimize.
[2022-05-19 12:36:22] [INFO ] Deduced a trap composed of 28 places in 331 ms of which 1 ms to minimize.
[2022-05-19 12:36:22] [INFO ] Deduced a trap composed of 29 places in 324 ms of which 1 ms to minimize.
[2022-05-19 12:36:23] [INFO ] Deduced a trap composed of 29 places in 349 ms of which 1 ms to minimize.
[2022-05-19 12:36:23] [INFO ] Deduced a trap composed of 33 places in 329 ms of which 1 ms to minimize.
[2022-05-19 12:36:23] [INFO ] Deduced a trap composed of 29 places in 320 ms of which 0 ms to minimize.
[2022-05-19 12:36:24] [INFO ] Deduced a trap composed of 32 places in 328 ms of which 1 ms to minimize.
[2022-05-19 12:36:24] [INFO ] Deduced a trap composed of 31 places in 373 ms of which 2 ms to minimize.
[2022-05-19 12:36:25] [INFO ] Deduced a trap composed of 32 places in 333 ms of which 1 ms to minimize.
[2022-05-19 12:36:25] [INFO ] Deduced a trap composed of 33 places in 284 ms of which 1 ms to minimize.
[2022-05-19 12:36:25] [INFO ] Deduced a trap composed of 30 places in 279 ms of which 1 ms to minimize.
[2022-05-19 12:36:26] [INFO ] Deduced a trap composed of 22 places in 301 ms of which 0 ms to minimize.
[2022-05-19 12:36:26] [INFO ] Deduced a trap composed of 22 places in 285 ms of which 1 ms to minimize.
[2022-05-19 12:36:26] [INFO ] Deduced a trap composed of 44 places in 273 ms of which 1 ms to minimize.
[2022-05-19 12:36:27] [INFO ] Deduced a trap composed of 51 places in 262 ms of which 1 ms to minimize.
[2022-05-19 12:36:27] [INFO ] Deduced a trap composed of 46 places in 260 ms of which 0 ms to minimize.
[2022-05-19 12:36:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 12:36:27] [INFO ] After 25198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 2361 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Drop transitions removed 477 transitions
Trivial Post-agglo rules discarded 477 transitions
Performed 477 trivial Post agglomeration. Transition count delta: 477
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2361 transition count 1684
Reduce places removed 477 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 478 rules applied. Total rules applied 955 place count 1884 transition count 1683
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 956 place count 1883 transition count 1683
Performed 321 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 321 Pre rules applied. Total rules applied 956 place count 1883 transition count 1362
Deduced a syphon composed of 321 places in 2 ms
Reduce places removed 321 places and 0 transitions.
Iterating global reduction 3 with 642 rules applied. Total rules applied 1598 place count 1562 transition count 1362
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 2 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 3 with 1360 rules applied. Total rules applied 2958 place count 882 transition count 682
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2959 place count 882 transition count 681
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 2961 place count 881 transition count 680
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 3163 place count 780 transition count 746
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 3197 place count 763 transition count 757
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3198 place count 763 transition count 756
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3238 place count 763 transition count 756
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3239 place count 762 transition count 755
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3241 place count 760 transition count 755
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3241 place count 760 transition count 754
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3243 place count 759 transition count 754
Applied a total of 3243 rules in 291 ms. Remains 759 /2361 variables (removed 1602) and now considering 754/2161 (removed 1407) transitions.
Finished structural reductions, in 1 iterations. Remains : 759/2361 places, 754/2161 transitions.
Finished random walk after 1780 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=136 )
Knowledge obtained : [(AND p2 (NOT p1)), true, (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F p1)]
Knowledge based reduction with 4 factoid took 206 ms. Reduced automaton from 7 states, 9 edges and 2 AP to 7 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (NOT p2), p1, p1, true]
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (NOT p2), p1, p1, true]
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (NOT p2), p1, p1, true]
Product exploration explored 100000 steps with 16712 reset in 383 ms.
Product exploration explored 100000 steps with 16579 reset in 375 ms.
Applying partial POR strategy [false, false, false, true, false, true, true]
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (NOT p2), p1, p1, true]
Support contains 2 out of 2361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Performed 478 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 478 rules applied. Total rules applied 478 place count 2361 transition count 2161
Performed 162 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 162 Pre rules applied. Total rules applied 478 place count 2361 transition count 2282
Deduced a syphon composed of 640 places in 3 ms
Iterating global reduction 1 with 162 rules applied. Total rules applied 640 place count 2361 transition count 2282
Performed 797 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1437 places in 2 ms
Iterating global reduction 1 with 797 rules applied. Total rules applied 1437 place count 2361 transition count 2282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1438 place count 2361 transition count 2281
Renaming transitions due to excessive name length > 1024 char.
Discarding 319 places :
Symmetric choice reduction at 2 with 319 rule applications. Total rules 1757 place count 2042 transition count 1962
Deduced a syphon composed of 1118 places in 2 ms
Iterating global reduction 2 with 319 rules applied. Total rules applied 2076 place count 2042 transition count 1962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1119 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2077 place count 2042 transition count 1962
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2079 place count 2040 transition count 1960
Deduced a syphon composed of 1117 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2081 place count 2040 transition count 1960
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -530
Deduced a syphon composed of 1218 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2182 place count 2040 transition count 2490
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2283 place count 1939 transition count 2288
Deduced a syphon composed of 1117 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2384 place count 1939 transition count 2288
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -300
Deduced a syphon composed of 1174 places in 3 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2441 place count 1939 transition count 2588
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 2498 place count 1882 transition count 2474
Deduced a syphon composed of 1117 places in 2 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2555 place count 1882 transition count 2474
Deduced a syphon composed of 1117 places in 2 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 2564 place count 1882 transition count 2465
Deduced a syphon composed of 1117 places in 2 ms
Applied a total of 2564 rules in 1680 ms. Remains 1882 /2361 variables (removed 479) and now considering 2465/2161 (removed -304) transitions.
[2022-05-19 12:36:32] [INFO ] Redundant transitions in 253 ms returned []
// Phase 1: matrix 2465 rows 1882 cols
[2022-05-19 12:36:32] [INFO ] Computed 361 place invariants in 16 ms
[2022-05-19 12:36:33] [INFO ] Dead Transitions using invariants and state equation in 1178 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1882/2361 places, 2465/2161 transitions.
Finished structural reductions, in 1 iterations. Remains : 1882/2361 places, 2465/2161 transitions.
Product exploration explored 100000 steps with 16620 reset in 2208 ms.
Product exploration explored 100000 steps with 16684 reset in 2184 ms.
Built C files in :
/tmp/ltsmin1762314276829748689
[2022-05-19 12:36:37] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1762314276829748689
Running compilation step : cd /tmp/ltsmin1762314276829748689;'/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/ltsmin1762314276829748689;'/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/ltsmin1762314276829748689;'/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 2 out of 2361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Applied a total of 0 rules in 140 ms. Remains 2361 /2361 variables (removed 0) and now considering 2161/2161 (removed 0) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:36:40] [INFO ] Computed 361 place invariants in 6 ms
[2022-05-19 12:36:41] [INFO ] Implicit Places using invariants in 783 ms returned []
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:36:41] [INFO ] Computed 361 place invariants in 9 ms
[2022-05-19 12:36:43] [INFO ] Implicit Places using invariants and state equation in 2153 ms returned []
Implicit Place search using SMT with State Equation took 2943 ms to find 0 implicit places.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:36:43] [INFO ] Computed 361 place invariants in 7 ms
[2022-05-19 12:36:44] [INFO ] Dead Transitions using invariants and state equation in 1213 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2361/2361 places, 2161/2161 transitions.
Built C files in :
/tmp/ltsmin3918606311305386838
[2022-05-19 12:36:45] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3918606311305386838
Running compilation step : cd /tmp/ltsmin3918606311305386838;'/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/ltsmin3918606311305386838;'/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/ltsmin3918606311305386838;'/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-19 12:36:48] [INFO ] Flatten gal took : 73 ms
[2022-05-19 12:36:48] [INFO ] Flatten gal took : 162 ms
[2022-05-19 12:36:48] [INFO ] Time to serialize gal into /tmp/LTL3932437289904795242.gal : 19 ms
[2022-05-19 12:36:48] [INFO ] Time to serialize properties into /tmp/LTL1673587876530364554.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/LTL3932437289904795242.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1673587876530364554.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/LTL3932437...266
Read 1 LTL properties
Checking formula 0 : !((X(X(G(G((X(!((G("(p2039==1)"))U(F(X("(p1012==1)"))))))&&(F("(p2039==0)"))))))))
Formula 0 simplified : !XXG(X!(G"(p2039==1)" U FX"(p1012==1)") & F"(p2039==0)")
Detected timeout of ITS tools.
[2022-05-19 12:37:03] [INFO ] Flatten gal took : 60 ms
[2022-05-19 12:37:03] [INFO ] Applying decomposition
[2022-05-19 12:37:03] [INFO ] Flatten gal took : 59 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/graph6737112021185143793.txt' '-o' '/tmp/graph6737112021185143793.bin' '-w' '/tmp/graph6737112021185143793.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6737112021185143793.bin' '-l' '-1' '-v' '-w' '/tmp/graph6737112021185143793.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:37:03] [INFO ] Decomposing Gal with order
[2022-05-19 12:37:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:37:04] [INFO ] Removed a total of 401 redundant transitions.
[2022-05-19 12:37:04] [INFO ] Flatten gal took : 162 ms
[2022-05-19 12:37:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2022-05-19 12:37:04] [INFO ] Time to serialize gal into /tmp/LTL2665282248738539224.gal : 24 ms
[2022-05-19 12:37:04] [INFO ] Time to serialize properties into /tmp/LTL2418026694560079359.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/LTL2665282248738539224.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2418026694560079359.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/LTL2665282...245
Read 1 LTL properties
Checking formula 0 : !((X(X(G(G((X(!((G("(i28.i6.u640.p2039==1)"))U(F(X("(i14.i0.u322.p1012==1)"))))))&&(F("(i28.i6.u640.p2039==0)"))))))))
Formula 0 simplified : !XXG(X!(G"(i28.i6.u640.p2039==1)" U FX"(i14.i0.u322.p1012==1)") & F"(i28.i6.u640.p2039==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6591206859736366744
[2022-05-19 12:37:19] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6591206859736366744
Running compilation step : cd /tmp/ltsmin6591206859736366744;'/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/ltsmin6591206859736366744;'/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/ltsmin6591206859736366744;'/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)
Treatment of property ShieldIIPt-PT-040B-LTLFireability-00 finished in 118064 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(F(!(G((G(p1)&&p0)) U X(p2)))))))'
Support contains 4 out of 2367 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2367/2367 places, 2167/2167 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2366 transition count 1687
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1887 transition count 1687
Performed 316 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 316 Pre rules applied. Total rules applied 958 place count 1887 transition count 1371
Deduced a syphon composed of 316 places in 2 ms
Reduce places removed 316 places and 0 transitions.
Iterating global reduction 2 with 632 rules applied. Total rules applied 1590 place count 1571 transition count 1371
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1593 place count 1568 transition count 1368
Iterating global reduction 2 with 3 rules applied. Total rules applied 1596 place count 1568 transition count 1368
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1596 place count 1568 transition count 1365
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1602 place count 1565 transition count 1365
Performed 677 Post agglomeration using F-continuation condition.Transition count delta: 677
Deduced a syphon composed of 677 places in 1 ms
Reduce places removed 677 places and 0 transitions.
Iterating global reduction 2 with 1354 rules applied. Total rules applied 2956 place count 888 transition count 688
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2957 place count 888 transition count 687
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 2959 place count 887 transition count 686
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 3161 place count 786 transition count 752
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3195 place count 769 transition count 764
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 3196 place count 769 transition count 764
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3198 place count 767 transition count 762
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3200 place count 765 transition count 762
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3200 place count 765 transition count 761
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 3202 place count 764 transition count 761
Applied a total of 3202 rules in 425 ms. Remains 764 /2367 variables (removed 1603) and now considering 761/2167 (removed 1406) transitions.
// Phase 1: matrix 761 rows 764 cols
[2022-05-19 12:37:23] [INFO ] Computed 359 place invariants in 2 ms
[2022-05-19 12:37:23] [INFO ] Implicit Places using invariants in 418 ms returned [753]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 419 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 763/2367 places, 761/2167 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 760
Applied a total of 2 rules in 23 ms. Remains 762 /763 variables (removed 1) and now considering 760/761 (removed 1) transitions.
// Phase 1: matrix 760 rows 762 cols
[2022-05-19 12:37:23] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:37:23] [INFO ] Implicit Places using invariants in 393 ms returned []
// Phase 1: matrix 760 rows 762 cols
[2022-05-19 12:37:23] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:37:24] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-19 12:37:24] [INFO ] Implicit Places using invariants and state equation in 805 ms returned []
Implicit Place search using SMT with State Equation took 1200 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 762/2367 places, 760/2167 transitions.
Finished structural reductions, in 2 iterations. Remains : 762/2367 places, 760/2167 transitions.
Stuttering acceptance computed with spot in 145 ms :[p2, p2, (AND p1 p0 p2), (AND p2 p1 p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND p1 p0 p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0 p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s683 1), p1:(EQ s724 1), p0:(AND (EQ s98 1) (EQ s157 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 33270 reset in 744 ms.
Product exploration explored 100000 steps with 33428 reset in 824 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 p0 p2))), (X (X (NOT p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 224 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 143 ms :[p2, p2, (AND p0 p1 p2), (AND p2 p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 760 rows 762 cols
[2022-05-19 12:37:27] [INFO ] Computed 358 place invariants in 4 ms
[2022-05-19 12:37:27] [INFO ] [Real]Absence check using 358 positive place invariants in 51 ms returned sat
[2022-05-19 12:37:27] [INFO ] After 498ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 12:37:27] [INFO ] [Nat]Absence check using 358 positive place invariants in 50 ms returned sat
[2022-05-19 12:37:27] [INFO ] After 285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 12:37:27] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-19 12:37:28] [INFO ] After 55ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-19 12:37:28] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 56 ms.
[2022-05-19 12:37:28] [INFO ] After 672ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 31 ms.
Support contains 4 out of 762 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 762/762 places, 760/760 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 762 transition count 759
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 762 transition count 759
Applied a total of 2 rules in 25 ms. Remains 762 /762 variables (removed 0) and now considering 759/760 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 762/762 places, 759/760 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 187350 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 187350 steps, saw 117428 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 759 rows 762 cols
[2022-05-19 12:37:31] [INFO ] Computed 358 place invariants in 4 ms
[2022-05-19 12:37:31] [INFO ] [Real]Absence check using 358 positive place invariants in 49 ms returned sat
[2022-05-19 12:37:31] [INFO ] After 293ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-19 12:37:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-19 12:37:32] [INFO ] After 68ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :2
[2022-05-19 12:37:32] [INFO ] After 160ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 60 ms.
[2022-05-19 12:37:32] [INFO ] After 700ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 27 ms.
Support contains 4 out of 762 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 762/762 places, 759/759 transitions.
Applied a total of 0 rules in 12 ms. Remains 762 /762 variables (removed 0) and now considering 759/759 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 762/762 places, 759/759 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 762/762 places, 759/759 transitions.
Applied a total of 0 rules in 12 ms. Remains 762 /762 variables (removed 0) and now considering 759/759 (removed 0) transitions.
// Phase 1: matrix 759 rows 762 cols
[2022-05-19 12:37:32] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:37:32] [INFO ] Implicit Places using invariants in 382 ms returned []
// Phase 1: matrix 759 rows 762 cols
[2022-05-19 12:37:32] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:37:32] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-19 12:37:33] [INFO ] Implicit Places using invariants and state equation in 806 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
[2022-05-19 12:37:33] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 759 rows 762 cols
[2022-05-19 12:37:33] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-19 12:37:33] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 762/762 places, 759/759 transitions.
Partial Free-agglomeration rule applied 82 times.
Drop transitions removed 82 transitions
Iterating global reduction 0 with 82 rules applied. Total rules applied 82 place count 762 transition count 759
Applied a total of 82 rules in 26 ms. Remains 762 /762 variables (removed 0) and now considering 759/759 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 759 rows 762 cols
[2022-05-19 12:37:33] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:37:33] [INFO ] [Real]Absence check using 358 positive place invariants in 50 ms returned sat
[2022-05-19 12:37:34] [INFO ] After 485ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 12:37:34] [INFO ] [Nat]Absence check using 358 positive place invariants in 49 ms returned sat
[2022-05-19 12:37:34] [INFO ] After 292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 12:37:34] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-19 12:37:34] [INFO ] After 59ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-19 12:37:34] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 64 ms.
[2022-05-19 12:37:35] [INFO ] After 695ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-19 12:37:35] [INFO ] Flatten gal took : 28 ms
[2022-05-19 12:37:35] [INFO ] Flatten gal took : 28 ms
[2022-05-19 12:37:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1637739504885354787.gal : 4 ms
[2022-05-19 12:37:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9073813680721152889.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms5187917848473762106;'/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/ReachabilityCardinality1637739504885354787.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9073813680721152889.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/ReachabilityCardinality9073813680721152889.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 87
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :87 after 186
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :186 after 387
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :387 after 710
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :710 after 21219
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :21219 after 1.39267e+07
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.39267e+07 after 3.15412e+13
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3.15412e+13 after 2.90271e+21
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.90271e+21 after 2.72008e+38
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.72008e+38 after 4.48185e+92
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,2.12022e+112,0.969679,28120,2,1551,17,105792,8,0,3815,133311,0
Total reachable state count : 2.120216477734061207635894833974777733831e+112
Verifying 2 reachability properties.
Reachability property apf1 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
apf1,1.56928e+88,0.973362,28384,2,1251,17,105792,8,0,3822,133311,0
Reachability property apf2 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
apf2,6.2771e+88,0.974254,28384,2,1263,17,105792,8,0,3822,133311,0
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 p0 p2))), (X (X (NOT p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 6 factoid took 223 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 148 ms :[p2, p2, (AND p0 p1 p2), (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 149 ms :[p2, p2, (AND p0 p1 p2), (AND p2 p0 p1)]
Support contains 4 out of 762 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 762/762 places, 760/760 transitions.
Applied a total of 0 rules in 20 ms. Remains 762 /762 variables (removed 0) and now considering 760/760 (removed 0) transitions.
// Phase 1: matrix 760 rows 762 cols
[2022-05-19 12:37:36] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-19 12:37:37] [INFO ] Implicit Places using invariants in 398 ms returned []
// Phase 1: matrix 760 rows 762 cols
[2022-05-19 12:37:37] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:37:37] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-19 12:37:37] [INFO ] Implicit Places using invariants and state equation in 838 ms returned []
Implicit Place search using SMT with State Equation took 1238 ms to find 0 implicit places.
[2022-05-19 12:37:37] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 760 rows 762 cols
[2022-05-19 12:37:37] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:37:38] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 762/762 places, 760/760 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 p0 p1))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 218 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 152 ms :[p2, p2, (AND p0 p1 p2), (AND p2 p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 760 rows 762 cols
[2022-05-19 12:37:38] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:37:39] [INFO ] [Real]Absence check using 358 positive place invariants in 56 ms returned sat
[2022-05-19 12:37:39] [INFO ] After 501ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 12:37:39] [INFO ] [Nat]Absence check using 358 positive place invariants in 46 ms returned sat
[2022-05-19 12:37:39] [INFO ] After 286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 12:37:39] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-19 12:37:39] [INFO ] After 55ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-19 12:37:40] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 58 ms.
[2022-05-19 12:37:40] [INFO ] After 670ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 38 ms.
Support contains 4 out of 762 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 762/762 places, 760/760 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 762 transition count 759
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 762 transition count 759
Applied a total of 2 rules in 25 ms. Remains 762 /762 variables (removed 0) and now considering 759/760 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 762/762 places, 759/760 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 162773 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 162773 steps, saw 102114 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 759 rows 762 cols
[2022-05-19 12:37:43] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-19 12:37:43] [INFO ] [Real]Absence check using 358 positive place invariants in 47 ms returned sat
[2022-05-19 12:37:43] [INFO ] After 301ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-19 12:37:43] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-19 12:37:43] [INFO ] After 63ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :2
[2022-05-19 12:37:44] [INFO ] After 158ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 61 ms.
[2022-05-19 12:37:44] [INFO ] After 701ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 30 ms.
Support contains 4 out of 762 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 762/762 places, 759/759 transitions.
Applied a total of 0 rules in 16 ms. Remains 762 /762 variables (removed 0) and now considering 759/759 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 762/762 places, 759/759 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 762/762 places, 759/759 transitions.
Applied a total of 0 rules in 21 ms. Remains 762 /762 variables (removed 0) and now considering 759/759 (removed 0) transitions.
// Phase 1: matrix 759 rows 762 cols
[2022-05-19 12:37:44] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:37:44] [INFO ] Implicit Places using invariants in 384 ms returned []
// Phase 1: matrix 759 rows 762 cols
[2022-05-19 12:37:44] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:37:44] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-19 12:37:45] [INFO ] Implicit Places using invariants and state equation in 815 ms returned []
Implicit Place search using SMT with State Equation took 1199 ms to find 0 implicit places.
[2022-05-19 12:37:45] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 759 rows 762 cols
[2022-05-19 12:37:45] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:37:45] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 762/762 places, 759/759 transitions.
Partial Free-agglomeration rule applied 82 times.
Drop transitions removed 82 transitions
Iterating global reduction 0 with 82 rules applied. Total rules applied 82 place count 762 transition count 759
Applied a total of 82 rules in 22 ms. Remains 762 /762 variables (removed 0) and now considering 759/759 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 759 rows 762 cols
[2022-05-19 12:37:45] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:37:45] [INFO ] [Real]Absence check using 358 positive place invariants in 50 ms returned sat
[2022-05-19 12:37:46] [INFO ] After 483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 12:37:46] [INFO ] [Nat]Absence check using 358 positive place invariants in 49 ms returned sat
[2022-05-19 12:37:46] [INFO ] After 295ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 12:37:46] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-19 12:37:46] [INFO ] After 55ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-19 12:37:46] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 57 ms.
[2022-05-19 12:37:46] [INFO ] After 684ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-19 12:37:47] [INFO ] Flatten gal took : 23 ms
[2022-05-19 12:37:47] [INFO ] Flatten gal took : 23 ms
[2022-05-19 12:37:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18042351529286159486.gal : 3 ms
[2022-05-19 12:37:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3260343224111985088.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3158848670517313198;'/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/ReachabilityCardinality18042351529286159486.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3260343224111985088.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...320
Loading property file /tmp/ReachabilityCardinality3260343224111985088.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 87
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :87 after 186
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :186 after 387
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :387 after 710
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :710 after 21219
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :21219 after 1.39267e+07
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.39267e+07 after 3.15412e+13
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3.15412e+13 after 2.90271e+21
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.90271e+21 after 2.72008e+38
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.72008e+38 after 4.48185e+92
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,2.12022e+112,0.974696,28300,2,1551,17,105792,8,0,3815,133311,0
Total reachable state count : 2.120216477734061207635894833974777733831e+112
Verifying 2 reachability properties.
Reachability property apf1 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
apf1,1.56928e+88,0.97875,28300,2,1251,17,105792,8,0,3822,133311,0
Reachability property apf2 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
apf2,6.2771e+88,0.97971,28300,2,1263,17,105792,8,0,3822,133311,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 p0 p1))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 6 factoid took 260 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 181 ms :[p2, p2, (AND p0 p1 p2), (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 143 ms :[p2, p2, (AND p0 p1 p2), (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 149 ms :[p2, p2, (AND p0 p1 p2), (AND p2 p0 p1)]
Product exploration explored 100000 steps with 33403 reset in 685 ms.
Product exploration explored 100000 steps with 33325 reset in 858 ms.
Built C files in :
/tmp/ltsmin12756545727379386255
[2022-05-19 12:37:50] [INFO ] Computing symmetric may disable matrix : 760 transitions.
[2022-05-19 12:37:50] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:37:50] [INFO ] Computing symmetric may enable matrix : 760 transitions.
[2022-05-19 12:37:50] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:37:50] [INFO ] Computing Do-Not-Accords matrix : 760 transitions.
[2022-05-19 12:37:50] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:37:50] [INFO ] Built C files in 112ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12756545727379386255
Running compilation step : cd /tmp/ltsmin12756545727379386255;'/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 2061 ms.
Running link step : cd /tmp/ltsmin12756545727379386255;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin12756545727379386255;'/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' '--hoa' '/tmp/stateBased5386004501613712134.hoa' '--buchi-type=spotba'
LTSmin run took 4050 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-040B-LTLFireability-01 finished in 34090 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(X((p0 U p1)))||p1) U (!F(p1)||p0)))'
Support contains 2 out of 2367 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2367/2367 places, 2167/2167 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 481 transitions
Trivial Post-agglo rules discarded 481 transitions
Performed 481 trivial Post agglomeration. Transition count delta: 481
Iterating post reduction 0 with 481 rules applied. Total rules applied 481 place count 2366 transition count 1685
Reduce places removed 481 places and 0 transitions.
Iterating post reduction 1 with 481 rules applied. Total rules applied 962 place count 1885 transition count 1685
Performed 316 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 316 Pre rules applied. Total rules applied 962 place count 1885 transition count 1369
Deduced a syphon composed of 316 places in 2 ms
Reduce places removed 316 places and 0 transitions.
Iterating global reduction 2 with 632 rules applied. Total rules applied 1594 place count 1569 transition count 1369
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1597 place count 1566 transition count 1366
Iterating global reduction 2 with 3 rules applied. Total rules applied 1600 place count 1566 transition count 1366
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1600 place count 1566 transition count 1363
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1606 place count 1563 transition count 1363
Performed 678 Post agglomeration using F-continuation condition.Transition count delta: 678
Deduced a syphon composed of 678 places in 1 ms
Reduce places removed 678 places and 0 transitions.
Iterating global reduction 2 with 1356 rules applied. Total rules applied 2962 place count 885 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2963 place count 885 transition count 684
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 2965 place count 884 transition count 683
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 3167 place count 783 transition count 749
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3203 place count 765 transition count 762
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3205 place count 763 transition count 760
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3207 place count 761 transition count 760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3207 place count 761 transition count 759
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 3209 place count 760 transition count 759
Applied a total of 3209 rules in 344 ms. Remains 760 /2367 variables (removed 1607) and now considering 759/2167 (removed 1408) transitions.
// Phase 1: matrix 759 rows 760 cols
[2022-05-19 12:37:57] [INFO ] Computed 359 place invariants in 1 ms
[2022-05-19 12:37:57] [INFO ] Implicit Places using invariants in 364 ms returned [749]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 368 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 759/2367 places, 759/2167 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 758
Applied a total of 2 rules in 23 ms. Remains 758 /759 variables (removed 1) and now considering 758/759 (removed 1) transitions.
// Phase 1: matrix 758 rows 758 cols
[2022-05-19 12:37:57] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:37:57] [INFO ] Implicit Places using invariants in 405 ms returned []
// Phase 1: matrix 758 rows 758 cols
[2022-05-19 12:37:57] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:37:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:37:58] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 758/2367 places, 758/2167 transitions.
Finished structural reductions, in 2 iterations. Remains : 758/2367 places, 758/2167 transitions.
Stuttering acceptance computed with spot in 51 ms :[(AND p1 (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(EQ s5 1), p0:(EQ s399 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 19644 reset in 672 ms.
Product exploration explored 100000 steps with 19404 reset in 757 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/758 stabilizing places and 2/758 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 217 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 28 ms :[(AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 758 rows 758 cols
[2022-05-19 12:38:00] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-19 12:38:00] [INFO ] [Real]Absence check using 358 positive place invariants in 48 ms returned sat
[2022-05-19 12:38:00] [INFO ] After 258ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 12:38:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:38:00] [INFO ] After 40ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-19 12:38:00] [INFO ] After 88ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:38:00] [INFO ] After 505ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:38:01] [INFO ] [Nat]Absence check using 358 positive place invariants in 47 ms returned sat
[2022-05-19 12:38:01] [INFO ] After 268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:38:01] [INFO ] After 32ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:38:01] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-05-19 12:38:01] [INFO ] After 529ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 758 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 758/758 places, 758/758 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 758 transition count 757
Applied a total of 1 rules in 14 ms. Remains 758 /758 variables (removed 0) and now considering 757/758 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 758/758 places, 757/758 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 252193 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 252193 steps, saw 162570 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 757 rows 758 cols
[2022-05-19 12:38:04] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-19 12:38:04] [INFO ] [Real]Absence check using 358 positive place invariants in 46 ms returned sat
[2022-05-19 12:38:05] [INFO ] After 414ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:38:05] [INFO ] [Nat]Absence check using 358 positive place invariants in 47 ms returned sat
[2022-05-19 12:38:05] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:38:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:38:05] [INFO ] After 34ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:38:05] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-05-19 12:38:05] [INFO ] After 523ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 758 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 758/758 places, 757/757 transitions.
Applied a total of 0 rules in 12 ms. Remains 758 /758 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 758/758 places, 757/757 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 758/758 places, 757/757 transitions.
Applied a total of 0 rules in 11 ms. Remains 758 /758 variables (removed 0) and now considering 757/757 (removed 0) transitions.
// Phase 1: matrix 757 rows 758 cols
[2022-05-19 12:38:05] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-19 12:38:05] [INFO ] Implicit Places using invariants in 389 ms returned []
// Phase 1: matrix 757 rows 758 cols
[2022-05-19 12:38:05] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-19 12:38:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:38:06] [INFO ] Implicit Places using invariants and state equation in 768 ms returned []
Implicit Place search using SMT with State Equation took 1158 ms to find 0 implicit places.
[2022-05-19 12:38:06] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 757 rows 758 cols
[2022-05-19 12:38:06] [INFO ] Computed 358 place invariants in 4 ms
[2022-05-19 12:38:07] [INFO ] Dead Transitions using invariants and state equation in 346 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 758/758 places, 757/757 transitions.
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 758 transition count 757
Applied a total of 80 rules in 27 ms. Remains 758 /758 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 757 rows 758 cols
[2022-05-19 12:38:07] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:38:07] [INFO ] [Real]Absence check using 358 positive place invariants in 45 ms returned sat
[2022-05-19 12:38:07] [INFO ] After 394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:38:07] [INFO ] [Nat]Absence check using 358 positive place invariants in 51 ms returned sat
[2022-05-19 12:38:07] [INFO ] After 262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:38:07] [INFO ] After 312ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-05-19 12:38:08] [INFO ] After 510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:38:08] [INFO ] Flatten gal took : 22 ms
[2022-05-19 12:38:08] [INFO ] Flatten gal took : 25 ms
[2022-05-19 12:38:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality22385649531835910.gal : 5 ms
[2022-05-19 12:38:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11458868699517832872.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms13495848388217510542;'/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/ReachabilityCardinality22385649531835910.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11458868699517832872.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...318
Loading property file /tmp/ReachabilityCardinality11458868699517832872.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 30
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :30 after 87
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :87 after 186
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :186 after 283
Reachability property apf1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
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,452,0.285861,10572,2,1760,11,8134,6,0,3791,3309,0
Total reachable state count : 452
Verifying 1 reachability properties.
Reachability property apf1 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
apf1,1,0.287759,10836,2,759,11,8134,7,0,3797,3309,0
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 182 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 26 ms :[(AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 45 ms :[(AND p1 (NOT p0))]
Support contains 2 out of 758 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 758/758 places, 758/758 transitions.
Applied a total of 0 rules in 16 ms. Remains 758 /758 variables (removed 0) and now considering 758/758 (removed 0) transitions.
// Phase 1: matrix 758 rows 758 cols
[2022-05-19 12:38:08] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:38:09] [INFO ] Implicit Places using invariants in 388 ms returned []
// Phase 1: matrix 758 rows 758 cols
[2022-05-19 12:38:09] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:38:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:38:09] [INFO ] Implicit Places using invariants and state equation in 762 ms returned []
Implicit Place search using SMT with State Equation took 1151 ms to find 0 implicit places.
[2022-05-19 12:38:09] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 758 rows 758 cols
[2022-05-19 12:38:09] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:38:10] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 758/758 places, 758/758 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/758 stabilizing places and 2/758 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 227 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 28 ms :[(AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 758 rows 758 cols
[2022-05-19 12:38:10] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-19 12:38:10] [INFO ] [Real]Absence check using 358 positive place invariants in 46 ms returned sat
[2022-05-19 12:38:11] [INFO ] After 263ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 12:38:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:38:11] [INFO ] After 28ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-19 12:38:11] [INFO ] After 78ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:38:11] [INFO ] After 503ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:38:11] [INFO ] [Nat]Absence check using 358 positive place invariants in 49 ms returned sat
[2022-05-19 12:38:11] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:38:11] [INFO ] After 30ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:38:11] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-05-19 12:38:11] [INFO ] After 527ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 758 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 758/758 places, 758/758 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 758 transition count 757
Applied a total of 1 rules in 12 ms. Remains 758 /758 variables (removed 0) and now considering 757/758 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 758/758 places, 757/758 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 247963 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 247963 steps, saw 159756 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 757 rows 758 cols
[2022-05-19 12:38:14] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:38:14] [INFO ] [Real]Absence check using 358 positive place invariants in 49 ms returned sat
[2022-05-19 12:38:15] [INFO ] After 431ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:38:15] [INFO ] [Nat]Absence check using 358 positive place invariants in 48 ms returned sat
[2022-05-19 12:38:15] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:38:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:38:15] [INFO ] After 31ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:38:15] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2022-05-19 12:38:15] [INFO ] After 539ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 758 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 758/758 places, 757/757 transitions.
Applied a total of 0 rules in 12 ms. Remains 758 /758 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 758/758 places, 757/757 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 758/758 places, 757/757 transitions.
Applied a total of 0 rules in 11 ms. Remains 758 /758 variables (removed 0) and now considering 757/757 (removed 0) transitions.
// Phase 1: matrix 757 rows 758 cols
[2022-05-19 12:38:15] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:38:16] [INFO ] Implicit Places using invariants in 366 ms returned []
// Phase 1: matrix 757 rows 758 cols
[2022-05-19 12:38:16] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:38:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:38:16] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 1083 ms to find 0 implicit places.
[2022-05-19 12:38:16] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 757 rows 758 cols
[2022-05-19 12:38:16] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:38:17] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 758/758 places, 757/757 transitions.
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 758 transition count 757
Applied a total of 80 rules in 22 ms. Remains 758 /758 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 757 rows 758 cols
[2022-05-19 12:38:17] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:38:17] [INFO ] [Real]Absence check using 358 positive place invariants in 48 ms returned sat
[2022-05-19 12:38:17] [INFO ] After 416ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:38:17] [INFO ] [Nat]Absence check using 358 positive place invariants in 46 ms returned sat
[2022-05-19 12:38:18] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:38:18] [INFO ] After 305ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-05-19 12:38:18] [INFO ] After 489ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:38:18] [INFO ] Flatten gal took : 22 ms
[2022-05-19 12:38:18] [INFO ] Flatten gal took : 22 ms
[2022-05-19 12:38:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6795562148408168859.gal : 3 ms
[2022-05-19 12:38:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4147276361508946336.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16924042813350087590;'/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/ReachabilityCardinality6795562148408168859.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4147276361508946336.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/ReachabilityCardinality4147276361508946336.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 30
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :30 after 87
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :87 after 186
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :186 after 283
Reachability property apf1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
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,452,0.283565,10576,2,1760,11,8132,6,0,3791,3307,0
Total reachable state count : 452
Verifying 1 reachability properties.
Reachability property apf1 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
apf1,1,0.285495,10840,2,759,11,8132,7,0,3797,3307,0
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 223 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 27 ms :[(AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 34 ms :[(AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 34 ms :[(AND p1 (NOT p0))]
Product exploration explored 100000 steps with 19336 reset in 608 ms.
Product exploration explored 100000 steps with 19453 reset in 745 ms.
Built C files in :
/tmp/ltsmin4352609592927729131
[2022-05-19 12:38:20] [INFO ] Computing symmetric may disable matrix : 758 transitions.
[2022-05-19 12:38:20] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:38:20] [INFO ] Computing symmetric may enable matrix : 758 transitions.
[2022-05-19 12:38:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:38:20] [INFO ] Computing Do-Not-Accords matrix : 758 transitions.
[2022-05-19 12:38:20] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:38:20] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4352609592927729131
Running compilation step : cd /tmp/ltsmin4352609592927729131;'/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 2027 ms.
Running link step : cd /tmp/ltsmin4352609592927729131;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin4352609592927729131;'/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' '--hoa' '/tmp/stateBased6588338854671540970.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 758 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 758/758 places, 758/758 transitions.
Applied a total of 0 rules in 20 ms. Remains 758 /758 variables (removed 0) and now considering 758/758 (removed 0) transitions.
// Phase 1: matrix 758 rows 758 cols
[2022-05-19 12:38:35] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:38:35] [INFO ] Implicit Places using invariants in 399 ms returned []
// Phase 1: matrix 758 rows 758 cols
[2022-05-19 12:38:35] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:38:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:38:36] [INFO ] Implicit Places using invariants and state equation in 783 ms returned []
Implicit Place search using SMT with State Equation took 1184 ms to find 0 implicit places.
[2022-05-19 12:38:36] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 758 rows 758 cols
[2022-05-19 12:38:36] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:38:36] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 758/758 places, 758/758 transitions.
Built C files in :
/tmp/ltsmin293728396974301242
[2022-05-19 12:38:37] [INFO ] Computing symmetric may disable matrix : 758 transitions.
[2022-05-19 12:38:37] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:38:37] [INFO ] Computing symmetric may enable matrix : 758 transitions.
[2022-05-19 12:38:37] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:38:37] [INFO ] Computing Do-Not-Accords matrix : 758 transitions.
[2022-05-19 12:38:37] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 12:38:37] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin293728396974301242
Running compilation step : cd /tmp/ltsmin293728396974301242;'/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 2001 ms.
Running link step : cd /tmp/ltsmin293728396974301242;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin293728396974301242;'/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' '--hoa' '/tmp/stateBased6345991342370625987.hoa' '--buchi-type=spotba'
LTSmin run took 6790 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-040B-LTLFireability-02 finished in 49678 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X(F(p0)))) U F(p0)))'
Support contains 1 out of 2367 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2367/2367 places, 2167/2167 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 481 transitions
Trivial Post-agglo rules discarded 481 transitions
Performed 481 trivial Post agglomeration. Transition count delta: 481
Iterating post reduction 0 with 481 rules applied. Total rules applied 481 place count 2366 transition count 1685
Reduce places removed 481 places and 0 transitions.
Iterating post reduction 1 with 481 rules applied. Total rules applied 962 place count 1885 transition count 1685
Performed 316 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 316 Pre rules applied. Total rules applied 962 place count 1885 transition count 1369
Deduced a syphon composed of 316 places in 2 ms
Reduce places removed 316 places and 0 transitions.
Iterating global reduction 2 with 632 rules applied. Total rules applied 1594 place count 1569 transition count 1369
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1597 place count 1566 transition count 1366
Iterating global reduction 2 with 3 rules applied. Total rules applied 1600 place count 1566 transition count 1366
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1600 place count 1566 transition count 1363
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1606 place count 1563 transition count 1363
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 1 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 2 with 1360 rules applied. Total rules applied 2966 place count 883 transition count 683
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2967 place count 883 transition count 682
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 2969 place count 882 transition count 681
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 3171 place count 781 transition count 747
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3207 place count 763 transition count 760
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3209 place count 761 transition count 758
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3211 place count 759 transition count 758
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3211 place count 759 transition count 757
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 3213 place count 758 transition count 757
Applied a total of 3213 rules in 388 ms. Remains 758 /2367 variables (removed 1609) and now considering 757/2167 (removed 1410) transitions.
// Phase 1: matrix 757 rows 758 cols
[2022-05-19 12:38:46] [INFO ] Computed 359 place invariants in 3 ms
[2022-05-19 12:38:47] [INFO ] Implicit Places using invariants in 413 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 417 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 757/2367 places, 757/2167 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 756 transition count 756
Applied a total of 2 rules in 29 ms. Remains 756 /757 variables (removed 1) and now considering 756/757 (removed 1) transitions.
// Phase 1: matrix 756 rows 756 cols
[2022-05-19 12:38:47] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-19 12:38:47] [INFO ] Implicit Places using invariants in 428 ms returned []
// Phase 1: matrix 756 rows 756 cols
[2022-05-19 12:38:47] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:38:48] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 756/2367 places, 756/2167 transitions.
Finished structural reductions, in 2 iterations. Remains : 756/2367 places, 756/2167 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s404 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-03 finished in 2050 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)||(G(p1)&&p2))) U (X(p2) U p3)))'
Support contains 7 out of 2367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2367/2367 places, 2167/2167 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2361 transition count 2161
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2361 transition count 2161
Applied a total of 12 rules in 269 ms. Remains 2361 /2367 variables (removed 6) and now considering 2161/2167 (removed 6) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:38:48] [INFO ] Computed 361 place invariants in 6 ms
[2022-05-19 12:38:49] [INFO ] Implicit Places using invariants in 670 ms returned []
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:38:49] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:38:51] [INFO ] Implicit Places using invariants and state equation in 2148 ms returned []
Implicit Place search using SMT with State Equation took 2821 ms to find 0 implicit places.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:38:51] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:38:52] [INFO ] Dead Transitions using invariants and state equation in 1254 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2367 places, 2161/2167 transitions.
Finished structural reductions, in 1 iterations. Remains : 2361/2367 places, 2161/2167 transitions.
Stuttering acceptance computed with spot in 690 ms :[true, (NOT p3), (OR (NOT p3) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p3) p0 p2 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) p0 p2 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p0) p2 (NOT p1)), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p3) (NOT p0) p2 p1), acceptance={0} source=2 dest: 5}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={0} source=2 dest: 6}, { cond=(AND p3 p0 (NOT p2)), acceptance={0} source=2 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p3) p0 p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p0) p2), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={0} source=3 dest: 6}, { cond=(AND p3 p0 (NOT p2)), acceptance={0} source=3 dest: 8}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p3) p2 p1), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p3) p0 (NOT p2) p1), acceptance={0} source=5 dest: 7}, { cond=(AND p3 p0 (NOT p2) p1), acceptance={0} source=5 dest: 9}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p3) p0), acceptance={0} source=6 dest: 6}, { cond=(AND p3 p0), acceptance={0} source=6 dest: 8}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 0}, { cond=(AND (NOT p3) p0 p1), acceptance={0} source=7 dest: 7}, { cond=(AND p3 p0 p1), acceptance={0} source=7 dest: 9}], [{ cond=(NOT p0), acceptance={} source=8 dest: 0}, { cond=p0, acceptance={} source=8 dest: 8}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=9 dest: 0}, { cond=(AND p0 p1), acceptance={} source=9 dest: 9}]], initial=1, aps=[p3:(AND (EQ s2209 1) (EQ s2220 1) (EQ s2246 1)), p0:(AND (EQ s349 1) (EQ s381 1)), p2:(EQ s2095 1), p1:(EQ s456 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-04 finished in 5077 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X((G(p0)||p1)) U p2))))'
Support contains 6 out of 2367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2367/2367 places, 2167/2167 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2361 transition count 2161
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2361 transition count 2161
Applied a total of 12 rules in 264 ms. Remains 2361 /2367 variables (removed 6) and now considering 2161/2167 (removed 6) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:38:53] [INFO ] Computed 361 place invariants in 13 ms
[2022-05-19 12:38:54] [INFO ] Implicit Places using invariants in 671 ms returned []
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:38:54] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:38:56] [INFO ] Implicit Places using invariants and state equation in 2105 ms returned []
Implicit Place search using SMT with State Equation took 2790 ms to find 0 implicit places.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:38:56] [INFO ] Computed 361 place invariants in 13 ms
[2022-05-19 12:38:57] [INFO ] Dead Transitions using invariants and state equation in 1239 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2367 places, 2161/2167 transitions.
Finished structural reductions, in 1 iterations. Remains : 2361/2367 places, 2161/2167 transitions.
Stuttering acceptance computed with spot in 344 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p2), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 0}, { cond=(NOT p2), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s2305 1) (EQ s2245 1)), p1:(AND (EQ s182 1) (EQ s207 1) (EQ s216 1)), p0:(EQ s461 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 677 ms.
Stack based approach found an accepted trace after 3035 steps with 0 reset with depth 3036 and stack size 3036 in 25 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-05 finished in 5384 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(X(X(G(p0)))||F(p1))) U X(G(p2))))'
Support contains 3 out of 2367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2367/2367 places, 2167/2167 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2362 transition count 2162
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2362 transition count 2162
Applied a total of 10 rules in 242 ms. Remains 2362 /2367 variables (removed 5) and now considering 2162/2167 (removed 5) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:38:59] [INFO ] Computed 361 place invariants in 8 ms
[2022-05-19 12:38:59] [INFO ] Implicit Places using invariants in 687 ms returned []
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:38:59] [INFO ] Computed 361 place invariants in 11 ms
[2022-05-19 12:39:01] [INFO ] Implicit Places using invariants and state equation in 2028 ms returned []
Implicit Place search using SMT with State Equation took 2717 ms to find 0 implicit places.
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:39:01] [INFO ] Computed 361 place invariants in 8 ms
[2022-05-19 12:39:02] [INFO ] Dead Transitions using invariants and state equation in 1168 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2362/2367 places, 2162/2167 transitions.
Finished structural reductions, in 1 iterations. Remains : 2362/2367 places, 2162/2167 transitions.
Stuttering acceptance computed with spot in 347 ms :[(NOT p2), (NOT p2), true, p0, (AND p2 p1), (NOT p2), (AND p0 (NOT p2)), p0, (AND p0 (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p2 p1), acceptance={} source=1 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 7}], [{ cond=(AND p2 p1), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 7}, { cond=p2, acceptance={} source=6 dest: 8}], [{ cond=p0, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p2) p0), acceptance={} source=8 dest: 7}, { cond=(AND p2 p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(EQ s516 1), p1:(EQ s1140 1), p0:(EQ s138 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24980 reset in 445 ms.
Product exploration explored 100000 steps with 25049 reset in 472 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) p1))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 777 ms. Reduced automaton from 9 states, 19 edges and 3 AP to 9 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 289 ms :[(NOT p2), (NOT p2), true, p0, (AND p1 p2), (NOT p2), (AND p0 (NOT p2)), p0, (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) 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
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 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 17 ms. (steps per millisecond=588 ) 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
Interrupted probabilistic random walk after 86022 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86022 steps, saw 56889 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:39:09] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:39:09] [INFO ] [Real]Absence check using 361 positive place invariants in 126 ms returned sat
[2022-05-19 12:39:11] [INFO ] After 1257ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:6
[2022-05-19 12:39:11] [INFO ] Deduced a trap composed of 17 places in 476 ms of which 1 ms to minimize.
[2022-05-19 12:39:12] [INFO ] Deduced a trap composed of 30 places in 450 ms of which 1 ms to minimize.
[2022-05-19 12:39:12] [INFO ] Deduced a trap composed of 22 places in 446 ms of which 1 ms to minimize.
[2022-05-19 12:39:13] [INFO ] Deduced a trap composed of 17 places in 447 ms of which 1 ms to minimize.
[2022-05-19 12:39:13] [INFO ] Deduced a trap composed of 20 places in 422 ms of which 1 ms to minimize.
[2022-05-19 12:39:14] [INFO ] Deduced a trap composed of 23 places in 455 ms of which 1 ms to minimize.
[2022-05-19 12:39:14] [INFO ] Deduced a trap composed of 17 places in 432 ms of which 2 ms to minimize.
[2022-05-19 12:39:15] [INFO ] Deduced a trap composed of 23 places in 414 ms of which 1 ms to minimize.
[2022-05-19 12:39:15] [INFO ] Deduced a trap composed of 28 places in 413 ms of which 2 ms to minimize.
[2022-05-19 12:39:16] [INFO ] Deduced a trap composed of 18 places in 413 ms of which 1 ms to minimize.
[2022-05-19 12:39:16] [INFO ] Deduced a trap composed of 23 places in 410 ms of which 1 ms to minimize.
[2022-05-19 12:39:17] [INFO ] Deduced a trap composed of 21 places in 404 ms of which 2 ms to minimize.
[2022-05-19 12:39:17] [INFO ] Deduced a trap composed of 29 places in 395 ms of which 1 ms to minimize.
[2022-05-19 12:39:18] [INFO ] Deduced a trap composed of 30 places in 385 ms of which 1 ms to minimize.
[2022-05-19 12:39:18] [INFO ] Deduced a trap composed of 28 places in 388 ms of which 1 ms to minimize.
[2022-05-19 12:39:19] [INFO ] Deduced a trap composed of 24 places in 388 ms of which 1 ms to minimize.
[2022-05-19 12:39:19] [INFO ] Deduced a trap composed of 25 places in 376 ms of which 1 ms to minimize.
[2022-05-19 12:39:20] [INFO ] Deduced a trap composed of 31 places in 370 ms of which 1 ms to minimize.
[2022-05-19 12:39:20] [INFO ] Deduced a trap composed of 19 places in 369 ms of which 1 ms to minimize.
[2022-05-19 12:39:21] [INFO ] Deduced a trap composed of 29 places in 357 ms of which 1 ms to minimize.
[2022-05-19 12:39:21] [INFO ] Deduced a trap composed of 21 places in 350 ms of which 1 ms to minimize.
[2022-05-19 12:39:21] [INFO ] Deduced a trap composed of 25 places in 336 ms of which 2 ms to minimize.
[2022-05-19 12:39:22] [INFO ] Deduced a trap composed of 29 places in 340 ms of which 1 ms to minimize.
[2022-05-19 12:39:22] [INFO ] Deduced a trap composed of 38 places in 333 ms of which 0 ms to minimize.
[2022-05-19 12:39:23] [INFO ] Deduced a trap composed of 35 places in 330 ms of which 1 ms to minimize.
[2022-05-19 12:39:23] [INFO ] Deduced a trap composed of 31 places in 330 ms of which 1 ms to minimize.
[2022-05-19 12:39:24] [INFO ] Deduced a trap composed of 36 places in 319 ms of which 1 ms to minimize.
[2022-05-19 12:39:24] [INFO ] Deduced a trap composed of 37 places in 324 ms of which 1 ms to minimize.
[2022-05-19 12:39:24] [INFO ] Deduced a trap composed of 39 places in 312 ms of which 1 ms to minimize.
[2022-05-19 12:39:25] [INFO ] Deduced a trap composed of 41 places in 315 ms of which 1 ms to minimize.
[2022-05-19 12:39:25] [INFO ] Deduced a trap composed of 40 places in 305 ms of which 1 ms to minimize.
[2022-05-19 12:39:26] [INFO ] Deduced a trap composed of 38 places in 299 ms of which 1 ms to minimize.
[2022-05-19 12:39:26] [INFO ] Deduced a trap composed of 42 places in 299 ms of which 1 ms to minimize.
[2022-05-19 12:39:26] [INFO ] Deduced a trap composed of 44 places in 299 ms of which 0 ms to minimize.
[2022-05-19 12:39:27] [INFO ] Deduced a trap composed of 35 places in 299 ms of which 1 ms to minimize.
[2022-05-19 12:39:27] [INFO ] Deduced a trap composed of 40 places in 289 ms of which 1 ms to minimize.
[2022-05-19 12:39:27] [INFO ] Deduced a trap composed of 52 places in 296 ms of which 0 ms to minimize.
[2022-05-19 12:39:28] [INFO ] Deduced a trap composed of 42 places in 292 ms of which 1 ms to minimize.
[2022-05-19 12:39:28] [INFO ] Deduced a trap composed of 38 places in 273 ms of which 1 ms to minimize.
[2022-05-19 12:39:29] [INFO ] Deduced a trap composed of 55 places in 270 ms of which 0 ms to minimize.
[2022-05-19 12:39:29] [INFO ] Deduced a trap composed of 42 places in 275 ms of which 1 ms to minimize.
[2022-05-19 12:39:29] [INFO ] Deduced a trap composed of 48 places in 282 ms of which 1 ms to minimize.
[2022-05-19 12:39:30] [INFO ] Deduced a trap composed of 39 places in 308 ms of which 1 ms to minimize.
[2022-05-19 12:39:30] [INFO ] Deduced a trap composed of 37 places in 277 ms of which 1 ms to minimize.
[2022-05-19 12:39:30] [INFO ] Deduced a trap composed of 42 places in 265 ms of which 1 ms to minimize.
[2022-05-19 12:39:31] [INFO ] Deduced a trap composed of 41 places in 258 ms of which 1 ms to minimize.
[2022-05-19 12:39:31] [INFO ] Deduced a trap composed of 38 places in 245 ms of which 1 ms to minimize.
[2022-05-19 12:39:31] [INFO ] Deduced a trap composed of 50 places in 249 ms of which 0 ms to minimize.
[2022-05-19 12:39:32] [INFO ] Deduced a trap composed of 50 places in 226 ms of which 1 ms to minimize.
[2022-05-19 12:39:32] [INFO ] Deduced a trap composed of 46 places in 232 ms of which 1 ms to minimize.
[2022-05-19 12:39:32] [INFO ] Deduced a trap composed of 54 places in 240 ms of which 1 ms to minimize.
[2022-05-19 12:39:33] [INFO ] Deduced a trap composed of 57 places in 227 ms of which 1 ms to minimize.
[2022-05-19 12:39:33] [INFO ] Deduced a trap composed of 49 places in 217 ms of which 1 ms to minimize.
[2022-05-19 12:39:33] [INFO ] Deduced a trap composed of 52 places in 235 ms of which 1 ms to minimize.
[2022-05-19 12:39:34] [INFO ] Deduced a trap composed of 51 places in 225 ms of which 1 ms to minimize.
[2022-05-19 12:39:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 12:39:34] [INFO ] After 25065ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 123 ms.
Support contains 3 out of 2362 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2362/2362 places, 2162/2162 transitions.
Drop transitions removed 478 transitions
Trivial Post-agglo rules discarded 478 transitions
Performed 478 trivial Post agglomeration. Transition count delta: 478
Iterating post reduction 0 with 478 rules applied. Total rules applied 478 place count 2362 transition count 1684
Reduce places removed 478 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 479 rules applied. Total rules applied 957 place count 1884 transition count 1683
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 958 place count 1883 transition count 1683
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 319 Pre rules applied. Total rules applied 958 place count 1883 transition count 1364
Deduced a syphon composed of 319 places in 4 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1596 place count 1564 transition count 1364
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 0 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 3 with 1358 rules applied. Total rules applied 2954 place count 885 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2955 place count 885 transition count 684
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 2957 place count 884 transition count 683
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 3159 place count 783 transition count 749
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 3195 place count 765 transition count 762
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3196 place count 765 transition count 761
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3236 place count 765 transition count 761
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3237 place count 764 transition count 760
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3239 place count 762 transition count 760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3239 place count 762 transition count 759
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3241 place count 761 transition count 759
Applied a total of 3241 rules in 293 ms. Remains 761 /2362 variables (removed 1601) and now considering 759/2162 (removed 1403) transitions.
Finished structural reductions, in 1 iterations. Remains : 761/2362 places, 759/2162 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 80789 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80789 steps, saw 51519 distinct states, run finished after 3004 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 759 rows 761 cols
[2022-05-19 12:39:38] [INFO ] Computed 359 place invariants in 1 ms
[2022-05-19 12:39:38] [INFO ] [Real]Absence check using 359 positive place invariants in 80 ms returned sat
[2022-05-19 12:39:39] [INFO ] After 758ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-19 12:39:39] [INFO ] [Nat]Absence check using 359 positive place invariants in 44 ms returned sat
[2022-05-19 12:39:40] [INFO ] After 487ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-19 12:39:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:39:40] [INFO ] After 227ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-19 12:39:40] [INFO ] After 606ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 233 ms.
[2022-05-19 12:39:40] [INFO ] After 1629ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 150 ms.
Support contains 3 out of 761 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 761/761 places, 759/759 transitions.
Applied a total of 0 rules in 13 ms. Remains 761 /761 variables (removed 0) and now considering 759/759 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 761/761 places, 759/759 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 761/761 places, 759/759 transitions.
Applied a total of 0 rules in 12 ms. Remains 761 /761 variables (removed 0) and now considering 759/759 (removed 0) transitions.
// Phase 1: matrix 759 rows 761 cols
[2022-05-19 12:39:41] [INFO ] Computed 359 place invariants in 2 ms
[2022-05-19 12:39:41] [INFO ] Implicit Places using invariants in 538 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 539 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 760/761 places, 759/759 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 759 transition count 758
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 759 transition count 758
Applied a total of 2 rules in 22 ms. Remains 759 /760 variables (removed 1) and now considering 758/759 (removed 1) transitions.
// Phase 1: matrix 758 rows 759 cols
[2022-05-19 12:39:41] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:39:42] [INFO ] Implicit Places using invariants in 548 ms returned []
// Phase 1: matrix 758 rows 759 cols
[2022-05-19 12:39:42] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-19 12:39:42] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 1271 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 759/761 places, 758/759 transitions.
Finished structural reductions, in 2 iterations. Remains : 759/761 places, 758/759 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 97287 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97287 steps, saw 61568 distinct states, run finished after 3004 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 758 rows 759 cols
[2022-05-19 12:39:46] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:39:47] [INFO ] [Real]Absence check using 358 positive place invariants in 45 ms returned sat
[2022-05-19 12:39:47] [INFO ] After 646ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-19 12:39:47] [INFO ] [Nat]Absence check using 358 positive place invariants in 52 ms returned sat
[2022-05-19 12:39:48] [INFO ] After 442ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-19 12:39:48] [INFO ] After 817ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 230 ms.
[2022-05-19 12:39:48] [INFO ] After 1363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 141 ms.
Support contains 3 out of 759 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 759/759 places, 758/758 transitions.
Applied a total of 0 rules in 25 ms. Remains 759 /759 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 759/759 places, 758/758 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 759/759 places, 758/758 transitions.
Applied a total of 0 rules in 15 ms. Remains 759 /759 variables (removed 0) and now considering 758/758 (removed 0) transitions.
// Phase 1: matrix 758 rows 759 cols
[2022-05-19 12:39:49] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:39:49] [INFO ] Implicit Places using invariants in 589 ms returned []
// Phase 1: matrix 758 rows 759 cols
[2022-05-19 12:39:49] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:39:50] [INFO ] Implicit Places using invariants and state equation in 704 ms returned []
Implicit Place search using SMT with State Equation took 1319 ms to find 0 implicit places.
[2022-05-19 12:39:50] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 758 rows 759 cols
[2022-05-19 12:39:50] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:39:50] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 759/759 places, 758/758 transitions.
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 759 transition count 758
Applied a total of 80 rules in 28 ms. Remains 759 /759 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 758 rows 759 cols
[2022-05-19 12:39:50] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:39:51] [INFO ] [Real]Absence check using 358 positive place invariants in 46 ms returned sat
[2022-05-19 12:39:51] [INFO ] After 658ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-19 12:39:51] [INFO ] [Nat]Absence check using 358 positive place invariants in 50 ms returned sat
[2022-05-19 12:39:52] [INFO ] After 462ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-19 12:39:52] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-05-19 12:39:52] [INFO ] After 288ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-19 12:39:52] [INFO ] After 706ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 254 ms.
[2022-05-19 12:39:53] [INFO ] After 1718ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2022-05-19 12:39:53] [INFO ] Flatten gal took : 27 ms
[2022-05-19 12:39:53] [INFO ] Flatten gal took : 28 ms
[2022-05-19 12:39:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13431769227810934993.gal : 3 ms
[2022-05-19 12:39:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10162715925446205570.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms1340928693009371408;'/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/ReachabilityCardinality13431769227810934993.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10162715925446205570.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...321
Loading property file /tmp/ReachabilityCardinality10162715925446205570.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :9 after 18
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :18 after 37
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :37 after 70
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :70 after 137
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :137 after 372
Reachability property apf6 is true.
Reachability property apf5 is true.
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :372 after 5139
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :5139 after 37423
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :37423 after 167515
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :167515 after 788433
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :788433 after 3.96794e+07
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :3.96794e+07 after 4.10617e+10
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :4.10617e+10 after 4.71012e+13
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :4.71012e+13 after 1.9427e+19
Reachability property apf7 is true.
Reachability property apf4 is true.
Reachability property apf1 is true.
Reachability property apf0 is true.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.9427e+19 after 6.84642e+27
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :6.84642e+27 after 2.27101e+33
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.27101e+33 after 8.20685e+41
Reachability property apf3 is true.
Reachability property apf2 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65537 fixpoint passes
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) p1))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 499 ms. Reduced automaton from 9 states, 19 edges and 3 AP to 9 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 314 ms :[(NOT p2), (NOT p2), true, p0, (AND p1 p2), (NOT p2), (AND p0 (NOT p2)), p0, (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 250 ms :[(NOT p2), (NOT p2), true, p0, (AND p1 p2), (NOT p2), (AND p0 (NOT p2)), p0, (AND p0 (NOT p2))]
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:40:09] [INFO ] Computed 361 place invariants in 4 ms
[2022-05-19 12:40:10] [INFO ] [Real]Absence check using 361 positive place invariants in 541 ms returned sat
[2022-05-19 12:40:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 12:40:24] [INFO ] [Real]Absence check using state equation in 13507 ms returned unknown
Could not prove EG (NOT p2)
Support contains 3 out of 2362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2362/2362 places, 2162/2162 transitions.
Applied a total of 0 rules in 134 ms. Remains 2362 /2362 variables (removed 0) and now considering 2162/2162 (removed 0) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:40:24] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:40:25] [INFO ] Implicit Places using invariants in 687 ms returned []
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:40:25] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:40:27] [INFO ] Implicit Places using invariants and state equation in 2158 ms returned []
Implicit Place search using SMT with State Equation took 2867 ms to find 0 implicit places.
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:40:27] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:40:28] [INFO ] Dead Transitions using invariants and state equation in 1207 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2362/2362 places, 2162/2162 transitions.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 477 ms. Reduced automaton from 9 states, 19 edges and 3 AP to 9 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 304 ms :[(NOT p2), (NOT p2), true, p0, (AND p1 p2), (NOT p2), (AND p0 (NOT p2)), p0, (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
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 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 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 87341 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87341 steps, saw 57559 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:40:32] [INFO ] Computed 361 place invariants in 4 ms
[2022-05-19 12:40:33] [INFO ] [Real]Absence check using 361 positive place invariants in 116 ms returned sat
[2022-05-19 12:40:35] [INFO ] After 1353ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:6
[2022-05-19 12:40:35] [INFO ] Deduced a trap composed of 17 places in 456 ms of which 1 ms to minimize.
[2022-05-19 12:40:36] [INFO ] Deduced a trap composed of 30 places in 464 ms of which 2 ms to minimize.
[2022-05-19 12:40:36] [INFO ] Deduced a trap composed of 22 places in 444 ms of which 1 ms to minimize.
[2022-05-19 12:40:37] [INFO ] Deduced a trap composed of 17 places in 423 ms of which 1 ms to minimize.
[2022-05-19 12:40:37] [INFO ] Deduced a trap composed of 20 places in 425 ms of which 1 ms to minimize.
[2022-05-19 12:40:38] [INFO ] Deduced a trap composed of 23 places in 433 ms of which 1 ms to minimize.
[2022-05-19 12:40:38] [INFO ] Deduced a trap composed of 17 places in 411 ms of which 1 ms to minimize.
[2022-05-19 12:40:39] [INFO ] Deduced a trap composed of 23 places in 399 ms of which 1 ms to minimize.
[2022-05-19 12:40:39] [INFO ] Deduced a trap composed of 28 places in 403 ms of which 1 ms to minimize.
[2022-05-19 12:40:40] [INFO ] Deduced a trap composed of 18 places in 390 ms of which 1 ms to minimize.
[2022-05-19 12:40:40] [INFO ] Deduced a trap composed of 23 places in 395 ms of which 1 ms to minimize.
[2022-05-19 12:40:41] [INFO ] Deduced a trap composed of 21 places in 389 ms of which 1 ms to minimize.
[2022-05-19 12:40:41] [INFO ] Deduced a trap composed of 29 places in 385 ms of which 1 ms to minimize.
[2022-05-19 12:40:42] [INFO ] Deduced a trap composed of 30 places in 374 ms of which 1 ms to minimize.
[2022-05-19 12:40:42] [INFO ] Deduced a trap composed of 28 places in 374 ms of which 1 ms to minimize.
[2022-05-19 12:40:43] [INFO ] Deduced a trap composed of 24 places in 373 ms of which 1 ms to minimize.
[2022-05-19 12:40:43] [INFO ] Deduced a trap composed of 25 places in 372 ms of which 1 ms to minimize.
[2022-05-19 12:40:43] [INFO ] Deduced a trap composed of 31 places in 361 ms of which 3 ms to minimize.
[2022-05-19 12:40:44] [INFO ] Deduced a trap composed of 19 places in 358 ms of which 1 ms to minimize.
[2022-05-19 12:40:44] [INFO ] Deduced a trap composed of 29 places in 352 ms of which 1 ms to minimize.
[2022-05-19 12:40:45] [INFO ] Deduced a trap composed of 21 places in 358 ms of which 1 ms to minimize.
[2022-05-19 12:40:45] [INFO ] Deduced a trap composed of 25 places in 340 ms of which 1 ms to minimize.
[2022-05-19 12:40:46] [INFO ] Deduced a trap composed of 29 places in 343 ms of which 2 ms to minimize.
[2022-05-19 12:40:46] [INFO ] Deduced a trap composed of 38 places in 329 ms of which 1 ms to minimize.
[2022-05-19 12:40:46] [INFO ] Deduced a trap composed of 35 places in 316 ms of which 1 ms to minimize.
[2022-05-19 12:40:47] [INFO ] Deduced a trap composed of 31 places in 309 ms of which 1 ms to minimize.
[2022-05-19 12:40:47] [INFO ] Deduced a trap composed of 36 places in 332 ms of which 1 ms to minimize.
[2022-05-19 12:40:48] [INFO ] Deduced a trap composed of 37 places in 329 ms of which 2 ms to minimize.
[2022-05-19 12:40:48] [INFO ] Deduced a trap composed of 39 places in 326 ms of which 1 ms to minimize.
[2022-05-19 12:40:48] [INFO ] Deduced a trap composed of 41 places in 342 ms of which 1 ms to minimize.
[2022-05-19 12:40:49] [INFO ] Deduced a trap composed of 40 places in 318 ms of which 1 ms to minimize.
[2022-05-19 12:40:49] [INFO ] Deduced a trap composed of 38 places in 317 ms of which 1 ms to minimize.
[2022-05-19 12:40:50] [INFO ] Deduced a trap composed of 42 places in 303 ms of which 1 ms to minimize.
[2022-05-19 12:40:50] [INFO ] Deduced a trap composed of 44 places in 311 ms of which 1 ms to minimize.
[2022-05-19 12:40:50] [INFO ] Deduced a trap composed of 35 places in 297 ms of which 0 ms to minimize.
[2022-05-19 12:40:51] [INFO ] Deduced a trap composed of 40 places in 296 ms of which 1 ms to minimize.
[2022-05-19 12:40:51] [INFO ] Deduced a trap composed of 52 places in 298 ms of which 1 ms to minimize.
[2022-05-19 12:40:52] [INFO ] Deduced a trap composed of 42 places in 271 ms of which 1 ms to minimize.
[2022-05-19 12:40:52] [INFO ] Deduced a trap composed of 38 places in 268 ms of which 0 ms to minimize.
[2022-05-19 12:40:52] [INFO ] Deduced a trap composed of 55 places in 278 ms of which 0 ms to minimize.
[2022-05-19 12:40:53] [INFO ] Deduced a trap composed of 42 places in 275 ms of which 1 ms to minimize.
[2022-05-19 12:40:53] [INFO ] Deduced a trap composed of 48 places in 269 ms of which 1 ms to minimize.
[2022-05-19 12:40:53] [INFO ] Deduced a trap composed of 39 places in 302 ms of which 1 ms to minimize.
[2022-05-19 12:40:54] [INFO ] Deduced a trap composed of 37 places in 262 ms of which 1 ms to minimize.
[2022-05-19 12:40:54] [INFO ] Deduced a trap composed of 42 places in 256 ms of which 1 ms to minimize.
[2022-05-19 12:40:54] [INFO ] Deduced a trap composed of 41 places in 251 ms of which 1 ms to minimize.
[2022-05-19 12:40:55] [INFO ] Deduced a trap composed of 38 places in 241 ms of which 0 ms to minimize.
[2022-05-19 12:40:55] [INFO ] Deduced a trap composed of 50 places in 249 ms of which 0 ms to minimize.
[2022-05-19 12:40:55] [INFO ] Deduced a trap composed of 50 places in 240 ms of which 1 ms to minimize.
[2022-05-19 12:40:56] [INFO ] Deduced a trap composed of 46 places in 234 ms of which 0 ms to minimize.
[2022-05-19 12:40:56] [INFO ] Deduced a trap composed of 54 places in 225 ms of which 0 ms to minimize.
[2022-05-19 12:40:56] [INFO ] Deduced a trap composed of 57 places in 228 ms of which 0 ms to minimize.
[2022-05-19 12:40:57] [INFO ] Deduced a trap composed of 49 places in 230 ms of which 0 ms to minimize.
[2022-05-19 12:40:57] [INFO ] Deduced a trap composed of 52 places in 226 ms of which 1 ms to minimize.
[2022-05-19 12:40:57] [INFO ] Deduced a trap composed of 51 places in 215 ms of which 1 ms to minimize.
[2022-05-19 12:40:58] [INFO ] Deduced a trap composed of 51 places in 212 ms of which 1 ms to minimize.
[2022-05-19 12:40:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 12:40:58] [INFO ] After 25108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 90 ms.
Support contains 3 out of 2362 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2362/2362 places, 2162/2162 transitions.
Drop transitions removed 478 transitions
Trivial Post-agglo rules discarded 478 transitions
Performed 478 trivial Post agglomeration. Transition count delta: 478
Iterating post reduction 0 with 478 rules applied. Total rules applied 478 place count 2362 transition count 1684
Reduce places removed 478 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 479 rules applied. Total rules applied 957 place count 1884 transition count 1683
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 958 place count 1883 transition count 1683
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 319 Pre rules applied. Total rules applied 958 place count 1883 transition count 1364
Deduced a syphon composed of 319 places in 1 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1596 place count 1564 transition count 1364
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 1 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 3 with 1358 rules applied. Total rules applied 2954 place count 885 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2955 place count 885 transition count 684
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 2957 place count 884 transition count 683
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 3159 place count 783 transition count 749
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 3195 place count 765 transition count 762
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3196 place count 765 transition count 761
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3236 place count 765 transition count 761
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3237 place count 764 transition count 760
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3239 place count 762 transition count 760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3239 place count 762 transition count 759
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3241 place count 761 transition count 759
Applied a total of 3241 rules in 290 ms. Remains 761 /2362 variables (removed 1601) and now considering 759/2162 (removed 1403) transitions.
Finished structural reductions, in 1 iterations. Remains : 761/2362 places, 759/2162 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 58702 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 58702 steps, saw 37398 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 759 rows 761 cols
[2022-05-19 12:41:02] [INFO ] Computed 359 place invariants in 1 ms
[2022-05-19 12:41:02] [INFO ] [Real]Absence check using 359 positive place invariants in 45 ms returned sat
[2022-05-19 12:41:03] [INFO ] After 641ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-19 12:41:03] [INFO ] [Nat]Absence check using 359 positive place invariants in 44 ms returned sat
[2022-05-19 12:41:04] [INFO ] After 435ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-19 12:41:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:41:04] [INFO ] After 224ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-19 12:41:04] [INFO ] After 590ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 223 ms.
[2022-05-19 12:41:04] [INFO ] After 1544ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 149 ms.
Support contains 3 out of 761 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 761/761 places, 759/759 transitions.
Applied a total of 0 rules in 12 ms. Remains 761 /761 variables (removed 0) and now considering 759/759 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 761/761 places, 759/759 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 761/761 places, 759/759 transitions.
Applied a total of 0 rules in 11 ms. Remains 761 /761 variables (removed 0) and now considering 759/759 (removed 0) transitions.
// Phase 1: matrix 759 rows 761 cols
[2022-05-19 12:41:05] [INFO ] Computed 359 place invariants in 1 ms
[2022-05-19 12:41:05] [INFO ] Implicit Places using invariants in 371 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 391 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 760/761 places, 759/759 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 759 transition count 758
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 759 transition count 758
Applied a total of 2 rules in 20 ms. Remains 759 /760 variables (removed 1) and now considering 758/759 (removed 1) transitions.
// Phase 1: matrix 758 rows 759 cols
[2022-05-19 12:41:05] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:41:05] [INFO ] Implicit Places using invariants in 382 ms returned []
// Phase 1: matrix 758 rows 759 cols
[2022-05-19 12:41:05] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:41:06] [INFO ] Implicit Places using invariants and state equation in 686 ms returned []
Implicit Place search using SMT with State Equation took 1109 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 759/761 places, 758/759 transitions.
Finished structural reductions, in 2 iterations. Remains : 759/761 places, 758/759 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 427 ms. (steps per millisecond=23 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 60737 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 60737 steps, saw 38251 distinct states, run finished after 3002 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 758 rows 759 cols
[2022-05-19 12:41:11] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:41:11] [INFO ] [Real]Absence check using 358 positive place invariants in 44 ms returned sat
[2022-05-19 12:41:11] [INFO ] After 659ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-19 12:41:11] [INFO ] [Nat]Absence check using 358 positive place invariants in 44 ms returned sat
[2022-05-19 12:41:12] [INFO ] After 451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-19 12:41:12] [INFO ] After 819ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 226 ms.
[2022-05-19 12:41:13] [INFO ] After 1341ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 181 ms.
Support contains 3 out of 759 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 759/759 places, 758/758 transitions.
Applied a total of 0 rules in 13 ms. Remains 759 /759 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 759/759 places, 758/758 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 759/759 places, 758/758 transitions.
Applied a total of 0 rules in 11 ms. Remains 759 /759 variables (removed 0) and now considering 758/758 (removed 0) transitions.
// Phase 1: matrix 758 rows 759 cols
[2022-05-19 12:41:13] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:41:13] [INFO ] Implicit Places using invariants in 380 ms returned []
// Phase 1: matrix 758 rows 759 cols
[2022-05-19 12:41:13] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:41:14] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 1126 ms to find 0 implicit places.
[2022-05-19 12:41:14] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 758 rows 759 cols
[2022-05-19 12:41:14] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:41:14] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 759/759 places, 758/758 transitions.
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 759 transition count 758
Applied a total of 80 rules in 23 ms. Remains 759 /759 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 758 rows 759 cols
[2022-05-19 12:41:14] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:41:14] [INFO ] [Real]Absence check using 358 positive place invariants in 46 ms returned sat
[2022-05-19 12:41:15] [INFO ] After 638ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-19 12:41:15] [INFO ] [Nat]Absence check using 358 positive place invariants in 43 ms returned sat
[2022-05-19 12:41:16] [INFO ] After 441ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-05-19 12:41:16] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-05-19 12:41:16] [INFO ] After 294ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-05-19 12:41:16] [INFO ] After 704ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 265 ms.
[2022-05-19 12:41:17] [INFO ] After 1722ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2022-05-19 12:41:17] [INFO ] Flatten gal took : 25 ms
[2022-05-19 12:41:17] [INFO ] Flatten gal took : 48 ms
[2022-05-19 12:41:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10909673166235201858.gal : 3 ms
[2022-05-19 12:41:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5553132007595574234.prop : 10 ms
Invoking ITS tools like this :cd /tmp/redAtoms16728256477375553498;'/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/ReachabilityCardinality10909673166235201858.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5553132007595574234.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...320
Loading property file /tmp/ReachabilityCardinality5553132007595574234.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :9 after 18
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :18 after 37
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :37 after 70
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :70 after 137
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :137 after 372
Reachability property apf6 is true.
Reachability property apf5 is true.
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :372 after 5139
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :5139 after 37423
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :37423 after 167515
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :167515 after 788433
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :788433 after 3.96794e+07
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :3.96794e+07 after 4.10617e+10
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :4.10617e+10 after 4.71012e+13
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :4.71012e+13 after 1.9427e+19
Reachability property apf7 is true.
Reachability property apf4 is true.
Reachability property apf1 is true.
Reachability property apf0 is true.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.9427e+19 after 6.84642e+27
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :6.84642e+27 after 2.27101e+33
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.27101e+33 after 8.20685e+41
Reachability property apf3 is true.
Reachability property apf2 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65537 fixpoint passes
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,1.83505e+55,14.9507,376880,2,13360,27,1.26366e+06,6,0,3758,2.9186e+06,0
Total reachable state count : 1.83505263822457504599372063414953202142e+55
Verifying 8 reachability properties.
Reachability property apf0 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
apf0,1.1259e+23,14.9543,376880,2,1094,27,1.26366e+06,7,0,3764,2.9186e+06,0
Reachability property apf1 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
apf1,3.44331e+52,14.9571,376880,2,5727,27,1.26366e+06,8,0,3767,2.9186e+06,0
Reachability property apf2 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
apf2,1.1259e+23,14.9585,376880,2,1094,27,1.26366e+06,9,0,3770,2.9186e+06,0
Reachability property apf3 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
apf3,1.1259e+23,14.9595,376880,2,1094,27,1.26366e+06,10,0,3771,2.9186e+06,0
Reachability property apf4 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
apf4,1.1259e+23,14.9602,376880,2,1094,27,1.26366e+06,11,0,3771,2.9186e+06,0
Reachability property apf5 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
apf5,6144,14.9613,376880,2,806,27,1.26366e+06,12,0,3773,2.9186e+06,0
Reachability property apf6 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
apf6,6144,14.9625,376880,2,806,27,1.26366e+06,13,0,3774,2.9186e+06,0
Reachability property apf7 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
apf7,6144,14.9633,376880,2,806,27,1.26366e+06,14,0,3775,2.9186e+06,0
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 718 ms. Reduced automaton from 9 states, 19 edges and 3 AP to 9 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 281 ms :[(NOT p2), (NOT p2), true, p0, (AND p1 p2), (NOT p2), (AND p0 (NOT p2)), p0, (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 257 ms :[(NOT p2), (NOT p2), true, p0, (AND p1 p2), (NOT p2), (AND p0 (NOT p2)), p0, (AND p0 (NOT p2))]
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:41:33] [INFO ] Computed 361 place invariants in 9 ms
[2022-05-19 12:41:34] [INFO ] [Real]Absence check using 361 positive place invariants in 518 ms returned sat
[2022-05-19 12:41:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 12:41:48] [INFO ] [Real]Absence check using state equation in 13572 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 248 ms :[(NOT p2), (NOT p2), true, p0, (AND p1 p2), (NOT p2), (AND p0 (NOT p2)), p0, (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 24975 reset in 402 ms.
Product exploration explored 100000 steps with 24963 reset in 407 ms.
Applying partial POR strategy [false, false, true, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 262 ms :[(NOT p2), (NOT p2), true, p0, (AND p1 p2), (NOT p2), (AND p0 (NOT p2)), p0, (AND p0 (NOT p2))]
Support contains 3 out of 2362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2362/2362 places, 2162/2162 transitions.
Performed 479 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2362 transition count 2162
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 160 Pre rules applied. Total rules applied 479 place count 2362 transition count 2282
Deduced a syphon composed of 639 places in 3 ms
Iterating global reduction 1 with 160 rules applied. Total rules applied 639 place count 2362 transition count 2282
Performed 799 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1438 places in 2 ms
Iterating global reduction 1 with 799 rules applied. Total rules applied 1438 place count 2362 transition count 2282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1439 place count 2362 transition count 2281
Renaming transitions due to excessive name length > 1024 char.
Discarding 320 places :
Symmetric choice reduction at 2 with 320 rule applications. Total rules 1759 place count 2042 transition count 1961
Deduced a syphon composed of 1118 places in 1 ms
Iterating global reduction 2 with 320 rules applied. Total rules applied 2079 place count 2042 transition count 1961
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1119 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2080 place count 2042 transition count 1961
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2082 place count 2040 transition count 1959
Deduced a syphon composed of 1117 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2084 place count 2040 transition count 1959
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -530
Deduced a syphon composed of 1218 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2185 place count 2040 transition count 2489
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2286 place count 1939 transition count 2287
Deduced a syphon composed of 1117 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2387 place count 1939 transition count 2287
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -307
Deduced a syphon composed of 1174 places in 2 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2444 place count 1939 transition count 2594
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 2501 place count 1882 transition count 2480
Deduced a syphon composed of 1117 places in 2 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2558 place count 1882 transition count 2480
Deduced a syphon composed of 1117 places in 2 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 2567 place count 1882 transition count 2471
Deduced a syphon composed of 1117 places in 2 ms
Applied a total of 2567 rules in 972 ms. Remains 1882 /2362 variables (removed 480) and now considering 2471/2162 (removed -309) transitions.
[2022-05-19 12:41:50] [INFO ] Redundant transitions in 47 ms returned []
// Phase 1: matrix 2471 rows 1882 cols
[2022-05-19 12:41:50] [INFO ] Computed 361 place invariants in 16 ms
[2022-05-19 12:41:52] [INFO ] Dead Transitions using invariants and state equation in 1213 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1882/2362 places, 2471/2162 transitions.
Finished structural reductions, in 1 iterations. Remains : 1882/2362 places, 2471/2162 transitions.
Product exploration explored 100000 steps with 25051 reset in 3255 ms.
Product exploration explored 100000 steps with 24986 reset in 3212 ms.
Built C files in :
/tmp/ltsmin15643946769541602564
[2022-05-19 12:41:58] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15643946769541602564
Running compilation step : cd /tmp/ltsmin15643946769541602564;'/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/ltsmin15643946769541602564;'/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/ltsmin15643946769541602564;'/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 3 out of 2362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2362/2362 places, 2162/2162 transitions.
Applied a total of 0 rules in 114 ms. Remains 2362 /2362 variables (removed 0) and now considering 2162/2162 (removed 0) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:42:01] [INFO ] Computed 361 place invariants in 4 ms
[2022-05-19 12:42:03] [INFO ] Implicit Places using invariants in 1203 ms returned []
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:42:03] [INFO ] Computed 361 place invariants in 4 ms
[2022-05-19 12:42:05] [INFO ] Implicit Places using invariants and state equation in 1979 ms returned []
Implicit Place search using SMT with State Equation took 3213 ms to find 0 implicit places.
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:42:05] [INFO ] Computed 361 place invariants in 4 ms
[2022-05-19 12:42:06] [INFO ] Dead Transitions using invariants and state equation in 1235 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2362/2362 places, 2162/2162 transitions.
Built C files in :
/tmp/ltsmin11090799727938539294
[2022-05-19 12:42:06] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11090799727938539294
Running compilation step : cd /tmp/ltsmin11090799727938539294;'/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/ltsmin11090799727938539294;'/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/ltsmin11090799727938539294;'/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-19 12:42:09] [INFO ] Flatten gal took : 46 ms
[2022-05-19 12:42:09] [INFO ] Flatten gal took : 59 ms
[2022-05-19 12:42:09] [INFO ] Time to serialize gal into /tmp/LTL11046868798535855965.gal : 20 ms
[2022-05-19 12:42:09] [INFO ] Time to serialize properties into /tmp/LTL6961416675505041164.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/LTL11046868798535855965.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6961416675505041164.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/LTL1104686...267
Read 1 LTL properties
Checking formula 0 : !(((X(!((X(X(G("(p153==1)"))))||(F("(p1346==1)")))))U(X(G("(p604==1)")))))
Formula 0 simplified : !(X!(XXG"(p153==1)" | F"(p1346==1)") U XG"(p604==1)")
Detected timeout of ITS tools.
[2022-05-19 12:42:24] [INFO ] Flatten gal took : 45 ms
[2022-05-19 12:42:24] [INFO ] Applying decomposition
[2022-05-19 12:42:24] [INFO ] Flatten gal took : 46 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/graph5516613854447970633.txt' '-o' '/tmp/graph5516613854447970633.bin' '-w' '/tmp/graph5516613854447970633.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5516613854447970633.bin' '-l' '-1' '-v' '-w' '/tmp/graph5516613854447970633.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:42:24] [INFO ] Decomposing Gal with order
[2022-05-19 12:42:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:42:25] [INFO ] Removed a total of 396 redundant transitions.
[2022-05-19 12:42:25] [INFO ] Flatten gal took : 103 ms
[2022-05-19 12:42:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2022-05-19 12:42:25] [INFO ] Time to serialize gal into /tmp/LTL2701398580432858393.gal : 33 ms
[2022-05-19 12:42:25] [INFO ] Time to serialize properties into /tmp/LTL15905409877048258877.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/LTL2701398580432858393.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15905409877048258877.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/LTL2701398...246
Read 1 LTL properties
Checking formula 0 : !(((X(!((X(X(G("(i3.i5.u56.p153==1)"))))||(F("(i18.i6.u424.p1346==1)")))))U(X(G("(i10.i2.u196.p604==1)")))))
Formula 0 simplified : !(X!(XXG"(i3.i5.u56.p153==1)" | F"(i18.i6.u424.p1346==1)") U XG"(i10.i2.u196.p604==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14908495075003652335
[2022-05-19 12:42:40] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14908495075003652335
Running compilation step : cd /tmp/ltsmin14908495075003652335;'/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/ltsmin14908495075003652335;'/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/ltsmin14908495075003652335;'/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)
Treatment of property ShieldIIPt-PT-040B-LTLFireability-06 finished in 224502 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(G((G(p0)||p1))))))'
Support contains 5 out of 2367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2367/2367 places, 2167/2167 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2361 transition count 2161
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2361 transition count 2161
Applied a total of 12 rules in 278 ms. Remains 2361 /2367 variables (removed 6) and now considering 2161/2167 (removed 6) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:42:43] [INFO ] Computed 361 place invariants in 7 ms
[2022-05-19 12:42:44] [INFO ] Implicit Places using invariants in 781 ms returned []
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:42:44] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:42:46] [INFO ] Implicit Places using invariants and state equation in 2166 ms returned []
Implicit Place search using SMT with State Equation took 2950 ms to find 0 implicit places.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:42:46] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:42:47] [INFO ] Dead Transitions using invariants and state equation in 1204 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2367 places, 2161/2167 transitions.
Finished structural reductions, in 1 iterations. Remains : 2361/2367 places, 2161/2167 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (EQ s1259 0) (EQ s959 0)), p1:(AND (EQ s1861 1) (EQ s1872 1) (EQ s1898 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 657 ms.
Product exploration explored 100000 steps with 0 reset in 964 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 138027 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 138027 steps, saw 87618 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:42:53] [INFO ] Computed 361 place invariants in 13 ms
[2022-05-19 12:42:53] [INFO ] After 257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:42:53] [INFO ] [Nat]Absence check using 361 positive place invariants in 119 ms returned sat
[2022-05-19 12:42:54] [INFO ] After 1157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:42:55] [INFO ] Deduced a trap composed of 18 places in 434 ms of which 1 ms to minimize.
[2022-05-19 12:42:55] [INFO ] Deduced a trap composed of 34 places in 438 ms of which 1 ms to minimize.
[2022-05-19 12:42:56] [INFO ] Deduced a trap composed of 23 places in 429 ms of which 1 ms to minimize.
[2022-05-19 12:42:56] [INFO ] Deduced a trap composed of 18 places in 422 ms of which 1 ms to minimize.
[2022-05-19 12:42:57] [INFO ] Deduced a trap composed of 22 places in 433 ms of which 1 ms to minimize.
[2022-05-19 12:42:57] [INFO ] Deduced a trap composed of 28 places in 414 ms of which 1 ms to minimize.
[2022-05-19 12:42:58] [INFO ] Deduced a trap composed of 25 places in 410 ms of which 1 ms to minimize.
[2022-05-19 12:42:58] [INFO ] Deduced a trap composed of 18 places in 410 ms of which 1 ms to minimize.
[2022-05-19 12:42:59] [INFO ] Deduced a trap composed of 23 places in 396 ms of which 1 ms to minimize.
[2022-05-19 12:42:59] [INFO ] Deduced a trap composed of 31 places in 390 ms of which 1 ms to minimize.
[2022-05-19 12:43:00] [INFO ] Deduced a trap composed of 25 places in 381 ms of which 1 ms to minimize.
[2022-05-19 12:43:00] [INFO ] Deduced a trap composed of 24 places in 382 ms of which 1 ms to minimize.
[2022-05-19 12:43:01] [INFO ] Deduced a trap composed of 31 places in 371 ms of which 1 ms to minimize.
[2022-05-19 12:43:01] [INFO ] Deduced a trap composed of 30 places in 366 ms of which 1 ms to minimize.
[2022-05-19 12:43:02] [INFO ] Deduced a trap composed of 22 places in 359 ms of which 1 ms to minimize.
[2022-05-19 12:43:02] [INFO ] Deduced a trap composed of 28 places in 340 ms of which 1 ms to minimize.
[2022-05-19 12:43:02] [INFO ] Deduced a trap composed of 34 places in 347 ms of which 1 ms to minimize.
[2022-05-19 12:43:03] [INFO ] Deduced a trap composed of 36 places in 330 ms of which 1 ms to minimize.
[2022-05-19 12:43:03] [INFO ] Deduced a trap composed of 24 places in 333 ms of which 1 ms to minimize.
[2022-05-19 12:43:04] [INFO ] Deduced a trap composed of 31 places in 331 ms of which 1 ms to minimize.
[2022-05-19 12:43:04] [INFO ] Deduced a trap composed of 29 places in 319 ms of which 1 ms to minimize.
[2022-05-19 12:43:04] [INFO ] Deduced a trap composed of 26 places in 316 ms of which 1 ms to minimize.
[2022-05-19 12:43:05] [INFO ] Deduced a trap composed of 36 places in 313 ms of which 1 ms to minimize.
[2022-05-19 12:43:05] [INFO ] Deduced a trap composed of 33 places in 316 ms of which 0 ms to minimize.
[2022-05-19 12:43:06] [INFO ] Deduced a trap composed of 37 places in 306 ms of which 1 ms to minimize.
[2022-05-19 12:43:06] [INFO ] Deduced a trap composed of 37 places in 298 ms of which 1 ms to minimize.
[2022-05-19 12:43:06] [INFO ] Deduced a trap composed of 32 places in 307 ms of which 1 ms to minimize.
[2022-05-19 12:43:07] [INFO ] Deduced a trap composed of 44 places in 284 ms of which 0 ms to minimize.
[2022-05-19 12:43:07] [INFO ] Deduced a trap composed of 38 places in 277 ms of which 1 ms to minimize.
[2022-05-19 12:43:07] [INFO ] Deduced a trap composed of 24 places in 278 ms of which 1 ms to minimize.
[2022-05-19 12:43:08] [INFO ] Deduced a trap composed of 39 places in 274 ms of which 1 ms to minimize.
[2022-05-19 12:43:08] [INFO ] Deduced a trap composed of 38 places in 276 ms of which 1 ms to minimize.
[2022-05-19 12:43:08] [INFO ] Deduced a trap composed of 38 places in 280 ms of which 1 ms to minimize.
[2022-05-19 12:43:09] [INFO ] Deduced a trap composed of 48 places in 265 ms of which 0 ms to minimize.
[2022-05-19 12:43:09] [INFO ] Deduced a trap composed of 45 places in 258 ms of which 0 ms to minimize.
[2022-05-19 12:43:09] [INFO ] Deduced a trap composed of 43 places in 254 ms of which 0 ms to minimize.
[2022-05-19 12:43:10] [INFO ] Deduced a trap composed of 41 places in 251 ms of which 1 ms to minimize.
[2022-05-19 12:43:10] [INFO ] Deduced a trap composed of 43 places in 245 ms of which 1 ms to minimize.
[2022-05-19 12:43:10] [INFO ] Deduced a trap composed of 40 places in 260 ms of which 1 ms to minimize.
[2022-05-19 12:43:11] [INFO ] Deduced a trap composed of 42 places in 241 ms of which 0 ms to minimize.
[2022-05-19 12:43:11] [INFO ] Deduced a trap composed of 39 places in 238 ms of which 1 ms to minimize.
[2022-05-19 12:43:11] [INFO ] Deduced a trap composed of 51 places in 236 ms of which 0 ms to minimize.
[2022-05-19 12:43:12] [INFO ] Deduced a trap composed of 43 places in 223 ms of which 1 ms to minimize.
[2022-05-19 12:43:12] [INFO ] Deduced a trap composed of 49 places in 217 ms of which 1 ms to minimize.
[2022-05-19 12:43:12] [INFO ] Deduced a trap composed of 41 places in 213 ms of which 1 ms to minimize.
[2022-05-19 12:43:13] [INFO ] Deduced a trap composed of 51 places in 204 ms of which 1 ms to minimize.
[2022-05-19 12:43:13] [INFO ] Deduced a trap composed of 53 places in 201 ms of which 0 ms to minimize.
[2022-05-19 12:43:13] [INFO ] Deduced a trap composed of 50 places in 204 ms of which 1 ms to minimize.
[2022-05-19 12:43:13] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 1 ms to minimize.
[2022-05-19 12:43:14] [INFO ] Deduced a trap composed of 50 places in 195 ms of which 1 ms to minimize.
[2022-05-19 12:43:14] [INFO ] Deduced a trap composed of 46 places in 182 ms of which 1 ms to minimize.
[2022-05-19 12:43:14] [INFO ] Deduced a trap composed of 48 places in 179 ms of which 1 ms to minimize.
[2022-05-19 12:43:14] [INFO ] Deduced a trap composed of 50 places in 199 ms of which 1 ms to minimize.
[2022-05-19 12:43:15] [INFO ] Deduced a trap composed of 50 places in 184 ms of which 1 ms to minimize.
[2022-05-19 12:43:15] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 1 ms to minimize.
[2022-05-19 12:43:15] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 1 ms to minimize.
[2022-05-19 12:43:15] [INFO ] Deduced a trap composed of 55 places in 172 ms of which 1 ms to minimize.
[2022-05-19 12:43:16] [INFO ] Deduced a trap composed of 51 places in 153 ms of which 1 ms to minimize.
[2022-05-19 12:43:16] [INFO ] Deduced a trap composed of 53 places in 152 ms of which 1 ms to minimize.
[2022-05-19 12:43:16] [INFO ] Deduced a trap composed of 58 places in 149 ms of which 0 ms to minimize.
[2022-05-19 12:43:16] [INFO ] Deduced a trap composed of 54 places in 162 ms of which 1 ms to minimize.
[2022-05-19 12:43:17] [INFO ] Deduced a trap composed of 56 places in 148 ms of which 1 ms to minimize.
[2022-05-19 12:43:17] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 1 ms to minimize.
[2022-05-19 12:43:17] [INFO ] Trap strengthening (SAT) tested/added 64/63 trap constraints in 22497 ms
[2022-05-19 12:43:17] [INFO ] After 23712ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2022-05-19 12:43:17] [INFO ] After 24201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 2 out of 2361 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Drop transitions removed 476 transitions
Trivial Post-agglo rules discarded 476 transitions
Performed 476 trivial Post agglomeration. Transition count delta: 476
Iterating post reduction 0 with 476 rules applied. Total rules applied 476 place count 2361 transition count 1685
Reduce places removed 476 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 477 rules applied. Total rules applied 953 place count 1885 transition count 1684
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 954 place count 1884 transition count 1684
Performed 320 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 320 Pre rules applied. Total rules applied 954 place count 1884 transition count 1364
Deduced a syphon composed of 320 places in 2 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 3 with 640 rules applied. Total rules applied 1594 place count 1564 transition count 1364
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 3 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 3 with 1362 rules applied. Total rules applied 2956 place count 883 transition count 683
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2957 place count 883 transition count 682
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 2959 place count 882 transition count 681
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
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 3161 place count 781 transition count 746
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 3193 place count 765 transition count 757
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3194 place count 765 transition count 756
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3234 place count 765 transition count 756
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3235 place count 764 transition count 755
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3237 place count 762 transition count 755
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3237 place count 762 transition count 754
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3239 place count 761 transition count 754
Applied a total of 3239 rules in 358 ms. Remains 761 /2361 variables (removed 1600) and now considering 754/2161 (removed 1407) transitions.
Finished structural reductions, in 1 iterations. Remains : 761/2361 places, 754/2161 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 242388 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 242388 steps, saw 154756 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 761 cols
[2022-05-19 12:43:20] [INFO ] Computed 359 place invariants in 3 ms
[2022-05-19 12:43:21] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:43:21] [INFO ] [Nat]Absence check using 359 positive place invariants in 43 ms returned sat
[2022-05-19 12:43:21] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:43:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:43:21] [INFO ] After 26ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:43:21] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-05-19 12:43:21] [INFO ] After 489ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 761 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 761/761 places, 754/754 transitions.
Applied a total of 0 rules in 12 ms. Remains 761 /761 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 761/761 places, 754/754 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 761/761 places, 754/754 transitions.
Applied a total of 0 rules in 11 ms. Remains 761 /761 variables (removed 0) and now considering 754/754 (removed 0) transitions.
// Phase 1: matrix 754 rows 761 cols
[2022-05-19 12:43:21] [INFO ] Computed 359 place invariants in 3 ms
[2022-05-19 12:43:22] [INFO ] Implicit Places using invariants in 406 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 407 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 760/761 places, 754/754 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 759 transition count 753
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 759 transition count 753
Applied a total of 2 rules in 21 ms. Remains 759 /760 variables (removed 1) and now considering 753/754 (removed 1) transitions.
// Phase 1: matrix 753 rows 759 cols
[2022-05-19 12:43:22] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-19 12:43:22] [INFO ] Implicit Places using invariants in 392 ms returned []
// Phase 1: matrix 753 rows 759 cols
[2022-05-19 12:43:22] [INFO ] Computed 358 place invariants in 4 ms
[2022-05-19 12:43:23] [INFO ] Implicit Places using invariants and state equation in 726 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 759/761 places, 753/754 transitions.
Finished structural reductions, in 2 iterations. Remains : 759/761 places, 753/754 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 229263 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 229263 steps, saw 146475 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 753 rows 759 cols
[2022-05-19 12:43:26] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-19 12:43:26] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:43:26] [INFO ] [Nat]Absence check using 358 positive place invariants in 48 ms returned sat
[2022-05-19 12:43:26] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:43:26] [INFO ] After 322ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-05-19 12:43:26] [INFO ] After 503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 759 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 759/759 places, 753/753 transitions.
Applied a total of 0 rules in 12 ms. Remains 759 /759 variables (removed 0) and now considering 753/753 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 759/759 places, 753/753 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 759/759 places, 753/753 transitions.
Applied a total of 0 rules in 12 ms. Remains 759 /759 variables (removed 0) and now considering 753/753 (removed 0) transitions.
// Phase 1: matrix 753 rows 759 cols
[2022-05-19 12:43:26] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-19 12:43:27] [INFO ] Implicit Places using invariants in 393 ms returned []
// Phase 1: matrix 753 rows 759 cols
[2022-05-19 12:43:27] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:43:28] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 1149 ms to find 0 implicit places.
[2022-05-19 12:43:28] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 753 rows 759 cols
[2022-05-19 12:43:28] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-19 12:43:28] [INFO ] Dead Transitions using invariants and state equation in 359 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 759/759 places, 753/753 transitions.
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 0 with 79 rules applied. Total rules applied 79 place count 759 transition count 753
Applied a total of 79 rules in 25 ms. Remains 759 /759 variables (removed 0) and now considering 753/753 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 753 rows 759 cols
[2022-05-19 12:43:28] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-19 12:43:28] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:43:28] [INFO ] [Nat]Absence check using 358 positive place invariants in 46 ms returned sat
[2022-05-19 12:43:28] [INFO ] After 266ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:43:28] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-19 12:43:29] [INFO ] After 67ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:43:29] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-05-19 12:43:29] [INFO ] After 579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:43:29] [INFO ] Flatten gal took : 24 ms
[2022-05-19 12:43:29] [INFO ] Flatten gal took : 25 ms
[2022-05-19 12:43:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16250200441721923319.gal : 4 ms
[2022-05-19 12:43:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1167333185175678345.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14899749662428968327;'/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/ReachabilityCardinality16250200441721923319.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1167333185175678345.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...320
Loading property file /tmp/ReachabilityCardinality1167333185175678345.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 70
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :70 after 132
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :132 after 282
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :282 after 4672
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4672 after 61517
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :61517 after 7.356e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7.356e+06 after 5.4628e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5.4628e+07 after 3.63194e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.63194e+10 after 2.55816e+15
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.55816e+15 after 9.72098e+18
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :9.72098e+18 after 2.54726e+27
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.54726e+27 after 7.20686e+37
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :7.20686e+37 after 1.43454e+50
Detected timeout of ITS tools.
[2022-05-19 12:43:44] [INFO ] Flatten gal took : 31 ms
[2022-05-19 12:43:44] [INFO ] Applying decomposition
[2022-05-19 12:43:44] [INFO ] Flatten gal took : 24 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/graph4911918898853245767.txt' '-o' '/tmp/graph4911918898853245767.bin' '-w' '/tmp/graph4911918898853245767.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4911918898853245767.bin' '-l' '-1' '-v' '-w' '/tmp/graph4911918898853245767.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:43:44] [INFO ] Decomposing Gal with order
[2022-05-19 12:43:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:43:44] [INFO ] Removed a total of 427 redundant transitions.
[2022-05-19 12:43:44] [INFO ] Flatten gal took : 42 ms
[2022-05-19 12:43:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2022-05-19 12:43:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5232278558907447463.gal : 4 ms
[2022-05-19 12:43:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2887038358590123147.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14899749662428968327;'/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/ReachabilityCardinality5232278558907447463.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2887038358590123147.prop' '--nowitness'
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...298
Loading property file /tmp/ReachabilityCardinality2887038358590123147.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :30720 after 4.00333e+07
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
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\_mod\_flat,6.41884e+41,1.58341,48856,1620,123,78192,829,802,238593,72,13180,0
Total reachable state count : 6.418837415310361829670528946770792824177e+41
Verifying 1 reachability properties.
Reachability property apf0 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
apf0,1.13261e+40,1.58802,49120,1004,120,78192,829,809,238593,75,13180,0
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 2361 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Applied a total of 0 rules in 128 ms. Remains 2361 /2361 variables (removed 0) and now considering 2161/2161 (removed 0) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:43:46] [INFO ] Computed 361 place invariants in 12 ms
[2022-05-19 12:43:47] [INFO ] Implicit Places using invariants in 647 ms returned []
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:43:47] [INFO ] Computed 361 place invariants in 13 ms
[2022-05-19 12:43:49] [INFO ] Implicit Places using invariants and state equation in 2209 ms returned []
Implicit Place search using SMT with State Equation took 2860 ms to find 0 implicit places.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:43:49] [INFO ] Computed 361 place invariants in 10 ms
[2022-05-19 12:43:50] [INFO ] Dead Transitions using invariants and state equation in 1223 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2361/2361 places, 2161/2161 transitions.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 141000 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 141000 steps, saw 89132 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:43:54] [INFO ] Computed 361 place invariants in 6 ms
[2022-05-19 12:43:54] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:43:54] [INFO ] [Nat]Absence check using 361 positive place invariants in 119 ms returned sat
[2022-05-19 12:43:55] [INFO ] After 1127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:43:56] [INFO ] Deduced a trap composed of 18 places in 446 ms of which 2 ms to minimize.
[2022-05-19 12:43:56] [INFO ] Deduced a trap composed of 34 places in 438 ms of which 4 ms to minimize.
[2022-05-19 12:43:57] [INFO ] Deduced a trap composed of 23 places in 424 ms of which 2 ms to minimize.
[2022-05-19 12:43:57] [INFO ] Deduced a trap composed of 18 places in 406 ms of which 1 ms to minimize.
[2022-05-19 12:43:58] [INFO ] Deduced a trap composed of 22 places in 413 ms of which 2 ms to minimize.
[2022-05-19 12:43:58] [INFO ] Deduced a trap composed of 28 places in 402 ms of which 1 ms to minimize.
[2022-05-19 12:43:59] [INFO ] Deduced a trap composed of 25 places in 387 ms of which 1 ms to minimize.
[2022-05-19 12:43:59] [INFO ] Deduced a trap composed of 18 places in 402 ms of which 1 ms to minimize.
[2022-05-19 12:44:00] [INFO ] Deduced a trap composed of 23 places in 381 ms of which 1 ms to minimize.
[2022-05-19 12:44:00] [INFO ] Deduced a trap composed of 31 places in 369 ms of which 1 ms to minimize.
[2022-05-19 12:44:01] [INFO ] Deduced a trap composed of 25 places in 386 ms of which 1 ms to minimize.
[2022-05-19 12:44:01] [INFO ] Deduced a trap composed of 24 places in 379 ms of which 1 ms to minimize.
[2022-05-19 12:44:01] [INFO ] Deduced a trap composed of 31 places in 377 ms of which 1 ms to minimize.
[2022-05-19 12:44:02] [INFO ] Deduced a trap composed of 30 places in 381 ms of which 1 ms to minimize.
[2022-05-19 12:44:02] [INFO ] Deduced a trap composed of 22 places in 351 ms of which 1 ms to minimize.
[2022-05-19 12:44:03] [INFO ] Deduced a trap composed of 28 places in 340 ms of which 0 ms to minimize.
[2022-05-19 12:44:03] [INFO ] Deduced a trap composed of 34 places in 333 ms of which 1 ms to minimize.
[2022-05-19 12:44:04] [INFO ] Deduced a trap composed of 36 places in 328 ms of which 1 ms to minimize.
[2022-05-19 12:44:04] [INFO ] Deduced a trap composed of 24 places in 327 ms of which 1 ms to minimize.
[2022-05-19 12:44:04] [INFO ] Deduced a trap composed of 31 places in 328 ms of which 1 ms to minimize.
[2022-05-19 12:44:05] [INFO ] Deduced a trap composed of 29 places in 326 ms of which 1 ms to minimize.
[2022-05-19 12:44:05] [INFO ] Deduced a trap composed of 26 places in 329 ms of which 1 ms to minimize.
[2022-05-19 12:44:06] [INFO ] Deduced a trap composed of 36 places in 310 ms of which 1 ms to minimize.
[2022-05-19 12:44:06] [INFO ] Deduced a trap composed of 33 places in 308 ms of which 1 ms to minimize.
[2022-05-19 12:44:06] [INFO ] Deduced a trap composed of 37 places in 322 ms of which 1 ms to minimize.
[2022-05-19 12:44:07] [INFO ] Deduced a trap composed of 37 places in 297 ms of which 1 ms to minimize.
[2022-05-19 12:44:07] [INFO ] Deduced a trap composed of 32 places in 285 ms of which 1 ms to minimize.
[2022-05-19 12:44:07] [INFO ] Deduced a trap composed of 44 places in 277 ms of which 1 ms to minimize.
[2022-05-19 12:44:08] [INFO ] Deduced a trap composed of 38 places in 273 ms of which 1 ms to minimize.
[2022-05-19 12:44:08] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 1 ms to minimize.
[2022-05-19 12:44:09] [INFO ] Deduced a trap composed of 39 places in 271 ms of which 1 ms to minimize.
[2022-05-19 12:44:09] [INFO ] Deduced a trap composed of 38 places in 266 ms of which 0 ms to minimize.
[2022-05-19 12:44:09] [INFO ] Deduced a trap composed of 38 places in 267 ms of which 1 ms to minimize.
[2022-05-19 12:44:10] [INFO ] Deduced a trap composed of 48 places in 258 ms of which 1 ms to minimize.
[2022-05-19 12:44:10] [INFO ] Deduced a trap composed of 45 places in 253 ms of which 1 ms to minimize.
[2022-05-19 12:44:10] [INFO ] Deduced a trap composed of 43 places in 256 ms of which 0 ms to minimize.
[2022-05-19 12:44:11] [INFO ] Deduced a trap composed of 41 places in 240 ms of which 0 ms to minimize.
[2022-05-19 12:44:11] [INFO ] Deduced a trap composed of 43 places in 238 ms of which 1 ms to minimize.
[2022-05-19 12:44:11] [INFO ] Deduced a trap composed of 40 places in 241 ms of which 1 ms to minimize.
[2022-05-19 12:44:11] [INFO ] Deduced a trap composed of 42 places in 232 ms of which 1 ms to minimize.
[2022-05-19 12:44:12] [INFO ] Deduced a trap composed of 39 places in 225 ms of which 1 ms to minimize.
[2022-05-19 12:44:12] [INFO ] Deduced a trap composed of 51 places in 217 ms of which 0 ms to minimize.
[2022-05-19 12:44:12] [INFO ] Deduced a trap composed of 43 places in 215 ms of which 1 ms to minimize.
[2022-05-19 12:44:13] [INFO ] Deduced a trap composed of 49 places in 210 ms of which 1 ms to minimize.
[2022-05-19 12:44:13] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 1 ms to minimize.
[2022-05-19 12:44:13] [INFO ] Deduced a trap composed of 51 places in 206 ms of which 1 ms to minimize.
[2022-05-19 12:44:13] [INFO ] Deduced a trap composed of 53 places in 204 ms of which 1 ms to minimize.
[2022-05-19 12:44:14] [INFO ] Deduced a trap composed of 50 places in 200 ms of which 1 ms to minimize.
[2022-05-19 12:44:14] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 0 ms to minimize.
[2022-05-19 12:44:14] [INFO ] Deduced a trap composed of 50 places in 203 ms of which 0 ms to minimize.
[2022-05-19 12:44:15] [INFO ] Deduced a trap composed of 46 places in 187 ms of which 0 ms to minimize.
[2022-05-19 12:44:15] [INFO ] Deduced a trap composed of 48 places in 179 ms of which 1 ms to minimize.
[2022-05-19 12:44:15] [INFO ] Deduced a trap composed of 50 places in 174 ms of which 1 ms to minimize.
[2022-05-19 12:44:15] [INFO ] Deduced a trap composed of 50 places in 166 ms of which 1 ms to minimize.
[2022-05-19 12:44:16] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 0 ms to minimize.
[2022-05-19 12:44:16] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 0 ms to minimize.
[2022-05-19 12:44:16] [INFO ] Deduced a trap composed of 55 places in 156 ms of which 1 ms to minimize.
[2022-05-19 12:44:16] [INFO ] Deduced a trap composed of 51 places in 149 ms of which 1 ms to minimize.
[2022-05-19 12:44:16] [INFO ] Deduced a trap composed of 53 places in 160 ms of which 1 ms to minimize.
[2022-05-19 12:44:17] [INFO ] Deduced a trap composed of 58 places in 144 ms of which 0 ms to minimize.
[2022-05-19 12:44:17] [INFO ] Deduced a trap composed of 54 places in 148 ms of which 1 ms to minimize.
[2022-05-19 12:44:17] [INFO ] Deduced a trap composed of 56 places in 135 ms of which 0 ms to minimize.
[2022-05-19 12:44:17] [INFO ] Deduced a trap composed of 56 places in 131 ms of which 0 ms to minimize.
[2022-05-19 12:44:17] [INFO ] Trap strengthening (SAT) tested/added 64/63 trap constraints in 22153 ms
[2022-05-19 12:44:18] [INFO ] After 23343ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 86 ms.
[2022-05-19 12:44:18] [INFO ] After 23808ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 2 out of 2361 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Drop transitions removed 476 transitions
Trivial Post-agglo rules discarded 476 transitions
Performed 476 trivial Post agglomeration. Transition count delta: 476
Iterating post reduction 0 with 476 rules applied. Total rules applied 476 place count 2361 transition count 1685
Reduce places removed 476 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 477 rules applied. Total rules applied 953 place count 1885 transition count 1684
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 954 place count 1884 transition count 1684
Performed 320 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 320 Pre rules applied. Total rules applied 954 place count 1884 transition count 1364
Deduced a syphon composed of 320 places in 1 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 3 with 640 rules applied. Total rules applied 1594 place count 1564 transition count 1364
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 1 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 3 with 1362 rules applied. Total rules applied 2956 place count 883 transition count 683
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2957 place count 883 transition count 682
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 2959 place count 882 transition count 681
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
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 3161 place count 781 transition count 746
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 3193 place count 765 transition count 757
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3194 place count 765 transition count 756
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3234 place count 765 transition count 756
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3235 place count 764 transition count 755
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3237 place count 762 transition count 755
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3237 place count 762 transition count 754
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3239 place count 761 transition count 754
Applied a total of 3239 rules in 291 ms. Remains 761 /2361 variables (removed 1600) and now considering 754/2161 (removed 1407) transitions.
Finished structural reductions, in 1 iterations. Remains : 761/2361 places, 754/2161 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 227634 steps, run timeout after 3027 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 227634 steps, saw 145335 distinct states, run finished after 3027 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 761 cols
[2022-05-19 12:44:21] [INFO ] Computed 359 place invariants in 1 ms
[2022-05-19 12:44:21] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:44:21] [INFO ] [Nat]Absence check using 359 positive place invariants in 46 ms returned sat
[2022-05-19 12:44:22] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:44:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:44:22] [INFO ] After 28ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:44:22] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-05-19 12:44:22] [INFO ] After 486ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 761 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 761/761 places, 754/754 transitions.
Applied a total of 0 rules in 11 ms. Remains 761 /761 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 761/761 places, 754/754 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 761/761 places, 754/754 transitions.
Applied a total of 0 rules in 11 ms. Remains 761 /761 variables (removed 0) and now considering 754/754 (removed 0) transitions.
// Phase 1: matrix 754 rows 761 cols
[2022-05-19 12:44:22] [INFO ] Computed 359 place invariants in 1 ms
[2022-05-19 12:44:22] [INFO ] Implicit Places using invariants in 392 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 394 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 760/761 places, 754/754 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 759 transition count 753
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 759 transition count 753
Applied a total of 2 rules in 20 ms. Remains 759 /760 variables (removed 1) and now considering 753/754 (removed 1) transitions.
// Phase 1: matrix 753 rows 759 cols
[2022-05-19 12:44:22] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:44:22] [INFO ] Implicit Places using invariants in 385 ms returned []
// Phase 1: matrix 753 rows 759 cols
[2022-05-19 12:44:22] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:44:23] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 1134 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 759/761 places, 753/754 transitions.
Finished structural reductions, in 2 iterations. Remains : 759/761 places, 753/754 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 234018 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 234018 steps, saw 149308 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 753 rows 759 cols
[2022-05-19 12:44:26] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-19 12:44:26] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:44:27] [INFO ] [Nat]Absence check using 358 positive place invariants in 46 ms returned sat
[2022-05-19 12:44:27] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:44:27] [INFO ] After 307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2022-05-19 12:44:27] [INFO ] After 507ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 759 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 759/759 places, 753/753 transitions.
Applied a total of 0 rules in 31 ms. Remains 759 /759 variables (removed 0) and now considering 753/753 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 759/759 places, 753/753 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 759/759 places, 753/753 transitions.
Applied a total of 0 rules in 12 ms. Remains 759 /759 variables (removed 0) and now considering 753/753 (removed 0) transitions.
// Phase 1: matrix 753 rows 759 cols
[2022-05-19 12:44:27] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:44:27] [INFO ] Implicit Places using invariants in 384 ms returned []
// Phase 1: matrix 753 rows 759 cols
[2022-05-19 12:44:27] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:44:28] [INFO ] Implicit Places using invariants and state equation in 734 ms returned []
Implicit Place search using SMT with State Equation took 1120 ms to find 0 implicit places.
[2022-05-19 12:44:28] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 753 rows 759 cols
[2022-05-19 12:44:28] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:44:28] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 759/759 places, 753/753 transitions.
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 0 with 79 rules applied. Total rules applied 79 place count 759 transition count 753
Applied a total of 79 rules in 22 ms. Remains 759 /759 variables (removed 0) and now considering 753/753 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 753 rows 759 cols
[2022-05-19 12:44:28] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-19 12:44:29] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:44:29] [INFO ] [Nat]Absence check using 358 positive place invariants in 48 ms returned sat
[2022-05-19 12:44:29] [INFO ] After 266ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:44:29] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-19 12:44:29] [INFO ] After 67ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:44:29] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2022-05-19 12:44:29] [INFO ] After 591ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 12:44:29] [INFO ] Flatten gal took : 24 ms
[2022-05-19 12:44:29] [INFO ] Flatten gal took : 33 ms
[2022-05-19 12:44:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1984976839138500964.gal : 3 ms
[2022-05-19 12:44:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5584336376606512657.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms7859650016447329665;'/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/ReachabilityCardinality1984976839138500964.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5584336376606512657.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/ReachabilityCardinality5584336376606512657.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 70
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :70 after 132
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :132 after 282
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :282 after 4672
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4672 after 61517
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :61517 after 7.356e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7.356e+06 after 5.4628e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5.4628e+07 after 3.63194e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.63194e+10 after 2.55816e+15
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.55816e+15 after 9.72098e+18
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :9.72098e+18 after 2.54726e+27
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.54726e+27 after 7.20686e+37
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :7.20686e+37 after 1.43454e+50
Detected timeout of ITS tools.
[2022-05-19 12:44:44] [INFO ] Flatten gal took : 24 ms
[2022-05-19 12:44:44] [INFO ] Applying decomposition
[2022-05-19 12:44:44] [INFO ] Flatten gal took : 24 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/graph17692420562567138722.txt' '-o' '/tmp/graph17692420562567138722.bin' '-w' '/tmp/graph17692420562567138722.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17692420562567138722.bin' '-l' '-1' '-v' '-w' '/tmp/graph17692420562567138722.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:44:44] [INFO ] Decomposing Gal with order
[2022-05-19 12:44:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:44:44] [INFO ] Removed a total of 427 redundant transitions.
[2022-05-19 12:44:44] [INFO ] Flatten gal took : 38 ms
[2022-05-19 12:44:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2022-05-19 12:44:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17552255563129940739.gal : 5 ms
[2022-05-19 12:44:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7079011852827677948.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms7859650016447329665;'/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/ReachabilityCardinality17552255563129940739.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7079011852827677948.prop' '--nowitness'
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...299
Loading property file /tmp/ReachabilityCardinality7079011852827677948.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 30720
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
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\_mod\_flat,4.76142e+50,1.4702,47980,1707,126,75632,806,785,208156,72,10866,0
Total reachable state count : 4.76142093529548260085869532556122047871e+50
Verifying 1 reachability properties.
Reachability property apf0 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
apf0,1.22888e+48,1.47473,48244,1181,120,75632,806,794,208156,75,10866,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 695 ms.
Product exploration explored 100000 steps with 0 reset in 907 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 2361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Performed 477 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2361 transition count 2161
Performed 162 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 162 Pre rules applied. Total rules applied 477 place count 2361 transition count 2282
Deduced a syphon composed of 639 places in 2 ms
Iterating global reduction 1 with 162 rules applied. Total rules applied 639 place count 2361 transition count 2282
Performed 799 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1438 places in 2 ms
Iterating global reduction 1 with 799 rules applied. Total rules applied 1438 place count 2361 transition count 2283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1439 place count 2361 transition count 2282
Renaming transitions due to excessive name length > 1024 char.
Discarding 318 places :
Symmetric choice reduction at 2 with 318 rule applications. Total rules 1757 place count 2043 transition count 1964
Deduced a syphon composed of 1120 places in 1 ms
Iterating global reduction 2 with 318 rules applied. Total rules applied 2075 place count 2043 transition count 1964
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1121 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2076 place count 2043 transition count 1964
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2078 place count 2041 transition count 1962
Deduced a syphon composed of 1119 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2080 place count 2041 transition count 1962
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -521
Deduced a syphon composed of 1220 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2181 place count 2041 transition count 2483
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2282 place count 1940 transition count 2281
Deduced a syphon composed of 1119 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2383 place count 1940 transition count 2281
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: -302
Deduced a syphon composed of 1175 places in 2 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 2439 place count 1940 transition count 2583
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 2495 place count 1884 transition count 2471
Deduced a syphon composed of 1119 places in 2 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 2551 place count 1884 transition count 2471
Deduced a syphon composed of 1119 places in 2 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 2560 place count 1884 transition count 2462
Deduced a syphon composed of 1119 places in 2 ms
Applied a total of 2560 rules in 903 ms. Remains 1884 /2361 variables (removed 477) and now considering 2462/2161 (removed -301) transitions.
[2022-05-19 12:44:49] [INFO ] Redundant transitions in 46 ms returned []
// Phase 1: matrix 2462 rows 1884 cols
[2022-05-19 12:44:49] [INFO ] Computed 361 place invariants in 23 ms
[2022-05-19 12:44:50] [INFO ] Dead Transitions using invariants and state equation in 1115 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1884/2361 places, 2462/2161 transitions.
Finished structural reductions, in 1 iterations. Remains : 1884/2361 places, 2462/2161 transitions.
Product exploration explored 100000 steps with 0 reset in 707 ms.
Product exploration explored 100000 steps with 0 reset in 905 ms.
Built C files in :
/tmp/ltsmin17443260173799359842
[2022-05-19 12:44:52] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17443260173799359842
Running compilation step : cd /tmp/ltsmin17443260173799359842;'/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/ltsmin17443260173799359842;'/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/ltsmin17443260173799359842;'/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 2 out of 2361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Applied a total of 0 rules in 118 ms. Remains 2361 /2361 variables (removed 0) and now considering 2161/2161 (removed 0) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:44:55] [INFO ] Computed 361 place invariants in 10 ms
[2022-05-19 12:44:56] [INFO ] Implicit Places using invariants in 634 ms returned []
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:44:56] [INFO ] Computed 361 place invariants in 10 ms
[2022-05-19 12:44:58] [INFO ] Implicit Places using invariants and state equation in 2076 ms returned []
Implicit Place search using SMT with State Equation took 2711 ms to find 0 implicit places.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:44:58] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:44:59] [INFO ] Dead Transitions using invariants and state equation in 1223 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2361/2361 places, 2161/2161 transitions.
Built C files in :
/tmp/ltsmin16759984672528789611
[2022-05-19 12:44:59] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16759984672528789611
Running compilation step : cd /tmp/ltsmin16759984672528789611;'/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/ltsmin16759984672528789611;'/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/ltsmin16759984672528789611;'/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-19 12:45:02] [INFO ] Flatten gal took : 49 ms
[2022-05-19 12:45:02] [INFO ] Flatten gal took : 45 ms
[2022-05-19 12:45:02] [INFO ] Time to serialize gal into /tmp/LTL11743244225563520949.gal : 5 ms
[2022-05-19 12:45:02] [INFO ] Time to serialize properties into /tmp/LTL692105962536076620.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/LTL11743244225563520949.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL692105962536076620.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/LTL1174324...266
Read 1 LTL properties
Checking formula 0 : !((X(G(X(G((G("((p1488==0)||(p1130==0))"))||("(((p2202==1)&&(p2215==1))&&(p2249==1))")))))))
Formula 0 simplified : !XGXG("(((p2202==1)&&(p2215==1))&&(p2249==1))" | G"((p1488==0)||(p1130==0))")
Detected timeout of ITS tools.
[2022-05-19 12:45:17] [INFO ] Flatten gal took : 45 ms
[2022-05-19 12:45:17] [INFO ] Applying decomposition
[2022-05-19 12:45:17] [INFO ] Flatten gal took : 44 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/graph3725378753747366503.txt' '-o' '/tmp/graph3725378753747366503.bin' '-w' '/tmp/graph3725378753747366503.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3725378753747366503.bin' '-l' '-1' '-v' '-w' '/tmp/graph3725378753747366503.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:45:18] [INFO ] Decomposing Gal with order
[2022-05-19 12:45:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:45:18] [INFO ] Removed a total of 402 redundant transitions.
[2022-05-19 12:45:18] [INFO ] Flatten gal took : 84 ms
[2022-05-19 12:45:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2022-05-19 12:45:18] [INFO ] Time to serialize gal into /tmp/LTL15557046100382261.gal : 15 ms
[2022-05-19 12:45:18] [INFO ] Time to serialize properties into /tmp/LTL5000780624520924089.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/LTL15557046100382261.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5000780624520924089.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/LTL1555704...243
Read 1 LTL properties
Checking formula 0 : !((X(G(X(G((G("((i20.i7.u470.p1488==0)||(i15.i6.u360.p1130==0))"))||("(((i31.i0.u694.p2202==1)&&(i31.i2.u698.p2215==1))&&(i31.i6.u706....173
Formula 0 simplified : !XGXG("(((i31.i0.u694.p2202==1)&&(i31.i2.u698.p2215==1))&&(i31.i6.u706.p2249==1))" | G"((i20.i7.u470.p1488==0)||(i15.i6.u360.p1130==...160
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4730760469990466906
[2022-05-19 12:45:33] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4730760469990466906
Running compilation step : cd /tmp/ltsmin4730760469990466906;'/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/ltsmin4730760469990466906;'/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/ltsmin4730760469990466906;'/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)
Treatment of property ShieldIIPt-PT-040B-LTLFireability-08 finished in 173126 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(X(X(X(p0))) U X(p1))&&!(!G(!p2) U p3)))'
Support contains 5 out of 2367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2367/2367 places, 2167/2167 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2362 transition count 2162
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2362 transition count 2162
Applied a total of 10 rules in 261 ms. Remains 2362 /2367 variables (removed 5) and now considering 2162/2167 (removed 5) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:45:36] [INFO ] Computed 361 place invariants in 9 ms
[2022-05-19 12:45:37] [INFO ] Implicit Places using invariants in 683 ms returned []
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:45:37] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:45:39] [INFO ] Implicit Places using invariants and state equation in 1954 ms returned []
Implicit Place search using SMT with State Equation took 2640 ms to find 0 implicit places.
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:45:39] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:45:40] [INFO ] Dead Transitions using invariants and state equation in 1165 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2362/2367 places, 2162/2167 transitions.
Finished structural reductions, in 1 iterations. Remains : 2362/2367 places, 2162/2167 transitions.
Stuttering acceptance computed with spot in 324 ms :[(OR p3 p1), true, p3, p1, (AND p3 p2), (AND p0 p1), p0, (AND p1 p0), p2]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p3, acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND p2 p3), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p3), acceptance={} source=4 dest: 8}], [{ cond=p1, acceptance={} source=5 dest: 6}, { cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=p0, acceptance={} source=6 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 7}], [{ cond=p2, acceptance={} source=8 dest: 1}, { cond=(NOT p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p3:(EQ s1308 1), p2:(AND (EQ s580 1) (EQ s582 1)), p1:(EQ s2212 1), p0:(EQ s655 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 629 ms.
Product exploration explored 100000 steps with 1 reset in 892 ms.
Computed a total of 639 stabilizing places and 639 stable transitions
Computed a total of 639 stabilizing places and 639 stable transitions
Detected a total of 639/2362 stabilizing places and 639/2162 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p3))), (X (NOT p3)), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p2 p3))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p2))), true, (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 832 ms. Reduced automaton from 9 states, 21 edges and 4 AP to 9 states, 17 edges and 4 AP.
Stuttering acceptance computed with spot in 307 ms :[(OR (AND p2 p3) (AND p0 p1)), true, p3, (AND p0 p1), (AND p3 p2), (AND p0 p1), p0, (AND p0 p1), p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:45:44] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:45:44] [INFO ] [Real]Absence check using 361 positive place invariants in 123 ms returned sat
[2022-05-19 12:45:46] [INFO ] After 1955ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 12:45:46] [INFO ] [Nat]Absence check using 361 positive place invariants in 122 ms returned sat
[2022-05-19 12:45:48] [INFO ] After 1554ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-19 12:45:49] [INFO ] Deduced a trap composed of 18 places in 488 ms of which 1 ms to minimize.
[2022-05-19 12:45:49] [INFO ] Deduced a trap composed of 24 places in 494 ms of which 1 ms to minimize.
[2022-05-19 12:45:50] [INFO ] Deduced a trap composed of 43 places in 488 ms of which 1 ms to minimize.
[2022-05-19 12:45:50] [INFO ] Deduced a trap composed of 22 places in 475 ms of which 2 ms to minimize.
[2022-05-19 12:45:51] [INFO ] Deduced a trap composed of 20 places in 497 ms of which 2 ms to minimize.
[2022-05-19 12:45:51] [INFO ] Deduced a trap composed of 19 places in 476 ms of which 1 ms to minimize.
[2022-05-19 12:45:52] [INFO ] Deduced a trap composed of 18 places in 477 ms of which 1 ms to minimize.
[2022-05-19 12:45:52] [INFO ] Deduced a trap composed of 21 places in 461 ms of which 1 ms to minimize.
[2022-05-19 12:45:53] [INFO ] Deduced a trap composed of 26 places in 432 ms of which 1 ms to minimize.
[2022-05-19 12:45:53] [INFO ] Deduced a trap composed of 35 places in 441 ms of which 1 ms to minimize.
[2022-05-19 12:45:54] [INFO ] Deduced a trap composed of 30 places in 426 ms of which 2 ms to minimize.
[2022-05-19 12:45:54] [INFO ] Deduced a trap composed of 26 places in 429 ms of which 1 ms to minimize.
[2022-05-19 12:45:55] [INFO ] Deduced a trap composed of 30 places in 426 ms of which 1 ms to minimize.
[2022-05-19 12:45:55] [INFO ] Deduced a trap composed of 26 places in 420 ms of which 1 ms to minimize.
[2022-05-19 12:45:56] [INFO ] Deduced a trap composed of 23 places in 414 ms of which 1 ms to minimize.
[2022-05-19 12:45:56] [INFO ] Deduced a trap composed of 25 places in 405 ms of which 1 ms to minimize.
[2022-05-19 12:45:57] [INFO ] Deduced a trap composed of 17 places in 398 ms of which 2 ms to minimize.
[2022-05-19 12:45:57] [INFO ] Deduced a trap composed of 28 places in 399 ms of which 2 ms to minimize.
[2022-05-19 12:45:58] [INFO ] Deduced a trap composed of 18 places in 408 ms of which 1 ms to minimize.
[2022-05-19 12:45:58] [INFO ] Deduced a trap composed of 18 places in 400 ms of which 1 ms to minimize.
[2022-05-19 12:45:59] [INFO ] Deduced a trap composed of 32 places in 382 ms of which 1 ms to minimize.
[2022-05-19 12:45:59] [INFO ] Deduced a trap composed of 29 places in 367 ms of which 1 ms to minimize.
[2022-05-19 12:46:00] [INFO ] Deduced a trap composed of 30 places in 365 ms of which 1 ms to minimize.
[2022-05-19 12:46:00] [INFO ] Deduced a trap composed of 24 places in 379 ms of which 1 ms to minimize.
[2022-05-19 12:46:01] [INFO ] Deduced a trap composed of 30 places in 364 ms of which 1 ms to minimize.
[2022-05-19 12:46:01] [INFO ] Deduced a trap composed of 29 places in 354 ms of which 1 ms to minimize.
[2022-05-19 12:46:02] [INFO ] Deduced a trap composed of 29 places in 355 ms of which 1 ms to minimize.
[2022-05-19 12:46:02] [INFO ] Deduced a trap composed of 34 places in 347 ms of which 1 ms to minimize.
[2022-05-19 12:46:02] [INFO ] Deduced a trap composed of 39 places in 358 ms of which 1 ms to minimize.
[2022-05-19 12:46:03] [INFO ] Deduced a trap composed of 27 places in 361 ms of which 1 ms to minimize.
[2022-05-19 12:46:03] [INFO ] Deduced a trap composed of 39 places in 346 ms of which 1 ms to minimize.
[2022-05-19 12:46:04] [INFO ] Deduced a trap composed of 36 places in 344 ms of which 1 ms to minimize.
[2022-05-19 12:46:04] [INFO ] Deduced a trap composed of 36 places in 344 ms of which 1 ms to minimize.
[2022-05-19 12:46:05] [INFO ] Deduced a trap composed of 51 places in 343 ms of which 1 ms to minimize.
[2022-05-19 12:46:05] [INFO ] Deduced a trap composed of 39 places in 339 ms of which 1 ms to minimize.
[2022-05-19 12:46:05] [INFO ] Deduced a trap composed of 42 places in 329 ms of which 1 ms to minimize.
[2022-05-19 12:46:06] [INFO ] Deduced a trap composed of 28 places in 332 ms of which 1 ms to minimize.
[2022-05-19 12:46:06] [INFO ] Deduced a trap composed of 41 places in 323 ms of which 1 ms to minimize.
[2022-05-19 12:46:07] [INFO ] Deduced a trap composed of 27 places in 313 ms of which 1 ms to minimize.
[2022-05-19 12:46:07] [INFO ] Deduced a trap composed of 50 places in 308 ms of which 1 ms to minimize.
[2022-05-19 12:46:07] [INFO ] Deduced a trap composed of 38 places in 302 ms of which 1 ms to minimize.
[2022-05-19 12:46:08] [INFO ] Deduced a trap composed of 40 places in 306 ms of which 1 ms to minimize.
[2022-05-19 12:46:08] [INFO ] Deduced a trap composed of 37 places in 296 ms of which 1 ms to minimize.
[2022-05-19 12:46:08] [INFO ] Deduced a trap composed of 38 places in 301 ms of which 1 ms to minimize.
[2022-05-19 12:46:09] [INFO ] Deduced a trap composed of 50 places in 302 ms of which 1 ms to minimize.
[2022-05-19 12:46:09] [INFO ] Deduced a trap composed of 49 places in 293 ms of which 0 ms to minimize.
[2022-05-19 12:46:10] [INFO ] Deduced a trap composed of 38 places in 292 ms of which 0 ms to minimize.
[2022-05-19 12:46:10] [INFO ] Deduced a trap composed of 37 places in 283 ms of which 0 ms to minimize.
[2022-05-19 12:46:10] [INFO ] Deduced a trap composed of 40 places in 272 ms of which 1 ms to minimize.
[2022-05-19 12:46:11] [INFO ] Deduced a trap composed of 56 places in 281 ms of which 0 ms to minimize.
[2022-05-19 12:46:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 12:46:11] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 578 ms.
Support contains 5 out of 2362 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2362/2362 places, 2162/2162 transitions.
Drop transitions removed 475 transitions
Trivial Post-agglo rules discarded 475 transitions
Performed 475 trivial Post agglomeration. Transition count delta: 475
Iterating post reduction 0 with 475 rules applied. Total rules applied 475 place count 2362 transition count 1687
Reduce places removed 475 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 477 rules applied. Total rules applied 952 place count 1887 transition count 1685
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 954 place count 1885 transition count 1685
Performed 321 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 321 Pre rules applied. Total rules applied 954 place count 1885 transition count 1364
Deduced a syphon composed of 321 places in 1 ms
Reduce places removed 321 places and 0 transitions.
Iterating global reduction 3 with 642 rules applied. Total rules applied 1596 place count 1564 transition count 1364
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 1 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 3 with 1358 rules applied. Total rules applied 2954 place count 885 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2955 place count 885 transition count 684
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 2957 place count 884 transition count 683
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
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 3159 place count 783 transition count 750
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 3193 place count 766 transition count 761
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3194 place count 766 transition count 760
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 5 with 39 rules applied. Total rules applied 3233 place count 766 transition count 760
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3234 place count 765 transition count 759
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3236 place count 763 transition count 759
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3236 place count 763 transition count 758
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3238 place count 762 transition count 758
Applied a total of 3238 rules in 273 ms. Remains 762 /2362 variables (removed 1600) and now considering 758/2162 (removed 1404) transitions.
Finished structural reductions, in 1 iterations. Remains : 762/2362 places, 758/2162 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) 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 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 758 rows 762 cols
[2022-05-19 12:46:12] [INFO ] Computed 359 place invariants in 1 ms
[2022-05-19 12:46:12] [INFO ] [Real]Absence check using 359 positive place invariants in 49 ms returned sat
[2022-05-19 12:46:13] [INFO ] After 552ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-19 12:46:13] [INFO ] [Nat]Absence check using 359 positive place invariants in 46 ms returned sat
[2022-05-19 12:46:13] [INFO ] After 400ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-19 12:46:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 12:46:14] [INFO ] After 182ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-19 12:46:14] [INFO ] After 472ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 179 ms.
[2022-05-19 12:46:14] [INFO ] After 1302ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 191 ms.
Support contains 3 out of 762 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 762/762 places, 758/758 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 762 transition count 757
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 761 transition count 757
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 2 with 2 rules applied. Total rules applied 4 place count 760 transition count 756
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 759 transition count 755
Applied a total of 5 rules in 33 ms. Remains 759 /762 variables (removed 3) and now considering 755/758 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 759/762 places, 755/758 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 250 ms. (steps per millisecond=40 ) 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 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 111132 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 111132 steps, saw 70541 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 755 rows 759 cols
[2022-05-19 12:46:18] [INFO ] Computed 359 place invariants in 0 ms
[2022-05-19 12:46:18] [INFO ] [Real]Absence check using 359 positive place invariants in 49 ms returned sat
[2022-05-19 12:46:19] [INFO ] After 565ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-19 12:46:19] [INFO ] [Nat]Absence check using 359 positive place invariants in 50 ms returned sat
[2022-05-19 12:46:19] [INFO ] After 415ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-19 12:46:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:46:19] [INFO ] After 184ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-19 12:46:20] [INFO ] After 472ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 180 ms.
[2022-05-19 12:46:20] [INFO ] After 1340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 125 ms.
Support contains 3 out of 759 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 759/759 places, 755/755 transitions.
Applied a total of 0 rules in 12 ms. Remains 759 /759 variables (removed 0) and now considering 755/755 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 759/759 places, 755/755 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 759/759 places, 755/755 transitions.
Applied a total of 0 rules in 11 ms. Remains 759 /759 variables (removed 0) and now considering 755/755 (removed 0) transitions.
// Phase 1: matrix 755 rows 759 cols
[2022-05-19 12:46:20] [INFO ] Computed 359 place invariants in 3 ms
[2022-05-19 12:46:20] [INFO ] Implicit Places using invariants in 397 ms returned [748]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 397 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 758/759 places, 755/755 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 757 transition count 754
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 757 transition count 754
Applied a total of 2 rules in 20 ms. Remains 757 /758 variables (removed 1) and now considering 754/755 (removed 1) transitions.
// Phase 1: matrix 754 rows 757 cols
[2022-05-19 12:46:20] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:46:21] [INFO ] Implicit Places using invariants in 376 ms returned []
// Phase 1: matrix 754 rows 757 cols
[2022-05-19 12:46:21] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:46:22] [INFO ] Implicit Places using invariants and state equation in 737 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 757/759 places, 754/755 transitions.
Finished structural reductions, in 2 iterations. Remains : 757/759 places, 754/755 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) 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 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 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 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 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 111448 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 111448 steps, saw 71046 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 754 rows 757 cols
[2022-05-19 12:46:25] [INFO ] Computed 358 place invariants in 0 ms
[2022-05-19 12:46:25] [INFO ] [Real]Absence check using 358 positive place invariants in 52 ms returned sat
[2022-05-19 12:46:26] [INFO ] After 326ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:3
[2022-05-19 12:46:26] [INFO ] After 490ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:3
Attempting to minimize the solution found.
Minimization took 92 ms.
[2022-05-19 12:46:26] [INFO ] After 835ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:4
[2022-05-19 12:46:26] [INFO ] [Nat]Absence check using 358 positive place invariants in 50 ms returned sat
[2022-05-19 12:46:27] [INFO ] After 460ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-19 12:46:27] [INFO ] After 741ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 194 ms.
[2022-05-19 12:46:27] [INFO ] After 1193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 158 ms.
Support contains 3 out of 757 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 757/757 places, 754/754 transitions.
Applied a total of 0 rules in 11 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 757/757 places, 754/754 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 757/757 places, 754/754 transitions.
Applied a total of 0 rules in 13 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
// Phase 1: matrix 754 rows 757 cols
[2022-05-19 12:46:27] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:46:28] [INFO ] Implicit Places using invariants in 390 ms returned []
// Phase 1: matrix 754 rows 757 cols
[2022-05-19 12:46:28] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:46:29] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 1125 ms to find 0 implicit places.
[2022-05-19 12:46:29] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 754 rows 757 cols
[2022-05-19 12:46:29] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-19 12:46:29] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 757/757 places, 754/754 transitions.
Partial Free-agglomeration rule applied 77 times.
Drop transitions removed 77 transitions
Iterating global reduction 0 with 77 rules applied. Total rules applied 77 place count 757 transition count 754
Applied a total of 77 rules in 22 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 754 rows 757 cols
[2022-05-19 12:46:29] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:46:29] [INFO ] [Real]Absence check using 358 positive place invariants in 51 ms returned sat
[2022-05-19 12:46:30] [INFO ] After 322ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:3
[2022-05-19 12:46:30] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-05-19 12:46:30] [INFO ] After 128ms SMT Verify possible using 75 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-19 12:46:30] [INFO ] After 704ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-19 12:46:30] [INFO ] [Nat]Absence check using 358 positive place invariants in 49 ms returned sat
[2022-05-19 12:46:30] [INFO ] After 411ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-19 12:46:31] [INFO ] After 279ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-19 12:46:31] [INFO ] After 589ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 195 ms.
[2022-05-19 12:46:31] [INFO ] After 1459ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2022-05-19 12:46:31] [INFO ] Flatten gal took : 23 ms
[2022-05-19 12:46:31] [INFO ] Flatten gal took : 23 ms
[2022-05-19 12:46:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9698669431915034843.gal : 2 ms
[2022-05-19 12:46:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6864803755846101244.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1830359018947886350;'/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/ReachabilityCardinality9698669431915034843.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6864803755846101244.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/ReachabilityCardinality6864803755846101244.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 18
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :18 after 37
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :37 after 70
Reachability property apf4 is true.
Reachability property apf2 is true.
Reachability property apf0 is true.
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :70 after 137
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :137 after 200
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :200 after 442
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :442 after 6787
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :6787 after 65950
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :65950 after 7.37013e+06
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :7.37013e+06 after 1.37678e+08
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1.37678e+08 after 3.65151e+10
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :3.65151e+10 after 2.47402e+15
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :2.47402e+15 after 9.72101e+18
Reachability property apf8 is true.
Reachability property apf1 is true.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :9.72101e+18 after 5.76037e+27
Detected timeout of ITS tools.
[2022-05-19 12:46:46] [INFO ] Flatten gal took : 25 ms
[2022-05-19 12:46:46] [INFO ] Applying decomposition
[2022-05-19 12:46:46] [INFO ] Flatten gal took : 25 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/graph13136016970972974816.txt' '-o' '/tmp/graph13136016970972974816.bin' '-w' '/tmp/graph13136016970972974816.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13136016970972974816.bin' '-l' '-1' '-v' '-w' '/tmp/graph13136016970972974816.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:46:46] [INFO ] Decomposing Gal with order
[2022-05-19 12:46:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:46:46] [INFO ] Removed a total of 431 redundant transitions.
[2022-05-19 12:46:46] [INFO ] Flatten gal took : 33 ms
[2022-05-19 12:46:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2022-05-19 12:46:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3956154141117729781.gal : 7 ms
[2022-05-19 12:46:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12418283139941406313.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1830359018947886350;'/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/ReachabilityCardinality3956154141117729781.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12418283139941406313.prop' '--nowitness'
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...299
Loading property file /tmp/ReachabilityCardinality12418283139941406313.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :30720 after 1.05509e+10
Reachability property apf3 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
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\_mod\_flat,1.19698e+53,3.49699,88224,1771,139,136323,846,772,455140,75,14459,0
Total reachable state count : 1.196981475982972129984978422160221437183e+53
Verifying 1 reachability properties.
Reachability property apf3 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
apf3,2.83495e+51,3.51063,88488,1311,129,136323,846,798,455140,82,14459,0
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p3))), (X (NOT p3)), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p2 p3))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p2))), true, (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p0 p1)), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 16 factoid took 870 ms. Reduced automaton from 9 states, 17 edges and 4 AP to 9 states, 17 edges and 4 AP.
Stuttering acceptance computed with spot in 282 ms :[(OR (AND p2 p3) (AND p0 p1)), true, p3, (AND p0 p1), (AND p3 p2), (AND p0 p1), p0, (AND p0 p1), p2]
Stuttering acceptance computed with spot in 278 ms :[(OR (AND p2 p3) (AND p0 p1)), true, p3, (AND p0 p1), (AND p3 p2), (AND p0 p1), p0, (AND p0 p1), p2]
Support contains 5 out of 2362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2362/2362 places, 2162/2162 transitions.
Applied a total of 0 rules in 129 ms. Remains 2362 /2362 variables (removed 0) and now considering 2162/2162 (removed 0) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:46:52] [INFO ] Computed 361 place invariants in 13 ms
[2022-05-19 12:46:52] [INFO ] Implicit Places using invariants in 695 ms returned []
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:46:52] [INFO ] Computed 361 place invariants in 12 ms
[2022-05-19 12:46:54] [INFO ] Implicit Places using invariants and state equation in 2087 ms returned []
Implicit Place search using SMT with State Equation took 2786 ms to find 0 implicit places.
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:46:54] [INFO ] Computed 361 place invariants in 9 ms
[2022-05-19 12:46:56] [INFO ] Dead Transitions using invariants and state equation in 1243 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2362/2362 places, 2162/2162 transitions.
Computed a total of 639 stabilizing places and 639 stable transitions
Computed a total of 639 stabilizing places and 639 stable transitions
Detected a total of 639/2362 stabilizing places and 639/2162 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND p3 p2))), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND (NOT p3) p2))), (X (X (NOT p2))), true, (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 539 ms. Reduced automaton from 9 states, 17 edges and 4 AP to 9 states, 17 edges and 4 AP.
Stuttering acceptance computed with spot in 296 ms :[(OR (AND p2 p3) (AND p0 p1)), true, p3, (AND p0 p1), (AND p3 p2), (AND p0 p1), p0, (AND p0 p1), p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:46:57] [INFO ] Computed 361 place invariants in 4 ms
[2022-05-19 12:46:57] [INFO ] [Real]Absence check using 361 positive place invariants in 120 ms returned sat
[2022-05-19 12:46:59] [INFO ] After 1788ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-19 12:46:59] [INFO ] [Nat]Absence check using 361 positive place invariants in 123 ms returned sat
[2022-05-19 12:47:01] [INFO ] After 1522ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-19 12:47:01] [INFO ] Deduced a trap composed of 20 places in 455 ms of which 1 ms to minimize.
[2022-05-19 12:47:02] [INFO ] Deduced a trap composed of 23 places in 453 ms of which 1 ms to minimize.
[2022-05-19 12:47:03] [INFO ] Deduced a trap composed of 23 places in 441 ms of which 2 ms to minimize.
[2022-05-19 12:47:03] [INFO ] Deduced a trap composed of 24 places in 447 ms of which 1 ms to minimize.
[2022-05-19 12:47:04] [INFO ] Deduced a trap composed of 18 places in 431 ms of which 1 ms to minimize.
[2022-05-19 12:47:04] [INFO ] Deduced a trap composed of 18 places in 422 ms of which 1 ms to minimize.
[2022-05-19 12:47:05] [INFO ] Deduced a trap composed of 30 places in 409 ms of which 1 ms to minimize.
[2022-05-19 12:47:05] [INFO ] Deduced a trap composed of 38 places in 401 ms of which 1 ms to minimize.
[2022-05-19 12:47:06] [INFO ] Deduced a trap composed of 16 places in 405 ms of which 1 ms to minimize.
[2022-05-19 12:47:06] [INFO ] Deduced a trap composed of 32 places in 379 ms of which 1 ms to minimize.
[2022-05-19 12:47:06] [INFO ] Deduced a trap composed of 28 places in 405 ms of which 1 ms to minimize.
[2022-05-19 12:47:07] [INFO ] Deduced a trap composed of 38 places in 409 ms of which 1 ms to minimize.
[2022-05-19 12:47:07] [INFO ] Deduced a trap composed of 17 places in 357 ms of which 1 ms to minimize.
[2022-05-19 12:47:08] [INFO ] Deduced a trap composed of 28 places in 343 ms of which 1 ms to minimize.
[2022-05-19 12:47:08] [INFO ] Deduced a trap composed of 21 places in 346 ms of which 1 ms to minimize.
[2022-05-19 12:47:09] [INFO ] Deduced a trap composed of 30 places in 333 ms of which 1 ms to minimize.
[2022-05-19 12:47:09] [INFO ] Deduced a trap composed of 29 places in 332 ms of which 1 ms to minimize.
[2022-05-19 12:47:09] [INFO ] Deduced a trap composed of 27 places in 324 ms of which 1 ms to minimize.
[2022-05-19 12:47:10] [INFO ] Deduced a trap composed of 30 places in 311 ms of which 0 ms to minimize.
[2022-05-19 12:47:10] [INFO ] Deduced a trap composed of 40 places in 308 ms of which 0 ms to minimize.
[2022-05-19 12:47:11] [INFO ] Deduced a trap composed of 31 places in 316 ms of which 1 ms to minimize.
[2022-05-19 12:47:11] [INFO ] Deduced a trap composed of 41 places in 314 ms of which 1 ms to minimize.
[2022-05-19 12:47:11] [INFO ] Deduced a trap composed of 42 places in 317 ms of which 1 ms to minimize.
[2022-05-19 12:47:12] [INFO ] Deduced a trap composed of 37 places in 295 ms of which 1 ms to minimize.
[2022-05-19 12:47:12] [INFO ] Deduced a trap composed of 39 places in 291 ms of which 1 ms to minimize.
[2022-05-19 12:47:12] [INFO ] Deduced a trap composed of 42 places in 278 ms of which 1 ms to minimize.
[2022-05-19 12:47:13] [INFO ] Deduced a trap composed of 40 places in 283 ms of which 1 ms to minimize.
[2022-05-19 12:47:13] [INFO ] Deduced a trap composed of 50 places in 275 ms of which 1 ms to minimize.
[2022-05-19 12:47:14] [INFO ] Deduced a trap composed of 31 places in 261 ms of which 1 ms to minimize.
[2022-05-19 12:47:14] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 1 ms to minimize.
[2022-05-19 12:47:14] [INFO ] Deduced a trap composed of 36 places in 255 ms of which 0 ms to minimize.
[2022-05-19 12:47:15] [INFO ] Deduced a trap composed of 41 places in 246 ms of which 1 ms to minimize.
[2022-05-19 12:47:15] [INFO ] Deduced a trap composed of 42 places in 244 ms of which 1 ms to minimize.
[2022-05-19 12:47:15] [INFO ] Deduced a trap composed of 38 places in 235 ms of which 0 ms to minimize.
[2022-05-19 12:47:15] [INFO ] Deduced a trap composed of 48 places in 226 ms of which 0 ms to minimize.
[2022-05-19 12:47:16] [INFO ] Deduced a trap composed of 42 places in 239 ms of which 4 ms to minimize.
[2022-05-19 12:47:16] [INFO ] Deduced a trap composed of 45 places in 244 ms of which 1 ms to minimize.
[2022-05-19 12:47:16] [INFO ] Deduced a trap composed of 49 places in 217 ms of which 1 ms to minimize.
[2022-05-19 12:47:17] [INFO ] Deduced a trap composed of 44 places in 219 ms of which 1 ms to minimize.
[2022-05-19 12:47:17] [INFO ] Deduced a trap composed of 53 places in 218 ms of which 0 ms to minimize.
[2022-05-19 12:47:17] [INFO ] Deduced a trap composed of 55 places in 213 ms of which 1 ms to minimize.
[2022-05-19 12:47:18] [INFO ] Deduced a trap composed of 54 places in 213 ms of which 0 ms to minimize.
[2022-05-19 12:47:18] [INFO ] Deduced a trap composed of 51 places in 227 ms of which 0 ms to minimize.
[2022-05-19 12:47:18] [INFO ] Deduced a trap composed of 50 places in 206 ms of which 1 ms to minimize.
[2022-05-19 12:47:18] [INFO ] Deduced a trap composed of 51 places in 203 ms of which 1 ms to minimize.
[2022-05-19 12:47:19] [INFO ] Deduced a trap composed of 51 places in 209 ms of which 0 ms to minimize.
[2022-05-19 12:47:19] [INFO ] Deduced a trap composed of 50 places in 192 ms of which 1 ms to minimize.
[2022-05-19 12:47:19] [INFO ] Deduced a trap composed of 55 places in 190 ms of which 1 ms to minimize.
[2022-05-19 12:47:19] [INFO ] Deduced a trap composed of 63 places in 182 ms of which 1 ms to minimize.
[2022-05-19 12:47:20] [INFO ] Deduced a trap composed of 58 places in 184 ms of which 1 ms to minimize.
[2022-05-19 12:47:20] [INFO ] Deduced a trap composed of 50 places in 167 ms of which 1 ms to minimize.
[2022-05-19 12:47:20] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 0 ms to minimize.
[2022-05-19 12:47:20] [INFO ] Deduced a trap composed of 51 places in 162 ms of which 0 ms to minimize.
[2022-05-19 12:47:21] [INFO ] Deduced a trap composed of 56 places in 159 ms of which 1 ms to minimize.
[2022-05-19 12:47:21] [INFO ] Deduced a trap composed of 58 places in 162 ms of which 1 ms to minimize.
[2022-05-19 12:47:21] [INFO ] Trap strengthening (SAT) tested/added 56/55 trap constraints in 20075 ms
[2022-05-19 12:47:22] [INFO ] After 22374ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 467 ms.
[2022-05-19 12:47:22] [INFO ] After 23632ms 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 292 ms.
Support contains 3 out of 2362 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2362/2362 places, 2162/2162 transitions.
Drop transitions removed 477 transitions
Trivial Post-agglo rules discarded 477 transitions
Performed 477 trivial Post agglomeration. Transition count delta: 477
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2362 transition count 1685
Reduce places removed 477 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 479 rules applied. Total rules applied 956 place count 1885 transition count 1683
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 958 place count 1883 transition count 1683
Performed 320 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 320 Pre rules applied. Total rules applied 958 place count 1883 transition count 1363
Deduced a syphon composed of 320 places in 2 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 3 with 640 rules applied. Total rules applied 1598 place count 1563 transition count 1363
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1599 place count 1562 transition count 1362
Iterating global reduction 3 with 1 rules applied. Total rules applied 1600 place count 1562 transition count 1362
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1600 place count 1562 transition count 1361
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 1602 place count 1561 transition count 1361
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 0 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 3 with 1358 rules applied. Total rules applied 2960 place count 882 transition count 682
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2961 place count 882 transition count 681
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 2963 place count 881 transition count 680
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
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 3165 place count 780 transition count 747
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 3199 place count 763 transition count 758
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3200 place count 763 transition count 757
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 5 with 39 rules applied. Total rules applied 3239 place count 763 transition count 757
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3240 place count 762 transition count 756
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3242 place count 760 transition count 756
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3242 place count 760 transition count 755
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3244 place count 759 transition count 755
Applied a total of 3244 rules in 348 ms. Remains 759 /2362 variables (removed 1603) and now considering 755/2162 (removed 1407) transitions.
Finished structural reductions, in 1 iterations. Remains : 759/2362 places, 755/2162 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) 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 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) 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 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 123262 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 123262 steps, saw 78460 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 755 rows 759 cols
[2022-05-19 12:47:27] [INFO ] Computed 359 place invariants in 1 ms
[2022-05-19 12:47:27] [INFO ] [Real]Absence check using 359 positive place invariants in 50 ms returned sat
[2022-05-19 12:47:27] [INFO ] After 585ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-19 12:47:27] [INFO ] [Nat]Absence check using 359 positive place invariants in 50 ms returned sat
[2022-05-19 12:47:28] [INFO ] After 399ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-19 12:47:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:47:28] [INFO ] After 165ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-19 12:47:28] [INFO ] After 447ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 173 ms.
[2022-05-19 12:47:29] [INFO ] After 1294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 109 ms.
Support contains 3 out of 759 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 759/759 places, 755/755 transitions.
Applied a total of 0 rules in 12 ms. Remains 759 /759 variables (removed 0) and now considering 755/755 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 759/759 places, 755/755 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 759/759 places, 755/755 transitions.
Applied a total of 0 rules in 12 ms. Remains 759 /759 variables (removed 0) and now considering 755/755 (removed 0) transitions.
// Phase 1: matrix 755 rows 759 cols
[2022-05-19 12:47:29] [INFO ] Computed 359 place invariants in 3 ms
[2022-05-19 12:47:29] [INFO ] Implicit Places using invariants in 403 ms returned [748]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 404 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 758/759 places, 755/755 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 757 transition count 754
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 757 transition count 754
Applied a total of 2 rules in 21 ms. Remains 757 /758 variables (removed 1) and now considering 754/755 (removed 1) transitions.
// Phase 1: matrix 754 rows 757 cols
[2022-05-19 12:47:29] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:47:29] [INFO ] Implicit Places using invariants in 395 ms returned []
// Phase 1: matrix 754 rows 757 cols
[2022-05-19 12:47:29] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-19 12:47:30] [INFO ] Implicit Places using invariants and state equation in 762 ms returned []
Implicit Place search using SMT with State Equation took 1159 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 757/759 places, 754/755 transitions.
Finished structural reductions, in 2 iterations. Remains : 757/759 places, 754/755 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 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 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) 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 6) 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 6) seen :0
Interrupted probabilistic random walk after 106087 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 106087 steps, saw 67304 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 754 rows 757 cols
[2022-05-19 12:47:34] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-19 12:47:34] [INFO ] [Real]Absence check using 358 positive place invariants in 48 ms returned sat
[2022-05-19 12:47:35] [INFO ] After 330ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:3
[2022-05-19 12:47:35] [INFO ] After 474ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:3
Attempting to minimize the solution found.
Minimization took 95 ms.
[2022-05-19 12:47:35] [INFO ] After 814ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:5
[2022-05-19 12:47:35] [INFO ] [Nat]Absence check using 358 positive place invariants in 49 ms returned sat
[2022-05-19 12:47:36] [INFO ] After 415ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-19 12:47:36] [INFO ] After 703ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 177 ms.
[2022-05-19 12:47:36] [INFO ] After 1153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 270 ms.
Support contains 3 out of 757 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 757/757 places, 754/754 transitions.
Applied a total of 0 rules in 12 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 757/757 places, 754/754 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 757/757 places, 754/754 transitions.
Applied a total of 0 rules in 12 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
// Phase 1: matrix 754 rows 757 cols
[2022-05-19 12:47:36] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:47:37] [INFO ] Implicit Places using invariants in 379 ms returned []
// Phase 1: matrix 754 rows 757 cols
[2022-05-19 12:47:37] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:47:37] [INFO ] Implicit Places using invariants and state equation in 742 ms returned []
Implicit Place search using SMT with State Equation took 1124 ms to find 0 implicit places.
[2022-05-19 12:47:37] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 754 rows 757 cols
[2022-05-19 12:47:37] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:47:38] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 757/757 places, 754/754 transitions.
Partial Free-agglomeration rule applied 77 times.
Drop transitions removed 77 transitions
Iterating global reduction 0 with 77 rules applied. Total rules applied 77 place count 757 transition count 754
Applied a total of 77 rules in 22 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 754 rows 757 cols
[2022-05-19 12:47:38] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:47:38] [INFO ] [Real]Absence check using 358 positive place invariants in 47 ms returned sat
[2022-05-19 12:47:38] [INFO ] After 311ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:3
[2022-05-19 12:47:38] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-05-19 12:47:38] [INFO ] After 117ms SMT Verify possible using 75 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-19 12:47:38] [INFO ] After 654ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-19 12:47:39] [INFO ] [Nat]Absence check using 358 positive place invariants in 56 ms returned sat
[2022-05-19 12:47:39] [INFO ] After 411ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-19 12:47:39] [INFO ] After 253ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-05-19 12:47:40] [INFO ] After 544ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 192 ms.
[2022-05-19 12:47:40] [INFO ] After 1434ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2022-05-19 12:47:40] [INFO ] Flatten gal took : 23 ms
[2022-05-19 12:47:40] [INFO ] Flatten gal took : 23 ms
[2022-05-19 12:47:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8489864561634912982.gal : 2 ms
[2022-05-19 12:47:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18434008838221061886.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms8208419596270276251;'/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/ReachabilityCardinality8489864561634912982.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18434008838221061886.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...320
Loading property file /tmp/ReachabilityCardinality18434008838221061886.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 18
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :18 after 37
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :37 after 70
Reachability property apf4 is true.
Reachability property apf2 is true.
Reachability property apf0 is true.
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :70 after 137
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :137 after 200
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :200 after 442
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :442 after 6787
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :6787 after 65950
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :65950 after 7.37013e+06
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :7.37013e+06 after 1.37678e+08
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1.37678e+08 after 3.65151e+10
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :3.65151e+10 after 2.47402e+15
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :2.47402e+15 after 9.72101e+18
Reachability property apf8 is true.
Reachability property apf1 is true.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :9.72101e+18 after 5.76037e+27
Detected timeout of ITS tools.
[2022-05-19 12:47:55] [INFO ] Flatten gal took : 26 ms
[2022-05-19 12:47:55] [INFO ] Applying decomposition
[2022-05-19 12:47:55] [INFO ] Flatten gal took : 23 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/graph7933661384392918970.txt' '-o' '/tmp/graph7933661384392918970.bin' '-w' '/tmp/graph7933661384392918970.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7933661384392918970.bin' '-l' '-1' '-v' '-w' '/tmp/graph7933661384392918970.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:47:55] [INFO ] Decomposing Gal with order
[2022-05-19 12:47:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:47:55] [INFO ] Removed a total of 434 redundant transitions.
[2022-05-19 12:47:55] [INFO ] Flatten gal took : 34 ms
[2022-05-19 12:47:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2022-05-19 12:47:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15944461736489199353.gal : 5 ms
[2022-05-19 12:47:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18359641324676441997.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms8208419596270276251;'/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/ReachabilityCardinality15944461736489199353.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18359641324676441997.prop' '--nowitness'
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...300
Loading property file /tmp/ReachabilityCardinality18359641324676441997.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 1
Reachability property apf3 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
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\_mod\_flat,4.10429e+52,1.71322,50304,2038,121,79577,824,785,235774,74,12458,0
Total reachable state count : 4.104294583996273476379976220452883205065e+52
Verifying 1 reachability properties.
Reachability property apf3 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
apf3,1.69882e+37,1.71717,50568,426,65,79577,824,811,235774,81,12458,0
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND p3 p2))), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND (NOT p3) p2))), (X (X (NOT p2))), true, (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p0 p1)), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 13 factoid took 657 ms. Reduced automaton from 9 states, 17 edges and 4 AP to 9 states, 17 edges and 4 AP.
Stuttering acceptance computed with spot in 313 ms :[(OR (AND p2 p3) (AND p0 p1)), true, p3, (AND p0 p1), (AND p3 p2), (AND p0 p1), p0, (AND p0 p1), p2]
Stuttering acceptance computed with spot in 257 ms :[(OR (AND p2 p3) (AND p0 p1)), true, p3, (AND p0 p1), (AND p3 p2), (AND p0 p1), p0, (AND p0 p1), p2]
Stuttering acceptance computed with spot in 339 ms :[(OR (AND p2 p3) (AND p0 p1)), true, p3, (AND p0 p1), (AND p3 p2), (AND p0 p1), p0, (AND p0 p1), p2]
Product exploration explored 100000 steps with 2 reset in 703 ms.
Product exploration explored 100000 steps with 0 reset in 833 ms.
Applying partial POR strategy [false, true, true, false, true, false, true, false, true]
Stuttering acceptance computed with spot in 321 ms :[(OR (AND p2 p3) (AND p0 p1)), true, p3, (AND p0 p1), (AND p3 p2), (AND p0 p1), p0, (AND p0 p1), p2]
Support contains 5 out of 2362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2362/2362 places, 2162/2162 transitions.
Performed 477 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2362 transition count 2162
Performed 163 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 163 Pre rules applied. Total rules applied 477 place count 2362 transition count 2284
Deduced a syphon composed of 640 places in 3 ms
Iterating global reduction 1 with 163 rules applied. Total rules applied 640 place count 2362 transition count 2284
Performed 797 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1437 places in 2 ms
Iterating global reduction 1 with 797 rules applied. Total rules applied 1437 place count 2362 transition count 2284
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1438 place count 2362 transition count 2283
Renaming transitions due to excessive name length > 1024 char.
Discarding 317 places :
Symmetric choice reduction at 2 with 317 rule applications. Total rules 1755 place count 2045 transition count 1966
Deduced a syphon composed of 1120 places in 2 ms
Iterating global reduction 2 with 317 rules applied. Total rules applied 2072 place count 2045 transition count 1966
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1121 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2073 place count 2045 transition count 1966
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2075 place count 2043 transition count 1964
Deduced a syphon composed of 1119 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2077 place count 2043 transition count 1964
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -530
Deduced a syphon composed of 1220 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2178 place count 2043 transition count 2494
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2279 place count 1942 transition count 2292
Deduced a syphon composed of 1119 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2380 place count 1942 transition count 2292
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -307
Deduced a syphon composed of 1176 places in 2 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2437 place count 1942 transition count 2599
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 2494 place count 1885 transition count 2485
Deduced a syphon composed of 1119 places in 2 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2551 place count 1885 transition count 2485
Deduced a syphon composed of 1119 places in 2 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 2560 place count 1885 transition count 2476
Deduced a syphon composed of 1119 places in 2 ms
Applied a total of 2560 rules in 930 ms. Remains 1885 /2362 variables (removed 477) and now considering 2476/2162 (removed -314) transitions.
[2022-05-19 12:48:01] [INFO ] Redundant transitions in 48 ms returned []
// Phase 1: matrix 2476 rows 1885 cols
[2022-05-19 12:48:01] [INFO ] Computed 361 place invariants in 21 ms
[2022-05-19 12:48:03] [INFO ] Dead Transitions using invariants and state equation in 1214 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1885/2362 places, 2476/2162 transitions.
Finished structural reductions, in 1 iterations. Remains : 1885/2362 places, 2476/2162 transitions.
Product exploration explored 100000 steps with 1 reset in 725 ms.
Product exploration explored 100000 steps with 2 reset in 954 ms.
Built C files in :
/tmp/ltsmin1049796635652628862
[2022-05-19 12:48:04] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1049796635652628862
Running compilation step : cd /tmp/ltsmin1049796635652628862;'/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/ltsmin1049796635652628862;'/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/ltsmin1049796635652628862;'/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 2362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2362/2362 places, 2162/2162 transitions.
Applied a total of 0 rules in 139 ms. Remains 2362 /2362 variables (removed 0) and now considering 2162/2162 (removed 0) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:48:08] [INFO ] Computed 361 place invariants in 11 ms
[2022-05-19 12:48:09] [INFO ] Implicit Places using invariants in 1191 ms returned []
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:48:09] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:48:11] [INFO ] Implicit Places using invariants and state equation in 2000 ms returned []
Implicit Place search using SMT with State Equation took 3191 ms to find 0 implicit places.
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:48:11] [INFO ] Computed 361 place invariants in 11 ms
[2022-05-19 12:48:12] [INFO ] Dead Transitions using invariants and state equation in 1236 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2362/2362 places, 2162/2162 transitions.
Built C files in :
/tmp/ltsmin17203831722277436590
[2022-05-19 12:48:12] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17203831722277436590
Running compilation step : cd /tmp/ltsmin17203831722277436590;'/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/ltsmin17203831722277436590;'/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/ltsmin17203831722277436590;'/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-19 12:48:15] [INFO ] Flatten gal took : 46 ms
[2022-05-19 12:48:15] [INFO ] Flatten gal took : 66 ms
[2022-05-19 12:48:15] [INFO ] Time to serialize gal into /tmp/LTL13532929773342657732.gal : 21 ms
[2022-05-19 12:48:15] [INFO ] Time to serialize properties into /tmp/LTL1787223415132568031.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/LTL13532929773342657732.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1787223415132568031.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/LTL1353292...267
Read 1 LTL properties
Checking formula 0 : !(((!((X(X(X("(p767==1)"))))U(X("(p2618==1)"))))&&(!((!(G(!("((p679==1)&&(p681==1))"))))U("(p1544==1)")))))
Formula 0 simplified : !(!(XXX"(p767==1)" U X"(p2618==1)") & !(!G!"((p679==1)&&(p681==1))" U "(p1544==1)"))
Detected timeout of ITS tools.
[2022-05-19 12:48:30] [INFO ] Flatten gal took : 45 ms
[2022-05-19 12:48:30] [INFO ] Applying decomposition
[2022-05-19 12:48:30] [INFO ] Flatten gal took : 45 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/graph10809769169821410935.txt' '-o' '/tmp/graph10809769169821410935.bin' '-w' '/tmp/graph10809769169821410935.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10809769169821410935.bin' '-l' '-1' '-v' '-w' '/tmp/graph10809769169821410935.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:48:30] [INFO ] Decomposing Gal with order
[2022-05-19 12:48:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:48:31] [INFO ] Removed a total of 397 redundant transitions.
[2022-05-19 12:48:31] [INFO ] Flatten gal took : 87 ms
[2022-05-19 12:48:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-19 12:48:31] [INFO ] Time to serialize gal into /tmp/LTL10762600728013190277.gal : 12 ms
[2022-05-19 12:48:31] [INFO ] Time to serialize properties into /tmp/LTL1081737748943996663.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/LTL10762600728013190277.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1081737748943996663.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/LTL1076260...246
Read 1 LTL properties
Checking formula 0 : !(((!((X(X(X("(i10.u246.p767==1)"))))U(X("(i37.u823.p2618==1)"))))&&(!((!(G(!("((i9.u216.p679==1)&&(i9.u216.p681==1))"))))U("(i21.u490...171
Formula 0 simplified : !(!(XXX"(i10.u246.p767==1)" U X"(i37.u823.p2618==1)") & !(!G!"((i9.u216.p679==1)&&(i9.u216.p681==1))" U "(i21.u490.p1544==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9505621425889141315
[2022-05-19 12:48:46] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9505621425889141315
Running compilation step : cd /tmp/ltsmin9505621425889141315;'/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/ltsmin9505621425889141315;'/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/ltsmin9505621425889141315;'/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)
Treatment of property ShieldIIPt-PT-040B-LTLFireability-09 finished in 192812 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2367 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2367/2367 places, 2167/2167 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 482 transitions
Trivial Post-agglo rules discarded 482 transitions
Performed 482 trivial Post agglomeration. Transition count delta: 482
Iterating post reduction 0 with 482 rules applied. Total rules applied 482 place count 2366 transition count 1684
Reduce places removed 482 places and 0 transitions.
Iterating post reduction 1 with 482 rules applied. Total rules applied 964 place count 1884 transition count 1684
Performed 316 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 316 Pre rules applied. Total rules applied 964 place count 1884 transition count 1368
Deduced a syphon composed of 316 places in 2 ms
Reduce places removed 316 places and 0 transitions.
Iterating global reduction 2 with 632 rules applied. Total rules applied 1596 place count 1568 transition count 1368
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1599 place count 1565 transition count 1365
Iterating global reduction 2 with 3 rules applied. Total rules applied 1602 place count 1565 transition count 1365
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1602 place count 1565 transition count 1362
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1608 place count 1562 transition count 1362
Performed 678 Post agglomeration using F-continuation condition.Transition count delta: 678
Deduced a syphon composed of 678 places in 1 ms
Reduce places removed 678 places and 0 transitions.
Iterating global reduction 2 with 1356 rules applied. Total rules applied 2964 place count 884 transition count 684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2965 place count 884 transition count 683
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 2967 place count 883 transition count 682
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3169 place count 782 transition count 748
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3205 place count 764 transition count 761
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3207 place count 762 transition count 759
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3209 place count 760 transition count 759
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3209 place count 760 transition count 758
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 3211 place count 759 transition count 758
Applied a total of 3211 rules in 327 ms. Remains 759 /2367 variables (removed 1608) and now considering 758/2167 (removed 1409) transitions.
// Phase 1: matrix 758 rows 759 cols
[2022-05-19 12:48:49] [INFO ] Computed 359 place invariants in 2 ms
[2022-05-19 12:48:49] [INFO ] Implicit Places using invariants in 369 ms returned [748]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 370 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 758/2367 places, 758/2167 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 757 transition count 757
Applied a total of 2 rules in 22 ms. Remains 757 /758 variables (removed 1) and now considering 757/758 (removed 1) transitions.
// Phase 1: matrix 757 rows 757 cols
[2022-05-19 12:48:50] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:48:50] [INFO ] Implicit Places using invariants in 362 ms returned []
// Phase 1: matrix 757 rows 757 cols
[2022-05-19 12:48:50] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:48:51] [INFO ] Implicit Places using invariants and state equation in 772 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 757/2367 places, 757/2167 transitions.
Finished structural reductions, in 2 iterations. Remains : 757/2367 places, 757/2167 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s60 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-10 finished in 1943 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(G(p1)||G(p2)))))'
Support contains 4 out of 2367 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2367/2367 places, 2167/2167 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 480 transitions
Trivial Post-agglo rules discarded 480 transitions
Performed 480 trivial Post agglomeration. Transition count delta: 480
Iterating post reduction 0 with 480 rules applied. Total rules applied 480 place count 2366 transition count 1686
Reduce places removed 480 places and 0 transitions.
Iterating post reduction 1 with 480 rules applied. Total rules applied 960 place count 1886 transition count 1686
Performed 317 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 317 Pre rules applied. Total rules applied 960 place count 1886 transition count 1369
Deduced a syphon composed of 317 places in 2 ms
Reduce places removed 317 places and 0 transitions.
Iterating global reduction 2 with 634 rules applied. Total rules applied 1594 place count 1569 transition count 1369
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1597 place count 1566 transition count 1366
Iterating global reduction 2 with 3 rules applied. Total rules applied 1600 place count 1566 transition count 1366
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1600 place count 1566 transition count 1363
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1606 place count 1563 transition count 1363
Performed 675 Post agglomeration using F-continuation condition.Transition count delta: 675
Deduced a syphon composed of 675 places in 1 ms
Reduce places removed 675 places and 0 transitions.
Iterating global reduction 2 with 1350 rules applied. Total rules applied 2956 place count 888 transition count 688
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2957 place count 888 transition count 687
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 2959 place count 887 transition count 686
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 3161 place count 786 transition count 752
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3197 place count 768 transition count 765
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3198 place count 767 transition count 764
Applied a total of 3198 rules in 347 ms. Remains 767 /2367 variables (removed 1600) and now considering 764/2167 (removed 1403) transitions.
// Phase 1: matrix 764 rows 767 cols
[2022-05-19 12:48:51] [INFO ] Computed 361 place invariants in 4 ms
[2022-05-19 12:48:51] [INFO ] Implicit Places using invariants in 393 ms returned [759, 760]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 394 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 765/2367 places, 764/2167 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 765 transition count 763
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 764 transition count 763
Applied a total of 2 rules in 16 ms. Remains 764 /765 variables (removed 1) and now considering 763/764 (removed 1) transitions.
// Phase 1: matrix 763 rows 764 cols
[2022-05-19 12:48:51] [INFO ] Computed 359 place invariants in 2 ms
[2022-05-19 12:48:52] [INFO ] Implicit Places using invariants in 387 ms returned [753]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 388 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 763/2367 places, 763/2167 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 762
Applied a total of 2 rules in 24 ms. Remains 762 /763 variables (removed 1) and now considering 762/763 (removed 1) transitions.
// Phase 1: matrix 762 rows 762 cols
[2022-05-19 12:48:52] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:48:52] [INFO ] Implicit Places using invariants in 398 ms returned []
// Phase 1: matrix 762 rows 762 cols
[2022-05-19 12:48:52] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:48:53] [INFO ] State equation strengthened by 312 read => feed constraints.
[2022-05-19 12:48:55] [INFO ] Implicit Places using invariants and state equation in 2974 ms returned []
Implicit Place search using SMT with State Equation took 3373 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 762/2367 places, 762/2167 transitions.
Finished structural reductions, in 3 iterations. Remains : 762/2367 places, 762/2167 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=0 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=1 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={1} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={1} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s1 1), p1:(AND (EQ s442 1) (EQ s461 1)), p2:(EQ s749 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-11 finished in 4784 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (X(p1)||(X((X(p2)||p0))&&p2))))'
Support contains 3 out of 2367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2367/2367 places, 2167/2167 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2363 transition count 2163
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2363 transition count 2163
Applied a total of 8 rules in 271 ms. Remains 2363 /2367 variables (removed 4) and now considering 2163/2167 (removed 4) transitions.
// Phase 1: matrix 2163 rows 2363 cols
[2022-05-19 12:48:56] [INFO ] Computed 361 place invariants in 8 ms
[2022-05-19 12:48:56] [INFO ] Implicit Places using invariants in 681 ms returned []
// Phase 1: matrix 2163 rows 2363 cols
[2022-05-19 12:48:56] [INFO ] Computed 361 place invariants in 4 ms
[2022-05-19 12:48:59] [INFO ] Implicit Places using invariants and state equation in 2047 ms returned []
Implicit Place search using SMT with State Equation took 2729 ms to find 0 implicit places.
// Phase 1: matrix 2163 rows 2363 cols
[2022-05-19 12:48:59] [INFO ] Computed 361 place invariants in 13 ms
[2022-05-19 12:49:00] [INFO ] Dead Transitions using invariants and state equation in 1251 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2363/2367 places, 2163/2167 transitions.
Finished structural reductions, in 1 iterations. Remains : 2363/2367 places, 2163/2167 transitions.
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1) (NOT p2)), true, (NOT p0), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}]], initial=0, aps=[p2:(EQ s2008 1), p0:(EQ s1421 1), p1:(EQ s2330 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-12 finished in 4517 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U X((G(X(p1)) U X(p0)))))'
Support contains 2 out of 2367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2367/2367 places, 2167/2167 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2361 transition count 2161
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2361 transition count 2161
Applied a total of 12 rules in 241 ms. Remains 2361 /2367 variables (removed 6) and now considering 2161/2167 (removed 6) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:49:00] [INFO ] Computed 361 place invariants in 10 ms
[2022-05-19 12:49:01] [INFO ] Implicit Places using invariants in 665 ms returned []
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:49:01] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:49:03] [INFO ] Implicit Places using invariants and state equation in 2103 ms returned []
Implicit Place search using SMT with State Equation took 2768 ms to find 0 implicit places.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:49:03] [INFO ] Computed 361 place invariants in 12 ms
[2022-05-19 12:49:04] [INFO ] Dead Transitions using invariants and state equation in 1197 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2367 places, 2161/2167 transitions.
Finished structural reductions, in 1 iterations. Remains : 2361/2367 places, 2161/2167 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s601 1), p1:(NEQ s436 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 643 ms.
Product exploration explored 100000 steps with 0 reset in 850 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 102842 steps, run timeout after 3009 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102842 steps, saw 65720 distinct states, run finished after 3009 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:49:10] [INFO ] Computed 361 place invariants in 11 ms
[2022-05-19 12:49:10] [INFO ] [Real]Absence check using 361 positive place invariants in 126 ms returned sat
[2022-05-19 12:49:10] [INFO ] After 592ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 12:49:11] [INFO ] [Nat]Absence check using 361 positive place invariants in 124 ms returned sat
[2022-05-19 12:49:12] [INFO ] After 1187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 12:49:12] [INFO ] Deduced a trap composed of 18 places in 484 ms of which 2 ms to minimize.
[2022-05-19 12:49:13] [INFO ] Deduced a trap composed of 26 places in 492 ms of which 1 ms to minimize.
[2022-05-19 12:49:14] [INFO ] Deduced a trap composed of 21 places in 501 ms of which 1 ms to minimize.
[2022-05-19 12:49:14] [INFO ] Deduced a trap composed of 17 places in 496 ms of which 2 ms to minimize.
[2022-05-19 12:49:15] [INFO ] Deduced a trap composed of 25 places in 496 ms of which 2 ms to minimize.
[2022-05-19 12:49:15] [INFO ] Deduced a trap composed of 16 places in 481 ms of which 1 ms to minimize.
[2022-05-19 12:49:16] [INFO ] Deduced a trap composed of 29 places in 483 ms of which 2 ms to minimize.
[2022-05-19 12:49:16] [INFO ] Deduced a trap composed of 27 places in 447 ms of which 2 ms to minimize.
[2022-05-19 12:49:17] [INFO ] Deduced a trap composed of 16 places in 456 ms of which 1 ms to minimize.
[2022-05-19 12:49:17] [INFO ] Deduced a trap composed of 18 places in 436 ms of which 1 ms to minimize.
[2022-05-19 12:49:18] [INFO ] Deduced a trap composed of 23 places in 444 ms of which 1 ms to minimize.
[2022-05-19 12:49:19] [INFO ] Deduced a trap composed of 38 places in 432 ms of which 1 ms to minimize.
[2022-05-19 12:49:19] [INFO ] Deduced a trap composed of 28 places in 424 ms of which 2 ms to minimize.
[2022-05-19 12:49:20] [INFO ] Deduced a trap composed of 41 places in 427 ms of which 2 ms to minimize.
[2022-05-19 12:49:20] [INFO ] Deduced a trap composed of 31 places in 414 ms of which 1 ms to minimize.
[2022-05-19 12:49:20] [INFO ] Deduced a trap composed of 30 places in 408 ms of which 1 ms to minimize.
[2022-05-19 12:49:21] [INFO ] Deduced a trap composed of 18 places in 408 ms of which 1 ms to minimize.
[2022-05-19 12:49:21] [INFO ] Deduced a trap composed of 27 places in 400 ms of which 1 ms to minimize.
[2022-05-19 12:49:22] [INFO ] Deduced a trap composed of 25 places in 406 ms of which 2 ms to minimize.
[2022-05-19 12:49:22] [INFO ] Deduced a trap composed of 24 places in 401 ms of which 1 ms to minimize.
[2022-05-19 12:49:23] [INFO ] Deduced a trap composed of 24 places in 401 ms of which 1 ms to minimize.
[2022-05-19 12:49:23] [INFO ] Deduced a trap composed of 21 places in 393 ms of which 1 ms to minimize.
[2022-05-19 12:49:24] [INFO ] Deduced a trap composed of 30 places in 386 ms of which 1 ms to minimize.
[2022-05-19 12:49:24] [INFO ] Deduced a trap composed of 30 places in 383 ms of which 1 ms to minimize.
[2022-05-19 12:49:25] [INFO ] Deduced a trap composed of 26 places in 365 ms of which 1 ms to minimize.
[2022-05-19 12:49:25] [INFO ] Deduced a trap composed of 27 places in 367 ms of which 1 ms to minimize.
[2022-05-19 12:49:26] [INFO ] Deduced a trap composed of 32 places in 379 ms of which 1 ms to minimize.
[2022-05-19 12:49:26] [INFO ] Deduced a trap composed of 27 places in 370 ms of which 1 ms to minimize.
[2022-05-19 12:49:26] [INFO ] Deduced a trap composed of 36 places in 347 ms of which 1 ms to minimize.
[2022-05-19 12:49:27] [INFO ] Deduced a trap composed of 41 places in 354 ms of which 1 ms to minimize.
[2022-05-19 12:49:27] [INFO ] Deduced a trap composed of 40 places in 375 ms of which 1 ms to minimize.
[2022-05-19 12:49:28] [INFO ] Deduced a trap composed of 33 places in 339 ms of which 1 ms to minimize.
[2022-05-19 12:49:28] [INFO ] Deduced a trap composed of 39 places in 323 ms of which 1 ms to minimize.
[2022-05-19 12:49:29] [INFO ] Deduced a trap composed of 40 places in 331 ms of which 1 ms to minimize.
[2022-05-19 12:49:29] [INFO ] Deduced a trap composed of 58 places in 331 ms of which 1 ms to minimize.
[2022-05-19 12:49:29] [INFO ] Deduced a trap composed of 40 places in 337 ms of which 1 ms to minimize.
[2022-05-19 12:49:30] [INFO ] Deduced a trap composed of 41 places in 327 ms of which 2 ms to minimize.
[2022-05-19 12:49:30] [INFO ] Deduced a trap composed of 55 places in 326 ms of which 1 ms to minimize.
[2022-05-19 12:49:31] [INFO ] Deduced a trap composed of 27 places in 315 ms of which 1 ms to minimize.
[2022-05-19 12:49:31] [INFO ] Deduced a trap composed of 30 places in 310 ms of which 1 ms to minimize.
[2022-05-19 12:49:31] [INFO ] Deduced a trap composed of 42 places in 300 ms of which 1 ms to minimize.
[2022-05-19 12:49:32] [INFO ] Deduced a trap composed of 49 places in 295 ms of which 1 ms to minimize.
[2022-05-19 12:49:32] [INFO ] Deduced a trap composed of 37 places in 289 ms of which 1 ms to minimize.
[2022-05-19 12:49:32] [INFO ] Deduced a trap composed of 47 places in 300 ms of which 1 ms to minimize.
[2022-05-19 12:49:33] [INFO ] Deduced a trap composed of 48 places in 276 ms of which 0 ms to minimize.
[2022-05-19 12:49:33] [INFO ] Deduced a trap composed of 41 places in 273 ms of which 1 ms to minimize.
[2022-05-19 12:49:34] [INFO ] Deduced a trap composed of 49 places in 275 ms of which 1 ms to minimize.
[2022-05-19 12:49:34] [INFO ] Deduced a trap composed of 38 places in 270 ms of which 1 ms to minimize.
[2022-05-19 12:49:34] [INFO ] Deduced a trap composed of 40 places in 264 ms of which 1 ms to minimize.
[2022-05-19 12:49:35] [INFO ] Deduced a trap composed of 40 places in 256 ms of which 0 ms to minimize.
[2022-05-19 12:49:35] [INFO ] Deduced a trap composed of 39 places in 241 ms of which 1 ms to minimize.
[2022-05-19 12:49:35] [INFO ] Deduced a trap composed of 42 places in 234 ms of which 0 ms to minimize.
[2022-05-19 12:49:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 12:49:35] [INFO ] After 25080ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 150 ms.
Support contains 2 out of 2361 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Drop transitions removed 477 transitions
Trivial Post-agglo rules discarded 477 transitions
Performed 477 trivial Post agglomeration. Transition count delta: 477
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2361 transition count 1684
Reduce places removed 477 places and 0 transitions.
Iterating post reduction 1 with 477 rules applied. Total rules applied 954 place count 1884 transition count 1684
Performed 321 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 321 Pre rules applied. Total rules applied 954 place count 1884 transition count 1363
Deduced a syphon composed of 321 places in 2 ms
Reduce places removed 321 places and 0 transitions.
Iterating global reduction 2 with 642 rules applied. Total rules applied 1596 place count 1563 transition count 1363
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 1 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 2 with 1358 rules applied. Total rules applied 2954 place count 884 transition count 684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2955 place count 884 transition count 683
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 2957 place count 883 transition count 682
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
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 3159 place count 782 transition count 749
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3193 place count 765 transition count 760
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3194 place count 765 transition count 759
Partial Free-agglomeration rule applied 41 times.
Drop transitions removed 41 transitions
Iterating global reduction 4 with 41 rules applied. Total rules applied 3235 place count 765 transition count 759
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3236 place count 764 transition count 758
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3238 place count 762 transition count 758
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3238 place count 762 transition count 757
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3240 place count 761 transition count 757
Applied a total of 3240 rules in 302 ms. Remains 761 /2361 variables (removed 1600) and now considering 757/2161 (removed 1404) transitions.
Finished structural reductions, in 1 iterations. Remains : 761/2361 places, 757/2161 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 144468 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 144468 steps, saw 92366 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 757 rows 761 cols
[2022-05-19 12:49:39] [INFO ] Computed 359 place invariants in 1 ms
[2022-05-19 12:49:39] [INFO ] [Real]Absence check using 359 positive place invariants in 50 ms returned sat
[2022-05-19 12:49:39] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 12:49:39] [INFO ] [Nat]Absence check using 359 positive place invariants in 47 ms returned sat
[2022-05-19 12:49:40] [INFO ] After 319ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 12:49:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-19 12:49:40] [INFO ] After 85ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-19 12:49:40] [INFO ] After 226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 88 ms.
[2022-05-19 12:49:40] [INFO ] After 826ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 57 ms.
Support contains 2 out of 761 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 761/761 places, 757/757 transitions.
Applied a total of 0 rules in 12 ms. Remains 761 /761 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 761/761 places, 757/757 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 761/761 places, 757/757 transitions.
Applied a total of 0 rules in 16 ms. Remains 761 /761 variables (removed 0) and now considering 757/757 (removed 0) transitions.
// Phase 1: matrix 757 rows 761 cols
[2022-05-19 12:49:40] [INFO ] Computed 359 place invariants in 2 ms
[2022-05-19 12:49:41] [INFO ] Implicit Places using invariants in 393 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 395 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 760/761 places, 757/757 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 759 transition count 756
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 759 transition count 756
Applied a total of 2 rules in 22 ms. Remains 759 /760 variables (removed 1) and now considering 756/757 (removed 1) transitions.
// Phase 1: matrix 756 rows 759 cols
[2022-05-19 12:49:41] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:49:41] [INFO ] Implicit Places using invariants in 383 ms returned []
// Phase 1: matrix 756 rows 759 cols
[2022-05-19 12:49:41] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:49:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:49:42] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 1161 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 759/761 places, 756/757 transitions.
Finished structural reductions, in 2 iterations. Remains : 759/761 places, 756/757 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 145056 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 145056 steps, saw 92468 distinct states, run finished after 3002 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 756 rows 759 cols
[2022-05-19 12:49:45] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:49:45] [INFO ] [Real]Absence check using 358 positive place invariants in 49 ms returned sat
[2022-05-19 12:49:45] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 12:49:45] [INFO ] [Nat]Absence check using 358 positive place invariants in 46 ms returned sat
[2022-05-19 12:49:46] [INFO ] After 302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 12:49:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:49:46] [INFO ] After 84ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-19 12:49:46] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 89 ms.
[2022-05-19 12:49:46] [INFO ] After 806ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 759 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 11 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 759/759 places, 756/756 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 12 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
// Phase 1: matrix 756 rows 759 cols
[2022-05-19 12:49:46] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:49:47] [INFO ] Implicit Places using invariants in 393 ms returned []
// Phase 1: matrix 756 rows 759 cols
[2022-05-19 12:49:47] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:49:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:49:47] [INFO ] Implicit Places using invariants and state equation in 756 ms returned []
Implicit Place search using SMT with State Equation took 1149 ms to find 0 implicit places.
[2022-05-19 12:49:47] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 756 rows 759 cols
[2022-05-19 12:49:47] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-19 12:49:48] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 759/759 places, 756/756 transitions.
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 0 with 79 rules applied. Total rules applied 79 place count 759 transition count 756
Applied a total of 79 rules in 23 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 756 rows 759 cols
[2022-05-19 12:49:48] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-19 12:49:48] [INFO ] [Real]Absence check using 358 positive place invariants in 47 ms returned sat
[2022-05-19 12:49:48] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 12:49:48] [INFO ] [Nat]Absence check using 358 positive place invariants in 46 ms returned sat
[2022-05-19 12:49:48] [INFO ] After 318ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 12:49:48] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-19 12:49:49] [INFO ] After 154ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-19 12:49:49] [INFO ] After 333ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 147 ms.
[2022-05-19 12:49:49] [INFO ] After 989ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2022-05-19 12:49:49] [INFO ] Flatten gal took : 24 ms
[2022-05-19 12:49:49] [INFO ] Flatten gal took : 22 ms
[2022-05-19 12:49:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7551406145967585031.gal : 3 ms
[2022-05-19 12:49:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality254437012074473567.prop : 81 ms
Invoking ITS tools like this :cd /tmp/redAtoms4331158184936303333;'/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/ReachabilityCardinality7551406145967585031.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality254437012074473567.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...318
Loading property file /tmp/ReachabilityCardinality254437012074473567.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :9 after 18
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :18 after 37
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :37 after 70
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :70 after 134
Reachability property apf2 is true.
Reachability property apf1 is true.
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
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,291,0.299936,11268,2,1834,11,7897,6,0,3756,3080,0
Total reachable state count : 291
Verifying 3 reachability properties.
Reachability property apf0 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
apf0,8,0.301871,11268,2,791,11,7897,7,0,3761,3080,0
Reachability property apf1 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
apf1,8,0.302672,11268,2,791,11,7897,8,0,3764,3080,0
Reachability property apf2 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
apf2,8,0.303333,11268,2,791,11,7897,9,0,3764,3080,0
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p1)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p1)]
// Phase 1: matrix 2161 rows 2361 cols
[2022-05-19 12:49:50] [INFO ] Computed 361 place invariants in 10 ms
[2022-05-19 12:49:51] [INFO ] [Real]Absence check using 361 positive place invariants in 272 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA ShieldIIPt-PT-040B-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040B-LTLFireability-13 finished in 51065 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 2367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2367/2367 places, 2167/2167 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2362 transition count 2162
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2362 transition count 2162
Applied a total of 10 rules in 254 ms. Remains 2362 /2367 variables (removed 5) and now considering 2162/2167 (removed 5) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:49:51] [INFO ] Computed 361 place invariants in 13 ms
[2022-05-19 12:49:52] [INFO ] Implicit Places using invariants in 647 ms returned []
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:49:52] [INFO ] Computed 361 place invariants in 5 ms
[2022-05-19 12:49:54] [INFO ] Implicit Places using invariants and state equation in 1962 ms returned []
Implicit Place search using SMT with State Equation took 2610 ms to find 0 implicit places.
// Phase 1: matrix 2162 rows 2362 cols
[2022-05-19 12:49:54] [INFO ] Computed 361 place invariants in 13 ms
[2022-05-19 12:49:55] [INFO ] Dead Transitions using invariants and state equation in 1236 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2362/2367 places, 2162/2167 transitions.
Finished structural reductions, in 1 iterations. Remains : 2362/2367 places, 2162/2167 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1519 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 1 reset in 646 ms.
Stack based approach found an accepted trace after 1282 steps with 0 reset with depth 1283 and stack size 1283 in 19 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-14 finished in 4857 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(G((X(!(G(p0) U F(X(p1))))&&F(p2)))))))'
Found a SL insensitive property : ShieldIIPt-PT-040B-LTLFireability-00
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), (NOT p2), p1, p1, true]
Support contains 2 out of 2367 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 2367/2367 places, 2167/2167 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 480 transitions
Trivial Post-agglo rules discarded 480 transitions
Performed 480 trivial Post agglomeration. Transition count delta: 480
Iterating post reduction 0 with 480 rules applied. Total rules applied 480 place count 2366 transition count 1686
Reduce places removed 480 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 481 rules applied. Total rules applied 961 place count 1886 transition count 1685
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 962 place count 1885 transition count 1685
Performed 316 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 316 Pre rules applied. Total rules applied 962 place count 1885 transition count 1369
Deduced a syphon composed of 316 places in 2 ms
Reduce places removed 316 places and 0 transitions.
Iterating global reduction 3 with 632 rules applied. Total rules applied 1594 place count 1569 transition count 1369
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1597 place count 1566 transition count 1366
Iterating global reduction 3 with 3 rules applied. Total rules applied 1600 place count 1566 transition count 1366
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1600 place count 1566 transition count 1363
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1606 place count 1563 transition count 1363
Performed 678 Post agglomeration using F-continuation condition.Transition count delta: 678
Deduced a syphon composed of 678 places in 1 ms
Reduce places removed 678 places and 0 transitions.
Iterating global reduction 3 with 1356 rules applied. Total rules applied 2962 place count 885 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2963 place count 885 transition count 684
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 2965 place count 884 transition count 683
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 3167 place count 783 transition count 749
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 3201 place count 766 transition count 760
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3203 place count 764 transition count 758
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3205 place count 762 transition count 758
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3205 place count 762 transition count 757
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3207 place count 761 transition count 757
Applied a total of 3207 rules in 367 ms. Remains 761 /2367 variables (removed 1606) and now considering 757/2167 (removed 1410) transitions.
// Phase 1: matrix 757 rows 761 cols
[2022-05-19 12:49:57] [INFO ] Computed 359 place invariants in 3 ms
[2022-05-19 12:49:57] [INFO ] Implicit Places using invariants in 375 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 376 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 760/2367 places, 757/2167 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 759 transition count 756
Applied a total of 2 rules in 20 ms. Remains 759 /760 variables (removed 1) and now considering 756/757 (removed 1) transitions.
// Phase 1: matrix 756 rows 759 cols
[2022-05-19 12:49:57] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:49:57] [INFO ] Implicit Places using invariants in 358 ms returned []
// Phase 1: matrix 756 rows 759 cols
[2022-05-19 12:49:57] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:49:58] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-19 12:49:58] [INFO ] Implicit Places using invariants and state equation in 725 ms returned []
Implicit Place search using SMT with State Equation took 1084 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 759/2367 places, 756/2167 transitions.
Finished structural reductions, in 2 iterations. Remains : 759/2367 places, 756/2167 transitions.
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s556 0), p1:(EQ s269 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 8 steps with 1 reset in 0 ms.
Treatment of property ShieldIIPt-PT-040B-LTLFireability-00 finished in 2182 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-00 FALSE TECHNIQUES SL_INSENSITIVE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(X(X(G(p0)))||F(p1))) U X(G(p2))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(G((G(p0)||p1))))))'
Found a SL insensitive property : ShieldIIPt-PT-040B-LTLFireability-08
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 2367 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 2367/2367 places, 2167/2167 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2366 transition count 1687
Reduce places removed 479 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 480 rules applied. Total rules applied 959 place count 1887 transition count 1686
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 960 place count 1886 transition count 1686
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 313 Pre rules applied. Total rules applied 960 place count 1886 transition count 1373
Deduced a syphon composed of 313 places in 2 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 3 with 626 rules applied. Total rules applied 1586 place count 1573 transition count 1373
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1589 place count 1570 transition count 1370
Iterating global reduction 3 with 3 rules applied. Total rules applied 1592 place count 1570 transition count 1370
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1592 place count 1570 transition count 1367
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1598 place count 1567 transition count 1367
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 1 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 3 with 1362 rules applied. Total rules applied 2960 place count 886 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2961 place count 886 transition count 685
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 2963 place count 885 transition count 684
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
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 3165 place count 784 transition count 749
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 3197 place count 768 transition count 760
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3199 place count 766 transition count 758
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3201 place count 764 transition count 758
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3201 place count 764 transition count 757
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3203 place count 763 transition count 757
Applied a total of 3203 rules in 392 ms. Remains 763 /2367 variables (removed 1604) and now considering 757/2167 (removed 1410) transitions.
// Phase 1: matrix 757 rows 763 cols
[2022-05-19 12:49:59] [INFO ] Computed 359 place invariants in 2 ms
[2022-05-19 12:49:59] [INFO ] Implicit Places using invariants in 384 ms returned [752]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 385 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 762/2367 places, 757/2167 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 761 transition count 756
Applied a total of 2 rules in 22 ms. Remains 761 /762 variables (removed 1) and now considering 756/757 (removed 1) transitions.
// Phase 1: matrix 756 rows 761 cols
[2022-05-19 12:49:59] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-19 12:50:00] [INFO ] Implicit Places using invariants in 385 ms returned []
// Phase 1: matrix 756 rows 761 cols
[2022-05-19 12:50:00] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-19 12:50:00] [INFO ] Implicit Places using invariants and state equation in 760 ms returned []
Implicit Place search using SMT with State Equation took 1146 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 761/2367 places, 756/2167 transitions.
Finished structural reductions, in 2 iterations. Remains : 761/2367 places, 756/2167 transitions.
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (EQ s404 0) (EQ s305 0)), p1:(AND (EQ s603 1) (EQ s608 1) (EQ s615 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 612 ms.
Entered a terminal (fully accepting) state of product in 23106 steps with 0 reset in 181 ms.
Treatment of property ShieldIIPt-PT-040B-LTLFireability-08 finished in 2966 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-08 FALSE TECHNIQUES SL_INSENSITIVE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(X(X(X(p0))) U X(p1))&&!(!G(!p2) U p3)))'
[2022-05-19 12:50:01] [INFO ] Flatten gal took : 48 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11686927921272877504
[2022-05-19 12:50:01] [INFO ] Too many transitions (2167) to apply POR reductions. Disabling POR matrices.
[2022-05-19 12:50:01] [INFO ] Applying decomposition
[2022-05-19 12:50:01] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11686927921272877504
Running compilation step : cd /tmp/ltsmin11686927921272877504;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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-19 12:50:01] [INFO ] Flatten gal took : 49 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/graph12896405572113550131.txt' '-o' '/tmp/graph12896405572113550131.bin' '-w' '/tmp/graph12896405572113550131.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12896405572113550131.bin' '-l' '-1' '-v' '-w' '/tmp/graph12896405572113550131.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:50:02] [INFO ] Decomposing Gal with order
[2022-05-19 12:50:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:50:02] [INFO ] Removed a total of 396 redundant transitions.
[2022-05-19 12:50:02] [INFO ] Flatten gal took : 86 ms
[2022-05-19 12:50:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-19 12:50:02] [INFO ] Time to serialize gal into /tmp/LTLFireability15671719107613200168.gal : 10 ms
[2022-05-19 12:50:02] [INFO ] Time to serialize properties into /tmp/LTLFireability9173026419817726607.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/LTLFireability15671719107613200168.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9173026419817726607.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/LTLFireabi...268
Read 2 LTL properties
Checking formula 0 : !(((X(!((X(X(G("(i2.i5.u52.p153==1)"))))||(F("(i19.i6.u427.p1346==1)")))))U(X(G("(i9.i1.u192.p604==1)")))))
Formula 0 simplified : !(X!(XXG"(i2.i5.u52.p153==1)" | F"(i19.i6.u427.p1346==1)") U XG"(i9.i1.u192.p604==1)")
Compilation finished in 4514 ms.
Running link step : cd /tmp/ltsmin11686927921272877504;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11686927921272877504;'/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' '(X(!(X(X([]((LTLAPp3==true))))||<>((LTLAPp4==true)))) U X([]((LTLAPp5==true))))' '--buchi-type=spotba'
LTSmin run took 31202 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin11686927921272877504;'/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' '(!(X(X(X((LTLAPp8==true)))) U X((LTLAPp9==true)))&&!() U (LTLAPp11==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.008: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.022: LTL layer: formula: (!(X(X(X((LTLAPp8==true)))) U X((LTLAPp9==true)))&&!() U (LTLAPp11==true)))
pins2lts-mc-linux64( 0/ 8), 0.022: "(!(X(X(X((LTLAPp8==true)))) U X((LTLAPp9==true)))&&!() U (LTLAPp11==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.023: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.065: buchi has 16 states
pins2lts-mc-linux64( 7/ 8), 0.065: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.068: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.069: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.065: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.078: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.471: DFS-FIFO for weak LTL, using special progress label 2180
pins2lts-mc-linux64( 0/ 8), 0.471: There are 2181 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.471: State length is 2368, there are 2237 groups
pins2lts-mc-linux64( 0/ 8), 0.471: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.471: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.471: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.471: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.690: ~1 levels ~960 states ~5328 transitions
pins2lts-mc-linux64( 1/ 8), 0.887: ~1 levels ~1920 states ~11376 transitions
pins2lts-mc-linux64( 1/ 8), 1.338: ~1 levels ~3840 states ~25568 transitions
pins2lts-mc-linux64( 1/ 8), 2.133: ~1 levels ~7680 states ~52184 transitions
pins2lts-mc-linux64( 1/ 8), 3.731: ~1 levels ~15360 states ~116736 transitions
pins2lts-mc-linux64( 1/ 8), 6.766: ~1 levels ~30720 states ~244896 transitions
pins2lts-mc-linux64( 4/ 8), 13.063: ~1 levels ~61440 states ~549144 transitions
pins2lts-mc-linux64( 4/ 8), 25.623: ~1 levels ~122880 states ~1163136 transitions
pins2lts-mc-linux64( 4/ 8), 50.014: ~1 levels ~245760 states ~2415560 transitions
pins2lts-mc-linux64( 4/ 8), 98.823: ~1 levels ~491520 states ~5066560 transitions
pins2lts-mc-linux64( 5/ 8), 195.643: ~1 levels ~983040 states ~10215440 transitions
pins2lts-mc-linux64( 5/ 8), 405.379: ~1 levels ~1966080 states ~22310880 transitions
pins2lts-mc-linux64( 5/ 8), 801.486: ~1 levels ~3932160 states ~45475848 transitions
pins2lts-mc-linux64( 0/ 8), 1379.249: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1379.358:
pins2lts-mc-linux64( 0/ 8), 1379.358: mean standard work distribution: 12.8% (states) 14.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 1379.358:
pins2lts-mc-linux64( 0/ 8), 1379.358: Explored 6310718 states 78084104 transitions, fanout: 12.373
pins2lts-mc-linux64( 0/ 8), 1379.358: Total exploration time 1378.880 sec (1378.760 sec minimum, 1378.794 sec on average)
pins2lts-mc-linux64( 0/ 8), 1379.358: States per second: 4577, Transitions per second: 56629
pins2lts-mc-linux64( 0/ 8), 1379.358:
pins2lts-mc-linux64( 0/ 8), 1379.358: Progress states detected: 15450763
pins2lts-mc-linux64( 0/ 8), 1379.358: Redundant explorations: -59.1561
pins2lts-mc-linux64( 0/ 8), 1379.358:
pins2lts-mc-linux64( 0/ 8), 1379.358: Queue width: 8B, total height: 14799711, memory: 112.91MB
pins2lts-mc-linux64( 0/ 8), 1379.359: Tree memory: 373.9MB, 25.4 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 1379.359: Tree fill ratio (roots/leafs): 11.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1379.359: Stored 2529 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1379.359: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1379.359: Est. total memory use: 486.8MB (~1136.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11686927921272877504;'/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' '(!(X(X(X((LTLAPp8==true)))) U X((LTLAPp9==true)))&&!() U (LTLAPp11==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11686927921272877504;'/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' '(!(X(X(X((LTLAPp8==true)))) U X((LTLAPp9==true)))&&!() U (LTLAPp11==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-19 13:15:38] [INFO ] Applying decomposition
[2022-05-19 13:15:38] [INFO ] Flatten gal took : 49 ms
[2022-05-19 13:15:38] [INFO ] Decomposing Gal with order
[2022-05-19 13:15:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 13:15:39] [INFO ] Removed a total of 120 redundant transitions.
[2022-05-19 13:15:39] [INFO ] Flatten gal took : 74 ms
[2022-05-19 13:15:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-19 13:15:39] [INFO ] Time to serialize gal into /tmp/LTLFireability10150102980384161489.gal : 13 ms
[2022-05-19 13:15:39] [INFO ] Time to serialize properties into /tmp/LTLFireability14158717654601364388.ltl : 152 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/LTLFireability10150102980384161489.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14158717654601364388.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/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !(((!((X(X(X("(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.i0.i0.i0.u224.p767==1)"))))U(...561
Formula 0 simplified : !(!(XXX"(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.i0.i0.i0.u224.p767==1)" U X"(i0.i...540
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="ShieldIIPt-PT-040B"
export BK_EXAMINATION="LTLFireability"
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 ShieldIIPt-PT-040B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025000316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-040B.tgz
mv ShieldIIPt-PT-040B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;