About the Execution of ITS-Tools for ShieldIIPt-PT-100B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15867.075 | 3600000.00 | 10808302.00 | 19826.80 | TT?FFFFFFFFFFFTF | 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-165286025100348.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-100B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025100348
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.5K Apr 29 18:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 18:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 29 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 29 18:26 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.5K May 9 08:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 17K May 9 08:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 1.7M 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-100B-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-100B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652970094901
Running Version 202205111006
[2022-05-19 14:21:36] [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 14:21:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 14:21:36] [INFO ] Load time of PNML (sax parser for PT used): 275 ms
[2022-05-19 14:21:36] [INFO ] Transformed 7003 places.
[2022-05-19 14:21:36] [INFO ] Transformed 6503 transitions.
[2022-05-19 14:21:36] [INFO ] Found NUPN structural information;
[2022-05-19 14:21:36] [INFO ] Parsed PT model containing 7003 places and 6503 transitions in 647 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPt-PT-100B-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 7003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7003/7003 places, 6503/6503 transitions.
Discarding 1090 places :
Symmetric choice reduction at 0 with 1090 rule applications. Total rules 1090 place count 5913 transition count 5413
Iterating global reduction 0 with 1090 rules applied. Total rules applied 2180 place count 5913 transition count 5413
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2181 place count 5912 transition count 5412
Iterating global reduction 0 with 1 rules applied. Total rules applied 2182 place count 5912 transition count 5412
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2183 place count 5911 transition count 5411
Iterating global reduction 0 with 1 rules applied. Total rules applied 2184 place count 5911 transition count 5411
Applied a total of 2184 rules in 4103 ms. Remains 5911 /7003 variables (removed 1092) and now considering 5411/6503 (removed 1092) transitions.
// Phase 1: matrix 5411 rows 5911 cols
[2022-05-19 14:21:41] [INFO ] Computed 901 place invariants in 59 ms
[2022-05-19 14:21:43] [INFO ] Implicit Places using invariants in 2561 ms returned []
// Phase 1: matrix 5411 rows 5911 cols
[2022-05-19 14:21:43] [INFO ] Computed 901 place invariants in 29 ms
[2022-05-19 14:21:45] [INFO ] Implicit Places using invariants and state equation in 1853 ms returned []
Implicit Place search using SMT with State Equation took 4447 ms to find 0 implicit places.
// Phase 1: matrix 5411 rows 5911 cols
[2022-05-19 14:21:45] [INFO ] Computed 901 place invariants in 23 ms
[2022-05-19 14:21:49] [INFO ] Dead Transitions using invariants and state equation in 3825 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5911/7003 places, 5411/6503 transitions.
Finished structural reductions, in 1 iterations. Remains : 5911/7003 places, 5411/6503 transitions.
Support contains 37 out of 5911 places after structural reductions.
[2022-05-19 14:21:50] [INFO ] Flatten gal took : 316 ms
[2022-05-19 14:21:50] [INFO ] Flatten gal took : 191 ms
[2022-05-19 14:21:50] [INFO ] Input system was already deterministic with 5411 transitions.
Support contains 36 out of 5911 places (down from 37) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 576 ms. (steps per millisecond=17 ) properties (out of 27) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) 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 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) 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 16) 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 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) 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 16) 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 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 5411 rows 5911 cols
[2022-05-19 14:21:51] [INFO ] Computed 901 place invariants in 26 ms
[2022-05-19 14:21:53] [INFO ] After 2043ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2022-05-19 14:21:55] [INFO ] [Nat]Absence check using 901 positive place invariants in 587 ms returned sat
[2022-05-19 14:22:05] [INFO ] After 8416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2022-05-19 14:22:07] [INFO ] Deduced a trap composed of 18 places in 2021 ms of which 17 ms to minimize.
[2022-05-19 14:22:09] [INFO ] Deduced a trap composed of 18 places in 1946 ms of which 13 ms to minimize.
[2022-05-19 14:22:12] [INFO ] Deduced a trap composed of 17 places in 1975 ms of which 5 ms to minimize.
[2022-05-19 14:22:14] [INFO ] Deduced a trap composed of 16 places in 1863 ms of which 3 ms to minimize.
[2022-05-19 14:22:16] [INFO ] Deduced a trap composed of 22 places in 1761 ms of which 3 ms to minimize.
[2022-05-19 14:22:18] [INFO ] Deduced a trap composed of 21 places in 1835 ms of which 3 ms to minimize.
[2022-05-19 14:22:20] [INFO ] Deduced a trap composed of 20 places in 1690 ms of which 2 ms to minimize.
[2022-05-19 14:22:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 14:22:20] [INFO ] After 26527ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:16
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 5356 ms.
Support contains 24 out of 5911 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5911/5911 places, 5411/5411 transitions.
Drop transitions removed 1192 transitions
Trivial Post-agglo rules discarded 1192 transitions
Performed 1192 trivial Post agglomeration. Transition count delta: 1192
Iterating post reduction 0 with 1192 rules applied. Total rules applied 1192 place count 5911 transition count 4219
Reduce places removed 1192 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 1195 rules applied. Total rules applied 2387 place count 4719 transition count 4216
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 2390 place count 4716 transition count 4216
Performed 786 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 786 Pre rules applied. Total rules applied 2390 place count 4716 transition count 3430
Deduced a syphon composed of 786 places in 11 ms
Reduce places removed 786 places and 0 transitions.
Iterating global reduction 3 with 1572 rules applied. Total rules applied 3962 place count 3930 transition count 3430
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 3966 place count 3926 transition count 3426
Iterating global reduction 3 with 4 rules applied. Total rules applied 3970 place count 3926 transition count 3426
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 3970 place count 3926 transition count 3423
Deduced a syphon composed of 3 places in 9 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 3976 place count 3923 transition count 3423
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 5 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 3 with 3398 rules applied. Total rules applied 7374 place count 2224 transition count 1724
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7375 place count 2224 transition count 1723
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 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7377 place count 2223 transition count 1722
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -64
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7579 place count 2122 transition count 1786
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -64
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7781 place count 2021 transition count 1850
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: -61
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 4 with 180 rules applied. Total rules applied 7961 place count 1931 transition count 1911
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7962 place count 1931 transition count 1910
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 7963 place count 1931 transition count 1909
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 7964 place count 1930 transition count 1909
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 6 with 100 rules applied. Total rules applied 8064 place count 1930 transition count 1909
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 8065 place count 1929 transition count 1908
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 8067 place count 1927 transition count 1908
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 8067 place count 1927 transition count 1907
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 8069 place count 1926 transition count 1907
Applied a total of 8069 rules in 2004 ms. Remains 1926 /5911 variables (removed 3985) and now considering 1907/5411 (removed 3504) transitions.
Finished structural reductions, in 1 iterations. Remains : 1926/5911 places, 1907/5411 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 16) seen :1
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 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 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 17 ms. (steps per millisecond=58 ) 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 17 ms. (steps per millisecond=58 ) 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 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) 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
Interrupted probabilistic random walk after 55693 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 55693 steps, saw 35229 distinct states, run finished after 3003 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 1907 rows 1926 cols
[2022-05-19 14:22:31] [INFO ] Computed 899 place invariants in 4 ms
[2022-05-19 14:22:31] [INFO ] After 654ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-19 14:22:32] [INFO ] [Nat]Absence check using 899 positive place invariants in 149 ms returned sat
[2022-05-19 14:22:34] [INFO ] After 1695ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-05-19 14:22:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:22:35] [INFO ] After 969ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2022-05-19 14:22:37] [INFO ] After 2656ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 970 ms.
[2022-05-19 14:22:38] [INFO ] After 6526ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 1062 ms.
Support contains 23 out of 1926 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1926/1926 places, 1907/1907 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1925 transition count 1906
Applied a total of 2 rules in 109 ms. Remains 1925 /1926 variables (removed 1) and now considering 1906/1907 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1925/1926 places, 1906/1907 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) 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 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) 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 17 ms. (steps per millisecond=58 ) 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
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 17 ms. (steps per millisecond=58 ) 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
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
Interrupted probabilistic random walk after 56962 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 56962 steps, saw 36087 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 1906 rows 1925 cols
[2022-05-19 14:22:43] [INFO ] Computed 899 place invariants in 6 ms
[2022-05-19 14:22:43] [INFO ] After 604ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-19 14:22:44] [INFO ] [Nat]Absence check using 899 positive place invariants in 136 ms returned sat
[2022-05-19 14:22:46] [INFO ] After 1699ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-05-19 14:22:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:22:47] [INFO ] After 997ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2022-05-19 14:22:49] [INFO ] After 2672ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 982 ms.
[2022-05-19 14:22:50] [INFO ] After 6567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 385 ms.
Support contains 23 out of 1925 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1925/1925 places, 1906/1906 transitions.
Applied a total of 0 rules in 49 ms. Remains 1925 /1925 variables (removed 0) and now considering 1906/1906 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1925/1925 places, 1906/1906 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1925/1925 places, 1906/1906 transitions.
Applied a total of 0 rules in 51 ms. Remains 1925 /1925 variables (removed 0) and now considering 1906/1906 (removed 0) transitions.
// Phase 1: matrix 1906 rows 1925 cols
[2022-05-19 14:22:50] [INFO ] Computed 899 place invariants in 4 ms
[2022-05-19 14:22:51] [INFO ] Implicit Places using invariants in 1107 ms returned [1914]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1110 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1924/1925 places, 1906/1906 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1923 transition count 1905
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1923 transition count 1905
Applied a total of 2 rules in 86 ms. Remains 1923 /1924 variables (removed 1) and now considering 1905/1906 (removed 1) transitions.
// Phase 1: matrix 1905 rows 1923 cols
[2022-05-19 14:22:52] [INFO ] Computed 898 place invariants in 9 ms
[2022-05-19 14:22:53] [INFO ] Implicit Places using invariants in 1141 ms returned []
// Phase 1: matrix 1905 rows 1923 cols
[2022-05-19 14:22:53] [INFO ] Computed 898 place invariants in 3 ms
[2022-05-19 14:22:55] [INFO ] Implicit Places using invariants and state equation in 2592 ms returned []
Implicit Place search using SMT with State Equation took 3736 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1923/1925 places, 1905/1906 transitions.
Finished structural reductions, in 2 iterations. Remains : 1923/1925 places, 1905/1906 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) 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 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 54274 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 54274 steps, saw 34408 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 1905 rows 1923 cols
[2022-05-19 14:22:59] [INFO ] Computed 898 place invariants in 4 ms
[2022-05-19 14:23:00] [INFO ] After 653ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-19 14:23:00] [INFO ] [Nat]Absence check using 898 positive place invariants in 155 ms returned sat
[2022-05-19 14:23:03] [INFO ] After 1713ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-05-19 14:23:04] [INFO ] After 3362ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 961 ms.
[2022-05-19 14:23:05] [INFO ] After 5594ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 1239 ms.
Support contains 23 out of 1923 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1923/1923 places, 1905/1905 transitions.
Applied a total of 0 rules in 50 ms. Remains 1923 /1923 variables (removed 0) and now considering 1905/1905 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1923/1923 places, 1905/1905 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1923/1923 places, 1905/1905 transitions.
Applied a total of 0 rules in 52 ms. Remains 1923 /1923 variables (removed 0) and now considering 1905/1905 (removed 0) transitions.
// Phase 1: matrix 1905 rows 1923 cols
[2022-05-19 14:23:07] [INFO ] Computed 898 place invariants in 8 ms
[2022-05-19 14:23:08] [INFO ] Implicit Places using invariants in 1165 ms returned []
// Phase 1: matrix 1905 rows 1923 cols
[2022-05-19 14:23:08] [INFO ] Computed 898 place invariants in 4 ms
[2022-05-19 14:23:10] [INFO ] Implicit Places using invariants and state equation in 2546 ms returned []
Implicit Place search using SMT with State Equation took 3713 ms to find 0 implicit places.
[2022-05-19 14:23:10] [INFO ] Redundant transitions in 179 ms returned []
// Phase 1: matrix 1905 rows 1923 cols
[2022-05-19 14:23:10] [INFO ] Computed 898 place invariants in 6 ms
[2022-05-19 14:23:12] [INFO ] Dead Transitions using invariants and state equation in 1134 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1923/1923 places, 1905/1905 transitions.
Partial Free-agglomeration rule applied 193 times.
Drop transitions removed 193 transitions
Iterating global reduction 0 with 193 rules applied. Total rules applied 193 place count 1923 transition count 1905
Applied a total of 193 rules in 98 ms. Remains 1923 /1923 variables (removed 0) and now considering 1905/1905 (removed 0) transitions.
Running SMT prover for 15 properties.
// Phase 1: matrix 1905 rows 1923 cols
[2022-05-19 14:23:12] [INFO ] Computed 898 place invariants in 5 ms
[2022-05-19 14:23:12] [INFO ] After 639ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-19 14:23:13] [INFO ] [Nat]Absence check using 898 positive place invariants in 141 ms returned sat
[2022-05-19 14:23:15] [INFO ] After 1718ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-05-19 14:23:15] [INFO ] State equation strengthened by 188 read => feed constraints.
[2022-05-19 14:23:17] [INFO ] After 1679ms SMT Verify possible using 188 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2022-05-19 14:23:19] [INFO ] After 3826ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 1530 ms.
[2022-05-19 14:23:21] [INFO ] After 8266ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
[2022-05-19 14:23:21] [INFO ] Flatten gal took : 76 ms
[2022-05-19 14:23:21] [INFO ] Flatten gal took : 72 ms
[2022-05-19 14:23:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6718833696036041567.gal : 41 ms
[2022-05-19 14:23:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17801821997391107010.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms17639315978060812110;'/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/ReachabilityCardinality6718833696036041567.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17801821997391107010.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/ReachabilityCardinality17801821997391107010.prop.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :8 after 32
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :32 after 64
Reachability property AtomicPropp25 is true.
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :64 after 8256
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :8256 after 9112
Reachability property AtomicPropp7 is true.
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :9112 after 9402
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :9402 after 13987
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :13987 after 74938
SDD proceeding with computation,13 properties remain. new max is 1024
SDD size :74938 after 7.37336e+06
SDD proceeding with computation,13 properties remain. new max is 2048
SDD size :7.37336e+06 after 5.46378e+07
SDD proceeding with computation,13 properties remain. new max is 4096
SDD size :5.46378e+07 after 3.64271e+10
SDD proceeding with computation,13 properties remain. new max is 8192
SDD size :3.64271e+10 after 2.47402e+15
SDD proceeding with computation,13 properties remain. new max is 16384
SDD size :2.47402e+15 after 9.72101e+18
Reachability property AtomicPropp10 is true.
SDD proceeding with computation,12 properties remain. new max is 16384
SDD size :9.72101e+18 after 5.09142e+27
SDD proceeding with computation,12 properties remain. new max is 32768
SDD size :5.09142e+27 after 2.07502e+33
SDD proceeding with computation,12 properties remain. new max is 65536
SDD size :2.07502e+33 after 5.47296e+41
Reachability property AtomicPropp22 is true.
SDD proceeding with computation,11 properties remain. new max is 65536
SDD size :5.47296e+41 after 1.83643e+53
Detected timeout of ITS tools.
[2022-05-19 14:23:36] [INFO ] Flatten gal took : 71 ms
[2022-05-19 14:23:36] [INFO ] Applying decomposition
[2022-05-19 14:23:36] [INFO ] Flatten gal took : 68 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/graph8447431331857105745.txt' '-o' '/tmp/graph8447431331857105745.bin' '-w' '/tmp/graph8447431331857105745.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8447431331857105745.bin' '-l' '-1' '-v' '-w' '/tmp/graph8447431331857105745.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:23:36] [INFO ] Decomposing Gal with order
[2022-05-19 14:23:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:23:37] [INFO ] Removed a total of 1103 redundant transitions.
[2022-05-19 14:23:37] [INFO ] Flatten gal took : 176 ms
[2022-05-19 14:23:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 32 ms.
[2022-05-19 14:23:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2003228984770224369.gal : 24 ms
[2022-05-19 14:23:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7194991020782049662.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17639315978060812110;'/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/ReachabilityCardinality2003228984770224369.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7194991020782049662.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/ReachabilityCardinality7194991020782049662.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :1 after 1
Reachability property AtomicPropp21 is true.
Reachability property AtomicPropp2 is true.
Reachability property AtomicPropp1 is true.
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :1.24571e+09 after 3.01083e+82
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15310643724408009758
[2022-05-19 14:23:52] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15310643724408009758
Running compilation step : cd /tmp/ltsmin15310643724408009758;'/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/ltsmin15310643724408009758;'/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/ltsmin15310643724408009758;'/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)
FORMULA ShieldIIPt-PT-100B-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1602 stabilizing places and 1602 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 5911 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5911/5911 places, 5411/5411 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 5902 transition count 5402
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 5902 transition count 5402
Applied a total of 18 rules in 1567 ms. Remains 5902 /5911 variables (removed 9) and now considering 5402/5411 (removed 9) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2022-05-19 14:23:58] [INFO ] Computed 901 place invariants in 20 ms
[2022-05-19 14:24:00] [INFO ] Implicit Places using invariants in 1797 ms returned []
// Phase 1: matrix 5402 rows 5902 cols
[2022-05-19 14:24:00] [INFO ] Computed 901 place invariants in 25 ms
[2022-05-19 14:24:01] [INFO ] Implicit Places using invariants and state equation in 1766 ms returned []
Implicit Place search using SMT with State Equation took 3564 ms to find 0 implicit places.
// Phase 1: matrix 5402 rows 5902 cols
[2022-05-19 14:24:01] [INFO ] Computed 901 place invariants in 17 ms
[2022-05-19 14:24:05] [INFO ] Dead Transitions using invariants and state equation in 3828 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5902/5911 places, 5402/5411 transitions.
Finished structural reductions, in 1 iterations. Remains : 5902/5911 places, 5402/5411 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s63 1) (EQ s5537 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 3330 ms.
Product exploration explored 100000 steps with 50000 reset in 3218 ms.
Computed a total of 1599 stabilizing places and 1599 stable transitions
Computed a total of 1599 stabilizing places and 1599 stable transitions
Detected a total of 1599/5902 stabilizing places and 1599/5402 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPt-PT-100B-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-100B-LTLFireability-00 finished in 16877 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(X(p1))||p0))))'
Support contains 4 out of 5911 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5911/5911 places, 5411/5411 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 5903 transition count 5403
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 5903 transition count 5403
Applied a total of 16 rules in 1419 ms. Remains 5903 /5911 variables (removed 8) and now considering 5403/5411 (removed 8) transitions.
// Phase 1: matrix 5403 rows 5903 cols
[2022-05-19 14:24:14] [INFO ] Computed 901 place invariants in 22 ms
[2022-05-19 14:24:15] [INFO ] Implicit Places using invariants in 1780 ms returned []
// Phase 1: matrix 5403 rows 5903 cols
[2022-05-19 14:24:15] [INFO ] Computed 901 place invariants in 18 ms
[2022-05-19 14:24:17] [INFO ] Implicit Places using invariants and state equation in 1861 ms returned []
Implicit Place search using SMT with State Equation took 3644 ms to find 0 implicit places.
// Phase 1: matrix 5403 rows 5903 cols
[2022-05-19 14:24:17] [INFO ] Computed 901 place invariants in 23 ms
[2022-05-19 14:24:21] [INFO ] Dead Transitions using invariants and state equation in 3657 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5903/5911 places, 5403/5411 transitions.
Finished structural reductions, in 1 iterations. Remains : 5903/5911 places, 5403/5411 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s5133 0), p0:(OR (EQ s5133 0) (EQ s4057 0) (EQ s4086 0) (AND (EQ s4057 1) (EQ s4086 1) (EQ s5725 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][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1449 ms.
Product exploration explored 100000 steps with 0 reset in 1900 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 193038 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 193038 steps, saw 190183 distinct states, run finished after 3002 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5403 rows 5903 cols
[2022-05-19 14:24:28] [INFO ] Computed 901 place invariants in 18 ms
[2022-05-19 14:24:29] [INFO ] After 742ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 14:24:30] [INFO ] [Nat]Absence check using 901 positive place invariants in 572 ms returned sat
[2022-05-19 14:24:35] [INFO ] After 4428ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 14:24:37] [INFO ] Deduced a trap composed of 24 places in 2091 ms of which 3 ms to minimize.
[2022-05-19 14:24:39] [INFO ] Deduced a trap composed of 23 places in 2039 ms of which 4 ms to minimize.
[2022-05-19 14:24:42] [INFO ] Deduced a trap composed of 24 places in 1965 ms of which 5 ms to minimize.
[2022-05-19 14:24:44] [INFO ] Deduced a trap composed of 17 places in 1955 ms of which 3 ms to minimize.
[2022-05-19 14:24:46] [INFO ] Deduced a trap composed of 25 places in 2010 ms of which 3 ms to minimize.
[2022-05-19 14:24:48] [INFO ] Deduced a trap composed of 28 places in 1924 ms of which 3 ms to minimize.
[2022-05-19 14:24:50] [INFO ] Deduced a trap composed of 17 places in 1995 ms of which 3 ms to minimize.
[2022-05-19 14:24:52] [INFO ] Deduced a trap composed of 17 places in 1975 ms of which 3 ms to minimize.
[2022-05-19 14:24:55] [INFO ] Deduced a trap composed of 20 places in 1989 ms of which 3 ms to minimize.
[2022-05-19 14:24:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 14:24:55] [INFO ] After 25548ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 326 ms.
Support contains 4 out of 5903 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5903/5903 places, 5403/5403 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5903 transition count 4205
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4705 transition count 4205
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2396 place count 4705 transition count 3406
Deduced a syphon composed of 799 places in 10 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 3994 place count 3906 transition count 3406
Performed 1702 Post agglomeration using F-continuation condition.Transition count delta: 1702
Deduced a syphon composed of 1702 places in 4 ms
Reduce places removed 1702 places and 0 transitions.
Iterating global reduction 2 with 3404 rules applied. Total rules applied 7398 place count 2204 transition count 1704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7399 place count 2204 transition count 1703
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 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7401 place count 2203 transition count 1702
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7603 place count 2102 transition count 1768
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7805 place count 2001 transition count 1836
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 7999 place count 1904 transition count 1901
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8000 place count 1904 transition count 1900
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 4 with 100 rules applied. Total rules applied 8100 place count 1904 transition count 1900
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8101 place count 1903 transition count 1899
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8103 place count 1901 transition count 1899
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 8103 place count 1901 transition count 1898
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 8105 place count 1900 transition count 1898
Applied a total of 8105 rules in 1293 ms. Remains 1900 /5903 variables (removed 4003) and now considering 1898/5403 (removed 3505) transitions.
Finished structural reductions, in 1 iterations. Remains : 1900/5903 places, 1898/5403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 84079 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84079 steps, saw 53199 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1898 rows 1900 cols
[2022-05-19 14:25:00] [INFO ] Computed 899 place invariants in 6 ms
[2022-05-19 14:25:00] [INFO ] After 246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 14:25:00] [INFO ] [Nat]Absence check using 899 positive place invariants in 149 ms returned sat
[2022-05-19 14:25:01] [INFO ] After 878ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 14:25:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:25:01] [INFO ] After 126ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-19 14:25:02] [INFO ] After 364ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 129 ms.
[2022-05-19 14:25:02] [INFO ] After 1820ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 62 ms.
Support contains 4 out of 1900 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1900/1900 places, 1898/1898 transitions.
Applied a total of 0 rules in 44 ms. Remains 1900 /1900 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1900/1900 places, 1898/1898 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1900/1900 places, 1898/1898 transitions.
Applied a total of 0 rules in 43 ms. Remains 1900 /1900 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
// Phase 1: matrix 1898 rows 1900 cols
[2022-05-19 14:25:02] [INFO ] Computed 899 place invariants in 6 ms
[2022-05-19 14:25:03] [INFO ] Implicit Places using invariants in 1103 ms returned [1889]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1104 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1899/1900 places, 1898/1898 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1898 transition count 1897
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1898 transition count 1897
Applied a total of 2 rules in 81 ms. Remains 1898 /1899 variables (removed 1) and now considering 1897/1898 (removed 1) transitions.
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:25:03] [INFO ] Computed 898 place invariants in 2 ms
[2022-05-19 14:25:04] [INFO ] Implicit Places using invariants in 1165 ms returned []
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:25:04] [INFO ] Computed 898 place invariants in 2 ms
[2022-05-19 14:25:07] [INFO ] Implicit Places using invariants and state equation in 2526 ms returned []
Implicit Place search using SMT with State Equation took 3701 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1898/1900 places, 1897/1898 transitions.
Finished structural reductions, in 2 iterations. Remains : 1898/1900 places, 1897/1898 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:25:07] [INFO ] Computed 898 place invariants in 3 ms
[2022-05-19 14:25:07] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:25:08] [INFO ] [Nat]Absence check using 898 positive place invariants in 145 ms returned sat
[2022-05-19 14:25:08] [INFO ] After 777ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:25:08] [INFO ] After 891ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2022-05-19 14:25:09] [INFO ] After 1338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 47 ms.
Support contains 4 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 43 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1898/1898 places, 1897/1897 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 96086 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96086 steps, saw 61131 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:25:12] [INFO ] Computed 898 place invariants in 7 ms
[2022-05-19 14:25:12] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:25:12] [INFO ] [Nat]Absence check using 898 positive place invariants in 148 ms returned sat
[2022-05-19 14:25:13] [INFO ] After 809ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:25:13] [INFO ] After 931ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2022-05-19 14:25:14] [INFO ] After 1386ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 55 ms.
Support contains 4 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 45 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1898/1898 places, 1897/1897 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 45 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:25:14] [INFO ] Computed 898 place invariants in 6 ms
[2022-05-19 14:25:15] [INFO ] Implicit Places using invariants in 1163 ms returned []
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:25:15] [INFO ] Computed 898 place invariants in 2 ms
[2022-05-19 14:25:17] [INFO ] Implicit Places using invariants and state equation in 2576 ms returned []
Implicit Place search using SMT with State Equation took 3742 ms to find 0 implicit places.
[2022-05-19 14:25:17] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:25:17] [INFO ] Computed 898 place invariants in 3 ms
[2022-05-19 14:25:18] [INFO ] Dead Transitions using invariants and state equation in 1025 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1898/1898 places, 1897/1897 transitions.
Partial Free-agglomeration rule applied 199 times.
Drop transitions removed 199 transitions
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 1898 transition count 1897
Applied a total of 199 rules in 90 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:25:19] [INFO ] Computed 898 place invariants in 6 ms
[2022-05-19 14:25:19] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:25:19] [INFO ] [Nat]Absence check using 898 positive place invariants in 143 ms returned sat
[2022-05-19 14:25:20] [INFO ] After 776ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:25:20] [INFO ] State equation strengthened by 197 read => feed constraints.
[2022-05-19 14:25:20] [INFO ] After 227ms SMT Verify possible using 197 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 14:25:20] [INFO ] After 353ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2022-05-19 14:25:20] [INFO ] After 1595ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 14:25:20] [INFO ] Flatten gal took : 72 ms
[2022-05-19 14:25:21] [INFO ] Flatten gal took : 69 ms
[2022-05-19 14:25:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality288946915151559723.gal : 7 ms
[2022-05-19 14:25:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16883168191462505138.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms11124060335443522917;'/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/ReachabilityCardinality288946915151559723.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16883168191462505138.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/ReachabilityCardinality16883168191462505138.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 20
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :20 after 58
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :58 after 124
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :124 after 255
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :255 after 384
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :384 after 743
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :743 after 24675
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :24675 after 4.34757e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.34757e+06 after 5.44738e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5.44738e+07 after 3.56071e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.56071e+10 after 1.36296e+15
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.36296e+15 after 9.72084e+18
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :9.72084e+18 after 2.54666e+27
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.54666e+27 after 3.84445e+37
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :3.84445e+37 after 4.37127e+52
Detected timeout of ITS tools.
[2022-05-19 14:25:36] [INFO ] Flatten gal took : 67 ms
[2022-05-19 14:25:36] [INFO ] Applying decomposition
[2022-05-19 14:25:36] [INFO ] Flatten gal took : 73 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/graph10533630957602160334.txt' '-o' '/tmp/graph10533630957602160334.bin' '-w' '/tmp/graph10533630957602160334.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10533630957602160334.bin' '-l' '-1' '-v' '-w' '/tmp/graph10533630957602160334.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:25:36] [INFO ] Decomposing Gal with order
[2022-05-19 14:25:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:25:36] [INFO ] Removed a total of 1096 redundant transitions.
[2022-05-19 14:25:36] [INFO ] Flatten gal took : 110 ms
[2022-05-19 14:25:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 15 ms.
[2022-05-19 14:25:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9232504396787594209.gal : 15 ms
[2022-05-19 14:25:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11383306387877970180.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms11124060335443522917;'/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/ReachabilityCardinality9232504396787594209.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11383306387877970180.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/ReachabilityCardinality11383306387877970180.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
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1 after 1
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6813230494555211615
[2022-05-19 14:25:51] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6813230494555211615
Running compilation step : cd /tmp/ltsmin6813230494555211615;'/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/ltsmin6813230494555211615;'/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/ltsmin6813230494555211615;'/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)
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 5903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5903/5903 places, 5403/5403 transitions.
Applied a total of 0 rules in 756 ms. Remains 5903 /5903 variables (removed 0) and now considering 5403/5403 (removed 0) transitions.
// Phase 1: matrix 5403 rows 5903 cols
[2022-05-19 14:25:56] [INFO ] Computed 901 place invariants in 32 ms
[2022-05-19 14:25:57] [INFO ] Implicit Places using invariants in 1893 ms returned []
// Phase 1: matrix 5403 rows 5903 cols
[2022-05-19 14:25:57] [INFO ] Computed 901 place invariants in 15 ms
[2022-05-19 14:25:59] [INFO ] Implicit Places using invariants and state equation in 1848 ms returned []
Implicit Place search using SMT with State Equation took 3742 ms to find 0 implicit places.
// Phase 1: matrix 5403 rows 5903 cols
[2022-05-19 14:25:59] [INFO ] Computed 901 place invariants in 15 ms
[2022-05-19 14:26:03] [INFO ] Dead Transitions using invariants and state equation in 3727 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5903/5903 places, 5403/5403 transitions.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 197609 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 197609 steps, saw 194621 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5403 rows 5903 cols
[2022-05-19 14:26:07] [INFO ] Computed 901 place invariants in 21 ms
[2022-05-19 14:26:07] [INFO ] After 642ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 14:26:09] [INFO ] [Nat]Absence check using 901 positive place invariants in 556 ms returned sat
[2022-05-19 14:26:13] [INFO ] After 4739ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 14:26:16] [INFO ] Deduced a trap composed of 24 places in 2080 ms of which 3 ms to minimize.
[2022-05-19 14:26:18] [INFO ] Deduced a trap composed of 23 places in 2011 ms of which 3 ms to minimize.
[2022-05-19 14:26:20] [INFO ] Deduced a trap composed of 24 places in 1940 ms of which 2 ms to minimize.
[2022-05-19 14:26:22] [INFO ] Deduced a trap composed of 17 places in 1953 ms of which 4 ms to minimize.
[2022-05-19 14:26:24] [INFO ] Deduced a trap composed of 25 places in 1906 ms of which 3 ms to minimize.
[2022-05-19 14:26:27] [INFO ] Deduced a trap composed of 28 places in 2029 ms of which 4 ms to minimize.
[2022-05-19 14:26:29] [INFO ] Deduced a trap composed of 17 places in 1906 ms of which 4 ms to minimize.
[2022-05-19 14:26:31] [INFO ] Deduced a trap composed of 17 places in 1955 ms of which 3 ms to minimize.
[2022-05-19 14:26:33] [INFO ] Deduced a trap composed of 20 places in 2034 ms of which 3 ms to minimize.
[2022-05-19 14:26:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 14:26:33] [INFO ] After 25631ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 348 ms.
Support contains 4 out of 5903 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5903/5903 places, 5403/5403 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5903 transition count 4205
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4705 transition count 4205
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2396 place count 4705 transition count 3406
Deduced a syphon composed of 799 places in 10 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 3994 place count 3906 transition count 3406
Performed 1702 Post agglomeration using F-continuation condition.Transition count delta: 1702
Deduced a syphon composed of 1702 places in 4 ms
Reduce places removed 1702 places and 0 transitions.
Iterating global reduction 2 with 3404 rules applied. Total rules applied 7398 place count 2204 transition count 1704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7399 place count 2204 transition count 1703
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 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7401 place count 2203 transition count 1702
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7603 place count 2102 transition count 1768
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7805 place count 2001 transition count 1836
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 7999 place count 1904 transition count 1901
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8000 place count 1904 transition count 1900
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 4 with 100 rules applied. Total rules applied 8100 place count 1904 transition count 1900
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8101 place count 1903 transition count 1899
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8103 place count 1901 transition count 1899
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 8103 place count 1901 transition count 1898
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 8105 place count 1900 transition count 1898
Applied a total of 8105 rules in 1177 ms. Remains 1900 /5903 variables (removed 4003) and now considering 1898/5403 (removed 3505) transitions.
Finished structural reductions, in 1 iterations. Remains : 1900/5903 places, 1898/5403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 84612 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84612 steps, saw 53504 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1898 rows 1900 cols
[2022-05-19 14:26:38] [INFO ] Computed 899 place invariants in 4 ms
[2022-05-19 14:26:38] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 14:26:39] [INFO ] [Nat]Absence check using 899 positive place invariants in 147 ms returned sat
[2022-05-19 14:26:40] [INFO ] After 880ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 14:26:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:26:40] [INFO ] After 130ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-19 14:26:40] [INFO ] After 347ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 127 ms.
[2022-05-19 14:26:40] [INFO ] After 1811ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 48 ms.
Support contains 4 out of 1900 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1900/1900 places, 1898/1898 transitions.
Applied a total of 0 rules in 53 ms. Remains 1900 /1900 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1900/1900 places, 1898/1898 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1900/1900 places, 1898/1898 transitions.
Applied a total of 0 rules in 44 ms. Remains 1900 /1900 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
// Phase 1: matrix 1898 rows 1900 cols
[2022-05-19 14:26:40] [INFO ] Computed 899 place invariants in 6 ms
[2022-05-19 14:26:41] [INFO ] Implicit Places using invariants in 1173 ms returned [1889]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1175 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1899/1900 places, 1898/1898 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1898 transition count 1897
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1898 transition count 1897
Applied a total of 2 rules in 82 ms. Remains 1898 /1899 variables (removed 1) and now considering 1897/1898 (removed 1) transitions.
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:26:41] [INFO ] Computed 898 place invariants in 6 ms
[2022-05-19 14:26:43] [INFO ] Implicit Places using invariants in 1117 ms returned []
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:26:43] [INFO ] Computed 898 place invariants in 3 ms
[2022-05-19 14:26:45] [INFO ] Implicit Places using invariants and state equation in 2551 ms returned []
Implicit Place search using SMT with State Equation took 3672 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1898/1900 places, 1897/1898 transitions.
Finished structural reductions, in 2 iterations. Remains : 1898/1900 places, 1897/1898 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 86958 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86958 steps, saw 55073 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:26:49] [INFO ] Computed 898 place invariants in 4 ms
[2022-05-19 14:26:49] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 14:26:49] [INFO ] [Nat]Absence check using 898 positive place invariants in 150 ms returned sat
[2022-05-19 14:26:50] [INFO ] After 885ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 14:26:50] [INFO ] After 1103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 137 ms.
[2022-05-19 14:26:50] [INFO ] After 1701ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 63 ms.
Support contains 4 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 43 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1898/1898 places, 1897/1897 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 45 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:26:51] [INFO ] Computed 898 place invariants in 7 ms
[2022-05-19 14:26:52] [INFO ] Implicit Places using invariants in 1118 ms returned []
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:26:52] [INFO ] Computed 898 place invariants in 3 ms
[2022-05-19 14:26:54] [INFO ] Implicit Places using invariants and state equation in 2538 ms returned []
Implicit Place search using SMT with State Equation took 3663 ms to find 0 implicit places.
[2022-05-19 14:26:54] [INFO ] Redundant transitions in 117 ms returned []
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:26:54] [INFO ] Computed 898 place invariants in 3 ms
[2022-05-19 14:26:56] [INFO ] Dead Transitions using invariants and state equation in 1113 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1898/1898 places, 1897/1897 transitions.
Partial Free-agglomeration rule applied 199 times.
Drop transitions removed 199 transitions
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 1898 transition count 1897
Applied a total of 199 rules in 87 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:26:56] [INFO ] Computed 898 place invariants in 7 ms
[2022-05-19 14:26:56] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 14:26:56] [INFO ] [Nat]Absence check using 898 positive place invariants in 141 ms returned sat
[2022-05-19 14:26:57] [INFO ] After 845ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 14:26:57] [INFO ] State equation strengthened by 197 read => feed constraints.
[2022-05-19 14:26:58] [INFO ] After 399ms SMT Verify possible using 197 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-19 14:26:58] [INFO ] After 643ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 149 ms.
[2022-05-19 14:26:58] [INFO ] After 2069ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-19 14:26:58] [INFO ] Flatten gal took : 60 ms
[2022-05-19 14:26:58] [INFO ] Flatten gal took : 59 ms
[2022-05-19 14:26:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3827831895856754651.gal : 7 ms
[2022-05-19 14:26:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6668123919136827204.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16464187869471948819;'/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/ReachabilityCardinality3827831895856754651.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6668123919136827204.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/ReachabilityCardinality6668123919136827204.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 20
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :20 after 58
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :58 after 124
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :124 after 255
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :255 after 384
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :384 after 743
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :743 after 24675
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :24675 after 4.34757e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4.34757e+06 after 5.44738e+07
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :5.44738e+07 after 3.56071e+10
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3.56071e+10 after 1.36296e+15
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.36296e+15 after 9.72084e+18
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :9.72084e+18 after 2.54666e+27
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.54666e+27 after 3.84445e+37
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :3.84445e+37 after 4.37127e+52
Detected timeout of ITS tools.
[2022-05-19 14:27:13] [INFO ] Flatten gal took : 60 ms
[2022-05-19 14:27:13] [INFO ] Applying decomposition
[2022-05-19 14:27:13] [INFO ] Flatten gal took : 61 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/graph6898372330284624036.txt' '-o' '/tmp/graph6898372330284624036.bin' '-w' '/tmp/graph6898372330284624036.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6898372330284624036.bin' '-l' '-1' '-v' '-w' '/tmp/graph6898372330284624036.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:27:13] [INFO ] Decomposing Gal with order
[2022-05-19 14:27:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:27:14] [INFO ] Removed a total of 1093 redundant transitions.
[2022-05-19 14:27:14] [INFO ] Flatten gal took : 95 ms
[2022-05-19 14:27:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 21 ms.
[2022-05-19 14:27:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1358750806306649791.gal : 10 ms
[2022-05-19 14:27:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality970739666300638617.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16464187869471948819;'/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/ReachabilityCardinality1358750806306649791.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality970739666300638617.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...297
Loading property file /tmp/ReachabilityCardinality970739666300638617.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1 after 1
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3587443394964328466
[2022-05-19 14:27:29] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3587443394964328466
Running compilation step : cd /tmp/ltsmin3587443394964328466;'/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/ltsmin3587443394964328466;'/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/ltsmin3587443394964328466;'/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)
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 557 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 1326 ms.
Product exploration explored 100000 steps with 0 reset in 1836 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 5903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5903/5903 places, 5403/5403 transitions.
Performed 1198 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5903 transition count 5403
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 401 Pre rules applied. Total rules applied 1198 place count 5903 transition count 5705
Deduced a syphon composed of 1599 places in 17 ms
Iterating global reduction 1 with 401 rules applied. Total rules applied 1599 place count 5903 transition count 5705
Performed 2001 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3600 places in 11 ms
Iterating global reduction 1 with 2001 rules applied. Total rules applied 3600 place count 5903 transition count 5706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3601 place count 5903 transition count 5705
Renaming transitions due to excessive name length > 1024 char.
Discarding 800 places :
Symmetric choice reduction at 2 with 800 rule applications. Total rules 4401 place count 5103 transition count 4904
Deduced a syphon composed of 2800 places in 9 ms
Iterating global reduction 2 with 800 rules applied. Total rules applied 5201 place count 5103 transition count 4904
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2801 places in 9 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 5202 place count 5103 transition count 4904
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 5204 place count 5101 transition count 4902
Deduced a syphon composed of 2799 places in 10 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 5206 place count 5101 transition count 4902
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -530
Deduced a syphon composed of 2900 places in 12 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5307 place count 5101 transition count 5432
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5408 place count 5000 transition count 5230
Deduced a syphon composed of 2799 places in 11 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5509 place count 5000 transition count 5230
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -527
Deduced a syphon composed of 2900 places in 13 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5610 place count 5000 transition count 5757
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 5711 place count 4899 transition count 5555
Deduced a syphon composed of 2799 places in 11 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5812 place count 4899 transition count 5555
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -537
Deduced a syphon composed of 2900 places in 13 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5913 place count 4899 transition count 6092
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 6014 place count 4798 transition count 5890
Deduced a syphon composed of 2799 places in 22 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 6115 place count 4798 transition count 5890
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -502
Deduced a syphon composed of 2894 places in 13 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 6210 place count 4798 transition count 6392
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 6306 place count 4702 transition count 6200
Deduced a syphon composed of 2798 places in 13 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 6402 place count 4702 transition count 6200
Deduced a syphon composed of 2798 places in 13 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 6411 place count 4702 transition count 6191
Deduced a syphon composed of 2798 places in 12 ms
Applied a total of 6411 rules in 8220 ms. Remains 4702 /5903 variables (removed 1201) and now considering 6191/5403 (removed -788) transitions.
[2022-05-19 14:27:45] [INFO ] Redundant transitions in 251 ms returned []
// Phase 1: matrix 6191 rows 4702 cols
[2022-05-19 14:27:45] [INFO ] Computed 901 place invariants in 122 ms
[2022-05-19 14:27:48] [INFO ] Dead Transitions using invariants and state equation in 3744 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4702/5903 places, 6191/5403 transitions.
Finished structural reductions, in 1 iterations. Remains : 4702/5903 places, 6191/5403 transitions.
Product exploration explored 100000 steps with 0 reset in 1354 ms.
Product exploration explored 100000 steps with 0 reset in 1701 ms.
Built C files in :
/tmp/ltsmin3220730731602078171
[2022-05-19 14:27:52] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3220730731602078171
Running compilation step : cd /tmp/ltsmin3220730731602078171;'/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/ltsmin3220730731602078171;'/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/ltsmin3220730731602078171;'/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 4 out of 5903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5903/5903 places, 5403/5403 transitions.
Applied a total of 0 rules in 914 ms. Remains 5903 /5903 variables (removed 0) and now considering 5403/5403 (removed 0) transitions.
// Phase 1: matrix 5403 rows 5903 cols
[2022-05-19 14:27:56] [INFO ] Computed 901 place invariants in 23 ms
[2022-05-19 14:27:57] [INFO ] Implicit Places using invariants in 1841 ms returned []
// Phase 1: matrix 5403 rows 5903 cols
[2022-05-19 14:27:57] [INFO ] Computed 901 place invariants in 16 ms
[2022-05-19 14:27:59] [INFO ] Implicit Places using invariants and state equation in 1813 ms returned []
Implicit Place search using SMT with State Equation took 3658 ms to find 0 implicit places.
// Phase 1: matrix 5403 rows 5903 cols
[2022-05-19 14:27:59] [INFO ] Computed 901 place invariants in 16 ms
[2022-05-19 14:28:03] [INFO ] Dead Transitions using invariants and state equation in 3771 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5903/5903 places, 5403/5403 transitions.
Built C files in :
/tmp/ltsmin8088372478496241389
[2022-05-19 14:28:03] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8088372478496241389
Running compilation step : cd /tmp/ltsmin8088372478496241389;'/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/ltsmin8088372478496241389;'/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/ltsmin8088372478496241389;'/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 14:28:06] [INFO ] Flatten gal took : 133 ms
[2022-05-19 14:28:06] [INFO ] Flatten gal took : 138 ms
[2022-05-19 14:28:07] [INFO ] Time to serialize gal into /tmp/LTL5323643634558866507.gal : 14 ms
[2022-05-19 14:28:07] [INFO ] Time to serialize properties into /tmp/LTL2579182031214619729.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/LTL5323643634558866507.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2579182031214619729.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/LTL5323643...266
Read 1 LTL properties
Checking formula 0 : !((X(G((((G(X("(p6084==0)")))||("(p6084==0)"))||("((p4805==0)||(p4838==0))"))||("(((p4805==1)&&(p4838==1))&&(p6788==1))")))))
Formula 0 simplified : !XG("(((p4805==1)&&(p4838==1))&&(p6788==1))" | "((p4805==0)||(p4838==0))" | "(p6084==0)" | GX"(p6084==0)")
Detected timeout of ITS tools.
[2022-05-19 14:28:22] [INFO ] Flatten gal took : 128 ms
[2022-05-19 14:28:22] [INFO ] Applying decomposition
[2022-05-19 14:28:22] [INFO ] Flatten gal took : 133 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/graph1144151049036989714.txt' '-o' '/tmp/graph1144151049036989714.bin' '-w' '/tmp/graph1144151049036989714.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1144151049036989714.bin' '-l' '-1' '-v' '-w' '/tmp/graph1144151049036989714.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:28:22] [INFO ] Decomposing Gal with order
[2022-05-19 14:28:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:28:24] [INFO ] Removed a total of 994 redundant transitions.
[2022-05-19 14:28:24] [INFO ] Flatten gal took : 248 ms
[2022-05-19 14:28:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2022-05-19 14:28:24] [INFO ] Time to serialize gal into /tmp/LTL6594438745695324390.gal : 43 ms
[2022-05-19 14:28:24] [INFO ] Time to serialize properties into /tmp/LTL1002791011558313317.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/LTL6594438745695324390.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1002791011558313317.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/LTL6594438...245
Read 1 LTL properties
Checking formula 0 : !((X(G((((G(X("(i60.i0.i5.u1912.p6084==0)")))||("(i60.i0.i5.u1912.p6084==0)"))||("((i47.i1.i2.u1508.p4805==0)||(i47.i1.i5.u1517.p4838=...258
Formula 0 simplified : !XG("(((i47.i1.i2.u1508.p4805==1)&&(i47.i1.i5.u1517.p4838==1))&&(i66.i1.i7.u2131.p6788==1))" | "((i47.i1.i2.u1508.p4805==0)||(i47.i1...241
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin732081665087116291
[2022-05-19 14:28:39] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin732081665087116291
Running compilation step : cd /tmp/ltsmin732081665087116291;'/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/ltsmin732081665087116291;'/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/ltsmin732081665087116291;'/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-100B-LTLFireability-02 finished in 269794 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!(!p0 U X(p1))||p2))))'
Support contains 4 out of 5911 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5911/5911 places, 5411/5411 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 5901 transition count 5401
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 5901 transition count 5401
Applied a total of 20 rules in 1827 ms. Remains 5901 /5911 variables (removed 10) and now considering 5401/5411 (removed 10) transitions.
// Phase 1: matrix 5401 rows 5901 cols
[2022-05-19 14:28:44] [INFO ] Computed 901 place invariants in 15 ms
[2022-05-19 14:28:46] [INFO ] Implicit Places using invariants in 1741 ms returned []
// Phase 1: matrix 5401 rows 5901 cols
[2022-05-19 14:28:46] [INFO ] Computed 901 place invariants in 20 ms
[2022-05-19 14:28:47] [INFO ] Implicit Places using invariants and state equation in 1807 ms returned []
Implicit Place search using SMT with State Equation took 3557 ms to find 0 implicit places.
// Phase 1: matrix 5401 rows 5901 cols
[2022-05-19 14:28:47] [INFO ] Computed 901 place invariants in 18 ms
[2022-05-19 14:28:51] [INFO ] Dead Transitions using invariants and state equation in 3613 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5901/5911 places, 5401/5411 transitions.
Finished structural reductions, in 1 iterations. Remains : 5901/5911 places, 5401/5411 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s2083 1) (EQ s2128 1)), p0:(OR (AND (EQ s2083 1) (EQ s2128 1)) (EQ s5168 1)), p1:(EQ s317 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 24938 reset in 1867 ms.
Product exploration explored 100000 steps with 24989 reset in 1842 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Detected a total of 1598/5901 stabilizing places and 1598/5401 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 323 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 116 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5401 rows 5901 cols
[2022-05-19 14:28:56] [INFO ] Computed 901 place invariants in 22 ms
[2022-05-19 14:28:57] [INFO ] [Real]Absence check using 901 positive place invariants in 573 ms returned sat
[2022-05-19 14:29:02] [INFO ] After 5755ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 14:29:03] [INFO ] [Nat]Absence check using 901 positive place invariants in 535 ms returned sat
[2022-05-19 14:29:08] [INFO ] After 4778ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 14:29:10] [INFO ] Deduced a trap composed of 17 places in 2186 ms of which 4 ms to minimize.
[2022-05-19 14:29:12] [INFO ] Deduced a trap composed of 20 places in 2080 ms of which 4 ms to minimize.
[2022-05-19 14:29:15] [INFO ] Deduced a trap composed of 18 places in 2163 ms of which 4 ms to minimize.
[2022-05-19 14:29:17] [INFO ] Deduced a trap composed of 22 places in 2153 ms of which 3 ms to minimize.
[2022-05-19 14:29:19] [INFO ] Deduced a trap composed of 27 places in 2125 ms of which 4 ms to minimize.
[2022-05-19 14:29:22] [INFO ] Deduced a trap composed of 22 places in 2175 ms of which 3 ms to minimize.
[2022-05-19 14:29:24] [INFO ] Deduced a trap composed of 18 places in 2141 ms of which 4 ms to minimize.
[2022-05-19 14:29:26] [INFO ] Deduced a trap composed of 27 places in 2062 ms of which 3 ms to minimize.
[2022-05-19 14:29:29] [INFO ] Deduced a trap composed of 29 places in 2102 ms of which 4 ms to minimize.
[2022-05-19 14:29:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 14:29:29] [INFO ] After 27102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 322 ms.
Support contains 3 out of 5901 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5901/5901 places, 5401/5401 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5901 transition count 4203
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4703 transition count 4203
Performed 801 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 801 Pre rules applied. Total rules applied 2396 place count 4703 transition count 3402
Deduced a syphon composed of 801 places in 10 ms
Reduce places removed 801 places and 0 transitions.
Iterating global reduction 2 with 1602 rules applied. Total rules applied 3998 place count 3902 transition count 3402
Performed 1697 Post agglomeration using F-continuation condition.Transition count delta: 1697
Deduced a syphon composed of 1697 places in 3 ms
Reduce places removed 1697 places and 0 transitions.
Iterating global reduction 2 with 3394 rules applied. Total rules applied 7392 place count 2205 transition count 1705
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7393 place count 2205 transition count 1704
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 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7395 place count 2204 transition count 1703
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7597 place count 2103 transition count 1769
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7799 place count 2002 transition count 1837
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 7993 place count 1905 transition count 1902
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7994 place count 1905 transition count 1901
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 4 with 100 rules applied. Total rules applied 8094 place count 1905 transition count 1901
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8095 place count 1904 transition count 1900
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8097 place count 1902 transition count 1900
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 8097 place count 1902 transition count 1899
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 8099 place count 1901 transition count 1899
Applied a total of 8099 rules in 2436 ms. Remains 1901 /5901 variables (removed 4000) and now considering 1899/5401 (removed 3502) transitions.
Finished structural reductions, in 1 iterations. Remains : 1901/5901 places, 1899/5401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1899 rows 1901 cols
[2022-05-19 14:29:32] [INFO ] Computed 899 place invariants in 7 ms
[2022-05-19 14:29:32] [INFO ] [Real]Absence check using 899 positive place invariants in 144 ms returned sat
[2022-05-19 14:29:33] [INFO ] After 812ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 14:29:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:29:33] [INFO ] After 74ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:29:33] [INFO ] After 1263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:29:33] [INFO ] [Nat]Absence check using 899 positive place invariants in 146 ms returned sat
[2022-05-19 14:29:34] [INFO ] After 799ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:29:34] [INFO ] After 65ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 14:29:34] [INFO ] After 180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2022-05-19 14:29:34] [INFO ] After 1418ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 55 ms.
Support contains 2 out of 1901 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1901/1901 places, 1899/1899 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1900 transition count 1898
Applied a total of 2 rules in 96 ms. Remains 1900 /1901 variables (removed 1) and now considering 1898/1899 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1900/1901 places, 1898/1899 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 95234 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95234 steps, saw 60722 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1898 rows 1900 cols
[2022-05-19 14:29:38] [INFO ] Computed 899 place invariants in 7 ms
[2022-05-19 14:29:38] [INFO ] [Real]Absence check using 899 positive place invariants in 143 ms returned sat
[2022-05-19 14:29:39] [INFO ] After 776ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 14:29:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:29:39] [INFO ] After 70ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:29:39] [INFO ] After 1223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:29:39] [INFO ] [Nat]Absence check using 899 positive place invariants in 146 ms returned sat
[2022-05-19 14:29:40] [INFO ] After 752ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:29:40] [INFO ] After 67ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 14:29:40] [INFO ] After 184ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2022-05-19 14:29:40] [INFO ] After 1363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 40 ms.
Support contains 2 out of 1900 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1900/1900 places, 1898/1898 transitions.
Applied a total of 0 rules in 52 ms. Remains 1900 /1900 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1900/1900 places, 1898/1898 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1900/1900 places, 1898/1898 transitions.
Applied a total of 0 rules in 52 ms. Remains 1900 /1900 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
// Phase 1: matrix 1898 rows 1900 cols
[2022-05-19 14:29:41] [INFO ] Computed 899 place invariants in 6 ms
[2022-05-19 14:29:42] [INFO ] Implicit Places using invariants in 1100 ms returned [1889]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1101 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1899/1900 places, 1898/1898 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1898 transition count 1897
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1898 transition count 1897
Applied a total of 2 rules in 95 ms. Remains 1898 /1899 variables (removed 1) and now considering 1897/1898 (removed 1) transitions.
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:29:42] [INFO ] Computed 898 place invariants in 5 ms
[2022-05-19 14:29:43] [INFO ] Implicit Places using invariants in 1103 ms returned []
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:29:43] [INFO ] Computed 898 place invariants in 7 ms
[2022-05-19 14:29:45] [INFO ] Implicit Places using invariants and state equation in 2553 ms returned []
Implicit Place search using SMT with State Equation took 3668 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1898/1900 places, 1897/1898 transitions.
Finished structural reductions, in 2 iterations. Remains : 1898/1900 places, 1897/1898 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 92268 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92268 steps, saw 59478 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:29:49] [INFO ] Computed 898 place invariants in 5 ms
[2022-05-19 14:29:49] [INFO ] [Real]Absence check using 898 positive place invariants in 143 ms returned sat
[2022-05-19 14:29:50] [INFO ] After 815ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 14:29:50] [INFO ] After 934ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:29:50] [INFO ] After 1314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:29:50] [INFO ] [Nat]Absence check using 898 positive place invariants in 142 ms returned sat
[2022-05-19 14:29:51] [INFO ] After 775ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:29:51] [INFO ] After 907ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2022-05-19 14:29:51] [INFO ] After 1350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 53 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 52 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1898/1898 places, 1897/1897 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 50 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:29:52] [INFO ] Computed 898 place invariants in 7 ms
[2022-05-19 14:29:53] [INFO ] Implicit Places using invariants in 1171 ms returned []
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:29:53] [INFO ] Computed 898 place invariants in 2 ms
[2022-05-19 14:29:55] [INFO ] Implicit Places using invariants and state equation in 2514 ms returned []
Implicit Place search using SMT with State Equation took 3689 ms to find 0 implicit places.
[2022-05-19 14:29:55] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:29:55] [INFO ] Computed 898 place invariants in 7 ms
[2022-05-19 14:29:56] [INFO ] Dead Transitions using invariants and state equation in 1079 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1898/1898 places, 1897/1897 transitions.
Partial Free-agglomeration rule applied 201 times.
Drop transitions removed 201 transitions
Iterating global reduction 0 with 201 rules applied. Total rules applied 201 place count 1898 transition count 1897
Applied a total of 201 rules in 101 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:29:56] [INFO ] Computed 898 place invariants in 5 ms
[2022-05-19 14:29:57] [INFO ] [Real]Absence check using 898 positive place invariants in 149 ms returned sat
[2022-05-19 14:29:58] [INFO ] After 1209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:29:58] [INFO ] [Nat]Absence check using 898 positive place invariants in 148 ms returned sat
[2022-05-19 14:29:59] [INFO ] After 822ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:29:59] [INFO ] State equation strengthened by 198 read => feed constraints.
[2022-05-19 14:29:59] [INFO ] After 276ms SMT Verify possible using 198 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 14:29:59] [INFO ] After 402ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2022-05-19 14:29:59] [INFO ] After 1696ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 14:29:59] [INFO ] Flatten gal took : 62 ms
[2022-05-19 14:30:00] [INFO ] Flatten gal took : 63 ms
[2022-05-19 14:30:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5052084256895433302.gal : 6 ms
[2022-05-19 14:30:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3241797713650100885.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms6555773769443531591;'/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/ReachabilityCardinality5052084256895433302.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3241797713650100885.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/ReachabilityCardinality3241797713650100885.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 20
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :20 after 58
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :58 after 124
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :124 after 258
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :258 after 516
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :516 after 879
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :879 after 25198
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :25198 after 4.34669e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.34669e+06 after 5.43476e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5.43476e+07 after 3.57628e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.57628e+10 after 1.36296e+15
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.36296e+15 after 9.7208e+18
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :9.7208e+18 after 2.54726e+27
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.54726e+27 after 3.84093e+37
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :3.84093e+37 after 4.37127e+52
Detected timeout of ITS tools.
[2022-05-19 14:30:15] [INFO ] Flatten gal took : 70 ms
[2022-05-19 14:30:15] [INFO ] Applying decomposition
[2022-05-19 14:30:15] [INFO ] Flatten gal took : 62 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/graph7158297872871599721.txt' '-o' '/tmp/graph7158297872871599721.bin' '-w' '/tmp/graph7158297872871599721.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7158297872871599721.bin' '-l' '-1' '-v' '-w' '/tmp/graph7158297872871599721.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:30:15] [INFO ] Decomposing Gal with order
[2022-05-19 14:30:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:30:15] [INFO ] Removed a total of 1093 redundant transitions.
[2022-05-19 14:30:15] [INFO ] Flatten gal took : 94 ms
[2022-05-19 14:30:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 8 ms.
[2022-05-19 14:30:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13706142106228873274.gal : 14 ms
[2022-05-19 14:30:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12780620754687857540.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms6555773769443531591;'/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/ReachabilityCardinality13706142106228873274.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12780620754687857540.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/ReachabilityCardinality12780620754687857540.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
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1 after 2
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10597081259176137822
[2022-05-19 14:30:30] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10597081259176137822
Running compilation step : cd /tmp/ltsmin10597081259176137822;'/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/ltsmin10597081259176137822;'/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/ltsmin10597081259176137822;'/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)
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 8 factoid took 533 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 136 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 147 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 4 out of 5901 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5901/5901 places, 5401/5401 transitions.
Applied a total of 0 rules in 874 ms. Remains 5901 /5901 variables (removed 0) and now considering 5401/5401 (removed 0) transitions.
// Phase 1: matrix 5401 rows 5901 cols
[2022-05-19 14:30:35] [INFO ] Computed 901 place invariants in 21 ms
[2022-05-19 14:30:37] [INFO ] Implicit Places using invariants in 1885 ms returned []
// Phase 1: matrix 5401 rows 5901 cols
[2022-05-19 14:30:37] [INFO ] Computed 901 place invariants in 21 ms
[2022-05-19 14:30:39] [INFO ] Implicit Places using invariants and state equation in 1772 ms returned []
Implicit Place search using SMT with State Equation took 3675 ms to find 0 implicit places.
// Phase 1: matrix 5401 rows 5901 cols
[2022-05-19 14:30:39] [INFO ] Computed 901 place invariants in 20 ms
[2022-05-19 14:30:42] [INFO ] Dead Transitions using invariants and state equation in 3858 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5901/5901 places, 5401/5401 transitions.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Detected a total of 1598/5901 stabilizing places and 1598/5401 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 286 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 135 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5401 rows 5901 cols
[2022-05-19 14:30:43] [INFO ] Computed 901 place invariants in 20 ms
[2022-05-19 14:30:45] [INFO ] [Real]Absence check using 901 positive place invariants in 555 ms returned sat
[2022-05-19 14:30:49] [INFO ] After 5775ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 14:30:50] [INFO ] [Nat]Absence check using 901 positive place invariants in 549 ms returned sat
[2022-05-19 14:30:56] [INFO ] After 4909ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 14:30:58] [INFO ] Deduced a trap composed of 17 places in 2230 ms of which 3 ms to minimize.
[2022-05-19 14:31:00] [INFO ] Deduced a trap composed of 20 places in 2153 ms of which 3 ms to minimize.
[2022-05-19 14:31:03] [INFO ] Deduced a trap composed of 18 places in 2040 ms of which 4 ms to minimize.
[2022-05-19 14:31:05] [INFO ] Deduced a trap composed of 22 places in 2139 ms of which 4 ms to minimize.
[2022-05-19 14:31:07] [INFO ] Deduced a trap composed of 27 places in 2159 ms of which 3 ms to minimize.
[2022-05-19 14:31:10] [INFO ] Deduced a trap composed of 22 places in 2136 ms of which 3 ms to minimize.
[2022-05-19 14:31:12] [INFO ] Deduced a trap composed of 18 places in 2097 ms of which 5 ms to minimize.
[2022-05-19 14:31:14] [INFO ] Deduced a trap composed of 27 places in 2080 ms of which 3 ms to minimize.
[2022-05-19 14:31:20] [INFO ] Deduced a trap composed of 18 places in 5778 ms of which 5 ms to minimize.
[2022-05-19 14:31:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 14:31:20] [INFO ] After 30800ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 323 ms.
Support contains 3 out of 5901 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5901/5901 places, 5401/5401 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5901 transition count 4203
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4703 transition count 4203
Performed 801 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 801 Pre rules applied. Total rules applied 2396 place count 4703 transition count 3402
Deduced a syphon composed of 801 places in 10 ms
Reduce places removed 801 places and 0 transitions.
Iterating global reduction 2 with 1602 rules applied. Total rules applied 3998 place count 3902 transition count 3402
Performed 1697 Post agglomeration using F-continuation condition.Transition count delta: 1697
Deduced a syphon composed of 1697 places in 4 ms
Reduce places removed 1697 places and 0 transitions.
Iterating global reduction 2 with 3394 rules applied. Total rules applied 7392 place count 2205 transition count 1705
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7393 place count 2205 transition count 1704
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 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7395 place count 2204 transition count 1703
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7597 place count 2103 transition count 1769
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7799 place count 2002 transition count 1837
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 7993 place count 1905 transition count 1902
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7994 place count 1905 transition count 1901
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 4 with 100 rules applied. Total rules applied 8094 place count 1905 transition count 1901
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8095 place count 1904 transition count 1900
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 8097 place count 1902 transition count 1900
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 8097 place count 1902 transition count 1899
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 8099 place count 1901 transition count 1899
Applied a total of 8099 rules in 1311 ms. Remains 1901 /5901 variables (removed 4000) and now considering 1899/5401 (removed 3502) transitions.
Finished structural reductions, in 1 iterations. Remains : 1901/5901 places, 1899/5401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1899 rows 1901 cols
[2022-05-19 14:31:22] [INFO ] Computed 899 place invariants in 5 ms
[2022-05-19 14:31:22] [INFO ] [Real]Absence check using 899 positive place invariants in 149 ms returned sat
[2022-05-19 14:31:23] [INFO ] After 838ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 14:31:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:31:23] [INFO ] After 70ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:31:23] [INFO ] After 1321ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:31:23] [INFO ] [Nat]Absence check using 899 positive place invariants in 135 ms returned sat
[2022-05-19 14:31:24] [INFO ] After 807ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:31:24] [INFO ] After 65ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 14:31:24] [INFO ] After 180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2022-05-19 14:31:25] [INFO ] After 1393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 56 ms.
Support contains 2 out of 1901 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1901/1901 places, 1899/1899 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1900 transition count 1898
Applied a total of 2 rules in 95 ms. Remains 1900 /1901 variables (removed 1) and now considering 1898/1899 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1900/1901 places, 1898/1899 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 92759 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92759 steps, saw 59005 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1898 rows 1900 cols
[2022-05-19 14:31:28] [INFO ] Computed 899 place invariants in 7 ms
[2022-05-19 14:31:28] [INFO ] [Real]Absence check using 899 positive place invariants in 144 ms returned sat
[2022-05-19 14:31:29] [INFO ] After 805ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 14:31:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:31:29] [INFO ] After 74ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:31:29] [INFO ] After 1256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:31:30] [INFO ] [Nat]Absence check using 899 positive place invariants in 149 ms returned sat
[2022-05-19 14:31:30] [INFO ] After 812ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:31:30] [INFO ] After 65ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 14:31:31] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2022-05-19 14:31:31] [INFO ] After 1451ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 31 ms.
Support contains 2 out of 1900 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1900/1900 places, 1898/1898 transitions.
Applied a total of 0 rules in 53 ms. Remains 1900 /1900 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1900/1900 places, 1898/1898 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1900/1900 places, 1898/1898 transitions.
Applied a total of 0 rules in 54 ms. Remains 1900 /1900 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
// Phase 1: matrix 1898 rows 1900 cols
[2022-05-19 14:31:31] [INFO ] Computed 899 place invariants in 7 ms
[2022-05-19 14:31:32] [INFO ] Implicit Places using invariants in 1131 ms returned [1889]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1134 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1899/1900 places, 1898/1898 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1898 transition count 1897
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1898 transition count 1897
Applied a total of 2 rules in 98 ms. Remains 1898 /1899 variables (removed 1) and now considering 1897/1898 (removed 1) transitions.
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:31:32] [INFO ] Computed 898 place invariants in 4 ms
[2022-05-19 14:31:33] [INFO ] Implicit Places using invariants in 1197 ms returned []
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:31:33] [INFO ] Computed 898 place invariants in 2 ms
[2022-05-19 14:31:36] [INFO ] Implicit Places using invariants and state equation in 2538 ms returned []
Implicit Place search using SMT with State Equation took 3737 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1898/1900 places, 1897/1898 transitions.
Finished structural reductions, in 2 iterations. Remains : 1898/1900 places, 1897/1898 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 93207 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93207 steps, saw 60011 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:31:39] [INFO ] Computed 898 place invariants in 4 ms
[2022-05-19 14:31:39] [INFO ] [Real]Absence check using 898 positive place invariants in 152 ms returned sat
[2022-05-19 14:31:40] [INFO ] After 811ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 14:31:40] [INFO ] After 924ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:31:40] [INFO ] After 1322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:31:41] [INFO ] [Nat]Absence check using 898 positive place invariants in 147 ms returned sat
[2022-05-19 14:31:42] [INFO ] After 809ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:31:42] [INFO ] After 936ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2022-05-19 14:31:42] [INFO ] After 1398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 33 ms.
Support contains 2 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 52 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1898/1898 places, 1897/1897 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 56 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:31:42] [INFO ] Computed 898 place invariants in 6 ms
[2022-05-19 14:31:43] [INFO ] Implicit Places using invariants in 1131 ms returned []
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:31:43] [INFO ] Computed 898 place invariants in 2 ms
[2022-05-19 14:31:46] [INFO ] Implicit Places using invariants and state equation in 2643 ms returned []
Implicit Place search using SMT with State Equation took 3777 ms to find 0 implicit places.
[2022-05-19 14:31:46] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:31:46] [INFO ] Computed 898 place invariants in 5 ms
[2022-05-19 14:31:47] [INFO ] Dead Transitions using invariants and state equation in 1074 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1898/1898 places, 1897/1897 transitions.
Partial Free-agglomeration rule applied 201 times.
Drop transitions removed 201 transitions
Iterating global reduction 0 with 201 rules applied. Total rules applied 201 place count 1898 transition count 1897
Applied a total of 201 rules in 102 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:31:47] [INFO ] Computed 898 place invariants in 6 ms
[2022-05-19 14:31:47] [INFO ] [Real]Absence check using 898 positive place invariants in 154 ms returned sat
[2022-05-19 14:31:48] [INFO ] After 1220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:31:48] [INFO ] [Nat]Absence check using 898 positive place invariants in 153 ms returned sat
[2022-05-19 14:31:49] [INFO ] After 813ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:31:49] [INFO ] State equation strengthened by 198 read => feed constraints.
[2022-05-19 14:31:50] [INFO ] After 279ms SMT Verify possible using 198 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 14:31:50] [INFO ] After 400ms 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 14:31:50] [INFO ] After 1692ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 14:31:50] [INFO ] Flatten gal took : 58 ms
[2022-05-19 14:31:50] [INFO ] Flatten gal took : 58 ms
[2022-05-19 14:31:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6880157968635162913.gal : 6 ms
[2022-05-19 14:31:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14598507909872646639.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms31179367596810861;'/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/ReachabilityCardinality6880157968635162913.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14598507909872646639.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/ReachabilityCardinality14598507909872646639.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 20
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :20 after 58
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :58 after 124
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :124 after 258
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :258 after 516
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :516 after 879
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :879 after 25198
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :25198 after 4.34669e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.34669e+06 after 5.43476e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5.43476e+07 after 3.57628e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.57628e+10 after 1.36296e+15
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.36296e+15 after 9.7208e+18
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :9.7208e+18 after 2.54726e+27
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.54726e+27 after 3.84093e+37
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :3.84093e+37 after 4.37127e+52
Detected timeout of ITS tools.
[2022-05-19 14:32:05] [INFO ] Flatten gal took : 63 ms
[2022-05-19 14:32:05] [INFO ] Applying decomposition
[2022-05-19 14:32:05] [INFO ] Flatten gal took : 63 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/graph17648566186356745643.txt' '-o' '/tmp/graph17648566186356745643.bin' '-w' '/tmp/graph17648566186356745643.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17648566186356745643.bin' '-l' '-1' '-v' '-w' '/tmp/graph17648566186356745643.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:32:05] [INFO ] Decomposing Gal with order
[2022-05-19 14:32:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:32:05] [INFO ] Removed a total of 1093 redundant transitions.
[2022-05-19 14:32:06] [INFO ] Flatten gal took : 83 ms
[2022-05-19 14:32:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 7 ms.
[2022-05-19 14:32:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4283382738833496821.gal : 12 ms
[2022-05-19 14:32:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality393280784779516697.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms31179367596810861;'/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/ReachabilityCardinality4283382738833496821.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality393280784779516697.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...297
Loading property file /tmp/ReachabilityCardinality393280784779516697.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
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1 after 2
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin904933387563761371
[2022-05-19 14:32:21] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin904933387563761371
Running compilation step : cd /tmp/ltsmin904933387563761371;'/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/ltsmin904933387563761371;'/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/ltsmin904933387563761371;'/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)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 8 factoid took 462 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 114 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 178 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 247 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 25123 reset in 1821 ms.
Product exploration explored 100000 steps with 24996 reset in 1815 ms.
Built C files in :
/tmp/ltsmin4456568834571199920
[2022-05-19 14:32:28] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4456568834571199920
Running compilation step : cd /tmp/ltsmin4456568834571199920;'/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/ltsmin4456568834571199920;'/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/ltsmin4456568834571199920;'/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 4 out of 5901 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5901/5901 places, 5401/5401 transitions.
Applied a total of 0 rules in 948 ms. Remains 5901 /5901 variables (removed 0) and now considering 5401/5401 (removed 0) transitions.
// Phase 1: matrix 5401 rows 5901 cols
[2022-05-19 14:32:32] [INFO ] Computed 901 place invariants in 23 ms
[2022-05-19 14:32:34] [INFO ] Implicit Places using invariants in 1840 ms returned []
// Phase 1: matrix 5401 rows 5901 cols
[2022-05-19 14:32:34] [INFO ] Computed 901 place invariants in 23 ms
[2022-05-19 14:32:36] [INFO ] Implicit Places using invariants and state equation in 2000 ms returned []
Implicit Place search using SMT with State Equation took 3843 ms to find 0 implicit places.
// Phase 1: matrix 5401 rows 5901 cols
[2022-05-19 14:32:36] [INFO ] Computed 901 place invariants in 15 ms
[2022-05-19 14:32:40] [INFO ] Dead Transitions using invariants and state equation in 4125 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5901/5901 places, 5401/5401 transitions.
Built C files in :
/tmp/ltsmin4578837738680640023
[2022-05-19 14:32:40] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4578837738680640023
Running compilation step : cd /tmp/ltsmin4578837738680640023;'/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/ltsmin4578837738680640023;'/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/ltsmin4578837738680640023;'/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 14:32:44] [INFO ] Flatten gal took : 131 ms
[2022-05-19 14:32:44] [INFO ] Flatten gal took : 130 ms
[2022-05-19 14:32:44] [INFO ] Time to serialize gal into /tmp/LTL14334589135510324749.gal : 13 ms
[2022-05-19 14:32:44] [INFO ] Time to serialize properties into /tmp/LTL17918800444122165290.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/LTL14334589135510324749.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17918800444122165290.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/LTL1433458...268
Read 1 LTL properties
Checking formula 0 : !((X(F((!((!("(((p2457==1)&&(p2511==1))||(p6125==1))"))U(X("(p355==1)"))))||("((p2457==1)&&(p2511==1))")))))
Formula 0 simplified : !XF("((p2457==1)&&(p2511==1))" | !(!"(((p2457==1)&&(p2511==1))||(p6125==1))" U X"(p355==1)"))
Detected timeout of ITS tools.
[2022-05-19 14:32:59] [INFO ] Flatten gal took : 124 ms
[2022-05-19 14:32:59] [INFO ] Applying decomposition
[2022-05-19 14:32:59] [INFO ] Flatten gal took : 128 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/graph2552867820111187183.txt' '-o' '/tmp/graph2552867820111187183.bin' '-w' '/tmp/graph2552867820111187183.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2552867820111187183.bin' '-l' '-1' '-v' '-w' '/tmp/graph2552867820111187183.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:33:00] [INFO ] Decomposing Gal with order
[2022-05-19 14:33:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:33:01] [INFO ] Removed a total of 1000 redundant transitions.
[2022-05-19 14:33:01] [INFO ] Flatten gal took : 229 ms
[2022-05-19 14:33:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2022-05-19 14:33:01] [INFO ] Time to serialize gal into /tmp/LTL17737612102032671683.gal : 32 ms
[2022-05-19 14:33:01] [INFO ] Time to serialize properties into /tmp/LTL11319281461111633673.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/LTL17737612102032671683.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11319281461111633673.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/LTL1773761...247
Read 1 LTL properties
Checking formula 0 : !((X(F((!((!("(((i25.i1.i1.u778.p2457==1)&&(i25.i1.i6.u795.p2511==1))||(i61.u1918.p6125==1))"))U(X("(i5.i1.i4.u123.p355==1)"))))||("((...213
Formula 0 simplified : !XF("((i25.i1.i1.u778.p2457==1)&&(i25.i1.i6.u795.p2511==1))" | !(!"(((i25.i1.i1.u778.p2457==1)&&(i25.i1.i6.u795.p2511==1))||(i61.u19...200
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7278003707843262968
[2022-05-19 14:33:16] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7278003707843262968
Running compilation step : cd /tmp/ltsmin7278003707843262968;'/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/ltsmin7278003707843262968;'/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/ltsmin7278003707843262968;'/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-100B-LTLFireability-03 finished in 277324 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((F(p0)&&p1)))&&X(p2)))'
Support contains 3 out of 5911 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5911/5911 places, 5411/5411 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 5901 transition count 5401
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 5901 transition count 5401
Applied a total of 20 rules in 1781 ms. Remains 5901 /5911 variables (removed 10) and now considering 5401/5411 (removed 10) transitions.
// Phase 1: matrix 5401 rows 5901 cols
[2022-05-19 14:33:21] [INFO ] Computed 901 place invariants in 20 ms
[2022-05-19 14:33:23] [INFO ] Implicit Places using invariants in 1758 ms returned []
// Phase 1: matrix 5401 rows 5901 cols
[2022-05-19 14:33:23] [INFO ] Computed 901 place invariants in 16 ms
[2022-05-19 14:33:25] [INFO ] Implicit Places using invariants and state equation in 1750 ms returned []
Implicit Place search using SMT with State Equation took 3510 ms to find 0 implicit places.
// Phase 1: matrix 5401 rows 5901 cols
[2022-05-19 14:33:25] [INFO ] Computed 901 place invariants in 15 ms
[2022-05-19 14:33:28] [INFO ] Dead Transitions using invariants and state equation in 3504 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5901/5911 places, 5401/5411 transitions.
Finished structural reductions, in 1 iterations. Remains : 5901/5911 places, 5401/5411 transitions.
Stuttering acceptance computed with spot in 573 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=p2, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s2600 0), p0:(EQ s93 1), p1:(EQ s2180 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1513 ms.
Stack based approach found an accepted trace after 5298 steps with 0 reset with depth 5299 and stack size 2176 in 122 ms.
FORMULA ShieldIIPt-PT-100B-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-04 finished in 11079 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(!X((G(F(X(p0)))||p1)))) U X(!p0)))'
Support contains 2 out of 5911 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5911/5911 places, 5411/5411 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 5901 transition count 5401
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 5901 transition count 5401
Applied a total of 20 rules in 1806 ms. Remains 5901 /5911 variables (removed 10) and now considering 5401/5411 (removed 10) transitions.
// Phase 1: matrix 5401 rows 5901 cols
[2022-05-19 14:33:32] [INFO ] Computed 901 place invariants in 20 ms
[2022-05-19 14:33:34] [INFO ] Implicit Places using invariants in 1857 ms returned []
// Phase 1: matrix 5401 rows 5901 cols
[2022-05-19 14:33:34] [INFO ] Computed 901 place invariants in 15 ms
[2022-05-19 14:33:36] [INFO ] Implicit Places using invariants and state equation in 1812 ms returned []
Implicit Place search using SMT with State Equation took 3670 ms to find 0 implicit places.
// Phase 1: matrix 5401 rows 5901 cols
[2022-05-19 14:33:36] [INFO ] Computed 901 place invariants in 15 ms
[2022-05-19 14:33:40] [INFO ] Dead Transitions using invariants and state equation in 3743 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5901/5911 places, 5401/5411 transitions.
Finished structural reductions, in 1 iterations. Remains : 5901/5911 places, 5401/5411 transitions.
Stuttering acceptance computed with spot in 188 ms :[p0, p0, (OR p1 p0), p0, p1]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s1872 1), p1:(EQ s622 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1400 ms.
Stack based approach found an accepted trace after 3869 steps with 0 reset with depth 3870 and stack size 3870 in 54 ms.
FORMULA ShieldIIPt-PT-100B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-05 finished in 10935 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(p1 U X(G(X(p2)))))))'
Support contains 3 out of 5911 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5911/5911 places, 5411/5411 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 5902 transition count 5402
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 5902 transition count 5402
Applied a total of 18 rules in 1741 ms. Remains 5902 /5911 variables (removed 9) and now considering 5402/5411 (removed 9) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2022-05-19 14:33:43] [INFO ] Computed 901 place invariants in 22 ms
[2022-05-19 14:33:45] [INFO ] Implicit Places using invariants in 1877 ms returned []
// Phase 1: matrix 5402 rows 5902 cols
[2022-05-19 14:33:45] [INFO ] Computed 901 place invariants in 17 ms
[2022-05-19 14:33:47] [INFO ] Implicit Places using invariants and state equation in 1868 ms returned []
Implicit Place search using SMT with State Equation took 3747 ms to find 0 implicit places.
// Phase 1: matrix 5402 rows 5902 cols
[2022-05-19 14:33:47] [INFO ] Computed 901 place invariants in 16 ms
[2022-05-19 14:33:51] [INFO ] Dead Transitions using invariants and state equation in 3733 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5902/5911 places, 5402/5411 transitions.
Finished structural reductions, in 1 iterations. Remains : 5902/5911 places, 5402/5411 transitions.
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), true, (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 3}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s4054 1), p1:(EQ s3648 1), p2:(EQ s5123 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-100B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-06 finished in 9567 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 5 out of 5911 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5911/5911 places, 5411/5411 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1202 transitions
Trivial Post-agglo rules discarded 1202 transitions
Performed 1202 trivial Post agglomeration. Transition count delta: 1202
Iterating post reduction 0 with 1202 rules applied. Total rules applied 1202 place count 5910 transition count 4208
Reduce places removed 1202 places and 0 transitions.
Iterating post reduction 1 with 1202 rules applied. Total rules applied 2404 place count 4708 transition count 4208
Performed 791 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 791 Pre rules applied. Total rules applied 2404 place count 4708 transition count 3417
Deduced a syphon composed of 791 places in 10 ms
Reduce places removed 791 places and 0 transitions.
Iterating global reduction 2 with 1582 rules applied. Total rules applied 3986 place count 3917 transition count 3417
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 3995 place count 3908 transition count 3408
Iterating global reduction 2 with 9 rules applied. Total rules applied 4004 place count 3908 transition count 3408
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4004 place count 3908 transition count 3401
Deduced a syphon composed of 7 places in 10 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 4018 place count 3901 transition count 3401
Performed 1695 Post agglomeration using F-continuation condition.Transition count delta: 1695
Deduced a syphon composed of 1695 places in 4 ms
Reduce places removed 1695 places and 0 transitions.
Iterating global reduction 2 with 3390 rules applied. Total rules applied 7408 place count 2206 transition count 1706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7409 place count 2206 transition count 1705
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 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7411 place count 2205 transition count 1704
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7613 place count 2104 transition count 1771
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7815 place count 2003 transition count 1837
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 8007 place count 1907 transition count 1902
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8009 place count 1905 transition count 1900
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8011 place count 1903 transition count 1900
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8011 place count 1903 transition count 1899
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8013 place count 1902 transition count 1899
Applied a total of 8013 rules in 1652 ms. Remains 1902 /5911 variables (removed 4009) and now considering 1899/5411 (removed 3512) transitions.
// Phase 1: matrix 1899 rows 1902 cols
[2022-05-19 14:33:53] [INFO ] Computed 899 place invariants in 5 ms
[2022-05-19 14:33:54] [INFO ] Implicit Places using invariants in 1166 ms returned [1890]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1168 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1901/5911 places, 1899/5411 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1900 transition count 1898
Applied a total of 2 rules in 104 ms. Remains 1900 /1901 variables (removed 1) and now considering 1898/1899 (removed 1) transitions.
// Phase 1: matrix 1898 rows 1900 cols
[2022-05-19 14:33:54] [INFO ] Computed 898 place invariants in 6 ms
[2022-05-19 14:33:55] [INFO ] Implicit Places using invariants in 1093 ms returned []
// Phase 1: matrix 1898 rows 1900 cols
[2022-05-19 14:33:55] [INFO ] Computed 898 place invariants in 7 ms
[2022-05-19 14:33:58] [INFO ] Implicit Places using invariants and state equation in 2534 ms returned []
Implicit Place search using SMT with State Equation took 3628 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1900/5911 places, 1898/5411 transitions.
Finished structural reductions, in 2 iterations. Remains : 1900/5911 places, 1898/5411 transitions.
Stuttering acceptance computed with spot in 588 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s1895 1), p0:(AND (EQ s605 1) (EQ s1211 1) (EQ s1218 1) (EQ s1221 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-100B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-07 finished in 7164 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 5911 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5911/5911 places, 5411/5411 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1202 transitions
Trivial Post-agglo rules discarded 1202 transitions
Performed 1202 trivial Post agglomeration. Transition count delta: 1202
Iterating post reduction 0 with 1202 rules applied. Total rules applied 1202 place count 5910 transition count 4208
Reduce places removed 1202 places and 0 transitions.
Iterating post reduction 1 with 1202 rules applied. Total rules applied 2404 place count 4708 transition count 4208
Performed 795 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 795 Pre rules applied. Total rules applied 2404 place count 4708 transition count 3413
Deduced a syphon composed of 795 places in 10 ms
Reduce places removed 795 places and 0 transitions.
Iterating global reduction 2 with 1590 rules applied. Total rules applied 3994 place count 3913 transition count 3413
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 4003 place count 3904 transition count 3404
Iterating global reduction 2 with 9 rules applied. Total rules applied 4012 place count 3904 transition count 3404
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4012 place count 3904 transition count 3397
Deduced a syphon composed of 7 places in 10 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 4026 place count 3897 transition count 3397
Performed 1693 Post agglomeration using F-continuation condition.Transition count delta: 1693
Deduced a syphon composed of 1693 places in 4 ms
Reduce places removed 1693 places and 0 transitions.
Iterating global reduction 2 with 3386 rules applied. Total rules applied 7412 place count 2204 transition count 1704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7413 place count 2204 transition count 1703
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 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7415 place count 2203 transition count 1702
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7617 place count 2102 transition count 1768
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7819 place count 2001 transition count 1836
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8013 place count 1904 transition count 1901
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8015 place count 1902 transition count 1899
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8017 place count 1900 transition count 1899
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8017 place count 1900 transition count 1898
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8019 place count 1899 transition count 1898
Applied a total of 8019 rules in 1672 ms. Remains 1899 /5911 variables (removed 4012) and now considering 1898/5411 (removed 3513) transitions.
// Phase 1: matrix 1898 rows 1899 cols
[2022-05-19 14:34:00] [INFO ] Computed 899 place invariants in 5 ms
[2022-05-19 14:34:01] [INFO ] Implicit Places using invariants in 1186 ms returned [1888]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1188 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1898/5911 places, 1898/5411 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1897 transition count 1897
Applied a total of 2 rules in 100 ms. Remains 1897 /1898 variables (removed 1) and now considering 1897/1898 (removed 1) transitions.
// Phase 1: matrix 1897 rows 1897 cols
[2022-05-19 14:34:01] [INFO ] Computed 898 place invariants in 7 ms
[2022-05-19 14:34:02] [INFO ] Implicit Places using invariants in 1168 ms returned []
// Phase 1: matrix 1897 rows 1897 cols
[2022-05-19 14:34:02] [INFO ] Computed 898 place invariants in 2 ms
[2022-05-19 14:34:03] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-19 14:34:05] [INFO ] Implicit Places using invariants and state equation in 2671 ms returned []
Implicit Place search using SMT with State Equation took 3841 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1897/5911 places, 1897/5411 transitions.
Finished structural reductions, in 2 iterations. Remains : 1897/5911 places, 1897/5411 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1654 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-100B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-08 finished in 6860 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(G((F(X(X(p0)))&&X(p1)))))))'
Support contains 2 out of 5911 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5911/5911 places, 5411/5411 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1201 transitions
Trivial Post-agglo rules discarded 1201 transitions
Performed 1201 trivial Post agglomeration. Transition count delta: 1201
Iterating post reduction 0 with 1201 rules applied. Total rules applied 1201 place count 5910 transition count 4209
Reduce places removed 1201 places and 0 transitions.
Iterating post reduction 1 with 1201 rules applied. Total rules applied 2402 place count 4709 transition count 4209
Performed 793 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 793 Pre rules applied. Total rules applied 2402 place count 4709 transition count 3416
Deduced a syphon composed of 793 places in 10 ms
Reduce places removed 793 places and 0 transitions.
Iterating global reduction 2 with 1586 rules applied. Total rules applied 3988 place count 3916 transition count 3416
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 3997 place count 3907 transition count 3407
Iterating global reduction 2 with 9 rules applied. Total rules applied 4006 place count 3907 transition count 3407
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4006 place count 3907 transition count 3400
Deduced a syphon composed of 7 places in 9 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 4020 place count 3900 transition count 3400
Performed 1696 Post agglomeration using F-continuation condition.Transition count delta: 1696
Deduced a syphon composed of 1696 places in 4 ms
Reduce places removed 1696 places and 0 transitions.
Iterating global reduction 2 with 3392 rules applied. Total rules applied 7412 place count 2204 transition count 1704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7413 place count 2204 transition count 1703
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 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7415 place count 2203 transition count 1702
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7617 place count 2102 transition count 1768
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7819 place count 2001 transition count 1835
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 95 places in 4 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 8009 place count 1906 transition count 1898
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8011 place count 1904 transition count 1896
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8013 place count 1902 transition count 1896
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8013 place count 1902 transition count 1895
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8015 place count 1901 transition count 1895
Applied a total of 8015 rules in 1617 ms. Remains 1901 /5911 variables (removed 4010) and now considering 1895/5411 (removed 3516) transitions.
// Phase 1: matrix 1895 rows 1901 cols
[2022-05-19 14:34:07] [INFO ] Computed 899 place invariants in 4 ms
[2022-05-19 14:34:08] [INFO ] Implicit Places using invariants in 1146 ms returned [1890]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1147 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1900/5911 places, 1895/5411 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1899 transition count 1894
Applied a total of 2 rules in 111 ms. Remains 1899 /1900 variables (removed 1) and now considering 1894/1895 (removed 1) transitions.
// Phase 1: matrix 1894 rows 1899 cols
[2022-05-19 14:34:08] [INFO ] Computed 898 place invariants in 7 ms
[2022-05-19 14:34:09] [INFO ] Implicit Places using invariants in 1163 ms returned []
// Phase 1: matrix 1894 rows 1899 cols
[2022-05-19 14:34:09] [INFO ] Computed 898 place invariants in 4 ms
[2022-05-19 14:34:11] [INFO ] Implicit Places using invariants and state equation in 2425 ms returned []
Implicit Place search using SMT with State Equation took 3589 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1899/5911 places, 1894/5411 transitions.
Finished structural reductions, in 2 iterations. Remains : 1899/5911 places, 1894/5411 transitions.
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s681 0), p0:(EQ s725 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-100B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-10 finished in 6567 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(F(p1)))&&p0)))'
Support contains 3 out of 5911 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5911/5911 places, 5411/5411 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 5902 transition count 5402
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 5902 transition count 5402
Applied a total of 18 rules in 1732 ms. Remains 5902 /5911 variables (removed 9) and now considering 5402/5411 (removed 9) transitions.
// Phase 1: matrix 5402 rows 5902 cols
[2022-05-19 14:34:13] [INFO ] Computed 901 place invariants in 21 ms
[2022-05-19 14:34:15] [INFO ] Implicit Places using invariants in 1851 ms returned []
// Phase 1: matrix 5402 rows 5902 cols
[2022-05-19 14:34:15] [INFO ] Computed 901 place invariants in 15 ms
[2022-05-19 14:34:17] [INFO ] Implicit Places using invariants and state equation in 1720 ms returned []
Implicit Place search using SMT with State Equation took 3575 ms to find 0 implicit places.
// Phase 1: matrix 5402 rows 5902 cols
[2022-05-19 14:34:17] [INFO ] Computed 901 place invariants in 16 ms
[2022-05-19 14:34:21] [INFO ] Dead Transitions using invariants and state equation in 3745 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5902/5911 places, 5402/5411 transitions.
Finished structural reductions, in 1 iterations. Remains : 5902/5911 places, 5402/5411 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s2379 1) (EQ s2396 1)), p1:(EQ s2824 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-100B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-11 finished in 9278 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U F(p0))&&G(X(p0))))'
Support contains 2 out of 5911 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5911/5911 places, 5411/5411 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 5901 transition count 5401
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 5901 transition count 5401
Applied a total of 20 rules in 1741 ms. Remains 5901 /5911 variables (removed 10) and now considering 5401/5411 (removed 10) transitions.
// Phase 1: matrix 5401 rows 5901 cols
[2022-05-19 14:34:23] [INFO ] Computed 901 place invariants in 42 ms
[2022-05-19 14:34:24] [INFO ] Implicit Places using invariants in 1836 ms returned []
// Phase 1: matrix 5401 rows 5901 cols
[2022-05-19 14:34:24] [INFO ] Computed 901 place invariants in 14 ms
[2022-05-19 14:34:26] [INFO ] Implicit Places using invariants and state equation in 1866 ms returned []
Implicit Place search using SMT with State Equation took 3703 ms to find 0 implicit places.
// Phase 1: matrix 5401 rows 5901 cols
[2022-05-19 14:34:26] [INFO ] Computed 901 place invariants in 15 ms
[2022-05-19 14:34:30] [INFO ] Dead Transitions using invariants and state equation in 3711 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5901/5911 places, 5401/5411 transitions.
Finished structural reductions, in 1 iterations. Remains : 5901/5911 places, 5401/5411 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s3655 1) (EQ s3672 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-100B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-100B-LTLFireability-12 finished in 9309 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(p0 U !X(((G(p1) U X(p2))&&p3))))))'
Support contains 4 out of 5911 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5911/5911 places, 5411/5411 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 5903 transition count 5403
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 5903 transition count 5403
Applied a total of 16 rules in 1753 ms. Remains 5903 /5911 variables (removed 8) and now considering 5403/5411 (removed 8) transitions.
// Phase 1: matrix 5403 rows 5903 cols
[2022-05-19 14:34:32] [INFO ] Computed 901 place invariants in 21 ms
[2022-05-19 14:34:34] [INFO ] Implicit Places using invariants in 1879 ms returned []
// Phase 1: matrix 5403 rows 5903 cols
[2022-05-19 14:34:34] [INFO ] Computed 901 place invariants in 24 ms
[2022-05-19 14:34:36] [INFO ] Implicit Places using invariants and state equation in 1856 ms returned []
Implicit Place search using SMT with State Equation took 3736 ms to find 0 implicit places.
// Phase 1: matrix 5403 rows 5903 cols
[2022-05-19 14:34:36] [INFO ] Computed 901 place invariants in 20 ms
[2022-05-19 14:34:39] [INFO ] Dead Transitions using invariants and state equation in 3605 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5903/5911 places, 5403/5411 transitions.
Finished structural reductions, in 1 iterations. Remains : 5903/5911 places, 5403/5411 transitions.
Stuttering acceptance computed with spot in 669 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2) p3)]
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={1} source=1 dest: 1}, { cond=true, acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 (NOT p3)), acceptance={1} source=2 dest: 1}, { cond=(NOT p3), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p3 (NOT p1)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p3 p1), acceptance={0} source=2 dest: 4}, { cond=(AND p3 p1), acceptance={0, 1} source=2 dest: 5}, { cond=(AND p0 p3 (NOT p1)), acceptance={1} source=2 dest: 6}, { cond=(AND p0 p3 p1), acceptance={} source=2 dest: 7}], [{ cond=(AND p0 (NOT p3) (NOT p2)), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p3 p1 (NOT p2)), acceptance={0} source=3 dest: 4}, { cond=(AND p3 p1 (NOT p2)), acceptance={0, 1} source=3 dest: 5}, { cond=(AND p0 p3 (NOT p1) (NOT p2)), acceptance={1} source=3 dest: 6}, { cond=(AND p0 p3 p1 (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(AND p0 (NOT p3) (NOT p1) (NOT p2)), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p3 p1 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p3 (NOT p1) (NOT p2)), acceptance={1} source=4 dest: 6}, { cond=(AND p0 p3 p1 (NOT p2)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={0} source=4 dest: 8}, { cond=(AND p0 (NOT p3) p1 (NOT p2)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=5 dest: 6}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND p0 p3 (NOT p2)), acceptance={1} source=6 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={0, 1} source=6 dest: 2}], [{ cond=(AND p0 p3 (NOT p1) (NOT p2)), acceptance={1} source=7 dest: 1}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={0, 1} source=7 dest: 2}, { cond=(AND p3 p1 (NOT p2)), acceptance={0} source=7 dest: 8}, { cond=(AND p0 p3 p1 (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(AND p0 (NOT p3) (NOT p1)), acceptance={1} source=8 dest: 1}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0, 1} source=8 dest: 2}, { cond=(AND p3 (NOT p1)), acceptance={0, 1} source=8 dest: 3}, { cond=(AND p3 p1), acceptance={0} source=8 dest: 4}, { cond=(AND p0 p3 (NOT p1)), acceptance={1} source=8 dest: 6}, { cond=(AND p0 p3 p1), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p3) p1), acceptance={0} source=8 dest: 8}, { cond=(AND p0 (NOT p3) p1), acceptance={} source=8 dest: 9}], [{ cond=(AND p0 p3 (NOT p1)), acceptance={1} source=9 dest: 1}, { cond=(AND p3 (NOT p1)), acceptance={0, 1} source=9 dest: 2}, { cond=(AND p3 p1), acceptance={0} source=9 dest: 8}, { cond=(AND p0 p3 p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(EQ s1086 1), p3:(NEQ s4498 1), p1:(EQ s1530 1), p2:(EQ s4504 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 184 reset in 734 ms.
Product exploration explored 100000 steps with 182 reset in 719 ms.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Detected a total of 1598/5903 stabilizing places and 1598/5403 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p3 (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (AND p3 (NOT p1)))), true, (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND p0 p3 p1)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X p3)), (X (X (NOT p0))), (X (X (NOT (AND p3 p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 1017 ms. Reduced automaton from 10 states, 48 edges and 4 AP to 10 states, 48 edges and 4 AP.
Stuttering acceptance computed with spot in 507 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2) p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 463 ms. (steps per millisecond=21 ) properties (out of 27) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 5403 rows 5903 cols
[2022-05-19 14:34:44] [INFO ] Computed 901 place invariants in 16 ms
[2022-05-19 14:34:47] [INFO ] [Real]Absence check using 901 positive place invariants in 540 ms returned sat
[2022-05-19 14:34:53] [INFO ] After 9215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2022-05-19 14:34:56] [INFO ] [Nat]Absence check using 901 positive place invariants in 539 ms returned sat
[2022-05-19 14:35:06] [INFO ] After 8571ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2022-05-19 14:35:09] [INFO ] Deduced a trap composed of 36 places in 2081 ms of which 3 ms to minimize.
[2022-05-19 14:35:11] [INFO ] Deduced a trap composed of 24 places in 2095 ms of which 3 ms to minimize.
[2022-05-19 14:35:13] [INFO ] Deduced a trap composed of 19 places in 2021 ms of which 3 ms to minimize.
[2022-05-19 14:35:15] [INFO ] Deduced a trap composed of 22 places in 1988 ms of which 4 ms to minimize.
[2022-05-19 14:35:18] [INFO ] Deduced a trap composed of 17 places in 2072 ms of which 20 ms to minimize.
[2022-05-19 14:35:20] [INFO ] Deduced a trap composed of 29 places in 2010 ms of which 3 ms to minimize.
[2022-05-19 14:35:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 14:35:20] [INFO ] After 26730ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:24
Fused 24 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 6446 ms.
Support contains 4 out of 5903 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5903/5903 places, 5403/5403 transitions.
Drop transitions removed 1196 transitions
Trivial Post-agglo rules discarded 1196 transitions
Performed 1196 trivial Post agglomeration. Transition count delta: 1196
Iterating post reduction 0 with 1196 rules applied. Total rules applied 1196 place count 5903 transition count 4207
Reduce places removed 1196 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1197 rules applied. Total rules applied 2393 place count 4707 transition count 4206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2394 place count 4706 transition count 4206
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 799 Pre rules applied. Total rules applied 2394 place count 4706 transition count 3407
Deduced a syphon composed of 799 places in 10 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 3 with 1598 rules applied. Total rules applied 3992 place count 3907 transition count 3407
Performed 1701 Post agglomeration using F-continuation condition.Transition count delta: 1701
Deduced a syphon composed of 1701 places in 3 ms
Reduce places removed 1701 places and 0 transitions.
Iterating global reduction 3 with 3402 rules applied. Total rules applied 7394 place count 2206 transition count 1706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7395 place count 2206 transition count 1705
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 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7397 place count 2205 transition count 1704
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7599 place count 2104 transition count 1770
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7801 place count 2003 transition count 1836
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 7993 place count 1907 transition count 1901
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7994 place count 1907 transition count 1900
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 5 with 100 rules applied. Total rules applied 8094 place count 1907 transition count 1900
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 8095 place count 1906 transition count 1899
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 8097 place count 1904 transition count 1899
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 8097 place count 1904 transition count 1898
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 8099 place count 1903 transition count 1898
Applied a total of 8099 rules in 1284 ms. Remains 1903 /5903 variables (removed 4000) and now considering 1898/5403 (removed 3505) transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/5903 places, 1898/5403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 443 ms. (steps per millisecond=22 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 54719 steps, run timeout after 3004 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 54719 steps, saw 34720 distinct states, run finished after 3004 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 1898 rows 1903 cols
[2022-05-19 14:35:31] [INFO ] Computed 899 place invariants in 2 ms
[2022-05-19 14:35:32] [INFO ] [Real]Absence check using 899 positive place invariants in 147 ms returned sat
[2022-05-19 14:35:34] [INFO ] After 2533ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2022-05-19 14:35:35] [INFO ] [Nat]Absence check using 899 positive place invariants in 139 ms returned sat
[2022-05-19 14:35:38] [INFO ] After 2282ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2022-05-19 14:35:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 14:35:39] [INFO ] After 1553ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2022-05-19 14:35:41] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 2 ms to minimize.
[2022-05-19 14:35:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2022-05-19 14:35:42] [INFO ] After 4385ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 1571 ms.
[2022-05-19 14:35:44] [INFO ] After 10033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Fused 24 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 2642 ms.
Support contains 4 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1903/1903 places, 1898/1898 transitions.
Applied a total of 0 rules in 56 ms. Remains 1903 /1903 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1898/1898 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1903/1903 places, 1898/1898 transitions.
Applied a total of 0 rules in 56 ms. Remains 1903 /1903 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
// Phase 1: matrix 1898 rows 1903 cols
[2022-05-19 14:35:47] [INFO ] Computed 899 place invariants in 7 ms
[2022-05-19 14:35:48] [INFO ] Implicit Places using invariants in 1146 ms returned [1892]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1147 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1902/1903 places, 1898/1898 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1901 transition count 1897
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1901 transition count 1897
Applied a total of 2 rules in 117 ms. Remains 1901 /1902 variables (removed 1) and now considering 1897/1898 (removed 1) transitions.
// Phase 1: matrix 1897 rows 1901 cols
[2022-05-19 14:35:48] [INFO ] Computed 898 place invariants in 7 ms
[2022-05-19 14:35:49] [INFO ] Implicit Places using invariants in 1191 ms returned []
// Phase 1: matrix 1897 rows 1901 cols
[2022-05-19 14:35:49] [INFO ] Computed 898 place invariants in 3 ms
[2022-05-19 14:35:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 14:35:52] [INFO ] Implicit Places using invariants and state equation in 2617 ms returned []
Implicit Place search using SMT with State Equation took 3810 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1901/1903 places, 1897/1898 transitions.
Finished structural reductions, in 2 iterations. Remains : 1901/1903 places, 1897/1898 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) seen :0
Interrupted probabilistic random walk after 60400 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 60400 steps, saw 38867 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 1897 rows 1901 cols
[2022-05-19 14:35:55] [INFO ] Computed 898 place invariants in 2 ms
[2022-05-19 14:35:57] [INFO ] [Real]Absence check using 898 positive place invariants in 146 ms returned sat
[2022-05-19 14:35:58] [INFO ] After 2533ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2022-05-19 14:35:59] [INFO ] [Nat]Absence check using 898 positive place invariants in 146 ms returned sat
[2022-05-19 14:36:02] [INFO ] After 2301ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2022-05-19 14:36:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 14:36:04] [INFO ] After 1556ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2022-05-19 14:36:06] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-05-19 14:36:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2022-05-19 14:36:06] [INFO ] After 4334ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 1519 ms.
[2022-05-19 14:36:08] [INFO ] After 9973ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Fused 24 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 3532 ms.
Support contains 4 out of 1901 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1901/1901 places, 1897/1897 transitions.
Applied a total of 0 rules in 51 ms. Remains 1901 /1901 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1901/1901 places, 1897/1897 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1901/1901 places, 1897/1897 transitions.
Applied a total of 0 rules in 52 ms. Remains 1901 /1901 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
// Phase 1: matrix 1897 rows 1901 cols
[2022-05-19 14:36:12] [INFO ] Computed 898 place invariants in 3 ms
[2022-05-19 14:36:13] [INFO ] Implicit Places using invariants in 1301 ms returned []
// Phase 1: matrix 1897 rows 1901 cols
[2022-05-19 14:36:13] [INFO ] Computed 898 place invariants in 3 ms
[2022-05-19 14:36:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 14:36:15] [INFO ] Implicit Places using invariants and state equation in 2501 ms returned []
Implicit Place search using SMT with State Equation took 3822 ms to find 0 implicit places.
[2022-05-19 14:36:15] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 1897 rows 1901 cols
[2022-05-19 14:36:16] [INFO ] Computed 898 place invariants in 4 ms
[2022-05-19 14:36:17] [INFO ] Dead Transitions using invariants and state equation in 1058 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1901/1901 places, 1897/1897 transitions.
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 1901 transition count 1897
Applied a total of 200 rules in 109 ms. Remains 1901 /1901 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Running SMT prover for 24 properties.
// Phase 1: matrix 1897 rows 1901 cols
[2022-05-19 14:36:17] [INFO ] Computed 898 place invariants in 5 ms
[2022-05-19 14:36:18] [INFO ] [Real]Absence check using 898 positive place invariants in 136 ms returned sat
[2022-05-19 14:36:19] [INFO ] After 2414ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2022-05-19 14:36:20] [INFO ] [Nat]Absence check using 898 positive place invariants in 133 ms returned sat
[2022-05-19 14:36:23] [INFO ] After 2168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2022-05-19 14:36:23] [INFO ] State equation strengthened by 198 read => feed constraints.
[2022-05-19 14:36:26] [INFO ] After 2691ms SMT Verify possible using 198 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2022-05-19 14:36:26] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2022-05-19 14:36:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 306 ms
[2022-05-19 14:36:29] [INFO ] After 5949ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 1903 ms.
[2022-05-19 14:36:31] [INFO ] After 11738ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
[2022-05-19 14:36:31] [INFO ] Flatten gal took : 57 ms
[2022-05-19 14:36:31] [INFO ] Flatten gal took : 57 ms
[2022-05-19 14:36:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5707167933150660278.gal : 5 ms
[2022-05-19 14:36:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18051083214887911943.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms9442915843589086429;'/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/ReachabilityCardinality5707167933150660278.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18051083214887911943.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/ReachabilityCardinality18051083214887911943.prop.
SDD proceeding with computation,24 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,24 properties remain. new max is 8
SDD size :3 after 30
SDD proceeding with computation,24 properties remain. new max is 16
SDD size :30 after 87
SDD proceeding with computation,24 properties remain. new max is 32
SDD size :87 after 186
Reachability property apf24 is true.
Reachability property apf14 is true.
Reachability property apf8 is true.
Reachability property apf3 is true.
Reachability property apf2 is true.
SDD proceeding with computation,19 properties remain. new max is 32
SDD size :186 after 318
SDD proceeding with computation,19 properties remain. new max is 64
SDD size :318 after 383
SDD proceeding with computation,19 properties remain. new max is 128
SDD size :383 after 514
SDD proceeding with computation,19 properties remain. new max is 256
SDD size :514 after 2178
SDD proceeding with computation,19 properties remain. new max is 512
SDD size :2178 after 42978
SDD proceeding with computation,19 properties remain. new max is 1024
SDD size :42978 after 6.68443e+06
SDD proceeding with computation,19 properties remain. new max is 2048
SDD size :6.68443e+06 after 5.46013e+07
SDD proceeding with computation,19 properties remain. new max is 4096
SDD size :5.46013e+07 after 3.60411e+10
SDD proceeding with computation,19 properties remain. new max is 8192
SDD size :3.60411e+10 after 2.46499e+15
SDD proceeding with computation,19 properties remain. new max is 16384
SDD size :2.46499e+15 after 9.72092e+18
SDD proceeding with computation,19 properties remain. new max is 32768
SDD size :9.72092e+18 after 2.54726e+27
SDD proceeding with computation,19 properties remain. new max is 65536
SDD size :2.54726e+27 after 6.58379e+37
Reachability property apf23 is true.
Reachability property apf19 is true.
Reachability property apf13 is true.
Reachability property apf7 is true.
Reachability property apf1 is true.
Reachability property apf0 is true.
SDD proceeding with computation,13 properties remain. new max is 65536
SDD size :6.58379e+37 after 7.01309e+52
Detected timeout of ITS tools.
[2022-05-19 14:36:46] [INFO ] Flatten gal took : 58 ms
[2022-05-19 14:36:46] [INFO ] Applying decomposition
[2022-05-19 14:36:46] [INFO ] Flatten gal took : 58 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/graph18302415948656332793.txt' '-o' '/tmp/graph18302415948656332793.bin' '-w' '/tmp/graph18302415948656332793.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18302415948656332793.bin' '-l' '-1' '-v' '-w' '/tmp/graph18302415948656332793.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:36:46] [INFO ] Decomposing Gal with order
[2022-05-19 14:36:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:36:46] [INFO ] Removed a total of 1089 redundant transitions.
[2022-05-19 14:36:46] [INFO ] Flatten gal took : 81 ms
[2022-05-19 14:36:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 8 ms.
[2022-05-19 14:36:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6274167477373614134.gal : 13 ms
[2022-05-19 14:36:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11298442342720668454.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms9442915843589086429;'/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/ReachabilityCardinality6274167477373614134.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11298442342720668454.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/ReachabilityCardinality11298442342720668454.prop.
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :1 after 1
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8636021748682514250
[2022-05-19 14:37:02] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8636021748682514250
Running compilation step : cd /tmp/ltsmin8636021748682514250;'/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/ltsmin8636021748682514250;'/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/ltsmin8636021748682514250;'/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)
Knowledge obtained : [(AND (NOT p0) p3 (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (AND p3 (NOT p1)))), true, (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND p0 p3 p1)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X p3)), (X (X (NOT p0))), (X (X (NOT (AND p3 p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) p3))), (F (NOT (AND (NOT p2) p3 (NOT p1))))]
Knowledge based reduction with 11 factoid took 1690 ms. Reduced automaton from 10 states, 48 edges and 4 AP to 10 states, 48 edges and 4 AP.
Stuttering acceptance computed with spot in 456 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2) p3)]
Stuttering acceptance computed with spot in 385 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2) p3)]
// Phase 1: matrix 5403 rows 5903 cols
[2022-05-19 14:37:07] [INFO ] Computed 901 place invariants in 14 ms
[2022-05-19 14:37:16] [INFO ] [Real]Absence check using 901 positive place invariants in 4281 ms returned sat
[2022-05-19 14:37:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 14:37:22] [INFO ] [Real]Absence check using state equation in 6596 ms returned unknown
Could not prove EG (NOT p2)
Support contains 4 out of 5903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5903/5903 places, 5403/5403 transitions.
Applied a total of 0 rules in 829 ms. Remains 5903 /5903 variables (removed 0) and now considering 5403/5403 (removed 0) transitions.
// Phase 1: matrix 5403 rows 5903 cols
[2022-05-19 14:37:23] [INFO ] Computed 901 place invariants in 23 ms
[2022-05-19 14:37:25] [INFO ] Implicit Places using invariants in 1696 ms returned []
// Phase 1: matrix 5403 rows 5903 cols
[2022-05-19 14:37:25] [INFO ] Computed 901 place invariants in 14 ms
[2022-05-19 14:37:27] [INFO ] Implicit Places using invariants and state equation in 1692 ms returned []
Implicit Place search using SMT with State Equation took 3412 ms to find 0 implicit places.
// Phase 1: matrix 5403 rows 5903 cols
[2022-05-19 14:37:27] [INFO ] Computed 901 place invariants in 18 ms
[2022-05-19 14:37:30] [INFO ] Dead Transitions using invariants and state equation in 3511 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5903/5903 places, 5403/5403 transitions.
Computed a total of 1598 stabilizing places and 1598 stable transitions
Computed a total of 1598 stabilizing places and 1598 stable transitions
Detected a total of 1598/5903 stabilizing places and 1598/5403 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p3 (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (AND p3 (NOT p1)))), true, (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND p0 p3 p1)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X p3)), (X (X (NOT p0))), (X (X (NOT (AND p3 p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 976 ms. Reduced automaton from 10 states, 48 edges and 4 AP to 10 states, 48 edges and 4 AP.
Stuttering acceptance computed with spot in 1401 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2) p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 568 ms. (steps per millisecond=17 ) properties (out of 27) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) 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 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 5403 rows 5903 cols
[2022-05-19 14:37:33] [INFO ] Computed 901 place invariants in 16 ms
[2022-05-19 14:37:36] [INFO ] [Real]Absence check using 901 positive place invariants in 544 ms returned sat
[2022-05-19 14:37:43] [INFO ] After 9553ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2022-05-19 14:37:46] [INFO ] [Nat]Absence check using 901 positive place invariants in 556 ms returned sat
[2022-05-19 14:37:56] [INFO ] After 8345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2022-05-19 14:37:59] [INFO ] Deduced a trap composed of 36 places in 2115 ms of which 3 ms to minimize.
[2022-05-19 14:38:01] [INFO ] Deduced a trap composed of 24 places in 2138 ms of which 4 ms to minimize.
[2022-05-19 14:38:03] [INFO ] Deduced a trap composed of 19 places in 2009 ms of which 3 ms to minimize.
[2022-05-19 14:38:05] [INFO ] Deduced a trap composed of 22 places in 2136 ms of which 4 ms to minimize.
[2022-05-19 14:38:08] [INFO ] Deduced a trap composed of 17 places in 2085 ms of which 4 ms to minimize.
[2022-05-19 14:38:10] [INFO ] Deduced a trap composed of 29 places in 1940 ms of which 5 ms to minimize.
[2022-05-19 14:38:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 14:38:10] [INFO ] After 26827ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:24
Fused 24 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 5264 ms.
Support contains 4 out of 5903 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5903/5903 places, 5403/5403 transitions.
Drop transitions removed 1196 transitions
Trivial Post-agglo rules discarded 1196 transitions
Performed 1196 trivial Post agglomeration. Transition count delta: 1196
Iterating post reduction 0 with 1196 rules applied. Total rules applied 1196 place count 5903 transition count 4207
Reduce places removed 1196 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1197 rules applied. Total rules applied 2393 place count 4707 transition count 4206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2394 place count 4706 transition count 4206
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 799 Pre rules applied. Total rules applied 2394 place count 4706 transition count 3407
Deduced a syphon composed of 799 places in 11 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 3 with 1598 rules applied. Total rules applied 3992 place count 3907 transition count 3407
Performed 1701 Post agglomeration using F-continuation condition.Transition count delta: 1701
Deduced a syphon composed of 1701 places in 4 ms
Reduce places removed 1701 places and 0 transitions.
Iterating global reduction 3 with 3402 rules applied. Total rules applied 7394 place count 2206 transition count 1706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7395 place count 2206 transition count 1705
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 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7397 place count 2205 transition count 1704
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7599 place count 2104 transition count 1770
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7801 place count 2003 transition count 1836
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 96 places in 5 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 7993 place count 1907 transition count 1901
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7994 place count 1907 transition count 1900
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 5 with 100 rules applied. Total rules applied 8094 place count 1907 transition count 1900
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 8095 place count 1906 transition count 1899
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 8097 place count 1904 transition count 1899
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 8097 place count 1904 transition count 1898
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 8099 place count 1903 transition count 1898
Applied a total of 8099 rules in 1339 ms. Remains 1903 /5903 variables (removed 4000) and now considering 1898/5403 (removed 3505) transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/5903 places, 1898/5403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 443 ms. (steps per millisecond=22 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) seen :0
Interrupted probabilistic random walk after 58994 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 58994 steps, saw 37287 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 1898 rows 1903 cols
[2022-05-19 14:38:20] [INFO ] Computed 899 place invariants in 2 ms
[2022-05-19 14:38:21] [INFO ] [Real]Absence check using 899 positive place invariants in 143 ms returned sat
[2022-05-19 14:38:23] [INFO ] After 2384ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2022-05-19 14:38:24] [INFO ] [Nat]Absence check using 899 positive place invariants in 145 ms returned sat
[2022-05-19 14:38:27] [INFO ] After 2268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2022-05-19 14:38:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 14:38:28] [INFO ] After 1560ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2022-05-19 14:38:30] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-05-19 14:38:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2022-05-19 14:38:31] [INFO ] After 4348ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 1579 ms.
[2022-05-19 14:38:33] [INFO ] After 10031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Fused 24 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 2228 ms.
Support contains 4 out of 1903 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1903/1903 places, 1898/1898 transitions.
Applied a total of 0 rules in 55 ms. Remains 1903 /1903 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1903/1903 places, 1898/1898 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1903/1903 places, 1898/1898 transitions.
Applied a total of 0 rules in 53 ms. Remains 1903 /1903 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
// Phase 1: matrix 1898 rows 1903 cols
[2022-05-19 14:38:35] [INFO ] Computed 899 place invariants in 7 ms
[2022-05-19 14:38:36] [INFO ] Implicit Places using invariants in 1235 ms returned [1892]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1238 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1902/1903 places, 1898/1898 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1901 transition count 1897
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1901 transition count 1897
Applied a total of 2 rules in 99 ms. Remains 1901 /1902 variables (removed 1) and now considering 1897/1898 (removed 1) transitions.
// Phase 1: matrix 1897 rows 1901 cols
[2022-05-19 14:38:36] [INFO ] Computed 898 place invariants in 8 ms
[2022-05-19 14:38:37] [INFO ] Implicit Places using invariants in 1194 ms returned []
// Phase 1: matrix 1897 rows 1901 cols
[2022-05-19 14:38:37] [INFO ] Computed 898 place invariants in 6 ms
[2022-05-19 14:38:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 14:38:40] [INFO ] Implicit Places using invariants and state equation in 2649 ms returned []
Implicit Place search using SMT with State Equation took 3846 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1901/1903 places, 1897/1898 transitions.
Finished structural reductions, in 2 iterations. Remains : 1901/1903 places, 1897/1898 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 422 ms. (steps per millisecond=23 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) seen :0
Interrupted probabilistic random walk after 59035 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59035 steps, saw 38043 distinct states, run finished after 3002 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 1897 rows 1901 cols
[2022-05-19 14:38:44] [INFO ] Computed 898 place invariants in 3 ms
[2022-05-19 14:38:45] [INFO ] [Real]Absence check using 898 positive place invariants in 141 ms returned sat
[2022-05-19 14:38:46] [INFO ] After 2509ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2022-05-19 14:38:47] [INFO ] [Nat]Absence check using 898 positive place invariants in 142 ms returned sat
[2022-05-19 14:38:50] [INFO ] After 2274ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2022-05-19 14:38:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 14:38:52] [INFO ] After 1561ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2022-05-19 14:38:54] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2022-05-19 14:38:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2022-05-19 14:38:55] [INFO ] After 4357ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 1583 ms.
[2022-05-19 14:38:56] [INFO ] After 9968ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
Fused 24 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 2384 ms.
Support contains 4 out of 1901 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1901/1901 places, 1897/1897 transitions.
Applied a total of 0 rules in 55 ms. Remains 1901 /1901 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1901/1901 places, 1897/1897 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1901/1901 places, 1897/1897 transitions.
Applied a total of 0 rules in 53 ms. Remains 1901 /1901 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
// Phase 1: matrix 1897 rows 1901 cols
[2022-05-19 14:38:59] [INFO ] Computed 898 place invariants in 7 ms
[2022-05-19 14:39:00] [INFO ] Implicit Places using invariants in 1114 ms returned []
// Phase 1: matrix 1897 rows 1901 cols
[2022-05-19 14:39:00] [INFO ] Computed 898 place invariants in 4 ms
[2022-05-19 14:39:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 14:39:03] [INFO ] Implicit Places using invariants and state equation in 2611 ms returned []
Implicit Place search using SMT with State Equation took 3730 ms to find 0 implicit places.
[2022-05-19 14:39:03] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 1897 rows 1901 cols
[2022-05-19 14:39:03] [INFO ] Computed 898 place invariants in 6 ms
[2022-05-19 14:39:04] [INFO ] Dead Transitions using invariants and state equation in 1091 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1901/1901 places, 1897/1897 transitions.
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 1901 transition count 1897
Applied a total of 200 rules in 110 ms. Remains 1901 /1901 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Running SMT prover for 24 properties.
// Phase 1: matrix 1897 rows 1901 cols
[2022-05-19 14:39:04] [INFO ] Computed 898 place invariants in 5 ms
[2022-05-19 14:39:05] [INFO ] [Real]Absence check using 898 positive place invariants in 149 ms returned sat
[2022-05-19 14:39:06] [INFO ] After 2541ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2022-05-19 14:39:07] [INFO ] [Nat]Absence check using 898 positive place invariants in 157 ms returned sat
[2022-05-19 14:39:11] [INFO ] After 2268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2022-05-19 14:39:11] [INFO ] State equation strengthened by 198 read => feed constraints.
[2022-05-19 14:39:13] [INFO ] After 2836ms SMT Verify possible using 198 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2022-05-19 14:39:14] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 1 ms to minimize.
[2022-05-19 14:39:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
[2022-05-19 14:39:17] [INFO ] After 6110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
Attempting to minimize the solution found.
Minimization took 1926 ms.
[2022-05-19 14:39:19] [INFO ] After 12115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
[2022-05-19 14:39:19] [INFO ] Flatten gal took : 57 ms
[2022-05-19 14:39:19] [INFO ] Flatten gal took : 58 ms
[2022-05-19 14:39:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5297491238398129345.gal : 5 ms
[2022-05-19 14:39:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17505710973399089046.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12686182361398503706;'/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/ReachabilityCardinality5297491238398129345.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17505710973399089046.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/ReachabilityCardinality17505710973399089046.prop.
SDD proceeding with computation,24 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,24 properties remain. new max is 8
SDD size :3 after 30
SDD proceeding with computation,24 properties remain. new max is 16
SDD size :30 after 87
SDD proceeding with computation,24 properties remain. new max is 32
SDD size :87 after 186
Reachability property apf24 is true.
Reachability property apf14 is true.
Reachability property apf8 is true.
Reachability property apf3 is true.
Reachability property apf2 is true.
SDD proceeding with computation,19 properties remain. new max is 32
SDD size :186 after 318
SDD proceeding with computation,19 properties remain. new max is 64
SDD size :318 after 383
SDD proceeding with computation,19 properties remain. new max is 128
SDD size :383 after 514
SDD proceeding with computation,19 properties remain. new max is 256
SDD size :514 after 2178
SDD proceeding with computation,19 properties remain. new max is 512
SDD size :2178 after 42978
SDD proceeding with computation,19 properties remain. new max is 1024
SDD size :42978 after 6.68443e+06
SDD proceeding with computation,19 properties remain. new max is 2048
SDD size :6.68443e+06 after 5.46013e+07
SDD proceeding with computation,19 properties remain. new max is 4096
SDD size :5.46013e+07 after 3.60411e+10
SDD proceeding with computation,19 properties remain. new max is 8192
SDD size :3.60411e+10 after 2.46499e+15
SDD proceeding with computation,19 properties remain. new max is 16384
SDD size :2.46499e+15 after 9.72092e+18
SDD proceeding with computation,19 properties remain. new max is 32768
SDD size :9.72092e+18 after 2.54726e+27
SDD proceeding with computation,19 properties remain. new max is 65536
SDD size :2.54726e+27 after 6.58379e+37
Reachability property apf23 is true.
Reachability property apf19 is true.
Reachability property apf13 is true.
Reachability property apf7 is true.
Reachability property apf1 is true.
Reachability property apf0 is true.
SDD proceeding with computation,13 properties remain. new max is 65536
SDD size :6.58379e+37 after 7.01309e+52
Detected timeout of ITS tools.
[2022-05-19 14:39:34] [INFO ] Flatten gal took : 59 ms
[2022-05-19 14:39:34] [INFO ] Applying decomposition
[2022-05-19 14:39:34] [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/graph18155435309021243490.txt' '-o' '/tmp/graph18155435309021243490.bin' '-w' '/tmp/graph18155435309021243490.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18155435309021243490.bin' '-l' '-1' '-v' '-w' '/tmp/graph18155435309021243490.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:39:34] [INFO ] Decomposing Gal with order
[2022-05-19 14:39:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:39:34] [INFO ] Removed a total of 1089 redundant transitions.
[2022-05-19 14:39:34] [INFO ] Flatten gal took : 90 ms
[2022-05-19 14:39:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 8 ms.
[2022-05-19 14:39:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14168971710352807946.gal : 14 ms
[2022-05-19 14:39:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15693403132317955919.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12686182361398503706;'/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/ReachabilityCardinality14168971710352807946.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15693403132317955919.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/ReachabilityCardinality15693403132317955919.prop.
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :1 after 1
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1475296177000566583
[2022-05-19 14:39:49] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1475296177000566583
Running compilation step : cd /tmp/ltsmin1475296177000566583;'/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/ltsmin1475296177000566583;'/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/ltsmin1475296177000566583;'/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)
Knowledge obtained : [(AND (NOT p0) p3 (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (AND p3 (NOT p1)))), true, (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND p0 p3 p1)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X p3)), (X (X (NOT p0))), (X (X (NOT (AND p3 p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) p3))), (F (NOT (AND (NOT p2) p3 (NOT p1))))]
Knowledge based reduction with 11 factoid took 986 ms. Reduced automaton from 10 states, 48 edges and 4 AP to 10 states, 48 edges and 4 AP.
Stuttering acceptance computed with spot in 472 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2) p3)]
Stuttering acceptance computed with spot in 456 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2) p3)]
// Phase 1: matrix 5403 rows 5903 cols
[2022-05-19 14:39:54] [INFO ] Computed 901 place invariants in 25 ms
[2022-05-19 14:40:03] [INFO ] [Real]Absence check using 901 positive place invariants in 4558 ms returned sat
[2022-05-19 14:40:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 14:40:09] [INFO ] [Real]Absence check using state equation in 5973 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 464 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2) p3)]
Product exploration explored 100000 steps with 181 reset in 779 ms.
Product exploration explored 100000 steps with 184 reset in 782 ms.
Built C files in :
/tmp/ltsmin11886315773876228553
[2022-05-19 14:40:12] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11886315773876228553
Running compilation step : cd /tmp/ltsmin11886315773876228553;'/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/ltsmin11886315773876228553;'/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/ltsmin11886315773876228553;'/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 4 out of 5903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5903/5903 places, 5403/5403 transitions.
Applied a total of 0 rules in 896 ms. Remains 5903 /5903 variables (removed 0) and now considering 5403/5403 (removed 0) transitions.
// Phase 1: matrix 5403 rows 5903 cols
[2022-05-19 14:40:16] [INFO ] Computed 901 place invariants in 21 ms
[2022-05-19 14:40:18] [INFO ] Implicit Places using invariants in 2689 ms returned []
// Phase 1: matrix 5403 rows 5903 cols
[2022-05-19 14:40:18] [INFO ] Computed 901 place invariants in 21 ms
[2022-05-19 14:40:21] [INFO ] Implicit Places using invariants and state equation in 3201 ms returned []
Implicit Place search using SMT with State Equation took 5916 ms to find 0 implicit places.
// Phase 1: matrix 5403 rows 5903 cols
[2022-05-19 14:40:21] [INFO ] Computed 901 place invariants in 20 ms
[2022-05-19 14:40:28] [INFO ] Dead Transitions using invariants and state equation in 6569 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5903/5903 places, 5403/5403 transitions.
Built C files in :
/tmp/ltsmin15070612912809449613
[2022-05-19 14:40:28] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15070612912809449613
Running compilation step : cd /tmp/ltsmin15070612912809449613;'/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/ltsmin15070612912809449613;'/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/ltsmin15070612912809449613;'/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 14:40:32] [INFO ] Flatten gal took : 150 ms
[2022-05-19 14:40:32] [INFO ] Flatten gal took : 123 ms
[2022-05-19 14:40:32] [INFO ] Time to serialize gal into /tmp/LTL14227901938929026522.gal : 28 ms
[2022-05-19 14:40:32] [INFO ] Time to serialize properties into /tmp/LTL9501126549166721282.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/LTL14227901938929026522.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9501126549166721282.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/LTL1422790...267
Read 1 LTL properties
Checking formula 0 : !((X(F(!(("(p1271==1)")U(!(X(((G("(p1797==1)"))U(X("(p5335==1)")))&&("(p5327!=1)")))))))))
Formula 0 simplified : !XF!("(p1271==1)" U !X("(p5327!=1)" & (G"(p1797==1)" U X"(p5335==1)")))
Detected timeout of ITS tools.
[2022-05-19 14:40:47] [INFO ] Flatten gal took : 126 ms
[2022-05-19 14:40:47] [INFO ] Applying decomposition
[2022-05-19 14:40:47] [INFO ] Flatten gal took : 133 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/graph6975168108282395398.txt' '-o' '/tmp/graph6975168108282395398.bin' '-w' '/tmp/graph6975168108282395398.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6975168108282395398.bin' '-l' '-1' '-v' '-w' '/tmp/graph6975168108282395398.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:40:48] [INFO ] Decomposing Gal with order
[2022-05-19 14:40:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:40:49] [INFO ] Removed a total of 987 redundant transitions.
[2022-05-19 14:40:49] [INFO ] Flatten gal took : 210 ms
[2022-05-19 14:40:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2022-05-19 14:40:49] [INFO ] Time to serialize gal into /tmp/LTL6279519101658148712.gal : 31 ms
[2022-05-19 14:40:49] [INFO ] Time to serialize properties into /tmp/LTL16488298380994184166.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/LTL6279519101658148712.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16488298380994184166.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/LTL6279519...246
Read 1 LTL properties
Checking formula 0 : !((X(F(!(("(i12.i1.i7.u408.p1271==1)")U(!(X(((G("(i18.i0.i4.u572.p1797==1)"))U(X("(i51.u1669.p5335==1)")))&&("(i51.u1668.p5327!=1)")))...161
Formula 0 simplified : !XF!("(i12.i1.i7.u408.p1271==1)" U !X("(i51.u1668.p5327!=1)" & (G"(i18.i0.i4.u572.p1797==1)" U X"(i51.u1669.p5335==1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8712926396973979671
[2022-05-19 14:41:04] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8712926396973979671
Running compilation step : cd /tmp/ltsmin8712926396973979671;'/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/ltsmin8712926396973979671;'/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/ltsmin8712926396973979671;'/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-100B-LTLFireability-13 finished in 397297 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(X(p1))||p0))))'
Found a SL insensitive property : ShieldIIPt-PT-100B-LTLFireability-02
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 5911 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 5911/5911 places, 5411/5411 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1203 transitions
Trivial Post-agglo rules discarded 1203 transitions
Performed 1203 trivial Post agglomeration. Transition count delta: 1203
Iterating post reduction 0 with 1203 rules applied. Total rules applied 1203 place count 5910 transition count 4207
Reduce places removed 1203 places and 0 transitions.
Iterating post reduction 1 with 1203 rules applied. Total rules applied 2406 place count 4707 transition count 4207
Performed 793 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 793 Pre rules applied. Total rules applied 2406 place count 4707 transition count 3414
Deduced a syphon composed of 793 places in 10 ms
Reduce places removed 793 places and 0 transitions.
Iterating global reduction 2 with 1586 rules applied. Total rules applied 3992 place count 3914 transition count 3414
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 3999 place count 3907 transition count 3407
Iterating global reduction 2 with 7 rules applied. Total rules applied 4006 place count 3907 transition count 3407
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4006 place count 3907 transition count 3402
Deduced a syphon composed of 5 places in 14 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 4016 place count 3902 transition count 3402
Performed 1697 Post agglomeration using F-continuation condition.Transition count delta: 1697
Deduced a syphon composed of 1697 places in 3 ms
Reduce places removed 1697 places and 0 transitions.
Iterating global reduction 2 with 3394 rules applied. Total rules applied 7410 place count 2205 transition count 1705
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7411 place count 2205 transition count 1704
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 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7413 place count 2204 transition count 1703
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7615 place count 2103 transition count 1769
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7817 place count 2002 transition count 1837
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8011 place count 1905 transition count 1902
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8013 place count 1903 transition count 1900
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8015 place count 1901 transition count 1900
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8015 place count 1901 transition count 1899
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8017 place count 1900 transition count 1899
Applied a total of 8017 rules in 2514 ms. Remains 1900 /5911 variables (removed 4011) and now considering 1899/5411 (removed 3512) transitions.
// Phase 1: matrix 1899 rows 1900 cols
[2022-05-19 14:41:10] [INFO ] Computed 899 place invariants in 2 ms
[2022-05-19 14:41:20] [INFO ] Implicit Places using invariants in 9607 ms returned [1889]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 9614 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1899/5911 places, 1899/5411 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1898 transition count 1898
Applied a total of 2 rules in 98 ms. Remains 1898 /1899 variables (removed 1) and now considering 1898/1899 (removed 1) transitions.
// Phase 1: matrix 1898 rows 1898 cols
[2022-05-19 14:41:20] [INFO ] Computed 898 place invariants in 6 ms
[2022-05-19 14:41:24] [INFO ] Implicit Places using invariants in 3807 ms returned []
// Phase 1: matrix 1898 rows 1898 cols
[2022-05-19 14:41:24] [INFO ] Computed 898 place invariants in 4 ms
[2022-05-19 14:41:26] [INFO ] Implicit Places using invariants and state equation in 2726 ms returned []
Implicit Place search using SMT with State Equation took 6542 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 1898/5911 places, 1898/5411 transitions.
Finished structural reductions, in 2 iterations. Remains : 1898/5911 places, 1898/5411 transitions.
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s1652 0), p0:(OR (EQ s1652 0) (EQ s1295 0) (EQ s1309 0) (AND (EQ s1295 1) (EQ s1309 1) (EQ s1845 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][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1320 ms.
Product exploration explored 100000 steps with 0 reset in 1651 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 93911 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93911 steps, saw 56040 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1898 rows 1898 cols
[2022-05-19 14:41:33] [INFO ] Computed 898 place invariants in 5 ms
[2022-05-19 14:41:33] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 14:41:34] [INFO ] [Nat]Absence check using 898 positive place invariants in 147 ms returned sat
[2022-05-19 14:41:35] [INFO ] After 890ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 14:41:35] [INFO ] After 1117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 137 ms.
[2022-05-19 14:41:35] [INFO ] After 1703ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 114 ms.
Support contains 4 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1898/1898 places, 1898/1898 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 1898 transition count 1897
Applied a total of 1 rules in 54 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1898 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1898/1898 places, 1897/1898 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:41:36] [INFO ] Computed 898 place invariants in 5 ms
[2022-05-19 14:41:36] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:41:36] [INFO ] [Nat]Absence check using 898 positive place invariants in 145 ms returned sat
[2022-05-19 14:41:37] [INFO ] After 791ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:41:37] [INFO ] After 909ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2022-05-19 14:41:37] [INFO ] After 1350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 35 ms.
Support contains 4 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 55 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1898/1898 places, 1897/1897 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 101862 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101862 steps, saw 62370 distinct states, run finished after 3003 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:41:40] [INFO ] Computed 898 place invariants in 6 ms
[2022-05-19 14:41:41] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:41:41] [INFO ] [Nat]Absence check using 898 positive place invariants in 141 ms returned sat
[2022-05-19 14:41:42] [INFO ] After 739ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:41:42] [INFO ] After 850ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2022-05-19 14:41:42] [INFO ] After 1311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 36 ms.
Support contains 4 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 54 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1898/1898 places, 1897/1897 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 54 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:41:42] [INFO ] Computed 898 place invariants in 4 ms
[2022-05-19 14:41:43] [INFO ] Implicit Places using invariants in 1210 ms returned []
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:41:43] [INFO ] Computed 898 place invariants in 3 ms
[2022-05-19 14:41:46] [INFO ] Implicit Places using invariants and state equation in 2364 ms returned []
Implicit Place search using SMT with State Equation took 3588 ms to find 0 implicit places.
[2022-05-19 14:41:46] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:41:46] [INFO ] Computed 898 place invariants in 5 ms
[2022-05-19 14:41:47] [INFO ] Dead Transitions using invariants and state equation in 1066 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1898/1898 places, 1897/1897 transitions.
Partial Free-agglomeration rule applied 199 times.
Drop transitions removed 199 transitions
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 1898 transition count 1897
Applied a total of 199 rules in 104 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:41:47] [INFO ] Computed 898 place invariants in 4 ms
[2022-05-19 14:41:47] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:41:48] [INFO ] [Nat]Absence check using 898 positive place invariants in 148 ms returned sat
[2022-05-19 14:41:48] [INFO ] After 832ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:41:49] [INFO ] After 955ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2022-05-19 14:41:49] [INFO ] After 1422ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 14:41:49] [INFO ] Flatten gal took : 48 ms
[2022-05-19 14:41:49] [INFO ] Flatten gal took : 48 ms
[2022-05-19 14:41:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5257310134744622342.gal : 5 ms
[2022-05-19 14:41:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4195447061943321786.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16985182132341701950;'/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/ReachabilityCardinality5257310134744622342.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4195447061943321786.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/ReachabilityCardinality4195447061943321786.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 20
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :20 after 58
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :58 after 124
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :124 after 255
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :255 after 384
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :384 after 1483
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1483 after 298753
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :298753 after 1.34218e+12
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.34218e+12 after 3.60288e+25
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3.60288e+25 after 6.16585e+52
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6.16585e+52 after 1.20781e+108
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.20781e+108 after 5.02391e+213
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.80092e+280,2.8254,58644,2,3395,18,219551,7,0,9500,267450,0
Total reachable state count : 2.800923008994670246824541758380399680021e+280
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,6.61056e+191,2.83389,58644,2,2927,18,219551,7,0,9509,267450,0
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1898 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1898/1898 places, 1898/1898 transitions.
Applied a total of 0 rules in 49 ms. Remains 1898 /1898 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
// Phase 1: matrix 1898 rows 1898 cols
[2022-05-19 14:41:52] [INFO ] Computed 898 place invariants in 6 ms
[2022-05-19 14:41:53] [INFO ] Implicit Places using invariants in 1169 ms returned []
// Phase 1: matrix 1898 rows 1898 cols
[2022-05-19 14:41:53] [INFO ] Computed 898 place invariants in 2 ms
[2022-05-19 14:41:56] [INFO ] Implicit Places using invariants and state equation in 2484 ms returned []
Implicit Place search using SMT with State Equation took 3654 ms to find 0 implicit places.
// Phase 1: matrix 1898 rows 1898 cols
[2022-05-19 14:41:56] [INFO ] Computed 898 place invariants in 3 ms
[2022-05-19 14:41:57] [INFO ] Dead Transitions using invariants and state equation in 1069 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1898/1898 places, 1898/1898 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 239 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1898 rows 1898 cols
[2022-05-19 14:41:57] [INFO ] Computed 898 place invariants in 6 ms
[2022-05-19 14:41:58] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:41:58] [INFO ] [Nat]Absence check using 898 positive place invariants in 137 ms returned sat
[2022-05-19 14:41:59] [INFO ] After 766ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:41:59] [INFO ] After 876ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2022-05-19 14:41:59] [INFO ] After 1296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 35 ms.
Support contains 4 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1898/1898 places, 1898/1898 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 1898 transition count 1897
Applied a total of 1 rules in 58 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1898 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1898/1898 places, 1897/1898 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 103205 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103205 steps, saw 63283 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:42:02] [INFO ] Computed 898 place invariants in 4 ms
[2022-05-19 14:42:03] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:42:03] [INFO ] [Nat]Absence check using 898 positive place invariants in 151 ms returned sat
[2022-05-19 14:42:04] [INFO ] After 738ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:42:04] [INFO ] After 855ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2022-05-19 14:42:04] [INFO ] After 1328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 43 ms.
Support contains 4 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 55 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1898/1898 places, 1897/1897 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1898/1898 places, 1897/1897 transitions.
Applied a total of 0 rules in 53 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:42:04] [INFO ] Computed 898 place invariants in 7 ms
[2022-05-19 14:42:05] [INFO ] Implicit Places using invariants in 1145 ms returned []
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:42:05] [INFO ] Computed 898 place invariants in 8 ms
[2022-05-19 14:42:08] [INFO ] Implicit Places using invariants and state equation in 2455 ms returned []
Implicit Place search using SMT with State Equation took 3603 ms to find 0 implicit places.
[2022-05-19 14:42:08] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:42:08] [INFO ] Computed 898 place invariants in 5 ms
[2022-05-19 14:42:09] [INFO ] Dead Transitions using invariants and state equation in 1071 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1898/1898 places, 1897/1897 transitions.
Partial Free-agglomeration rule applied 199 times.
Drop transitions removed 199 transitions
Iterating global reduction 0 with 199 rules applied. Total rules applied 199 place count 1898 transition count 1897
Applied a total of 199 rules in 117 ms. Remains 1898 /1898 variables (removed 0) and now considering 1897/1897 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1897 rows 1898 cols
[2022-05-19 14:42:09] [INFO ] Computed 898 place invariants in 6 ms
[2022-05-19 14:42:09] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 14:42:09] [INFO ] [Nat]Absence check using 898 positive place invariants in 153 ms returned sat
[2022-05-19 14:42:10] [INFO ] After 833ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 14:42:10] [INFO ] After 950ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2022-05-19 14:42:10] [INFO ] After 1421ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 14:42:11] [INFO ] Flatten gal took : 48 ms
[2022-05-19 14:42:11] [INFO ] Flatten gal took : 48 ms
[2022-05-19 14:42:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5257140242749948554.gal : 5 ms
[2022-05-19 14:42:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18348657920572226881.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms15264074986915759897;'/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/ReachabilityCardinality5257140242749948554.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18348657920572226881.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/ReachabilityCardinality18348657920572226881.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 20
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :20 after 58
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :58 after 124
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :124 after 255
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :255 after 384
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :384 after 1483
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1483 after 298753
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :298753 after 1.34218e+12
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.34218e+12 after 3.60288e+25
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3.60288e+25 after 6.16585e+52
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6.16585e+52 after 1.20781e+108
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.20781e+108 after 5.02391e+213
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.80092e+280,3.15644,58640,2,3395,18,219551,7,0,9500,267450,0
Total reachable state count : 2.800923008994670246824541758380399680021e+280
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,6.61056e+191,3.16695,58640,2,2927,18,219551,7,0,9509,267450,0
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 143 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 253 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 1303 ms.
Product exploration explored 100000 steps with 0 reset in 1714 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1898 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1898/1898 places, 1898/1898 transitions.
Applied a total of 0 rules in 61 ms. Remains 1898 /1898 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
[2022-05-19 14:42:18] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 1898 rows 1898 cols
[2022-05-19 14:42:18] [INFO ] Computed 898 place invariants in 6 ms
[2022-05-19 14:42:19] [INFO ] Dead Transitions using invariants and state equation in 1056 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1898/1898 places, 1898/1898 transitions.
Product exploration explored 100000 steps with 0 reset in 1312 ms.
Product exploration explored 100000 steps with 0 reset in 1707 ms.
Built C files in :
/tmp/ltsmin8739839517955668359
[2022-05-19 14:42:22] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8739839517955668359
Running compilation step : cd /tmp/ltsmin8739839517955668359;'/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/ltsmin8739839517955668359;'/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/ltsmin8739839517955668359;'/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 4 out of 1898 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1898/1898 places, 1898/1898 transitions.
Applied a total of 0 rules in 50 ms. Remains 1898 /1898 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
// Phase 1: matrix 1898 rows 1898 cols
[2022-05-19 14:42:25] [INFO ] Computed 898 place invariants in 7 ms
[2022-05-19 14:42:26] [INFO ] Implicit Places using invariants in 1197 ms returned []
// Phase 1: matrix 1898 rows 1898 cols
[2022-05-19 14:42:26] [INFO ] Computed 898 place invariants in 2 ms
[2022-05-19 14:42:29] [INFO ] Implicit Places using invariants and state equation in 2594 ms returned []
Implicit Place search using SMT with State Equation took 3791 ms to find 0 implicit places.
// Phase 1: matrix 1898 rows 1898 cols
[2022-05-19 14:42:29] [INFO ] Computed 898 place invariants in 2 ms
[2022-05-19 14:42:30] [INFO ] Dead Transitions using invariants and state equation in 1076 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1898/1898 places, 1898/1898 transitions.
Built C files in :
/tmp/ltsmin8064487330335472151
[2022-05-19 14:42:30] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8064487330335472151
Running compilation step : cd /tmp/ltsmin8064487330335472151;'/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/ltsmin8064487330335472151;'/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/ltsmin8064487330335472151;'/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 14:42:33] [INFO ] Flatten gal took : 52 ms
[2022-05-19 14:42:33] [INFO ] Flatten gal took : 54 ms
[2022-05-19 14:42:33] [INFO ] Time to serialize gal into /tmp/LTL1981923332125987182.gal : 6 ms
[2022-05-19 14:42:33] [INFO ] Time to serialize properties into /tmp/LTL2484684687109075409.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/LTL1981923332125987182.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2484684687109075409.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/LTL1981923...266
Read 1 LTL properties
Checking formula 0 : !((X(G((((G(X("(p6084==0)")))||("(p6084==0)"))||("((p4805==0)||(p4838==0))"))||("(((p4805==1)&&(p4838==1))&&(p6788==1))")))))
Formula 0 simplified : !XG("(((p4805==1)&&(p4838==1))&&(p6788==1))" | "((p4805==0)||(p4838==0))" | "(p6084==0)" | GX"(p6084==0)")
Detected timeout of ITS tools.
[2022-05-19 14:42:48] [INFO ] Flatten gal took : 53 ms
[2022-05-19 14:42:48] [INFO ] Applying decomposition
[2022-05-19 14:42:48] [INFO ] Flatten gal took : 53 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/graph1945037340448265974.txt' '-o' '/tmp/graph1945037340448265974.bin' '-w' '/tmp/graph1945037340448265974.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1945037340448265974.bin' '-l' '-1' '-v' '-w' '/tmp/graph1945037340448265974.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:42:48] [INFO ] Decomposing Gal with order
[2022-05-19 14:42:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:42:48] [INFO ] Removed a total of 2186 redundant transitions.
[2022-05-19 14:42:49] [INFO ] Flatten gal took : 91 ms
[2022-05-19 14:42:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 992 labels/synchronizations in 17 ms.
[2022-05-19 14:42:49] [INFO ] Time to serialize gal into /tmp/LTL13086332818569427620.gal : 12 ms
[2022-05-19 14:42:49] [INFO ] Time to serialize properties into /tmp/LTL2608293043004589023.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/LTL13086332818569427620.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2608293043004589023.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/LTL1308633...246
Read 1 LTL properties
Checking formula 0 : !((X(G((((G(X("(i37.i1.i1.u696.p6084==0)")))||("(i37.i1.i1.u696.p6084==0)"))||("((i29.i1.i0.u545.p4805==0)||(i29.i1.i0.u551.p4838==0))...251
Formula 0 simplified : !XG("(((i29.i1.i0.u545.p4805==1)&&(i29.i1.i0.u551.p4838==1))&&(i41.i0.i0.u777.p6788==1))" | "((i29.i1.i0.u545.p4805==0)||(i29.i1.i0....234
Reverse transition relation is NOT exact ! Due to transitions i37.i1.i1.u696.t101.t1089, i37.i1.i1.u696.t101.t1090, Intersection with reachable at each st...217
Computing Next relation with stutter on 5.48772e+124 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9430089195593381919
[2022-05-19 14:43:04] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9430089195593381919
Running compilation step : cd /tmp/ltsmin9430089195593381919;'/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/ltsmin9430089195593381919;'/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/ltsmin9430089195593381919;'/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-100B-LTLFireability-02 finished in 119213 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!(!p0 U X(p1))||p2))))'
Found a CL insensitive property : ShieldIIPt-PT-100B-LTLFireability-03
Stuttering acceptance computed with spot in 113 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 4 out of 5911 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 5911/5911 places, 5411/5411 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1201 transitions
Trivial Post-agglo rules discarded 1201 transitions
Performed 1201 trivial Post agglomeration. Transition count delta: 1201
Iterating post reduction 0 with 1201 rules applied. Total rules applied 1201 place count 5910 transition count 4209
Reduce places removed 1201 places and 0 transitions.
Iterating post reduction 1 with 1201 rules applied. Total rules applied 2402 place count 4709 transition count 4209
Performed 794 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 794 Pre rules applied. Total rules applied 2402 place count 4709 transition count 3415
Deduced a syphon composed of 794 places in 10 ms
Reduce places removed 794 places and 0 transitions.
Iterating global reduction 2 with 1588 rules applied. Total rules applied 3990 place count 3915 transition count 3415
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 3999 place count 3906 transition count 3406
Iterating global reduction 2 with 9 rules applied. Total rules applied 4008 place count 3906 transition count 3406
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4008 place count 3906 transition count 3399
Deduced a syphon composed of 7 places in 8 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 4022 place count 3899 transition count 3399
Performed 1691 Post agglomeration using F-continuation condition.Transition count delta: 1691
Deduced a syphon composed of 1691 places in 4 ms
Reduce places removed 1691 places and 0 transitions.
Iterating global reduction 2 with 3382 rules applied. Total rules applied 7404 place count 2208 transition count 1708
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7405 place count 2208 transition count 1707
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 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7407 place count 2207 transition count 1706
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7609 place count 2106 transition count 1772
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7811 place count 2005 transition count 1840
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 97 places in 4 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8005 place count 1908 transition count 1905
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8007 place count 1906 transition count 1903
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 8009 place count 1904 transition count 1903
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8009 place count 1904 transition count 1902
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8011 place count 1903 transition count 1902
Applied a total of 8011 rules in 1738 ms. Remains 1903 /5911 variables (removed 4008) and now considering 1902/5411 (removed 3509) transitions.
// Phase 1: matrix 1902 rows 1903 cols
[2022-05-19 14:43:09] [INFO ] Computed 899 place invariants in 4 ms
[2022-05-19 14:43:10] [INFO ] Implicit Places using invariants in 1143 ms returned [1892]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1155 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1902/5911 places, 1902/5411 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1901 transition count 1901
Applied a total of 2 rules in 112 ms. Remains 1901 /1902 variables (removed 1) and now considering 1901/1902 (removed 1) transitions.
// Phase 1: matrix 1901 rows 1901 cols
[2022-05-19 14:43:10] [INFO ] Computed 898 place invariants in 2 ms
[2022-05-19 14:43:11] [INFO ] Implicit Places using invariants in 1270 ms returned []
// Phase 1: matrix 1901 rows 1901 cols
[2022-05-19 14:43:11] [INFO ] Computed 898 place invariants in 4 ms
[2022-05-19 14:43:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 14:43:14] [INFO ] Implicit Places using invariants and state equation in 2587 ms returned []
Implicit Place search using SMT with State Equation took 3878 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 1901/5911 places, 1901/5411 transitions.
Finished structural reductions, in 2 iterations. Remains : 1901/5911 places, 1901/5411 transitions.
Running random walk in product with property : ShieldIIPt-PT-100B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s651 1) (EQ s670 1)), p0:(OR (AND (EQ s651 1) (EQ s670 1)) (EQ s1668 1)), p1:(EQ s75 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 15 steps with 4 reset in 1 ms.
Treatment of property ShieldIIPt-PT-100B-LTLFireability-03 finished in 7111 ms.
CL/SL decision was in the wrong direction : CL + false
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(p0 U !X(((G(p1) U X(p2))&&p3))))))'
[2022-05-19 14:43:14] [INFO ] Flatten gal took : 116 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14175930372234071381
[2022-05-19 14:43:14] [INFO ] Too many transitions (5411) to apply POR reductions. Disabling POR matrices.
[2022-05-19 14:43:14] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14175930372234071381
Running compilation step : cd /tmp/ltsmin14175930372234071381;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' '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 14:43:14] [INFO ] Applying decomposition
[2022-05-19 14:43:14] [INFO ] Flatten gal took : 116 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/graph15233460556093917066.txt' '-o' '/tmp/graph15233460556093917066.bin' '-w' '/tmp/graph15233460556093917066.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15233460556093917066.bin' '-l' '-1' '-v' '-w' '/tmp/graph15233460556093917066.weights' '-q' '0' '-e' '0.001'
[2022-05-19 14:43:15] [INFO ] Decomposing Gal with order
[2022-05-19 14:43:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 14:43:16] [INFO ] Removed a total of 988 redundant transitions.
[2022-05-19 14:43:16] [INFO ] Flatten gal took : 192 ms
[2022-05-19 14:43:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2022-05-19 14:43:16] [INFO ] Time to serialize gal into /tmp/LTLFireability1460255534690571415.gal : 29 ms
[2022-05-19 14:43:16] [INFO ] Time to serialize properties into /tmp/LTLFireability8841466583293262899.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/LTLFireability1460255534690571415.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8841466583293262899.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...267
Read 3 LTL properties
Checking formula 0 : !((X(G((((G(X("(i59.i1.i5.u1918.p6084==0)")))||("(i59.i1.i5.u1918.p6084==0)"))||("((i48.i0.i0.u1515.p4805==0)||(i48.i0.i5.u1523.p4838=...258
Formula 0 simplified : !XG("(((i48.i0.i0.u1515.p4805==1)&&(i48.i0.i5.u1523.p4838==1))&&(i66.i0.i6.u2136.p6788==1))" | "((i48.i0.i0.u1515.p4805==0)||(i48.i0...241
Compilation finished in 19254 ms.
Running link step : cd /tmp/ltsmin14175930372234071381;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 172 ms.
Running LTSmin : cd /tmp/ltsmin14175930372234071381;'/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((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin14175930372234071381;'/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((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14175930372234071381;'/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(<>((!(!(LTLAPp2==true) U X((LTLAPp3==true)))||(LTLAPp4==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 15:10:30] [INFO ] Applying decomposition
[2022-05-19 15:10:30] [INFO ] Flatten gal took : 284 ms
[2022-05-19 15:10:30] [INFO ] Decomposing Gal with order
[2022-05-19 15:10:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 15:10:35] [INFO ] Removed a total of 299 redundant transitions.
[2022-05-19 15:10:35] [INFO ] Flatten gal took : 440 ms
[2022-05-19 15:10:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 27 ms.
[2022-05-19 15:10:37] [INFO ] Time to serialize gal into /tmp/LTLFireability5186970959818189714.gal : 392 ms
[2022-05-19 15:10:37] [INFO ] Time to serialize properties into /tmp/LTLFireability3775106913075170018.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/LTLFireability5186970959818189714.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3775106913075170018.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...267
Read 3 LTL properties
Checking formula 0 : !((X(G((((G(X("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u1578.p6084==0)")))||("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u157...722
Formula 0 simplified : !XG("(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.u1264.p480...705
LTSmin run took 484660 ms.
FORMULA ShieldIIPt-PT-100B-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin14175930372234071381;'/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(<>(!((LTLAPp5==true) U !X((([]((LTLAPp6==true)) U X((LTLAPp7==true)))&&(LTLAPp8==true))))))' '--buchi-type=spotba'
LTSmin run took 6115 ms.
FORMULA ShieldIIPt-PT-100B-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin14175930372234071381;'/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((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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-100B"
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-100B, 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-165286025100348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-100B.tgz
mv ShieldIIPt-PT-100B 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 ;