About the Execution of ITS-Tools for Peterson-PT-4
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13163.735 | 3600000.00 | 3679800.00 | 59336.40 | F??????????????T | 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.r168-tall-165277016200066.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 Peterson-PT-4, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016200066
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 47K Apr 30 09:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 209K Apr 30 09:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 83K Apr 30 09:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 388K Apr 30 09:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 26K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.5K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 298K 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 Peterson-PT-4-CTLFireability-00
FORMULA_NAME Peterson-PT-4-CTLFireability-01
FORMULA_NAME Peterson-PT-4-CTLFireability-02
FORMULA_NAME Peterson-PT-4-CTLFireability-03
FORMULA_NAME Peterson-PT-4-CTLFireability-04
FORMULA_NAME Peterson-PT-4-CTLFireability-05
FORMULA_NAME Peterson-PT-4-CTLFireability-06
FORMULA_NAME Peterson-PT-4-CTLFireability-07
FORMULA_NAME Peterson-PT-4-CTLFireability-08
FORMULA_NAME Peterson-PT-4-CTLFireability-09
FORMULA_NAME Peterson-PT-4-CTLFireability-10
FORMULA_NAME Peterson-PT-4-CTLFireability-11
FORMULA_NAME Peterson-PT-4-CTLFireability-12
FORMULA_NAME Peterson-PT-4-CTLFireability-13
FORMULA_NAME Peterson-PT-4-CTLFireability-14
FORMULA_NAME Peterson-PT-4-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1652780429244
Running Version 202205111006
[2022-05-17 09:40:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -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-17 09:40:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 09:40:30] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2022-05-17 09:40:30] [INFO ] Transformed 480 places.
[2022-05-17 09:40:30] [INFO ] Transformed 690 transitions.
[2022-05-17 09:40:30] [INFO ] Found NUPN structural information;
[2022-05-17 09:40:30] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_0_3_4, IsEndLoop_1_3_4, TestAlone_3_1_4, TestAlone_2_2_4, TestIdentity_2_3_4, TestIdentity_4_0_4, AskForSection_0_3, AskForSection_0_2]
[2022-05-17 09:40:30] [INFO ] Parsed PT model containing 480 places and 690 transitions in 237 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 32 ms.
Support contains 480 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 17 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2022-05-17 09:40:30] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 09:40:30] [INFO ] Computed 19 place invariants in 23 ms
[2022-05-17 09:40:31] [INFO ] Implicit Places using invariants in 264 ms returned []
[2022-05-17 09:40:31] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 09:40:31] [INFO ] Computed 19 place invariants in 10 ms
[2022-05-17 09:40:31] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 09:40:31] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
[2022-05-17 09:40:31] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 09:40:31] [INFO ] Computed 19 place invariants in 9 ms
[2022-05-17 09:40:31] [INFO ] Dead Transitions using invariants and state equation in 342 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 480/480 places, 690/690 transitions.
Support contains 480 out of 480 places after structural reductions.
[2022-05-17 09:40:33] [INFO ] Flatten gal took : 91 ms
[2022-05-17 09:40:33] [INFO ] Flatten gal took : 69 ms
[2022-05-17 09:40:34] [INFO ] Input system was already deterministic with 690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 611 ms. (steps per millisecond=16 ) properties (out of 50) seen :35
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 41 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 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2022-05-17 09:40:35] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 09:40:35] [INFO ] Computed 19 place invariants in 4 ms
[2022-05-17 09:40:35] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2022-05-17 09:40:35] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 09:40:35] [INFO ] After 561ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:14
[2022-05-17 09:40:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-17 09:40:36] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 09:40:36] [INFO ] After 551ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :13
[2022-05-17 09:40:36] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 09:40:37] [INFO ] After 475ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :2 sat :13
[2022-05-17 09:40:37] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 5 ms to minimize.
[2022-05-17 09:40:37] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 2 ms to minimize.
[2022-05-17 09:40:37] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 0 ms to minimize.
[2022-05-17 09:40:38] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 1 ms to minimize.
[2022-05-17 09:40:38] [INFO ] Deduced a trap composed of 136 places in 128 ms of which 1 ms to minimize.
[2022-05-17 09:40:38] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 1 ms to minimize.
[2022-05-17 09:40:38] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 1 ms to minimize.
[2022-05-17 09:40:38] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 1 ms to minimize.
[2022-05-17 09:40:38] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 0 ms to minimize.
[2022-05-17 09:40:38] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 1 ms to minimize.
[2022-05-17 09:40:39] [INFO ] Deduced a trap composed of 62 places in 111 ms of which 0 ms to minimize.
[2022-05-17 09:40:39] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 1 ms to minimize.
[2022-05-17 09:40:39] [INFO ] Deduced a trap composed of 61 places in 109 ms of which 0 ms to minimize.
[2022-05-17 09:40:39] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 1 ms to minimize.
[2022-05-17 09:40:39] [INFO ] Deduced a trap composed of 92 places in 84 ms of which 0 ms to minimize.
[2022-05-17 09:40:39] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 0 ms to minimize.
[2022-05-17 09:40:39] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 0 ms to minimize.
[2022-05-17 09:40:40] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 0 ms to minimize.
[2022-05-17 09:40:40] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 0 ms to minimize.
[2022-05-17 09:40:40] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 1 ms to minimize.
[2022-05-17 09:40:40] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 1 ms to minimize.
[2022-05-17 09:40:40] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 1 ms to minimize.
[2022-05-17 09:40:40] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 1 ms to minimize.
[2022-05-17 09:40:40] [INFO ] Deduced a trap composed of 97 places in 66 ms of which 1 ms to minimize.
[2022-05-17 09:40:40] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2022-05-17 09:40:41] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 1 ms to minimize.
[2022-05-17 09:40:41] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 0 ms to minimize.
[2022-05-17 09:40:41] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 1 ms to minimize.
[2022-05-17 09:40:41] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 1 ms to minimize.
[2022-05-17 09:40:41] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 1 ms to minimize.
[2022-05-17 09:40:41] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 0 ms to minimize.
[2022-05-17 09:40:42] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 0 ms to minimize.
[2022-05-17 09:40:42] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 1 ms to minimize.
[2022-05-17 09:40:42] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 5261 ms
[2022-05-17 09:40:42] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 1 ms to minimize.
[2022-05-17 09:40:42] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 3 ms to minimize.
[2022-05-17 09:40:43] [INFO ] Deduced a trap composed of 76 places in 99 ms of which 0 ms to minimize.
[2022-05-17 09:40:43] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 0 ms to minimize.
[2022-05-17 09:40:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 591 ms
[2022-05-17 09:40:43] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 0 ms to minimize.
[2022-05-17 09:40:43] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 0 ms to minimize.
[2022-05-17 09:40:43] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2022-05-17 09:40:43] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 0 ms to minimize.
[2022-05-17 09:40:43] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2022-05-17 09:40:44] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 1 ms to minimize.
[2022-05-17 09:40:44] [INFO ] Deduced a trap composed of 60 places in 112 ms of which 0 ms to minimize.
[2022-05-17 09:40:44] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 0 ms to minimize.
[2022-05-17 09:40:44] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 1 ms to minimize.
[2022-05-17 09:40:44] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 0 ms to minimize.
[2022-05-17 09:40:44] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 0 ms to minimize.
[2022-05-17 09:40:45] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 1 ms to minimize.
[2022-05-17 09:40:45] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1812 ms
[2022-05-17 09:40:45] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 0 ms to minimize.
[2022-05-17 09:40:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2022-05-17 09:40:45] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 1 ms to minimize.
[2022-05-17 09:40:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2022-05-17 09:40:45] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 1 ms to minimize.
[2022-05-17 09:40:45] [INFO ] Deduced a trap composed of 61 places in 112 ms of which 1 ms to minimize.
[2022-05-17 09:40:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 311 ms
[2022-05-17 09:40:46] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 0 ms to minimize.
[2022-05-17 09:40:46] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 1 ms to minimize.
[2022-05-17 09:40:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 341 ms
[2022-05-17 09:40:46] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 0 ms to minimize.
[2022-05-17 09:40:46] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 3 ms to minimize.
[2022-05-17 09:40:46] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 1 ms to minimize.
[2022-05-17 09:40:47] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 0 ms to minimize.
[2022-05-17 09:40:47] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 1 ms to minimize.
[2022-05-17 09:40:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 787 ms
[2022-05-17 09:40:47] [INFO ] After 10651ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :13
Attempting to minimize the solution found.
Minimization took 777 ms.
[2022-05-17 09:40:48] [INFO ] After 12324ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :13
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 146 out of 480 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 480 transition count 619
Reduce places removed 71 places and 0 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 1 with 150 rules applied. Total rules applied 221 place count 409 transition count 540
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 2 with 79 rules applied. Total rules applied 300 place count 330 transition count 540
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 300 place count 330 transition count 521
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 338 place count 311 transition count 521
Applied a total of 338 rules in 52 ms. Remains 311 /480 variables (removed 169) and now considering 521/690 (removed 169) transitions.
Finished structural reductions, in 1 iterations. Remains : 311/480 places, 521/690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2022-05-17 09:40:49] [INFO ] Flow matrix only has 461 transitions (discarded 60 similar events)
// Phase 1: matrix 461 rows 311 cols
[2022-05-17 09:40:49] [INFO ] Computed 19 place invariants in 7 ms
[2022-05-17 09:40:49] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2022-05-17 09:40:49] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-17 09:40:49] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-17 09:40:49] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-05-17 09:40:49] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-17 09:40:49] [INFO ] After 340ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-17 09:40:49] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 09:40:50] [INFO ] After 289ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2022-05-17 09:40:50] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 0 ms to minimize.
[2022-05-17 09:40:50] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 0 ms to minimize.
[2022-05-17 09:40:50] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 1 ms to minimize.
[2022-05-17 09:40:50] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 0 ms to minimize.
[2022-05-17 09:40:50] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 0 ms to minimize.
[2022-05-17 09:40:51] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 0 ms to minimize.
[2022-05-17 09:40:51] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 0 ms to minimize.
[2022-05-17 09:40:51] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2022-05-17 09:40:51] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2022-05-17 09:40:51] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 0 ms to minimize.
[2022-05-17 09:40:51] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 0 ms to minimize.
[2022-05-17 09:40:51] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 0 ms to minimize.
[2022-05-17 09:40:51] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2022-05-17 09:40:51] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 1 ms to minimize.
[2022-05-17 09:40:52] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 0 ms to minimize.
[2022-05-17 09:40:52] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 0 ms to minimize.
[2022-05-17 09:40:52] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 0 ms to minimize.
[2022-05-17 09:40:52] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 0 ms to minimize.
[2022-05-17 09:40:52] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 0 ms to minimize.
[2022-05-17 09:40:52] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 2 ms to minimize.
[2022-05-17 09:40:52] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2022-05-17 09:40:52] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2469 ms
[2022-05-17 09:40:52] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2022-05-17 09:40:53] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 0 ms to minimize.
[2022-05-17 09:40:53] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2022-05-17 09:40:53] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2022-05-17 09:40:53] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 0 ms to minimize.
[2022-05-17 09:40:53] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 0 ms to minimize.
[2022-05-17 09:40:53] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 0 ms to minimize.
[2022-05-17 09:40:53] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 0 ms to minimize.
[2022-05-17 09:40:53] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 0 ms to minimize.
[2022-05-17 09:40:53] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2022-05-17 09:40:53] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 1 ms to minimize.
[2022-05-17 09:40:53] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1073 ms
[2022-05-17 09:40:53] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 0 ms to minimize.
[2022-05-17 09:40:54] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 0 ms to minimize.
[2022-05-17 09:40:54] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2022-05-17 09:40:54] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 0 ms to minimize.
[2022-05-17 09:40:54] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 0 ms to minimize.
[2022-05-17 09:40:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 503 ms
[2022-05-17 09:40:54] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 0 ms to minimize.
[2022-05-17 09:40:54] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2022-05-17 09:40:54] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 1 ms to minimize.
[2022-05-17 09:40:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 306 ms
[2022-05-17 09:40:54] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 0 ms to minimize.
[2022-05-17 09:40:55] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 1 ms to minimize.
[2022-05-17 09:40:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2022-05-17 09:40:55] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 0 ms to minimize.
[2022-05-17 09:40:55] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 1 ms to minimize.
[2022-05-17 09:40:55] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 0 ms to minimize.
[2022-05-17 09:40:55] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 0 ms to minimize.
[2022-05-17 09:40:55] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
[2022-05-17 09:40:55] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 0 ms to minimize.
[2022-05-17 09:40:55] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 0 ms to minimize.
[2022-05-17 09:40:55] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 0 ms to minimize.
[2022-05-17 09:40:55] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 672 ms
[2022-05-17 09:40:55] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 0 ms to minimize.
[2022-05-17 09:40:55] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2022-05-17 09:40:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 135 ms
[2022-05-17 09:40:56] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 1 ms to minimize.
[2022-05-17 09:40:56] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 0 ms to minimize.
[2022-05-17 09:40:56] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 0 ms to minimize.
[2022-05-17 09:40:56] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 1 ms to minimize.
[2022-05-17 09:40:56] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 0 ms to minimize.
[2022-05-17 09:40:56] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 0 ms to minimize.
[2022-05-17 09:40:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 608 ms
[2022-05-17 09:40:56] [INFO ] After 6622ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 429 ms.
[2022-05-17 09:40:56] [INFO ] After 7582ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 96 ms.
Support contains 143 out of 311 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 311/311 places, 521/521 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 311 transition count 520
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 310 transition count 518
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 308 transition count 518
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 308 transition count 517
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 307 transition count 517
Applied a total of 8 rules in 34 ms. Remains 307 /311 variables (removed 4) and now considering 517/521 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 307/311 places, 517/521 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 417336 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :{}
Probabilistic random walk after 417336 steps, saw 71221 distinct states, run finished after 3003 ms. (steps per millisecond=138 ) properties seen :0
Running SMT prover for 11 properties.
[2022-05-17 09:41:01] [INFO ] Flow matrix only has 457 transitions (discarded 60 similar events)
// Phase 1: matrix 457 rows 307 cols
[2022-05-17 09:41:01] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-17 09:41:01] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-17 09:41:01] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-17 09:41:01] [INFO ] After 343ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-17 09:41:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-17 09:41:01] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 09:41:02] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-17 09:41:02] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 09:41:02] [INFO ] After 298ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2022-05-17 09:41:02] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 0 ms to minimize.
[2022-05-17 09:41:02] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 1 ms to minimize.
[2022-05-17 09:41:02] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 1 ms to minimize.
[2022-05-17 09:41:02] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 0 ms to minimize.
[2022-05-17 09:41:03] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 0 ms to minimize.
[2022-05-17 09:41:03] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 0 ms to minimize.
[2022-05-17 09:41:03] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2022-05-17 09:41:03] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 0 ms to minimize.
[2022-05-17 09:41:03] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2022-05-17 09:41:03] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 0 ms to minimize.
[2022-05-17 09:41:03] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 0 ms to minimize.
[2022-05-17 09:41:03] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 0 ms to minimize.
[2022-05-17 09:41:03] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2022-05-17 09:41:04] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 0 ms to minimize.
[2022-05-17 09:41:04] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 0 ms to minimize.
[2022-05-17 09:41:04] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 0 ms to minimize.
[2022-05-17 09:41:04] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 0 ms to minimize.
[2022-05-17 09:41:04] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 0 ms to minimize.
[2022-05-17 09:41:04] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2022-05-17 09:41:04] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 0 ms to minimize.
[2022-05-17 09:41:04] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2022-05-17 09:41:04] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 1 ms to minimize.
[2022-05-17 09:41:05] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 0 ms to minimize.
[2022-05-17 09:41:05] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 0 ms to minimize.
[2022-05-17 09:41:05] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 1 ms to minimize.
[2022-05-17 09:41:05] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2022-05-17 09:41:05] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 0 ms to minimize.
[2022-05-17 09:41:05] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 1 ms to minimize.
[2022-05-17 09:41:05] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 0 ms to minimize.
[2022-05-17 09:41:05] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 0 ms to minimize.
[2022-05-17 09:41:05] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2022-05-17 09:41:05] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 3484 ms
[2022-05-17 09:41:06] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 0 ms to minimize.
[2022-05-17 09:41:06] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 0 ms to minimize.
[2022-05-17 09:41:06] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 0 ms to minimize.
[2022-05-17 09:41:06] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2022-05-17 09:41:06] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 0 ms to minimize.
[2022-05-17 09:41:06] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 0 ms to minimize.
[2022-05-17 09:41:06] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2022-05-17 09:41:06] [INFO ] Deduced a trap composed of 90 places in 63 ms of which 1 ms to minimize.
[2022-05-17 09:41:06] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 0 ms to minimize.
[2022-05-17 09:41:06] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 0 ms to minimize.
[2022-05-17 09:41:07] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 0 ms to minimize.
[2022-05-17 09:41:07] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2022-05-17 09:41:07] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 1 ms to minimize.
[2022-05-17 09:41:07] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 0 ms to minimize.
[2022-05-17 09:41:07] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1343 ms
[2022-05-17 09:41:07] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 0 ms to minimize.
[2022-05-17 09:41:07] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 0 ms to minimize.
[2022-05-17 09:41:07] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 0 ms to minimize.
[2022-05-17 09:41:07] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 0 ms to minimize.
[2022-05-17 09:41:07] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 0 ms to minimize.
[2022-05-17 09:41:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 538 ms
[2022-05-17 09:41:08] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
[2022-05-17 09:41:08] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 0 ms to minimize.
[2022-05-17 09:41:08] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 0 ms to minimize.
[2022-05-17 09:41:08] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 0 ms to minimize.
[2022-05-17 09:41:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 441 ms
[2022-05-17 09:41:08] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2022-05-17 09:41:08] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 0 ms to minimize.
[2022-05-17 09:41:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
[2022-05-17 09:41:08] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 0 ms to minimize.
[2022-05-17 09:41:08] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 0 ms to minimize.
[2022-05-17 09:41:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
[2022-05-17 09:41:09] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 0 ms to minimize.
[2022-05-17 09:41:09] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 0 ms to minimize.
[2022-05-17 09:41:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 253 ms
[2022-05-17 09:41:09] [INFO ] After 7093ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 430 ms.
[2022-05-17 09:41:09] [INFO ] After 8058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 130 ms.
Support contains 143 out of 307 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 307/307 places, 517/517 transitions.
Applied a total of 0 rules in 23 ms. Remains 307 /307 variables (removed 0) and now considering 517/517 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 307/307 places, 517/517 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 307/307 places, 517/517 transitions.
Applied a total of 0 rules in 17 ms. Remains 307 /307 variables (removed 0) and now considering 517/517 (removed 0) transitions.
[2022-05-17 09:41:09] [INFO ] Flow matrix only has 457 transitions (discarded 60 similar events)
// Phase 1: matrix 457 rows 307 cols
[2022-05-17 09:41:09] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-17 09:41:09] [INFO ] Implicit Places using invariants in 119 ms returned []
[2022-05-17 09:41:09] [INFO ] Flow matrix only has 457 transitions (discarded 60 similar events)
// Phase 1: matrix 457 rows 307 cols
[2022-05-17 09:41:09] [INFO ] Computed 19 place invariants in 7 ms
[2022-05-17 09:41:10] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 09:41:10] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
[2022-05-17 09:41:10] [INFO ] Redundant transitions in 35 ms returned []
[2022-05-17 09:41:10] [INFO ] Flow matrix only has 457 transitions (discarded 60 similar events)
// Phase 1: matrix 457 rows 307 cols
[2022-05-17 09:41:10] [INFO ] Computed 19 place invariants in 5 ms
[2022-05-17 09:41:10] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 307/307 places, 517/517 transitions.
Graph (trivial) has 127 edges and 307 vertex of which 30 / 307 are part of one of the 15 SCC in 2 ms
Free SCC test removed 15 places
Drop transitions removed 30 transitions
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 90 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 291 transition count 434
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 291 transition count 433
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 291 transition count 430
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 10 place count 288 transition count 430
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 22 place count 288 transition count 430
Partial Post-agglomeration rule applied 54 times.
Drop transitions removed 54 transitions
Iterating global reduction 1 with 54 rules applied. Total rules applied 76 place count 288 transition count 430
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 78 place count 288 transition count 428
Applied a total of 78 rules in 67 ms. Remains 288 /307 variables (removed 19) and now considering 428/517 (removed 89) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 428 rows 288 cols
[2022-05-17 09:41:10] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-17 09:41:10] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-17 09:41:10] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 09:41:10] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-17 09:41:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-17 09:41:10] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-17 09:41:11] [INFO ] After 332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-17 09:41:11] [INFO ] After 696ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 240 ms.
[2022-05-17 09:41:11] [INFO ] After 1099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
[2022-05-17 09:41:11] [INFO ] Flatten gal took : 20 ms
[2022-05-17 09:41:11] [INFO ] Flatten gal took : 17 ms
[2022-05-17 09:41:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9258559842671213322.gal : 13 ms
[2022-05-17 09:41:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17169229605338324408.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16520842408457311120;'/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/ReachabilityCardinality9258559842671213322.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17169229605338324408.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/ReachabilityCardinality17169229605338324408.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :6 after 8
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :8 after 12
Reachability property AtomicPropp31 is true.
Reachability property AtomicPropp12 is true.
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :12 after 24
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :24 after 26
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :26 after 160
Reachability property AtomicPropp8 is true.
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :160 after 338
Reachability property AtomicPropp49 is true.
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :338 after 960
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :960 after 8034
Reachability property AtomicPropp38 is true.
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :8034 after 15870
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :15870 after 26780
Reachability property AtomicPropp36 is true.
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :26780 after 128765
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :128765 after 940875
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :940875 after 1.22144e+06
Reachability property AtomicPropp32 is true.
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.22144e+06 after 1.69147e+07
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1.69147e+07 after 3.64105e+07
Reachability property AtomicPropp47 is true.
Reachability property AtomicPropp40 is true.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3.64105e+07 after 5.53088e+08
Reachability property AtomicPropp9 is true.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.53088e+08 after 3.51269e+09
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3.51269e+09 after 3.5166e+09
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.5166e+09 after 3.5656e+09
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3.5656e+09 after 1.44188e+10
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.44188e+10 after 7.23442e+10
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.28066e+11,8.43652,75044,2,8106,37,380619,7,0,1584,246290,0
Total reachable state count : 228065625000
Verifying 11 reachability properties.
Reachability property AtomicPropp8 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
AtomicPropp8,4.98202e+09,8.51671,75044,2,25246,37,380619,8,0,1929,246290,0
Reachability property AtomicPropp9 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp9,254150,8.52123,75044,2,1015,37,380619,9,0,1970,246290,0
Reachability property AtomicPropp12 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
AtomicPropp12,3.47004e+09,8.52485,75044,2,4020,37,380619,10,0,1970,246290,0
Reachability property AtomicPropp31 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
AtomicPropp31,9.1035e+06,8.53079,75044,2,1869,37,380619,11,0,1979,246290,0
Reachability property AtomicPropp32 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
AtomicPropp32,13200,8.53207,75044,2,531,37,380619,12,0,1981,246290,0
Reachability property AtomicPropp36 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
AtomicPropp36,124800,8.53279,75044,2,1018,37,380619,13,0,1983,246290,0
Reachability property AtomicPropp38 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
AtomicPropp38,1105,8.53344,75044,2,462,37,380619,14,0,1986,246290,0
Reachability property AtomicPropp40 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
AtomicPropp40,6.5e+06,8.53435,75044,2,1939,37,380619,15,0,1988,246290,0
Reachability property AtomicPropp46 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
AtomicPropp46,4.28763e+09,8.53587,75044,2,4062,37,380619,15,0,1989,246290,0
Reachability property AtomicPropp47 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
AtomicPropp47,1140,8.53664,75044,2,482,37,380619,16,0,1993,246290,0
Reachability property AtomicPropp49 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
AtomicPropp49,7020,8.53735,75044,2,500,37,380619,17,0,1995,246290,0
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2022-05-17 09:41:20] [INFO ] Flatten gal took : 40 ms
[2022-05-17 09:41:20] [INFO ] Flatten gal took : 48 ms
[2022-05-17 09:41:21] [INFO ] Input system was already deterministic with 690 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2022-05-17 09:41:21] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 09:41:21] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-17 09:41:21] [INFO ] Implicit Places using invariants in 158 ms returned []
[2022-05-17 09:41:21] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 09:41:21] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-17 09:41:21] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 09:41:21] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2022-05-17 09:41:21] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 09:41:21] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-17 09:41:21] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 480/480 places, 690/690 transitions.
[2022-05-17 09:41:22] [INFO ] Flatten gal took : 26 ms
[2022-05-17 09:41:22] [INFO ] Flatten gal took : 27 ms
[2022-05-17 09:41:22] [INFO ] Input system was already deterministic with 690 transitions.
[2022-05-17 09:41:22] [INFO ] Flatten gal took : 25 ms
[2022-05-17 09:41:22] [INFO ] Flatten gal took : 24 ms
[2022-05-17 09:41:22] [INFO ] Time to serialize gal into /tmp/CTLFireability5547636254579252302.gal : 5 ms
[2022-05-17 09:41:22] [INFO ] Time to serialize properties into /tmp/CTLFireability4070413588852986091.ctl : 5 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5547636254579252302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4070413588852986091.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 09:41:52] [INFO ] Flatten gal took : 31 ms
[2022-05-17 09:41:52] [INFO ] Applying decomposition
[2022-05-17 09:41:52] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13442660956935026968.txt' '-o' '/tmp/graph13442660956935026968.bin' '-w' '/tmp/graph13442660956935026968.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13442660956935026968.bin' '-l' '-1' '-v' '-w' '/tmp/graph13442660956935026968.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:41:52] [INFO ] Decomposing Gal with order
[2022-05-17 09:41:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:41:52] [INFO ] Removed a total of 500 redundant transitions.
[2022-05-17 09:41:52] [INFO ] Flatten gal took : 118 ms
[2022-05-17 09:41:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 13 ms.
[2022-05-17 09:41:52] [INFO ] Time to serialize gal into /tmp/CTLFireability12711924043465172924.gal : 17 ms
[2022-05-17 09:41:52] [INFO ] Time to serialize properties into /tmp/CTLFireability15258546995058711242.ctl : 6 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12711924043465172924.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15258546995058711242.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 480 transition count 674
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 464 transition count 674
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 32 place count 464 transition count 670
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 460 transition count 670
Applied a total of 40 rules in 39 ms. Remains 460 /480 variables (removed 20) and now considering 670/690 (removed 20) transitions.
[2022-05-17 09:42:23] [INFO ] Flow matrix only has 610 transitions (discarded 60 similar events)
// Phase 1: matrix 610 rows 460 cols
[2022-05-17 09:42:23] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-17 09:42:23] [INFO ] Implicit Places using invariants in 121 ms returned []
[2022-05-17 09:42:23] [INFO ] Flow matrix only has 610 transitions (discarded 60 similar events)
// Phase 1: matrix 610 rows 460 cols
[2022-05-17 09:42:23] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-17 09:42:23] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 09:42:23] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
[2022-05-17 09:42:23] [INFO ] Redundant transitions in 9 ms returned []
[2022-05-17 09:42:23] [INFO ] Flow matrix only has 610 transitions (discarded 60 similar events)
// Phase 1: matrix 610 rows 460 cols
[2022-05-17 09:42:23] [INFO ] Computed 19 place invariants in 4 ms
[2022-05-17 09:42:24] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 460/480 places, 670/690 transitions.
Finished structural reductions, in 1 iterations. Remains : 460/480 places, 670/690 transitions.
[2022-05-17 09:42:24] [INFO ] Flatten gal took : 33 ms
[2022-05-17 09:42:24] [INFO ] Flatten gal took : 38 ms
[2022-05-17 09:42:24] [INFO ] Input system was already deterministic with 670 transitions.
[2022-05-17 09:42:24] [INFO ] Flatten gal took : 19 ms
[2022-05-17 09:42:24] [INFO ] Flatten gal took : 20 ms
[2022-05-17 09:42:24] [INFO ] Time to serialize gal into /tmp/CTLFireability17778803592943982067.gal : 3 ms
[2022-05-17 09:42:24] [INFO ] Time to serialize properties into /tmp/CTLFireability8783390614484512817.ctl : 164 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17778803592943982067.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8783390614484512817.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 09:42:54] [INFO ] Flatten gal took : 18 ms
[2022-05-17 09:42:54] [INFO ] Applying decomposition
[2022-05-17 09:42:54] [INFO ] Flatten gal took : 17 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/graph17037663704800989096.txt' '-o' '/tmp/graph17037663704800989096.bin' '-w' '/tmp/graph17037663704800989096.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17037663704800989096.bin' '-l' '-1' '-v' '-w' '/tmp/graph17037663704800989096.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:42:54] [INFO ] Decomposing Gal with order
[2022-05-17 09:42:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:42:54] [INFO ] Removed a total of 501 redundant transitions.
[2022-05-17 09:42:54] [INFO ] Flatten gal took : 55 ms
[2022-05-17 09:42:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 6 ms.
[2022-05-17 09:42:54] [INFO ] Time to serialize gal into /tmp/CTLFireability7202876579534800334.gal : 4 ms
[2022-05-17 09:42:54] [INFO ] Time to serialize properties into /tmp/CTLFireability13238732552647584848.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7202876579534800334.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13238732552647584848.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 20 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2022-05-17 09:43:24] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 09:43:24] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-17 09:43:24] [INFO ] Implicit Places using invariants in 108 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 120 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 13 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 475/480 places, 690/690 transitions.
[2022-05-17 09:43:24] [INFO ] Flatten gal took : 15 ms
[2022-05-17 09:43:24] [INFO ] Flatten gal took : 17 ms
[2022-05-17 09:43:24] [INFO ] Input system was already deterministic with 690 transitions.
[2022-05-17 09:43:24] [INFO ] Flatten gal took : 16 ms
[2022-05-17 09:43:24] [INFO ] Flatten gal took : 17 ms
[2022-05-17 09:43:25] [INFO ] Time to serialize gal into /tmp/CTLFireability6439223184928929500.gal : 2 ms
[2022-05-17 09:43:25] [INFO ] Time to serialize properties into /tmp/CTLFireability16044983259352766134.ctl : 2 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6439223184928929500.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16044983259352766134.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 09:43:55] [INFO ] Flatten gal took : 17 ms
[2022-05-17 09:43:55] [INFO ] Applying decomposition
[2022-05-17 09:43:55] [INFO ] Flatten gal took : 17 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/graph9422047323043621598.txt' '-o' '/tmp/graph9422047323043621598.bin' '-w' '/tmp/graph9422047323043621598.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9422047323043621598.bin' '-l' '-1' '-v' '-w' '/tmp/graph9422047323043621598.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:43:55] [INFO ] Decomposing Gal with order
[2022-05-17 09:43:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:43:55] [INFO ] Removed a total of 491 redundant transitions.
[2022-05-17 09:43:55] [INFO ] Flatten gal took : 40 ms
[2022-05-17 09:43:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 6 ms.
[2022-05-17 09:43:55] [INFO ] Time to serialize gal into /tmp/CTLFireability5298527091996524408.gal : 5 ms
[2022-05-17 09:43:55] [INFO ] Time to serialize properties into /tmp/CTLFireability12397172251201605926.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5298527091996524408.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12397172251201605926.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2022-05-17 09:44:25] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 09:44:25] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-17 09:44:25] [INFO ] Implicit Places using invariants in 162 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 176 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 3 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 475/480 places, 690/690 transitions.
[2022-05-17 09:44:25] [INFO ] Flatten gal took : 17 ms
[2022-05-17 09:44:25] [INFO ] Flatten gal took : 23 ms
[2022-05-17 09:44:25] [INFO ] Input system was already deterministic with 690 transitions.
[2022-05-17 09:44:25] [INFO ] Flatten gal took : 35 ms
[2022-05-17 09:44:25] [INFO ] Flatten gal took : 21 ms
[2022-05-17 09:44:25] [INFO ] Time to serialize gal into /tmp/CTLFireability390117232287671448.gal : 2 ms
[2022-05-17 09:44:25] [INFO ] Time to serialize properties into /tmp/CTLFireability17950913488691058243.ctl : 2 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability390117232287671448.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17950913488691058243.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 09:44:55] [INFO ] Flatten gal took : 21 ms
[2022-05-17 09:44:55] [INFO ] Applying decomposition
[2022-05-17 09:44:55] [INFO ] Flatten gal took : 19 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/graph18035484180345705964.txt' '-o' '/tmp/graph18035484180345705964.bin' '-w' '/tmp/graph18035484180345705964.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18035484180345705964.bin' '-l' '-1' '-v' '-w' '/tmp/graph18035484180345705964.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:44:55] [INFO ] Decomposing Gal with order
[2022-05-17 09:44:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:44:55] [INFO ] Removed a total of 491 redundant transitions.
[2022-05-17 09:44:55] [INFO ] Flatten gal took : 50 ms
[2022-05-17 09:44:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 4 ms.
[2022-05-17 09:44:56] [INFO ] Time to serialize gal into /tmp/CTLFireability14371169242928635353.gal : 3 ms
[2022-05-17 09:44:56] [INFO ] Time to serialize properties into /tmp/CTLFireability872957029770600133.ctl : 19 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14371169242928635353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability872957029770600133.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 8 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2022-05-17 09:45:26] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 09:45:26] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-17 09:45:26] [INFO ] Implicit Places using invariants in 127 ms returned []
[2022-05-17 09:45:26] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 09:45:26] [INFO ] Computed 19 place invariants in 7 ms
[2022-05-17 09:45:26] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 09:45:26] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
[2022-05-17 09:45:26] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 09:45:26] [INFO ] Computed 19 place invariants in 5 ms
[2022-05-17 09:45:27] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 480/480 places, 690/690 transitions.
[2022-05-17 09:45:27] [INFO ] Flatten gal took : 18 ms
[2022-05-17 09:45:27] [INFO ] Flatten gal took : 17 ms
[2022-05-17 09:45:27] [INFO ] Input system was already deterministic with 690 transitions.
[2022-05-17 09:45:27] [INFO ] Flatten gal took : 16 ms
[2022-05-17 09:45:27] [INFO ] Flatten gal took : 17 ms
[2022-05-17 09:45:27] [INFO ] Time to serialize gal into /tmp/CTLFireability7654506863466703995.gal : 2 ms
[2022-05-17 09:45:27] [INFO ] Time to serialize properties into /tmp/CTLFireability15709049456979826942.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7654506863466703995.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15709049456979826942.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 09:45:57] [INFO ] Flatten gal took : 19 ms
[2022-05-17 09:45:57] [INFO ] Applying decomposition
[2022-05-17 09:45:57] [INFO ] Flatten gal took : 17 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/graph16352450499994391700.txt' '-o' '/tmp/graph16352450499994391700.bin' '-w' '/tmp/graph16352450499994391700.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16352450499994391700.bin' '-l' '-1' '-v' '-w' '/tmp/graph16352450499994391700.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:45:57] [INFO ] Decomposing Gal with order
[2022-05-17 09:45:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:45:57] [INFO ] Removed a total of 487 redundant transitions.
[2022-05-17 09:45:57] [INFO ] Flatten gal took : 34 ms
[2022-05-17 09:45:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 5 ms.
[2022-05-17 09:45:57] [INFO ] Time to serialize gal into /tmp/CTLFireability17252749393738284333.gal : 7 ms
[2022-05-17 09:45:57] [INFO ] Time to serialize properties into /tmp/CTLFireability11506261361539263115.ctl : 2 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17252749393738284333.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11506261361539263115.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2022-05-17 09:46:27] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 09:46:27] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-17 09:46:27] [INFO ] Implicit Places using invariants in 108 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 109 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 2 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 475/480 places, 690/690 transitions.
[2022-05-17 09:46:27] [INFO ] Flatten gal took : 15 ms
[2022-05-17 09:46:27] [INFO ] Flatten gal took : 16 ms
[2022-05-17 09:46:27] [INFO ] Input system was already deterministic with 690 transitions.
[2022-05-17 09:46:27] [INFO ] Flatten gal took : 17 ms
[2022-05-17 09:46:27] [INFO ] Flatten gal took : 17 ms
[2022-05-17 09:46:27] [INFO ] Time to serialize gal into /tmp/CTLFireability8290933022600998663.gal : 2 ms
[2022-05-17 09:46:27] [INFO ] Time to serialize properties into /tmp/CTLFireability5070371184019376207.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8290933022600998663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5070371184019376207.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 09:46:57] [INFO ] Flatten gal took : 24 ms
[2022-05-17 09:46:57] [INFO ] Applying decomposition
[2022-05-17 09:46:57] [INFO ] Flatten gal took : 16 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/graph3352183729629160940.txt' '-o' '/tmp/graph3352183729629160940.bin' '-w' '/tmp/graph3352183729629160940.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3352183729629160940.bin' '-l' '-1' '-v' '-w' '/tmp/graph3352183729629160940.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:46:58] [INFO ] Decomposing Gal with order
[2022-05-17 09:46:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:46:58] [INFO ] Removed a total of 504 redundant transitions.
[2022-05-17 09:46:58] [INFO ] Flatten gal took : 31 ms
[2022-05-17 09:46:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 5 ms.
[2022-05-17 09:46:58] [INFO ] Time to serialize gal into /tmp/CTLFireability8916771219111303910.gal : 16 ms
[2022-05-17 09:46:58] [INFO ] Time to serialize properties into /tmp/CTLFireability5434659081626732719.ctl : 3 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8916771219111303910.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5434659081626732719.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2022-05-17 09:47:28] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 09:47:28] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-17 09:47:28] [INFO ] Implicit Places using invariants in 115 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 131 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 2 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 475/480 places, 690/690 transitions.
[2022-05-17 09:47:28] [INFO ] Flatten gal took : 17 ms
[2022-05-17 09:47:28] [INFO ] Flatten gal took : 22 ms
[2022-05-17 09:47:28] [INFO ] Input system was already deterministic with 690 transitions.
[2022-05-17 09:47:28] [INFO ] Flatten gal took : 21 ms
[2022-05-17 09:47:28] [INFO ] Flatten gal took : 21 ms
[2022-05-17 09:47:29] [INFO ] Time to serialize gal into /tmp/CTLFireability5434934940010943362.gal : 1091 ms
[2022-05-17 09:47:29] [INFO ] Time to serialize properties into /tmp/CTLFireability16971134772986892157.ctl : 7 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5434934940010943362.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16971134772986892157.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 09:47:59] [INFO ] Flatten gal took : 20 ms
[2022-05-17 09:47:59] [INFO ] Applying decomposition
[2022-05-17 09:47:59] [INFO ] Flatten gal took : 21 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/graph5043516354618274463.txt' '-o' '/tmp/graph5043516354618274463.bin' '-w' '/tmp/graph5043516354618274463.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5043516354618274463.bin' '-l' '-1' '-v' '-w' '/tmp/graph5043516354618274463.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:47:59] [INFO ] Decomposing Gal with order
[2022-05-17 09:47:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:47:59] [INFO ] Removed a total of 504 redundant transitions.
[2022-05-17 09:47:59] [INFO ] Flatten gal took : 37 ms
[2022-05-17 09:48:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 4 ms.
[2022-05-17 09:48:00] [INFO ] Time to serialize gal into /tmp/CTLFireability12084560396626645710.gal : 3 ms
[2022-05-17 09:48:00] [INFO ] Time to serialize properties into /tmp/CTLFireability16084307483580257019.ctl : 3 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12084560396626645710.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16084307483580257019.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 480 transition count 634
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 424 transition count 634
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 112 place count 424 transition count 565
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 250 place count 355 transition count 565
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 290 place count 335 transition count 545
Applied a total of 290 rules in 28 ms. Remains 335 /480 variables (removed 145) and now considering 545/690 (removed 145) transitions.
[2022-05-17 09:48:30] [INFO ] Flow matrix only has 485 transitions (discarded 60 similar events)
// Phase 1: matrix 485 rows 335 cols
[2022-05-17 09:48:30] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-17 09:48:30] [INFO ] Implicit Places using invariants in 63 ms returned [325, 326, 327, 328, 329]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 63 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 330/480 places, 545/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 330 /330 variables (removed 0) and now considering 545/545 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 330/480 places, 545/690 transitions.
[2022-05-17 09:48:30] [INFO ] Flatten gal took : 12 ms
[2022-05-17 09:48:30] [INFO ] Flatten gal took : 14 ms
[2022-05-17 09:48:30] [INFO ] Input system was already deterministic with 545 transitions.
[2022-05-17 09:48:30] [INFO ] Flatten gal took : 29 ms
[2022-05-17 09:48:30] [INFO ] Flatten gal took : 16 ms
[2022-05-17 09:48:30] [INFO ] Time to serialize gal into /tmp/CTLFireability17464805218572773213.gal : 1 ms
[2022-05-17 09:48:30] [INFO ] Time to serialize properties into /tmp/CTLFireability16495688710880037328.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17464805218572773213.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16495688710880037328.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 09:49:00] [INFO ] Flatten gal took : 15 ms
[2022-05-17 09:49:00] [INFO ] Applying decomposition
[2022-05-17 09:49:00] [INFO ] Flatten gal took : 14 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/graph1429221927803609490.txt' '-o' '/tmp/graph1429221927803609490.bin' '-w' '/tmp/graph1429221927803609490.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1429221927803609490.bin' '-l' '-1' '-v' '-w' '/tmp/graph1429221927803609490.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:49:00] [INFO ] Decomposing Gal with order
[2022-05-17 09:49:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:49:00] [INFO ] Removed a total of 517 redundant transitions.
[2022-05-17 09:49:00] [INFO ] Flatten gal took : 27 ms
[2022-05-17 09:49:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 3 ms.
[2022-05-17 09:49:00] [INFO ] Time to serialize gal into /tmp/CTLFireability17316004576910783627.gal : 3 ms
[2022-05-17 09:49:00] [INFO ] Time to serialize properties into /tmp/CTLFireability16588120051106884122.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17316004576910783627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16588120051106884122.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 480 transition count 491
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 281 transition count 491
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 398 place count 281 transition count 391
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 598 place count 181 transition count 391
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 638 place count 161 transition count 371
Applied a total of 638 rules in 24 ms. Remains 161 /480 variables (removed 319) and now considering 371/690 (removed 319) transitions.
[2022-05-17 09:49:30] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
// Phase 1: matrix 311 rows 161 cols
[2022-05-17 09:49:30] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-17 09:49:30] [INFO ] Implicit Places using invariants in 98 ms returned [151, 152, 153, 154, 155]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 110 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 156/480 places, 371/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 156 /156 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 156/480 places, 371/690 transitions.
[2022-05-17 09:49:30] [INFO ] Flatten gal took : 8 ms
[2022-05-17 09:49:30] [INFO ] Flatten gal took : 12 ms
[2022-05-17 09:49:30] [INFO ] Input system was already deterministic with 371 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1591398 steps, run timeout after 3001 ms. (steps per millisecond=530 ) properties seen :{}
Probabilistic random walk after 1591398 steps, saw 265283 distinct states, run finished after 3001 ms. (steps per millisecond=530 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 09:49:33] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
// Phase 1: matrix 311 rows 156 cols
[2022-05-17 09:49:33] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-17 09:49:33] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:49:33] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 09:49:33] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 09:49:33] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 09:49:34] [INFO ] After 23ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 09:49:34] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 0 ms to minimize.
[2022-05-17 09:49:34] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 0 ms to minimize.
[2022-05-17 09:49:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 144 ms
[2022-05-17 09:49:34] [INFO ] After 176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-17 09:49:34] [INFO ] After 296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 156/156 places, 371/371 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 156/156 places, 371/371 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1424 ms. (steps per millisecond=702 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 475 ms. (steps per millisecond=2105 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1637112 steps, run timeout after 3001 ms. (steps per millisecond=545 ) properties seen :{}
Probabilistic random walk after 1637112 steps, saw 273005 distinct states, run finished after 3001 ms. (steps per millisecond=545 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 09:49:39] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
// Phase 1: matrix 311 rows 156 cols
[2022-05-17 09:49:39] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 09:49:39] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:49:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 09:49:39] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 09:49:39] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 09:49:39] [INFO ] After 22ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 09:49:39] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2022-05-17 09:49:39] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2022-05-17 09:49:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 126 ms
[2022-05-17 09:49:39] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-17 09:49:39] [INFO ] After 271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 156/156 places, 371/371 transitions.
Applied a total of 0 rules in 7 ms. Remains 156 /156 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 156/156 places, 371/371 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 156/156 places, 371/371 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 371/371 (removed 0) transitions.
[2022-05-17 09:49:39] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
// Phase 1: matrix 311 rows 156 cols
[2022-05-17 09:49:39] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 09:49:39] [INFO ] Implicit Places using invariants in 98 ms returned []
[2022-05-17 09:49:39] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
// Phase 1: matrix 311 rows 156 cols
[2022-05-17 09:49:39] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 09:49:39] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 09:49:39] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2022-05-17 09:49:39] [INFO ] Redundant transitions in 20 ms returned []
[2022-05-17 09:49:39] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
// Phase 1: matrix 311 rows 156 cols
[2022-05-17 09:49:39] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 09:49:39] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 156/156 places, 371/371 transitions.
Graph (trivial) has 268 edges and 156 vertex of which 93 / 156 are part of one of the 19 SCC in 0 ms
Free SCC test removed 74 places
Drop transitions removed 148 transitions
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 226 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 1 place count 82 transition count 127
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 37 place count 64 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 39 place count 63 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 40 place count 63 transition count 125
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 54 place count 54 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 28 edges and 54 vertex of which 15 / 54 are part of one of the 3 SCC in 0 ms
Free SCC test removed 12 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 56 place count 42 transition count 124
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 55 edges and 39 vertex of which 11 / 39 are part of one of the 4 SCC in 0 ms
Free SCC test removed 7 places
Iterating post reduction 2 with 19 rules applied. Total rules applied 75 place count 32 transition count 109
Drop transitions removed 20 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 3 with 52 rules applied. Total rules applied 127 place count 32 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 31 transition count 56
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 135 place count 31 transition count 50
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 137 place count 31 transition count 48
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 140 place count 29 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 141 place count 28 transition count 47
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 143 place count 28 transition count 47
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 144 place count 28 transition count 46
Applied a total of 144 rules in 20 ms. Remains 28 /156 variables (removed 128) and now considering 46/371 (removed 325) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 46 rows 28 cols
[2022-05-17 09:49:39] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 09:49:40] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:49:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-17 09:49:40] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 09:49:40] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-17 09:49:40] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 09:49:40] [INFO ] Flatten gal took : 1 ms
[2022-05-17 09:49:40] [INFO ] Flatten gal took : 1 ms
[2022-05-17 09:49:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8404517032886036102.gal : 1 ms
[2022-05-17 09:49:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14193488638073222380.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8404517032886036102.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14193488638073222380.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/ReachabilityCardinality14193488638073222380.prop.
Invariant property Peterson-PT-4-CTLFireability-08 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,4,0.006104,3812,2,35,6,128,6,0,161,45,0
Total reachable state count : 4
Verifying 1 reachability properties.
Invariant property Peterson-PT-4-CTLFireability-08 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-4-CTLFireability-08,1,0.006613,4252,2,29,6,128,7,0,171,45,0
[2022-05-17 09:49:40] [INFO ] Flatten gal took : 8 ms
[2022-05-17 09:49:40] [INFO ] Flatten gal took : 8 ms
[2022-05-17 09:49:40] [INFO ] Time to serialize gal into /tmp/CTLFireability17207960521386905142.gal : 1 ms
[2022-05-17 09:49:40] [INFO ] Time to serialize properties into /tmp/CTLFireability7986145711488247629.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17207960521386905142.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7986145711488247629.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 09:50:10] [INFO ] Flatten gal took : 9 ms
[2022-05-17 09:50:10] [INFO ] Applying decomposition
[2022-05-17 09:50:10] [INFO ] Flatten gal took : 9 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/graph8689596403040945676.txt' '-o' '/tmp/graph8689596403040945676.bin' '-w' '/tmp/graph8689596403040945676.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8689596403040945676.bin' '-l' '-1' '-v' '-w' '/tmp/graph8689596403040945676.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:50:10] [INFO ] Decomposing Gal with order
[2022-05-17 09:50:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:50:10] [INFO ] Removed a total of 412 redundant transitions.
[2022-05-17 09:50:10] [INFO ] Flatten gal took : 23 ms
[2022-05-17 09:50:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 281 labels/synchronizations in 6 ms.
[2022-05-17 09:50:10] [INFO ] Time to serialize gal into /tmp/CTLFireability3737793808348018142.gal : 2 ms
[2022-05-17 09:50:10] [INFO ] Time to serialize properties into /tmp/CTLFireability5178593822360254420.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3737793808348018142.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5178593822360254420.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 8 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2022-05-17 09:50:40] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 09:50:40] [INFO ] Computed 19 place invariants in 7 ms
[2022-05-17 09:50:40] [INFO ] Implicit Places using invariants in 168 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 183 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 475/480 places, 690/690 transitions.
[2022-05-17 09:50:40] [INFO ] Flatten gal took : 13 ms
[2022-05-17 09:50:40] [INFO ] Flatten gal took : 15 ms
[2022-05-17 09:50:40] [INFO ] Input system was already deterministic with 690 transitions.
[2022-05-17 09:50:40] [INFO ] Flatten gal took : 14 ms
[2022-05-17 09:50:40] [INFO ] Flatten gal took : 14 ms
[2022-05-17 09:50:40] [INFO ] Time to serialize gal into /tmp/CTLFireability12710389509786521550.gal : 2 ms
[2022-05-17 09:50:40] [INFO ] Time to serialize properties into /tmp/CTLFireability3955837622557401340.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12710389509786521550.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3955837622557401340.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 09:51:10] [INFO ] Flatten gal took : 21 ms
[2022-05-17 09:51:10] [INFO ] Applying decomposition
[2022-05-17 09:51:10] [INFO ] Flatten gal took : 14 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/graph275670506771335842.txt' '-o' '/tmp/graph275670506771335842.bin' '-w' '/tmp/graph275670506771335842.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph275670506771335842.bin' '-l' '-1' '-v' '-w' '/tmp/graph275670506771335842.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:51:10] [INFO ] Decomposing Gal with order
[2022-05-17 09:51:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:51:10] [INFO ] Removed a total of 504 redundant transitions.
[2022-05-17 09:51:10] [INFO ] Flatten gal took : 25 ms
[2022-05-17 09:51:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 3 ms.
[2022-05-17 09:51:10] [INFO ] Time to serialize gal into /tmp/CTLFireability13472977613155477077.gal : 3 ms
[2022-05-17 09:51:10] [INFO ] Time to serialize properties into /tmp/CTLFireability3047917980112916293.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13472977613155477077.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3047917980112916293.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 480 transition count 491
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 281 transition count 491
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 398 place count 281 transition count 391
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 598 place count 181 transition count 391
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 638 place count 161 transition count 371
Applied a total of 638 rules in 14 ms. Remains 161 /480 variables (removed 319) and now considering 371/690 (removed 319) transitions.
[2022-05-17 09:51:40] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
// Phase 1: matrix 311 rows 161 cols
[2022-05-17 09:51:40] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-17 09:51:40] [INFO ] Implicit Places using invariants in 101 ms returned [151, 152, 153, 154, 155]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 101 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 156/480 places, 371/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 156/480 places, 371/690 transitions.
[2022-05-17 09:51:40] [INFO ] Flatten gal took : 8 ms
[2022-05-17 09:51:40] [INFO ] Flatten gal took : 9 ms
[2022-05-17 09:51:40] [INFO ] Input system was already deterministic with 371 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1651590 steps, run timeout after 3001 ms. (steps per millisecond=550 ) properties seen :{}
Probabilistic random walk after 1651590 steps, saw 275378 distinct states, run finished after 3001 ms. (steps per millisecond=550 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 09:51:43] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
// Phase 1: matrix 311 rows 156 cols
[2022-05-17 09:51:43] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 09:51:44] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 09:51:44] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:51:44] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 09:51:44] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 09:51:44] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 09:51:44] [INFO ] After 15ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 09:51:44] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-17 09:51:44] [INFO ] After 166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 156/156 places, 371/371 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 156/156 places, 371/371 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=448 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2022-05-17 09:51:44] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
// Phase 1: matrix 311 rows 156 cols
[2022-05-17 09:51:44] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 09:51:44] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 09:51:44] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:51:44] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 09:51:44] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 09:51:44] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 09:51:44] [INFO ] After 14ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 09:51:44] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-17 09:51:44] [INFO ] After 136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1396 ms. (steps per millisecond=716 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 443 ms. (steps per millisecond=2257 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1663974 steps, run timeout after 3001 ms. (steps per millisecond=554 ) properties seen :{}
Probabilistic random walk after 1663974 steps, saw 277414 distinct states, run finished after 3001 ms. (steps per millisecond=554 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 09:51:49] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
// Phase 1: matrix 311 rows 156 cols
[2022-05-17 09:51:49] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-17 09:51:49] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 09:51:49] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:51:49] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 09:51:49] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 09:51:49] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 09:51:49] [INFO ] After 16ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 09:51:49] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-17 09:51:49] [INFO ] After 136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 156/156 places, 371/371 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 156/156 places, 371/371 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 156/156 places, 371/371 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 371/371 (removed 0) transitions.
[2022-05-17 09:51:49] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
// Phase 1: matrix 311 rows 156 cols
[2022-05-17 09:51:49] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 09:51:49] [INFO ] Implicit Places using invariants in 93 ms returned []
[2022-05-17 09:51:49] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
// Phase 1: matrix 311 rows 156 cols
[2022-05-17 09:51:49] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 09:51:50] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 09:51:50] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2022-05-17 09:51:50] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-17 09:51:50] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
// Phase 1: matrix 311 rows 156 cols
[2022-05-17 09:51:50] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 09:51:50] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 156/156 places, 371/371 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=709 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2022-05-17 09:51:50] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
// Phase 1: matrix 311 rows 156 cols
[2022-05-17 09:51:50] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 09:51:50] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 09:51:50] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:51:50] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 09:51:50] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 09:51:50] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 09:51:50] [INFO ] After 17ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 09:51:50] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-17 09:51:50] [INFO ] After 133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1667958 steps, run timeout after 3001 ms. (steps per millisecond=555 ) properties seen :{}
Probabilistic random walk after 1667958 steps, saw 278137 distinct states, run finished after 3001 ms. (steps per millisecond=555 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 09:51:53] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
// Phase 1: matrix 311 rows 156 cols
[2022-05-17 09:51:53] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 09:51:53] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:51:53] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 09:51:53] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 09:51:53] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 09:51:53] [INFO ] After 15ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 09:51:53] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-17 09:51:53] [INFO ] After 141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 156/156 places, 371/371 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 156/156 places, 371/371 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1668906 steps, run timeout after 3001 ms. (steps per millisecond=556 ) properties seen :{}
Probabilistic random walk after 1668906 steps, saw 278283 distinct states, run finished after 3001 ms. (steps per millisecond=556 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 09:51:56] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
// Phase 1: matrix 311 rows 156 cols
[2022-05-17 09:51:56] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-17 09:51:57] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:51:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 09:51:57] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 09:51:57] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 09:51:57] [INFO ] After 14ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 09:51:57] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-17 09:51:57] [INFO ] After 136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 156/156 places, 371/371 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 156/156 places, 371/371 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 156/156 places, 371/371 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 371/371 (removed 0) transitions.
[2022-05-17 09:51:57] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
// Phase 1: matrix 311 rows 156 cols
[2022-05-17 09:51:57] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 09:51:57] [INFO ] Implicit Places using invariants in 107 ms returned []
[2022-05-17 09:51:57] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
// Phase 1: matrix 311 rows 156 cols
[2022-05-17 09:51:57] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 09:51:57] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 09:51:57] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2022-05-17 09:51:57] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-17 09:51:57] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
// Phase 1: matrix 311 rows 156 cols
[2022-05-17 09:51:57] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 09:51:57] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 156/156 places, 371/371 transitions.
Graph (trivial) has 278 edges and 156 vertex of which 98 / 156 are part of one of the 20 SCC in 0 ms
Free SCC test removed 78 places
Drop transitions removed 156 transitions
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 235 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 1 place count 78 transition count 117
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 39 place count 59 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 41 place count 58 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 42 place count 58 transition count 115
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 17 rules applied. Total rules applied 59 place count 47 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 26 edges and 47 vertex of which 25 / 47 are part of one of the 5 SCC in 0 ms
Free SCC test removed 20 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 27 transition count 113
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Graph (complete) has 92 edges and 23 vertex of which 8 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Graph (trivial) has 29 edges and 8 vertex of which 4 / 8 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 31 rules applied. Total rules applied 92 place count 5 transition count 40
Drop transitions removed 24 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 125 place count 5 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 128 place count 3 transition count 6
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 130 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 132 place count 2 transition count 3
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 133 place count 2 transition count 2
Applied a total of 133 rules in 10 ms. Remains 2 /156 variables (removed 154) and now considering 2/371 (removed 369) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 09:51:57] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 09:51:57] [INFO ] After 12ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:51:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 09:51:57] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 09:51:57] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 09:51:57] [INFO ] After 21ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 09:51:57] [INFO ] Flatten gal took : 0 ms
[2022-05-17 09:51:57] [INFO ] Flatten gal took : 1 ms
[2022-05-17 09:51:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4084146435530850431.gal : 1 ms
[2022-05-17 09:51:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11447495055306647577.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10357011011121079411;'/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/ReachabilityCardinality4084146435530850431.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11447495055306647577.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/ReachabilityCardinality11447495055306647577.prop.
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,0.001717,3452,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.002494,3892,2,3,6,12,7,0,16,6,0
Graph (trivial) has 278 edges and 156 vertex of which 98 / 156 are part of one of the 20 SCC in 0 ms
Free SCC test removed 78 places
Drop transitions removed 156 transitions
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 235 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 1 place count 78 transition count 117
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 39 place count 59 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 41 place count 58 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 42 place count 58 transition count 115
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 56 place count 49 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 25 edges and 49 vertex of which 20 / 49 are part of one of the 4 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 58 place count 33 transition count 114
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (trivial) has 53 edges and 30 vertex of which 12 / 30 are part of one of the 4 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 2 with 24 rules applied. Total rules applied 82 place count 22 transition count 94
Drop transitions removed 24 transitions
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 3 with 58 rules applied. Total rules applied 140 place count 22 transition count 36
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 143 place count 22 transition count 33
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 144 place count 22 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 145 place count 21 transition count 32
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 146 place count 21 transition count 32
Applied a total of 146 rules in 9 ms. Remains 21 /156 variables (removed 135) and now considering 32/371 (removed 339) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 32 rows 21 cols
[2022-05-17 09:51:57] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 09:51:57] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 09:51:57] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 09:51:57] [INFO ] After 11ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 09:51:57] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2022-05-17 09:51:57] [INFO ] Flatten gal took : 1 ms
[2022-05-17 09:51:57] [INFO ] Flatten gal took : 1 ms
[2022-05-17 09:51:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12812720567325307769.gal : 0 ms
[2022-05-17 09:51:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10354951761051038555.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12812720567325307769.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10354951761051038555.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality10354951761051038555.prop.
Reachability property Peterson-PT-4-CTLFireability-10 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,8,0.004371,3704,2,26,6,138,6,0,119,90,0
Total reachable state count : 8
Verifying 1 reachability properties.
Reachability property Peterson-PT-4-CTLFireability-10 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
Peterson-PT-4-CTLFireability-10,4,0.004681,4144,2,25,6,138,7,0,125,90,0
[2022-05-17 09:51:57] [INFO ] Flatten gal took : 9 ms
[2022-05-17 09:51:57] [INFO ] Flatten gal took : 9 ms
[2022-05-17 09:51:57] [INFO ] Time to serialize gal into /tmp/CTLFireability2672384620572254559.gal : 1 ms
[2022-05-17 09:51:57] [INFO ] Time to serialize properties into /tmp/CTLFireability13484946842264711897.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2672384620572254559.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13484946842264711897.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 09:52:27] [INFO ] Flatten gal took : 9 ms
[2022-05-17 09:52:27] [INFO ] Applying decomposition
[2022-05-17 09:52:27] [INFO ] Flatten gal took : 9 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/graph14879824282905365431.txt' '-o' '/tmp/graph14879824282905365431.bin' '-w' '/tmp/graph14879824282905365431.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14879824282905365431.bin' '-l' '-1' '-v' '-w' '/tmp/graph14879824282905365431.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:52:27] [INFO ] Decomposing Gal with order
[2022-05-17 09:52:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:52:27] [INFO ] Removed a total of 412 redundant transitions.
[2022-05-17 09:52:27] [INFO ] Flatten gal took : 17 ms
[2022-05-17 09:52:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 294 labels/synchronizations in 5 ms.
[2022-05-17 09:52:27] [INFO ] Time to serialize gal into /tmp/CTLFireability8428360699237668305.gal : 2 ms
[2022-05-17 09:52:27] [INFO ] Time to serialize properties into /tmp/CTLFireability17197799245836566076.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8428360699237668305.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17197799245836566076.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2022-05-17 09:52:57] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 09:52:57] [INFO ] Computed 19 place invariants in 5 ms
[2022-05-17 09:52:58] [INFO ] Implicit Places using invariants in 163 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 163 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 475/480 places, 690/690 transitions.
[2022-05-17 09:52:58] [INFO ] Flatten gal took : 21 ms
[2022-05-17 09:52:58] [INFO ] Flatten gal took : 15 ms
[2022-05-17 09:52:58] [INFO ] Input system was already deterministic with 690 transitions.
[2022-05-17 09:52:58] [INFO ] Flatten gal took : 14 ms
[2022-05-17 09:52:58] [INFO ] Flatten gal took : 15 ms
[2022-05-17 09:52:58] [INFO ] Time to serialize gal into /tmp/CTLFireability430582116385973535.gal : 2 ms
[2022-05-17 09:52:58] [INFO ] Time to serialize properties into /tmp/CTLFireability12597202325984270192.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability430582116385973535.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12597202325984270192.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 09:53:28] [INFO ] Flatten gal took : 17 ms
[2022-05-17 09:53:28] [INFO ] Applying decomposition
[2022-05-17 09:53:28] [INFO ] Flatten gal took : 14 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/graph12109369453166451901.txt' '-o' '/tmp/graph12109369453166451901.bin' '-w' '/tmp/graph12109369453166451901.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12109369453166451901.bin' '-l' '-1' '-v' '-w' '/tmp/graph12109369453166451901.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:53:28] [INFO ] Decomposing Gal with order
[2022-05-17 09:53:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:53:28] [INFO ] Removed a total of 478 redundant transitions.
[2022-05-17 09:53:28] [INFO ] Flatten gal took : 28 ms
[2022-05-17 09:53:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 2 ms.
[2022-05-17 09:53:28] [INFO ] Time to serialize gal into /tmp/CTLFireability7435489349280779003.gal : 3 ms
[2022-05-17 09:53:28] [INFO ] Time to serialize properties into /tmp/CTLFireability3194977223882179984.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7435489349280779003.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3194977223882179984.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 480 transition count 492
Reduce places removed 198 places and 0 transitions.
Iterating post reduction 1 with 198 rules applied. Total rules applied 396 place count 282 transition count 492
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 396 place count 282 transition count 392
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 596 place count 182 transition count 392
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 636 place count 162 transition count 372
Applied a total of 636 rules in 18 ms. Remains 162 /480 variables (removed 318) and now considering 372/690 (removed 318) transitions.
[2022-05-17 09:53:58] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
// Phase 1: matrix 312 rows 162 cols
[2022-05-17 09:53:58] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-17 09:53:58] [INFO ] Implicit Places using invariants in 105 ms returned [152, 153, 154, 155, 156]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 106 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 157/480 places, 372/690 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 157/480 places, 372/690 transitions.
[2022-05-17 09:53:58] [INFO ] Flatten gal took : 8 ms
[2022-05-17 09:53:58] [INFO ] Flatten gal took : 9 ms
[2022-05-17 09:53:58] [INFO ] Input system was already deterministic with 372 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1652676 steps, run timeout after 3001 ms. (steps per millisecond=550 ) properties seen :{}
Probabilistic random walk after 1652676 steps, saw 275536 distinct states, run finished after 3001 ms. (steps per millisecond=550 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 09:54:01] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
// Phase 1: matrix 312 rows 157 cols
[2022-05-17 09:54:01] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 09:54:01] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 09:54:01] [INFO ] After 55ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 09:54:01] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 09:54:01] [INFO ] After 21ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:54:01] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:54:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2022-05-17 09:54:01] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 09:54:01] [INFO ] After 15ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 09:54:01] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-17 09:54:01] [INFO ] After 144ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 157/157 places, 372/372 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 157/157 places, 372/372 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=694 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 09:54:02] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
// Phase 1: matrix 312 rows 157 cols
[2022-05-17 09:54:02] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 09:54:02] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 09:54:02] [INFO ] After 56ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 09:54:02] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 09:54:02] [INFO ] After 16ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:54:02] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:54:02] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 09:54:02] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 09:54:02] [INFO ] After 14ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 09:54:02] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-17 09:54:02] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1406 ms. (steps per millisecond=711 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 435 ms. (steps per millisecond=2298 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1653768 steps, run timeout after 3001 ms. (steps per millisecond=551 ) properties seen :{}
Probabilistic random walk after 1653768 steps, saw 275721 distinct states, run finished after 3001 ms. (steps per millisecond=551 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 09:54:07] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
// Phase 1: matrix 312 rows 157 cols
[2022-05-17 09:54:07] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-17 09:54:07] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 09:54:07] [INFO ] After 57ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 09:54:07] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 09:54:07] [INFO ] After 16ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:54:07] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:54:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 09:54:07] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 09:54:07] [INFO ] After 15ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 09:54:07] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-17 09:54:07] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 157/157 places, 372/372 transitions.
Applied a total of 0 rules in 5 ms. Remains 157 /157 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 157/157 places, 372/372 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 157/157 places, 372/372 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 372/372 (removed 0) transitions.
[2022-05-17 09:54:07] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
// Phase 1: matrix 312 rows 157 cols
[2022-05-17 09:54:07] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-17 09:54:07] [INFO ] Implicit Places using invariants in 98 ms returned []
[2022-05-17 09:54:07] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
// Phase 1: matrix 312 rows 157 cols
[2022-05-17 09:54:07] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-17 09:54:07] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 09:54:07] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2022-05-17 09:54:07] [INFO ] Redundant transitions in 5 ms returned []
[2022-05-17 09:54:07] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
// Phase 1: matrix 312 rows 157 cols
[2022-05-17 09:54:07] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 09:54:07] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 157/157 places, 372/372 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=735 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 09:54:08] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
// Phase 1: matrix 312 rows 157 cols
[2022-05-17 09:54:08] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-17 09:54:08] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 09:54:08] [INFO ] After 56ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 09:54:08] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 09:54:08] [INFO ] After 17ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:54:08] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:54:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 09:54:08] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 09:54:08] [INFO ] After 16ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 09:54:08] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-17 09:54:08] [INFO ] After 152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1501002 steps, run timeout after 3001 ms. (steps per millisecond=500 ) properties seen :{}
Probabilistic random walk after 1501002 steps, saw 250217 distinct states, run finished after 3001 ms. (steps per millisecond=500 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 09:54:11] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
// Phase 1: matrix 312 rows 157 cols
[2022-05-17 09:54:11] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 09:54:11] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:54:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 09:54:11] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 09:54:11] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 09:54:11] [INFO ] After 17ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 09:54:11] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-17 09:54:11] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 157/157 places, 372/372 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 157/157 places, 372/372 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1759308 steps, run timeout after 3001 ms. (steps per millisecond=586 ) properties seen :{}
Probabilistic random walk after 1759308 steps, saw 293306 distinct states, run finished after 3001 ms. (steps per millisecond=586 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 09:54:14] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
// Phase 1: matrix 312 rows 157 cols
[2022-05-17 09:54:14] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 09:54:14] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:54:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 09:54:14] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 09:54:14] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 09:54:14] [INFO ] After 17ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 09:54:14] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-17 09:54:14] [INFO ] After 145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 157/157 places, 372/372 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 157/157 places, 372/372 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 157/157 places, 372/372 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 372/372 (removed 0) transitions.
[2022-05-17 09:54:14] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
// Phase 1: matrix 312 rows 157 cols
[2022-05-17 09:54:14] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 09:54:14] [INFO ] Implicit Places using invariants in 94 ms returned []
[2022-05-17 09:54:14] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
// Phase 1: matrix 312 rows 157 cols
[2022-05-17 09:54:14] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-17 09:54:15] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 09:54:15] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2022-05-17 09:54:15] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-17 09:54:15] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
// Phase 1: matrix 312 rows 157 cols
[2022-05-17 09:54:15] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-17 09:54:15] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 157/157 places, 372/372 transitions.
Graph (trivial) has 280 edges and 157 vertex of which 99 / 157 are part of one of the 20 SCC in 0 ms
Free SCC test removed 79 places
Drop transitions removed 158 transitions
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 237 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 1 place count 78 transition count 116
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 39 place count 59 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 41 place count 58 transition count 115
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 17 rules applied. Total rules applied 58 place count 47 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 26 edges and 47 vertex of which 25 / 47 are part of one of the 5 SCC in 0 ms
Free SCC test removed 20 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 27 transition count 113
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Graph (complete) has 92 edges and 23 vertex of which 8 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Graph (trivial) has 29 edges and 8 vertex of which 4 / 8 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 31 rules applied. Total rules applied 91 place count 5 transition count 40
Drop transitions removed 24 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 124 place count 5 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 127 place count 3 transition count 6
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 129 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 131 place count 2 transition count 3
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 132 place count 2 transition count 2
Applied a total of 132 rules in 3 ms. Remains 2 /157 variables (removed 155) and now considering 2/372 (removed 370) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 09:54:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 09:54:15] [INFO ] After 12ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:54:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 09:54:15] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 09:54:15] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 09:54:15] [INFO ] After 16ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 09:54:15] [INFO ] Flatten gal took : 0 ms
[2022-05-17 09:54:15] [INFO ] Flatten gal took : 0 ms
[2022-05-17 09:54:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14377003467719345662.gal : 0 ms
[2022-05-17 09:54:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15027707125471183917.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10902416947242020533;'/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/ReachabilityCardinality14377003467719345662.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15027707125471183917.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality15027707125471183917.prop.
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,0.001551,3452,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001797,3892,2,3,6,12,7,0,16,6,0
Graph (trivial) has 280 edges and 157 vertex of which 99 / 157 are part of one of the 20 SCC in 0 ms
Free SCC test removed 79 places
Drop transitions removed 158 transitions
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 237 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 1 place count 78 transition count 116
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 39 place count 59 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 41 place count 58 transition count 115
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 17 rules applied. Total rules applied 58 place count 47 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 26 edges and 47 vertex of which 25 / 47 are part of one of the 5 SCC in 0 ms
Free SCC test removed 20 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 27 transition count 113
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Graph (complete) has 92 edges and 23 vertex of which 8 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Graph (trivial) has 29 edges and 8 vertex of which 4 / 8 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 31 rules applied. Total rules applied 91 place count 5 transition count 40
Drop transitions removed 24 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 124 place count 5 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 127 place count 3 transition count 6
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 129 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 131 place count 2 transition count 3
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 132 place count 2 transition count 2
Applied a total of 132 rules in 4 ms. Remains 2 /157 variables (removed 155) and now considering 2/372 (removed 370) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 09:54:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 09:54:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 09:54:15] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-17 09:54:15] [INFO ] After 3ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 09:54:15] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2022-05-17 09:54:15] [INFO ] Flatten gal took : 0 ms
[2022-05-17 09:54:15] [INFO ] Flatten gal took : 0 ms
[2022-05-17 09:54:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8752826990762066757.gal : 1 ms
[2022-05-17 09:54:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8255422193548780299.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8752826990762066757.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8255422193548780299.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/ReachabilityCardinality8255422193548780299.prop.
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,0.001146,3448,2,4,5,12,7,0,14,6,0
Total reachable state count : 2
Verifying 1 reachability properties.
Reachability property Peterson-PT-4-CTLFireability-12 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
Peterson-PT-4-CTLFireability-12,1,0.001414,3888,2,3,6,12,7,0,16,6,0
[2022-05-17 09:54:15] [INFO ] Flatten gal took : 9 ms
[2022-05-17 09:54:15] [INFO ] Flatten gal took : 9 ms
[2022-05-17 09:54:15] [INFO ] Time to serialize gal into /tmp/CTLFireability5460340767519220841.gal : 1 ms
[2022-05-17 09:54:15] [INFO ] Time to serialize properties into /tmp/CTLFireability12456158884235286997.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5460340767519220841.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12456158884235286997.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 09:54:45] [INFO ] Flatten gal took : 8 ms
[2022-05-17 09:54:45] [INFO ] Applying decomposition
[2022-05-17 09:54:45] [INFO ] Flatten gal took : 9 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/graph17925105749901785464.txt' '-o' '/tmp/graph17925105749901785464.bin' '-w' '/tmp/graph17925105749901785464.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17925105749901785464.bin' '-l' '-1' '-v' '-w' '/tmp/graph17925105749901785464.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:54:45] [INFO ] Decomposing Gal with order
[2022-05-17 09:54:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:54:45] [INFO ] Removed a total of 400 redundant transitions.
[2022-05-17 09:54:45] [INFO ] Flatten gal took : 16 ms
[2022-05-17 09:54:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 268 labels/synchronizations in 7 ms.
[2022-05-17 09:54:45] [INFO ] Time to serialize gal into /tmp/CTLFireability16756131229863409507.gal : 2 ms
[2022-05-17 09:54:45] [INFO ] Time to serialize properties into /tmp/CTLFireability15785306903817382210.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16756131229863409507.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15785306903817382210.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 13 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2022-05-17 09:55:15] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 09:55:15] [INFO ] Computed 19 place invariants in 4 ms
[2022-05-17 09:55:15] [INFO ] Implicit Places using invariants in 154 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 155 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 475/480 places, 690/690 transitions.
[2022-05-17 09:55:15] [INFO ] Flatten gal took : 13 ms
[2022-05-17 09:55:15] [INFO ] Flatten gal took : 15 ms
[2022-05-17 09:55:15] [INFO ] Input system was already deterministic with 690 transitions.
[2022-05-17 09:55:15] [INFO ] Flatten gal took : 14 ms
[2022-05-17 09:55:15] [INFO ] Flatten gal took : 14 ms
[2022-05-17 09:55:15] [INFO ] Time to serialize gal into /tmp/CTLFireability10518372911005341468.gal : 1 ms
[2022-05-17 09:55:15] [INFO ] Time to serialize properties into /tmp/CTLFireability13345595360214579235.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10518372911005341468.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13345595360214579235.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 09:55:45] [INFO ] Flatten gal took : 15 ms
[2022-05-17 09:55:45] [INFO ] Applying decomposition
[2022-05-17 09:55:45] [INFO ] Flatten gal took : 14 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/graph9677807087367873586.txt' '-o' '/tmp/graph9677807087367873586.bin' '-w' '/tmp/graph9677807087367873586.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9677807087367873586.bin' '-l' '-1' '-v' '-w' '/tmp/graph9677807087367873586.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:55:45] [INFO ] Decomposing Gal with order
[2022-05-17 09:55:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:55:45] [INFO ] Removed a total of 517 redundant transitions.
[2022-05-17 09:55:45] [INFO ] Flatten gal took : 23 ms
[2022-05-17 09:55:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 3 ms.
[2022-05-17 09:55:46] [INFO ] Time to serialize gal into /tmp/CTLFireability10567252789134724649.gal : 3 ms
[2022-05-17 09:55:46] [INFO ] Time to serialize properties into /tmp/CTLFireability13875856181214791725.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10567252789134724649.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13875856181214791725.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 480 transition count 493
Reduce places removed 197 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 198 rules applied. Total rules applied 395 place count 283 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 396 place count 282 transition count 492
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 396 place count 282 transition count 394
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 592 place count 184 transition count 394
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 632 place count 164 transition count 374
Applied a total of 632 rules in 12 ms. Remains 164 /480 variables (removed 316) and now considering 374/690 (removed 316) transitions.
[2022-05-17 09:56:16] [INFO ] Flow matrix only has 314 transitions (discarded 60 similar events)
// Phase 1: matrix 314 rows 164 cols
[2022-05-17 09:56:16] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-17 09:56:16] [INFO ] Implicit Places using invariants in 99 ms returned [154, 155, 156, 157, 158]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 115 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 159/480 places, 374/690 transitions.
Applied a total of 0 rules in 3 ms. Remains 159 /159 variables (removed 0) and now considering 374/374 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 159/480 places, 374/690 transitions.
[2022-05-17 09:56:16] [INFO ] Flatten gal took : 8 ms
[2022-05-17 09:56:16] [INFO ] Flatten gal took : 9 ms
[2022-05-17 09:56:16] [INFO ] Input system was already deterministic with 374 transitions.
[2022-05-17 09:56:16] [INFO ] Flatten gal took : 9 ms
[2022-05-17 09:56:16] [INFO ] Flatten gal took : 9 ms
[2022-05-17 09:56:16] [INFO ] Time to serialize gal into /tmp/CTLFireability7606744440799024669.gal : 1 ms
[2022-05-17 09:56:16] [INFO ] Time to serialize properties into /tmp/CTLFireability5980656596125390019.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7606744440799024669.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5980656596125390019.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2022-05-17 09:56:46] [INFO ] Flatten gal took : 16 ms
[2022-05-17 09:56:46] [INFO ] Applying decomposition
[2022-05-17 09:56:46] [INFO ] Flatten gal took : 9 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/graph1016559167979875083.txt' '-o' '/tmp/graph1016559167979875083.bin' '-w' '/tmp/graph1016559167979875083.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1016559167979875083.bin' '-l' '-1' '-v' '-w' '/tmp/graph1016559167979875083.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:56:46] [INFO ] Decomposing Gal with order
[2022-05-17 09:56:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:56:46] [INFO ] Removed a total of 412 redundant transitions.
[2022-05-17 09:56:46] [INFO ] Flatten gal took : 17 ms
[2022-05-17 09:56:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 268 labels/synchronizations in 4 ms.
[2022-05-17 09:56:46] [INFO ] Time to serialize gal into /tmp/CTLFireability5715983786364996228.gal : 2 ms
[2022-05-17 09:56:46] [INFO ] Time to serialize properties into /tmp/CTLFireability6958913160877307472.ctl : 241 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5715983786364996228.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6958913160877307472.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 480 transition count 492
Reduce places removed 198 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 199 rules applied. Total rules applied 397 place count 282 transition count 491
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 398 place count 281 transition count 491
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 398 place count 281 transition count 392
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 596 place count 182 transition count 392
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 636 place count 162 transition count 372
Applied a total of 636 rules in 13 ms. Remains 162 /480 variables (removed 318) and now considering 372/690 (removed 318) transitions.
[2022-05-17 09:57:16] [INFO ] Flow matrix only has 312 transitions (discarded 60 similar events)
// Phase 1: matrix 312 rows 162 cols
[2022-05-17 09:57:16] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-17 09:57:16] [INFO ] Implicit Places using invariants in 104 ms returned [152, 153, 154, 155, 156]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 118 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 157/480 places, 372/690 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 157/480 places, 372/690 transitions.
[2022-05-17 09:57:16] [INFO ] Flatten gal took : 8 ms
[2022-05-17 09:57:16] [INFO ] Flatten gal took : 9 ms
[2022-05-17 09:57:16] [INFO ] Input system was already deterministic with 372 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 898524 steps, run visited all 1 properties in 1470 ms. (steps per millisecond=611 )
Probabilistic random walk after 898524 steps, saw 150155 distinct states, run finished after 1471 ms. (steps per millisecond=610 ) properties seen :1
FORMULA Peterson-PT-4-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2022-05-17 09:57:18] [INFO ] Flatten gal took : 39 ms
[2022-05-17 09:57:18] [INFO ] Flatten gal took : 38 ms
[2022-05-17 09:57:18] [INFO ] Applying decomposition
[2022-05-17 09:57:18] [INFO ] Flatten gal took : 39 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/graph15400603813439200363.txt' '-o' '/tmp/graph15400603813439200363.bin' '-w' '/tmp/graph15400603813439200363.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15400603813439200363.bin' '-l' '-1' '-v' '-w' '/tmp/graph15400603813439200363.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:57:18] [INFO ] Decomposing Gal with order
[2022-05-17 09:57:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:57:18] [INFO ] Removed a total of 488 redundant transitions.
[2022-05-17 09:57:18] [INFO ] Flatten gal took : 58 ms
[2022-05-17 09:57:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 2 ms.
[2022-05-17 09:57:19] [INFO ] Time to serialize gal into /tmp/CTLFireability11572370963292306358.gal : 3 ms
[2022-05-17 09:57:19] [INFO ] Time to serialize properties into /tmp/CTLFireability8203027079819386322.ctl : 9 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11572370963292306358.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8203027079819386322.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.29947e+08,419.893,5279328,44401,477,6.22993e+06,12616,1167,3.46179e+07,158,129253,0
Converting to forward existential form...Done !
original formula: (AF(((EF((((((i9.i0.u92.WantSection_1_F==0)||(i15.u48.Idle_1==0))&&((i12.i0.u41.WantSection_2_F==0)||(i15.u47.Idle_2==0)))&&(((i12.i1.u69...28905
=> equivalent forward existential formula: [(FwdU((Init * !(!(EG(!(((E(TRUE U (((((i9.i0.u92.WantSection_1_F==0)||(i15.u48.Idle_1==0))&&((i12.i0.u41.WantSe...28998
Reverse transition relation is NOT exact ! Due to transitions t144, t145, t146, t147, t162, t166, t175, t311, t312, t313, t314, t315, t316, t317, t318, t31...1391
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
(forward)formula 0,0,1290.37,10151588,1,0,1.10589e+07,24386,5948,7.64817e+07,595,229200,24879279
FORMULA Peterson-PT-4-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AF((AF(((((((((i15.u79.TestIdentity_3_0_0==1)||(i9.i1.u55.TestIdentity_2_1_3==1))||((i7.u29.TestIdentity_2_3_0==1)||(i21.i1.u112.TestIden...11418
Detected timeout of ITS tools.
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!(((((((((i15.u79.TestIdentity_3_0_0==1)||(i9.i1.u55.TestIdentity_2_1_3==1))||((i7.u29.TestId...9017
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:176)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:342)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:284)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:326)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:178)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:181)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:161)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:326)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:392)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:186)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 10:22:55] [INFO ] Applying decomposition
[2022-05-17 10:22:55] [INFO ] Flatten gal took : 37 ms
[2022-05-17 10:22:55] [INFO ] Decomposing Gal with order
[2022-05-17 10:22:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 10:22:55] [INFO ] Removed a total of 436 redundant transitions.
[2022-05-17 10:22:55] [INFO ] Flatten gal took : 64 ms
[2022-05-17 10:22:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 176 labels/synchronizations in 3 ms.
[2022-05-17 10:22:55] [INFO ] Time to serialize gal into /tmp/CTLFireability9993648441574364017.gal : 2 ms
[2022-05-17 10:22:55] [INFO ] Time to serialize properties into /tmp/CTLFireability1470478391041651674.ctl : 7 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9993648441574364017.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1470478391041651674.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.29947e+08,127.856,2576028,31087,14094,4.32993e+06,433893,845,5.17077e+06,1144,3.6034e+06,0
Converting to forward existential form...Done !
original formula: AF((AF(((((((((u5.TestIdentity_3_0_0==1)||(u4.TestIdentity_2_1_3==1))||((u4.TestIdentity_2_3_0==1)||(u1.TestIdentity_4_1_3==1)))||(((u1.T...9485
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!(((((((((u5.TestIdentity_3_0_0==1)||(u4.TestIdentity_2_1_3==1))||((u4.TestIdentity_2_3_0==1)...9536
Reverse transition relation is NOT exact ! Due to transitions t67, t71, t73, t75, t76, t77, t88, t94, t95, t144, t145, t146, t147, t148, t161, t162, t165, ...784
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination CTLFireability -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="Peterson-PT-4"
export BK_EXAMINATION="CTLFireability"
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 Peterson-PT-4, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277016200066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-4.tgz
mv Peterson-PT-4 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;