About the Execution of ITS-Tools for BridgeAndVehicles-PT-V20P10N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4503.911 | 582329.00 | 1722912.00 | 2624.70 | TTTFTFFTFFTTTFTT | 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-165251918200180.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-PT-V20P10N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918200180
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 11K Apr 29 22:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 22:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 73K Apr 29 22:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 320K Apr 29 22:44 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.7K May 9 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 43K May 9 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 137K May 9 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.6K May 9 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K May 9 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 434K 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-PT-V20P10N10-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652579720664
Running Version 202205111006
[2022-05-15 01:55:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 01:55:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 01:55:22] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2022-05-15 01:55:22] [INFO ] Transformed 68 places.
[2022-05-15 01:55:22] [INFO ] Transformed 548 transitions.
[2022-05-15 01:55:22] [INFO ] Parsed PT model containing 68 places and 548 transitions in 239 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 548
Applied a total of 2 rules in 22 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2022-05-15 01:55:22] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 01:55:22] [INFO ] Computed 5 place invariants in 14 ms
[2022-05-15 01:55:22] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
[2022-05-15 01:55:22] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 01:55:22] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-15 01:55:22] [INFO ] Implicit Places using invariants in 44 ms returned []
[2022-05-15 01:55:22] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 01:55:22] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-15 01:55:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:55:22] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2022-05-15 01:55:22] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 01:55:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:55:23] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 66/68 places, 548/548 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/68 places, 548/548 transitions.
Support contains 66 out of 66 places after structural reductions.
[2022-05-15 01:55:23] [INFO ] Flatten gal took : 82 ms
[2022-05-15 01:55:23] [INFO ] Flatten gal took : 73 ms
[2022-05-15 01:55:23] [INFO ] Input system was already deterministic with 548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 25) seen :23
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-15 01:55:24] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 01:55:24] [INFO ] Computed 5 place invariants in 10 ms
[2022-05-15 01:55:24] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2022-05-15 01:55:24] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-15 01:55:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 01:55:24] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-15 01:55:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:55:24] [INFO ] After 19ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2022-05-15 01:55:24] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-05-15 01:55:24] [INFO ] After 167ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 66/66 places, 548/548 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 547
Applied a total of 2 rules in 77 ms. Remains 65 /66 variables (removed 1) and now considering 547/548 (removed 1) transitions.
[2022-05-15 01:55:24] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:55:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:55:24] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/66 places, 547/548 transitions.
Incomplete random walk after 10000 steps, including 65 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 897589 steps, run timeout after 3001 ms. (steps per millisecond=299 ) properties seen :{}
Probabilistic random walk after 897589 steps, saw 219692 distinct states, run finished after 3007 ms. (steps per millisecond=298 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 01:55:27] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:55:27] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 01:55:27] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-15 01:55:27] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 01:55:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 01:55:27] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 01:55:27] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:55:27] [INFO ] After 17ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 01:55:27] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2022-05-15 01:55:27] [INFO ] After 138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 65/65 places, 547/547 transitions.
Applied a total of 0 rules in 34 ms. Remains 65 /65 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 547/547 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 65/65 places, 547/547 transitions.
Applied a total of 0 rules in 30 ms. Remains 65 /65 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 01:55:27] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:55:27] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:55:28] [INFO ] Implicit Places using invariants in 118 ms returned []
[2022-05-15 01:55:28] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:55:28] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:55:28] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:55:28] [INFO ] Implicit Places using invariants and state equation in 256 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 381 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 63/65 places, 547/547 transitions.
Applied a total of 0 rules in 27 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 63/65 places, 547/547 transitions.
Incomplete random walk after 10000 steps, including 64 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 952497 steps, run timeout after 3001 ms. (steps per millisecond=317 ) properties seen :{}
Probabilistic random walk after 952497 steps, saw 232032 distinct states, run finished after 3001 ms. (steps per millisecond=317 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 01:55:31] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 01:55:31] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 01:55:31] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 01:55:31] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 01:55:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 01:55:31] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 01:55:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:55:31] [INFO ] After 25ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 01:55:31] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-05-15 01:55:31] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 53 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 547/547 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 18 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 01:55:31] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 01:55:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:55:32] [INFO ] Implicit Places using invariants in 492 ms returned []
[2022-05-15 01:55:32] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 01:55:32] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:55:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:55:32] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
[2022-05-15 01:55:32] [INFO ] Redundant transitions in 43 ms returned []
[2022-05-15 01:55:32] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 01:55:32] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:55:32] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 547/547 transitions.
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 63 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 420 place count 62 transition count 128
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 422 place count 62 transition count 126
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 424 place count 60 transition count 126
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 425 place count 60 transition count 126
Applied a total of 425 rules in 22 ms. Remains 60 /63 variables (removed 3) and now considering 126/547 (removed 421) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 126 rows 60 cols
[2022-05-15 01:55:32] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:55:33] [INFO ] [Real]Absence check using 5 positive place invariants in 39 ms returned sat
[2022-05-15 01:55:33] [INFO ] After 534ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 01:55:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 01:55:33] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 01:55:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-15 01:55:33] [INFO ] After 16ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 01:55:33] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2022-05-15 01:55:33] [INFO ] After 141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-15 01:55:33] [INFO ] Flatten gal took : 9 ms
[2022-05-15 01:55:33] [INFO ] Flatten gal took : 7 ms
[2022-05-15 01:55:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18237896703152982074.gal : 10 ms
[2022-05-15 01:55:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6759281940058785773.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms8266935229802260203;'/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/ReachabilityCardinality18237896703152982074.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6759281940058785773.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/ReachabilityCardinality6759281940058785773.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 15
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :15 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 43
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :43 after 258
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :258 after 6407
Reachability property AtomicPropp20 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,29571,0.048251,4400,2,349,13,3295,6,0,373,2104,0
Total reachable state count : 29571
Verifying 1 reachability properties.
Reachability property AtomicPropp20 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
AtomicPropp20,215,0.05328,4824,2,171,13,3295,7,0,379,2104,0
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 49 stabilizing places and 84 stable transitions
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)||X(p2)))'
Support contains 23 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 548/548 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 01:55:34] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 01:55:34] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:55:34] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
[2022-05-15 01:55:34] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 01:55:34] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:55:34] [INFO ] Implicit Places using invariants in 92 ms returned []
[2022-05-15 01:55:34] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 01:55:34] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 01:55:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:55:34] [INFO ] Implicit Places using invariants and state equation in 220 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 337 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/66 places, 548/548 transitions.
Applied a total of 0 rules in 4 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 64/66 places, 548/548 transitions.
Stuttering acceptance computed with spot in 361 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(GEQ s22 1), p2:(OR (AND (GEQ s30 1) (GEQ s52 1)) (AND (GEQ s35 1) (GEQ s52 1)) (AND (GEQ s37 1) (GEQ s52 1)) (AND (GEQ s42 1) (GEQ s52 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 527 ms.
Product exploration explored 100000 steps with 50000 reset in 455 ms.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/64 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p2))))
Knowledge based reduction with 10 factoid took 217 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLFireability-02 finished in 2251 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(F(G(X(p1)))&&F(p2))))'
Support contains 37 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 548/548 transitions.
Applied a total of 0 rules in 74 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 01:55:36] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 01:55:36] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:55:36] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
[2022-05-15 01:55:36] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 01:55:36] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:55:36] [INFO ] Implicit Places using invariants in 74 ms returned []
[2022-05-15 01:55:36] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 01:55:36] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 01:55:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:55:37] [INFO ] Implicit Places using invariants and state equation in 188 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 279 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/66 places, 548/548 transitions.
Applied a total of 0 rules in 19 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 64/66 places, 548/548 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s49 1), p2:(OR (AND (GEQ s23 10) (GEQ s51 1)) (AND (GEQ s23 10) (GEQ s50 1))), p1:(AND (OR (LT s1 1) (LT s24 1) (LT s31 1) (LT s56 1)) (OR (LT s1 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1825 reset in 1077 ms.
Product exploration explored 100000 steps with 1824 reset in 1125 ms.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/64 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 433 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
Finished random walk after 713 steps, including 4 resets, run visited all 3 properties in 22 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 405 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 98 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 156 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
[2022-05-15 01:55:40] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 01:55:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:55:40] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 01:55:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 01:55:41] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2022-05-15 01:55:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 01:55:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 01:55:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 01:55:41] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-05-15 01:55:41] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:55:41] [INFO ] [Nat]Added 22 Read/Feed constraints in 26 ms returned sat
[2022-05-15 01:55:41] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
[2022-05-15 01:55:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2022-05-15 01:55:41] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 26 ms.
[2022-05-15 01:55:41] [INFO ] Added : 10 causal constraints over 4 iterations in 132 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 37 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 01:55:41] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 01:55:41] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:55:41] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
[2022-05-15 01:55:41] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 01:55:41] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:55:41] [INFO ] Implicit Places using invariants in 85 ms returned []
[2022-05-15 01:55:41] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 01:55:41] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:55:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:55:42] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2022-05-15 01:55:42] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 01:55:42] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:55:42] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 548/548 transitions.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/64 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p0))), (X (X (AND (NOT p2) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 279 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
Finished random walk after 14 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p0))), (X (X (AND (NOT p2) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 339 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 124 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
[2022-05-15 01:55:43] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 01:55:43] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:55:43] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 01:55:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 01:55:43] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2022-05-15 01:55:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 01:55:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 01:55:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 01:55:43] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-05-15 01:55:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:55:43] [INFO ] [Nat]Added 22 Read/Feed constraints in 28 ms returned sat
[2022-05-15 01:55:43] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 0 ms to minimize.
[2022-05-15 01:55:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2022-05-15 01:55:43] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 37 ms.
[2022-05-15 01:55:43] [INFO ] Added : 10 causal constraints over 4 iterations in 107 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 101 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1840 reset in 1027 ms.
Product exploration explored 100000 steps with 1827 reset in 1010 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 124 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 37 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 19 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 01:55:46] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 01:55:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:55:46] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
[2022-05-15 01:55:46] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-15 01:55:46] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 01:55:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:55:46] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 548/548 transitions.
Product exploration explored 100000 steps with 1848 reset in 1128 ms.
Product exploration explored 100000 steps with 1787 reset in 1067 ms.
Built C files in :
/tmp/ltsmin5059629316385454858
[2022-05-15 01:55:49] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5059629316385454858
Running compilation step : cd /tmp/ltsmin5059629316385454858;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1124 ms.
Running link step : cd /tmp/ltsmin5059629316385454858;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin5059629316385454858;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased170123001126245228.hoa' '--buchi-type=spotba'
LTSmin run took 7897 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLFireability-04 finished in 22005 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||(X(p2)&&p1)||p0)))'
Support contains 28 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 548/548 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 547
Applied a total of 2 rules in 18 ms. Remains 65 /66 variables (removed 1) and now considering 547/548 (removed 1) transitions.
[2022-05-15 01:55:58] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:55:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:55:58] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
[2022-05-15 01:55:58] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:55:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:55:58] [INFO ] Implicit Places using invariants in 68 ms returned []
[2022-05-15 01:55:58] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:55:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:55:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:55:58] [INFO ] Implicit Places using invariants and state equation in 179 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 251 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/66 places, 547/548 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 64/66 places, 547/548 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s49 1) (GEQ s63 1)) (AND (GEQ s48 1) (GEQ s63 1))), p1:(OR (AND (GEQ s30 1) (GEQ s52 1)) (AND (GEQ s35 1) (GEQ s52 1)) (AND (GEQ s37 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 78 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLFireability-05 finished in 634 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(X((F(!p0) U G(p1))))) U !p1)))'
Support contains 12 out of 66 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 548/548 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 63 transition count 546
Applied a total of 5 rules in 40 ms. Remains 63 /66 variables (removed 3) and now considering 546/548 (removed 2) transitions.
[2022-05-15 01:55:58] [INFO ] Flow matrix only has 128 transitions (discarded 418 similar events)
// Phase 1: matrix 128 rows 63 cols
[2022-05-15 01:55:58] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-15 01:55:59] [INFO ] Implicit Places using invariants in 93 ms returned []
[2022-05-15 01:55:59] [INFO ] Flow matrix only has 128 transitions (discarded 418 similar events)
// Phase 1: matrix 128 rows 63 cols
[2022-05-15 01:55:59] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 01:55:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:55:59] [INFO ] Implicit Places using invariants and state equation in 153 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 252 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/66 places, 546/548 transitions.
Applied a total of 0 rules in 24 ms. Remains 61 /61 variables (removed 0) and now considering 546/546 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 61/66 places, 546/548 transitions.
Stuttering acceptance computed with spot in 57 ms :[p1, true]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s45 1) (GEQ s59 1)) (AND (GEQ s45 1) (GEQ s57 1)) (AND (GEQ s45 1) (GEQ s58 1)) (AND (GEQ s45 1) (GEQ s55 1)) (AND (GEQ s45 1) (GEQ s56 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLFireability-06 finished in 393 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 23 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 548/548 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 547
Applied a total of 2 rules in 5 ms. Remains 65 /66 variables (removed 1) and now considering 547/548 (removed 1) transitions.
[2022-05-15 01:55:59] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:55:59] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:55:59] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
[2022-05-15 01:55:59] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:55:59] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:55:59] [INFO ] Implicit Places using invariants in 81 ms returned []
[2022-05-15 01:55:59] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:55:59] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:55:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:55:59] [INFO ] Implicit Places using invariants and state equation in 210 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 318 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/66 places, 547/548 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 64/66 places, 547/548 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s19 1) (GEQ s22 1) (GEQ s24 1) (GEQ s25 1)) (AND (GEQ s18 1) (GEQ s22 1) (GEQ s24 1) (GEQ s25 1)) (AND (GEQ s9 1) (GEQ s22 1) (GEQ s24 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 6175 reset in 320 ms.
Product exploration explored 100000 steps with 6063 reset in 315 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 78 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=39 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2022-05-15 01:56:01] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:56:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:56:01] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 01:56:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 01:56:01] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2022-05-15 01:56:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 01:56:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 01:56:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 01:56:01] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-05-15 01:56:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:56:01] [INFO ] [Nat]Added 22 Read/Feed constraints in 328 ms returned sat
[2022-05-15 01:56:01] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 24 ms.
[2022-05-15 01:56:01] [INFO ] Added : 1 causal constraints over 1 iterations in 74 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 23 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 21 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 01:56:02] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:56:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:56:02] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
[2022-05-15 01:56:02] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:56:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:56:02] [INFO ] Implicit Places using invariants in 77 ms returned []
[2022-05-15 01:56:02] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:56:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:56:02] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:56:02] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2022-05-15 01:56:02] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-15 01:56:02] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:56:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:56:02] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 547/547 transitions.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2022-05-15 01:56:02] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:56:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:56:03] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 01:56:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 01:56:03] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-05-15 01:56:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 01:56:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 01:56:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 01:56:03] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-05-15 01:56:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:56:03] [INFO ] [Nat]Added 22 Read/Feed constraints in 313 ms returned sat
[2022-05-15 01:56:03] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 17 ms.
[2022-05-15 01:56:03] [INFO ] Added : 1 causal constraints over 1 iterations in 71 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6012 reset in 317 ms.
Product exploration explored 100000 steps with 6353 reset in 327 ms.
Built C files in :
/tmp/ltsmin12365350247748424153
[2022-05-15 01:56:04] [INFO ] Computing symmetric may disable matrix : 547 transitions.
[2022-05-15 01:56:04] [INFO ] Computation of Complete disable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:56:04] [INFO ] Computing symmetric may enable matrix : 547 transitions.
[2022-05-15 01:56:04] [INFO ] Computation of Complete enable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:56:04] [INFO ] Computing Do-Not-Accords matrix : 547 transitions.
[2022-05-15 01:56:04] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:56:04] [INFO ] Built C files in 145ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12365350247748424153
Running compilation step : cd /tmp/ltsmin12365350247748424153;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1659 ms.
Running link step : cd /tmp/ltsmin12365350247748424153;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin12365350247748424153;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9545456020113655946.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 23 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 23 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 01:56:19] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:56:19] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:56:19] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
[2022-05-15 01:56:19] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:56:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:56:19] [INFO ] Implicit Places using invariants in 86 ms returned []
[2022-05-15 01:56:19] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:56:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:56:19] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:56:20] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2022-05-15 01:56:20] [INFO ] Redundant transitions in 4 ms returned []
[2022-05-15 01:56:20] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:56:20] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:56:20] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 547/547 transitions.
Built C files in :
/tmp/ltsmin15751951042158638952
[2022-05-15 01:56:20] [INFO ] Computing symmetric may disable matrix : 547 transitions.
[2022-05-15 01:56:20] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:56:20] [INFO ] Computing symmetric may enable matrix : 547 transitions.
[2022-05-15 01:56:20] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:56:20] [INFO ] Computing Do-Not-Accords matrix : 547 transitions.
[2022-05-15 01:56:20] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:56:20] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15751951042158638952
Running compilation step : cd /tmp/ltsmin15751951042158638952;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1598 ms.
Running link step : cd /tmp/ltsmin15751951042158638952;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin15751951042158638952;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11468726664495106100.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 01:56:35] [INFO ] Flatten gal took : 34 ms
[2022-05-15 01:56:35] [INFO ] Flatten gal took : 27 ms
[2022-05-15 01:56:35] [INFO ] Time to serialize gal into /tmp/LTL3874563780336713494.gal : 6 ms
[2022-05-15 01:56:35] [INFO ] Time to serialize properties into /tmp/LTL14374834107211354659.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/LTL3874563780336713494.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14374834107211354659.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/LTL3874563...267
Read 1 LTL properties
Checking formula 0 : !((X(F("((((((((NB_ATTENTE_A_18>=1)&&(ATTENTE_A>=1))&&((CAPACITE>=1)&&(CONTROLEUR_1>=1)))||(((NB_ATTENTE_A_17>=1)&&(ATTENTE_A>=1))&&((...1621
Formula 0 simplified : !XF"((((((((NB_ATTENTE_A_18>=1)&&(ATTENTE_A>=1))&&((CAPACITE>=1)&&(CONTROLEUR_1>=1)))||(((NB_ATTENTE_A_17>=1)&&(ATTENTE_A>=1))&&((CA...1615
Detected timeout of ITS tools.
[2022-05-15 01:56:50] [INFO ] Flatten gal took : 25 ms
[2022-05-15 01:56:50] [INFO ] Applying decomposition
[2022-05-15 01:56:50] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2545440442427915791.txt' '-o' '/tmp/graph2545440442427915791.bin' '-w' '/tmp/graph2545440442427915791.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2545440442427915791.bin' '-l' '-1' '-v' '-w' '/tmp/graph2545440442427915791.weights' '-q' '0' '-e' '0.001'
[2022-05-15 01:56:50] [INFO ] Decomposing Gal with order
[2022-05-15 01:56:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 01:56:51] [INFO ] Removed a total of 1059 redundant transitions.
[2022-05-15 01:56:51] [INFO ] Flatten gal took : 425 ms
[2022-05-15 01:56:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 180 labels/synchronizations in 27 ms.
[2022-05-15 01:56:51] [INFO ] Time to serialize gal into /tmp/LTL4711283863397929558.gal : 2 ms
[2022-05-15 01:56:51] [INFO ] Time to serialize properties into /tmp/LTL5677699958880875708.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/LTL4711283863397929558.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5677699958880875708.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/LTL4711283...245
Read 1 LTL properties
Checking formula 0 : !((X(F("((((((((i1.u0.NB_ATTENTE_A_18>=1)&&(i1.u0.ATTENTE_A>=1))&&((u2.CAPACITE>=1)&&(i2.u4.CONTROLEUR_1>=1)))||(((i1.u0.NB_ATTENTE_A_...2041
Formula 0 simplified : !XF"((((((((i1.u0.NB_ATTENTE_A_18>=1)&&(i1.u0.ATTENTE_A>=1))&&((u2.CAPACITE>=1)&&(i2.u4.CONTROLEUR_1>=1)))||(((i1.u0.NB_ATTENTE_A_17...2035
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4916420892867467464
[2022-05-15 01:57:06] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4916420892867467464
Running compilation step : cd /tmp/ltsmin4916420892867467464;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 933 ms.
Running link step : cd /tmp/ltsmin4916420892867467464;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4916420892867467464;'/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(<>((LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 1375 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLFireability-07 finished in 69595 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 548/548 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 63 transition count 546
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 62 transition count 545
Applied a total of 7 rules in 38 ms. Remains 62 /66 variables (removed 4) and now considering 545/548 (removed 3) transitions.
[2022-05-15 01:57:08] [INFO ] Flow matrix only has 127 transitions (discarded 418 similar events)
// Phase 1: matrix 127 rows 62 cols
[2022-05-15 01:57:08] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 01:57:09] [INFO ] Implicit Places using invariants in 109 ms returned []
[2022-05-15 01:57:09] [INFO ] Flow matrix only has 127 transitions (discarded 418 similar events)
// Phase 1: matrix 127 rows 62 cols
[2022-05-15 01:57:09] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 01:57:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:57:09] [INFO ] Implicit Places using invariants and state equation in 207 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 319 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/66 places, 545/548 transitions.
Applied a total of 0 rules in 20 ms. Remains 60 /60 variables (removed 0) and now considering 545/545 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 60/66 places, 545/548 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s46 1) (GEQ s59 1)) (AND (GEQ s0 1) (GEQ s13 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1695 reset in 223 ms.
Product exploration explored 100000 steps with 1703 reset in 217 ms.
Computed a total of 44 stabilizing places and 82 stable transitions
Computed a total of 44 stabilizing places and 82 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Finished random walk after 34 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=17 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
[2022-05-15 01:57:10] [INFO ] Flow matrix only has 127 transitions (discarded 418 similar events)
// Phase 1: matrix 127 rows 60 cols
[2022-05-15 01:57:10] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 01:57:10] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-15 01:57:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 01:57:10] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2022-05-15 01:57:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 01:57:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 01:57:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 01:57:10] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-05-15 01:57:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:57:10] [INFO ] [Nat]Added 22 Read/Feed constraints in 5 ms returned sat
[2022-05-15 01:57:10] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 74 transitions) in 15 ms.
[2022-05-15 01:57:10] [INFO ] Added : 19 causal constraints over 7 iterations in 216 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 545/545 transitions.
Applied a total of 0 rules in 20 ms. Remains 60 /60 variables (removed 0) and now considering 545/545 (removed 0) transitions.
[2022-05-15 01:57:10] [INFO ] Flow matrix only has 127 transitions (discarded 418 similar events)
// Phase 1: matrix 127 rows 60 cols
[2022-05-15 01:57:10] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 01:57:10] [INFO ] Implicit Places using invariants in 97 ms returned []
[2022-05-15 01:57:10] [INFO ] Flow matrix only has 127 transitions (discarded 418 similar events)
// Phase 1: matrix 127 rows 60 cols
[2022-05-15 01:57:10] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 01:57:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:57:10] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2022-05-15 01:57:10] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-15 01:57:10] [INFO ] Flow matrix only has 127 transitions (discarded 418 similar events)
// Phase 1: matrix 127 rows 60 cols
[2022-05-15 01:57:10] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 01:57:11] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 545/545 transitions.
Computed a total of 44 stabilizing places and 82 stable transitions
Computed a total of 44 stabilizing places and 82 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 82 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=82 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2022-05-15 01:57:11] [INFO ] Flow matrix only has 127 transitions (discarded 418 similar events)
// Phase 1: matrix 127 rows 60 cols
[2022-05-15 01:57:11] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 01:57:11] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 01:57:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 01:57:11] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-05-15 01:57:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 01:57:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 01:57:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 01:57:11] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-05-15 01:57:11] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:57:11] [INFO ] [Nat]Added 22 Read/Feed constraints in 5 ms returned sat
[2022-05-15 01:57:11] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 74 transitions) in 18 ms.
[2022-05-15 01:57:12] [INFO ] Added : 19 causal constraints over 7 iterations in 224 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1686 reset in 238 ms.
Product exploration explored 100000 steps with 1691 reset in 215 ms.
Built C files in :
/tmp/ltsmin15157331793497821942
[2022-05-15 01:57:12] [INFO ] Computing symmetric may disable matrix : 545 transitions.
[2022-05-15 01:57:12] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:57:12] [INFO ] Computing symmetric may enable matrix : 545 transitions.
[2022-05-15 01:57:12] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:57:12] [INFO ] Computing Do-Not-Accords matrix : 545 transitions.
[2022-05-15 01:57:12] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:57:12] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15157331793497821942
Running compilation step : cd /tmp/ltsmin15157331793497821942;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1601 ms.
Running link step : cd /tmp/ltsmin15157331793497821942;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin15157331793497821942;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1696507231861305349.hoa' '--buchi-type=spotba'
LTSmin run took 1040 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLFireability-08 finished in 6501 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U p1))'
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 548/548 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 547
Applied a total of 2 rules in 6 ms. Remains 65 /66 variables (removed 1) and now considering 547/548 (removed 1) transitions.
[2022-05-15 01:57:15] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:57:15] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:57:15] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
[2022-05-15 01:57:15] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:57:15] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:57:15] [INFO ] Implicit Places using invariants in 95 ms returned []
[2022-05-15 01:57:15] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:57:15] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:57:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:57:15] [INFO ] Implicit Places using invariants and state equation in 226 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 323 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/66 places, 547/548 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 63/66 places, 547/548 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s44 1) (GEQ s51 1)), p1:(AND (GEQ s0 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLFireability-09 finished in 655 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(G(p0))||F(p1)||F(p2)))))'
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 548/548 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 547
Applied a total of 2 rules in 24 ms. Remains 65 /66 variables (removed 1) and now considering 547/548 (removed 1) transitions.
[2022-05-15 01:57:16] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:57:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:57:16] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
[2022-05-15 01:57:16] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:57:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:57:16] [INFO ] Implicit Places using invariants in 89 ms returned []
[2022-05-15 01:57:16] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:57:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:57:16] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:57:16] [INFO ] Implicit Places using invariants and state equation in 234 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 326 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/66 places, 547/548 transitions.
Applied a total of 0 rules in 17 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 64/66 places, 547/548 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s17 1)), p1:(AND (GEQ s49 1) (GEQ s62 1)), p2:(AND (GEQ s10 1) (GEQ s22 1) (GEQ s24 1) (GEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 647 reset in 312 ms.
Product exploration explored 100000 steps with 647 reset in 297 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/64 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 228 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Finished random walk after 62 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=31 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) (NOT p2))), (F (NOT (AND (NOT p1) p0 (NOT p2))))]
Knowledge based reduction with 6 factoid took 779 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 8 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 21 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 01:57:18] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:57:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:57:18] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
[2022-05-15 01:57:18] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:57:18] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 01:57:18] [INFO ] Implicit Places using invariants in 85 ms returned []
[2022-05-15 01:57:18] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:57:18] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:57:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:57:19] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2022-05-15 01:57:19] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-15 01:57:19] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:57:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:57:19] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 547/547 transitions.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/64 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 200 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Finished random walk after 56 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) (NOT p2))), (F (NOT (AND (NOT p1) p0 (NOT p2))))]
Knowledge based reduction with 6 factoid took 229 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 663 reset in 263 ms.
Product exploration explored 100000 steps with 654 reset in 260 ms.
Built C files in :
/tmp/ltsmin12321253872361876650
[2022-05-15 01:57:20] [INFO ] Computing symmetric may disable matrix : 547 transitions.
[2022-05-15 01:57:20] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:57:20] [INFO ] Computing symmetric may enable matrix : 547 transitions.
[2022-05-15 01:57:20] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:57:20] [INFO ] Computing Do-Not-Accords matrix : 547 transitions.
[2022-05-15 01:57:20] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:57:20] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12321253872361876650
Running compilation step : cd /tmp/ltsmin12321253872361876650;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1586 ms.
Running link step : cd /tmp/ltsmin12321253872361876650;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin12321253872361876650;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1937836699780341879.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 29 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 01:57:35] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:57:35] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:57:35] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
[2022-05-15 01:57:35] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:57:35] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:57:35] [INFO ] Implicit Places using invariants in 82 ms returned []
[2022-05-15 01:57:35] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:57:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:57:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:57:36] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2022-05-15 01:57:36] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-15 01:57:36] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:57:36] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:57:36] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 547/547 transitions.
Built C files in :
/tmp/ltsmin2799628193031838885
[2022-05-15 01:57:36] [INFO ] Computing symmetric may disable matrix : 547 transitions.
[2022-05-15 01:57:36] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:57:36] [INFO ] Computing symmetric may enable matrix : 547 transitions.
[2022-05-15 01:57:36] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:57:36] [INFO ] Computing Do-Not-Accords matrix : 547 transitions.
[2022-05-15 01:57:36] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:57:36] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2799628193031838885
Running compilation step : cd /tmp/ltsmin2799628193031838885;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1566 ms.
Running link step : cd /tmp/ltsmin2799628193031838885;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin2799628193031838885;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16901491074875266490.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 01:57:51] [INFO ] Flatten gal took : 57 ms
[2022-05-15 01:57:51] [INFO ] Flatten gal took : 55 ms
[2022-05-15 01:57:51] [INFO ] Time to serialize gal into /tmp/LTL15493538411982213559.gal : 16 ms
[2022-05-15 01:57:51] [INFO ] Time to serialize properties into /tmp/LTL10838170573680441691.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/LTL15493538411982213559.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10838170573680441691.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/LTL1549353...268
Read 1 LTL properties
Checking formula 0 : !((F(G(((X(G("((ROUTE_A<1)||(NB_ATTENTE_A_16<1))")))||(F("((CHOIX_2>=1)&&(COMPTEUR_9>=1))")))||(F("(((NB_ATTENTE_A_9>=1)&&(ATTENTE_A>=...202
Formula 0 simplified : !FG(XG"((ROUTE_A<1)||(NB_ATTENTE_A_16<1))" | F"((CHOIX_2>=1)&&(COMPTEUR_9>=1))" | F"(((NB_ATTENTE_A_9>=1)&&(ATTENTE_A>=1))&&((CAPACI...184
Detected timeout of ITS tools.
[2022-05-15 01:58:06] [INFO ] Flatten gal took : 23 ms
[2022-05-15 01:58:06] [INFO ] Applying decomposition
[2022-05-15 01:58:06] [INFO ] Flatten gal took : 26 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/graph14182746427519288029.txt' '-o' '/tmp/graph14182746427519288029.bin' '-w' '/tmp/graph14182746427519288029.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14182746427519288029.bin' '-l' '-1' '-v' '-w' '/tmp/graph14182746427519288029.weights' '-q' '0' '-e' '0.001'
[2022-05-15 01:58:06] [INFO ] Decomposing Gal with order
[2022-05-15 01:58:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 01:58:06] [INFO ] Removed a total of 992 redundant transitions.
[2022-05-15 01:58:06] [INFO ] Flatten gal took : 116 ms
[2022-05-15 01:58:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 175 labels/synchronizations in 5 ms.
[2022-05-15 01:58:06] [INFO ] Time to serialize gal into /tmp/LTL13920652256543499351.gal : 1 ms
[2022-05-15 01:58:06] [INFO ] Time to serialize properties into /tmp/LTL14713489443114386181.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/LTL13920652256543499351.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14713489443114386181.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/LTL1392065...247
Read 1 LTL properties
Checking formula 0 : !((F(G(((X(G("((i0.u0.ROUTE_A<1)||(i1.u3.NB_ATTENTE_A_16<1))")))||(F("((i0.u1.CHOIX_2>=1)&&(i1.u2.COMPTEUR_9>=1))")))||(F("(((i1.u3.NB...247
Formula 0 simplified : !FG(XG"((i0.u0.ROUTE_A<1)||(i1.u3.NB_ATTENTE_A_16<1))" | F"((i0.u1.CHOIX_2>=1)&&(i1.u2.COMPTEUR_9>=1))" | F"(((i1.u3.NB_ATTENTE_A_9>...229
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin123115088459599223
[2022-05-15 01:58:21] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin123115088459599223
Running compilation step : cd /tmp/ltsmin123115088459599223;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 934 ms.
Running link step : cd /tmp/ltsmin123115088459599223;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin123115088459599223;'/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([]((LTLAPp0==true)))||<>((LTLAPp1==true))||<>((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLFireability-12 finished in 80889 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!(G((X(p0)&&p1)) U !p2))))'
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 548/548 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 547
Applied a total of 2 rules in 22 ms. Remains 65 /66 variables (removed 1) and now considering 547/548 (removed 1) transitions.
[2022-05-15 01:58:36] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:58:36] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:58:37] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
[2022-05-15 01:58:37] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:58:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:58:37] [INFO ] Implicit Places using invariants in 97 ms returned []
[2022-05-15 01:58:37] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:58:37] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:58:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:58:37] [INFO ] Implicit Places using invariants and state equation in 228 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 328 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/66 places, 547/548 transitions.
Applied a total of 0 rules in 17 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 63/66 places, 547/548 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p1 p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s22 1) (GEQ s48 1) (GEQ s55 1)), p1:(GEQ s22 1), p0:(AND (GEQ s48 1) (GEQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 149 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLFireability-13 finished in 734 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(p0)&&p1&&(X(p2)||p3)))))'
Support contains 9 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 548/548 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 547
Applied a total of 2 rules in 3 ms. Remains 65 /66 variables (removed 1) and now considering 547/548 (removed 1) transitions.
[2022-05-15 01:58:37] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:58:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:58:37] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
[2022-05-15 01:58:37] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:58:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:58:37] [INFO ] Implicit Places using invariants in 86 ms returned []
[2022-05-15 01:58:37] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:58:37] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:58:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:58:38] [INFO ] Implicit Places using invariants and state equation in 196 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 284 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/66 places, 547/548 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 64/66 places, 547/548 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p3), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p3), acceptance={0} source=1 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p1 (NOT p0) (NOT p3)) (AND p1 (NOT p3) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(OR (AND p1 (NOT p0) p3) (AND p1 p3 (NOT p2))), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p0) p3), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s23 10) (LT s50 1)), p3:(AND (GEQ s29 1) (GEQ s52 1)), p0:(OR (LT s23 1) (LT s25 1) (LT s37 1) (LT s47 1)), p2:(OR (LT s49 1) (LT s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33357 reset in 338 ms.
Product exploration explored 100000 steps with 33220 reset in 343 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/64 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p3) p0 p2), (X p1), (X (AND p1 (NOT p3))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p1 (NOT p0) p3))), (X (NOT (OR (AND p1 (NOT p0) (NOT p3)) (AND p1 (NOT p3) (NOT p2))))), (X (NOT (AND p1 p3))), (X (NOT (OR (AND p1 (NOT p0) p3) (AND p1 p3 (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (X p1)), (X (X (AND p1 (NOT p3)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p1 (NOT p0) p3)))), (X (X (NOT (OR (AND p1 (NOT p0) (NOT p3)) (AND p1 (NOT p3) (NOT p2)))))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (OR (AND p1 (NOT p0) p3) (AND p1 p3 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 802 ms. Reduced automaton from 4 states, 13 edges and 4 AP to 4 states, 13 edges and 4 AP.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p0)]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-15 01:58:40] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:58:40] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:58:40] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 01:58:40] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2022-05-15 01:58:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 01:58:40] [INFO ] After 24ms 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 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p3) p0 p2), (X p1), (X (AND p1 (NOT p3))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p1 (NOT p0) p3))), (X (NOT (OR (AND p1 (NOT p0) (NOT p3)) (AND p1 (NOT p3) (NOT p2))))), (X (NOT (AND p1 p3))), (X (NOT (OR (AND p1 (NOT p0) p3) (AND p1 p3 (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (X p1)), (X (X (AND p1 (NOT p3)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p1 (NOT p0) p3)))), (X (X (NOT (OR (AND p1 (NOT p0) (NOT p3)) (AND p1 (NOT p3) (NOT p2)))))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (OR (AND p1 (NOT p0) p3) (AND p1 p3 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))))), (G (NOT (AND (NOT p1) (NOT p0)))), (G (NOT (AND p1 p3 (NOT p0))))]
False Knowledge obtained : [(F (OR (AND p1 (NOT p3) (NOT p0)) (AND p1 (NOT p3) (NOT p2)))), (F (OR (AND p1 p3 (NOT p0)) (AND p1 p3 (NOT p2)))), (F (NOT p1)), (F (AND p1 p3)), (F (NOT (AND p1 (NOT p3)))), (F (AND p1 (NOT p3) (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 23 factoid took 1272 ms. Reduced automaton from 4 states, 13 edges and 4 AP to 7 states, 19 edges and 4 AP.
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), false, false, false]
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), false, false, false]
Support contains 9 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 4 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 01:58:42] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:58:42] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:58:42] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
[2022-05-15 01:58:42] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:58:42] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:58:42] [INFO ] Implicit Places using invariants in 94 ms returned []
[2022-05-15 01:58:42] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:58:42] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:58:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:58:43] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2022-05-15 01:58:43] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:58:43] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:58:43] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 547/547 transitions.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/64 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X p1), (X (AND p1 (NOT p3))), (X (NOT (AND p1 p3 p2))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) (NOT p2))))), (X (OR p0 (NOT p3))), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND p1 p3))), (X (AND p0 p1 (NOT p3) p2)), (X (X p1)), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 p3 p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) (NOT p2)))))), (X (X (OR p0 (NOT p3)))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p0 p1 (NOT p3) p2))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 1016 ms. Reduced automaton from 7 states, 19 edges and 4 AP to 7 states, 19 edges and 4 AP.
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), false, false, false]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2022-05-15 01:58:44] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:58:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:58:44] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 01:58:44] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X p1), (X (AND p1 (NOT p3))), (X (NOT (AND p1 p3 p2))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) (NOT p2))))), (X (OR p0 (NOT p3))), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND p1 p3))), (X (AND p0 p1 (NOT p3) p2)), (X (X p1)), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 p3 p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) (NOT p2)))))), (X (X (OR p0 (NOT p3)))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p0 p1 (NOT p3) p2))), (F (OR (G p3) (G (NOT p3)))), (G (OR p0 (NOT p3)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p3) p1 p2))), (F (AND p3 p1)), (F (AND p3 p1 p2)), (F (AND p0 p3 (NOT p2))), (F (NOT (AND (NOT p3) p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p3))), (F (OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) (NOT p2))))]
Knowledge based reduction with 20 factoid took 1243 ms. Reduced automaton from 7 states, 19 edges and 4 AP to 7 states, 19 edges and 4 AP.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), false, (AND p3 (NOT p2) (NOT p0)), (AND p3 p2 (NOT p0) p1)]
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), false, (AND p3 (NOT p2) (NOT p0)), (AND p3 p2 (NOT p0) p1)]
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), false, (AND p3 (NOT p2) (NOT p0)), (AND p3 p2 (NOT p0) p1)]
Product exploration explored 100000 steps with 32740 reset in 331 ms.
Product exploration explored 100000 steps with 32939 reset in 314 ms.
Applying partial POR strategy [false, false, true, true, true, false, true, true]
Stuttering acceptance computed with spot in 332 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), false, (AND p3 (NOT p2) (NOT p0)), (AND p3 p2 (NOT p0) p1), (AND p3 (NOT p2) (NOT p0))]
Support contains 9 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 19 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 01:58:48] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:58:48] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:58:48] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
[2022-05-15 01:58:48] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-15 01:58:48] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:58:48] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 01:58:48] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 547/547 transitions.
Product exploration explored 100000 steps with 32780 reset in 666 ms.
Product exploration explored 100000 steps with 32665 reset in 660 ms.
Built C files in :
/tmp/ltsmin1687363899487233960
[2022-05-15 01:58:49] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1687363899487233960
Running compilation step : cd /tmp/ltsmin1687363899487233960;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 959 ms.
Running link step : cd /tmp/ltsmin1687363899487233960;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1687363899487233960;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5053268777202562622.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 4 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 01:59:04] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:59:04] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-15 01:59:05] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
[2022-05-15 01:59:05] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:59:05] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:59:05] [INFO ] Implicit Places using invariants in 88 ms returned []
[2022-05-15 01:59:05] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:59:05] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:59:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:59:05] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2022-05-15 01:59:05] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:59:05] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:59:05] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 547/547 transitions.
Built C files in :
/tmp/ltsmin17573240972361875730
[2022-05-15 01:59:05] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17573240972361875730
Running compilation step : cd /tmp/ltsmin17573240972361875730;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 925 ms.
Running link step : cd /tmp/ltsmin17573240972361875730;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17573240972361875730;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13315048463924670525.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 01:59:20] [INFO ] Flatten gal took : 20 ms
[2022-05-15 01:59:20] [INFO ] Flatten gal took : 20 ms
[2022-05-15 01:59:20] [INFO ] Time to serialize gal into /tmp/LTL6290256367645894690.gal : 4 ms
[2022-05-15 01:59:21] [INFO ] Time to serialize properties into /tmp/LTL9297458608111947632.ltl : 694 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/LTL6290256367645894690.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9297458608111947632.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/LTL6290256...266
Read 1 LTL properties
Checking formula 0 : !((G(F(((X("(((CAPACITE<1)||(CONTROLEUR_2<1))||((NB_ATTENTE_B_11<1)||(ATTENTE_B<1)))"))&&("((CAPACITE<10)||(VIDANGE_1<1))"))&&((X("((C...230
Formula 0 simplified : !GF("((CAPACITE<10)||(VIDANGE_1<1))" & X"(((CAPACITE<1)||(CONTROLEUR_2<1))||((NB_ATTENTE_B_11<1)||(ATTENTE_B<1)))" & ("((NB_ATTENTE_...215
Detected timeout of ITS tools.
[2022-05-15 01:59:36] [INFO ] Flatten gal took : 22 ms
[2022-05-15 01:59:36] [INFO ] Applying decomposition
[2022-05-15 01:59:36] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2533474090437479573.txt' '-o' '/tmp/graph2533474090437479573.bin' '-w' '/tmp/graph2533474090437479573.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2533474090437479573.bin' '-l' '-1' '-v' '-w' '/tmp/graph2533474090437479573.weights' '-q' '0' '-e' '0.001'
[2022-05-15 01:59:36] [INFO ] Decomposing Gal with order
[2022-05-15 01:59:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 01:59:36] [INFO ] Removed a total of 1211 redundant transitions.
[2022-05-15 01:59:36] [INFO ] Flatten gal took : 74 ms
[2022-05-15 01:59:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 215 labels/synchronizations in 7 ms.
[2022-05-15 01:59:36] [INFO ] Time to serialize gal into /tmp/LTL6201019021095404033.gal : 1 ms
[2022-05-15 01:59:36] [INFO ] Time to serialize properties into /tmp/LTL3164314427223070921.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/LTL6201019021095404033.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3164314427223070921.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/LTL6201019...245
Read 1 LTL properties
Checking formula 0 : !((G(F(((X("(((i1.u0.CAPACITE<1)||(i0.u1.CONTROLEUR_2<1))||((i2.u5.NB_ATTENTE_B_11<1)||(i2.u3.ATTENTE_B<1)))"))&&("((i1.u0.CAPACITE<10...290
Formula 0 simplified : !GF("((i1.u0.CAPACITE<10)||(i0.u1.VIDANGE_1<1))" & X"(((i1.u0.CAPACITE<1)||(i0.u1.CONTROLEUR_2<1))||((i2.u5.NB_ATTENTE_B_11<1)||(i2....275
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3444832792581425614
[2022-05-15 01:59:51] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3444832792581425614
Running compilation step : cd /tmp/ltsmin3444832792581425614;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 959 ms.
Running link step : cd /tmp/ltsmin3444832792581425614;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3444832792581425614;'/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((LTLAPp0==true))&&(LTLAPp1==true)&&(X((LTLAPp2==true))||(LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLFireability-14 finished in 89160 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(G(p0))||F(p1)||F(p2)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(p0)&&p1&&(X(p2)||p3)))))'
Found a CL insensitive property : BridgeAndVehicles-PT-V20P10N10-LTLFireability-14
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p0)]
Support contains 9 out of 66 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 66/66 places, 548/548 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 547
Applied a total of 2 rules in 18 ms. Remains 65 /66 variables (removed 1) and now considering 547/548 (removed 1) transitions.
[2022-05-15 02:00:07] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 02:00:07] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:00:07] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
[2022-05-15 02:00:07] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 02:00:07] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 02:00:07] [INFO ] Implicit Places using invariants in 86 ms returned []
[2022-05-15 02:00:07] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 02:00:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:00:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 02:00:07] [INFO ] Implicit Places using invariants and state equation in 218 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 307 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 64/66 places, 547/548 transitions.
Applied a total of 0 rules in 7 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 64/66 places, 547/548 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p3), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p3), acceptance={0} source=1 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p1 (NOT p0) (NOT p3)) (AND p1 (NOT p3) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(OR (AND p1 (NOT p0) p3) (AND p1 p3 (NOT p2))), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p0) p3), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s23 10) (LT s50 1)), p3:(AND (GEQ s29 1) (GEQ s52 1)), p0:(OR (LT s23 1) (LT s25 1) (LT s37 1) (LT s47 1)), p2:(OR (LT s49 1) (LT s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33357 reset in 345 ms.
Product exploration explored 100000 steps with 33336 reset in 345 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/64 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p3) p0 p2), (X p1), (X (AND p1 (NOT p3))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p1 (NOT p0) p3))), (X (NOT (OR (AND p1 (NOT p0) (NOT p3)) (AND p1 (NOT p3) (NOT p2))))), (X (NOT (AND p1 p3))), (X (NOT (OR (AND p1 (NOT p0) p3) (AND p1 p3 (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (X p1)), (X (X (AND p1 (NOT p3)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p1 (NOT p0) p3)))), (X (X (NOT (OR (AND p1 (NOT p0) (NOT p3)) (AND p1 (NOT p3) (NOT p2)))))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (OR (AND p1 (NOT p0) p3) (AND p1 p3 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 925 ms. Reduced automaton from 4 states, 13 edges and 4 AP to 4 states, 13 edges and 4 AP.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p0)]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-15 02:00:10] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 02:00:10] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 02:00:10] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 02:00:10] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2022-05-15 02:00:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 02:00:10] [INFO ] After 26ms 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 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p3) p0 p2), (X p1), (X (AND p1 (NOT p3))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p1 (NOT p0) p3))), (X (NOT (OR (AND p1 (NOT p0) (NOT p3)) (AND p1 (NOT p3) (NOT p2))))), (X (NOT (AND p1 p3))), (X (NOT (OR (AND p1 (NOT p0) p3) (AND p1 p3 (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (X p1)), (X (X (AND p1 (NOT p3)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p1 (NOT p0) p3)))), (X (X (NOT (OR (AND p1 (NOT p0) (NOT p3)) (AND p1 (NOT p3) (NOT p2)))))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (OR (AND p1 (NOT p0) p3) (AND p1 p3 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))))), (G (NOT (AND (NOT p1) (NOT p0)))), (G (NOT (AND p1 p3 (NOT p0))))]
False Knowledge obtained : [(F (OR (AND p1 (NOT p3) (NOT p0)) (AND p1 (NOT p3) (NOT p2)))), (F (OR (AND p1 p3 (NOT p0)) (AND p1 p3 (NOT p2)))), (F (NOT p1)), (F (AND p1 p3)), (F (NOT (AND p1 (NOT p3)))), (F (AND p1 (NOT p3) (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 23 factoid took 1655 ms. Reduced automaton from 4 states, 13 edges and 4 AP to 7 states, 19 edges and 4 AP.
Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), false, false, false]
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), false, false, false]
Support contains 9 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 5 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 02:00:12] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 02:00:12] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 02:00:12] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
[2022-05-15 02:00:12] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 02:00:12] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:00:12] [INFO ] Implicit Places using invariants in 94 ms returned []
[2022-05-15 02:00:12] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 02:00:12] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:00:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 02:00:12] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2022-05-15 02:00:12] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 02:00:12] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 02:00:13] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 547/547 transitions.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/64 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X p1), (X (AND p1 (NOT p3))), (X (NOT (AND p1 p3 p2))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) (NOT p2))))), (X (OR p0 (NOT p3))), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND p1 p3))), (X (AND p0 p1 (NOT p3) p2)), (X (X p1)), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 p3 p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) (NOT p2)))))), (X (X (OR p0 (NOT p3)))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p0 p1 (NOT p3) p2))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 940 ms. Reduced automaton from 7 states, 19 edges and 4 AP to 7 states, 19 edges and 4 AP.
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), false, false, false]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-15 02:00:14] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 02:00:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:00:14] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 02:00:14] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X p1), (X (AND p1 (NOT p3))), (X (NOT (AND p1 p3 p2))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) (NOT p2))))), (X (OR p0 (NOT p3))), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND p1 p3))), (X (AND p0 p1 (NOT p3) p2)), (X (X p1)), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 p3 p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) (NOT p2)))))), (X (X (OR p0 (NOT p3)))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p0 p1 (NOT p3) p2))), (F (OR (G p3) (G (NOT p3)))), (G (OR p0 (NOT p3)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p3) p1 p2))), (F (AND p3 p1)), (F (AND p3 p1 p2)), (F (AND p0 p3 (NOT p2))), (F (NOT (AND (NOT p3) p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p3))), (F (OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) (NOT p2))))]
Knowledge based reduction with 20 factoid took 1123 ms. Reduced automaton from 7 states, 19 edges and 4 AP to 7 states, 19 edges and 4 AP.
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), false, (AND p3 (NOT p2) (NOT p0)), (AND p3 p2 (NOT p0) p1)]
Stuttering acceptance computed with spot in 625 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), false, (AND p3 (NOT p2) (NOT p0)), (AND p3 p2 (NOT p0) p1)]
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), false, (AND p3 (NOT p2) (NOT p0)), (AND p3 p2 (NOT p0) p1)]
Product exploration explored 100000 steps with 32811 reset in 326 ms.
Product exploration explored 100000 steps with 32811 reset in 326 ms.
Applying partial POR strategy [false, false, true, true, true, false, true, true]
Stuttering acceptance computed with spot in 326 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), false, (AND p3 (NOT p2) (NOT p0)), (AND p3 p2 (NOT p0) p1), (AND p3 (NOT p2) (NOT p0))]
Support contains 9 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 22 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 02:00:17] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 02:00:17] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:00:17] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
[2022-05-15 02:00:18] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-15 02:00:18] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 02:00:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:00:18] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 547/547 transitions.
Product exploration explored 100000 steps with 32760 reset in 673 ms.
Product exploration explored 100000 steps with 32765 reset in 689 ms.
Built C files in :
/tmp/ltsmin15707459747163174580
[2022-05-15 02:00:19] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15707459747163174580
Running compilation step : cd /tmp/ltsmin15707459747163174580;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 930 ms.
Running link step : cd /tmp/ltsmin15707459747163174580;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15707459747163174580;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16647104599538811892.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 6 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 02:00:34] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 02:00:34] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:00:34] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
[2022-05-15 02:00:34] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 02:00:34] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:00:34] [INFO ] Implicit Places using invariants in 91 ms returned []
[2022-05-15 02:00:34] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 02:00:34] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:00:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 02:00:35] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2022-05-15 02:00:35] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 02:00:35] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 02:00:35] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 547/547 transitions.
Built C files in :
/tmp/ltsmin9766914241196998328
[2022-05-15 02:00:35] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9766914241196998328
Running compilation step : cd /tmp/ltsmin9766914241196998328;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 928 ms.
Running link step : cd /tmp/ltsmin9766914241196998328;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin9766914241196998328;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6481217365105217281.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 02:00:50] [INFO ] Flatten gal took : 18 ms
[2022-05-15 02:00:50] [INFO ] Flatten gal took : 18 ms
[2022-05-15 02:00:50] [INFO ] Time to serialize gal into /tmp/LTL2353291480066999226.gal : 3 ms
[2022-05-15 02:00:50] [INFO ] Time to serialize properties into /tmp/LTL9329798685728577707.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/LTL2353291480066999226.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9329798685728577707.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/LTL2353291...266
Read 1 LTL properties
Checking formula 0 : !((G(F(((X("(((CAPACITE<1)||(CONTROLEUR_2<1))||((NB_ATTENTE_B_11<1)||(ATTENTE_B<1)))"))&&("((CAPACITE<10)||(VIDANGE_1<1))"))&&((X("((C...230
Formula 0 simplified : !GF("((CAPACITE<10)||(VIDANGE_1<1))" & X"(((CAPACITE<1)||(CONTROLEUR_2<1))||((NB_ATTENTE_B_11<1)||(ATTENTE_B<1)))" & ("((NB_ATTENTE_...215
Detected timeout of ITS tools.
[2022-05-15 02:01:05] [INFO ] Flatten gal took : 18 ms
[2022-05-15 02:01:05] [INFO ] Applying decomposition
[2022-05-15 02:01:05] [INFO ] Flatten gal took : 18 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/graph2246499259529411227.txt' '-o' '/tmp/graph2246499259529411227.bin' '-w' '/tmp/graph2246499259529411227.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2246499259529411227.bin' '-l' '-1' '-v' '-w' '/tmp/graph2246499259529411227.weights' '-q' '0' '-e' '0.001'
[2022-05-15 02:01:05] [INFO ] Decomposing Gal with order
[2022-05-15 02:01:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 02:01:05] [INFO ] Removed a total of 992 redundant transitions.
[2022-05-15 02:01:05] [INFO ] Flatten gal took : 82 ms
[2022-05-15 02:01:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 175 labels/synchronizations in 5 ms.
[2022-05-15 02:01:05] [INFO ] Time to serialize gal into /tmp/LTL914128241796464084.gal : 2 ms
[2022-05-15 02:01:05] [INFO ] Time to serialize properties into /tmp/LTL14123752488211442352.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/LTL914128241796464084.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14123752488211442352.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/LTL9141282...245
Read 1 LTL properties
Checking formula 0 : !((G(F(((X("(((i2.u0.CAPACITE<1)||(u3.CONTROLEUR_2<1))||((i0.u4.NB_ATTENTE_B_11<1)||(i2.u2.ATTENTE_B<1)))"))&&("((i2.u0.CAPACITE<10)||...284
Formula 0 simplified : !GF("((i2.u0.CAPACITE<10)||(u3.VIDANGE_1<1))" & X"(((i2.u0.CAPACITE<1)||(u3.CONTROLEUR_2<1))||((i0.u4.NB_ATTENTE_B_11<1)||(i2.u2.ATT...269
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17566118612788995180
[2022-05-15 02:01:20] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17566118612788995180
Running compilation step : cd /tmp/ltsmin17566118612788995180;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 944 ms.
Running link step : cd /tmp/ltsmin17566118612788995180;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17566118612788995180;'/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((LTLAPp0==true))&&(LTLAPp1==true)&&(X((LTLAPp2==true))||(LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLFireability-14 finished in 88936 ms.
[2022-05-15 02:01:35] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin340441742154656078
[2022-05-15 02:01:35] [INFO ] Computing symmetric may disable matrix : 548 transitions.
[2022-05-15 02:01:35] [INFO ] Applying decomposition
[2022-05-15 02:01:35] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 02:01:35] [INFO ] Flatten gal took : 17 ms
[2022-05-15 02:01:35] [INFO ] Computing symmetric may enable matrix : 548 transitions.
[2022-05-15 02:01:35] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 02:01:35] [INFO ] Computing Do-Not-Accords matrix : 548 transitions.
[2022-05-15 02:01:35] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph7814798450761033225.txt' '-o' '/tmp/graph7814798450761033225.bin' '-w' '/tmp/graph7814798450761033225.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7814798450761033225.bin' '-l' '-1' '-v' '-w' '/tmp/graph7814798450761033225.weights' '-q' '0' '-e' '0.001'
[2022-05-15 02:01:36] [INFO ] Decomposing Gal with order
[2022-05-15 02:01:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 02:01:36] [INFO ] Built C files in 113ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin340441742154656078
Running compilation step : cd /tmp/ltsmin340441742154656078;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-15 02:01:36] [INFO ] Removed a total of 1098 redundant transitions.
[2022-05-15 02:01:36] [INFO ] Flatten gal took : 72 ms
[2022-05-15 02:01:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 217 labels/synchronizations in 6 ms.
[2022-05-15 02:01:36] [INFO ] Time to serialize gal into /tmp/LTLFireability9257184213008476272.gal : 2 ms
[2022-05-15 02:01:36] [INFO ] Time to serialize properties into /tmp/LTLFireability1506989455703494419.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/LTLFireability9257184213008476272.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1506989455703494419.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 2 LTL properties
Checking formula 0 : !((F(G(((X(G("((i0.u0.ROUTE_A<1)||(i0.u3.NB_ATTENTE_A_16<1))")))||(F("((i2.u1.CHOIX_2>=1)&&(i1.u2.COMPTEUR_9>=1))")))||(F("(((i0.u3.NB...250
Formula 0 simplified : !FG(XG"((i0.u0.ROUTE_A<1)||(i0.u3.NB_ATTENTE_A_16<1))" | F"((i2.u1.CHOIX_2>=1)&&(i1.u2.COMPTEUR_9>=1))" | F"(((i0.u3.NB_ATTENTE_A_9>...232
Compilation finished in 1583 ms.
Running link step : cd /tmp/ltsmin340441742154656078;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin340441742154656078;'/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([]((LTLAPp0==true)))||<>((LTLAPp1==true))||<>((LTLAPp2==true)))))' '--buchi-type=spotba'
LTSmin run took 76553 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin340441742154656078;'/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((LTLAPp3==true))&&(LTLAPp4==true)&&(X((LTLAPp5==true))||(LTLAPp6==true)))))' '--buchi-type=spotba'
LTSmin run took 128526 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 581003 ms.
BK_STOP 1652580302993
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V20P10N10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-PT-V20P10N10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918200180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P10N10.tgz
mv BridgeAndVehicles-PT-V20P10N10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;