About the Execution of ITS-Tools for BridgeAndVehicles-COL-V80P50N50
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16215.336 | 3600000.00 | 5875415.00 | 240831.00 | FFTTTT??FTFTFFTT | 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.r024-tall-165251918100155.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 BridgeAndVehicles-COL-V80P50N50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918100155
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 6.6K Apr 30 01:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 30 01:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 30 01:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 01:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K May 9 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 9 07:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 10 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 47K May 10 09:33 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 BridgeAndVehicles-COL-V80P50N50-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652576104715
Running Version 202205111006
[2022-05-15 00:55:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 00:55:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 00:55:05] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-15 00:55:06] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-15 00:55:06] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 586 ms
[2022-05-15 00:55:06] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 228 PT places and 1339138.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-COL-V80P50N50-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 00:55:06] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 6 ms.
[2022-05-15 00:55:06] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Initial state reduction rules removed 5 formulas.
FORMULA BridgeAndVehicles-COL-V80P50N50-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N50-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N50-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N50-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N50-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Remains 10 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 22) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :4
Running SMT prover for 3 properties.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 00:55:07] [INFO ] Computed 4 place invariants in 14 ms
[2022-05-15 00:55:07] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-15 00:55:07] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2022-05-15 00:55:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 00:55:07] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA BridgeAndVehicles-COL-V80P50N50-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 00:55:07] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2022-05-15 00:55:07] [INFO ] Flatten gal took : 15 ms
FORMULA BridgeAndVehicles-COL-V80P50N50-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N50-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 00:55:07] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 51)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2022-05-15 00:55:07] [INFO ] Unfolded HLPN to a Petri net with 228 places and 8588 transitions 67470 arcs in 221 ms.
[2022-05-15 00:55:07] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Support contains 14 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 8588/8588 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 227 transition count 8588
Applied a total of 1 rules in 217 ms. Remains 227 /228 variables (removed 1) and now considering 8588/8588 (removed 0) transitions.
[2022-05-15 00:55:08] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 227 cols
[2022-05-15 00:55:08] [INFO ] Computed 6 place invariants in 20 ms
[2022-05-15 00:55:10] [INFO ] Dead Transitions using invariants and state equation in 2673 ms found 0 transitions.
[2022-05-15 00:55:10] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 227 cols
[2022-05-15 00:55:10] [INFO ] Computed 6 place invariants in 13 ms
[2022-05-15 00:55:11] [INFO ] Implicit Places using invariants in 961 ms returned []
[2022-05-15 00:55:11] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 227 cols
[2022-05-15 00:55:11] [INFO ] Computed 6 place invariants in 9 ms
[2022-05-15 00:55:12] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 00:55:14] [INFO ] Implicit Places using invariants and state equation in 3148 ms returned []
Implicit Place search using SMT with State Equation took 4117 ms to find 0 implicit places.
[2022-05-15 00:55:15] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 227 cols
[2022-05-15 00:55:15] [INFO ] Computed 6 place invariants in 9 ms
[2022-05-15 00:55:17] [INFO ] Dead Transitions using invariants and state equation in 2492 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 227/228 places, 8588/8588 transitions.
Finished structural reductions, in 1 iterations. Remains : 227/228 places, 8588/8588 transitions.
Support contains 14 out of 227 places after structural reductions.
[2022-05-15 00:55:18] [INFO ] Flatten gal took : 527 ms
[2022-05-15 00:55:18] [INFO ] Flatten gal took : 382 ms
[2022-05-15 00:55:19] [INFO ] Input system was already deterministic with 8588 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 494 ms. (steps per millisecond=20 ) properties (out of 15) seen :12
Finished Best-First random walk after 947 steps, including 0 resets, run visited all 3 properties in 12 ms. (steps per millisecond=78 )
Computed a total of 170 stabilizing places and 324 stable transitions
Graph (complete) has 11109 edges and 227 vertex of which 226 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.67 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 8588/8588 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 8588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 225 transition count 8587
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 225 transition count 8587
Applied a total of 3 rules in 292 ms. Remains 225 /227 variables (removed 2) and now considering 8587/8588 (removed 1) transitions.
[2022-05-15 00:55:20] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2022-05-15 00:55:20] [INFO ] Computed 5 place invariants in 7 ms
[2022-05-15 00:55:22] [INFO ] Dead Transitions using invariants and state equation in 2433 ms found 0 transitions.
[2022-05-15 00:55:22] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2022-05-15 00:55:22] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 00:55:23] [INFO ] Implicit Places using invariants in 949 ms returned []
[2022-05-15 00:55:23] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2022-05-15 00:55:23] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 00:55:24] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 00:55:28] [INFO ] Implicit Places using invariants and state equation in 4584 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 5551 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 224/227 places, 8587/8588 transitions.
Applied a total of 0 rules in 53 ms. Remains 224 /224 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 224/227 places, 8587/8588 transitions.
Stuttering acceptance computed with spot in 317 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N50-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 (ADD s167 s168))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 3 ms.
FORMULA BridgeAndVehicles-COL-V80P50N50-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N50-LTLCardinality-00 finished in 8728 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||p1)))'
Support contains 2 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 8588/8588 transitions.
Graph (complete) has 11109 edges and 227 vertex of which 226 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.42 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 225 transition count 8587
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 225 transition count 8587
Applied a total of 3 rules in 2925 ms. Remains 225 /227 variables (removed 2) and now considering 8587/8588 (removed 1) transitions.
[2022-05-15 00:55:31] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2022-05-15 00:55:31] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:55:34] [INFO ] Dead Transitions using invariants and state equation in 2514 ms found 0 transitions.
[2022-05-15 00:55:34] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2022-05-15 00:55:34] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 00:55:35] [INFO ] Implicit Places using invariants in 1072 ms returned []
[2022-05-15 00:55:35] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2022-05-15 00:55:35] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 00:55:35] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 00:55:38] [INFO ] Implicit Places using invariants and state equation in 3498 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4590 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 224/227 places, 8587/8588 transitions.
Applied a total of 0 rules in 2439 ms. Remains 224 /224 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 224/227 places, 8587/8588 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N50-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=2, aps=[p0:(GT 2 s0), p1:(GT 2 s165)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-COL-V80P50N50-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N50-LTLCardinality-01 finished in 12621 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((F(p0)||p1) U G(p2))&&G(F(p1))))'
Support contains 5 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 8588/8588 transitions.
Graph (complete) has 11109 edges and 227 vertex of which 226 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 225 transition count 8587
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 225 transition count 8587
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 223 transition count 8586
Applied a total of 6 rules in 3725 ms. Remains 223 /227 variables (removed 4) and now considering 8586/8588 (removed 2) transitions.
[2022-05-15 00:55:45] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
// Phase 1: matrix 528 rows 223 cols
[2022-05-15 00:55:45] [INFO ] Computed 4 place invariants in 5 ms
[2022-05-15 00:55:46] [INFO ] Implicit Places using invariants in 1048 ms returned []
[2022-05-15 00:55:46] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
// Phase 1: matrix 528 rows 223 cols
[2022-05-15 00:55:46] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-15 00:55:46] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 00:55:49] [INFO ] Implicit Places using invariants and state equation in 3538 ms returned []
Implicit Place search using SMT with State Equation took 4590 ms to find 0 implicit places.
[2022-05-15 00:55:50] [INFO ] Redundant transitions in 1130 ms returned []
[2022-05-15 00:55:50] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
// Phase 1: matrix 528 rows 223 cols
[2022-05-15 00:55:50] [INFO ] Computed 4 place invariants in 6 ms
[2022-05-15 00:55:53] [INFO ] Dead Transitions using invariants and state equation in 2258 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 223/227 places, 8586/8588 transitions.
Finished structural reductions, in 1 iterations. Remains : 223/227 places, 8586/8588 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N50-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ s164 1), p1:(LEQ s165 (ADD s221 s222)), p0:(LEQ s82 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 435 reset in 1748 ms.
Product exploration explored 100000 steps with 439 reset in 1682 ms.
Computed a total of 166 stabilizing places and 322 stable transitions
Computed a total of 166 stabilizing places and 322 stable transitions
Detected a total of 166/223 stabilizing places and 322/8586 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0)))))]
Knowledge based reduction with 15 factoid took 805 ms. Reduced automaton from 6 states, 15 edges and 3 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p2) p1)]
Finished random walk after 1892 steps, including 3 resets, run visited all 7 properties in 69 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (F p1), (F (AND p2 (NOT p0) (NOT p1))), (F (AND p2 (NOT p0) p1)), (F (AND (NOT p2) (NOT p0) p1)), (F (NOT p0)), (F (NOT p2)), (F (AND (NOT p2) (NOT p0) (NOT p1)))]
Knowledge based reduction with 15 factoid took 833 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p2) p1)]
[2022-05-15 00:55:59] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
// Phase 1: matrix 528 rows 223 cols
[2022-05-15 00:55:59] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 00:56:00] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2022-05-15 00:56:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 00:56:01] [INFO ] [Real]Absence check using state equation in 1064 ms returned sat
[2022-05-15 00:56:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 00:56:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2022-05-15 00:56:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 00:56:02] [INFO ] [Nat]Absence check using state equation in 937 ms returned sat
[2022-05-15 00:56:02] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 00:56:06] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 00:56:06] [INFO ] [Nat]Added 102 Read/Feed constraints in 3687 ms returned sat
[2022-05-15 00:56:07] [INFO ] Computed and/alt/rep : 210/418/210 causal constraints (skipped 315 transitions) in 411 ms.
[2022-05-15 00:56:09] [INFO ] Added : 126 causal constraints over 26 iterations in 2514 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 5 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 8586/8586 transitions.
Applied a total of 0 rules in 53 ms. Remains 223 /223 variables (removed 0) and now considering 8586/8586 (removed 0) transitions.
[2022-05-15 00:56:09] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
// Phase 1: matrix 528 rows 223 cols
[2022-05-15 00:56:09] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-15 00:56:10] [INFO ] Implicit Places using invariants in 1077 ms returned []
[2022-05-15 00:56:10] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
// Phase 1: matrix 528 rows 223 cols
[2022-05-15 00:56:10] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-15 00:56:10] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 00:56:13] [INFO ] Implicit Places using invariants and state equation in 3297 ms returned []
Implicit Place search using SMT with State Equation took 4380 ms to find 0 implicit places.
[2022-05-15 00:56:13] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
// Phase 1: matrix 528 rows 223 cols
[2022-05-15 00:56:13] [INFO ] Computed 4 place invariants in 7 ms
[2022-05-15 00:56:16] [INFO ] Dead Transitions using invariants and state equation in 2497 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 223/223 places, 8586/8586 transitions.
Computed a total of 166 stabilizing places and 322 stable transitions
Computed a total of 166 stabilizing places and 322 stable transitions
Detected a total of 166/223 stabilizing places and 322/8586 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT p1)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1)))))]
Knowledge based reduction with 12 factoid took 645 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p2) p1)]
Finished random walk after 2381 steps, including 4 resets, run visited all 7 properties in 93 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT p1)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (F p1), (F (AND (NOT p0) p2 (NOT p1))), (F (AND (NOT p0) p2 p1)), (F (AND (NOT p0) (NOT p2) p1)), (F (NOT p0)), (F (NOT p2)), (F (AND (NOT p0) (NOT p2) (NOT p1)))]
Knowledge based reduction with 12 factoid took 890 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p2) p1)]
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p2) p1)]
[2022-05-15 00:56:18] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
// Phase 1: matrix 528 rows 223 cols
[2022-05-15 00:56:18] [INFO ] Computed 4 place invariants in 7 ms
[2022-05-15 00:56:19] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2022-05-15 00:56:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 00:56:20] [INFO ] [Real]Absence check using state equation in 1073 ms returned sat
[2022-05-15 00:56:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 00:56:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2022-05-15 00:56:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 00:56:22] [INFO ] [Nat]Absence check using state equation in 923 ms returned sat
[2022-05-15 00:56:22] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 00:56:25] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 00:56:25] [INFO ] [Nat]Added 102 Read/Feed constraints in 3672 ms returned sat
[2022-05-15 00:56:26] [INFO ] Computed and/alt/rep : 210/418/210 causal constraints (skipped 315 transitions) in 417 ms.
[2022-05-15 00:56:28] [INFO ] Added : 126 causal constraints over 26 iterations in 2425 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p2) p1)]
Product exploration explored 100000 steps with 447 reset in 1664 ms.
Product exploration explored 100000 steps with 447 reset in 1574 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p2) p1)]
Support contains 5 out of 223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 223/223 places, 8586/8586 transitions.
Applied a total of 0 rules in 3374 ms. Remains 223 /223 variables (removed 0) and now considering 8586/8586 (removed 0) transitions.
[2022-05-15 00:56:36] [INFO ] Redundant transitions in 1177 ms returned []
[2022-05-15 00:56:36] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
// Phase 1: matrix 528 rows 223 cols
[2022-05-15 00:56:36] [INFO ] Computed 4 place invariants in 7 ms
[2022-05-15 00:56:39] [INFO ] Dead Transitions using invariants and state equation in 2267 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 223/223 places, 8586/8586 transitions.
Product exploration explored 100000 steps with 424 reset in 1713 ms.
Product exploration explored 100000 steps with 442 reset in 1736 ms.
Built C files in :
/tmp/ltsmin10949895291895097601
[2022-05-15 00:56:42] [INFO ] Built C files in 125ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10949895291895097601
Running compilation step : cd /tmp/ltsmin10949895291895097601;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10949895291895097601;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10949895291895097601;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 5 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 8586/8586 transitions.
Applied a total of 0 rules in 53 ms. Remains 223 /223 variables (removed 0) and now considering 8586/8586 (removed 0) transitions.
[2022-05-15 00:56:45] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
// Phase 1: matrix 528 rows 223 cols
[2022-05-15 00:56:45] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 00:56:46] [INFO ] Implicit Places using invariants in 1043 ms returned []
[2022-05-15 00:56:46] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
// Phase 1: matrix 528 rows 223 cols
[2022-05-15 00:56:46] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 00:56:46] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 00:56:50] [INFO ] Implicit Places using invariants and state equation in 3521 ms returned []
Implicit Place search using SMT with State Equation took 4582 ms to find 0 implicit places.
[2022-05-15 00:56:50] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
// Phase 1: matrix 528 rows 223 cols
[2022-05-15 00:56:50] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 00:56:52] [INFO ] Dead Transitions using invariants and state equation in 2388 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 223/223 places, 8586/8586 transitions.
Built C files in :
/tmp/ltsmin3081515350094927014
[2022-05-15 00:56:52] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3081515350094927014
Running compilation step : cd /tmp/ltsmin3081515350094927014;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3081515350094927014;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3081515350094927014;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 00:56:56] [INFO ] Flatten gal took : 321 ms
[2022-05-15 00:56:56] [INFO ] Flatten gal took : 264 ms
[2022-05-15 00:56:57] [INFO ] Time to serialize gal into /tmp/LTL10918999024390486059.gal : 86 ms
[2022-05-15 00:56:57] [INFO ] Time to serialize properties into /tmp/LTL16575450183240414126.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10918999024390486059.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16575450183240414126.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1091899...268
Read 1 LTL properties
Checking formula 0 : !(((((F("(ATTENTE_A_0<=1)"))||("(ROUTE_B_0<=(VIDANGE_0+VIDANGE_1))"))U(G("(ATTENTE_B_0<=1)")))&&(G(F("(ROUTE_B_0<=(VIDANGE_0+VIDANGE_1...163
Formula 0 simplified : !((("(ROUTE_B_0<=(VIDANGE_0+VIDANGE_1))" | F"(ATTENTE_A_0<=1)") U G"(ATTENTE_B_0<=1)") & GF"(ROUTE_B_0<=(VIDANGE_0+VIDANGE_1))")
Detected timeout of ITS tools.
[2022-05-15 00:57:12] [INFO ] Flatten gal took : 284 ms
[2022-05-15 00:57:12] [INFO ] Applying decomposition
[2022-05-15 00:57:12] [INFO ] Flatten gal took : 290 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/graph5032271165759547393.txt' '-o' '/tmp/graph5032271165759547393.bin' '-w' '/tmp/graph5032271165759547393.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5032271165759547393.bin' '-l' '-1' '-v' '-w' '/tmp/graph5032271165759547393.weights' '-q' '0' '-e' '0.001'
[2022-05-15 00:57:13] [INFO ] Decomposing Gal with order
[2022-05-15 00:57:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 00:58:15] [INFO ] Removed a total of 8240 redundant transitions.
[2022-05-15 00:58:16] [INFO ] Flatten gal took : 62941 ms
[2022-05-15 00:58:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 8243 labels/synchronizations in 989 ms.
[2022-05-15 00:58:19] [INFO ] Time to serialize gal into /tmp/LTL6670812532883229801.gal : 44 ms
[2022-05-15 00:58:19] [INFO ] Time to serialize properties into /tmp/LTL15592767762827478763.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6670812532883229801.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15592767762827478763.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6670812...267
Read 1 LTL properties
Checking formula 0 : !(((((F("(gu1.ATTENTE_A_0<=1)"))||("(gu0.ROUTE_B_0<=(gu0.VIDANGE_0+gu0.VIDANGE_1))"))U(G("(gu1.ATTENTE_B_0<=1)")))&&(G(F("(gu0.ROUTE_B...195
Formula 0 simplified : !((("(gu0.ROUTE_B_0<=(gu0.VIDANGE_0+gu0.VIDANGE_1))" | F"(gu1.ATTENTE_A_0<=1)") U G"(gu1.ATTENTE_B_0<=1)") & GF"(gu0.ROUTE_B_0<=(gu0...183
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12353129344696560610
[2022-05-15 00:58:34] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12353129344696560610
Running compilation step : cd /tmp/ltsmin12353129344696560610;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12353129344696560610;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12353129344696560610;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-COL-V80P50N50-LTLCardinality-06 finished in 175837 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(p0))))'
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 8588/8588 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 226 transition count 8587
Applied a total of 2 rules in 2583 ms. Remains 226 /227 variables (removed 1) and now considering 8587/8588 (removed 1) transitions.
[2022-05-15 00:58:39] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 226 cols
[2022-05-15 00:58:39] [INFO ] Computed 6 place invariants in 8 ms
[2022-05-15 00:58:42] [INFO ] Dead Transitions using invariants and state equation in 2503 ms found 0 transitions.
[2022-05-15 00:58:42] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 226 cols
[2022-05-15 00:58:42] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-15 00:58:43] [INFO ] Implicit Places using invariants in 1173 ms returned []
[2022-05-15 00:58:43] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 226 cols
[2022-05-15 00:58:43] [INFO ] Computed 6 place invariants in 7 ms
[2022-05-15 00:58:43] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 00:58:47] [INFO ] Implicit Places using invariants and state equation in 4006 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5193 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 224/227 places, 8587/8588 transitions.
Applied a total of 0 rules in 2464 ms. Remains 224 /224 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 224/227 places, 8587/8588 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N50-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s166)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 494 reset in 1790 ms.
Product exploration explored 100000 steps with 483 reset in 1797 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Graph (complete) has 10779 edges and 224 vertex of which 223 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.31 ms
Computed a total of 167 stabilizing places and 323 stable transitions
Detected a total of 167/224 stabilizing places and 323/8587 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Finished random walk after 39 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=19 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
[2022-05-15 00:58:54] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 224 cols
[2022-05-15 00:58:54] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:58:57] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-05-15 00:58:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 00:58:58] [INFO ] [Real]Absence check using state equation in 926 ms returned sat
[2022-05-15 00:58:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 00:59:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 00:59:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 00:59:01] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2022-05-15 00:59:01] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 00:59:04] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 00:59:07] [INFO ] [Nat]Added 102 Read/Feed constraints in 6061 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 8587/8587 transitions.
Applied a total of 0 rules in 2546 ms. Remains 224 /224 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2022-05-15 00:59:10] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 224 cols
[2022-05-15 00:59:10] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 00:59:12] [INFO ] Dead Transitions using invariants and state equation in 2441 ms found 0 transitions.
[2022-05-15 00:59:12] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 224 cols
[2022-05-15 00:59:12] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:59:13] [INFO ] Implicit Places using invariants in 1155 ms returned []
[2022-05-15 00:59:13] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 224 cols
[2022-05-15 00:59:13] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:59:14] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 00:59:16] [INFO ] Implicit Places using invariants and state equation in 2909 ms returned []
Implicit Place search using SMT with State Equation took 4073 ms to find 0 implicit places.
[2022-05-15 00:59:17] [INFO ] Redundant transitions in 843 ms returned []
[2022-05-15 00:59:17] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 224 cols
[2022-05-15 00:59:17] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 00:59:20] [INFO ] Dead Transitions using invariants and state equation in 2395 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 224/224 places, 8587/8587 transitions.
Computed a total of 167 stabilizing places and 323 stable transitions
Graph (complete) has 10779 edges and 224 vertex of which 223 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.34 ms
Computed a total of 167 stabilizing places and 323 stable transitions
Detected a total of 167/224 stabilizing places and 323/8587 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Finished random walk after 46 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=23 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
[2022-05-15 00:59:20] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 224 cols
[2022-05-15 00:59:20] [INFO ] Computed 5 place invariants in 50 ms
[2022-05-15 00:59:23] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-05-15 00:59:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 00:59:24] [INFO ] [Real]Absence check using state equation in 902 ms returned sat
[2022-05-15 00:59:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 00:59:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-15 00:59:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 00:59:27] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2022-05-15 00:59:27] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 00:59:30] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-15 00:59:33] [INFO ] [Nat]Added 102 Read/Feed constraints in 6064 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 500 reset in 1839 ms.
Product exploration explored 100000 steps with 490 reset in 1803 ms.
Built C files in :
/tmp/ltsmin16055641045937807041
[2022-05-15 00:59:37] [INFO ] Too many transitions (8587) to apply POR reductions. Disabling POR matrices.
[2022-05-15 00:59:37] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16055641045937807041
Running compilation step : cd /tmp/ltsmin16055641045937807041;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16055641045937807041;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16055641045937807041;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 8587/8587 transitions.
Applied a total of 0 rules in 2578 ms. Remains 224 /224 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2022-05-15 00:59:42] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 224 cols
[2022-05-15 00:59:42] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-15 00:59:45] [INFO ] Dead Transitions using invariants and state equation in 2504 ms found 0 transitions.
[2022-05-15 00:59:45] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 224 cols
[2022-05-15 00:59:45] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 00:59:46] [INFO ] Implicit Places using invariants in 1176 ms returned []
[2022-05-15 00:59:46] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 224 cols
[2022-05-15 00:59:46] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 00:59:46] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 00:59:49] [INFO ] Implicit Places using invariants and state equation in 2685 ms returned []
Implicit Place search using SMT with State Equation took 3864 ms to find 0 implicit places.
[2022-05-15 00:59:49] [INFO ] Redundant transitions in 875 ms returned []
[2022-05-15 00:59:49] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 224 cols
[2022-05-15 00:59:49] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 00:59:52] [INFO ] Dead Transitions using invariants and state equation in 2336 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 224/224 places, 8587/8587 transitions.
Built C files in :
/tmp/ltsmin18370361223004053562
[2022-05-15 00:59:52] [INFO ] Too many transitions (8587) to apply POR reductions. Disabling POR matrices.
[2022-05-15 00:59:52] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18370361223004053562
Running compilation step : cd /tmp/ltsmin18370361223004053562;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18370361223004053562;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18370361223004053562;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 00:59:55] [INFO ] Flatten gal took : 268 ms
[2022-05-15 00:59:56] [INFO ] Flatten gal took : 261 ms
[2022-05-15 00:59:56] [INFO ] Time to serialize gal into /tmp/LTL10863335779001451209.gal : 32 ms
[2022-05-15 00:59:56] [INFO ] Time to serialize properties into /tmp/LTL10095995924409231972.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10863335779001451209.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10095995924409231972.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1086333...268
Read 1 LTL properties
Checking formula 0 : !((F(G(F("(SORTI_B_0>=3)")))))
Formula 0 simplified : !FGF"(SORTI_B_0>=3)"
Detected timeout of ITS tools.
[2022-05-15 01:00:11] [INFO ] Flatten gal took : 285 ms
[2022-05-15 01:00:11] [INFO ] Applying decomposition
[2022-05-15 01:00:11] [INFO ] Flatten gal took : 338 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/graph6109076003914653452.txt' '-o' '/tmp/graph6109076003914653452.bin' '-w' '/tmp/graph6109076003914653452.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6109076003914653452.bin' '-l' '-1' '-v' '-w' '/tmp/graph6109076003914653452.weights' '-q' '0' '-e' '0.001'
[2022-05-15 01:00:12] [INFO ] Decomposing Gal with order
[2022-05-15 01:00:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 01:00:17] [INFO ] Removed a total of 16673 redundant transitions.
[2022-05-15 01:00:17] [INFO ] Flatten gal took : 4711 ms
[2022-05-15 01:00:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 597 labels/synchronizations in 87 ms.
[2022-05-15 01:00:18] [INFO ] Time to serialize gal into /tmp/LTL16366768423724662277.gal : 2 ms
[2022-05-15 01:00:18] [INFO ] Time to serialize properties into /tmp/LTL5419741373358125839.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16366768423724662277.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5419741373358125839.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1636676...246
Read 1 LTL properties
Checking formula 0 : !((F(G(F("(u3.SORTI_B_0>=3)")))))
Formula 0 simplified : !FGF"(u3.SORTI_B_0>=3)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14998394205834258785
[2022-05-15 01:00:33] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14998394205834258785
Running compilation step : cd /tmp/ltsmin14998394205834258785;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14998394205834258785;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14998394205834258785;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-COL-V80P50N50-LTLCardinality-07 finished in 118850 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G((p1&&X(p2))))))'
Support contains 3 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 8588/8588 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 8588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 225 transition count 8587
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 225 transition count 8587
Applied a total of 3 rules in 104 ms. Remains 225 /227 variables (removed 2) and now considering 8587/8588 (removed 1) transitions.
[2022-05-15 01:00:36] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2022-05-15 01:00:36] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-15 01:00:38] [INFO ] Dead Transitions using invariants and state equation in 2503 ms found 0 transitions.
[2022-05-15 01:00:38] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2022-05-15 01:00:38] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 01:00:40] [INFO ] Implicit Places using invariants in 1187 ms returned []
[2022-05-15 01:00:40] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2022-05-15 01:00:40] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:00:40] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 01:00:43] [INFO ] Implicit Places using invariants and state equation in 3893 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 5097 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 224/227 places, 8587/8588 transitions.
Applied a total of 0 rules in 136 ms. Remains 224 /224 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 224/227 places, 8587/8588 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N50-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GT 1 s0), p0:(LEQ 1 s165), p2:(GT 2 s166)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 645 steps with 0 reset in 16 ms.
FORMULA BridgeAndVehicles-COL-V80P50N50-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N50-LTLCardinality-08 finished in 8113 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(!((!F(p0) U p1) U p2))))'
Support contains 7 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 8588/8588 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 8588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 225 transition count 8587
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 225 transition count 8587
Applied a total of 3 rules in 91 ms. Remains 225 /227 variables (removed 2) and now considering 8587/8588 (removed 1) transitions.
[2022-05-15 01:00:44] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2022-05-15 01:00:44] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:00:46] [INFO ] Dead Transitions using invariants and state equation in 2500 ms found 0 transitions.
[2022-05-15 01:00:46] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2022-05-15 01:00:46] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:00:47] [INFO ] Implicit Places using invariants in 898 ms returned []
[2022-05-15 01:00:47] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2022-05-15 01:00:47] [INFO ] Computed 5 place invariants in 7 ms
[2022-05-15 01:00:48] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 01:00:53] [INFO ] Implicit Places using invariants and state equation in 5672 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6588 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 224/227 places, 8587/8588 transitions.
Applied a total of 0 rules in 47 ms. Remains 224 /224 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 224/227 places, 8587/8588 transitions.
Stuttering acceptance computed with spot in 170 ms :[p2, p2, (AND p1 p2 (NOT p0)), (AND (NOT p0) p2)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N50-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s0 (ADD s222 s223)), p2:(GT (ADD s167 s168) (ADD s222 s223)), p0:(LEQ 1 (ADD s169 s170))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 27928 reset in 2095 ms.
Product exploration explored 100000 steps with 28190 reset in 2046 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
Knowledge based reduction with 7 factoid took 379 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 158 ms :[p2, p2, (AND p1 p2 (NOT p0)), (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2022-05-15 01:00:59] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 224 cols
[2022-05-15 01:00:59] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 01:00:59] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 01:00:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 01:00:59] [INFO ] After 583ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 01:01:00] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 01:01:00] [INFO ] After 357ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 01:01:00] [INFO ] After 782ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 262 ms.
[2022-05-15 01:01:01] [INFO ] After 1731ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 7 out of 224 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 224/224 places, 8587/8587 transitions.
Applied a total of 0 rules in 2735 ms. Remains 224 /224 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2022-05-15 01:01:03] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 224 cols
[2022-05-15 01:01:03] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 01:01:06] [INFO ] Dead Transitions using invariants and state equation in 2567 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 224/224 places, 8587/8587 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 79027 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79027 steps, saw 22702 distinct states, run finished after 3002 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 01:01:09] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 224 cols
[2022-05-15 01:01:09] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 01:01:09] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 01:01:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-15 01:01:10] [INFO ] After 593ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 01:01:10] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 01:01:10] [INFO ] After 360ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 01:01:11] [INFO ] After 799ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 261 ms.
[2022-05-15 01:01:11] [INFO ] After 1767ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 7 out of 224 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 224/224 places, 8587/8587 transitions.
Applied a total of 0 rules in 2613 ms. Remains 224 /224 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 224/224 places, 8587/8587 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 224/224 places, 8587/8587 transitions.
Applied a total of 0 rules in 2502 ms. Remains 224 /224 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2022-05-15 01:01:16] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 224 cols
[2022-05-15 01:01:16] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 01:01:17] [INFO ] Implicit Places using invariants in 899 ms returned []
[2022-05-15 01:01:17] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 224 cols
[2022-05-15 01:01:17] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 01:01:17] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 01:01:20] [INFO ] Implicit Places using invariants and state equation in 2938 ms returned [165]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3852 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 223/224 places, 8587/8587 transitions.
Applied a total of 0 rules in 2399 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 223/224 places, 8587/8587 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 87008 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 87008 steps, saw 24778 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 01:01:26] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:01:26] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 01:01:26] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 01:01:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 01:01:27] [INFO ] After 585ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 01:01:27] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 01:01:28] [INFO ] After 867ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 01:01:28] [INFO ] After 1134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 177 ms.
[2022-05-15 01:01:28] [INFO ] After 1997ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 7 out of 223 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 223/223 places, 8587/8587 transitions.
Applied a total of 0 rules in 2365 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 223/223 places, 8587/8587 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 223/223 places, 8587/8587 transitions.
Applied a total of 0 rules in 2396 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2022-05-15 01:01:33] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:01:33] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 01:01:34] [INFO ] Implicit Places using invariants in 876 ms returned []
[2022-05-15 01:01:34] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:01:34] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:01:34] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 01:01:37] [INFO ] Implicit Places using invariants and state equation in 3680 ms returned []
Implicit Place search using SMT with State Equation took 4558 ms to find 0 implicit places.
[2022-05-15 01:01:38] [INFO ] Redundant transitions in 865 ms returned []
[2022-05-15 01:01:38] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:01:38] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:01:41] [INFO ] Dead Transitions using invariants and state equation in 2324 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 223/223 places, 8587/8587 transitions.
Ensure Unique test removed 8058 transitions
Reduce isomorphic transitions removed 8058 transitions.
Iterating post reduction 0 with 8058 rules applied. Total rules applied 8058 place count 223 transition count 529
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8060 place count 223 transition count 527
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 8062 place count 221 transition count 527
Applied a total of 8062 rules in 24 ms. Remains 221 /223 variables (removed 2) and now considering 527/8587 (removed 8060) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 527 rows 221 cols
[2022-05-15 01:01:41] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 01:01:41] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 01:01:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 01:01:41] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 01:01:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 01:01:41] [INFO ] After 237ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 01:01:41] [INFO ] After 428ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2022-05-15 01:01:41] [INFO ] After 792ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 01:01:41] [INFO ] Flatten gal took : 18 ms
[2022-05-15 01:01:41] [INFO ] Flatten gal took : 17 ms
[2022-05-15 01:01:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality114972993005023840.gal : 3 ms
[2022-05-15 01:01:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1536011892352262090.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16757670614351747883;'/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/ReachabilityCardinality114972993005023840.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1536011892352262090.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...318
Loading property file /tmp/ReachabilityCardinality1536011892352262090.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 29
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :29 after 53
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :53 after 101
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :101 after 181
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :181 after 1010
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1010 after 3010
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3010 after 16664
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :16664 after 86944
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :86944 after 615296
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :615296 after 5.6009e+06
Reachability property apf5 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 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,5.50539e+07,13.2707,244072,2,58216,19,801699,6,0,1418,381468,0
Total reachable state count : 55053914
Verifying 1 reachability properties.
Reachability property apf5 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf5,3240,13.8745,244072,2,707,19,801699,7,0,1584,381468,0
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p2)), (F (AND p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F p2)]
Knowledge based reduction with 7 factoid took 488 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 145 ms :[p2, p2, (AND p1 p2 (NOT p0)), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 144 ms :[p2, p2, (AND p1 p2 (NOT p0)), (AND (NOT p0) p2)]
Support contains 7 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 8587/8587 transitions.
Applied a total of 0 rules in 48 ms. Remains 224 /224 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2022-05-15 01:01:56] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 224 cols
[2022-05-15 01:01:56] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 01:01:59] [INFO ] Dead Transitions using invariants and state equation in 2298 ms found 0 transitions.
[2022-05-15 01:01:59] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 224 cols
[2022-05-15 01:01:59] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 01:01:59] [INFO ] Implicit Places using invariants in 864 ms returned []
[2022-05-15 01:01:59] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 224 cols
[2022-05-15 01:01:59] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:02:00] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 01:02:02] [INFO ] Implicit Places using invariants and state equation in 2757 ms returned [165]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3640 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 223/224 places, 8587/8587 transitions.
Applied a total of 0 rules in 46 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 223/224 places, 8587/8587 transitions.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
Knowledge based reduction with 7 factoid took 434 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 135 ms :[p2, p2, (AND p1 p2 (NOT p0)), (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2022-05-15 01:02:04] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:02:04] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:02:04] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 01:02:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 01:02:04] [INFO ] After 590ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 01:02:04] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 01:02:05] [INFO ] After 863ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 01:02:05] [INFO ] After 1123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 181 ms.
[2022-05-15 01:02:06] [INFO ] After 1999ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 7 out of 223 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 223/223 places, 8587/8587 transitions.
Applied a total of 0 rules in 2358 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2022-05-15 01:02:08] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:02:08] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:02:10] [INFO ] Dead Transitions using invariants and state equation in 2308 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 223/223 places, 8587/8587 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 85151 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85151 steps, saw 24281 distinct states, run finished after 3003 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 01:02:14] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:02:14] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 01:02:14] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 01:02:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 01:02:14] [INFO ] After 606ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 01:02:14] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 01:02:15] [INFO ] After 865ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 01:02:16] [INFO ] After 1130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 182 ms.
[2022-05-15 01:02:16] [INFO ] After 2021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 7 out of 223 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 223/223 places, 8587/8587 transitions.
Applied a total of 0 rules in 2343 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 223/223 places, 8587/8587 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 223/223 places, 8587/8587 transitions.
Applied a total of 0 rules in 2362 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2022-05-15 01:02:20] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:02:20] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 01:02:21] [INFO ] Implicit Places using invariants in 874 ms returned []
[2022-05-15 01:02:21] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:02:21] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 01:02:22] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 01:02:24] [INFO ] Implicit Places using invariants and state equation in 2810 ms returned []
Implicit Place search using SMT with State Equation took 3691 ms to find 0 implicit places.
[2022-05-15 01:02:25] [INFO ] Redundant transitions in 874 ms returned []
[2022-05-15 01:02:25] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:02:25] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 01:02:27] [INFO ] Dead Transitions using invariants and state equation in 2259 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 223/223 places, 8587/8587 transitions.
Ensure Unique test removed 8058 transitions
Reduce isomorphic transitions removed 8058 transitions.
Iterating post reduction 0 with 8058 rules applied. Total rules applied 8058 place count 223 transition count 529
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8060 place count 223 transition count 527
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 8062 place count 221 transition count 527
Applied a total of 8062 rules in 19 ms. Remains 221 /223 variables (removed 2) and now considering 527/8587 (removed 8060) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 527 rows 221 cols
[2022-05-15 01:02:27] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 01:02:27] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 01:02:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 01:02:28] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 01:02:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 01:02:28] [INFO ] After 219ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 01:02:28] [INFO ] After 411ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2022-05-15 01:02:28] [INFO ] After 800ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 01:02:28] [INFO ] Flatten gal took : 18 ms
[2022-05-15 01:02:28] [INFO ] Flatten gal took : 17 ms
[2022-05-15 01:02:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9684330240942200709.gal : 4 ms
[2022-05-15 01:02:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15886216371258325670.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms7303052133915826335;'/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/ReachabilityCardinality9684330240942200709.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15886216371258325670.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/ReachabilityCardinality15886216371258325670.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 29
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :29 after 53
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :53 after 101
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :101 after 181
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :181 after 1010
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1010 after 3010
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3010 after 16664
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :16664 after 86944
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :86944 after 615296
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :615296 after 5.6009e+06
Reachability property apf5 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 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,5.50539e+07,13.1272,243384,2,58216,19,801553,6,0,1418,381528,0
Total reachable state count : 55053914
Verifying 1 reachability properties.
Reachability property apf5 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf5,3240,13.6995,243384,2,707,19,801553,7,0,1584,381528,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p2)), (F (AND p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F p2)]
Knowledge based reduction with 7 factoid took 525 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 138 ms :[p2, p2, (AND p1 p2 (NOT p0)), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 149 ms :[p2, p2, (AND p1 p2 (NOT p0)), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 139 ms :[p2, p2, (AND p1 p2 (NOT p0)), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 27942 reset in 1813 ms.
Product exploration explored 100000 steps with 27981 reset in 1852 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 123 ms :[p2, p2, (AND p1 p2 (NOT p0)), (AND (NOT p0) p2)]
Support contains 7 out of 223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 223/223 places, 8587/8587 transitions.
Applied a total of 0 rules in 2812 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2022-05-15 01:02:50] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:02:50] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 01:02:52] [INFO ] Dead Transitions using invariants and state equation in 2452 ms found 0 transitions.
[2022-05-15 01:02:53] [INFO ] Redundant transitions in 841 ms returned []
[2022-05-15 01:02:53] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:02:53] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 01:02:55] [INFO ] Dead Transitions using invariants and state equation in 2278 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 223/223 places, 8587/8587 transitions.
Product exploration explored 100000 steps with 27955 reset in 5476 ms.
Product exploration explored 100000 steps with 28068 reset in 5497 ms.
Built C files in :
/tmp/ltsmin15364096931564108923
[2022-05-15 01:03:06] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15364096931564108923
Running compilation step : cd /tmp/ltsmin15364096931564108923;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15364096931564108923;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15364096931564108923;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 7 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 8587/8587 transitions.
Applied a total of 0 rules in 46 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2022-05-15 01:03:09] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:03:09] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 01:03:12] [INFO ] Dead Transitions using invariants and state equation in 2498 ms found 0 transitions.
[2022-05-15 01:03:12] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:03:12] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:03:13] [INFO ] Implicit Places using invariants in 876 ms returned []
[2022-05-15 01:03:13] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:03:13] [INFO ] Computed 5 place invariants in 9 ms
[2022-05-15 01:03:13] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 01:03:16] [INFO ] Implicit Places using invariants and state equation in 3138 ms returned []
Implicit Place search using SMT with State Equation took 4028 ms to find 0 implicit places.
[2022-05-15 01:03:16] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:03:16] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:03:18] [INFO ] Dead Transitions using invariants and state equation in 2524 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 223/223 places, 8587/8587 transitions.
Built C files in :
/tmp/ltsmin14104854138642355747
[2022-05-15 01:03:19] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14104854138642355747
Running compilation step : cd /tmp/ltsmin14104854138642355747;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14104854138642355747;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14104854138642355747;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 01:03:22] [INFO ] Flatten gal took : 275 ms
[2022-05-15 01:03:22] [INFO ] Flatten gal took : 286 ms
[2022-05-15 01:03:22] [INFO ] Time to serialize gal into /tmp/LTL918082988744734201.gal : 42 ms
[2022-05-15 01:03:22] [INFO ] Time to serialize properties into /tmp/LTL8259626807265155981.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL918082988744734201.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8259626807265155981.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9180829...265
Read 1 LTL properties
Checking formula 0 : !((F(X(!(((!(F("((CHOIX_0+CHOIX_1)>=1)")))U("(CAPACITE_0<=(VIDANGE_0+VIDANGE_1))"))U("((CONTROLEUR_0+CONTROLEUR_1)>(VIDANGE_0+VIDANGE_...165
Formula 0 simplified : !FX!((!F"((CHOIX_0+CHOIX_1)>=1)" U "(CAPACITE_0<=(VIDANGE_0+VIDANGE_1))") U "((CONTROLEUR_0+CONTROLEUR_1)>(VIDANGE_0+VIDANGE_1))")
Detected timeout of ITS tools.
[2022-05-15 01:03:38] [INFO ] Flatten gal took : 346 ms
[2022-05-15 01:03:38] [INFO ] Applying decomposition
[2022-05-15 01:03:38] [INFO ] Flatten gal took : 277 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/graph17477281100499226527.txt' '-o' '/tmp/graph17477281100499226527.bin' '-w' '/tmp/graph17477281100499226527.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17477281100499226527.bin' '-l' '-1' '-v' '-w' '/tmp/graph17477281100499226527.weights' '-q' '0' '-e' '0.001'
[2022-05-15 01:03:39] [INFO ] Decomposing Gal with order
[2022-05-15 01:03:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 01:05:05] [INFO ] Removed a total of 8725 redundant transitions.
[2022-05-15 01:05:06] [INFO ] Flatten gal took : 87379 ms
[2022-05-15 01:05:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 8370 labels/synchronizations in 1074 ms.
[2022-05-15 01:05:08] [INFO ] Time to serialize gal into /tmp/LTL17595634243024009392.gal : 23 ms
[2022-05-15 01:05:08] [INFO ] Time to serialize properties into /tmp/LTL2209284213918396457.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17595634243024009392.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2209284213918396457.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1759563...267
Read 1 LTL properties
Checking formula 0 : !((F(X(!(((!(F("((gu0.CHOIX_0+gu0.CHOIX_1)>=1)")))U("(gu2.CAPACITE_0<=(gu2.VIDANGE_0+gu2.VIDANGE_1))"))U("((gu2.CONTROLEUR_0+gu2.CONTR...201
Formula 0 simplified : !FX!((!F"((gu0.CHOIX_0+gu0.CHOIX_1)>=1)" U "(gu2.CAPACITE_0<=(gu2.VIDANGE_0+gu2.VIDANGE_1))") U "((gu2.CONTROLEUR_0+gu2.CONTROLEUR_1...189
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11449131598110902165
[2022-05-15 01:05:23] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11449131598110902165
Running compilation step : cd /tmp/ltsmin11449131598110902165;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11449131598110902165;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11449131598110902165;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-COL-V80P50N50-LTLCardinality-11 finished in 282537 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 4 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 8588/8588 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 8588
Applied a total of 1 rules in 52 ms. Remains 226 /227 variables (removed 1) and now considering 8588/8588 (removed 0) transitions.
[2022-05-15 01:05:26] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 226 cols
[2022-05-15 01:05:26] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 01:05:29] [INFO ] Dead Transitions using invariants and state equation in 2529 ms found 0 transitions.
[2022-05-15 01:05:29] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 226 cols
[2022-05-15 01:05:29] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:05:30] [INFO ] Implicit Places using invariants in 1066 ms returned []
[2022-05-15 01:05:30] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 226 cols
[2022-05-15 01:05:30] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:05:30] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 01:05:33] [INFO ] Implicit Places using invariants and state equation in 3218 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4317 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 225/227 places, 8588/8588 transitions.
Applied a total of 0 rules in 49 ms. Remains 225 /225 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 225/227 places, 8588/8588 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N50-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s166 s165), p1:(LEQ s83 s82)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2468 ms.
Product exploration explored 100000 steps with 50000 reset in 2509 ms.
Computed a total of 168 stabilizing places and 324 stable transitions
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/225 stabilizing places and 324/8588 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 9 factoid took 173 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BridgeAndVehicles-COL-V80P50N50-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V80P50N50-LTLCardinality-15 finished in 12350 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((F(p0)||p1) U G(p2))&&G(F(p1))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(p0))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(!((!F(p0) U p1) U p2))))'
Found a CL insensitive property : BridgeAndVehicles-COL-V80P50N50-LTLCardinality-11
Stuttering acceptance computed with spot in 148 ms :[p2, p2, (AND p1 p2 (NOT p0)), (AND (NOT p0) p2)]
Support contains 7 out of 227 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 227/227 places, 8588/8588 transitions.
Graph (complete) has 11109 edges and 227 vertex of which 226 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.32 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 225 transition count 8587
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 225 transition count 8587
Applied a total of 3 rules in 155 ms. Remains 225 /227 variables (removed 2) and now considering 8587/8588 (removed 1) transitions.
[2022-05-15 01:05:39] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2022-05-15 01:05:39] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 01:05:42] [INFO ] Dead Transitions using invariants and state equation in 2349 ms found 0 transitions.
[2022-05-15 01:05:42] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2022-05-15 01:05:42] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:05:43] [INFO ] Implicit Places using invariants in 886 ms returned []
[2022-05-15 01:05:43] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2022-05-15 01:05:43] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:05:43] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 01:05:47] [INFO ] Implicit Places using invariants and state equation in 4360 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5281 ms to find 2 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 223/227 places, 8587/8588 transitions.
Applied a total of 0 rules in 80 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 223/227 places, 8587/8588 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N50-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s0 (ADD s221 s222)), p2:(GT (ADD s166 s167) (ADD s221 s222)), p0:(LEQ 1 (ADD s168 s169))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 27885 reset in 1845 ms.
Product exploration explored 100000 steps with 27982 reset in 1902 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
Knowledge based reduction with 7 factoid took 415 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 205 ms :[p2, p2, (AND p1 p2 (NOT p0)), (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2022-05-15 01:05:52] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:05:52] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-15 01:05:52] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 01:05:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 01:05:53] [INFO ] After 641ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 01:05:53] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 01:05:54] [INFO ] After 868ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 01:05:54] [INFO ] After 1129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 184 ms.
[2022-05-15 01:05:54] [INFO ] After 2071ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 7 out of 223 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 223/223 places, 8587/8587 transitions.
Applied a total of 0 rules in 2548 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2022-05-15 01:05:57] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:05:57] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 01:06:01] [INFO ] Dead Transitions using invariants and state equation in 3595 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 223/223 places, 8587/8587 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 83301 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83301 steps, saw 23808 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 01:06:04] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:06:04] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 01:06:04] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 01:06:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-15 01:06:05] [INFO ] After 655ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 01:06:05] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 01:06:06] [INFO ] After 886ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 01:06:06] [INFO ] After 1148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 182 ms.
[2022-05-15 01:06:06] [INFO ] After 2117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 7 out of 223 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 223/223 places, 8587/8587 transitions.
Applied a total of 0 rules in 2416 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 223/223 places, 8587/8587 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 223/223 places, 8587/8587 transitions.
Applied a total of 0 rules in 2343 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2022-05-15 01:06:11] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:06:11] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 01:06:12] [INFO ] Implicit Places using invariants in 838 ms returned []
[2022-05-15 01:06:12] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:06:12] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 01:06:12] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 01:06:15] [INFO ] Implicit Places using invariants and state equation in 2744 ms returned []
Implicit Place search using SMT with State Equation took 3583 ms to find 0 implicit places.
[2022-05-15 01:06:15] [INFO ] Redundant transitions in 844 ms returned []
[2022-05-15 01:06:15] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:06:15] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 01:06:18] [INFO ] Dead Transitions using invariants and state equation in 2262 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 223/223 places, 8587/8587 transitions.
Ensure Unique test removed 8058 transitions
Reduce isomorphic transitions removed 8058 transitions.
Iterating post reduction 0 with 8058 rules applied. Total rules applied 8058 place count 223 transition count 529
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8060 place count 223 transition count 527
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 8062 place count 221 transition count 527
Applied a total of 8062 rules in 18 ms. Remains 221 /223 variables (removed 2) and now considering 527/8587 (removed 8060) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 527 rows 221 cols
[2022-05-15 01:06:18] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:06:18] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 01:06:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 01:06:18] [INFO ] After 262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 01:06:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 01:06:18] [INFO ] After 219ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 01:06:18] [INFO ] After 410ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2022-05-15 01:06:19] [INFO ] After 790ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 01:06:19] [INFO ] Flatten gal took : 21 ms
[2022-05-15 01:06:19] [INFO ] Flatten gal took : 17 ms
[2022-05-15 01:06:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12569578744477950955.gal : 15 ms
[2022-05-15 01:06:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16179467250742340737.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms9136899977135169676;'/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/ReachabilityCardinality12569578744477950955.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16179467250742340737.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/ReachabilityCardinality16179467250742340737.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 29
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :29 after 53
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :53 after 101
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :101 after 181
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :181 after 1010
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1010 after 3010
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3010 after 16664
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :16664 after 86944
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :86944 after 615296
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :615296 after 5.6009e+06
Reachability property apf5 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 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,5.50539e+07,12.8288,243316,2,58216,19,801553,6,0,1418,381528,0
Total reachable state count : 55053914
Verifying 1 reachability properties.
Reachability property apf5 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf5,3240,13.4084,243316,2,707,19,801553,7,0,1584,381528,0
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p2)), (F (AND p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F p2)]
Knowledge based reduction with 7 factoid took 1382 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 134 ms :[p2, p2, (AND p1 p2 (NOT p0)), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 139 ms :[p2, p2, (AND p1 p2 (NOT p0)), (AND (NOT p0) p2)]
Support contains 7 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 8587/8587 transitions.
Applied a total of 0 rules in 51 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2022-05-15 01:06:34] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:06:34] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 01:06:36] [INFO ] Dead Transitions using invariants and state equation in 2397 ms found 0 transitions.
[2022-05-15 01:06:36] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:06:36] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 01:06:37] [INFO ] Implicit Places using invariants in 822 ms returned []
[2022-05-15 01:06:37] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:06:37] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 01:06:37] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 01:06:41] [INFO ] Implicit Places using invariants and state equation in 3689 ms returned []
Implicit Place search using SMT with State Equation took 4516 ms to find 0 implicit places.
[2022-05-15 01:06:41] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:06:41] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 01:06:43] [INFO ] Dead Transitions using invariants and state equation in 2242 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 223/223 places, 8587/8587 transitions.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
Knowledge based reduction with 7 factoid took 841 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 147 ms :[p2, p2, (AND p1 p2 (NOT p0)), (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2022-05-15 01:06:45] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:06:45] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 01:06:45] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 01:06:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 01:06:45] [INFO ] After 601ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 01:06:45] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 01:06:46] [INFO ] After 860ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 01:06:47] [INFO ] After 1124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 179 ms.
[2022-05-15 01:06:47] [INFO ] After 2019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 7 out of 223 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 223/223 places, 8587/8587 transitions.
Applied a total of 0 rules in 2330 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2022-05-15 01:06:49] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:06:49] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 01:06:51] [INFO ] Dead Transitions using invariants and state equation in 2305 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 223/223 places, 8587/8587 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 85468 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85468 steps, saw 24402 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 01:06:55] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:06:55] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 01:06:55] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 01:06:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 01:06:55] [INFO ] After 610ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 01:06:56] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 01:06:56] [INFO ] After 873ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 01:06:57] [INFO ] After 1139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 185 ms.
[2022-05-15 01:06:57] [INFO ] After 2019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 7 out of 223 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 223/223 places, 8587/8587 transitions.
Applied a total of 0 rules in 2332 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 223/223 places, 8587/8587 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 223/223 places, 8587/8587 transitions.
Applied a total of 0 rules in 2326 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2022-05-15 01:07:02] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:07:02] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 01:07:02] [INFO ] Implicit Places using invariants in 875 ms returned []
[2022-05-15 01:07:02] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:07:02] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:07:03] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 01:07:05] [INFO ] Implicit Places using invariants and state equation in 2820 ms returned []
Implicit Place search using SMT with State Equation took 3696 ms to find 0 implicit places.
[2022-05-15 01:07:06] [INFO ] Redundant transitions in 845 ms returned []
[2022-05-15 01:07:06] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:07:06] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 01:07:08] [INFO ] Dead Transitions using invariants and state equation in 2358 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 223/223 places, 8587/8587 transitions.
Ensure Unique test removed 8058 transitions
Reduce isomorphic transitions removed 8058 transitions.
Iterating post reduction 0 with 8058 rules applied. Total rules applied 8058 place count 223 transition count 529
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8060 place count 223 transition count 527
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 8062 place count 221 transition count 527
Applied a total of 8062 rules in 18 ms. Remains 221 /223 variables (removed 2) and now considering 527/8587 (removed 8060) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 527 rows 221 cols
[2022-05-15 01:07:08] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 01:07:09] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 01:07:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 01:07:09] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 01:07:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 01:07:09] [INFO ] After 220ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 01:07:09] [INFO ] After 416ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2022-05-15 01:07:09] [INFO ] After 821ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 01:07:09] [INFO ] Flatten gal took : 17 ms
[2022-05-15 01:07:09] [INFO ] Flatten gal took : 17 ms
[2022-05-15 01:07:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13238789168324004666.gal : 3 ms
[2022-05-15 01:07:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2299218348422296414.prop : 119 ms
Invoking ITS tools like this :cd /tmp/redAtoms14729867454600884468;'/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/ReachabilityCardinality13238789168324004666.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2299218348422296414.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/ReachabilityCardinality2299218348422296414.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 29
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :29 after 53
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :53 after 101
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :101 after 181
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :181 after 1010
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1010 after 3010
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3010 after 16664
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :16664 after 86944
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :86944 after 615296
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :615296 after 5.6009e+06
Reachability property apf5 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 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,5.50539e+07,13.0327,244576,2,58216,19,802417,6,0,1418,381528,0
Total reachable state count : 55053914
Verifying 1 reachability properties.
Reachability property apf5 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf5,3240,13.6365,244576,2,707,19,802417,7,0,1584,381528,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p2)), (F (AND p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F p2)]
Knowledge based reduction with 7 factoid took 484 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 158 ms :[p2, p2, (AND p1 p2 (NOT p0)), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 155 ms :[p2, p2, (AND p1 p2 (NOT p0)), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 147 ms :[p2, p2, (AND p1 p2 (NOT p0)), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 27844 reset in 1814 ms.
Product exploration explored 100000 steps with 28101 reset in 1818 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 255 ms :[p2, p2, (AND p1 p2 (NOT p0)), (AND (NOT p0) p2)]
Support contains 7 out of 223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 223/223 places, 8587/8587 transitions.
Applied a total of 0 rules in 2837 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2022-05-15 01:07:31] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:07:31] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 01:07:34] [INFO ] Dead Transitions using invariants and state equation in 2508 ms found 0 transitions.
[2022-05-15 01:07:34] [INFO ] Redundant transitions in 886 ms returned []
[2022-05-15 01:07:34] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:07:34] [INFO ] Computed 5 place invariants in 10 ms
[2022-05-15 01:07:37] [INFO ] Dead Transitions using invariants and state equation in 2437 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 223/223 places, 8587/8587 transitions.
Product exploration explored 100000 steps with 28095 reset in 5615 ms.
Product exploration explored 100000 steps with 27942 reset in 5583 ms.
Built C files in :
/tmp/ltsmin16504498311440367537
[2022-05-15 01:07:48] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16504498311440367537
Running compilation step : cd /tmp/ltsmin16504498311440367537;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16504498311440367537;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16504498311440367537;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 7 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 8587/8587 transitions.
Applied a total of 0 rules in 50 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2022-05-15 01:07:51] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:07:51] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 01:07:54] [INFO ] Dead Transitions using invariants and state equation in 2339 ms found 0 transitions.
[2022-05-15 01:07:54] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:07:54] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:07:54] [INFO ] Implicit Places using invariants in 893 ms returned []
[2022-05-15 01:07:54] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:07:54] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:07:55] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 01:07:57] [INFO ] Implicit Places using invariants and state equation in 2752 ms returned []
Implicit Place search using SMT with State Equation took 3650 ms to find 0 implicit places.
[2022-05-15 01:07:57] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 223 cols
[2022-05-15 01:07:57] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:08:00] [INFO ] Dead Transitions using invariants and state equation in 2423 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 223/223 places, 8587/8587 transitions.
Built C files in :
/tmp/ltsmin7215423731874117874
[2022-05-15 01:08:00] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7215423731874117874
Running compilation step : cd /tmp/ltsmin7215423731874117874;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7215423731874117874;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7215423731874117874;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 01:08:03] [INFO ] Flatten gal took : 277 ms
[2022-05-15 01:08:04] [INFO ] Flatten gal took : 284 ms
[2022-05-15 01:08:04] [INFO ] Time to serialize gal into /tmp/LTL314687664775740030.gal : 36 ms
[2022-05-15 01:08:04] [INFO ] Time to serialize properties into /tmp/LTL16717963163366282496.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL314687664775740030.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16717963163366282496.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3146876...266
Read 1 LTL properties
Checking formula 0 : !((F(X(!(((!(F("((CHOIX_0+CHOIX_1)>=1)")))U("(CAPACITE_0<=(VIDANGE_0+VIDANGE_1))"))U("((CONTROLEUR_0+CONTROLEUR_1)>(VIDANGE_0+VIDANGE_...165
Formula 0 simplified : !FX!((!F"((CHOIX_0+CHOIX_1)>=1)" U "(CAPACITE_0<=(VIDANGE_0+VIDANGE_1))") U "((CONTROLEUR_0+CONTROLEUR_1)>(VIDANGE_0+VIDANGE_1))")
Detected timeout of ITS tools.
[2022-05-15 01:08:19] [INFO ] Flatten gal took : 277 ms
[2022-05-15 01:08:19] [INFO ] Applying decomposition
[2022-05-15 01:08:19] [INFO ] Flatten gal took : 285 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/graph18420230846178185072.txt' '-o' '/tmp/graph18420230846178185072.bin' '-w' '/tmp/graph18420230846178185072.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18420230846178185072.bin' '-l' '-1' '-v' '-w' '/tmp/graph18420230846178185072.weights' '-q' '0' '-e' '0.001'
[2022-05-15 01:08:20] [INFO ] Decomposing Gal with order
[2022-05-15 01:08:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 01:09:45] [INFO ] Removed a total of 8725 redundant transitions.
[2022-05-15 01:09:45] [INFO ] Flatten gal took : 85166 ms
[2022-05-15 01:09:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 8370 labels/synchronizations in 1060 ms.
[2022-05-15 01:09:47] [INFO ] Time to serialize gal into /tmp/LTL3905006211350346410.gal : 124 ms
[2022-05-15 01:09:47] [INFO ] Time to serialize properties into /tmp/LTL7548458315692267941.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3905006211350346410.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7548458315692267941.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3905006...266
Read 1 LTL properties
Checking formula 0 : !((F(X(!(((!(F("((gu0.CHOIX_0+gu0.CHOIX_1)>=1)")))U("(gu2.CAPACITE_0<=(gu2.VIDANGE_0+gu2.VIDANGE_1))"))U("((gu2.CONTROLEUR_0+gu2.CONTR...201
Formula 0 simplified : !FX!((!F"((gu0.CHOIX_0+gu0.CHOIX_1)>=1)" U "(gu2.CAPACITE_0<=(gu2.VIDANGE_0+gu2.VIDANGE_1))") U "((gu2.CONTROLEUR_0+gu2.CONTROLEUR_1...189
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin833231954013544907
[2022-05-15 01:10:02] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin833231954013544907
Running compilation step : cd /tmp/ltsmin833231954013544907;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin833231954013544907;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin833231954013544907;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-COL-V80P50N50-LTLCardinality-11 finished in 266485 ms.
[2022-05-15 01:10:06] [INFO ] Flatten gal took : 322 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16691208393263175024
[2022-05-15 01:10:06] [INFO ] Too many transitions (8588) to apply POR reductions. Disabling POR matrices.
[2022-05-15 01:10:06] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16691208393263175024
Running compilation step : cd /tmp/ltsmin16691208393263175024;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-15 01:10:06] [INFO ] Applying decomposition
[2022-05-15 01:10:06] [INFO ] Flatten gal took : 252 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/graph15132891419460869446.txt' '-o' '/tmp/graph15132891419460869446.bin' '-w' '/tmp/graph15132891419460869446.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15132891419460869446.bin' '-l' '-1' '-v' '-w' '/tmp/graph15132891419460869446.weights' '-q' '0' '-e' '0.001'
[2022-05-15 01:10:07] [INFO ] Decomposing Gal with order
[2022-05-15 01:10:07] [INFO ] Rewriting arrays to variables to allow decomposition.
Compilation finished in 45414 ms.
Running link step : cd /tmp/ltsmin16691208393263175024;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 94 ms.
Running LTSmin : cd /tmp/ltsmin16691208393263175024;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(((<>((LTLAPp0==true))||(LTLAPp1==true)) U []((LTLAPp2==true)))&&[](<>((LTLAPp1==true))))' '--buchi-type=spotba'
[2022-05-15 01:11:27] [INFO ] Removed a total of 17286 redundant transitions.
[2022-05-15 01:11:29] [INFO ] Flatten gal took : 81312 ms
[2022-05-15 01:11:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 16985 labels/synchronizations in 4950 ms.
[2022-05-15 01:11:37] [INFO ] Time to serialize gal into /tmp/LTLCardinality9085327285720884169.gal : 39 ms
[2022-05-15 01:11:37] [INFO ] Time to serialize properties into /tmp/LTLCardinality9361096039870608678.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9085327285720884169.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9361096039870608678.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 3 LTL properties
Checking formula 0 : !(((((F("(gi2.gu0.ATTENTE_A_0<=1)"))||("(gu4.ROUTE_B_0<=(gu4.VIDANGE_0+gu4.VIDANGE_1))"))U(G("(gi2.gu3.ATTENTE_B_0<=1)")))&&(G(F("(gu4...203
Formula 0 simplified : !((("(gu4.ROUTE_B_0<=(gu4.VIDANGE_0+gu4.VIDANGE_1))" | F"(gi2.gu0.ATTENTE_A_0<=1)") U G"(gi2.gu3.ATTENTE_B_0<=1)") & GF"(gu4.ROUTE_B...191
LTSmin failed to check property BridgeAndVehicles-COL-V80P50N50-LTLCardinality-06 due to out of memory issue (code 137).
Running LTSmin : cd /tmp/ltsmin16691208393263175024;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](<>((LTLAPp3==true))))' '--buchi-type=spotba'
LTSmin failed to check property BridgeAndVehicles-COL-V80P50N50-LTLCardinality-07 due to out of memory issue (code 137).
Running LTSmin : cd /tmp/ltsmin16691208393263175024;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(!((!<>((LTLAPp4==true)) U (LTLAPp5==true)) U (LTLAPp6==true))))' '--buchi-type=spotba'
LTSmin run took 13050 ms.
FORMULA BridgeAndVehicles-COL-V80P50N50-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin16691208393263175024;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(((<>((LTLAPp0==true))||(LTLAPp1==true)) U []((LTLAPp2==true)))&&[](<>((LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin failed to check property BridgeAndVehicles-COL-V80P50N50-LTLCardinality-06 due to out of memory issue (code 137).
Running LTSmin : cd /tmp/ltsmin16691208393263175024;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](<>((LTLAPp3==true))))' '--buchi-type=spotba'
LTSmin failed to check property BridgeAndVehicles-COL-V80P50N50-LTLCardinality-07 due to out of memory issue (code 137).
Detected timeout of ITS tools.
[2022-05-15 01:36:43] [INFO ] Applying decomposition
[2022-05-15 01:36:45] [INFO ] Flatten gal took : 1545 ms
[2022-05-15 01:36:45] [INFO ] Decomposing Gal with order
[2022-05-15 01:36:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 01:36:50] [INFO ] Removed a total of 50110 redundant transitions.
[2022-05-15 01:36:51] [INFO ] Flatten gal took : 3904 ms
[2022-05-15 01:36:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 416 ms.
[2022-05-15 01:36:52] [INFO ] Time to serialize gal into /tmp/LTLCardinality9365614872711062849.gal : 124 ms
[2022-05-15 01:36:52] [INFO ] Time to serialize properties into /tmp/LTLCardinality17270080708885798260.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9365614872711062849.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17270080708885798260.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 2 LTL properties
Checking formula 0 : !(((((F("(gATTENTE_A.ATTENTE_A_0<=1)"))||("(gROUTE_B.ROUTE_B_0<=(gsens0.VIDANGE_0+gsens1.VIDANGE_1))"))U(G("(gATTENTE_B.ATTENTE_B_0<=1...231
Formula 0 simplified : !((("(gROUTE_B.ROUTE_B_0<=(gsens0.VIDANGE_0+gsens1.VIDANGE_1))" | F"(gATTENTE_A.ATTENTE_A_0<=1)") U G"(gATTENTE_B.ATTENTE_B_0<=1)") ...219
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V80P50N50"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-COL-V80P50N50, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918100155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V80P50N50.tgz
mv BridgeAndVehicles-COL-V80P50N50 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;