About the Execution of ITS-Tools for BridgeAndVehicles-COL-V20P20N50
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12924.436 | 3600000.00 | 11985000.00 | 427.00 | FF?F?FFTF?FFFFT? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813689800060.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is BridgeAndVehicles-COL-V20P20N50, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813689800060
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 12:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 12:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 12:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 12:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Feb 25 12:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 12:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 41K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678317333216
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V20P20N50
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-08 23:15:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 23:15:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 23:15:35] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-08 23:15:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-08 23:15:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 445 ms
[2023-03-08 23:15:35] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 108 PT places and 90298.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2023-03-08 23:15:36] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2023-03-08 23:15:36] [INFO ] Skeletonized 13 HLPN properties in 1 ms. Removed 3 properties that had guard overlaps.
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Remains 10 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Finished random walk after 50 steps, including 0 resets, run visited all 5 properties in 8 ms. (steps per millisecond=6 )
[2023-03-08 23:15:36] [INFO ] Flatten gal took : 13 ms
[2023-03-08 23:15:36] [INFO ] Flatten gal took : 2 ms
Arc [13:1*[(MOD (ADD $cpt 1) 51)]] contains successor/predecessor on variables of sort compteur
Arc [1:1*[(MOD (ADD $cA 1) 21)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 21) 21) 21)]] contains successor/predecessor on variables of sort voitureB
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2023-03-08 23:15:36] [INFO ] Unfolded HLPN to a Petri net with 108 places and 2228 transitions 17190 arcs in 66 ms.
[2023-03-08 23:15:36] [INFO ] Unfolded 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 106 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2228
Applied a total of 2 rules in 42 ms. Remains 106 /108 variables (removed 2) and now considering 2228/2228 (removed 0) transitions.
[2023-03-08 23:15:37] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2023-03-08 23:15:37] [INFO ] Computed 5 place invariants in 31 ms
[2023-03-08 23:15:37] [INFO ] Dead Transitions using invariants and state equation in 896 ms found 0 transitions.
[2023-03-08 23:15:37] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:15:37] [INFO ] Invariant cache hit.
[2023-03-08 23:15:37] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 23:15:37] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:15:37] [INFO ] Invariant cache hit.
[2023-03-08 23:15:38] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:15:38] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2023-03-08 23:15:38] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:15:38] [INFO ] Invariant cache hit.
[2023-03-08 23:15:38] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/108 places, 2228/2228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1837 ms. Remains : 106/108 places, 2228/2228 transitions.
Support contains 106 out of 106 places after structural reductions.
[2023-03-08 23:15:39] [INFO ] Flatten gal took : 244 ms
[2023-03-08 23:15:40] [INFO ] Flatten gal took : 262 ms
[2023-03-08 23:15:42] [INFO ] Input system was already deterministic with 2228 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 23:15:42] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:15:42] [INFO ] Invariant cache hit.
[2023-03-08 23:15:42] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2023-03-08 23:15:42] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 23:15:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 23:15:42] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 23:15:43] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:15:43] [INFO ] After 85ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 23:15:43] [INFO ] After 259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-08 23:15:43] [INFO ] After 510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 103 transition count 2226
Applied a total of 5 rules in 506 ms. Remains 103 /106 variables (removed 3) and now considering 2226/2228 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 510 ms. Remains : 103/106 places, 2226/2228 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 389701 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :{}
Probabilistic random walk after 389701 steps, saw 109597 distinct states, run finished after 3006 ms. (steps per millisecond=129 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 23:15:47] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 103 cols
[2023-03-08 23:15:47] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-08 23:15:47] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 23:15:47] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 23:15:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 23:15:47] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 23:15:47] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:15:47] [INFO ] After 104ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 23:15:47] [INFO ] After 216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-08 23:15:47] [INFO ] After 430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2226/2226 transitions.
Applied a total of 0 rules in 264 ms. Remains 103 /103 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 264 ms. Remains : 103/103 places, 2226/2226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2226/2226 transitions.
Applied a total of 0 rules in 561 ms. Remains 103 /103 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2023-03-08 23:15:48] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-08 23:15:48] [INFO ] Invariant cache hit.
[2023-03-08 23:15:48] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-08 23:15:48] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-08 23:15:48] [INFO ] Invariant cache hit.
[2023-03-08 23:15:48] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:15:50] [INFO ] Implicit Places using invariants and state equation in 1303 ms returned [22, 44]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1664 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 101/103 places, 2226/2226 transitions.
Applied a total of 0 rules in 271 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2498 ms. Remains : 101/103 places, 2226/2226 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 370350 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :{}
Probabilistic random walk after 370350 steps, saw 104413 distinct states, run finished after 3002 ms. (steps per millisecond=123 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 23:15:53] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2023-03-08 23:15:53] [INFO ] Computed 4 place invariants in 8 ms
[2023-03-08 23:15:53] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 23:15:53] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 23:15:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 23:15:53] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 23:15:53] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:15:54] [INFO ] After 108ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 23:15:54] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-08 23:15:54] [INFO ] After 433ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2226/2226 transitions.
Applied a total of 0 rules in 278 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 279 ms. Remains : 101/101 places, 2226/2226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2226/2226 transitions.
Applied a total of 0 rules in 243 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2023-03-08 23:15:54] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-08 23:15:54] [INFO ] Invariant cache hit.
[2023-03-08 23:15:55] [INFO ] Implicit Places using invariants in 361 ms returned []
[2023-03-08 23:15:55] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-08 23:15:55] [INFO ] Invariant cache hit.
[2023-03-08 23:15:55] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:15:56] [INFO ] Implicit Places using invariants and state equation in 969 ms returned []
Implicit Place search using SMT with State Equation took 1334 ms to find 0 implicit places.
[2023-03-08 23:15:56] [INFO ] Redundant transitions in 162 ms returned []
[2023-03-08 23:15:56] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-08 23:15:56] [INFO ] Invariant cache hit.
[2023-03-08 23:15:56] [INFO ] Dead Transitions using invariants and state equation in 725 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2477 ms. Remains : 101/101 places, 2226/2226 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 101 transition count 288
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1940 place count 101 transition count 286
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1942 place count 99 transition count 286
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 1944 place count 99 transition count 286
Applied a total of 1944 rules in 17 ms. Remains 99 /101 variables (removed 2) and now considering 286/2226 (removed 1940) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 286 rows 99 cols
[2023-03-08 23:15:57] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 23:15:57] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 23:15:57] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 23:15:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 23:15:57] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 23:15:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 23:15:57] [INFO ] After 28ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 23:15:57] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-08 23:15:57] [INFO ] After 190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 49 stabilizing places and 84 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U p1))||G(!p1)))'
Support contains 74 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 7 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-08 23:15:58] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2023-03-08 23:15:58] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-08 23:15:58] [INFO ] Dead Transitions using invariants and state equation in 731 ms found 0 transitions.
[2023-03-08 23:15:58] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:15:58] [INFO ] Invariant cache hit.
[2023-03-08 23:15:59] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-08 23:15:59] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:15:59] [INFO ] Invariant cache hit.
[2023-03-08 23:15:59] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:15:59] [INFO ] Implicit Places using invariants and state equation in 543 ms returned [23, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 679 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 9 ms. Remains 104 /104 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1428 ms. Remains : 104/106 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 258 ms :[true, (NOT p1), false, false, p1]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=3, aps=[p1:(OR (AND (GEQ s12 1) (GEQ s24 1) (GEQ s48 1) (GEQ s87 1)) (AND (GEQ s16 1) (GEQ s24 1) (GEQ s48 1) (GEQ s99 1)) (AND (GEQ s4 1) (GEQ s24 1) (GEQ s48 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 107 steps with 0 reset in 21 ms.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-00 finished in 1820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 73 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 12 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-08 23:15:59] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2023-03-08 23:15:59] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 23:16:00] [INFO ] Dead Transitions using invariants and state equation in 620 ms found 0 transitions.
[2023-03-08 23:16:00] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:16:00] [INFO ] Invariant cache hit.
[2023-03-08 23:16:00] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-08 23:16:00] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:16:00] [INFO ] Invariant cache hit.
[2023-03-08 23:16:00] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:16:01] [INFO ] Implicit Places using invariants and state equation in 830 ms returned [23, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 970 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 13 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1617 ms. Remains : 103/106 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s40 1) (GEQ s46 1) (GEQ s54 1)) (AND (GEQ s1 1) (GEQ s25 1) (GEQ s46 1) (GEQ s73 1)) (AND (GEQ s1 1) (GEQ s36 1) (GEQ s46 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-01 finished in 1783 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 23 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 756 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-08 23:16:02] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:16:02] [INFO ] Invariant cache hit.
[2023-03-08 23:16:03] [INFO ] Dead Transitions using invariants and state equation in 743 ms found 0 transitions.
[2023-03-08 23:16:03] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:16:03] [INFO ] Invariant cache hit.
[2023-03-08 23:16:03] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-08 23:16:03] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:16:03] [INFO ] Invariant cache hit.
[2023-03-08 23:16:03] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:16:04] [INFO ] Implicit Places using invariants and state equation in 1279 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1494 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 278 ms. Remains 104 /104 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3273 ms. Remains : 104/106 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s28 1) (GEQ s45 1) (GEQ s48 1)) (AND (GEQ s0 1) (GEQ s35 1) (GEQ s45 1) (GEQ s48 1)) (AND (GEQ s0 1) (GEQ s40 1) (GEQ s45 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1265 reset in 1023 ms.
Product exploration explored 100000 steps with 1283 reset in 722 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)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Finished random walk after 110 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=36 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2023-03-08 23:16:07] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 104 cols
[2023-03-08 23:16:07] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-08 23:16:08] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-08 23:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 23:16:08] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2023-03-08 23:16:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 23:16:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-08 23:16:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 23:16:09] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2023-03-08 23:16:09] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:16:09] [INFO ] [Nat]Added 102 Read/Feed constraints in 67 ms returned sat
[2023-03-08 23:16:09] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 196 transitions) in 157 ms.
[2023-03-08 23:16:10] [INFO ] Added : 64 causal constraints over 15 iterations in 532 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 23 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2227/2227 transitions.
Applied a total of 0 rules in 221 ms. Remains 104 /104 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-08 23:16:10] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:16:10] [INFO ] Invariant cache hit.
[2023-03-08 23:16:10] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
[2023-03-08 23:16:10] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:16:10] [INFO ] Invariant cache hit.
[2023-03-08 23:16:11] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-08 23:16:11] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:16:11] [INFO ] Invariant cache hit.
[2023-03-08 23:16:11] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:16:11] [INFO ] Implicit Places using invariants and state equation in 672 ms returned []
Implicit Place search using SMT with State Equation took 978 ms to find 0 implicit places.
[2023-03-08 23:16:11] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-08 23:16:11] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:16:11] [INFO ] Invariant cache hit.
[2023-03-08 23:16:12] [INFO ] Dead Transitions using invariants and state equation in 671 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2557 ms. Remains : 104/104 places, 2227/2227 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)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Finished random walk after 108 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=27 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
[2023-03-08 23:16:13] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:16:13] [INFO ] Invariant cache hit.
[2023-03-08 23:16:13] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-08 23:16:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 23:16:14] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-08 23:16:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 23:16:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-08 23:16:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 23:16:14] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-08 23:16:14] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:16:15] [INFO ] [Nat]Added 102 Read/Feed constraints in 47 ms returned sat
[2023-03-08 23:16:15] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 196 transitions) in 311 ms.
[2023-03-08 23:16:15] [INFO ] Added : 65 causal constraints over 13 iterations in 697 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1311 reset in 1008 ms.
Product exploration explored 100000 steps with 1278 reset in 748 ms.
Built C files in :
/tmp/ltsmin15303887338184486655
[2023-03-08 23:16:17] [INFO ] Too many transitions (2227) to apply POR reductions. Disabling POR matrices.
[2023-03-08 23:16:17] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15303887338184486655
Running compilation step : cd /tmp/ltsmin15303887338184486655;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15303887338184486655;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15303887338184486655;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 23 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2227/2227 transitions.
Applied a total of 0 rules in 316 ms. Remains 104 /104 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-08 23:16:21] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:16:21] [INFO ] Invariant cache hit.
[2023-03-08 23:16:21] [INFO ] Dead Transitions using invariants and state equation in 695 ms found 0 transitions.
[2023-03-08 23:16:21] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:16:21] [INFO ] Invariant cache hit.
[2023-03-08 23:16:22] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-08 23:16:22] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:16:22] [INFO ] Invariant cache hit.
[2023-03-08 23:16:22] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:16:22] [INFO ] Implicit Places using invariants and state equation in 944 ms returned []
Implicit Place search using SMT with State Equation took 1228 ms to find 0 implicit places.
[2023-03-08 23:16:23] [INFO ] Redundant transitions in 85 ms returned []
[2023-03-08 23:16:23] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:16:23] [INFO ] Invariant cache hit.
[2023-03-08 23:16:23] [INFO ] Dead Transitions using invariants and state equation in 770 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3108 ms. Remains : 104/104 places, 2227/2227 transitions.
Built C files in :
/tmp/ltsmin5512416401914445363
[2023-03-08 23:16:23] [INFO ] Too many transitions (2227) to apply POR reductions. Disabling POR matrices.
[2023-03-08 23:16:23] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5512416401914445363
Running compilation step : cd /tmp/ltsmin5512416401914445363;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5512416401914445363;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5512416401914445363;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-08 23:16:27] [INFO ] Flatten gal took : 134 ms
[2023-03-08 23:16:27] [INFO ] Flatten gal took : 126 ms
[2023-03-08 23:16:27] [INFO ] Time to serialize gal into /tmp/LTL17443139917461118922.gal : 29 ms
[2023-03-08 23:16:27] [INFO ] Time to serialize properties into /tmp/LTL16683845186004319593.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17443139917461118922.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1403191714352345168.hoa' '-atoms' '/tmp/LTL16683845186004319593.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16683845186004319593.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1403191714352345168.hoa
Detected timeout of ITS tools.
[2023-03-08 23:16:43] [INFO ] Flatten gal took : 94 ms
[2023-03-08 23:16:43] [INFO ] Flatten gal took : 85 ms
[2023-03-08 23:16:43] [INFO ] Time to serialize gal into /tmp/LTL15684134284314788870.gal : 19 ms
[2023-03-08 23:16:43] [INFO ] Time to serialize properties into /tmp/LTL4285934769224615923.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15684134284314788870.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4285934769224615923.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((CAPACITE_0>=1)&&(NB_ATTENTE_B_4>=1))&&((ATTENTE_B_0>=1)&&(CONTROLEUR_1>=1)))||(((CAPACITE_0>=1)&&(NB_ATTENTE_B_11>=1))...1701
Formula 0 simplified : FG!"((((((((CAPACITE_0>=1)&&(NB_ATTENTE_B_4>=1))&&((ATTENTE_B_0>=1)&&(CONTROLEUR_1>=1)))||(((CAPACITE_0>=1)&&(NB_ATTENTE_B_11>=1))&&...1695
Detected timeout of ITS tools.
[2023-03-08 23:16:58] [INFO ] Flatten gal took : 134 ms
[2023-03-08 23:16:58] [INFO ] Applying decomposition
[2023-03-08 23:16:58] [INFO ] Flatten gal took : 92 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1708413427587287299.txt' '-o' '/tmp/graph1708413427587287299.bin' '-w' '/tmp/graph1708413427587287299.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1708413427587287299.bin' '-l' '-1' '-v' '-w' '/tmp/graph1708413427587287299.weights' '-q' '0' '-e' '0.001'
[2023-03-08 23:16:58] [INFO ] Decomposing Gal with order
[2023-03-08 23:16:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 23:16:59] [INFO ] Removed a total of 4254 redundant transitions.
[2023-03-08 23:16:59] [INFO ] Flatten gal took : 786 ms
[2023-03-08 23:16:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 335 labels/synchronizations in 29 ms.
[2023-03-08 23:16:59] [INFO ] Time to serialize gal into /tmp/LTL17004950049624228274.gal : 3 ms
[2023-03-08 23:16:59] [INFO ] Time to serialize properties into /tmp/LTL15836695500064974232.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17004950049624228274.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15836695500064974232.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((i0.u0.CAPACITE_0>=1)&&(i2.u4.NB_ATTENTE_B_4>=1))&&((i0.u1.ATTENTE_B_0>=1)&&(u3.CONTROLEUR_1>=1)))||(((i0.u0.CAPACITE_0...2121
Formula 0 simplified : FG!"((((((((i0.u0.CAPACITE_0>=1)&&(i2.u4.NB_ATTENTE_B_4>=1))&&((i0.u1.ATTENTE_B_0>=1)&&(u3.CONTROLEUR_1>=1)))||(((i0.u0.CAPACITE_0>=...2115
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3222516123745208446
[2023-03-08 23:17:14] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3222516123745208446
Running compilation step : cd /tmp/ltsmin3222516123745208446;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3222516123745208446;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3222516123745208446;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-02 finished in 76278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||G(!p1))) U (p1&&F(p2)&&X(p0))))'
Support contains 77 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 14 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-08 23:17:18] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2023-03-08 23:17:18] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 23:17:18] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
[2023-03-08 23:17:18] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:17:18] [INFO ] Invariant cache hit.
[2023-03-08 23:17:18] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-08 23:17:18] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:17:18] [INFO ] Invariant cache hit.
[2023-03-08 23:17:19] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:17:19] [INFO ] Implicit Places using invariants and state equation in 822 ms returned [23, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1005 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 11 ms. Remains 104 /104 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1743 ms. Remains : 104/106 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 301 ms :[(NOT p0), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p2 p0), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=2, aps=[p0:(GEQ s45 1), p2:(OR (AND (GEQ s0 20) (GEQ s103 1)) (AND (GEQ s0 20) (GEQ s102 1))), p1:(OR (AND (GEQ s1 1) (GEQ s40 1) (GEQ s47 1) (GEQ s55 1)) (AND (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-03 finished in 2147 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 23 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 266 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-08 23:17:20] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2023-03-08 23:17:20] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-08 23:17:21] [INFO ] Dead Transitions using invariants and state equation in 776 ms found 0 transitions.
[2023-03-08 23:17:21] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:17:21] [INFO ] Invariant cache hit.
[2023-03-08 23:17:21] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-08 23:17:21] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:17:21] [INFO ] Invariant cache hit.
[2023-03-08 23:17:21] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:17:22] [INFO ] Implicit Places using invariants and state equation in 1024 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1282 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 235 ms. Remains 104 /104 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2565 ms. Remains : 104/106 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s17 1) (LT s23 1) (LT s47 1)) (OR (LT s0 1) (LT s11 1) (LT s23 1) (LT s47 1)) (OR (LT s0 1) (LT s5 1) (LT s23 1) (LT s47 1)) (OR...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 602 reset in 1139 ms.
Product exploration explored 100000 steps with 602 reset in 955 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 169 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Support contains 23 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2227/2227 transitions.
Applied a total of 0 rules in 219 ms. Remains 104 /104 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-08 23:17:25] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 104 cols
[2023-03-08 23:17:25] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-08 23:17:26] [INFO ] Dead Transitions using invariants and state equation in 702 ms found 0 transitions.
[2023-03-08 23:17:26] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:17:26] [INFO ] Invariant cache hit.
[2023-03-08 23:17:26] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-08 23:17:26] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:17:26] [INFO ] Invariant cache hit.
[2023-03-08 23:17:26] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:17:27] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
[2023-03-08 23:17:27] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-08 23:17:27] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:17:27] [INFO ] Invariant cache hit.
[2023-03-08 23:17:27] [INFO ] Dead Transitions using invariants and state equation in 744 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2562 ms. Remains : 104/104 places, 2227/2227 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 157 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 172 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Product exploration explored 100000 steps with 602 reset in 971 ms.
Product exploration explored 100000 steps with 602 reset in 943 ms.
Built C files in :
/tmp/ltsmin931905899246120393
[2023-03-08 23:17:30] [INFO ] Too many transitions (2227) to apply POR reductions. Disabling POR matrices.
[2023-03-08 23:17:30] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin931905899246120393
Running compilation step : cd /tmp/ltsmin931905899246120393;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin931905899246120393;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin931905899246120393;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 23 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2227/2227 transitions.
Applied a total of 0 rules in 291 ms. Remains 104 /104 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-08 23:17:33] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:17:33] [INFO ] Invariant cache hit.
[2023-03-08 23:17:34] [INFO ] Dead Transitions using invariants and state equation in 712 ms found 0 transitions.
[2023-03-08 23:17:34] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:17:34] [INFO ] Invariant cache hit.
[2023-03-08 23:17:34] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-03-08 23:17:34] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:17:34] [INFO ] Invariant cache hit.
[2023-03-08 23:17:34] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:17:35] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
[2023-03-08 23:17:35] [INFO ] Redundant transitions in 91 ms returned []
[2023-03-08 23:17:35] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:17:35] [INFO ] Invariant cache hit.
[2023-03-08 23:17:36] [INFO ] Dead Transitions using invariants and state equation in 792 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2751 ms. Remains : 104/104 places, 2227/2227 transitions.
Built C files in :
/tmp/ltsmin15405089723447482350
[2023-03-08 23:17:36] [INFO ] Too many transitions (2227) to apply POR reductions. Disabling POR matrices.
[2023-03-08 23:17:36] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15405089723447482350
Running compilation step : cd /tmp/ltsmin15405089723447482350;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15405089723447482350;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15405089723447482350;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-08 23:17:39] [INFO ] Flatten gal took : 53 ms
[2023-03-08 23:17:39] [INFO ] Flatten gal took : 57 ms
[2023-03-08 23:17:39] [INFO ] Time to serialize gal into /tmp/LTL15993359538036830711.gal : 13 ms
[2023-03-08 23:17:39] [INFO ] Time to serialize properties into /tmp/LTL4617116819692693413.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15993359538036830711.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15815654953989955292.hoa' '-atoms' '/tmp/LTL4617116819692693413.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4617116819692693413.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15815654953989955292.hoa
Detected timeout of ITS tools.
[2023-03-08 23:17:54] [INFO ] Flatten gal took : 71 ms
[2023-03-08 23:17:55] [INFO ] Flatten gal took : 72 ms
[2023-03-08 23:17:55] [INFO ] Time to serialize gal into /tmp/LTL11363363974880605157.gal : 16 ms
[2023-03-08 23:17:55] [INFO ] Time to serialize properties into /tmp/LTL12410065523218000070.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11363363974880605157.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12410065523218000070.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((((CAPACITE_0<1)||(NB_ATTENTE_A_16<1))||((ATTENTE_A_0<1)||(CONTROLEUR_0<1)))&&(((CAPACITE_0<1)||(NB_ATTENTE_A_10<1))||((A...1621
Formula 0 simplified : GF!"((((((((CAPACITE_0<1)||(NB_ATTENTE_A_16<1))||((ATTENTE_A_0<1)||(CONTROLEUR_0<1)))&&(((CAPACITE_0<1)||(NB_ATTENTE_A_10<1))||((ATT...1615
Detected timeout of ITS tools.
[2023-03-08 23:18:10] [INFO ] Flatten gal took : 104 ms
[2023-03-08 23:18:10] [INFO ] Applying decomposition
[2023-03-08 23:18:10] [INFO ] Flatten gal took : 86 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6679907020115319540.txt' '-o' '/tmp/graph6679907020115319540.bin' '-w' '/tmp/graph6679907020115319540.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6679907020115319540.bin' '-l' '-1' '-v' '-w' '/tmp/graph6679907020115319540.weights' '-q' '0' '-e' '0.001'
[2023-03-08 23:18:10] [INFO ] Decomposing Gal with order
[2023-03-08 23:18:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 23:18:11] [INFO ] Removed a total of 4254 redundant transitions.
[2023-03-08 23:18:11] [INFO ] Flatten gal took : 548 ms
[2023-03-08 23:18:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 355 labels/synchronizations in 21 ms.
[2023-03-08 23:18:11] [INFO ] Time to serialize gal into /tmp/LTL5421597123463049411.gal : 3 ms
[2023-03-08 23:18:11] [INFO ] Time to serialize properties into /tmp/LTL2488239510952561315.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5421597123463049411.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2488239510952561315.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((((i0.u0.CAPACITE_0<1)||(i0.u3.NB_ATTENTE_A_16<1))||((i0.u1.ATTENTE_A_0<1)||(i1.u4.CONTROLEUR_0<1)))&&(((i0.u0.CAPACITE_0...2101
Formula 0 simplified : GF!"((((((((i0.u0.CAPACITE_0<1)||(i0.u3.NB_ATTENTE_A_16<1))||((i0.u1.ATTENTE_A_0<1)||(i1.u4.CONTROLEUR_0<1)))&&(((i0.u0.CAPACITE_0<1...2095
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6713383817163542974
[2023-03-08 23:18:26] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6713383817163542974
Running compilation step : cd /tmp/ltsmin6713383817163542974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6713383817163542974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6713383817163542974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-04 finished in 69223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U X(p1)) U p2)))'
Support contains 26 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 6 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-08 23:18:29] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2023-03-08 23:18:29] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-08 23:18:30] [INFO ] Dead Transitions using invariants and state equation in 747 ms found 0 transitions.
[2023-03-08 23:18:30] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:18:30] [INFO ] Invariant cache hit.
[2023-03-08 23:18:30] [INFO ] Implicit Places using invariants in 230 ms returned []
[2023-03-08 23:18:30] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:18:30] [INFO ] Invariant cache hit.
[2023-03-08 23:18:30] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:18:31] [INFO ] Implicit Places using invariants and state equation in 961 ms returned [23, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1195 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 5 ms. Remains 104 /104 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1955 ms. Remains : 104/106 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 272 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (AND (GEQ s0 20) (GEQ s103 1)) (AND (GEQ s0 20) (GEQ s102 1))), p0:(OR (AND (GEQ s27 1) (GEQ s46 1)) (AND (GEQ s44 1) (GEQ s46 1)) (AND (GEQ s37 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 73 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-05 finished in 2274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!p0))))'
Support contains 73 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 17 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-08 23:18:31] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2023-03-08 23:18:31] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-08 23:18:32] [INFO ] Dead Transitions using invariants and state equation in 666 ms found 0 transitions.
[2023-03-08 23:18:32] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:18:32] [INFO ] Invariant cache hit.
[2023-03-08 23:18:32] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-08 23:18:32] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:18:32] [INFO ] Invariant cache hit.
[2023-03-08 23:18:32] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:18:32] [INFO ] Implicit Places using invariants and state equation in 479 ms returned [23, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 593 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 6 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1284 ms. Remains : 103/106 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 136 ms :[p0, p0, p0]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s12 1) (GEQ s24 1) (GEQ s47 1) (GEQ s86 1)) (AND (GEQ s16 1) (GEQ s24 1) (GEQ s47 1) (GEQ s98 1)) (AND (GEQ s4 1) (GEQ s24 1) (GEQ s47 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1577 ms.
Product exploration explored 100000 steps with 33333 reset in 1480 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 2 factoid took 58 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-07 finished in 4579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 6 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-08 23:18:36] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2023-03-08 23:18:36] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-08 23:18:36] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
[2023-03-08 23:18:36] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:18:36] [INFO ] Invariant cache hit.
[2023-03-08 23:18:37] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-08 23:18:37] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:18:37] [INFO ] Invariant cache hit.
[2023-03-08 23:18:37] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:18:38] [INFO ] Implicit Places using invariants and state equation in 1445 ms returned [23, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1818 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 11 ms. Remains 104 /104 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2503 ms. Remains : 104/106 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, p0, p0]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s45 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 105 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-08 finished in 2666 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 290 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-08 23:18:39] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2023-03-08 23:18:39] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-08 23:18:39] [INFO ] Dead Transitions using invariants and state equation in 805 ms found 0 transitions.
[2023-03-08 23:18:39] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:18:39] [INFO ] Invariant cache hit.
[2023-03-08 23:18:40] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-08 23:18:40] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:18:40] [INFO ] Invariant cache hit.
[2023-03-08 23:18:40] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:18:41] [INFO ] Implicit Places using invariants and state equation in 1246 ms returned [23, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1536 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 228 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2862 ms. Remains : 103/106 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s44 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 1580 reset in 652 ms.
Product exploration explored 100000 steps with 1520 reset in 676 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/103 stabilizing places and 83/2227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 165 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2023-03-08 23:18:43] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2023-03-08 23:18:43] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 23:18:44] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-08 23:18:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 23:18:44] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2023-03-08 23:18:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 23:18:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 23:18:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 23:18:44] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-08 23:18:44] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:18:46] [INFO ] [Nat]Added 102 Read/Feed constraints in 1256 ms returned sat
[2023-03-08 23:18:46] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 196 transitions) in 126 ms.
[2023-03-08 23:18:46] [INFO ] Added : 39 causal constraints over 9 iterations in 429 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 224 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-08 23:18:46] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:18:46] [INFO ] Invariant cache hit.
[2023-03-08 23:18:47] [INFO ] Dead Transitions using invariants and state equation in 754 ms found 0 transitions.
[2023-03-08 23:18:47] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:18:47] [INFO ] Invariant cache hit.
[2023-03-08 23:18:47] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-08 23:18:47] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:18:47] [INFO ] Invariant cache hit.
[2023-03-08 23:18:47] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:18:48] [INFO ] Implicit Places using invariants and state equation in 944 ms returned []
Implicit Place search using SMT with State Equation took 1250 ms to find 0 implicit places.
[2023-03-08 23:18:48] [INFO ] Redundant transitions in 107 ms returned []
[2023-03-08 23:18:48] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:18:48] [INFO ] Invariant cache hit.
[2023-03-08 23:18:49] [INFO ] Dead Transitions using invariants and state equation in 798 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3142 ms. Remains : 103/103 places, 2227/2227 transitions.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/103 stabilizing places and 83/2227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=28 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 216 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
[2023-03-08 23:18:50] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:18:50] [INFO ] Invariant cache hit.
[2023-03-08 23:18:50] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-08 23:18:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 23:18:51] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2023-03-08 23:18:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 23:18:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 23:18:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 23:18:51] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-08 23:18:51] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:18:53] [INFO ] [Nat]Added 102 Read/Feed constraints in 1258 ms returned sat
[2023-03-08 23:18:53] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 196 transitions) in 109 ms.
[2023-03-08 23:18:53] [INFO ] Added : 39 causal constraints over 9 iterations in 466 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1527 reset in 896 ms.
Product exploration explored 100000 steps with 1536 reset in 731 ms.
Built C files in :
/tmp/ltsmin14124004849761570524
[2023-03-08 23:18:55] [INFO ] Too many transitions (2227) to apply POR reductions. Disabling POR matrices.
[2023-03-08 23:18:55] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14124004849761570524
Running compilation step : cd /tmp/ltsmin14124004849761570524;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14124004849761570524;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14124004849761570524;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 257 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-08 23:18:58] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:18:58] [INFO ] Invariant cache hit.
[2023-03-08 23:18:59] [INFO ] Dead Transitions using invariants and state equation in 744 ms found 0 transitions.
[2023-03-08 23:18:59] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:18:59] [INFO ] Invariant cache hit.
[2023-03-08 23:18:59] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-08 23:18:59] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:18:59] [INFO ] Invariant cache hit.
[2023-03-08 23:18:59] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:19:00] [INFO ] Implicit Places using invariants and state equation in 1113 ms returned []
Implicit Place search using SMT with State Equation took 1400 ms to find 0 implicit places.
[2023-03-08 23:19:00] [INFO ] Redundant transitions in 100 ms returned []
[2023-03-08 23:19:00] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:19:00] [INFO ] Invariant cache hit.
[2023-03-08 23:19:01] [INFO ] Dead Transitions using invariants and state equation in 706 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3214 ms. Remains : 103/103 places, 2227/2227 transitions.
Built C files in :
/tmp/ltsmin2661296800507890053
[2023-03-08 23:19:01] [INFO ] Too many transitions (2227) to apply POR reductions. Disabling POR matrices.
[2023-03-08 23:19:01] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2661296800507890053
Running compilation step : cd /tmp/ltsmin2661296800507890053;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2661296800507890053;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2661296800507890053;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-08 23:19:04] [INFO ] Flatten gal took : 61 ms
[2023-03-08 23:19:05] [INFO ] Flatten gal took : 67 ms
[2023-03-08 23:19:05] [INFO ] Time to serialize gal into /tmp/LTL5819109851367858816.gal : 12 ms
[2023-03-08 23:19:05] [INFO ] Time to serialize properties into /tmp/LTL12594297913670052870.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5819109851367858816.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6489333870334050087.hoa' '-atoms' '/tmp/LTL12594297913670052870.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12594297913670052870.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6489333870334050087.hoa
Detected timeout of ITS tools.
[2023-03-08 23:19:20] [INFO ] Flatten gal took : 64 ms
[2023-03-08 23:19:20] [INFO ] Flatten gal took : 66 ms
[2023-03-08 23:19:20] [INFO ] Time to serialize gal into /tmp/LTL16096095496366844407.gal : 13 ms
[2023-03-08 23:19:20] [INFO ] Time to serialize properties into /tmp/LTL6559711226785497237.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16096095496366844407.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6559711226785497237.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F("(SUR_PONT_B_0>=1)")))
Formula 0 simplified : G!"(SUR_PONT_B_0>=1)"
Detected timeout of ITS tools.
[2023-03-08 23:19:35] [INFO ] Flatten gal took : 93 ms
[2023-03-08 23:19:35] [INFO ] Applying decomposition
[2023-03-08 23:19:35] [INFO ] Flatten gal took : 80 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18284797473267838893.txt' '-o' '/tmp/graph18284797473267838893.bin' '-w' '/tmp/graph18284797473267838893.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18284797473267838893.bin' '-l' '-1' '-v' '-w' '/tmp/graph18284797473267838893.weights' '-q' '0' '-e' '0.001'
[2023-03-08 23:19:35] [INFO ] Decomposing Gal with order
[2023-03-08 23:19:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 23:19:36] [INFO ] Removed a total of 4214 redundant transitions.
[2023-03-08 23:19:36] [INFO ] Flatten gal took : 464 ms
[2023-03-08 23:19:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 336 labels/synchronizations in 20 ms.
[2023-03-08 23:19:36] [INFO ] Time to serialize gal into /tmp/LTL18348023259614621671.gal : 2 ms
[2023-03-08 23:19:36] [INFO ] Time to serialize properties into /tmp/LTL5261760276056155921.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18348023259614621671.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5261760276056155921.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F("(i1.u0.SUR_PONT_B_0>=1)")))
Formula 0 simplified : G!"(i1.u0.SUR_PONT_B_0>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14919186914440961170
[2023-03-08 23:19:51] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14919186914440961170
Running compilation step : cd /tmp/ltsmin14919186914440961170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14919186914440961170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14919186914440961170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-09 finished in 75712 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 73 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 103 transition count 2226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 101 transition count 2224
Applied a total of 9 rules in 390 ms. Remains 101 /106 variables (removed 5) and now considering 2224/2228 (removed 4) transitions.
[2023-03-08 23:19:55] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 101 cols
[2023-03-08 23:19:55] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-08 23:19:55] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-08 23:19:55] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-08 23:19:55] [INFO ] Invariant cache hit.
[2023-03-08 23:19:55] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:19:55] [INFO ] Implicit Places using invariants and state equation in 555 ms returned [22, 44]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 753 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/106 places, 2224/2228 transitions.
Applied a total of 0 rules in 325 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1470 ms. Remains : 99/106 places, 2224/2228 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s38 1) (GEQ s44 1) (GEQ s52 1)) (AND (GEQ s0 1) (GEQ s23 1) (GEQ s44 1) (GEQ s71 1)) (AND (GEQ s0 1) (GEQ s34 1) (GEQ s44 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 123 steps with 0 reset in 14 ms.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-10 finished in 1595 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 44 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
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 103 transition count 2226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 101 transition count 2224
Applied a total of 9 rules in 282 ms. Remains 101 /106 variables (removed 5) and now considering 2224/2228 (removed 4) transitions.
[2023-03-08 23:19:56] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-08 23:19:56] [INFO ] Invariant cache hit.
[2023-03-08 23:19:56] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-08 23:19:56] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-08 23:19:56] [INFO ] Invariant cache hit.
[2023-03-08 23:19:56] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:19:57] [INFO ] Implicit Places using invariants and state equation in 722 ms returned [22, 44]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 934 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/106 places, 2224/2228 transitions.
Applied a total of 0 rules in 234 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1452 ms. Remains : 99/106 places, 2224/2228 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s4 1) (GEQ s21 1)) (AND (GEQ s9 1) (GEQ s21 1)) (AND (GEQ s19 1) (GEQ s21 1)) (AND (GEQ s2 1) (GEQ s21 1)) (AND (GEQ s6 1) (GEQ s21 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 123 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-11 finished in 1615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0))&&((p1&&X(!p2)) U X(p3)))))'
Support contains 98 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 7 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-08 23:19:57] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2023-03-08 23:19:57] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-08 23:19:58] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
[2023-03-08 23:19:58] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:19:58] [INFO ] Invariant cache hit.
[2023-03-08 23:19:58] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-08 23:19:58] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:19:58] [INFO ] Invariant cache hit.
[2023-03-08 23:19:58] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:19:58] [INFO ] Implicit Places using invariants and state equation in 347 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 429 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1213 ms. Remains : 105/106 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 349 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), (NOT p3), (NOT p3), (NOT p0), true]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GEQ s24 1), p3:(AND (OR (LT s0 1) (LT s17 1) (LT s23 1) (LT s48 1)) (OR (LT s0 1) (LT s11 1) (LT s23 1) (LT s48 1)) (OR (LT s0 1) (LT s5 1) (LT s23 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 2 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-12 finished in 1597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 262 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-08 23:19:59] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2023-03-08 23:19:59] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-08 23:20:00] [INFO ] Dead Transitions using invariants and state equation in 782 ms found 0 transitions.
[2023-03-08 23:20:00] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:20:00] [INFO ] Invariant cache hit.
[2023-03-08 23:20:00] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-08 23:20:00] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:20:00] [INFO ] Invariant cache hit.
[2023-03-08 23:20:00] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:20:01] [INFO ] Implicit Places using invariants and state equation in 1146 ms returned [23, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1520 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 252 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2817 ms. Remains : 103/106 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s44 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 144 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-13 finished in 2917 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!p0||F(!p1)||(X(!p2) U (X(G(!p2))||(p3&&X(!p2))))))))'
Support contains 29 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 11 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-08 23:20:02] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2023-03-08 23:20:02] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-08 23:20:03] [INFO ] Dead Transitions using invariants and state equation in 827 ms found 0 transitions.
[2023-03-08 23:20:03] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:20:03] [INFO ] Invariant cache hit.
[2023-03-08 23:20:03] [INFO ] Implicit Places using invariants in 202 ms returned []
[2023-03-08 23:20:03] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:20:03] [INFO ] Invariant cache hit.
[2023-03-08 23:20:03] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:20:04] [INFO ] Implicit Places using invariants and state equation in 1039 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1244 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 6 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2090 ms. Remains : 105/106 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 263 ms :[(AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1 p3 p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 p3), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1 p2), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p3 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 p3 p2), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1 p3 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1 p3 p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s28 1) (GEQ s46 1) (GEQ s49 1)) (AND (GEQ s0 1) (GEQ s35 1) (GEQ s46 1) (GEQ s49 1)) (AND (GEQ s0 1) (GEQ s40 1) (GEQ s46 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 602 reset in 969 ms.
Product exploration explored 100000 steps with 603 reset in 952 ms.
Computed a total of 48 stabilizing places and 84 stable transitions
Computed a total of 48 stabilizing places and 84 stable transitions
Detected a total of 48/105 stabilizing places and 84/2228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) p3), (X (NOT (AND p0 p1 p3))), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (NOT (AND p1 p3 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p3) (NOT p2)))), (X (NOT (AND p0 p1 p3 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1 (NOT p3)))), (X (NOT (AND p0 p1 p3 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (X (NOT (AND p0 p1 p3)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 p3 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p1 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND p0 p1 p3 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 1457 ms. Reduced automaton from 4 states, 18 edges and 4 AP (stutter sensitive) to 4 states, 18 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2)]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 606 ms. (steps per millisecond=16 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 401774 steps, run timeout after 6001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 401774 steps, saw 102658 distinct states, run finished after 6001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-08 23:20:16] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 105 cols
[2023-03-08 23:20:16] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-08 23:20:17] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-08 23:20:17] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:6
[2023-03-08 23:20:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-08 23:20:17] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :2
[2023-03-08 23:20:17] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:20:17] [INFO ] After 247ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :9 sat :2
[2023-03-08 23:20:18] [INFO ] After 631ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :2
Attempting to minimize the solution found.
Minimization took 240 ms.
[2023-03-08 23:20:18] [INFO ] After 1304ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :2
Fused 11 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 40 ms.
Support contains 27 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 2228/2228 transitions.
Applied a total of 0 rules in 233 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-08 23:20:18] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:20:18] [INFO ] Invariant cache hit.
[2023-03-08 23:20:19] [INFO ] Dead Transitions using invariants and state equation in 726 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 977 ms. Remains : 105/105 places, 2228/2228 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 283824 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 283824 steps, saw 74245 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-08 23:20:22] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:20:22] [INFO ] Invariant cache hit.
[2023-03-08 23:20:22] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-08 23:20:22] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 23:20:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 23:20:23] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 23:20:23] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:20:23] [INFO ] After 284ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 23:20:23] [INFO ] After 594ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 230 ms.
[2023-03-08 23:20:24] [INFO ] After 1163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 168 ms.
Support contains 27 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 2228/2228 transitions.
Applied a total of 0 rules in 232 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 105/105 places, 2228/2228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 2228/2228 transitions.
Applied a total of 0 rules in 231 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-08 23:20:24] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:20:24] [INFO ] Invariant cache hit.
[2023-03-08 23:20:25] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-08 23:20:25] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:20:25] [INFO ] Invariant cache hit.
[2023-03-08 23:20:25] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:20:25] [INFO ] Implicit Places using invariants and state equation in 927 ms returned []
Implicit Place search using SMT with State Equation took 1243 ms to find 0 implicit places.
[2023-03-08 23:20:26] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-08 23:20:26] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:20:26] [INFO ] Invariant cache hit.
[2023-03-08 23:20:26] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2171 ms. Remains : 105/105 places, 2228/2228 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 105 transition count 290
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 1939 place count 105 transition count 289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1940 place count 104 transition count 289
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 1941 place count 104 transition count 289
Applied a total of 1941 rules in 14 ms. Remains 104 /105 variables (removed 1) and now considering 289/2228 (removed 1939) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 289 rows 104 cols
[2023-03-08 23:20:26] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-08 23:20:26] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-08 23:20:26] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 23:20:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 23:20:27] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 23:20:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 23:20:27] [INFO ] After 163ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 23:20:27] [INFO ] After 554ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 239 ms.
[2023-03-08 23:20:27] [INFO ] After 1116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 9 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) p3), (X (NOT (AND p0 p1 p3))), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (NOT (AND p1 p3 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p3) (NOT p2)))), (X (NOT (AND p0 p1 p3 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1 (NOT p3)))), (X (NOT (AND p0 p1 p3 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (X (NOT (AND p0 p1 p3)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 p3 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p1 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND p0 p1 p3 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND p1 (NOT p3) p0))), (G (NOT (AND p1 (NOT p3) (NOT p2)))), (G (NOT (AND p1 p3 p0))), (G (NOT (AND p1 p3 p2 p0))), (G (NOT (AND p1 (NOT p3) p2 p0))), (G (NOT (AND p1 (NOT p2) (NOT p0)))), (G (NOT (AND p1 p3 (NOT p2) p0))), (G (NOT (AND p1 p3 (NOT p2)))), (G (NOT (AND p1 (NOT p3) (NOT p2) p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G (NOT (AND p1 p3 p0)))
Knowledge based reduction with 33 factoid took 1074 ms. Reduced automaton from 4 states, 18 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-14 finished in 26702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!p0||((!p1||X(!p1)) U (G((!p1||X(!p1)))||(!p2&&(!p1||X(!p1)))))))))'
Support contains 96 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 7 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-08 23:20:29] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2023-03-08 23:20:29] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-08 23:20:29] [INFO ] Dead Transitions using invariants and state equation in 747 ms found 0 transitions.
[2023-03-08 23:20:29] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:20:29] [INFO ] Invariant cache hit.
[2023-03-08 23:20:29] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-08 23:20:29] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:20:29] [INFO ] Invariant cache hit.
[2023-03-08 23:20:30] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:20:30] [INFO ] Implicit Places using invariants and state equation in 431 ms returned [23, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 478 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 7 ms. Remains 104 /104 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1242 ms. Remains : 104/106 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 268 ms :[(AND p0 p1), (AND p0 p1), p1, (AND (NOT p0) p1), true]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s12 1) (GEQ s24 1) (GEQ s48 1) (GEQ s87 1)) (AND (GEQ s16 1) (GEQ s24 1) (GEQ s48 1) (GEQ s99 1)) (AND (GEQ s4 1) (GEQ s24 1) (GEQ s48 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 602 reset in 6990 ms.
Product exploration explored 100000 steps with 602 reset in 6238 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/104 stabilizing places and 84/2228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge based reduction with 9 factoid took 788 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 331 ms :[(AND p0 p1), (AND p0 p1), p1, (AND (NOT p0) p1), true]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 834 ms. (steps per millisecond=11 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 1130 ms. (steps per millisecond=8 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 1411 ms. (steps per millisecond=7 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 23:20:48] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 104 cols
[2023-03-08 23:20:48] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-08 23:20:51] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 23:20:54] [INFO ] After 3452ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-08 23:20:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 23:20:58] [INFO ] After 3546ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-08 23:20:58] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:21:01] [INFO ] After 3339ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-08 23:21:04] [INFO ] After 6343ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 3261 ms.
[2023-03-08 23:21:07] [INFO ] After 13290ms 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 3 ms.
Support contains 74 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 2228/2228 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 103 transition count 2227
Applied a total of 2 rules in 233 ms. Remains 103 /104 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-08 23:21:07] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2023-03-08 23:21:07] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-08 23:21:08] [INFO ] Dead Transitions using invariants and state equation in 757 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 993 ms. Remains : 103/104 places, 2227/2228 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 884 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 186963 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 186963 steps, saw 50924 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 23:21:12] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:21:12] [INFO ] Invariant cache hit.
[2023-03-08 23:21:13] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 23:21:16] [INFO ] After 3549ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 23:21:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 17 ms returned sat
[2023-03-08 23:21:20] [INFO ] After 3668ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 23:21:20] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:21:24] [INFO ] After 3392ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 23:21:27] [INFO ] After 6812ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3435 ms.
[2023-03-08 23:21:30] [INFO ] After 14048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 74 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 250 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 103/103 places, 2227/2227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 211 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-08 23:21:31] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:21:31] [INFO ] Invariant cache hit.
[2023-03-08 23:21:31] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-08 23:21:31] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:21:31] [INFO ] Invariant cache hit.
[2023-03-08 23:21:31] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:21:32] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
[2023-03-08 23:21:32] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-08 23:21:32] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:21:32] [INFO ] Invariant cache hit.
[2023-03-08 23:21:33] [INFO ] Dead Transitions using invariants and state equation in 824 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1840 ms. Remains : 103/103 places, 2227/2227 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 103 transition count 289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1942 place count 101 transition count 287
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 1943 place count 101 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1944 place count 100 transition count 286
Applied a total of 1944 rules in 16 ms. Remains 100 /103 variables (removed 3) and now considering 286/2227 (removed 1941) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 286 rows 100 cols
[2023-03-08 23:21:33] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-08 23:21:33] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 23:21:37] [INFO ] After 3768ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 23:21:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 23:21:40] [INFO ] After 3342ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 23:21:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 23:21:44] [INFO ] After 3179ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 23:21:47] [INFO ] After 6449ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3191 ms.
[2023-03-08 23:21:50] [INFO ] After 13101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (AND (NOT p0) p2)), (F (AND (NOT p0) p1)), (F p1)]
Knowledge based reduction with 10 factoid took 777 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[true, p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 186 ms :[true, p1, (AND p1 p0), (AND p1 p0)]
Support contains 74 out of 104 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 2228/2228 transitions.
Applied a total of 0 rules in 10 ms. Remains 104 /104 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-08 23:21:51] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 104 cols
[2023-03-08 23:21:51] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-08 23:21:52] [INFO ] Dead Transitions using invariants and state equation in 844 ms found 0 transitions.
[2023-03-08 23:21:52] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:21:52] [INFO ] Invariant cache hit.
[2023-03-08 23:21:52] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-08 23:21:52] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:21:52] [INFO ] Invariant cache hit.
[2023-03-08 23:21:52] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:21:52] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2023-03-08 23:21:52] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:21:52] [INFO ] Invariant cache hit.
[2023-03-08 23:21:53] [INFO ] Dead Transitions using invariants and state equation in 796 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1940 ms. Remains : 104/104 places, 2228/2228 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/104 stabilizing places and 84/2228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (OR (NOT p1) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 402 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[true, p1, (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 972 ms. (steps per millisecond=10 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 818 ms. (steps per millisecond=12 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 23:21:56] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:21:56] [INFO ] Invariant cache hit.
[2023-03-08 23:21:57] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 23:22:03] [INFO ] After 6468ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 23:22:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 23:22:10] [INFO ] After 6366ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 23:22:10] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:22:17] [INFO ] After 7404ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 23:22:24] [INFO ] After 14488ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:692)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-08 23:22:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-08 23:22:29] [INFO ] After 25786ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 8 ms.
Support contains 74 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 2228/2228 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 103 transition count 2227
Applied a total of 2 rules in 209 ms. Remains 103 /104 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-08 23:22:29] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2023-03-08 23:22:29] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 23:22:30] [INFO ] Dead Transitions using invariants and state equation in 719 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 928 ms. Remains : 103/104 places, 2227/2228 transitions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 427 ms. (steps per millisecond=23 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 856 ms. (steps per millisecond=11 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 752 ms. (steps per millisecond=13 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 218006 steps, run timeout after 6001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 218006 steps, saw 58274 distinct states, run finished after 6001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-08 23:22:38] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:22:38] [INFO ] Invariant cache hit.
[2023-03-08 23:22:39] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-08 23:22:47] [INFO ] After 7525ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 23:22:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 23:22:54] [INFO ] After 7386ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 23:22:54] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:23:01] [INFO ] After 6656ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 23:23:08] [INFO ] After 13486ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:692)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-08 23:23:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-08 23:23:13] [INFO ] After 25820ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 7 ms.
Support contains 74 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 173 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 103/103 places, 2227/2227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 200 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-08 23:23:13] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:23:13] [INFO ] Invariant cache hit.
[2023-03-08 23:23:13] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-08 23:23:13] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:23:13] [INFO ] Invariant cache hit.
[2023-03-08 23:23:13] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:23:14] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
[2023-03-08 23:23:14] [INFO ] Redundant transitions in 80 ms returned []
[2023-03-08 23:23:14] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:23:14] [INFO ] Invariant cache hit.
[2023-03-08 23:23:15] [INFO ] Dead Transitions using invariants and state equation in 763 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1776 ms. Remains : 103/103 places, 2227/2227 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 103 transition count 289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1942 place count 101 transition count 287
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 1943 place count 101 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1944 place count 100 transition count 286
Applied a total of 1944 rules in 10 ms. Remains 100 /103 variables (removed 3) and now considering 286/2227 (removed 1941) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 286 rows 100 cols
[2023-03-08 23:23:15] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-08 23:23:16] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 23:23:24] [INFO ] After 8887ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 23:23:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-08 23:23:32] [INFO ] After 7048ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 23:23:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 23:23:39] [INFO ] After 7062ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 23:23:45] [INFO ] After 13317ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6419 ms.
[2023-03-08 23:23:51] [INFO ] After 26942ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (OR (NOT p1) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 325 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[true, p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 173 ms :[true, p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 156 ms :[true, p1, (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 602 reset in 6057 ms.
Product exploration explored 100000 steps with 602 reset in 6313 ms.
Built C files in :
/tmp/ltsmin8510413409344774856
[2023-03-08 23:24:05] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8510413409344774856
Running compilation step : cd /tmp/ltsmin8510413409344774856;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8510413409344774856;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8510413409344774856;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 74 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 2228/2228 transitions.
Applied a total of 0 rules in 16 ms. Remains 104 /104 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-08 23:24:08] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 104 cols
[2023-03-08 23:24:08] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-08 23:24:09] [INFO ] Dead Transitions using invariants and state equation in 747 ms found 0 transitions.
[2023-03-08 23:24:09] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:24:09] [INFO ] Invariant cache hit.
[2023-03-08 23:24:09] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-08 23:24:09] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:24:09] [INFO ] Invariant cache hit.
[2023-03-08 23:24:09] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:24:09] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
[2023-03-08 23:24:09] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-08 23:24:09] [INFO ] Invariant cache hit.
[2023-03-08 23:24:10] [INFO ] Dead Transitions using invariants and state equation in 736 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2135 ms. Remains : 104/104 places, 2228/2228 transitions.
Built C files in :
/tmp/ltsmin13251558669755072524
[2023-03-08 23:24:10] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13251558669755072524
Running compilation step : cd /tmp/ltsmin13251558669755072524;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13251558669755072524;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13251558669755072524;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-08 23:24:13] [INFO ] Flatten gal took : 86 ms
[2023-03-08 23:24:13] [INFO ] Flatten gal took : 90 ms
[2023-03-08 23:24:13] [INFO ] Time to serialize gal into /tmp/LTL4452588678164516056.gal : 16 ms
[2023-03-08 23:24:13] [INFO ] Time to serialize properties into /tmp/LTL1981328652253258302.prop : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4452588678164516056.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12449089219342110539.hoa' '-atoms' '/tmp/LTL1981328652253258302.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1981328652253258302.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12449089219342110539.hoa
Detected timeout of ITS tools.
[2023-03-08 23:24:29] [INFO ] Flatten gal took : 151 ms
[2023-03-08 23:24:29] [INFO ] Flatten gal took : 117 ms
[2023-03-08 23:24:29] [INFO ] Time to serialize gal into /tmp/LTL2184100319726281722.gal : 14 ms
[2023-03-08 23:24:29] [INFO ] Time to serialize properties into /tmp/LTL3390431387377374259.ltl : 25 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2184100319726281722.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3390431387377374259.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G(((("(SUR_PONT_A_0<1)")||(X("(SUR_PONT_A_0<1)")))U((G(("(SUR_PONT_A_0<1)")||(X("(SUR_PONT_A_0<1)"))))||((!("(((((((((((((NB_ATTE...174314
Formula 0 simplified : XF(!"(((((((((((((NB_ATTENTE_A_11<1)||(NB_ATTENTE_B_0<1))||((CONTROLEUR_1<1)||(COMPTEUR_36<1)))&&(((NB_ATTENTE_A_15<1)||(NB_ATTENTE_...174198
Detected timeout of ITS tools.
[2023-03-08 23:24:44] [INFO ] Flatten gal took : 129 ms
[2023-03-08 23:24:44] [INFO ] Applying decomposition
[2023-03-08 23:24:45] [INFO ] Flatten gal took : 122 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10305981704597946034.txt' '-o' '/tmp/graph10305981704597946034.bin' '-w' '/tmp/graph10305981704597946034.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10305981704597946034.bin' '-l' '-1' '-v' '-w' '/tmp/graph10305981704597946034.weights' '-q' '0' '-e' '0.001'
[2023-03-08 23:24:45] [INFO ] Decomposing Gal with order
[2023-03-08 23:24:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 23:24:45] [INFO ] Removed a total of 4214 redundant transitions.
[2023-03-08 23:24:46] [INFO ] Flatten gal took : 538 ms
[2023-03-08 23:24:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 297 labels/synchronizations in 17 ms.
[2023-03-08 23:24:46] [INFO ] Time to serialize gal into /tmp/LTL9812018440134362576.gal : 2 ms
[2023-03-08 23:24:46] [INFO ] Time to serialize properties into /tmp/LTL4713159530417013295.ltl : 41 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9812018440134362576.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4713159530417013295.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G(((("(u0.SUR_PONT_A_0<1)")||(X("(u0.SUR_PONT_A_0<1)")))U((G(("(u0.SUR_PONT_A_0<1)")||(X("(u0.SUR_PONT_A_0<1)"))))||((!("((((((((...214112
Formula 0 simplified : XF(!"(((((((((((((u3.NB_ATTENTE_A_11<1)||(u3.NB_ATTENTE_B_0<1))||((u3.CONTROLEUR_1<1)||(i1.u2.COMPTEUR_36<1)))&&(((u3.NB_ATTENTE_A_1...213984
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13265548229727313904
[2023-03-08 23:25:01] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13265548229727313904
Running compilation step : cd /tmp/ltsmin13265548229727313904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13265548229727313904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13265548229727313904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-15 finished in 275326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!p0||((!p1||X(!p1)) U (G((!p1||X(!p1)))||(!p2&&(!p1||X(!p1)))))))))'
Found a Lengthening insensitive property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-15
Stuttering acceptance computed with spot in 235 ms :[(AND p0 p1), (AND p0 p1), p1, (AND (NOT p0) p1), true]
Support contains 96 out of 106 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 49 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-08 23:25:05] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2023-03-08 23:25:05] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-08 23:25:05] [INFO ] Dead Transitions using invariants and state equation in 800 ms found 0 transitions.
[2023-03-08 23:25:05] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:25:05] [INFO ] Invariant cache hit.
[2023-03-08 23:25:05] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 23:25:05] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:25:05] [INFO ] Invariant cache hit.
[2023-03-08 23:25:06] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:25:06] [INFO ] Implicit Places using invariants and state equation in 400 ms returned [23, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 447 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 103/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 32 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1330 ms. Remains : 103/106 places, 2227/2228 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s12 1) (GEQ s24 1) (GEQ s47 1) (GEQ s86 1)) (AND (GEQ s16 1) (GEQ s24 1) (GEQ s47 1) (GEQ s98 1)) (AND (GEQ s4 1) (GEQ s24 1) (GEQ s47 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 685 reset in 6447 ms.
Product exploration explored 100000 steps with 685 reset in 6212 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/103 stabilizing places and 83/2227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge based reduction with 9 factoid took 691 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND p0 p1), (AND p0 p1), p1, (AND (NOT p0) p1), true]
Incomplete random walk after 10000 steps, including 66 resets, run finished after 710 ms. (steps per millisecond=14 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 846 ms. (steps per millisecond=11 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 1332 ms. (steps per millisecond=7 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 23:25:23] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2023-03-08 23:25:23] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-08 23:25:25] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 23:25:28] [INFO ] After 3536ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-08 23:25:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-08 23:25:32] [INFO ] After 3614ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-08 23:25:32] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:25:35] [INFO ] After 3326ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-08 23:25:39] [INFO ] After 6763ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 3340 ms.
[2023-03-08 23:25:42] [INFO ] After 13869ms 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 3 ms.
Support contains 74 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 274 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-08 23:25:42] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:25:42] [INFO ] Invariant cache hit.
[2023-03-08 23:25:43] [INFO ] Dead Transitions using invariants and state equation in 806 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1082 ms. Remains : 103/103 places, 2227/2227 transitions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 663 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 217839 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 217839 steps, saw 58239 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 23:25:47] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:25:47] [INFO ] Invariant cache hit.
[2023-03-08 23:25:48] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 23:25:51] [INFO ] After 3209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 23:25:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 23:25:54] [INFO ] After 3471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 23:25:54] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:25:58] [INFO ] After 3451ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 23:26:01] [INFO ] After 6959ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3499 ms.
[2023-03-08 23:26:05] [INFO ] After 14025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 74 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 260 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 260 ms. Remains : 103/103 places, 2227/2227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 198 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-08 23:26:05] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:26:05] [INFO ] Invariant cache hit.
[2023-03-08 23:26:05] [INFO ] Implicit Places using invariants in 202 ms returned []
[2023-03-08 23:26:05] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:26:05] [INFO ] Invariant cache hit.
[2023-03-08 23:26:06] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:26:06] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
[2023-03-08 23:26:06] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-08 23:26:06] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:26:06] [INFO ] Invariant cache hit.
[2023-03-08 23:26:07] [INFO ] Dead Transitions using invariants and state equation in 887 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1994 ms. Remains : 103/103 places, 2227/2227 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 103 transition count 289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1942 place count 101 transition count 287
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 1943 place count 101 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1944 place count 100 transition count 286
Applied a total of 1944 rules in 11 ms. Remains 100 /103 variables (removed 3) and now considering 286/2227 (removed 1941) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 286 rows 100 cols
[2023-03-08 23:26:07] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-08 23:26:08] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 23:26:11] [INFO ] After 3602ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 23:26:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-08 23:26:15] [INFO ] After 3424ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 23:26:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 23:26:18] [INFO ] After 3245ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 23:26:22] [INFO ] After 6590ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2966 ms.
[2023-03-08 23:26:25] [INFO ] After 13109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (AND (NOT p0) p2)), (F (AND (NOT p0) p1)), (F p1)]
Knowledge based reduction with 10 factoid took 812 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 172 ms :[true, p1, (AND p1 p0), (AND p1 p0)]
Support contains 74 out of 103 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 8 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-08 23:26:26] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2023-03-08 23:26:26] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-08 23:26:27] [INFO ] Dead Transitions using invariants and state equation in 794 ms found 0 transitions.
[2023-03-08 23:26:27] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:26:27] [INFO ] Invariant cache hit.
[2023-03-08 23:26:27] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-08 23:26:27] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:26:27] [INFO ] Invariant cache hit.
[2023-03-08 23:26:27] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:26:27] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2023-03-08 23:26:27] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:26:27] [INFO ] Invariant cache hit.
[2023-03-08 23:26:28] [INFO ] Dead Transitions using invariants and state equation in 653 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1753 ms. Remains : 103/103 places, 2227/2227 transitions.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/103 stabilizing places and 83/2227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (OR (NOT p1) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 449 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[true, p1, (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 66 resets, run finished after 461 ms. (steps per millisecond=21 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 1030 ms. (steps per millisecond=9 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 927 ms. (steps per millisecond=10 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 23:26:31] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:26:31] [INFO ] Invariant cache hit.
[2023-03-08 23:26:32] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 23:26:39] [INFO ] After 6959ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 23:26:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 23:26:46] [INFO ] After 6675ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 23:26:46] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:26:53] [INFO ] After 6805ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 23:27:00] [INFO ] After 13740ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:692)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-08 23:27:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-08 23:27:05] [INFO ] After 25746ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 6 ms.
Support contains 74 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 162 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-08 23:27:05] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:27:05] [INFO ] Invariant cache hit.
[2023-03-08 23:27:06] [INFO ] Dead Transitions using invariants and state equation in 763 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 935 ms. Remains : 103/103 places, 2227/2227 transitions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 778 ms. (steps per millisecond=12 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 706 ms. (steps per millisecond=14 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 103275 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103275 steps, saw 29052 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-08 23:27:11] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:27:11] [INFO ] Invariant cache hit.
[2023-03-08 23:27:12] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 23:27:19] [INFO ] After 7057ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 23:27:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-08 23:27:27] [INFO ] After 7119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 23:27:27] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:27:33] [INFO ] After 6799ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 23:27:41] [INFO ] After 14097ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:692)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-08 23:27:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-08 23:27:46] [INFO ] After 26490ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 7 ms.
Support contains 74 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 204 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 103/103 places, 2227/2227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 238 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-08 23:27:46] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:27:46] [INFO ] Invariant cache hit.
[2023-03-08 23:27:46] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-08 23:27:46] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:27:46] [INFO ] Invariant cache hit.
[2023-03-08 23:27:47] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:27:47] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
[2023-03-08 23:27:47] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-08 23:27:47] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:27:47] [INFO ] Invariant cache hit.
[2023-03-08 23:27:48] [INFO ] Dead Transitions using invariants and state equation in 800 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1882 ms. Remains : 103/103 places, 2227/2227 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 103 transition count 289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1942 place count 101 transition count 287
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 1943 place count 101 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1944 place count 100 transition count 286
Applied a total of 1944 rules in 13 ms. Remains 100 /103 variables (removed 3) and now considering 286/2227 (removed 1941) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 286 rows 100 cols
[2023-03-08 23:27:48] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-08 23:27:49] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 23:27:56] [INFO ] After 6706ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 23:27:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 23:28:03] [INFO ] After 6467ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 23:28:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 23:28:09] [INFO ] After 6541ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 23:28:15] [INFO ] After 12853ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6210 ms.
[2023-03-08 23:28:22] [INFO ] After 25687ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (OR (NOT p1) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 395 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[true, p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 188 ms :[true, p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 182 ms :[true, p1, (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 685 reset in 6367 ms.
Product exploration explored 100000 steps with 685 reset in 6070 ms.
Built C files in :
/tmp/ltsmin12140513669821916463
[2023-03-08 23:28:35] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12140513669821916463
Running compilation step : cd /tmp/ltsmin12140513669821916463;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12140513669821916463;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12140513669821916463;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 74 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 5 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-08 23:28:38] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2023-03-08 23:28:38] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-08 23:28:39] [INFO ] Dead Transitions using invariants and state equation in 663 ms found 0 transitions.
[2023-03-08 23:28:39] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:28:39] [INFO ] Invariant cache hit.
[2023-03-08 23:28:39] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-08 23:28:39] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:28:39] [INFO ] Invariant cache hit.
[2023-03-08 23:28:39] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-08 23:28:40] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 726 ms to find 0 implicit places.
[2023-03-08 23:28:40] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-08 23:28:40] [INFO ] Invariant cache hit.
[2023-03-08 23:28:40] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2029 ms. Remains : 103/103 places, 2227/2227 transitions.
Built C files in :
/tmp/ltsmin1858054433503936901
[2023-03-08 23:28:40] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1858054433503936901
Running compilation step : cd /tmp/ltsmin1858054433503936901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1858054433503936901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1858054433503936901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-08 23:28:44] [INFO ] Flatten gal took : 70 ms
[2023-03-08 23:28:44] [INFO ] Flatten gal took : 72 ms
[2023-03-08 23:28:44] [INFO ] Time to serialize gal into /tmp/LTL8586853625649976216.gal : 14 ms
[2023-03-08 23:28:44] [INFO ] Time to serialize properties into /tmp/LTL9814622544574516607.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8586853625649976216.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8396725277754595434.hoa' '-atoms' '/tmp/LTL9814622544574516607.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9814622544574516607.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8396725277754595434.hoa
Detected timeout of ITS tools.
[2023-03-08 23:28:59] [INFO ] Flatten gal took : 118 ms
[2023-03-08 23:28:59] [INFO ] Flatten gal took : 136 ms
[2023-03-08 23:28:59] [INFO ] Time to serialize gal into /tmp/LTL1495270536302863663.gal : 15 ms
[2023-03-08 23:28:59] [INFO ] Time to serialize properties into /tmp/LTL10103156788278661404.ltl : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1495270536302863663.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10103156788278661404.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(((("(SUR_PONT_A_0<1)")||(X("(SUR_PONT_A_0<1)")))U((G(("(SUR_PONT_A_0<1)")||(X("(SUR_PONT_A_0<1)"))))||((!("(((((((((((((NB_ATTE...174314
Formula 0 simplified : XF(!"(((((((((((((NB_ATTENTE_A_11<1)||(NB_ATTENTE_B_0<1))||((CONTROLEUR_1<1)||(COMPTEUR_36<1)))&&(((NB_ATTENTE_A_15<1)||(NB_ATTENTE_...174198
Detected timeout of ITS tools.
[2023-03-08 23:29:15] [INFO ] Flatten gal took : 119 ms
[2023-03-08 23:29:15] [INFO ] Applying decomposition
[2023-03-08 23:29:15] [INFO ] Flatten gal took : 101 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14803398582605364975.txt' '-o' '/tmp/graph14803398582605364975.bin' '-w' '/tmp/graph14803398582605364975.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14803398582605364975.bin' '-l' '-1' '-v' '-w' '/tmp/graph14803398582605364975.weights' '-q' '0' '-e' '0.001'
[2023-03-08 23:29:15] [INFO ] Decomposing Gal with order
[2023-03-08 23:29:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 23:29:15] [INFO ] Removed a total of 4214 redundant transitions.
[2023-03-08 23:29:16] [INFO ] Flatten gal took : 442 ms
[2023-03-08 23:29:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 336 labels/synchronizations in 11 ms.
[2023-03-08 23:29:16] [INFO ] Time to serialize gal into /tmp/LTL10667798952288365194.gal : 4 ms
[2023-03-08 23:29:16] [INFO ] Time to serialize properties into /tmp/LTL8940893669573744804.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10667798952288365194.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8940893669573744804.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G(((("(i1.u2.SUR_PONT_A_0<1)")||(X("(i1.u2.SUR_PONT_A_0<1)")))U((G(("(i1.u2.SUR_PONT_A_0<1)")||(X("(i1.u2.SUR_PONT_A_0<1)"))))||(...223310
Formula 0 simplified : XF(!"(((((((((((((i1.u1.NB_ATTENTE_A_11<1)||(i1.u1.NB_ATTENTE_B_0<1))||((i1.u1.CONTROLEUR_1<1)||(i0.u0.COMPTEUR_36<1)))&&(((i1.u1.NB...223170
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1093646693978185620
[2023-03-08 23:29:31] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1093646693978185620
Running compilation step : cd /tmp/ltsmin1093646693978185620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1093646693978185620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1093646693978185620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-15 finished in 269592 ms.
[2023-03-08 23:29:34] [INFO ] Flatten gal took : 142 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7634197559582001476
[2023-03-08 23:29:34] [INFO ] Too many transitions (2228) to apply POR reductions. Disabling POR matrices.
[2023-03-08 23:29:34] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7634197559582001476
Running compilation step : cd /tmp/ltsmin7634197559582001476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-08 23:29:34] [INFO ] Applying decomposition
[2023-03-08 23:29:34] [INFO ] Flatten gal took : 131 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5675043116074717556.txt' '-o' '/tmp/graph5675043116074717556.bin' '-w' '/tmp/graph5675043116074717556.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5675043116074717556.bin' '-l' '-1' '-v' '-w' '/tmp/graph5675043116074717556.weights' '-q' '0' '-e' '0.001'
[2023-03-08 23:29:35] [INFO ] Decomposing Gal with order
[2023-03-08 23:29:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 23:29:35] [INFO ] Removed a total of 4292 redundant transitions.
[2023-03-08 23:29:35] [INFO ] Flatten gal took : 688 ms
[2023-03-08 23:29:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 393 labels/synchronizations in 18 ms.
[2023-03-08 23:29:35] [INFO ] Time to serialize gal into /tmp/LTLFireability6117431505471547317.gal : 2 ms
[2023-03-08 23:29:35] [INFO ] Time to serialize properties into /tmp/LTLFireability10501236154546937515.ltl : 20 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6117431505471547317.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10501236154546937515.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 4 LTL properties
Checking formula 0 : !((G(F("((((((((i0.u0.CAPACITE_0>=1)&&(i1.u1.NB_ATTENTE_B_4>=1))&&((i0.u3.ATTENTE_B_0>=1)&&(i2.u5.CONTROLEUR_1>=1)))||(((i0.u0.CAPACIT...2181
Formula 0 simplified : FG!"((((((((i0.u0.CAPACITE_0>=1)&&(i1.u1.NB_ATTENTE_B_4>=1))&&((i0.u3.ATTENTE_B_0>=1)&&(i2.u5.CONTROLEUR_1>=1)))||(((i0.u0.CAPACITE_...2175
Compilation finished in 6550 ms.
Running link step : cd /tmp/ltsmin7634197559582001476;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin7634197559582001476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t42, t43, t45, t1934, i0.u0.t21, i0.u0.t44, i1.t845, Intersection with reachable at each...215
Computing Next relation with stutter on 40 deadlock states
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin7634197559582001476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7634197559582001476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-08 23:54:15] [INFO ] Applying decomposition
[2023-03-08 23:54:15] [INFO ] Flatten gal took : 237 ms
[2023-03-08 23:54:15] [INFO ] Decomposing Gal with order
[2023-03-08 23:54:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 23:54:16] [INFO ] Removed a total of 12670 redundant transitions.
[2023-03-08 23:54:16] [INFO ] Flatten gal took : 634 ms
[2023-03-08 23:54:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 73 ms.
[2023-03-08 23:54:16] [INFO ] Time to serialize gal into /tmp/LTLFireability5959093732761260739.gal : 56 ms
[2023-03-08 23:54:16] [INFO ] Time to serialize properties into /tmp/LTLFireability18246779252866908498.ltl : 49 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5959093732761260739.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18246779252866908498.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 4 LTL properties
Checking formula 0 : !((G(F("((((((((CAPACITE.CAPACITE_0>=1)&&(voitureB4.NB_ATTENTE_B_4>=1))&&((ATTENTE_B.ATTENTE_B_0>=1)&&(sens1.CONTROLEUR_1>=1)))||(((CA...2412
Formula 0 simplified : FG!"((((((((CAPACITE.CAPACITE_0>=1)&&(voitureB4.NB_ATTENTE_B_4>=1))&&((ATTENTE_B.ATTENTE_B_0>=1)&&(sens1.CONTROLEUR_1>=1)))||(((CAPA...2406
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin7634197559582001476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp1==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7634197559582001476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp2==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin7634197559582001476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp2==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7634197559582001476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((!(LTLAPp3==true)||((!(LTLAPp4==true)||X(!(LTLAPp4==true))) U ([]((!(LTLAPp4==true)||X(!(LTLAPp4==true))))||(!(LTLAPp5==true)&&(!(LTLAPp4==true)||X(!(LTLAPp4==true)))))))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 3856848 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16032960 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V20P20N50"
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-5348"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-COL-V20P20N50, 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 r037-tajo-167813689800060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V20P20N50.tgz
mv BridgeAndVehicles-COL-V20P20N50 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 ;