About the Execution of ITS-Tools for ShieldIIPs-PT-100A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12523.527 | 3600000.00 | 7922326.00 | 32039.80 | F??TTF??F?F?F?TF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r389-oct2-167903713200164.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldIIPs-PT-100A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713200164
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.3K Feb 25 16:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 16:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 15:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 15:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 16:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 868K Mar 5 18:23 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 ShieldIIPs-PT-100A-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-100A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679180341136
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=ShieldIIPs-PT-100A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 22:59:03] [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-18 22:59:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 22:59:04] [INFO ] Load time of PNML (sax parser for PT used): 202 ms
[2023-03-18 22:59:04] [INFO ] Transformed 2503 places.
[2023-03-18 22:59:04] [INFO ] Transformed 2403 transitions.
[2023-03-18 22:59:04] [INFO ] Found NUPN structural information;
[2023-03-18 22:59:04] [INFO ] Parsed PT model containing 2503 places and 2403 transitions and 10806 arcs in 453 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPs-PT-100A-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 282 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-18 22:59:04] [INFO ] Computed 901 place invariants in 65 ms
[2023-03-18 22:59:07] [INFO ] Implicit Places using invariants in 2983 ms returned []
[2023-03-18 22:59:07] [INFO ] Invariant cache hit.
[2023-03-18 22:59:09] [INFO ] Implicit Places using invariants and state equation in 1910 ms returned []
Implicit Place search using SMT with State Equation took 4924 ms to find 0 implicit places.
[2023-03-18 22:59:09] [INFO ] Invariant cache hit.
[2023-03-18 22:59:11] [INFO ] Dead Transitions using invariants and state equation in 1824 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7048 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Support contains 58 out of 2503 places after structural reductions.
[2023-03-18 22:59:12] [INFO ] Flatten gal took : 421 ms
[2023-03-18 22:59:12] [INFO ] Flatten gal took : 204 ms
[2023-03-18 22:59:12] [INFO ] Input system was already deterministic with 2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 671 ms. (steps per millisecond=14 ) properties (out of 27) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-18 22:59:15] [INFO ] Invariant cache hit.
[2023-03-18 22:59:17] [INFO ] [Real]Absence check using 901 positive place invariants in 318 ms returned sat
[2023-03-18 22:59:22] [INFO ] After 6670ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-18 22:59:23] [INFO ] [Nat]Absence check using 901 positive place invariants in 412 ms returned sat
[2023-03-18 22:59:47] [INFO ] After 23067ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-18 22:59:47] [INFO ] After 23077ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-18 22:59:47] [INFO ] After 25042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 12 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 5029 ms.
Support contains 33 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 681 times.
Drop transitions removed 681 transitions
Iterating global reduction 0 with 681 rules applied. Total rules applied 685 place count 2501 transition count 2401
Applied a total of 685 rules in 410 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 411 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 117081 steps, run timeout after 6001 ms. (steps per millisecond=19 ) properties seen :{0=1, 1=1, 3=1, 5=1, 6=1, 7=1, 8=1, 9=1}
Probabilistic random walk after 117081 steps, saw 112515 distinct states, run finished after 6003 ms. (steps per millisecond=19 ) properties seen :8
Running SMT prover for 3 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-18 23:00:01] [INFO ] Computed 901 place invariants in 116 ms
[2023-03-18 23:00:01] [INFO ] [Real]Absence check using 892 positive place invariants in 231 ms returned sat
[2023-03-18 23:00:01] [INFO ] [Real]Absence check using 892 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-18 23:00:03] [INFO ] After 2917ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 23:00:04] [INFO ] [Nat]Absence check using 892 positive place invariants in 283 ms returned sat
[2023-03-18 23:00:04] [INFO ] [Nat]Absence check using 892 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-18 23:00:29] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 2501 transition count 2401
Applied a total of 12 rules in 282 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 282 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 82792 steps, run timeout after 3002 ms. (steps per millisecond=27 ) properties seen :{2=1}
Probabilistic random walk after 82792 steps, saw 80083 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-18 23:00:33] [INFO ] Computed 901 place invariants in 96 ms
[2023-03-18 23:00:33] [INFO ] [Real]Absence check using 897 positive place invariants in 215 ms returned sat
[2023-03-18 23:00:33] [INFO ] [Real]Absence check using 897 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-18 23:00:36] [INFO ] After 3018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 23:00:37] [INFO ] [Nat]Absence check using 897 positive place invariants in 506 ms returned sat
[2023-03-18 23:00:37] [INFO ] [Nat]Absence check using 897 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-18 23:00:57] [INFO ] After 21121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2501 transition count 2401
Applied a total of 2 rules in 369 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 369 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Computed a total of 1 stabilizing places and 1 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' '!(G(F((p0&&X(p1)))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 146 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-18 23:00:58] [INFO ] Computed 901 place invariants in 33 ms
[2023-03-18 23:01:01] [INFO ] Implicit Places using invariants in 3268 ms returned []
[2023-03-18 23:01:01] [INFO ] Invariant cache hit.
[2023-03-18 23:01:07] [INFO ] Implicit Places using invariants and state equation in 5194 ms returned []
Implicit Place search using SMT with State Equation took 8473 ms to find 0 implicit places.
[2023-03-18 23:01:07] [INFO ] Invariant cache hit.
[2023-03-18 23:01:08] [INFO ] Dead Transitions using invariants and state equation in 1416 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10039 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 444 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s2150 0), p1:(OR (EQ s936 0) (EQ s940 0) (EQ s951 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33377 reset in 5404 ms.
Product exploration explored 100000 steps with 33424 reset in 5949 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 481 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 23:01:21] [INFO ] Invariant cache hit.
[2023-03-18 23:01:22] [INFO ] [Real]Absence check using 901 positive place invariants in 257 ms returned sat
[2023-03-18 23:01:24] [INFO ] After 2775ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 23:01:25] [INFO ] [Nat]Absence check using 901 positive place invariants in 248 ms returned sat
[2023-03-18 23:01:27] [INFO ] After 1688ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 23:01:27] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 6 ms to minimize.
[2023-03-18 23:01:27] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2023-03-18 23:01:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 602 ms
[2023-03-18 23:01:28] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 14 ms to minimize.
[2023-03-18 23:01:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 406 ms
[2023-03-18 23:01:28] [INFO ] After 3037ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 557 ms.
[2023-03-18 23:01:29] [INFO ] After 4489ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 346 ms.
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 0 with 695 rules applied. Total rules applied 699 place count 2501 transition count 2401
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 700 place count 2500 transition count 2400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 701 place count 2499 transition count 2400
Applied a total of 701 rules in 434 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 435 ms. Remains : 2499/2503 places, 2400/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 89460 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89460 steps, saw 88024 distinct states, run finished after 3003 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-18 23:01:33] [INFO ] Computed 900 place invariants in 15 ms
[2023-03-18 23:01:34] [INFO ] [Real]Absence check using 897 positive place invariants in 237 ms returned sat
[2023-03-18 23:01:34] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 23:01:36] [INFO ] After 2811ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 23:01:37] [INFO ] [Nat]Absence check using 897 positive place invariants in 293 ms returned sat
[2023-03-18 23:01:37] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 23:01:38] [INFO ] After 1632ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 23:01:39] [INFO ] Deduced a trap composed of 4 places in 475 ms of which 14 ms to minimize.
[2023-03-18 23:01:39] [INFO ] Deduced a trap composed of 17 places in 281 ms of which 1 ms to minimize.
[2023-03-18 23:01:40] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 1 ms to minimize.
[2023-03-18 23:01:40] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 1 ms to minimize.
[2023-03-18 23:01:41] [INFO ] Deduced a trap composed of 4 places in 314 ms of which 1 ms to minimize.
[2023-03-18 23:01:41] [INFO ] Deduced a trap composed of 8 places in 277 ms of which 1 ms to minimize.
[2023-03-18 23:01:41] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 2 ms to minimize.
[2023-03-18 23:01:42] [INFO ] Deduced a trap composed of 5 places in 360 ms of which 0 ms to minimize.
[2023-03-18 23:01:42] [INFO ] Deduced a trap composed of 19 places in 323 ms of which 1 ms to minimize.
[2023-03-18 23:01:42] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 0 ms to minimize.
[2023-03-18 23:01:43] [INFO ] Deduced a trap composed of 17 places in 284 ms of which 0 ms to minimize.
[2023-03-18 23:01:44] [INFO ] Deduced a trap composed of 14 places in 620 ms of which 1 ms to minimize.
[2023-03-18 23:01:44] [INFO ] Deduced a trap composed of 11 places in 247 ms of which 1 ms to minimize.
[2023-03-18 23:01:44] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 1 ms to minimize.
[2023-03-18 23:01:45] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 0 ms to minimize.
[2023-03-18 23:01:45] [INFO ] Deduced a trap composed of 17 places in 719 ms of which 1 ms to minimize.
[2023-03-18 23:01:46] [INFO ] Deduced a trap composed of 8 places in 333 ms of which 1 ms to minimize.
[2023-03-18 23:01:46] [INFO ] Deduced a trap composed of 11 places in 327 ms of which 0 ms to minimize.
[2023-03-18 23:01:47] [INFO ] Deduced a trap composed of 16 places in 369 ms of which 1 ms to minimize.
[2023-03-18 23:01:47] [INFO ] Deduced a trap composed of 19 places in 255 ms of which 1 ms to minimize.
[2023-03-18 23:01:48] [INFO ] Deduced a trap composed of 11 places in 252 ms of which 1 ms to minimize.
[2023-03-18 23:01:48] [INFO ] Deduced a trap composed of 14 places in 386 ms of which 0 ms to minimize.
[2023-03-18 23:01:48] [INFO ] Deduced a trap composed of 17 places in 285 ms of which 1 ms to minimize.
[2023-03-18 23:01:49] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 0 ms to minimize.
[2023-03-18 23:01:49] [INFO ] Deduced a trap composed of 14 places in 246 ms of which 1 ms to minimize.
[2023-03-18 23:01:49] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 0 ms to minimize.
[2023-03-18 23:01:50] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 1 ms to minimize.
[2023-03-18 23:01:50] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 1 ms to minimize.
[2023-03-18 23:01:50] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 0 ms to minimize.
[2023-03-18 23:01:50] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 11851 ms
[2023-03-18 23:01:51] [INFO ] After 13894ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 290 ms.
[2023-03-18 23:01:51] [INFO ] After 15166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 164 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 124 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 85 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2023-03-18 23:01:51] [INFO ] Invariant cache hit.
[2023-03-18 23:01:54] [INFO ] Implicit Places using invariants in 3053 ms returned []
[2023-03-18 23:01:54] [INFO ] Invariant cache hit.
[2023-03-18 23:02:01] [INFO ] Implicit Places using invariants and state equation in 6413 ms returned []
Implicit Place search using SMT with State Equation took 9472 ms to find 0 implicit places.
[2023-03-18 23:02:01] [INFO ] Redundant transitions in 391 ms returned []
[2023-03-18 23:02:01] [INFO ] Invariant cache hit.
[2023-03-18 23:02:04] [INFO ] Dead Transitions using invariants and state equation in 3189 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13163 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 149 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-18 23:02:05] [INFO ] Invariant cache hit.
[2023-03-18 23:02:06] [INFO ] [Real]Absence check using 897 positive place invariants in 312 ms returned sat
[2023-03-18 23:02:06] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 10 ms returned sat
[2023-03-18 23:02:07] [INFO ] After 2734ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 23:02:08] [INFO ] [Nat]Absence check using 897 positive place invariants in 238 ms returned sat
[2023-03-18 23:02:08] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 14 ms returned sat
[2023-03-18 23:02:11] [INFO ] After 2836ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 23:02:12] [INFO ] Deduced a trap composed of 5 places in 279 ms of which 2 ms to minimize.
[2023-03-18 23:02:12] [INFO ] Deduced a trap composed of 5 places in 405 ms of which 2 ms to minimize.
[2023-03-18 23:02:12] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 1 ms to minimize.
[2023-03-18 23:02:13] [INFO ] Deduced a trap composed of 4 places in 283 ms of which 1 ms to minimize.
[2023-03-18 23:02:13] [INFO ] Deduced a trap composed of 8 places in 217 ms of which 1 ms to minimize.
[2023-03-18 23:02:14] [INFO ] Deduced a trap composed of 8 places in 286 ms of which 14 ms to minimize.
[2023-03-18 23:02:14] [INFO ] Deduced a trap composed of 5 places in 329 ms of which 64 ms to minimize.
[2023-03-18 23:02:15] [INFO ] Deduced a trap composed of 5 places in 247 ms of which 0 ms to minimize.
[2023-03-18 23:02:15] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 15 ms to minimize.
[2023-03-18 23:02:15] [INFO ] Deduced a trap composed of 8 places in 273 ms of which 1 ms to minimize.
[2023-03-18 23:02:16] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 1 ms to minimize.
[2023-03-18 23:02:16] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 1 ms to minimize.
[2023-03-18 23:02:16] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 1 ms to minimize.
[2023-03-18 23:02:17] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2023-03-18 23:02:17] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 0 ms to minimize.
[2023-03-18 23:02:17] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2023-03-18 23:02:18] [INFO ] Deduced a trap composed of 14 places in 228 ms of which 13 ms to minimize.
[2023-03-18 23:02:18] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 1 ms to minimize.
[2023-03-18 23:02:18] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 0 ms to minimize.
[2023-03-18 23:02:19] [INFO ] Deduced a trap composed of 8 places in 210 ms of which 1 ms to minimize.
[2023-03-18 23:02:19] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 0 ms to minimize.
[2023-03-18 23:02:19] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 29 ms to minimize.
[2023-03-18 23:02:20] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 0 ms to minimize.
[2023-03-18 23:02:20] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 1 ms to minimize.
[2023-03-18 23:02:20] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2023-03-18 23:02:20] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 9031 ms
[2023-03-18 23:02:21] [INFO ] After 12277ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3566 ms.
[2023-03-18 23:02:24] [INFO ] After 16873ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 7 factoid took 580 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 129 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-18 23:02:25] [INFO ] Computed 901 place invariants in 15 ms
[2023-03-18 23:02:27] [INFO ] Implicit Places using invariants in 1851 ms returned []
[2023-03-18 23:02:27] [INFO ] Invariant cache hit.
[2023-03-18 23:02:32] [INFO ] Implicit Places using invariants and state equation in 4791 ms returned []
Implicit Place search using SMT with State Equation took 6661 ms to find 0 implicit places.
[2023-03-18 23:02:32] [INFO ] Invariant cache hit.
[2023-03-18 23:02:34] [INFO ] Dead Transitions using invariants and state equation in 1507 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8300 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 340 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 23:02:35] [INFO ] Invariant cache hit.
[2023-03-18 23:02:35] [INFO ] [Real]Absence check using 901 positive place invariants in 192 ms returned sat
[2023-03-18 23:02:37] [INFO ] After 2285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:02:38] [INFO ] [Nat]Absence check using 901 positive place invariants in 195 ms returned sat
[2023-03-18 23:02:39] [INFO ] After 1593ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:02:40] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 0 ms to minimize.
[2023-03-18 23:02:40] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 1 ms to minimize.
[2023-03-18 23:02:40] [INFO ] Deduced a trap composed of 18 places in 267 ms of which 0 ms to minimize.
[2023-03-18 23:02:41] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 1 ms to minimize.
[2023-03-18 23:02:41] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 1 ms to minimize.
[2023-03-18 23:02:41] [INFO ] Deduced a trap composed of 26 places in 244 ms of which 1 ms to minimize.
[2023-03-18 23:02:41] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 1 ms to minimize.
[2023-03-18 23:02:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2260 ms
[2023-03-18 23:02:42] [INFO ] After 3993ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 155 ms.
[2023-03-18 23:02:42] [INFO ] After 4956ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 115 ms.
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 0 with 695 rules applied. Total rules applied 699 place count 2501 transition count 2401
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 700 place count 2500 transition count 2400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 701 place count 2499 transition count 2400
Applied a total of 701 rules in 480 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 480 ms. Remains : 2499/2503 places, 2400/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 121665 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 121665 steps, saw 119864 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-18 23:02:46] [INFO ] Computed 900 place invariants in 15 ms
[2023-03-18 23:02:47] [INFO ] [Real]Absence check using 897 positive place invariants in 437 ms returned sat
[2023-03-18 23:02:47] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 14 ms returned sat
[2023-03-18 23:02:49] [INFO ] After 3082ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:02:49] [INFO ] [Nat]Absence check using 897 positive place invariants in 168 ms returned sat
[2023-03-18 23:02:49] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 23:02:51] [INFO ] After 1873ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:02:52] [INFO ] Deduced a trap composed of 4 places in 407 ms of which 9 ms to minimize.
[2023-03-18 23:02:53] [INFO ] Deduced a trap composed of 11 places in 578 ms of which 2 ms to minimize.
[2023-03-18 23:02:53] [INFO ] Deduced a trap composed of 8 places in 321 ms of which 1 ms to minimize.
[2023-03-18 23:02:54] [INFO ] Deduced a trap composed of 17 places in 510 ms of which 1 ms to minimize.
[2023-03-18 23:02:54] [INFO ] Deduced a trap composed of 8 places in 570 ms of which 0 ms to minimize.
[2023-03-18 23:02:55] [INFO ] Deduced a trap composed of 17 places in 410 ms of which 2 ms to minimize.
[2023-03-18 23:02:55] [INFO ] Deduced a trap composed of 8 places in 459 ms of which 3 ms to minimize.
[2023-03-18 23:02:56] [INFO ] Deduced a trap composed of 8 places in 409 ms of which 1 ms to minimize.
[2023-03-18 23:02:56] [INFO ] Deduced a trap composed of 17 places in 444 ms of which 2 ms to minimize.
[2023-03-18 23:02:57] [INFO ] Deduced a trap composed of 14 places in 433 ms of which 1 ms to minimize.
[2023-03-18 23:02:57] [INFO ] Deduced a trap composed of 11 places in 351 ms of which 0 ms to minimize.
[2023-03-18 23:02:58] [INFO ] Deduced a trap composed of 14 places in 430 ms of which 0 ms to minimize.
[2023-03-18 23:02:58] [INFO ] Deduced a trap composed of 17 places in 313 ms of which 1 ms to minimize.
[2023-03-18 23:02:59] [INFO ] Deduced a trap composed of 17 places in 406 ms of which 1 ms to minimize.
[2023-03-18 23:02:59] [INFO ] Deduced a trap composed of 17 places in 257 ms of which 1 ms to minimize.
[2023-03-18 23:03:00] [INFO ] Deduced a trap composed of 11 places in 309 ms of which 1 ms to minimize.
[2023-03-18 23:03:01] [INFO ] Deduced a trap composed of 11 places in 771 ms of which 1 ms to minimize.
[2023-03-18 23:03:01] [INFO ] Deduced a trap composed of 23 places in 302 ms of which 1 ms to minimize.
[2023-03-18 23:03:01] [INFO ] Deduced a trap composed of 17 places in 317 ms of which 1 ms to minimize.
[2023-03-18 23:03:02] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 0 ms to minimize.
[2023-03-18 23:03:02] [INFO ] Deduced a trap composed of 23 places in 565 ms of which 1 ms to minimize.
[2023-03-18 23:03:03] [INFO ] Deduced a trap composed of 17 places in 616 ms of which 0 ms to minimize.
[2023-03-18 23:03:03] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 1 ms to minimize.
[2023-03-18 23:03:04] [INFO ] Deduced a trap composed of 17 places in 210 ms of which 1 ms to minimize.
[2023-03-18 23:03:04] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 1 ms to minimize.
[2023-03-18 23:03:04] [INFO ] Deduced a trap composed of 8 places in 300 ms of which 1 ms to minimize.
[2023-03-18 23:03:05] [INFO ] Deduced a trap composed of 29 places in 225 ms of which 1 ms to minimize.
[2023-03-18 23:03:05] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2023-03-18 23:03:05] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 1 ms to minimize.
[2023-03-18 23:03:06] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2023-03-18 23:03:06] [INFO ] Deduced a trap composed of 23 places in 225 ms of which 1 ms to minimize.
[2023-03-18 23:03:06] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 1 ms to minimize.
[2023-03-18 23:03:06] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 14984 ms
[2023-03-18 23:03:06] [INFO ] After 16938ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 121 ms.
[2023-03-18 23:03:07] [INFO ] After 17636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 28 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 180 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 115 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2023-03-18 23:03:07] [INFO ] Invariant cache hit.
[2023-03-18 23:03:10] [INFO ] Implicit Places using invariants in 2866 ms returned []
[2023-03-18 23:03:10] [INFO ] Invariant cache hit.
[2023-03-18 23:03:15] [INFO ] Implicit Places using invariants and state equation in 5148 ms returned []
Implicit Place search using SMT with State Equation took 8035 ms to find 0 implicit places.
[2023-03-18 23:03:15] [INFO ] Redundant transitions in 203 ms returned []
[2023-03-18 23:03:15] [INFO ] Invariant cache hit.
[2023-03-18 23:03:17] [INFO ] Dead Transitions using invariants and state equation in 2230 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10603 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 110 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 23:03:17] [INFO ] Invariant cache hit.
[2023-03-18 23:03:18] [INFO ] [Real]Absence check using 897 positive place invariants in 233 ms returned sat
[2023-03-18 23:03:18] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-18 23:03:20] [INFO ] After 2636ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:03:21] [INFO ] [Nat]Absence check using 897 positive place invariants in 248 ms returned sat
[2023-03-18 23:03:21] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 23:03:22] [INFO ] After 1345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:03:23] [INFO ] Deduced a trap composed of 17 places in 452 ms of which 0 ms to minimize.
[2023-03-18 23:03:23] [INFO ] Deduced a trap composed of 11 places in 332 ms of which 0 ms to minimize.
[2023-03-18 23:03:24] [INFO ] Deduced a trap composed of 14 places in 351 ms of which 1 ms to minimize.
[2023-03-18 23:03:24] [INFO ] Deduced a trap composed of 8 places in 507 ms of which 1 ms to minimize.
[2023-03-18 23:03:25] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 0 ms to minimize.
[2023-03-18 23:03:25] [INFO ] Deduced a trap composed of 5 places in 344 ms of which 0 ms to minimize.
[2023-03-18 23:03:26] [INFO ] Deduced a trap composed of 11 places in 378 ms of which 1 ms to minimize.
[2023-03-18 23:03:26] [INFO ] Deduced a trap composed of 17 places in 308 ms of which 1 ms to minimize.
[2023-03-18 23:03:27] [INFO ] Deduced a trap composed of 24 places in 315 ms of which 1 ms to minimize.
[2023-03-18 23:03:27] [INFO ] Deduced a trap composed of 7 places in 486 ms of which 1 ms to minimize.
[2023-03-18 23:03:28] [INFO ] Deduced a trap composed of 14 places in 377 ms of which 1 ms to minimize.
[2023-03-18 23:03:28] [INFO ] Deduced a trap composed of 17 places in 282 ms of which 0 ms to minimize.
[2023-03-18 23:03:28] [INFO ] Deduced a trap composed of 9 places in 249 ms of which 1 ms to minimize.
[2023-03-18 23:03:29] [INFO ] Deduced a trap composed of 22 places in 305 ms of which 1 ms to minimize.
[2023-03-18 23:03:29] [INFO ] Deduced a trap composed of 11 places in 304 ms of which 1 ms to minimize.
[2023-03-18 23:03:30] [INFO ] Deduced a trap composed of 17 places in 256 ms of which 1 ms to minimize.
[2023-03-18 23:03:30] [INFO ] Deduced a trap composed of 11 places in 246 ms of which 0 ms to minimize.
[2023-03-18 23:03:30] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 1 ms to minimize.
[2023-03-18 23:03:30] [INFO ] Deduced a trap composed of 14 places in 244 ms of which 1 ms to minimize.
[2023-03-18 23:03:31] [INFO ] Deduced a trap composed of 8 places in 407 ms of which 1 ms to minimize.
[2023-03-18 23:03:31] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 1 ms to minimize.
[2023-03-18 23:03:32] [INFO ] Deduced a trap composed of 9 places in 231 ms of which 13 ms to minimize.
[2023-03-18 23:03:32] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 0 ms to minimize.
[2023-03-18 23:03:32] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 0 ms to minimize.
[2023-03-18 23:03:33] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 0 ms to minimize.
[2023-03-18 23:03:33] [INFO ] Deduced a trap composed of 4 places in 389 ms of which 20 ms to minimize.
[2023-03-18 23:03:34] [INFO ] Deduced a trap composed of 8 places in 241 ms of which 0 ms to minimize.
[2023-03-18 23:03:34] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 0 ms to minimize.
[2023-03-18 23:03:34] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 1 ms to minimize.
[2023-03-18 23:03:35] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 1 ms to minimize.
[2023-03-18 23:03:35] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2023-03-18 23:03:35] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 1 ms to minimize.
[2023-03-18 23:03:35] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 0 ms to minimize.
[2023-03-18 23:03:36] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 0 ms to minimize.
[2023-03-18 23:03:36] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 1 ms to minimize.
[2023-03-18 23:03:36] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 0 ms to minimize.
[2023-03-18 23:03:37] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 13 ms to minimize.
[2023-03-18 23:03:37] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 14331 ms
[2023-03-18 23:03:37] [INFO ] After 15779ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-18 23:03:37] [INFO ] After 16706ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 620 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33348 reset in 5630 ms.
Product exploration explored 100000 steps with 33531 reset in 5764 ms.
Built C files in :
/tmp/ltsmin10369225818218419396
[2023-03-18 23:03:50] [INFO ] Built C files in 110ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10369225818218419396
Running compilation step : cd /tmp/ltsmin10369225818218419396;'/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/ltsmin10369225818218419396;'/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/ltsmin10369225818218419396;'/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 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 93 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-18 23:03:53] [INFO ] Computed 901 place invariants in 6 ms
[2023-03-18 23:03:55] [INFO ] Implicit Places using invariants in 1601 ms returned []
[2023-03-18 23:03:55] [INFO ] Invariant cache hit.
[2023-03-18 23:04:00] [INFO ] Implicit Places using invariants and state equation in 5566 ms returned []
Implicit Place search using SMT with State Equation took 7184 ms to find 0 implicit places.
[2023-03-18 23:04:00] [INFO ] Invariant cache hit.
[2023-03-18 23:04:03] [INFO ] Dead Transitions using invariants and state equation in 2645 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9923 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Built C files in :
/tmp/ltsmin9585499480807191341
[2023-03-18 23:04:03] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9585499480807191341
Running compilation step : cd /tmp/ltsmin9585499480807191341;'/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/ltsmin9585499480807191341;'/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/ltsmin9585499480807191341;'/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-18 23:04:07] [INFO ] Flatten gal took : 174 ms
[2023-03-18 23:04:07] [INFO ] Flatten gal took : 164 ms
[2023-03-18 23:04:07] [INFO ] Time to serialize gal into /tmp/LTL15978396207024291823.gal : 23 ms
[2023-03-18 23:04:07] [INFO ] Time to serialize properties into /tmp/LTL6352514045449964351.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/LTL15978396207024291823.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2850570775099803940.hoa' '-atoms' '/tmp/LTL6352514045449964351.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/LTL6352514045449964351.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2850570775099803940.hoa
Detected timeout of ITS tools.
[2023-03-18 23:04:22] [INFO ] Flatten gal took : 266 ms
[2023-03-18 23:04:22] [INFO ] Flatten gal took : 164 ms
[2023-03-18 23:04:22] [INFO ] Time to serialize gal into /tmp/LTL18415186612603829304.gal : 17 ms
[2023-03-18 23:04:22] [INFO ] Time to serialize properties into /tmp/LTL6466516607298185884.ltl : 2 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/LTL18415186612603829304.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6466516607298185884.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(("(p2150==0)")&&(X("(((p936==0)||(p940==0))||(p951==0))"))))))
Formula 0 simplified : FG(!"(p2150==0)" | X!"(((p936==0)||(p940==0))||(p951==0))")
Detected timeout of ITS tools.
[2023-03-18 23:04:38] [INFO ] Flatten gal took : 193 ms
[2023-03-18 23:04:38] [INFO ] Applying decomposition
[2023-03-18 23:04:38] [INFO ] Flatten gal took : 133 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/graph8117687139121331479.txt' '-o' '/tmp/graph8117687139121331479.bin' '-w' '/tmp/graph8117687139121331479.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8117687139121331479.bin' '-l' '-1' '-v' '-w' '/tmp/graph8117687139121331479.weights' '-q' '0' '-e' '0.001'
[2023-03-18 23:04:38] [INFO ] Decomposing Gal with order
[2023-03-18 23:04:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 23:04:39] [INFO ] Removed a total of 1600 redundant transitions.
[2023-03-18 23:04:39] [INFO ] Flatten gal took : 257 ms
[2023-03-18 23:04:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 1548 labels/synchronizations in 440 ms.
[2023-03-18 23:04:39] [INFO ] Time to serialize gal into /tmp/LTL6785590122460243602.gal : 38 ms
[2023-03-18 23:04:39] [INFO ] Time to serialize properties into /tmp/LTL8013957461314998386.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/LTL6785590122460243602.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8013957461314998386.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 : !((G(F(("(i37.i1.i2.u774.p2150==0)")&&(X("(((i16.i1.i2.u337.p936==0)||(i16.i1.i2.u339.p940==0))||(i16.i1.i1.u342.p951==0))"))))))
Formula 0 simplified : FG(!"(i37.i1.i2.u774.p2150==0)" | X!"(((i16.i1.i2.u337.p936==0)||(i16.i1.i2.u339.p940==0))||(i16.i1.i1.u342.p951==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3095106514648778243
[2023-03-18 23:04:54] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3095106514648778243
Running compilation step : cd /tmp/ltsmin3095106514648778243;'/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/ltsmin3095106514648778243;'/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/ltsmin3095106514648778243;'/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 ShieldIIPs-PT-100A-LTLFireability-01 finished in 239605 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 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 310 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-18 23:04:58] [INFO ] Computed 901 place invariants in 22 ms
[2023-03-18 23:05:00] [INFO ] Implicit Places using invariants in 1654 ms returned []
[2023-03-18 23:05:00] [INFO ] Invariant cache hit.
[2023-03-18 23:05:01] [INFO ] Implicit Places using invariants and state equation in 1829 ms returned []
Implicit Place search using SMT with State Equation took 3507 ms to find 0 implicit places.
[2023-03-18 23:05:02] [INFO ] Redundant transitions in 339 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2501 cols
[2023-03-18 23:05:02] [INFO ] Computed 901 place invariants in 6 ms
[2023-03-18 23:05:03] [INFO ] Dead Transitions using invariants and state equation in 1526 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2503 places, 2400/2403 transitions.
Applied a total of 0 rules in 88 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5795 ms. Remains : 2501/2503 places, 2400/2403 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-02 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:(AND (EQ s2154 1) (EQ s2169 1)), p1:(NEQ s2315 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 187 reset in 1955 ms.
Product exploration explored 100000 steps with 187 reset in 2120 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 306 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 478 steps, including 0 resets, run visited all 2 properties in 19 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 439 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-18 23:05:09] [INFO ] Invariant cache hit.
[2023-03-18 23:05:13] [INFO ] [Real]Absence check using 901 positive place invariants in 1330 ms returned sat
[2023-03-18 23:05:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:05:24] [INFO ] [Real]Absence check using state equation in 10757 ms returned unknown
Could not prove EG (NOT p0)
Support contains 3 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 132 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2023-03-18 23:05:24] [INFO ] Invariant cache hit.
[2023-03-18 23:05:26] [INFO ] Implicit Places using invariants in 1849 ms returned []
[2023-03-18 23:05:26] [INFO ] Invariant cache hit.
[2023-03-18 23:05:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-18 23:05:28] [INFO ] Implicit Places using invariants and state equation in 1970 ms returned []
Implicit Place search using SMT with State Equation took 3821 ms to find 0 implicit places.
[2023-03-18 23:05:29] [INFO ] Redundant transitions in 457 ms returned []
[2023-03-18 23:05:29] [INFO ] Invariant cache hit.
[2023-03-18 23:05:31] [INFO ] Dead Transitions using invariants and state equation in 2411 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6836 ms. Remains : 2501/2501 places, 2400/2400 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 494 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 587 steps, including 0 resets, run visited all 2 properties in 14 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 399 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-18 23:05:33] [INFO ] Invariant cache hit.
[2023-03-18 23:05:37] [INFO ] [Real]Absence check using 901 positive place invariants in 1435 ms returned sat
[2023-03-18 23:05:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:05:48] [INFO ] [Real]Absence check using state equation in 10476 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 188 reset in 1832 ms.
Product exploration explored 100000 steps with 188 reset in 1990 ms.
Built C files in :
/tmp/ltsmin349504615661863495
[2023-03-18 23:05:52] [INFO ] Too many transitions (2400) to apply POR reductions. Disabling POR matrices.
[2023-03-18 23:05:52] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin349504615661863495
Running compilation step : cd /tmp/ltsmin349504615661863495;'/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/ltsmin349504615661863495;'/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/ltsmin349504615661863495;'/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 3 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2501/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 115 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2023-03-18 23:05:55] [INFO ] Invariant cache hit.
[2023-03-18 23:05:58] [INFO ] Implicit Places using invariants in 2760 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2775 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2501 places, 2400/2400 transitions.
Applied a total of 0 rules in 93 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2983 ms. Remains : 2500/2501 places, 2400/2400 transitions.
Built C files in :
/tmp/ltsmin9446849442430280382
[2023-03-18 23:05:58] [INFO ] Too many transitions (2400) to apply POR reductions. Disabling POR matrices.
[2023-03-18 23:05:58] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9446849442430280382
Running compilation step : cd /tmp/ltsmin9446849442430280382;'/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/ltsmin9446849442430280382;'/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/ltsmin9446849442430280382;'/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-18 23:06:01] [INFO ] Flatten gal took : 139 ms
[2023-03-18 23:06:01] [INFO ] Flatten gal took : 141 ms
[2023-03-18 23:06:01] [INFO ] Time to serialize gal into /tmp/LTL9371591369943962741.gal : 22 ms
[2023-03-18 23:06:01] [INFO ] Time to serialize properties into /tmp/LTL2165915815089160835.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/LTL9371591369943962741.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6290085813673392863.hoa' '-atoms' '/tmp/LTL2165915815089160835.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/LTL2165915815089160835.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6290085813673392863.hoa
Detected timeout of ITS tools.
[2023-03-18 23:06:17] [INFO ] Flatten gal took : 140 ms
[2023-03-18 23:06:17] [INFO ] Flatten gal took : 149 ms
[2023-03-18 23:06:17] [INFO ] Time to serialize gal into /tmp/LTL13371898684837152408.gal : 29 ms
[2023-03-18 23:06:17] [INFO ] Time to serialize properties into /tmp/LTL5803857447897018657.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/LTL13371898684837152408.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5803857447897018657.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("((p2154==1)&&(p2169==1))"))&&(F(G("(p2315==0)"))))))
Formula 0 simplified : F(G!"((p2154==1)&&(p2169==1))" | GF!"(p2315==0)")
Detected timeout of ITS tools.
[2023-03-18 23:06:32] [INFO ] Flatten gal took : 156 ms
[2023-03-18 23:06:32] [INFO ] Applying decomposition
[2023-03-18 23:06:32] [INFO ] Flatten gal took : 175 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/graph3613059664093235701.txt' '-o' '/tmp/graph3613059664093235701.bin' '-w' '/tmp/graph3613059664093235701.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3613059664093235701.bin' '-l' '-1' '-v' '-w' '/tmp/graph3613059664093235701.weights' '-q' '0' '-e' '0.001'
[2023-03-18 23:06:33] [INFO ] Decomposing Gal with order
[2023-03-18 23:06:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 23:06:33] [INFO ] Removed a total of 1595 redundant transitions.
[2023-03-18 23:06:33] [INFO ] Flatten gal took : 250 ms
[2023-03-18 23:06:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 1544 labels/synchronizations in 182 ms.
[2023-03-18 23:06:33] [INFO ] Time to serialize gal into /tmp/LTL18205196476420635391.gal : 32 ms
[2023-03-18 23:06:33] [INFO ] Time to serialize properties into /tmp/LTL14077383277882286348.ltl : 2 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/LTL18205196476420635391.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14077383277882286348.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("((i38.i0.i1.u775.p2154==1)&&(i38.i0.i1.u781.p2169==1))"))&&(F(G("(i40.i0.i0.u834.p2315==0)"))))))
Formula 0 simplified : F(G!"((i38.i0.i1.u775.p2154==1)&&(i38.i0.i1.u781.p2169==1))" | GF!"(i40.i0.i0.u834.p2315==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18401861482432501332
[2023-03-18 23:06:48] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18401861482432501332
Running compilation step : cd /tmp/ltsmin18401861482432501332;'/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/ltsmin18401861482432501332;'/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/ltsmin18401861482432501332;'/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 ShieldIIPs-PT-100A-LTLFireability-02 finished in 113874 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((F(G(!p0)) U (!p1&&F(!p2)))))'
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 102 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-18 23:06:52] [INFO ] Computed 901 place invariants in 11 ms
[2023-03-18 23:06:53] [INFO ] Implicit Places using invariants in 1901 ms returned []
[2023-03-18 23:06:53] [INFO ] Invariant cache hit.
[2023-03-18 23:06:58] [INFO ] Implicit Places using invariants and state equation in 4640 ms returned []
Implicit Place search using SMT with State Equation took 6573 ms to find 0 implicit places.
[2023-03-18 23:06:58] [INFO ] Invariant cache hit.
[2023-03-18 23:07:00] [INFO ] Dead Transitions using invariants and state equation in 1678 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8366 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR p2 p1), (OR p1 p2), p0, p2]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s1113 1) (EQ s1123 1) (EQ s1125 1)), p2:(AND (EQ s938 1) (EQ s946 1) (EQ s952 1)), p0:(OR (AND (EQ s1113 1) (EQ s1123 1) (EQ s1125 1)) (AND (E...], 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 50000 reset in 7347 ms.
Product exploration explored 100000 steps with 50000 reset in 7512 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p2)))
Knowledge based reduction with 7 factoid took 358 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-100A-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-100A-LTLFireability-03 finished in 23839 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)||(!p0&&G(F((!p1 U (G(!p1)||(!p1&&G(!p0))))))))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 18 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 231 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-18 23:07:16] [INFO ] Computed 901 place invariants in 6 ms
[2023-03-18 23:07:17] [INFO ] Implicit Places using invariants in 1943 ms returned []
[2023-03-18 23:07:17] [INFO ] Invariant cache hit.
[2023-03-18 23:07:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 23:07:24] [INFO ] Implicit Places using invariants and state equation in 6407 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 8371 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2503 places, 2401/2403 transitions.
Applied a total of 0 rules in 146 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8749 ms. Remains : 2500/2503 places, 2401/2403 transitions.
Stuttering acceptance computed with spot in 274 ms :[p0, (AND p0 p1), (AND p0 p1), p0]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1462 1) (EQ s1495 1)), p1:(AND (EQ s6 1) (EQ s17 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 19 reset in 1802 ms.
Product exploration explored 100000 steps with 19 reset in 2164 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (OR p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 1087 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-18 23:07:30] [INFO ] Computed 900 place invariants in 12 ms
[2023-03-18 23:07:31] [INFO ] [Real]Absence check using 900 positive place invariants in 227 ms returned sat
[2023-03-18 23:07:33] [INFO ] After 2459ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 23:07:33] [INFO ] [Nat]Absence check using 900 positive place invariants in 193 ms returned sat
[2023-03-18 23:07:41] [INFO ] After 7174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 23:07:41] [INFO ] Deduced a trap composed of 11 places in 286 ms of which 1 ms to minimize.
[2023-03-18 23:07:41] [INFO ] Deduced a trap composed of 11 places in 251 ms of which 1 ms to minimize.
[2023-03-18 23:07:42] [INFO ] Deduced a trap composed of 11 places in 265 ms of which 15 ms to minimize.
[2023-03-18 23:07:42] [INFO ] Deduced a trap composed of 11 places in 218 ms of which 1 ms to minimize.
[2023-03-18 23:07:43] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 1 ms to minimize.
[2023-03-18 23:07:43] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 1 ms to minimize.
[2023-03-18 23:07:43] [INFO ] Deduced a trap composed of 36 places in 251 ms of which 0 ms to minimize.
[2023-03-18 23:07:44] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 1 ms to minimize.
[2023-03-18 23:07:44] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 0 ms to minimize.
[2023-03-18 23:07:44] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 0 ms to minimize.
[2023-03-18 23:07:44] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 0 ms to minimize.
[2023-03-18 23:07:45] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 1 ms to minimize.
[2023-03-18 23:07:45] [INFO ] Deduced a trap composed of 18 places in 227 ms of which 0 ms to minimize.
[2023-03-18 23:07:46] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 1 ms to minimize.
[2023-03-18 23:07:46] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 1 ms to minimize.
[2023-03-18 23:07:46] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 0 ms to minimize.
[2023-03-18 23:07:46] [INFO ] Deduced a trap composed of 26 places in 191 ms of which 0 ms to minimize.
[2023-03-18 23:07:47] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 0 ms to minimize.
[2023-03-18 23:07:47] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
[2023-03-18 23:07:47] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 1 ms to minimize.
[2023-03-18 23:07:48] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 0 ms to minimize.
[2023-03-18 23:07:48] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 1 ms to minimize.
[2023-03-18 23:07:48] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 0 ms to minimize.
[2023-03-18 23:07:48] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 1 ms to minimize.
[2023-03-18 23:07:49] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 0 ms to minimize.
[2023-03-18 23:07:49] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 0 ms to minimize.
[2023-03-18 23:07:49] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 0 ms to minimize.
[2023-03-18 23:07:49] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 0 ms to minimize.
[2023-03-18 23:07:58] [INFO ] Trap strengthening (SAT) tested/added 28/28 trap constraints in 17067 ms
[2023-03-18 23:07:58] [INFO ] After 24331ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-18 23:07:58] [INFO ] After 25044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 612 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 0 with 696 rules applied. Total rules applied 696 place count 2500 transition count 2401
Applied a total of 696 rules in 237 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 114521 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{0=1}
Probabilistic random walk after 114521 steps, saw 111783 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-18 23:08:02] [INFO ] Computed 900 place invariants in 43 ms
[2023-03-18 23:08:03] [INFO ] [Real]Absence check using 898 positive place invariants in 377 ms returned sat
[2023-03-18 23:08:03] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:08:05] [INFO ] After 2830ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:08:06] [INFO ] [Nat]Absence check using 898 positive place invariants in 213 ms returned sat
[2023-03-18 23:08:06] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 21 ms returned sat
[2023-03-18 23:08:16] [INFO ] After 11187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 180 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 121933 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 121933 steps, saw 118779 distinct states, run finished after 3002 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 23:08:20] [INFO ] Invariant cache hit.
[2023-03-18 23:08:20] [INFO ] [Real]Absence check using 898 positive place invariants in 268 ms returned sat
[2023-03-18 23:08:20] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 23:08:22] [INFO ] After 2459ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:08:23] [INFO ] [Nat]Absence check using 898 positive place invariants in 210 ms returned sat
[2023-03-18 23:08:23] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 23:08:33] [INFO ] After 11245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 108 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 81 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-18 23:08:34] [INFO ] Invariant cache hit.
[2023-03-18 23:08:36] [INFO ] Implicit Places using invariants in 2271 ms returned []
[2023-03-18 23:08:36] [INFO ] Invariant cache hit.
[2023-03-18 23:08:39] [INFO ] Implicit Places using invariants and state equation in 3386 ms returned []
Implicit Place search using SMT with State Equation took 5661 ms to find 0 implicit places.
[2023-03-18 23:08:39] [INFO ] Redundant transitions in 90 ms returned []
[2023-03-18 23:08:39] [INFO ] Invariant cache hit.
[2023-03-18 23:08:42] [INFO ] Dead Transitions using invariants and state equation in 2397 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8236 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 118 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 23:08:42] [INFO ] Invariant cache hit.
[2023-03-18 23:08:43] [INFO ] [Real]Absence check using 898 positive place invariants in 196 ms returned sat
[2023-03-18 23:08:43] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 23:08:44] [INFO ] After 2285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:08:45] [INFO ] [Nat]Absence check using 898 positive place invariants in 209 ms returned sat
[2023-03-18 23:08:45] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 23:08:55] [INFO ] After 11033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (OR p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (OR p1 p0)), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 13 factoid took 845 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 182 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 173 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-18 23:08:57] [INFO ] Computed 900 place invariants in 13 ms
[2023-03-18 23:08:59] [INFO ] Implicit Places using invariants in 2279 ms returned []
[2023-03-18 23:08:59] [INFO ] Invariant cache hit.
[2023-03-18 23:09:05] [INFO ] Implicit Places using invariants and state equation in 5559 ms returned []
Implicit Place search using SMT with State Equation took 7845 ms to find 0 implicit places.
[2023-03-18 23:09:05] [INFO ] Redundant transitions in 282 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2500 cols
[2023-03-18 23:09:05] [INFO ] Computed 900 place invariants in 6 ms
[2023-03-18 23:09:06] [INFO ] Dead Transitions using invariants and state equation in 1437 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2500 places, 2400/2401 transitions.
Applied a total of 0 rules in 101 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9860 ms. Remains : 2500/2500 places, 2400/2401 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (OR p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (OR p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 515 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 240 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 23:09:08] [INFO ] Invariant cache hit.
[2023-03-18 23:09:09] [INFO ] [Real]Absence check using 900 positive place invariants in 277 ms returned sat
[2023-03-18 23:09:10] [INFO ] After 2465ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 23:09:11] [INFO ] [Nat]Absence check using 900 positive place invariants in 191 ms returned sat
[2023-03-18 23:09:27] [INFO ] After 16394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:09:28] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 1 ms to minimize.
[2023-03-18 23:09:28] [INFO ] Deduced a trap composed of 10 places in 225 ms of which 0 ms to minimize.
[2023-03-18 23:09:30] [INFO ] Deduced a trap composed of 11 places in 1532 ms of which 0 ms to minimize.
[2023-03-18 23:09:31] [INFO ] Deduced a trap composed of 11 places in 1256 ms of which 1 ms to minimize.
[2023-03-18 23:09:32] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 1 ms to minimize.
[2023-03-18 23:09:32] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 0 ms to minimize.
[2023-03-18 23:09:32] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 0 ms to minimize.
[2023-03-18 23:09:32] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2023-03-18 23:09:33] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 1 ms to minimize.
[2023-03-18 23:09:33] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 1 ms to minimize.
[2023-03-18 23:09:33] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 0 ms to minimize.
[2023-03-18 23:09:34] [INFO ] Deduced a trap composed of 11 places in 731 ms of which 1 ms to minimize.
[2023-03-18 23:09:34] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2023-03-18 23:09:35] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2023-03-18 23:09:35] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 7297 ms
[2023-03-18 23:09:35] [INFO ] After 23897ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 203 ms.
[2023-03-18 23:09:35] [INFO ] After 24823ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 753 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 0 with 696 rules applied. Total rules applied 696 place count 2500 transition count 2400
Applied a total of 696 rules in 168 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 91396 steps, run timeout after 3002 ms. (steps per millisecond=30 ) properties seen :{0=1}
Probabilistic random walk after 91396 steps, saw 89175 distinct states, run finished after 3002 ms. (steps per millisecond=30 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2500 cols
[2023-03-18 23:09:40] [INFO ] Computed 900 place invariants in 53 ms
[2023-03-18 23:09:41] [INFO ] [Real]Absence check using 898 positive place invariants in 192 ms returned sat
[2023-03-18 23:09:41] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:09:42] [INFO ] After 2469ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:09:43] [INFO ] [Nat]Absence check using 898 positive place invariants in 275 ms returned sat
[2023-03-18 23:09:43] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 11 ms returned sat
[2023-03-18 23:09:54] [INFO ] After 11556ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 129 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 133169 steps, run timeout after 3026 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133169 steps, saw 129287 distinct states, run finished after 3026 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 23:09:57] [INFO ] Invariant cache hit.
[2023-03-18 23:09:58] [INFO ] [Real]Absence check using 898 positive place invariants in 221 ms returned sat
[2023-03-18 23:09:58] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 23:10:00] [INFO ] After 2410ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:10:01] [INFO ] [Nat]Absence check using 898 positive place invariants in 347 ms returned sat
[2023-03-18 23:10:01] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:10:11] [INFO ] After 11493ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 123 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 91 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2023-03-18 23:10:11] [INFO ] Invariant cache hit.
[2023-03-18 23:10:13] [INFO ] Implicit Places using invariants in 1764 ms returned []
[2023-03-18 23:10:13] [INFO ] Invariant cache hit.
[2023-03-18 23:10:20] [INFO ] Implicit Places using invariants and state equation in 6411 ms returned []
Implicit Place search using SMT with State Equation took 8206 ms to find 0 implicit places.
[2023-03-18 23:10:20] [INFO ] Redundant transitions in 88 ms returned []
[2023-03-18 23:10:20] [INFO ] Invariant cache hit.
[2023-03-18 23:10:21] [INFO ] Dead Transitions using invariants and state equation in 1582 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9979 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 128 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 23:10:21] [INFO ] Invariant cache hit.
[2023-03-18 23:10:22] [INFO ] [Real]Absence check using 898 positive place invariants in 296 ms returned sat
[2023-03-18 23:10:22] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-18 23:10:24] [INFO ] After 2503ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:10:25] [INFO ] [Nat]Absence check using 898 positive place invariants in 250 ms returned sat
[2023-03-18 23:10:25] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 23:10:36] [INFO ] After 11536ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (OR p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (OR p1 p0))))]
False Knowledge obtained : [(F (OR p0 p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 1061 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 222 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 387 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 19 reset in 1938 ms.
Product exploration explored 100000 steps with 19 reset in 2335 ms.
Built C files in :
/tmp/ltsmin1050434056103976162
[2023-03-18 23:10:42] [INFO ] Too many transitions (2400) to apply POR reductions. Disabling POR matrices.
[2023-03-18 23:10:42] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1050434056103976162
Running compilation step : cd /tmp/ltsmin1050434056103976162;'/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/ltsmin1050434056103976162;'/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/ltsmin1050434056103976162;'/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 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 151 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2500 cols
[2023-03-18 23:10:45] [INFO ] Computed 900 place invariants in 15 ms
[2023-03-18 23:10:46] [INFO ] Implicit Places using invariants in 1343 ms returned []
[2023-03-18 23:10:46] [INFO ] Invariant cache hit.
[2023-03-18 23:10:49] [INFO ] Implicit Places using invariants and state equation in 2227 ms returned []
Implicit Place search using SMT with State Equation took 3572 ms to find 0 implicit places.
[2023-03-18 23:10:49] [INFO ] Redundant transitions in 453 ms returned []
[2023-03-18 23:10:49] [INFO ] Invariant cache hit.
[2023-03-18 23:10:51] [INFO ] Dead Transitions using invariants and state equation in 2438 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6631 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Built C files in :
/tmp/ltsmin18381207786082454431
[2023-03-18 23:10:53] [INFO ] Too many transitions (2400) to apply POR reductions. Disabling POR matrices.
[2023-03-18 23:10:53] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18381207786082454431
Running compilation step : cd /tmp/ltsmin18381207786082454431;'/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/ltsmin18381207786082454431;'/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/ltsmin18381207786082454431;'/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-18 23:10:56] [INFO ] Flatten gal took : 128 ms
[2023-03-18 23:10:56] [INFO ] Flatten gal took : 144 ms
[2023-03-18 23:10:56] [INFO ] Time to serialize gal into /tmp/LTL526044597033222446.gal : 10 ms
[2023-03-18 23:10:56] [INFO ] Time to serialize properties into /tmp/LTL18419968906762232704.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/LTL526044597033222446.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17831655378445418888.hoa' '-atoms' '/tmp/LTL18419968906762232704.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/LTL18419968906762232704.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17831655378445418888.hoa
Detected timeout of ITS tools.
[2023-03-18 23:11:11] [INFO ] Flatten gal took : 129 ms
[2023-03-18 23:11:12] [INFO ] Flatten gal took : 207 ms
[2023-03-18 23:11:12] [INFO ] Time to serialize gal into /tmp/LTL16305465958318228181.gal : 12 ms
[2023-03-18 23:11:12] [INFO ] Time to serialize properties into /tmp/LTL9278053896717656784.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/LTL16305465958318228181.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9278053896717656784.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((G("((p1462==0)||(p1495==0))"))||((G(F((!("((p6==1)&&(p17==1))"))U((G(!("((p6==1)&&(p17==1))")))||((!("((p6==1)&&(p17==1))"))&&(G...223
Formula 0 simplified : G(F!"((p1462==0)||(p1495==0))" & (!"((p1462==0)||(p1495==0))" | FG(F!"((p1462==0)||(p1495==0))" U "((p6==1)&&(p17==1))")))
Detected timeout of ITS tools.
[2023-03-18 23:11:27] [INFO ] Flatten gal took : 178 ms
[2023-03-18 23:11:27] [INFO ] Applying decomposition
[2023-03-18 23:11:27] [INFO ] Flatten gal took : 147 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/graph12845989475993063025.txt' '-o' '/tmp/graph12845989475993063025.bin' '-w' '/tmp/graph12845989475993063025.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12845989475993063025.bin' '-l' '-1' '-v' '-w' '/tmp/graph12845989475993063025.weights' '-q' '0' '-e' '0.001'
[2023-03-18 23:11:27] [INFO ] Decomposing Gal with order
[2023-03-18 23:11:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 23:11:28] [INFO ] Removed a total of 1595 redundant transitions.
[2023-03-18 23:11:28] [INFO ] Flatten gal took : 205 ms
[2023-03-18 23:11:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 1528 labels/synchronizations in 201 ms.
[2023-03-18 23:11:28] [INFO ] Time to serialize gal into /tmp/LTL9369558856899945403.gal : 21 ms
[2023-03-18 23:11:28] [INFO ] Time to serialize properties into /tmp/LTL8157649395677895794.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/LTL9369558856899945403.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8157649395677895794.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("((i27.i0.i2.u527.p1462==0)||(i27.i1.i1.u539.p1495==0))"))||((G(F((!("((i0.i0.i1.u2.p6==1)&&(i0.i0.i1.u6.p17==1))"))U((G(!("((...385
Formula 0 simplified : G(F!"((i27.i0.i2.u527.p1462==0)||(i27.i1.i1.u539.p1495==0))" & (!"((i27.i0.i2.u527.p1462==0)||(i27.i1.i1.u539.p1495==0))" | FG(F!"((...259
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12565568658824906793
[2023-03-18 23:11:43] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12565568658824906793
Running compilation step : cd /tmp/ltsmin12565568658824906793;'/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/ltsmin12565568658824906793;'/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/ltsmin12565568658824906793;'/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 ShieldIIPs-PT-100A-LTLFireability-06 finished in 270869 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)||F(G((p1||F(p2)))))))'
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 97 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-18 23:11:46] [INFO ] Computed 901 place invariants in 28 ms
[2023-03-18 23:11:49] [INFO ] Implicit Places using invariants in 2448 ms returned []
[2023-03-18 23:11:49] [INFO ] Invariant cache hit.
[2023-03-18 23:11:51] [INFO ] Implicit Places using invariants and state equation in 2457 ms returned []
Implicit Place search using SMT with State Equation took 4921 ms to find 0 implicit places.
[2023-03-18 23:11:51] [INFO ] Invariant cache hit.
[2023-03-18 23:11:54] [INFO ] Dead Transitions using invariants and state equation in 2347 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7380 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 461 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(AND (EQ s1482 1) (EQ s1484 1) (EQ s153 1) (EQ s174 1)), p1:(AND (EQ s1482 1) (EQ s1484 1)), p2:(EQ s772 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 30 reset in 2140 ms.
Product exploration explored 100000 steps with 30 reset in 2304 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 2115 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 1987 steps, including 0 resets, run visited all 2 properties in 102 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 8 factoid took 403 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-18 23:12:02] [INFO ] Invariant cache hit.
[2023-03-18 23:12:06] [INFO ] [Real]Absence check using 901 positive place invariants in 1075 ms returned sat
[2023-03-18 23:12:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:12:17] [INFO ] [Real]Absence check using state equation in 10649 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 3 out of 2503 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 23 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 244 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-18 23:12:17] [INFO ] Computed 901 place invariants in 12 ms
[2023-03-18 23:12:19] [INFO ] Implicit Places using invariants in 2062 ms returned []
[2023-03-18 23:12:19] [INFO ] Invariant cache hit.
[2023-03-18 23:12:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 23:12:25] [INFO ] Implicit Places using invariants and state equation in 5934 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 8030 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2503 places, 2401/2403 transitions.
Applied a total of 0 rules in 196 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8470 ms. Remains : 2500/2503 places, 2401/2403 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 396 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 2011 steps, including 0 resets, run visited all 2 properties in 142 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 446 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-18 23:12:27] [INFO ] Computed 900 place invariants in 23 ms
[2023-03-18 23:12:31] [INFO ] [Real]Absence check using 900 positive place invariants in 1023 ms returned sat
[2023-03-18 23:12:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:12:42] [INFO ] [Real]Absence check using state equation in 10857 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 30 reset in 2009 ms.
Product exploration explored 100000 steps with 30 reset in 2265 ms.
Built C files in :
/tmp/ltsmin3375820757431006064
[2023-03-18 23:12:47] [INFO ] Too many transitions (2401) to apply POR reductions. Disabling POR matrices.
[2023-03-18 23:12:47] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3375820757431006064
Running compilation step : cd /tmp/ltsmin3375820757431006064;'/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/ltsmin3375820757431006064;'/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/ltsmin3375820757431006064;'/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 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 128 ms. Remains 2499 /2500 variables (removed 1) and now considering 2400/2401 (removed 1) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-18 23:12:50] [INFO ] Computed 900 place invariants in 4 ms
[2023-03-18 23:12:52] [INFO ] Implicit Places using invariants in 2324 ms returned []
[2023-03-18 23:12:52] [INFO ] Invariant cache hit.
[2023-03-18 23:12:57] [INFO ] Implicit Places using invariants and state equation in 4214 ms returned []
Implicit Place search using SMT with State Equation took 6574 ms to find 0 implicit places.
[2023-03-18 23:12:57] [INFO ] Redundant transitions in 406 ms returned [2394]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2399 rows 2499 cols
[2023-03-18 23:12:57] [INFO ] Computed 900 place invariants in 6 ms
[2023-03-18 23:12:59] [INFO ] Dead Transitions using invariants and state equation in 2276 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/2500 places, 2399/2401 transitions.
Applied a total of 0 rules in 146 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9542 ms. Remains : 2499/2500 places, 2399/2401 transitions.
Built C files in :
/tmp/ltsmin12414019411058089380
[2023-03-18 23:13:00] [INFO ] Too many transitions (2399) to apply POR reductions. Disabling POR matrices.
[2023-03-18 23:13:00] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12414019411058089380
Running compilation step : cd /tmp/ltsmin12414019411058089380;'/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/ltsmin12414019411058089380;'/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/ltsmin12414019411058089380;'/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-18 23:13:03] [INFO ] Flatten gal took : 97 ms
[2023-03-18 23:13:03] [INFO ] Flatten gal took : 117 ms
[2023-03-18 23:13:03] [INFO ] Time to serialize gal into /tmp/LTL898146573572865184.gal : 24 ms
[2023-03-18 23:13:03] [INFO ] Time to serialize properties into /tmp/LTL9013356933497641915.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/LTL898146573572865184.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7150532314402348347.hoa' '-atoms' '/tmp/LTL9013356933497641915.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...316
Loading property file /tmp/LTL9013356933497641915.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7150532314402348347.hoa
Detected timeout of ITS tools.
[2023-03-18 23:13:18] [INFO ] Flatten gal took : 155 ms
[2023-03-18 23:13:18] [INFO ] Flatten gal took : 129 ms
[2023-03-18 23:13:18] [INFO ] Time to serialize gal into /tmp/LTL9075616032652956336.gal : 12 ms
[2023-03-18 23:13:18] [INFO ] Time to serialize properties into /tmp/LTL132679562295016080.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/LTL9075616032652956336.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL132679562295016080.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...274
Read 1 LTL properties
Checking formula 0 : !((X((G("(((p1482==1)&&(p1484==1))&&((p153==1)&&(p174==1)))"))||(F(G(("((p1482==1)&&(p1484==1))")||(F("(p772==1)"))))))))
Formula 0 simplified : X(F!"(((p1482==1)&&(p1484==1))&&((p153==1)&&(p174==1)))" & G(F!"((p1482==1)&&(p1484==1))" & FG!"(p772==1)"))
Detected timeout of ITS tools.
[2023-03-18 23:13:34] [INFO ] Flatten gal took : 175 ms
[2023-03-18 23:13:34] [INFO ] Applying decomposition
[2023-03-18 23:13:34] [INFO ] Flatten gal took : 228 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/graph13377119440026566629.txt' '-o' '/tmp/graph13377119440026566629.bin' '-w' '/tmp/graph13377119440026566629.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13377119440026566629.bin' '-l' '-1' '-v' '-w' '/tmp/graph13377119440026566629.weights' '-q' '0' '-e' '0.001'
[2023-03-18 23:13:34] [INFO ] Decomposing Gal with order
[2023-03-18 23:13:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 23:13:35] [INFO ] Removed a total of 1597 redundant transitions.
[2023-03-18 23:13:35] [INFO ] Flatten gal took : 193 ms
[2023-03-18 23:13:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 1556 labels/synchronizations in 200 ms.
[2023-03-18 23:13:35] [INFO ] Time to serialize gal into /tmp/LTL6921960372290174118.gal : 25 ms
[2023-03-18 23:13:35] [INFO ] Time to serialize properties into /tmp/LTL16474337933152180608.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/LTL6921960372290174118.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16474337933152180608.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("(((i27.i0.i0.u533.p1482==1)&&(i27.i0.i2.u534.p1484==1))&&((i2.i1.i0.u55.p153==1)&&(i2.i1.i2.u63.p174==1)))"))||(F(G(("((i27.i...243
Formula 0 simplified : X(F!"(((i27.i0.i0.u533.p1482==1)&&(i27.i0.i2.u534.p1484==1))&&((i2.i1.i0.u55.p153==1)&&(i2.i1.i2.u63.p174==1)))" & G(F!"((i27.i0.i0....232
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3437280056001247010
[2023-03-18 23:13:50] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3437280056001247010
Running compilation step : cd /tmp/ltsmin3437280056001247010;'/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/ltsmin3437280056001247010;'/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/ltsmin3437280056001247010;'/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 ShieldIIPs-PT-100A-LTLFireability-07 finished in 126944 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)) U p1)))'
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 146 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-18 23:13:53] [INFO ] Computed 901 place invariants in 8 ms
[2023-03-18 23:13:55] [INFO ] Implicit Places using invariants in 1558 ms returned []
[2023-03-18 23:13:55] [INFO ] Invariant cache hit.
[2023-03-18 23:13:57] [INFO ] Implicit Places using invariants and state equation in 2498 ms returned []
Implicit Place search using SMT with State Equation took 4089 ms to find 0 implicit places.
[2023-03-18 23:13:57] [INFO ] Invariant cache hit.
[2023-03-18 23:14:00] [INFO ] Dead Transitions using invariants and state equation in 2302 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6537 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 294 ms :[p0, (NOT p1), true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=p0, acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (EQ s486 1) (EQ s490 1) (EQ s502 1)), p1:(AND (EQ s786 1) (EQ s790 1) (EQ s802 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]]
Stuttering criterion allowed to conclude after 5029 steps with 0 reset in 133 ms.
FORMULA ShieldIIPs-PT-100A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLFireability-08 finished in 7052 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(X(G(p0)))))'
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 89 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-18 23:14:00] [INFO ] Invariant cache hit.
[2023-03-18 23:14:03] [INFO ] Implicit Places using invariants in 2467 ms returned []
[2023-03-18 23:14:03] [INFO ] Invariant cache hit.
[2023-03-18 23:14:05] [INFO ] Implicit Places using invariants and state equation in 2185 ms returned []
Implicit Place search using SMT with State Equation took 4679 ms to find 0 implicit places.
[2023-03-18 23:14:05] [INFO ] Invariant cache hit.
[2023-03-18 23:14:06] [INFO ] Dead Transitions using invariants and state equation in 1481 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6251 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 294 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s738 0) (EQ s746 0) (EQ s750 0) (EQ s2408 0) (EQ s2423 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 19 reset in 1852 ms.
Product exploration explored 100000 steps with 19 reset in 2035 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 102532 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102532 steps, saw 96003 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 23:14:14] [INFO ] Invariant cache hit.
[2023-03-18 23:14:15] [INFO ] [Real]Absence check using 901 positive place invariants in 250 ms returned sat
[2023-03-18 23:14:17] [INFO ] After 2456ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:14:18] [INFO ] [Nat]Absence check using 901 positive place invariants in 205 ms returned sat
[2023-03-18 23:14:23] [INFO ] After 4954ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:14:27] [INFO ] Deduced a trap composed of 13 places in 509 ms of which 1 ms to minimize.
[2023-03-18 23:14:28] [INFO ] Deduced a trap composed of 9 places in 348 ms of which 1 ms to minimize.
[2023-03-18 23:14:28] [INFO ] Deduced a trap composed of 11 places in 359 ms of which 1 ms to minimize.
[2023-03-18 23:14:29] [INFO ] Deduced a trap composed of 13 places in 290 ms of which 0 ms to minimize.
[2023-03-18 23:14:29] [INFO ] Deduced a trap composed of 11 places in 271 ms of which 1 ms to minimize.
[2023-03-18 23:14:30] [INFO ] Deduced a trap composed of 11 places in 349 ms of which 1 ms to minimize.
[2023-03-18 23:14:30] [INFO ] Deduced a trap composed of 13 places in 387 ms of which 0 ms to minimize.
[2023-03-18 23:14:31] [INFO ] Deduced a trap composed of 11 places in 371 ms of which 1 ms to minimize.
[2023-03-18 23:14:31] [INFO ] Deduced a trap composed of 13 places in 302 ms of which 1 ms to minimize.
[2023-03-18 23:14:32] [INFO ] Deduced a trap composed of 11 places in 362 ms of which 2 ms to minimize.
[2023-03-18 23:14:32] [INFO ] Deduced a trap composed of 11 places in 258 ms of which 0 ms to minimize.
[2023-03-18 23:14:32] [INFO ] Deduced a trap composed of 17 places in 356 ms of which 0 ms to minimize.
[2023-03-18 23:14:33] [INFO ] Deduced a trap composed of 19 places in 451 ms of which 1 ms to minimize.
[2023-03-18 23:14:34] [INFO ] Deduced a trap composed of 11 places in 286 ms of which 1 ms to minimize.
[2023-03-18 23:14:34] [INFO ] Deduced a trap composed of 11 places in 282 ms of which 0 ms to minimize.
[2023-03-18 23:14:34] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 1 ms to minimize.
[2023-03-18 23:14:35] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 0 ms to minimize.
[2023-03-18 23:14:35] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 0 ms to minimize.
[2023-03-18 23:14:35] [INFO ] Deduced a trap composed of 17 places in 265 ms of which 1 ms to minimize.
[2023-03-18 23:14:36] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 0 ms to minimize.
[2023-03-18 23:14:36] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2023-03-18 23:14:36] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 1 ms to minimize.
[2023-03-18 23:14:37] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 1 ms to minimize.
[2023-03-18 23:14:37] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 0 ms to minimize.
[2023-03-18 23:14:37] [INFO ] Deduced a trap composed of 17 places in 255 ms of which 0 ms to minimize.
[2023-03-18 23:14:38] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 0 ms to minimize.
[2023-03-18 23:14:38] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 20 ms to minimize.
[2023-03-18 23:14:39] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 0 ms to minimize.
[2023-03-18 23:14:39] [INFO ] Deduced a trap composed of 28 places in 383 ms of which 1 ms to minimize.
[2023-03-18 23:14:39] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 0 ms to minimize.
[2023-03-18 23:14:40] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 1 ms to minimize.
[2023-03-18 23:14:40] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 0 ms to minimize.
[2023-03-18 23:14:40] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 0 ms to minimize.
[2023-03-18 23:14:41] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 0 ms to minimize.
[2023-03-18 23:14:41] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 14224 ms
[2023-03-18 23:14:41] [INFO ] After 23191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1067 ms.
[2023-03-18 23:14:42] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 279 ms.
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 29 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 45 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 0 with 696 rules applied. Total rules applied 700 place count 2501 transition count 2401
Applied a total of 700 rules in 369 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 369 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 140067 steps, run timeout after 3002 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 140067 steps, saw 138090 distinct states, run finished after 3002 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-18 23:14:46] [INFO ] Computed 901 place invariants in 24 ms
[2023-03-18 23:14:47] [INFO ] [Real]Absence check using 898 positive place invariants in 236 ms returned sat
[2023-03-18 23:14:47] [INFO ] [Real]Absence check using 898 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 23:14:48] [INFO ] After 2501ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:14:49] [INFO ] [Nat]Absence check using 898 positive place invariants in 238 ms returned sat
[2023-03-18 23:14:49] [INFO ] [Nat]Absence check using 898 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 23:15:00] [INFO ] After 11065ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 221 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 222 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 107 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-18 23:15:00] [INFO ] Invariant cache hit.
[2023-03-18 23:15:03] [INFO ] Implicit Places using invariants in 3166 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3188 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 101 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3396 ms. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 146272 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 146272 steps, saw 144229 distinct states, run finished after 3002 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-18 23:15:07] [INFO ] Computed 900 place invariants in 32 ms
[2023-03-18 23:15:08] [INFO ] [Real]Absence check using 897 positive place invariants in 334 ms returned sat
[2023-03-18 23:15:08] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 35 ms returned sat
[2023-03-18 23:15:09] [INFO ] After 2791ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:15:10] [INFO ] [Nat]Absence check using 897 positive place invariants in 197 ms returned sat
[2023-03-18 23:15:10] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 23:15:19] [INFO ] After 9230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:15:28] [INFO ] After 18265ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-18 23:15:28] [INFO ] After 18947ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 188 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 110 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 94 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-18 23:15:29] [INFO ] Invariant cache hit.
[2023-03-18 23:15:31] [INFO ] Implicit Places using invariants in 2289 ms returned []
[2023-03-18 23:15:31] [INFO ] Invariant cache hit.
[2023-03-18 23:15:37] [INFO ] Implicit Places using invariants and state equation in 6230 ms returned []
Implicit Place search using SMT with State Equation took 8521 ms to find 0 implicit places.
[2023-03-18 23:15:37] [INFO ] Redundant transitions in 131 ms returned []
[2023-03-18 23:15:37] [INFO ] Invariant cache hit.
[2023-03-18 23:15:40] [INFO ] Dead Transitions using invariants and state equation in 2672 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11448 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 92 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 23:15:40] [INFO ] Invariant cache hit.
[2023-03-18 23:15:41] [INFO ] [Real]Absence check using 897 positive place invariants in 191 ms returned sat
[2023-03-18 23:15:41] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 23:15:42] [INFO ] After 2312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:15:43] [INFO ] [Nat]Absence check using 897 positive place invariants in 197 ms returned sat
[2023-03-18 23:15:43] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 23:15:48] [INFO ] After 4465ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:15:57] [INFO ] After 13494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-18 23:15:57] [INFO ] After 14189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 291 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 121 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-18 23:15:58] [INFO ] Computed 901 place invariants in 15 ms
[2023-03-18 23:16:00] [INFO ] Implicit Places using invariants in 2199 ms returned []
[2023-03-18 23:16:00] [INFO ] Invariant cache hit.
[2023-03-18 23:16:02] [INFO ] Implicit Places using invariants and state equation in 2479 ms returned []
Implicit Place search using SMT with State Equation took 4699 ms to find 0 implicit places.
[2023-03-18 23:16:02] [INFO ] Invariant cache hit.
[2023-03-18 23:16:04] [INFO ] Dead Transitions using invariants and state equation in 1899 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6732 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 117180 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 117180 steps, saw 109360 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 23:16:08] [INFO ] Invariant cache hit.
[2023-03-18 23:16:09] [INFO ] [Real]Absence check using 901 positive place invariants in 226 ms returned sat
[2023-03-18 23:16:11] [INFO ] After 2648ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:16:11] [INFO ] [Nat]Absence check using 901 positive place invariants in 255 ms returned sat
[2023-03-18 23:16:16] [INFO ] After 4931ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:16:20] [INFO ] Deduced a trap composed of 13 places in 541 ms of which 3 ms to minimize.
[2023-03-18 23:16:21] [INFO ] Deduced a trap composed of 9 places in 449 ms of which 0 ms to minimize.
[2023-03-18 23:16:21] [INFO ] Deduced a trap composed of 11 places in 393 ms of which 1 ms to minimize.
[2023-03-18 23:16:22] [INFO ] Deduced a trap composed of 13 places in 395 ms of which 1 ms to minimize.
[2023-03-18 23:16:22] [INFO ] Deduced a trap composed of 11 places in 279 ms of which 0 ms to minimize.
[2023-03-18 23:16:23] [INFO ] Deduced a trap composed of 11 places in 295 ms of which 0 ms to minimize.
[2023-03-18 23:16:23] [INFO ] Deduced a trap composed of 13 places in 324 ms of which 0 ms to minimize.
[2023-03-18 23:16:24] [INFO ] Deduced a trap composed of 11 places in 432 ms of which 1 ms to minimize.
[2023-03-18 23:16:24] [INFO ] Deduced a trap composed of 13 places in 354 ms of which 1 ms to minimize.
[2023-03-18 23:16:25] [INFO ] Deduced a trap composed of 11 places in 380 ms of which 0 ms to minimize.
[2023-03-18 23:16:25] [INFO ] Deduced a trap composed of 11 places in 358 ms of which 0 ms to minimize.
[2023-03-18 23:16:26] [INFO ] Deduced a trap composed of 17 places in 235 ms of which 0 ms to minimize.
[2023-03-18 23:16:26] [INFO ] Deduced a trap composed of 19 places in 260 ms of which 0 ms to minimize.
[2023-03-18 23:16:26] [INFO ] Deduced a trap composed of 11 places in 282 ms of which 1 ms to minimize.
[2023-03-18 23:16:27] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 0 ms to minimize.
[2023-03-18 23:16:27] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 0 ms to minimize.
[2023-03-18 23:16:28] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 0 ms to minimize.
[2023-03-18 23:16:28] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 0 ms to minimize.
[2023-03-18 23:16:28] [INFO ] Deduced a trap composed of 17 places in 218 ms of which 0 ms to minimize.
[2023-03-18 23:16:29] [INFO ] Deduced a trap composed of 29 places in 185 ms of which 0 ms to minimize.
[2023-03-18 23:16:29] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 1 ms to minimize.
[2023-03-18 23:16:29] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 1 ms to minimize.
[2023-03-18 23:16:30] [INFO ] Deduced a trap composed of 17 places in 235 ms of which 1 ms to minimize.
[2023-03-18 23:16:30] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 0 ms to minimize.
[2023-03-18 23:16:31] [INFO ] Deduced a trap composed of 17 places in 216 ms of which 0 ms to minimize.
[2023-03-18 23:16:31] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 0 ms to minimize.
[2023-03-18 23:16:31] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 1 ms to minimize.
[2023-03-18 23:16:32] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 1 ms to minimize.
[2023-03-18 23:16:32] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 0 ms to minimize.
[2023-03-18 23:16:32] [INFO ] Deduced a trap composed of 28 places in 232 ms of which 15 ms to minimize.
[2023-03-18 23:16:33] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 13 ms to minimize.
[2023-03-18 23:16:33] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 0 ms to minimize.
[2023-03-18 23:16:33] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 0 ms to minimize.
[2023-03-18 23:16:33] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 0 ms to minimize.
[2023-03-18 23:16:34] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 14325 ms
[2023-03-18 23:16:34] [INFO ] After 22468ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1770 ms.
[2023-03-18 23:16:36] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 265 ms.
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 37 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 27 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 0 with 696 rules applied. Total rules applied 700 place count 2501 transition count 2401
Applied a total of 700 rules in 386 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 386 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 132040 steps, run timeout after 3002 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 132040 steps, saw 130144 distinct states, run finished after 3002 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-18 23:16:40] [INFO ] Computed 901 place invariants in 41 ms
[2023-03-18 23:16:40] [INFO ] [Real]Absence check using 898 positive place invariants in 367 ms returned sat
[2023-03-18 23:16:40] [INFO ] [Real]Absence check using 898 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 23:16:42] [INFO ] After 2795ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:16:43] [INFO ] [Nat]Absence check using 898 positive place invariants in 228 ms returned sat
[2023-03-18 23:16:43] [INFO ] [Nat]Absence check using 898 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 23:16:53] [INFO ] After 11062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 169 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 95 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-18 23:16:54] [INFO ] Invariant cache hit.
[2023-03-18 23:16:57] [INFO ] Implicit Places using invariants in 3310 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3318 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 138 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3571 ms. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 129287 steps, run timeout after 3054 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 129287 steps, saw 127414 distinct states, run finished after 3054 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-18 23:17:01] [INFO ] Computed 900 place invariants in 44 ms
[2023-03-18 23:17:02] [INFO ] [Real]Absence check using 897 positive place invariants in 581 ms returned sat
[2023-03-18 23:17:02] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 10 ms returned sat
[2023-03-18 23:17:03] [INFO ] After 2788ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:17:04] [INFO ] [Nat]Absence check using 897 positive place invariants in 335 ms returned sat
[2023-03-18 23:17:04] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 23:17:14] [INFO ] After 9650ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:17:23] [INFO ] After 18667ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-18 23:17:23] [INFO ] After 19587ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 210 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 97 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 120 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-18 23:17:23] [INFO ] Invariant cache hit.
[2023-03-18 23:17:26] [INFO ] Implicit Places using invariants in 2316 ms returned []
[2023-03-18 23:17:26] [INFO ] Invariant cache hit.
[2023-03-18 23:17:32] [INFO ] Implicit Places using invariants and state equation in 5982 ms returned []
Implicit Place search using SMT with State Equation took 8318 ms to find 0 implicit places.
[2023-03-18 23:17:32] [INFO ] Redundant transitions in 125 ms returned []
[2023-03-18 23:17:32] [INFO ] Invariant cache hit.
[2023-03-18 23:17:35] [INFO ] Dead Transitions using invariants and state equation in 2765 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11338 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 92 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 23:17:35] [INFO ] Invariant cache hit.
[2023-03-18 23:17:35] [INFO ] [Real]Absence check using 897 positive place invariants in 202 ms returned sat
[2023-03-18 23:17:35] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 23:17:37] [INFO ] After 2460ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:17:38] [INFO ] [Nat]Absence check using 897 positive place invariants in 226 ms returned sat
[2023-03-18 23:17:38] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 23:17:43] [INFO ] After 4767ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:17:52] [INFO ] After 13796ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-18 23:17:52] [INFO ] After 14538ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 267 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 322 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 19 reset in 2104 ms.
Product exploration explored 100000 steps with 19 reset in 2172 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 1054 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 16 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2503 transition count 2403
Deduced a syphon composed of 2 places in 12 ms
Applied a total of 2 rules in 528 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-18 23:17:59] [INFO ] Redundant transitions in 358 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2402 rows 2503 cols
[2023-03-18 23:17:59] [INFO ] Computed 901 place invariants in 7 ms
[2023-03-18 23:18:02] [INFO ] Dead Transitions using invariants and state equation in 2613 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2503/2503 places, 2402/2403 transitions.
Deduced a syphon composed of 2 places in 12 ms
Applied a total of 0 rules in 123 ms. Remains 2503 /2503 variables (removed 0) and now considering 2402/2402 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3630 ms. Remains : 2503/2503 places, 2402/2403 transitions.
Built C files in :
/tmp/ltsmin8726350638174128524
[2023-03-18 23:18:02] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8726350638174128524
Running compilation step : cd /tmp/ltsmin8726350638174128524;'/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/ltsmin8726350638174128524;'/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/ltsmin8726350638174128524;'/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 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 128 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-18 23:18:05] [INFO ] Computed 901 place invariants in 10 ms
[2023-03-18 23:18:07] [INFO ] Implicit Places using invariants in 2289 ms returned []
[2023-03-18 23:18:07] [INFO ] Invariant cache hit.
[2023-03-18 23:18:10] [INFO ] Implicit Places using invariants and state equation in 2458 ms returned []
Implicit Place search using SMT with State Equation took 4748 ms to find 0 implicit places.
[2023-03-18 23:18:10] [INFO ] Invariant cache hit.
[2023-03-18 23:18:12] [INFO ] Dead Transitions using invariants and state equation in 1815 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6692 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Built C files in :
/tmp/ltsmin12149739756658627809
[2023-03-18 23:18:12] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12149739756658627809
Running compilation step : cd /tmp/ltsmin12149739756658627809;'/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/ltsmin12149739756658627809;'/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/ltsmin12149739756658627809;'/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-18 23:18:15] [INFO ] Flatten gal took : 127 ms
[2023-03-18 23:18:15] [INFO ] Flatten gal took : 240 ms
[2023-03-18 23:18:15] [INFO ] Time to serialize gal into /tmp/LTL17369672017832113095.gal : 10 ms
[2023-03-18 23:18:15] [INFO ] Time to serialize properties into /tmp/LTL12846252160245673076.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/LTL17369672017832113095.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10122706633915788597.hoa' '-atoms' '/tmp/LTL12846252160245673076.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...320
Loading property file /tmp/LTL12846252160245673076.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10122706633915788597.hoa
Detected timeout of ITS tools.
[2023-03-18 23:18:30] [INFO ] Flatten gal took : 157 ms
[2023-03-18 23:18:31] [INFO ] Flatten gal took : 166 ms
[2023-03-18 23:18:31] [INFO ] Time to serialize gal into /tmp/LTL9321989476531602593.gal : 13 ms
[2023-03-18 23:18:31] [INFO ] Time to serialize properties into /tmp/LTL1799241207194093745.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/LTL9321989476531602593.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1799241207194093745.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(X(X(G("((((p738==0)||(p746==0))||((p750==0)||(p2408==0)))||(p2423==0))"))))))
Formula 0 simplified : XXXF!"((((p738==0)||(p746==0))||((p750==0)||(p2408==0)))||(p2423==0))"
Detected timeout of ITS tools.
[2023-03-18 23:18:46] [INFO ] Flatten gal took : 168 ms
[2023-03-18 23:18:46] [INFO ] Applying decomposition
[2023-03-18 23:18:46] [INFO ] Flatten gal took : 264 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/graph13465459483455317225.txt' '-o' '/tmp/graph13465459483455317225.bin' '-w' '/tmp/graph13465459483455317225.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13465459483455317225.bin' '-l' '-1' '-v' '-w' '/tmp/graph13465459483455317225.weights' '-q' '0' '-e' '0.001'
[2023-03-18 23:18:46] [INFO ] Decomposing Gal with order
[2023-03-18 23:18:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 23:18:47] [INFO ] Removed a total of 1600 redundant transitions.
[2023-03-18 23:18:47] [INFO ] Flatten gal took : 155 ms
[2023-03-18 23:18:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 1548 labels/synchronizations in 173 ms.
[2023-03-18 23:18:47] [INFO ] Time to serialize gal into /tmp/LTL4555728263272873089.gal : 19 ms
[2023-03-18 23:18:48] [INFO ] Time to serialize properties into /tmp/LTL17779811759107405447.ltl : 850 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/LTL4555728263272873089.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17779811759107405447.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(X(X(G("((((i12.i2.i2.u266.p738==0)||(i12.i2.i2.u269.p746==0))||((i12.i2.i2.u270.p750==0)||(i43.i0.i1.u867.p2408==0)))||(i43.i0.i1...178
Formula 0 simplified : XXXF!"((((i12.i2.i2.u266.p738==0)||(i12.i2.i2.u269.p746==0))||((i12.i2.i2.u270.p750==0)||(i43.i0.i1.u867.p2408==0)))||(i43.i0.i1.u87...168
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8984836226360963710
[2023-03-18 23:19:03] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8984836226360963710
Running compilation step : cd /tmp/ltsmin8984836226360963710;'/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/ltsmin8984836226360963710;'/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/ltsmin8984836226360963710;'/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 ShieldIIPs-PT-100A-LTLFireability-09 finished in 305963 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 U X(X(G(p1))))))'
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 119 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-18 23:19:06] [INFO ] Invariant cache hit.
[2023-03-18 23:19:08] [INFO ] Implicit Places using invariants in 1709 ms returned []
[2023-03-18 23:19:08] [INFO ] Invariant cache hit.
[2023-03-18 23:19:11] [INFO ] Implicit Places using invariants and state equation in 2589 ms returned []
Implicit Place search using SMT with State Equation took 4300 ms to find 0 implicit places.
[2023-03-18 23:19:11] [INFO ] Invariant cache hit.
[2023-03-18 23:19:13] [INFO ] Dead Transitions using invariants and state equation in 2777 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7202 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s1164 1) (EQ s1185 1) (EQ s608 1) (EQ s622 1) (EQ s2287 1) (EQ s2320 1)), p0:(AND (EQ s608 1) (EQ s622 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3660 steps with 0 reset in 56 ms.
FORMULA ShieldIIPs-PT-100A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLFireability-10 finished in 7543 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||F(p1)) U p2)||G(F(p3)))))'
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 73 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-18 23:19:14] [INFO ] Invariant cache hit.
[2023-03-18 23:19:16] [INFO ] Implicit Places using invariants in 2127 ms returned []
[2023-03-18 23:19:16] [INFO ] Invariant cache hit.
[2023-03-18 23:19:20] [INFO ] Implicit Places using invariants and state equation in 4543 ms returned []
Implicit Place search using SMT with State Equation took 6687 ms to find 0 implicit places.
[2023-03-18 23:19:20] [INFO ] Invariant cache hit.
[2023-03-18 23:19:23] [INFO ] Dead Transitions using invariants and state equation in 2638 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9399 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 360 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s6 1) (EQ s16 1)), p3:(OR (EQ s6 0) (EQ s16 0) (EQ s1358 0) (EQ s1373 0)), p0:(AND (EQ s1358 1) (EQ s1373 1)), p1:(EQ s1325 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 32 reset in 1933 ms.
Product exploration explored 100000 steps with 35 reset in 2228 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) p3 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 627 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 393 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 473 ms. (steps per millisecond=21 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-18 23:19:30] [INFO ] Invariant cache hit.
[2023-03-18 23:19:31] [INFO ] [Real]Absence check using 901 positive place invariants in 208 ms returned sat
[2023-03-18 23:19:32] [INFO ] After 2359ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-18 23:19:33] [INFO ] [Nat]Absence check using 901 positive place invariants in 495 ms returned sat
[2023-03-18 23:19:41] [INFO ] After 7245ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-18 23:19:41] [INFO ] Deduced a trap composed of 13 places in 317 ms of which 1 ms to minimize.
[2023-03-18 23:19:41] [INFO ] Deduced a trap composed of 11 places in 314 ms of which 9 ms to minimize.
[2023-03-18 23:19:42] [INFO ] Deduced a trap composed of 9 places in 833 ms of which 1 ms to minimize.
[2023-03-18 23:19:43] [INFO ] Deduced a trap composed of 11 places in 421 ms of which 4 ms to minimize.
[2023-03-18 23:19:43] [INFO ] Deduced a trap composed of 11 places in 268 ms of which 1 ms to minimize.
[2023-03-18 23:19:44] [INFO ] Deduced a trap composed of 17 places in 357 ms of which 0 ms to minimize.
[2023-03-18 23:19:44] [INFO ] Deduced a trap composed of 11 places in 268 ms of which 1 ms to minimize.
[2023-03-18 23:19:45] [INFO ] Deduced a trap composed of 17 places in 262 ms of which 1 ms to minimize.
[2023-03-18 23:19:45] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 0 ms to minimize.
[2023-03-18 23:19:45] [INFO ] Deduced a trap composed of 13 places in 247 ms of which 0 ms to minimize.
[2023-03-18 23:19:46] [INFO ] Deduced a trap composed of 11 places in 357 ms of which 1 ms to minimize.
[2023-03-18 23:19:47] [INFO ] Deduced a trap composed of 11 places in 1036 ms of which 0 ms to minimize.
[2023-03-18 23:19:47] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 1 ms to minimize.
[2023-03-18 23:19:49] [INFO ] Deduced a trap composed of 11 places in 1843 ms of which 1 ms to minimize.
[2023-03-18 23:19:50] [INFO ] Deduced a trap composed of 11 places in 240 ms of which 1 ms to minimize.
[2023-03-18 23:19:50] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 0 ms to minimize.
[2023-03-18 23:19:51] [INFO ] Deduced a trap composed of 11 places in 382 ms of which 1 ms to minimize.
[2023-03-18 23:19:51] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 1 ms to minimize.
[2023-03-18 23:19:52] [INFO ] Deduced a trap composed of 25 places in 752 ms of which 0 ms to minimize.
[2023-03-18 23:19:52] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2023-03-18 23:19:53] [INFO ] Deduced a trap composed of 11 places in 1469 ms of which 1 ms to minimize.
[2023-03-18 23:19:54] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
[2023-03-18 23:19:54] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 0 ms to minimize.
[2023-03-18 23:19:54] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 13443 ms
[2023-03-18 23:19:57] [INFO ] After 23905ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-18 23:19:57] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 796 ms.
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 0 with 696 rules applied. Total rules applied 700 place count 2501 transition count 2401
Applied a total of 700 rules in 355 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 355 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 94346 steps, run timeout after 3002 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94346 steps, saw 92854 distinct states, run finished after 3002 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-18 23:20:02] [INFO ] Computed 901 place invariants in 41 ms
[2023-03-18 23:20:03] [INFO ] [Real]Absence check using 899 positive place invariants in 406 ms returned sat
[2023-03-18 23:20:03] [INFO ] [Real]Absence check using 899 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:20:05] [INFO ] After 3000ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 23:20:06] [INFO ] [Nat]Absence check using 899 positive place invariants in 168 ms returned sat
[2023-03-18 23:20:06] [INFO ] [Nat]Absence check using 899 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 23:20:16] [INFO ] After 10564ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:20:16] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 23:20:18] [INFO ] After 1214ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 23:20:18] [INFO ] Deduced a trap composed of 5 places in 346 ms of which 1 ms to minimize.
[2023-03-18 23:20:18] [INFO ] Deduced a trap composed of 5 places in 256 ms of which 0 ms to minimize.
[2023-03-18 23:20:20] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
[2023-03-18 23:20:20] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 0 ms to minimize.
[2023-03-18 23:20:21] [INFO ] Deduced a trap composed of 6 places in 833 ms of which 1 ms to minimize.
[2023-03-18 23:20:22] [INFO ] Deduced a trap composed of 6 places in 308 ms of which 1 ms to minimize.
[2023-03-18 23:20:23] [INFO ] Deduced a trap composed of 5 places in 471 ms of which 1 ms to minimize.
[2023-03-18 23:20:23] [INFO ] Deduced a trap composed of 5 places in 286 ms of which 1 ms to minimize.
[2023-03-18 23:20:24] [INFO ] Deduced a trap composed of 5 places in 375 ms of which 0 ms to minimize.
[2023-03-18 23:20:24] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 0 ms to minimize.
[2023-03-18 23:20:24] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 0 ms to minimize.
[2023-03-18 23:20:25] [INFO ] Deduced a trap composed of 5 places in 338 ms of which 1 ms to minimize.
[2023-03-18 23:20:25] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 0 ms to minimize.
[2023-03-18 23:20:26] [INFO ] Deduced a trap composed of 5 places in 339 ms of which 0 ms to minimize.
[2023-03-18 23:20:26] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 1 ms to minimize.
[2023-03-18 23:20:26] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 0 ms to minimize.
[2023-03-18 23:20:27] [INFO ] Deduced a trap composed of 6 places in 269 ms of which 0 ms to minimize.
[2023-03-18 23:20:27] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 0 ms to minimize.
[2023-03-18 23:20:27] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 0 ms to minimize.
[2023-03-18 23:20:28] [INFO ] Deduced a trap composed of 5 places in 283 ms of which 0 ms to minimize.
[2023-03-18 23:20:28] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 0 ms to minimize.
[2023-03-18 23:20:29] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 1 ms to minimize.
[2023-03-18 23:20:29] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 0 ms to minimize.
[2023-03-18 23:20:29] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 0 ms to minimize.
[2023-03-18 23:20:30] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 0 ms to minimize.
[2023-03-18 23:20:30] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 0 ms to minimize.
[2023-03-18 23:20:30] [INFO ] Deduced a trap composed of 5 places in 296 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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:251)
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-18 23:20:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 23:20:30] [INFO ] After 25143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 344 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 86 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 88 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-18 23:20:31] [INFO ] Invariant cache hit.
[2023-03-18 23:20:33] [INFO ] Implicit Places using invariants in 2220 ms returned []
[2023-03-18 23:20:33] [INFO ] Invariant cache hit.
[2023-03-18 23:20:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 23:20:41] [INFO ] Implicit Places using invariants and state equation in 8399 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10671 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 112 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 10871 ms. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 96133 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96133 steps, saw 94619 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-18 23:20:45] [INFO ] Computed 900 place invariants in 42 ms
[2023-03-18 23:20:46] [INFO ] [Real]Absence check using 898 positive place invariants in 226 ms returned sat
[2023-03-18 23:20:46] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:20:48] [INFO ] After 2605ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 23:20:49] [INFO ] [Nat]Absence check using 898 positive place invariants in 204 ms returned sat
[2023-03-18 23:20:49] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-18 23:20:59] [INFO ] After 10588ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:21:01] [INFO ] Deduced a trap composed of 5 places in 271 ms of which 1 ms to minimize.
[2023-03-18 23:21:01] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 0 ms to minimize.
[2023-03-18 23:21:01] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 0 ms to minimize.
[2023-03-18 23:21:02] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 1 ms to minimize.
[2023-03-18 23:21:02] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 0 ms to minimize.
[2023-03-18 23:21:02] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 0 ms to minimize.
[2023-03-18 23:21:02] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 1 ms to minimize.
[2023-03-18 23:21:03] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 1 ms to minimize.
[2023-03-18 23:21:03] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 1 ms to minimize.
[2023-03-18 23:21:03] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 0 ms to minimize.
[2023-03-18 23:21:04] [INFO ] Deduced a trap composed of 6 places in 295 ms of which 0 ms to minimize.
[2023-03-18 23:21:04] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 0 ms to minimize.
[2023-03-18 23:21:04] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 1 ms to minimize.
[2023-03-18 23:21:05] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 0 ms to minimize.
[2023-03-18 23:21:05] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 1 ms to minimize.
[2023-03-18 23:21:05] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 0 ms to minimize.
[2023-03-18 23:21:05] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 0 ms to minimize.
[2023-03-18 23:21:06] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 0 ms to minimize.
[2023-03-18 23:21:06] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 0 ms to minimize.
[2023-03-18 23:21:06] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
[2023-03-18 23:21:06] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2023-03-18 23:21:08] [INFO ] Deduced a trap composed of 5 places in 273 ms of which 1 ms to minimize.
[2023-03-18 23:21:08] [INFO ] Deduced a trap composed of 9 places in 272 ms of which 1 ms to minimize.
[2023-03-18 23:21:08] [INFO ] Deduced a trap composed of 8 places in 283 ms of which 1 ms to minimize.
[2023-03-18 23:21:09] [INFO ] Deduced a trap composed of 6 places in 288 ms of which 1 ms to minimize.
[2023-03-18 23:21:11] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 1 ms to minimize.
[2023-03-18 23:21:12] [INFO ] Deduced a trap composed of 5 places in 267 ms of which 0 ms to minimize.
[2023-03-18 23:21:12] [INFO ] Deduced a trap composed of 6 places in 430 ms of which 0 ms to minimize.
[2023-03-18 23:21:13] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 1 ms to minimize.
[2023-03-18 23:21:13] [INFO ] Deduced a trap composed of 6 places in 275 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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:251)
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-18 23:21:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 23:21:13] [INFO ] After 25104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 189 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 74 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 72 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-18 23:21:13] [INFO ] Invariant cache hit.
[2023-03-18 23:21:16] [INFO ] Implicit Places using invariants in 3122 ms returned []
[2023-03-18 23:21:16] [INFO ] Invariant cache hit.
[2023-03-18 23:21:22] [INFO ] Implicit Places using invariants and state equation in 5940 ms returned []
Implicit Place search using SMT with State Equation took 9089 ms to find 0 implicit places.
[2023-03-18 23:21:22] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-18 23:21:22] [INFO ] Invariant cache hit.
[2023-03-18 23:21:25] [INFO ] Dead Transitions using invariants and state equation in 2399 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11641 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p3 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT p1))), (G (NOT (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)))), (G (NOT (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p2) (NOT p1) (NOT p0))))]
Knowledge based reduction with 13 factoid took 792 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 346 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 77 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-18 23:21:27] [INFO ] Computed 901 place invariants in 13 ms
[2023-03-18 23:21:29] [INFO ] Implicit Places using invariants in 2305 ms returned []
[2023-03-18 23:21:29] [INFO ] Invariant cache hit.
[2023-03-18 23:21:33] [INFO ] Implicit Places using invariants and state equation in 4613 ms returned []
Implicit Place search using SMT with State Equation took 6943 ms to find 0 implicit places.
[2023-03-18 23:21:33] [INFO ] Invariant cache hit.
[2023-03-18 23:21:37] [INFO ] Dead Transitions using invariants and state equation in 3493 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10549 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) p3), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 631 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 23:21:39] [INFO ] Invariant cache hit.
[2023-03-18 23:21:39] [INFO ] [Real]Absence check using 901 positive place invariants in 194 ms returned sat
[2023-03-18 23:21:41] [INFO ] After 2754ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 23:21:42] [INFO ] [Nat]Absence check using 901 positive place invariants in 239 ms returned sat
[2023-03-18 23:21:52] [INFO ] After 9483ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 23:21:52] [INFO ] Deduced a trap composed of 11 places in 317 ms of which 0 ms to minimize.
[2023-03-18 23:21:53] [INFO ] Deduced a trap composed of 13 places in 323 ms of which 0 ms to minimize.
[2023-03-18 23:21:53] [INFO ] Deduced a trap composed of 11 places in 391 ms of which 1 ms to minimize.
[2023-03-18 23:21:54] [INFO ] Deduced a trap composed of 11 places in 296 ms of which 1 ms to minimize.
[2023-03-18 23:21:54] [INFO ] Deduced a trap composed of 17 places in 265 ms of which 0 ms to minimize.
[2023-03-18 23:21:55] [INFO ] Deduced a trap composed of 13 places in 299 ms of which 1 ms to minimize.
[2023-03-18 23:21:55] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 1 ms to minimize.
[2023-03-18 23:21:55] [INFO ] Deduced a trap composed of 19 places in 268 ms of which 1 ms to minimize.
[2023-03-18 23:21:56] [INFO ] Deduced a trap composed of 11 places in 278 ms of which 1 ms to minimize.
[2023-03-18 23:21:56] [INFO ] Deduced a trap composed of 11 places in 202 ms of which 0 ms to minimize.
[2023-03-18 23:21:56] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 1 ms to minimize.
[2023-03-18 23:21:57] [INFO ] Deduced a trap composed of 17 places in 364 ms of which 0 ms to minimize.
[2023-03-18 23:21:57] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 1 ms to minimize.
[2023-03-18 23:21:58] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 1 ms to minimize.
[2023-03-18 23:21:58] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 1 ms to minimize.
[2023-03-18 23:21:58] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 1 ms to minimize.
[2023-03-18 23:21:59] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 0 ms to minimize.
[2023-03-18 23:21:59] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 0 ms to minimize.
[2023-03-18 23:21:59] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 0 ms to minimize.
[2023-03-18 23:21:59] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
[2023-03-18 23:22:00] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 1 ms to minimize.
[2023-03-18 23:22:00] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 0 ms to minimize.
[2023-03-18 23:22:00] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2023-03-18 23:22:00] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 0 ms to minimize.
[2023-03-18 23:22:01] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2023-03-18 23:22:01] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 1 ms to minimize.
[2023-03-18 23:22:01] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 1 ms to minimize.
[2023-03-18 23:22:01] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 0 ms to minimize.
[2023-03-18 23:22:02] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 0 ms to minimize.
[2023-03-18 23:22:02] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 1 ms to minimize.
[2023-03-18 23:22:02] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2023-03-18 23:22:02] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 16 ms to minimize.
[2023-03-18 23:22:03] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 1 ms to minimize.
[2023-03-18 23:22:03] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 1 ms to minimize.
[2023-03-18 23:22:04] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 0 ms to minimize.
[2023-03-18 23:22:04] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 0 ms to minimize.
[2023-03-18 23:22:04] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 0 ms to minimize.
[2023-03-18 23:22:05] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 0 ms to minimize.
[2023-03-18 23:22:05] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2023-03-18 23:22:05] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2023-03-18 23:22:05] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2023-03-18 23:22:06] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2023-03-18 23:22:06] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 13800 ms
[2023-03-18 23:22:06] [INFO ] After 24088ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-18 23:22:06] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 710 ms.
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 0 with 696 rules applied. Total rules applied 700 place count 2501 transition count 2401
Applied a total of 700 rules in 289 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 289 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 105982 steps, run timeout after 3017 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105982 steps, saw 104349 distinct states, run finished after 3017 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-18 23:22:11] [INFO ] Computed 901 place invariants in 15 ms
[2023-03-18 23:22:12] [INFO ] [Real]Absence check using 899 positive place invariants in 254 ms returned sat
[2023-03-18 23:22:12] [INFO ] [Real]Absence check using 899 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:22:14] [INFO ] After 2586ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 23:22:15] [INFO ] [Nat]Absence check using 899 positive place invariants in 329 ms returned sat
[2023-03-18 23:22:15] [INFO ] [Nat]Absence check using 899 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 23:22:26] [INFO ] After 10664ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:22:26] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 23:22:26] [INFO ] After 307ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 23:22:27] [INFO ] Deduced a trap composed of 5 places in 269 ms of which 1 ms to minimize.
[2023-03-18 23:22:27] [INFO ] Deduced a trap composed of 5 places in 295 ms of which 0 ms to minimize.
[2023-03-18 23:22:28] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 0 ms to minimize.
[2023-03-18 23:22:28] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 1 ms to minimize.
[2023-03-18 23:22:29] [INFO ] Deduced a trap composed of 6 places in 314 ms of which 1 ms to minimize.
[2023-03-18 23:22:38] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 11365 ms
[2023-03-18 23:22:38] [INFO ] After 12523ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-18 23:22:38] [INFO ] After 24306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 283 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 122 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 111 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-18 23:22:39] [INFO ] Invariant cache hit.
[2023-03-18 23:22:41] [INFO ] Implicit Places using invariants in 2440 ms returned []
[2023-03-18 23:22:41] [INFO ] Invariant cache hit.
[2023-03-18 23:22:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 23:22:49] [INFO ] Implicit Places using invariants and state equation in 7643 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10090 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 149 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 10364 ms. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 84692 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84692 steps, saw 83310 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-18 23:22:53] [INFO ] Computed 900 place invariants in 29 ms
[2023-03-18 23:22:53] [INFO ] [Real]Absence check using 898 positive place invariants in 203 ms returned sat
[2023-03-18 23:22:53] [INFO ] [Real]Absence check using 898 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-18 23:22:55] [INFO ] After 2622ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 23:22:56] [INFO ] [Nat]Absence check using 898 positive place invariants in 209 ms returned sat
[2023-03-18 23:22:56] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 23:23:07] [INFO ] After 10533ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:23:10] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 1 ms to minimize.
[2023-03-18 23:23:11] [INFO ] Deduced a trap composed of 5 places in 247 ms of which 0 ms to minimize.
[2023-03-18 23:23:11] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 0 ms to minimize.
[2023-03-18 23:23:12] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 1 ms to minimize.
[2023-03-18 23:23:12] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 1 ms to minimize.
[2023-03-18 23:23:12] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 0 ms to minimize.
[2023-03-18 23:23:13] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 1 ms to minimize.
[2023-03-18 23:23:13] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 1 ms to minimize.
[2023-03-18 23:23:13] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 0 ms to minimize.
[2023-03-18 23:23:14] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 0 ms to minimize.
[2023-03-18 23:23:15] [INFO ] Deduced a trap composed of 5 places in 458 ms of which 0 ms to minimize.
[2023-03-18 23:23:15] [INFO ] Deduced a trap composed of 5 places in 328 ms of which 0 ms to minimize.
[2023-03-18 23:23:15] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 1 ms to minimize.
[2023-03-18 23:23:16] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 0 ms to minimize.
[2023-03-18 23:23:16] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 1 ms to minimize.
[2023-03-18 23:23:17] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 1 ms to minimize.
[2023-03-18 23:23:17] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 0 ms to minimize.
[2023-03-18 23:23:17] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 1 ms to minimize.
[2023-03-18 23:23:17] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2023-03-18 23:23:18] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 0 ms to minimize.
[2023-03-18 23:23:18] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 0 ms to minimize.
[2023-03-18 23:23:19] [INFO ] Deduced a trap composed of 5 places in 366 ms of which 0 ms to minimize.
[2023-03-18 23:23:19] [INFO ] Deduced a trap composed of 5 places in 323 ms of which 1 ms to minimize.
[2023-03-18 23:23:19] [INFO ] Deduced a trap composed of 6 places in 342 ms of which 1 ms to minimize.
[2023-03-18 23:23:20] [INFO ] Deduced a trap composed of 5 places in 389 ms of which 1 ms to minimize.
[2023-03-18 23:23:20] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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-18 23:23:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 23:23:20] [INFO ] After 25139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 183 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 79 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 79 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-18 23:23:21] [INFO ] Invariant cache hit.
[2023-03-18 23:23:24] [INFO ] Implicit Places using invariants in 3762 ms returned []
[2023-03-18 23:23:24] [INFO ] Invariant cache hit.
[2023-03-18 23:23:32] [INFO ] Implicit Places using invariants and state equation in 7522 ms returned []
Implicit Place search using SMT with State Equation took 11287 ms to find 0 implicit places.
[2023-03-18 23:23:32] [INFO ] Redundant transitions in 101 ms returned []
[2023-03-18 23:23:32] [INFO ] Invariant cache hit.
[2023-03-18 23:23:35] [INFO ] Dead Transitions using invariants and state equation in 2704 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14189 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) p3), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 636 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 331 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 32 reset in 1874 ms.
Product exploration explored 100000 steps with 30 reset in 2083 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 16 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2503 transition count 2403
Deduced a syphon composed of 2 places in 15 ms
Applied a total of 2 rules in 243 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-18 23:23:41] [INFO ] Redundant transitions in 327 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2402 rows 2503 cols
[2023-03-18 23:23:41] [INFO ] Computed 901 place invariants in 6 ms
[2023-03-18 23:23:44] [INFO ] Dead Transitions using invariants and state equation in 2507 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2503/2503 places, 2402/2403 transitions.
Deduced a syphon composed of 2 places in 14 ms
Applied a total of 0 rules in 137 ms. Remains 2503 /2503 variables (removed 0) and now considering 2402/2402 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3226 ms. Remains : 2503/2503 places, 2402/2403 transitions.
Built C files in :
/tmp/ltsmin12642400500421043102
[2023-03-18 23:23:44] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12642400500421043102
Running compilation step : cd /tmp/ltsmin12642400500421043102;'/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/ltsmin12642400500421043102;'/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/ltsmin12642400500421043102;'/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 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 72 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-18 23:23:47] [INFO ] Computed 901 place invariants in 12 ms
[2023-03-18 23:23:49] [INFO ] Implicit Places using invariants in 2294 ms returned []
[2023-03-18 23:23:49] [INFO ] Invariant cache hit.
[2023-03-18 23:23:55] [INFO ] Implicit Places using invariants and state equation in 5212 ms returned []
Implicit Place search using SMT with State Equation took 7511 ms to find 0 implicit places.
[2023-03-18 23:23:55] [INFO ] Invariant cache hit.
[2023-03-18 23:23:56] [INFO ] Dead Transitions using invariants and state equation in 1621 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9219 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Built C files in :
/tmp/ltsmin6867301160519312183
[2023-03-18 23:23:56] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6867301160519312183
Running compilation step : cd /tmp/ltsmin6867301160519312183;'/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/ltsmin6867301160519312183;'/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/ltsmin6867301160519312183;'/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-18 23:24:00] [INFO ] Flatten gal took : 133 ms
[2023-03-18 23:24:00] [INFO ] Flatten gal took : 132 ms
[2023-03-18 23:24:00] [INFO ] Time to serialize gal into /tmp/LTL7228350028616849874.gal : 13 ms
[2023-03-18 23:24:00] [INFO ] Time to serialize properties into /tmp/LTL3855654567170881774.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/LTL7228350028616849874.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18167121099784841808.hoa' '-atoms' '/tmp/LTL3855654567170881774.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/LTL3855654567170881774.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18167121099784841808.hoa
Detected timeout of ITS tools.
[2023-03-18 23:24:15] [INFO ] Flatten gal took : 148 ms
[2023-03-18 23:24:15] [INFO ] Flatten gal took : 172 ms
[2023-03-18 23:24:15] [INFO ] Time to serialize gal into /tmp/LTL5990093286931017109.gal : 11 ms
[2023-03-18 23:24:15] [INFO ] Time to serialize properties into /tmp/LTL8201262292427874136.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/LTL5990093286931017109.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8201262292427874136.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(((("((p1358==1)&&(p1373==1))")||(F("(p1325==1)")))U("((p6==1)&&(p16==1))"))||(G(F("(((p6==0)||(p16==0))||((p1358==0)||(p1373==0))...163
Formula 0 simplified : X(((!"((p1358==1)&&(p1373==1))" & G!"(p1325==1)") R !"((p6==1)&&(p16==1))") & FG!"(((p6==0)||(p16==0))||((p1358==0)||(p1373==0)))")
Detected timeout of ITS tools.
[2023-03-18 23:24:30] [INFO ] Flatten gal took : 134 ms
[2023-03-18 23:24:30] [INFO ] Applying decomposition
[2023-03-18 23:24:31] [INFO ] Flatten gal took : 166 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/graph13153944116657930478.txt' '-o' '/tmp/graph13153944116657930478.bin' '-w' '/tmp/graph13153944116657930478.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13153944116657930478.bin' '-l' '-1' '-v' '-w' '/tmp/graph13153944116657930478.weights' '-q' '0' '-e' '0.001'
[2023-03-18 23:24:31] [INFO ] Decomposing Gal with order
[2023-03-18 23:24:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 23:24:31] [INFO ] Removed a total of 1600 redundant transitions.
[2023-03-18 23:24:31] [INFO ] Flatten gal took : 131 ms
[2023-03-18 23:24:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 1552 labels/synchronizations in 200 ms.
[2023-03-18 23:24:32] [INFO ] Time to serialize gal into /tmp/LTL6981442649444959300.gal : 27 ms
[2023-03-18 23:24:32] [INFO ] Time to serialize properties into /tmp/LTL3778736286554790104.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/LTL6981442649444959300.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3778736286554790104.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(((("((i24.i0.i2.u489.p1358==1)&&(i24.i0.i2.u494.p1373==1))")||(F("(i23.i0.i2.u477.p1325==1)")))U("((i0.i0.i0.u2.p6==1)&&(i0.i0.i0...286
Formula 0 simplified : X(((!"((i24.i0.i2.u489.p1358==1)&&(i24.i0.i2.u494.p1373==1))" & G!"(i23.i0.i2.u477.p1325==1)") R !"((i0.i0.i0.u2.p6==1)&&(i0.i0.i0.u...277
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1516303791478899714
[2023-03-18 23:24:47] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1516303791478899714
Running compilation step : cd /tmp/ltsmin1516303791478899714;'/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/ltsmin1516303791478899714;'/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/ltsmin1516303791478899714;'/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 ShieldIIPs-PT-100A-LTLFireability-11 finished in 336144 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 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 84 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-18 23:24:50] [INFO ] Invariant cache hit.
[2023-03-18 23:24:52] [INFO ] Implicit Places using invariants in 2527 ms returned []
[2023-03-18 23:24:52] [INFO ] Invariant cache hit.
[2023-03-18 23:24:55] [INFO ] Implicit Places using invariants and state equation in 2366 ms returned []
Implicit Place search using SMT with State Equation took 4924 ms to find 0 implicit places.
[2023-03-18 23:24:55] [INFO ] Invariant cache hit.
[2023-03-18 23:24:57] [INFO ] Dead Transitions using invariants and state equation in 2231 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7260 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT 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:(AND (EQ s513 1) (EQ s523 1) (EQ s525 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]]
Stuttering criterion allowed to conclude after 5058 steps with 0 reset in 96 ms.
FORMULA ShieldIIPs-PT-100A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLFireability-12 finished in 7633 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 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2502 transition count 2401
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2500 transition count 2401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 2499 transition count 2400
Applied a total of 5 rules in 192 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-18 23:24:58] [INFO ] Computed 900 place invariants in 10 ms
[2023-03-18 23:25:00] [INFO ] Implicit Places using invariants in 2743 ms returned []
[2023-03-18 23:25:00] [INFO ] Invariant cache hit.
[2023-03-18 23:25:05] [INFO ] Implicit Places using invariants and state equation in 4564 ms returned []
Implicit Place search using SMT with State Equation took 7347 ms to find 0 implicit places.
[2023-03-18 23:25:06] [INFO ] Redundant transitions in 541 ms returned [2394]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2399 rows 2499 cols
[2023-03-18 23:25:06] [INFO ] Computed 900 place invariants in 21 ms
[2023-03-18 23:25:08] [INFO ] Dead Transitions using invariants and state equation in 2458 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/2503 places, 2399/2403 transitions.
Applied a total of 0 rules in 107 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10677 ms. Remains : 2499/2503 places, 2399/2403 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100A-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:(NEQ s2115 1)], 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 19 reset in 1923 ms.
Product exploration explored 100000 steps with 19 reset in 2189 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 204 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 58 ms :[(NOT p0)]
Finished random walk after 802 steps, including 0 resets, run visited all 1 properties in 15 ms. (steps per millisecond=53 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 200 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 91 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0)]
Support contains 1 out of 2499 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2499/2499 places, 2399/2399 transitions.
Applied a total of 0 rules in 122 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
[2023-03-18 23:25:13] [INFO ] Invariant cache hit.
[2023-03-18 23:25:15] [INFO ] Implicit Places using invariants in 1982 ms returned []
[2023-03-18 23:25:15] [INFO ] Invariant cache hit.
[2023-03-18 23:25:18] [INFO ] Implicit Places using invariants and state equation in 2869 ms returned []
Implicit Place search using SMT with State Equation took 4865 ms to find 0 implicit places.
[2023-03-18 23:25:19] [INFO ] Redundant transitions in 506 ms returned []
[2023-03-18 23:25:19] [INFO ] Invariant cache hit.
[2023-03-18 23:25:21] [INFO ] Dead Transitions using invariants and state equation in 2012 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7516 ms. Remains : 2499/2499 places, 2399/2399 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 174 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 68 ms :[(NOT p0)]
Finished random walk after 730 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=56 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 283 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 92 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Product exploration explored 100000 steps with 19 reset in 1947 ms.
Product exploration explored 100000 steps with 19 reset in 2142 ms.
Built C files in :
/tmp/ltsmin9851357999325986044
[2023-03-18 23:25:25] [INFO ] Too many transitions (2399) to apply POR reductions. Disabling POR matrices.
[2023-03-18 23:25:26] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9851357999325986044
Running compilation step : cd /tmp/ltsmin9851357999325986044;'/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/ltsmin9851357999325986044;'/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/ltsmin9851357999325986044;'/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 2499 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2499/2499 places, 2399/2399 transitions.
Applied a total of 0 rules in 78 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
[2023-03-18 23:25:29] [INFO ] Invariant cache hit.
[2023-03-18 23:25:31] [INFO ] Implicit Places using invariants in 2294 ms returned []
[2023-03-18 23:25:31] [INFO ] Invariant cache hit.
[2023-03-18 23:25:33] [INFO ] Implicit Places using invariants and state equation in 2449 ms returned []
Implicit Place search using SMT with State Equation took 4759 ms to find 0 implicit places.
[2023-03-18 23:25:34] [INFO ] Redundant transitions in 333 ms returned []
[2023-03-18 23:25:34] [INFO ] Invariant cache hit.
[2023-03-18 23:25:36] [INFO ] Dead Transitions using invariants and state equation in 2325 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7515 ms. Remains : 2499/2499 places, 2399/2399 transitions.
Built C files in :
/tmp/ltsmin7397642401058451973
[2023-03-18 23:25:36] [INFO ] Too many transitions (2399) to apply POR reductions. Disabling POR matrices.
[2023-03-18 23:25:36] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7397642401058451973
Running compilation step : cd /tmp/ltsmin7397642401058451973;'/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/ltsmin7397642401058451973;'/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/ltsmin7397642401058451973;'/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-18 23:25:39] [INFO ] Flatten gal took : 80 ms
[2023-03-18 23:25:39] [INFO ] Flatten gal took : 131 ms
[2023-03-18 23:25:39] [INFO ] Time to serialize gal into /tmp/LTL9171339431368467465.gal : 24 ms
[2023-03-18 23:25:39] [INFO ] Time to serialize properties into /tmp/LTL13693610023179533202.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/LTL9171339431368467465.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7933651777938784418.hoa' '-atoms' '/tmp/LTL13693610023179533202.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/LTL13693610023179533202.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7933651777938784418.hoa
Detected timeout of ITS tools.
[2023-03-18 23:25:55] [INFO ] Flatten gal took : 81 ms
[2023-03-18 23:25:55] [INFO ] Flatten gal took : 85 ms
[2023-03-18 23:25:55] [INFO ] Time to serialize gal into /tmp/LTL5267206637091404495.gal : 12 ms
[2023-03-18 23:25:55] [INFO ] Time to serialize properties into /tmp/LTL5419308807171950240.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/LTL5267206637091404495.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5419308807171950240.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 : !((F(G("(p2116==0)"))))
Formula 0 simplified : GF!"(p2116==0)"
Detected timeout of ITS tools.
[2023-03-18 23:26:10] [INFO ] Flatten gal took : 123 ms
[2023-03-18 23:26:10] [INFO ] Applying decomposition
[2023-03-18 23:26:10] [INFO ] Flatten gal took : 85 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/graph16125206242216551232.txt' '-o' '/tmp/graph16125206242216551232.bin' '-w' '/tmp/graph16125206242216551232.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16125206242216551232.bin' '-l' '-1' '-v' '-w' '/tmp/graph16125206242216551232.weights' '-q' '0' '-e' '0.001'
[2023-03-18 23:26:10] [INFO ] Decomposing Gal with order
[2023-03-18 23:26:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 23:26:11] [INFO ] Removed a total of 1595 redundant transitions.
[2023-03-18 23:26:11] [INFO ] Flatten gal took : 118 ms
[2023-03-18 23:26:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 1544 labels/synchronizations in 22 ms.
[2023-03-18 23:26:11] [INFO ] Time to serialize gal into /tmp/LTL14051654491786799011.gal : 18 ms
[2023-03-18 23:26:11] [INFO ] Time to serialize properties into /tmp/LTL9527912331716726676.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/LTL14051654491786799011.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9527912331716726676.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(G("(i37.i1.i0.u762.p2116==0)"))))
Formula 0 simplified : GF!"(i37.i1.i0.u762.p2116==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15369877326797082718
[2023-03-18 23:26:26] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15369877326797082718
Running compilation step : cd /tmp/ltsmin15369877326797082718;'/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/ltsmin15369877326797082718;'/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/ltsmin15369877326797082718;'/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 ShieldIIPs-PT-100A-LTLFireability-13 finished in 91610 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' '!((!p0 U (G(!p0)||(!p0&&(p1||X(!p2))))))'
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 87 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-18 23:26:29] [INFO ] Computed 901 place invariants in 14 ms
[2023-03-18 23:26:31] [INFO ] Implicit Places using invariants in 1626 ms returned []
[2023-03-18 23:26:31] [INFO ] Invariant cache hit.
[2023-03-18 23:26:36] [INFO ] Implicit Places using invariants and state equation in 4824 ms returned []
Implicit Place search using SMT with State Equation took 6452 ms to find 0 implicit places.
[2023-03-18 23:26:36] [INFO ] Invariant cache hit.
[2023-03-18 23:26:38] [INFO ] Dead Transitions using invariants and state equation in 2426 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8977 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, p0, (AND p0 p2)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1083 1) (EQ s1097 1)), p1:(AND (EQ s1322 1) (EQ s75 1)), p2:(AND (EQ s1906 1) (EQ s1916 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 7566 ms.
Product exploration explored 100000 steps with 50000 reset in 7684 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), true, (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p1) (NOT p2))
Knowledge based reduction with 6 factoid took 283 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-100A-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-100A-LTLFireability-14 finished in 24722 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 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 102 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-18 23:26:54] [INFO ] Invariant cache hit.
[2023-03-18 23:26:56] [INFO ] Implicit Places using invariants in 1932 ms returned []
[2023-03-18 23:26:56] [INFO ] Invariant cache hit.
[2023-03-18 23:26:58] [INFO ] Implicit Places using invariants and state equation in 2137 ms returned []
Implicit Place search using SMT with State Equation took 4092 ms to find 0 implicit places.
[2023-03-18 23:26:58] [INFO ] Invariant cache hit.
[2023-03-18 23:27:00] [INFO ] Dead Transitions using invariants and state equation in 2392 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6607 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (EQ s2007 0) (EQ s2009 0)) (OR (EQ s1661 0) (EQ s1665 0) (EQ s1676 0)))], 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 1020 steps with 0 reset in 42 ms.
FORMULA ShieldIIPs-PT-100A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLFireability-15 finished in 6766 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&&X(p1)))))'
Found a Shortening insensitive property : ShieldIIPs-PT-100A-LTLFireability-01
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2502 transition count 2401
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2500 transition count 2401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 2499 transition count 2400
Applied a total of 5 rules in 223 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-18 23:27:01] [INFO ] Computed 900 place invariants in 19 ms
[2023-03-18 23:27:03] [INFO ] Implicit Places using invariants in 2297 ms returned []
[2023-03-18 23:27:03] [INFO ] Invariant cache hit.
[2023-03-18 23:27:05] [INFO ] Implicit Places using invariants and state equation in 1833 ms returned []
Implicit Place search using SMT with State Equation took 4132 ms to find 0 implicit places.
[2023-03-18 23:27:05] [INFO ] Invariant cache hit.
[2023-03-18 23:27:08] [INFO ] Dead Transitions using invariants and state equation in 2403 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2499/2503 places, 2400/2403 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6775 ms. Remains : 2499/2503 places, 2400/2403 transitions.
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s2149 0), p1:(OR (EQ s935 0) (EQ s939 0) (EQ s950 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33266 reset in 2834 ms.
Product exploration explored 100000 steps with 33395 reset in 2961 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 494 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 23:27:15] [INFO ] Invariant cache hit.
[2023-03-18 23:27:15] [INFO ] [Real]Absence check using 900 positive place invariants in 200 ms returned sat
[2023-03-18 23:27:17] [INFO ] After 2508ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 23:27:18] [INFO ] [Nat]Absence check using 900 positive place invariants in 221 ms returned sat
[2023-03-18 23:27:20] [INFO ] After 1837ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 23:27:20] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 0 ms to minimize.
[2023-03-18 23:27:20] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 0 ms to minimize.
[2023-03-18 23:27:21] [INFO ] Deduced a trap composed of 20 places in 227 ms of which 1 ms to minimize.
[2023-03-18 23:27:21] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 0 ms to minimize.
[2023-03-18 23:27:21] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2023-03-18 23:27:22] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 0 ms to minimize.
[2023-03-18 23:27:22] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 1 ms to minimize.
[2023-03-18 23:27:22] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 1 ms to minimize.
[2023-03-18 23:27:22] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 1 ms to minimize.
[2023-03-18 23:27:23] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 1 ms to minimize.
[2023-03-18 23:27:23] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2680 ms
[2023-03-18 23:27:23] [INFO ] After 4843ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 281 ms.
[2023-03-18 23:27:23] [INFO ] After 6027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 185 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Partial Free-agglomeration rule applied 595 times.
Drop transitions removed 595 transitions
Iterating global reduction 0 with 595 rules applied. Total rules applied 595 place count 2499 transition count 2400
Applied a total of 595 rules in 147 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 113294 steps, run timeout after 3036 ms. (steps per millisecond=37 ) properties seen :{1=1}
Probabilistic random walk after 113294 steps, saw 111770 distinct states, run finished after 3036 ms. (steps per millisecond=37 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-18 23:27:27] [INFO ] Computed 900 place invariants in 14 ms
[2023-03-18 23:27:28] [INFO ] [Real]Absence check using 900 positive place invariants in 285 ms returned sat
[2023-03-18 23:27:30] [INFO ] After 2500ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:27:30] [INFO ] [Nat]Absence check using 900 positive place invariants in 208 ms returned sat
[2023-03-18 23:27:32] [INFO ] After 1554ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:27:32] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 0 ms to minimize.
[2023-03-18 23:27:33] [INFO ] Deduced a trap composed of 15 places in 277 ms of which 1 ms to minimize.
[2023-03-18 23:27:33] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 1 ms to minimize.
[2023-03-18 23:27:33] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 1 ms to minimize.
[2023-03-18 23:27:34] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 0 ms to minimize.
[2023-03-18 23:27:34] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 1 ms to minimize.
[2023-03-18 23:27:34] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 0 ms to minimize.
[2023-03-18 23:27:34] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 0 ms to minimize.
[2023-03-18 23:27:35] [INFO ] Deduced a trap composed of 17 places in 228 ms of which 0 ms to minimize.
[2023-03-18 23:27:35] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 0 ms to minimize.
[2023-03-18 23:27:35] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 0 ms to minimize.
[2023-03-18 23:27:36] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 0 ms to minimize.
[2023-03-18 23:27:36] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 0 ms to minimize.
[2023-03-18 23:27:36] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2023-03-18 23:27:36] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 1 ms to minimize.
[2023-03-18 23:27:36] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4283 ms
[2023-03-18 23:27:36] [INFO ] After 5955ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 148 ms.
[2023-03-18 23:27:37] [INFO ] After 6895ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 57 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 77 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 132576 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 132576 steps, saw 130871 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 23:27:40] [INFO ] Invariant cache hit.
[2023-03-18 23:27:41] [INFO ] [Real]Absence check using 900 positive place invariants in 249 ms returned sat
[2023-03-18 23:27:42] [INFO ] After 2255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:27:43] [INFO ] [Nat]Absence check using 900 positive place invariants in 218 ms returned sat
[2023-03-18 23:27:45] [INFO ] After 1705ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:27:45] [INFO ] Deduced a trap composed of 8 places in 251 ms of which 1 ms to minimize.
[2023-03-18 23:27:46] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 0 ms to minimize.
[2023-03-18 23:27:46] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 1 ms to minimize.
[2023-03-18 23:27:46] [INFO ] Deduced a trap composed of 19 places in 241 ms of which 1 ms to minimize.
[2023-03-18 23:27:47] [INFO ] Deduced a trap composed of 29 places in 265 ms of which 0 ms to minimize.
[2023-03-18 23:27:47] [INFO ] Deduced a trap composed of 17 places in 268 ms of which 1 ms to minimize.
[2023-03-18 23:27:47] [INFO ] Deduced a trap composed of 14 places in 242 ms of which 0 ms to minimize.
[2023-03-18 23:27:48] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 0 ms to minimize.
[2023-03-18 23:27:48] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 0 ms to minimize.
[2023-03-18 23:27:48] [INFO ] Deduced a trap composed of 14 places in 296 ms of which 1 ms to minimize.
[2023-03-18 23:27:49] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 1 ms to minimize.
[2023-03-18 23:27:49] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 0 ms to minimize.
[2023-03-18 23:27:49] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 3 ms to minimize.
[2023-03-18 23:27:50] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 1 ms to minimize.
[2023-03-18 23:27:50] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 1 ms to minimize.
[2023-03-18 23:27:50] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 1 ms to minimize.
[2023-03-18 23:27:50] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 1 ms to minimize.
[2023-03-18 23:27:51] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 0 ms to minimize.
[2023-03-18 23:27:51] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 0 ms to minimize.
[2023-03-18 23:27:51] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 3 ms to minimize.
[2023-03-18 23:27:51] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 6414 ms
[2023-03-18 23:27:51] [INFO ] After 8271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 150 ms.
[2023-03-18 23:27:52] [INFO ] After 9122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 166 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 106 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 76 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2023-03-18 23:27:52] [INFO ] Invariant cache hit.
[2023-03-18 23:27:54] [INFO ] Implicit Places using invariants in 2261 ms returned []
[2023-03-18 23:27:54] [INFO ] Invariant cache hit.
[2023-03-18 23:27:56] [INFO ] Implicit Places using invariants and state equation in 2129 ms returned []
Implicit Place search using SMT with State Equation took 4409 ms to find 0 implicit places.
[2023-03-18 23:27:56] [INFO ] Redundant transitions in 117 ms returned []
[2023-03-18 23:27:56] [INFO ] Invariant cache hit.
[2023-03-18 23:27:59] [INFO ] Dead Transitions using invariants and state equation in 2587 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7208 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 77 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 23:27:59] [INFO ] Invariant cache hit.
[2023-03-18 23:28:00] [INFO ] [Real]Absence check using 900 positive place invariants in 207 ms returned sat
[2023-03-18 23:28:02] [INFO ] After 2470ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:28:02] [INFO ] [Nat]Absence check using 900 positive place invariants in 182 ms returned sat
[2023-03-18 23:28:04] [INFO ] After 1534ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:28:04] [INFO ] Deduced a trap composed of 8 places in 281 ms of which 2 ms to minimize.
[2023-03-18 23:28:05] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 0 ms to minimize.
[2023-03-18 23:28:05] [INFO ] Deduced a trap composed of 17 places in 238 ms of which 1 ms to minimize.
[2023-03-18 23:28:05] [INFO ] Deduced a trap composed of 19 places in 365 ms of which 0 ms to minimize.
[2023-03-18 23:28:06] [INFO ] Deduced a trap composed of 29 places in 195 ms of which 0 ms to minimize.
[2023-03-18 23:28:06] [INFO ] Deduced a trap composed of 17 places in 223 ms of which 1 ms to minimize.
[2023-03-18 23:28:06] [INFO ] Deduced a trap composed of 14 places in 209 ms of which 1 ms to minimize.
[2023-03-18 23:28:07] [INFO ] Deduced a trap composed of 8 places in 194 ms of which 1 ms to minimize.
[2023-03-18 23:28:07] [INFO ] Deduced a trap composed of 17 places in 342 ms of which 0 ms to minimize.
[2023-03-18 23:28:07] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 0 ms to minimize.
[2023-03-18 23:28:08] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 1 ms to minimize.
[2023-03-18 23:28:08] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 1 ms to minimize.
[2023-03-18 23:28:08] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 0 ms to minimize.
[2023-03-18 23:28:09] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 1 ms to minimize.
[2023-03-18 23:28:09] [INFO ] Deduced a trap composed of 22 places in 295 ms of which 1 ms to minimize.
[2023-03-18 23:28:09] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 0 ms to minimize.
[2023-03-18 23:28:09] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
[2023-03-18 23:28:10] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 0 ms to minimize.
[2023-03-18 23:28:10] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2023-03-18 23:28:10] [INFO ] Deduced a trap composed of 8 places in 259 ms of which 1 ms to minimize.
[2023-03-18 23:28:11] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 6767 ms
[2023-03-18 23:28:11] [INFO ] After 8389ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-18 23:28:11] [INFO ] After 9166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 608 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 104 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-18 23:28:12] [INFO ] Computed 900 place invariants in 10 ms
[2023-03-18 23:28:14] [INFO ] Implicit Places using invariants in 2282 ms returned []
[2023-03-18 23:28:14] [INFO ] Invariant cache hit.
[2023-03-18 23:28:17] [INFO ] Implicit Places using invariants and state equation in 2321 ms returned []
Implicit Place search using SMT with State Equation took 4617 ms to find 0 implicit places.
[2023-03-18 23:28:17] [INFO ] Invariant cache hit.
[2023-03-18 23:28:19] [INFO ] Dead Transitions using invariants and state equation in 2193 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6917 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 335 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 23:28:20] [INFO ] Invariant cache hit.
[2023-03-18 23:28:21] [INFO ] [Real]Absence check using 900 positive place invariants in 224 ms returned sat
[2023-03-18 23:28:23] [INFO ] After 2617ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 23:28:23] [INFO ] [Nat]Absence check using 900 positive place invariants in 222 ms returned sat
[2023-03-18 23:28:26] [INFO ] After 2146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 23:28:26] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 1 ms to minimize.
[2023-03-18 23:28:26] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 0 ms to minimize.
[2023-03-18 23:28:27] [INFO ] Deduced a trap composed of 20 places in 253 ms of which 1 ms to minimize.
[2023-03-18 23:28:27] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2023-03-18 23:28:27] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 1 ms to minimize.
[2023-03-18 23:28:27] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 1 ms to minimize.
[2023-03-18 23:28:28] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 0 ms to minimize.
[2023-03-18 23:28:28] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 0 ms to minimize.
[2023-03-18 23:28:28] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 1 ms to minimize.
[2023-03-18 23:28:28] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 0 ms to minimize.
[2023-03-18 23:28:29] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2894 ms
[2023-03-18 23:28:29] [INFO ] After 5322ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 334 ms.
[2023-03-18 23:28:29] [INFO ] After 6581ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 330 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Partial Free-agglomeration rule applied 595 times.
Drop transitions removed 595 transitions
Iterating global reduction 0 with 595 rules applied. Total rules applied 595 place count 2499 transition count 2400
Applied a total of 595 rules in 159 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 102768 steps, run timeout after 3002 ms. (steps per millisecond=34 ) properties seen :{1=1}
Probabilistic random walk after 102768 steps, saw 101339 distinct states, run finished after 3002 ms. (steps per millisecond=34 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-18 23:28:33] [INFO ] Computed 900 place invariants in 15 ms
[2023-03-18 23:28:34] [INFO ] [Real]Absence check using 900 positive place invariants in 218 ms returned sat
[2023-03-18 23:28:36] [INFO ] After 2485ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:28:36] [INFO ] [Nat]Absence check using 900 positive place invariants in 175 ms returned sat
[2023-03-18 23:28:38] [INFO ] After 1461ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:28:38] [INFO ] Deduced a trap composed of 17 places in 267 ms of which 3 ms to minimize.
[2023-03-18 23:28:39] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 0 ms to minimize.
[2023-03-18 23:28:39] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 1 ms to minimize.
[2023-03-18 23:28:39] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 1 ms to minimize.
[2023-03-18 23:28:39] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 0 ms to minimize.
[2023-03-18 23:28:40] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 1 ms to minimize.
[2023-03-18 23:28:40] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 1 ms to minimize.
[2023-03-18 23:28:40] [INFO ] Deduced a trap composed of 9 places in 279 ms of which 1 ms to minimize.
[2023-03-18 23:28:41] [INFO ] Deduced a trap composed of 17 places in 241 ms of which 0 ms to minimize.
[2023-03-18 23:28:41] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 0 ms to minimize.
[2023-03-18 23:28:41] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 1 ms to minimize.
[2023-03-18 23:28:42] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 0 ms to minimize.
[2023-03-18 23:28:42] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 0 ms to minimize.
[2023-03-18 23:28:42] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2023-03-18 23:28:42] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 1 ms to minimize.
[2023-03-18 23:28:42] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4412 ms
[2023-03-18 23:28:42] [INFO ] After 5985ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-18 23:28:43] [INFO ] After 6774ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 39 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 75 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 133240 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133240 steps, saw 131529 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 23:28:46] [INFO ] Invariant cache hit.
[2023-03-18 23:28:47] [INFO ] [Real]Absence check using 900 positive place invariants in 176 ms returned sat
[2023-03-18 23:28:48] [INFO ] After 2091ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:28:49] [INFO ] [Nat]Absence check using 900 positive place invariants in 400 ms returned sat
[2023-03-18 23:28:51] [INFO ] After 1768ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:28:51] [INFO ] Deduced a trap composed of 8 places in 272 ms of which 0 ms to minimize.
[2023-03-18 23:28:51] [INFO ] Deduced a trap composed of 23 places in 217 ms of which 1 ms to minimize.
[2023-03-18 23:28:52] [INFO ] Deduced a trap composed of 17 places in 350 ms of which 0 ms to minimize.
[2023-03-18 23:28:52] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 1 ms to minimize.
[2023-03-18 23:28:53] [INFO ] Deduced a trap composed of 29 places in 268 ms of which 1 ms to minimize.
[2023-03-18 23:28:53] [INFO ] Deduced a trap composed of 17 places in 314 ms of which 0 ms to minimize.
[2023-03-18 23:28:53] [INFO ] Deduced a trap composed of 14 places in 284 ms of which 1 ms to minimize.
[2023-03-18 23:28:54] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 0 ms to minimize.
[2023-03-18 23:28:54] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 0 ms to minimize.
[2023-03-18 23:28:54] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 0 ms to minimize.
[2023-03-18 23:28:54] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 1 ms to minimize.
[2023-03-18 23:28:55] [INFO ] Deduced a trap composed of 25 places in 353 ms of which 1 ms to minimize.
[2023-03-18 23:28:55] [INFO ] Deduced a trap composed of 23 places in 306 ms of which 1 ms to minimize.
[2023-03-18 23:28:56] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 0 ms to minimize.
[2023-03-18 23:28:56] [INFO ] Deduced a trap composed of 22 places in 295 ms of which 1 ms to minimize.
[2023-03-18 23:28:56] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 0 ms to minimize.
[2023-03-18 23:28:56] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 1 ms to minimize.
[2023-03-18 23:28:57] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 0 ms to minimize.
[2023-03-18 23:28:57] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2023-03-18 23:28:57] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2023-03-18 23:28:57] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 6471 ms
[2023-03-18 23:28:57] [INFO ] After 8366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 148 ms.
[2023-03-18 23:28:58] [INFO ] After 9352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 85 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 73 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 119 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2023-03-18 23:28:58] [INFO ] Invariant cache hit.
[2023-03-18 23:29:00] [INFO ] Implicit Places using invariants in 1837 ms returned []
[2023-03-18 23:29:00] [INFO ] Invariant cache hit.
[2023-03-18 23:29:05] [INFO ] Implicit Places using invariants and state equation in 5118 ms returned []
Implicit Place search using SMT with State Equation took 6981 ms to find 0 implicit places.
[2023-03-18 23:29:05] [INFO ] Redundant transitions in 131 ms returned []
[2023-03-18 23:29:05] [INFO ] Invariant cache hit.
[2023-03-18 23:29:07] [INFO ] Dead Transitions using invariants and state equation in 2025 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9268 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 91 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 23:29:07] [INFO ] Invariant cache hit.
[2023-03-18 23:29:08] [INFO ] [Real]Absence check using 900 positive place invariants in 203 ms returned sat
[2023-03-18 23:29:10] [INFO ] After 2566ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:29:10] [INFO ] [Nat]Absence check using 900 positive place invariants in 222 ms returned sat
[2023-03-18 23:29:13] [INFO ] After 2134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:29:13] [INFO ] Deduced a trap composed of 8 places in 259 ms of which 1 ms to minimize.
[2023-03-18 23:29:13] [INFO ] Deduced a trap composed of 23 places in 205 ms of which 0 ms to minimize.
[2023-03-18 23:29:14] [INFO ] Deduced a trap composed of 17 places in 240 ms of which 0 ms to minimize.
[2023-03-18 23:29:14] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 0 ms to minimize.
[2023-03-18 23:29:14] [INFO ] Deduced a trap composed of 29 places in 308 ms of which 1 ms to minimize.
[2023-03-18 23:29:15] [INFO ] Deduced a trap composed of 17 places in 256 ms of which 0 ms to minimize.
[2023-03-18 23:29:15] [INFO ] Deduced a trap composed of 14 places in 216 ms of which 1 ms to minimize.
[2023-03-18 23:29:15] [INFO ] Deduced a trap composed of 8 places in 272 ms of which 0 ms to minimize.
[2023-03-18 23:29:16] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 0 ms to minimize.
[2023-03-18 23:29:16] [INFO ] Deduced a trap composed of 14 places in 260 ms of which 0 ms to minimize.
[2023-03-18 23:29:16] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 0 ms to minimize.
[2023-03-18 23:29:17] [INFO ] Deduced a trap composed of 25 places in 228 ms of which 0 ms to minimize.
[2023-03-18 23:29:17] [INFO ] Deduced a trap composed of 23 places in 259 ms of which 0 ms to minimize.
[2023-03-18 23:29:17] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 1 ms to minimize.
[2023-03-18 23:29:18] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 1 ms to minimize.
[2023-03-18 23:29:18] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 0 ms to minimize.
[2023-03-18 23:29:18] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 1 ms to minimize.
[2023-03-18 23:29:19] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 1 ms to minimize.
[2023-03-18 23:29:19] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 0 ms to minimize.
[2023-03-18 23:29:19] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2023-03-18 23:29:19] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 6412 ms
[2023-03-18 23:29:19] [INFO ] After 8625ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-03-18 23:29:19] [INFO ] After 9536ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 453 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33269 reset in 2801 ms.
Product exploration explored 100000 steps with 33383 reset in 2861 ms.
Built C files in :
/tmp/ltsmin5331290511733663534
[2023-03-18 23:29:26] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5331290511733663534
Running compilation step : cd /tmp/ltsmin5331290511733663534;'/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/ltsmin5331290511733663534;'/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/ltsmin5331290511733663534;'/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 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 82 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-18 23:29:29] [INFO ] Computed 900 place invariants in 6 ms
[2023-03-18 23:29:31] [INFO ] Implicit Places using invariants in 1410 ms returned []
[2023-03-18 23:29:31] [INFO ] Invariant cache hit.
[2023-03-18 23:29:35] [INFO ] Implicit Places using invariants and state equation in 4571 ms returned []
Implicit Place search using SMT with State Equation took 6015 ms to find 0 implicit places.
[2023-03-18 23:29:35] [INFO ] Invariant cache hit.
[2023-03-18 23:29:37] [INFO ] Dead Transitions using invariants and state equation in 1717 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7815 ms. Remains : 2499/2499 places, 2400/2400 transitions.
Built C files in :
/tmp/ltsmin12204999974161644212
[2023-03-18 23:29:37] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12204999974161644212
Running compilation step : cd /tmp/ltsmin12204999974161644212;'/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/ltsmin12204999974161644212;'/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/ltsmin12204999974161644212;'/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-18 23:29:40] [INFO ] Flatten gal took : 76 ms
[2023-03-18 23:29:40] [INFO ] Flatten gal took : 133 ms
[2023-03-18 23:29:40] [INFO ] Time to serialize gal into /tmp/LTL9851998995209068145.gal : 10 ms
[2023-03-18 23:29:40] [INFO ] Time to serialize properties into /tmp/LTL11418746678762721569.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/LTL9851998995209068145.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6506268819183332226.hoa' '-atoms' '/tmp/LTL11418746678762721569.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/LTL11418746678762721569.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6506268819183332226.hoa
Detected timeout of ITS tools.
[2023-03-18 23:29:56] [INFO ] Flatten gal took : 78 ms
[2023-03-18 23:29:56] [INFO ] Flatten gal took : 79 ms
[2023-03-18 23:29:56] [INFO ] Time to serialize gal into /tmp/LTL2074169070377913326.gal : 11 ms
[2023-03-18 23:29:56] [INFO ] Time to serialize properties into /tmp/LTL5231794073382818522.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/LTL2074169070377913326.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5231794073382818522.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 : !((G(F(("(p2150==0)")&&(X("(((p936==0)||(p940==0))||(p951==0))"))))))
Formula 0 simplified : FG(!"(p2150==0)" | X!"(((p936==0)||(p940==0))||(p951==0))")
Detected timeout of ITS tools.
[2023-03-18 23:30:11] [INFO ] Flatten gal took : 76 ms
[2023-03-18 23:30:11] [INFO ] Applying decomposition
[2023-03-18 23:30:11] [INFO ] Flatten gal took : 201 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/graph6113683242134036420.txt' '-o' '/tmp/graph6113683242134036420.bin' '-w' '/tmp/graph6113683242134036420.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6113683242134036420.bin' '-l' '-1' '-v' '-w' '/tmp/graph6113683242134036420.weights' '-q' '0' '-e' '0.001'
[2023-03-18 23:30:11] [INFO ] Decomposing Gal with order
[2023-03-18 23:30:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 23:30:12] [INFO ] Removed a total of 1597 redundant transitions.
[2023-03-18 23:30:12] [INFO ] Flatten gal took : 129 ms
[2023-03-18 23:30:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 1564 labels/synchronizations in 22 ms.
[2023-03-18 23:30:12] [INFO ] Time to serialize gal into /tmp/LTL5020284955406709968.gal : 16 ms
[2023-03-18 23:30:12] [INFO ] Time to serialize properties into /tmp/LTL15144089317592514494.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/LTL5020284955406709968.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15144089317592514494.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 : !((G(F(("(i39.i1.i1.u774.p2150==0)")&&(X("(((i17.i0.i1.u337.p936==0)||(i17.i0.i1.u339.p940==0))||(i17.i0.i0.u342.p951==0))"))))))
Formula 0 simplified : FG(!"(i39.i1.i1.u774.p2150==0)" | X!"(((i17.i0.i1.u337.p936==0)||(i17.i0.i1.u339.p940==0))||(i17.i0.i0.u342.p951==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9787249670878849066
[2023-03-18 23:30:27] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9787249670878849066
Running compilation step : cd /tmp/ltsmin9787249670878849066;'/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/ltsmin9787249670878849066;'/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/ltsmin9787249670878849066;'/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 ShieldIIPs-PT-100A-LTLFireability-01 finished in 209267 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)))))'
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)||(!p0&&G(F((!p1 U (G(!p1)||(!p1&&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' '!(X((G(p0)||F(G((p1||F(p2)))))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-100A-LTLFireability-07
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 25 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 264 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-18 23:30:31] [INFO ] Computed 901 place invariants in 10 ms
[2023-03-18 23:30:32] [INFO ] Implicit Places using invariants in 1657 ms returned []
[2023-03-18 23:30:32] [INFO ] Invariant cache hit.
[2023-03-18 23:30:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 23:30:39] [INFO ] Implicit Places using invariants and state equation in 6290 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 7951 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2500/2503 places, 2401/2403 transitions.
Applied a total of 0 rules in 98 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 8313 ms. Remains : 2500/2503 places, 2401/2403 transitions.
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(AND (EQ s1482 1) (EQ s1484 1) (EQ s153 1) (EQ s174 1)), p1:(AND (EQ s1482 1) (EQ s1484 1)), p2:(EQ s772 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 30 reset in 1945 ms.
Product exploration explored 100000 steps with 30 reset in 2245 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 396 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 1944 steps, including 0 resets, run visited all 2 properties in 81 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 8 factoid took 387 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-18 23:30:44] [INFO ] Computed 900 place invariants in 10 ms
[2023-03-18 23:30:48] [INFO ] [Real]Absence check using 900 positive place invariants in 1054 ms returned sat
[2023-03-18 23:30:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:30:59] [INFO ] [Real]Absence check using state equation in 11091 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 3 out of 2500 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 113 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-18 23:31:00] [INFO ] Invariant cache hit.
[2023-03-18 23:31:02] [INFO ] Implicit Places using invariants in 2301 ms returned []
[2023-03-18 23:31:02] [INFO ] Invariant cache hit.
[2023-03-18 23:31:07] [INFO ] Implicit Places using invariants and state equation in 4816 ms returned []
Implicit Place search using SMT with State Equation took 7143 ms to find 0 implicit places.
[2023-03-18 23:31:07] [INFO ] Redundant transitions in 380 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2500 cols
[2023-03-18 23:31:07] [INFO ] Computed 900 place invariants in 5 ms
[2023-03-18 23:31:10] [INFO ] Dead Transitions using invariants and state equation in 2922 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2500 places, 2400/2401 transitions.
Applied a total of 0 rules in 111 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10695 ms. Remains : 2500/2500 places, 2400/2401 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 407 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 1978 steps, including 0 resets, run visited all 2 properties in 96 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 314 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-18 23:31:12] [INFO ] Invariant cache hit.
[2023-03-18 23:31:16] [INFO ] [Real]Absence check using 900 positive place invariants in 1053 ms returned sat
[2023-03-18 23:31:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:31:27] [INFO ] [Real]Absence check using state equation in 10956 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 30 reset in 2214 ms.
Product exploration explored 100000 steps with 30 reset in 2383 ms.
Built C files in :
/tmp/ltsmin7178594187245460516
[2023-03-18 23:31:32] [INFO ] Too many transitions (2400) to apply POR reductions. Disabling POR matrices.
[2023-03-18 23:31:32] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7178594187245460516
Running compilation step : cd /tmp/ltsmin7178594187245460516;'/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/ltsmin7178594187245460516;'/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/ltsmin7178594187245460516;'/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 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 143 ms. Remains 2499 /2500 variables (removed 1) and now considering 2399/2400 (removed 1) transitions.
// Phase 1: matrix 2399 rows 2499 cols
[2023-03-18 23:31:35] [INFO ] Computed 900 place invariants in 10 ms
[2023-03-18 23:31:37] [INFO ] Implicit Places using invariants in 2155 ms returned []
[2023-03-18 23:31:37] [INFO ] Invariant cache hit.
[2023-03-18 23:31:39] [INFO ] Implicit Places using invariants and state equation in 2470 ms returned []
Implicit Place search using SMT with State Equation took 4640 ms to find 0 implicit places.
[2023-03-18 23:31:40] [INFO ] Redundant transitions in 365 ms returned []
[2023-03-18 23:31:40] [INFO ] Invariant cache hit.
[2023-03-18 23:31:42] [INFO ] Dead Transitions using invariants and state equation in 2101 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7257 ms. Remains : 2499/2500 places, 2399/2400 transitions.
Built C files in :
/tmp/ltsmin8450435415078882050
[2023-03-18 23:31:42] [INFO ] Too many transitions (2399) to apply POR reductions. Disabling POR matrices.
[2023-03-18 23:31:42] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8450435415078882050
Running compilation step : cd /tmp/ltsmin8450435415078882050;'/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/ltsmin8450435415078882050;'/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/ltsmin8450435415078882050;'/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-18 23:31:45] [INFO ] Flatten gal took : 84 ms
[2023-03-18 23:31:45] [INFO ] Flatten gal took : 92 ms
[2023-03-18 23:31:45] [INFO ] Time to serialize gal into /tmp/LTL5934690056304062444.gal : 11 ms
[2023-03-18 23:31:45] [INFO ] Time to serialize properties into /tmp/LTL16034479207858105526.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/LTL5934690056304062444.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1128727709517563112.hoa' '-atoms' '/tmp/LTL16034479207858105526.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/LTL16034479207858105526.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1128727709517563112.hoa
Detected timeout of ITS tools.
[2023-03-18 23:32:00] [INFO ] Flatten gal took : 127 ms
[2023-03-18 23:32:01] [INFO ] Flatten gal took : 126 ms
[2023-03-18 23:32:01] [INFO ] Time to serialize gal into /tmp/LTL15058365433413403493.gal : 12 ms
[2023-03-18 23:32:01] [INFO ] Time to serialize properties into /tmp/LTL5761103960650799611.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/LTL15058365433413403493.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5761103960650799611.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("(((p1482==1)&&(p1484==1))&&((p153==1)&&(p174==1)))"))||(F(G(("((p1482==1)&&(p1484==1))")||(F("(p772==1)"))))))))
Formula 0 simplified : X(F!"(((p1482==1)&&(p1484==1))&&((p153==1)&&(p174==1)))" & G(F!"((p1482==1)&&(p1484==1))" & FG!"(p772==1)"))
Detected timeout of ITS tools.
[2023-03-18 23:32:16] [INFO ] Flatten gal took : 183 ms
[2023-03-18 23:32:16] [INFO ] Applying decomposition
[2023-03-18 23:32:16] [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/graph1373771903417180117.txt' '-o' '/tmp/graph1373771903417180117.bin' '-w' '/tmp/graph1373771903417180117.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1373771903417180117.bin' '-l' '-1' '-v' '-w' '/tmp/graph1373771903417180117.weights' '-q' '0' '-e' '0.001'
[2023-03-18 23:32:16] [INFO ] Decomposing Gal with order
[2023-03-18 23:32:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 23:32:17] [INFO ] Removed a total of 1595 redundant transitions.
[2023-03-18 23:32:17] [INFO ] Flatten gal took : 126 ms
[2023-03-18 23:32:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 1568 labels/synchronizations in 170 ms.
[2023-03-18 23:32:17] [INFO ] Time to serialize gal into /tmp/LTL13036144463146402523.gal : 26 ms
[2023-03-18 23:32:17] [INFO ] Time to serialize properties into /tmp/LTL2410918750860381367.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/LTL13036144463146402523.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2410918750860381367.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("(((i27.i0.i1.u533.p1482==1)&&(i27.i0.i2.u534.p1484==1))&&((i3.i0.i0.u55.p153==1)&&(i3.i0.i2.u63.p174==1)))"))||(F(G(("((i27.i...243
Formula 0 simplified : X(F!"(((i27.i0.i1.u533.p1482==1)&&(i27.i0.i2.u534.p1484==1))&&((i3.i0.i0.u55.p153==1)&&(i3.i0.i2.u63.p174==1)))" & G(F!"((i27.i0.i1....232
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin173252806314545111
[2023-03-18 23:32:32] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin173252806314545111
Running compilation step : cd /tmp/ltsmin173252806314545111;'/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/ltsmin173252806314545111;'/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/ltsmin173252806314545111;'/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 ShieldIIPs-PT-100A-LTLFireability-07 finished in 125033 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(X(G(p0)))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-100A-LTLFireability-09
Stuttering acceptance computed with spot in 324 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 221 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-18 23:32:36] [INFO ] Computed 901 place invariants in 12 ms
[2023-03-18 23:32:38] [INFO ] Implicit Places using invariants in 2361 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2365 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2500/2503 places, 2401/2403 transitions.
Applied a total of 0 rules in 112 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2698 ms. Remains : 2500/2503 places, 2401/2403 transitions.
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s738 0) (EQ s746 0) (EQ s750 0) (EQ s2408 0) (EQ s2423 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 19 reset in 1988 ms.
Product exploration explored 100000 steps with 19 reset in 2052 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 158 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 104367 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104367 steps, saw 97750 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-18 23:32:46] [INFO ] Computed 900 place invariants in 13 ms
[2023-03-18 23:32:47] [INFO ] [Real]Absence check using 900 positive place invariants in 208 ms returned sat
[2023-03-18 23:32:49] [INFO ] After 2753ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:32:50] [INFO ] [Nat]Absence check using 900 positive place invariants in 209 ms returned sat
[2023-03-18 23:32:57] [INFO ] After 6848ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:33:02] [INFO ] Deduced a trap composed of 11 places in 290 ms of which 0 ms to minimize.
[2023-03-18 23:33:08] [INFO ] Deduced a trap composed of 11 places in 252 ms of which 0 ms to minimize.
[2023-03-18 23:33:14] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 12295 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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:251)
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-18 23:33:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 23:33:14] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 275 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 0 with 696 rules applied. Total rules applied 696 place count 2500 transition count 2401
Applied a total of 696 rules in 221 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 146272 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 146272 steps, saw 144229 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-18 23:33:18] [INFO ] Computed 900 place invariants in 40 ms
[2023-03-18 23:33:19] [INFO ] [Real]Absence check using 897 positive place invariants in 392 ms returned sat
[2023-03-18 23:33:19] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 23:33:20] [INFO ] After 2459ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:33:21] [INFO ] [Nat]Absence check using 897 positive place invariants in 267 ms returned sat
[2023-03-18 23:33:21] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-18 23:33:32] [INFO ] After 11419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 126 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 73 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-18 23:33:32] [INFO ] Invariant cache hit.
[2023-03-18 23:33:34] [INFO ] Implicit Places using invariants in 2358 ms returned []
[2023-03-18 23:33:34] [INFO ] Invariant cache hit.
[2023-03-18 23:33:41] [INFO ] Implicit Places using invariants and state equation in 6616 ms returned []
Implicit Place search using SMT with State Equation took 8992 ms to find 0 implicit places.
[2023-03-18 23:33:41] [INFO ] Redundant transitions in 94 ms returned []
[2023-03-18 23:33:41] [INFO ] Invariant cache hit.
[2023-03-18 23:33:44] [INFO ] Dead Transitions using invariants and state equation in 2615 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11795 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 86 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 23:33:44] [INFO ] Invariant cache hit.
[2023-03-18 23:33:45] [INFO ] [Real]Absence check using 897 positive place invariants in 205 ms returned sat
[2023-03-18 23:33:45] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 13 ms returned sat
[2023-03-18 23:33:46] [INFO ] After 2526ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:33:47] [INFO ] [Nat]Absence check using 897 positive place invariants in 222 ms returned sat
[2023-03-18 23:33:47] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 9 ms returned sat
[2023-03-18 23:33:58] [INFO ] After 11365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 225 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 332 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 330 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 107 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-18 23:33:59] [INFO ] Computed 900 place invariants in 9 ms
[2023-03-18 23:34:01] [INFO ] Implicit Places using invariants in 1881 ms returned []
[2023-03-18 23:34:01] [INFO ] Invariant cache hit.
[2023-03-18 23:34:06] [INFO ] Implicit Places using invariants and state equation in 4862 ms returned []
Implicit Place search using SMT with State Equation took 6769 ms to find 0 implicit places.
[2023-03-18 23:34:06] [INFO ] Invariant cache hit.
[2023-03-18 23:34:09] [INFO ] Dead Transitions using invariants and state equation in 3133 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10010 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 212 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 100166 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100166 steps, saw 93696 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 23:34:13] [INFO ] Invariant cache hit.
[2023-03-18 23:34:13] [INFO ] [Real]Absence check using 900 positive place invariants in 199 ms returned sat
[2023-03-18 23:34:15] [INFO ] After 2488ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:34:16] [INFO ] [Nat]Absence check using 900 positive place invariants in 204 ms returned sat
[2023-03-18 23:34:24] [INFO ] After 8335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:34:25] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 0 ms to minimize.
[2023-03-18 23:34:26] [INFO ] Deduced a trap composed of 11 places in 274 ms of which 0 ms to minimize.
[2023-03-18 23:34:27] [INFO ] Deduced a trap composed of 11 places in 459 ms of which 0 ms to minimize.
[2023-03-18 23:34:27] [INFO ] Deduced a trap composed of 11 places in 202 ms of which 0 ms to minimize.
[2023-03-18 23:34:28] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 0 ms to minimize.
[2023-03-18 23:34:28] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 0 ms to minimize.
[2023-03-18 23:34:29] [INFO ] Deduced a trap composed of 11 places in 257 ms of which 1 ms to minimize.
[2023-03-18 23:34:29] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 1 ms to minimize.
[2023-03-18 23:34:30] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 0 ms to minimize.
[2023-03-18 23:34:31] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 1 ms to minimize.
[2023-03-18 23:34:31] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 1 ms to minimize.
[2023-03-18 23:34:32] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 1 ms to minimize.
[2023-03-18 23:34:32] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 0 ms to minimize.
[2023-03-18 23:34:33] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 0 ms to minimize.
[2023-03-18 23:34:38] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 0 ms to minimize.
[2023-03-18 23:34:40] [INFO ] Trap strengthening (SAT) tested/added 15/15 trap constraints in 15439 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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-18 23:34:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 23:34:40] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 229 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 696 times.
Drop transitions removed 696 transitions
Iterating global reduction 0 with 696 rules applied. Total rules applied 696 place count 2500 transition count 2401
Applied a total of 696 rules in 157 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 135371 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 135371 steps, saw 133438 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-18 23:34:44] [INFO ] Computed 900 place invariants in 39 ms
[2023-03-18 23:34:45] [INFO ] [Real]Absence check using 897 positive place invariants in 211 ms returned sat
[2023-03-18 23:34:45] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 23:34:47] [INFO ] After 2431ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:34:47] [INFO ] [Nat]Absence check using 897 positive place invariants in 196 ms returned sat
[2023-03-18 23:34:47] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 11 ms returned sat
[2023-03-18 23:34:58] [INFO ] After 11187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 182 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 79 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-18 23:34:58] [INFO ] Invariant cache hit.
[2023-03-18 23:35:00] [INFO ] Implicit Places using invariants in 1710 ms returned []
[2023-03-18 23:35:00] [INFO ] Invariant cache hit.
[2023-03-18 23:35:07] [INFO ] Implicit Places using invariants and state equation in 7645 ms returned []
Implicit Place search using SMT with State Equation took 9371 ms to find 0 implicit places.
[2023-03-18 23:35:07] [INFO ] Redundant transitions in 81 ms returned []
[2023-03-18 23:35:07] [INFO ] Invariant cache hit.
[2023-03-18 23:35:10] [INFO ] Dead Transitions using invariants and state equation in 2379 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11950 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 86 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 23:35:10] [INFO ] Invariant cache hit.
[2023-03-18 23:35:11] [INFO ] [Real]Absence check using 897 positive place invariants in 204 ms returned sat
[2023-03-18 23:35:11] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 23:35:12] [INFO ] After 2214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:35:13] [INFO ] [Nat]Absence check using 897 positive place invariants in 206 ms returned sat
[2023-03-18 23:35:13] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 23:35:23] [INFO ] After 11219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 289 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 268 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 19 reset in 2000 ms.
Product exploration explored 100000 steps with 19 reset in 2199 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 86 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-18 23:35:30] [INFO ] Redundant transitions in 600 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2500 cols
[2023-03-18 23:35:30] [INFO ] Computed 900 place invariants in 6 ms
[2023-03-18 23:35:31] [INFO ] Dead Transitions using invariants and state equation in 1521 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2500 places, 2400/2401 transitions.
Applied a total of 0 rules in 112 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2344 ms. Remains : 2500/2500 places, 2400/2401 transitions.
Built C files in :
/tmp/ltsmin11487167952932172126
[2023-03-18 23:35:31] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11487167952932172126
Running compilation step : cd /tmp/ltsmin11487167952932172126;'/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/ltsmin11487167952932172126;'/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/ltsmin11487167952932172126;'/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 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 106 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-18 23:35:34] [INFO ] Computed 900 place invariants in 11 ms
[2023-03-18 23:35:37] [INFO ] Implicit Places using invariants in 2441 ms returned []
[2023-03-18 23:35:37] [INFO ] Invariant cache hit.
[2023-03-18 23:35:42] [INFO ] Implicit Places using invariants and state equation in 5128 ms returned []
Implicit Place search using SMT with State Equation took 7595 ms to find 0 implicit places.
[2023-03-18 23:35:42] [INFO ] Invariant cache hit.
[2023-03-18 23:35:44] [INFO ] Dead Transitions using invariants and state equation in 1511 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9212 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Built C files in :
/tmp/ltsmin13391632787861083936
[2023-03-18 23:35:44] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13391632787861083936
Running compilation step : cd /tmp/ltsmin13391632787861083936;'/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/ltsmin13391632787861083936;'/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/ltsmin13391632787861083936;'/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-18 23:35:47] [INFO ] Flatten gal took : 122 ms
[2023-03-18 23:35:47] [INFO ] Flatten gal took : 197 ms
[2023-03-18 23:35:56] [INFO ] Time to serialize gal into /tmp/LTL9238105005671827479.gal : 8733 ms
[2023-03-18 23:35:56] [INFO ] Time to serialize properties into /tmp/LTL13042248111594529049.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/LTL9238105005671827479.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8617112889455229019.hoa' '-atoms' '/tmp/LTL13042248111594529049.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/LTL13042248111594529049.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8617112889455229019.hoa
Detected timeout of ITS tools.
[2023-03-18 23:36:11] [INFO ] Flatten gal took : 134 ms
[2023-03-18 23:36:11] [INFO ] Flatten gal took : 148 ms
[2023-03-18 23:36:11] [INFO ] Time to serialize gal into /tmp/LTL2971857868655862031.gal : 17 ms
[2023-03-18 23:36:11] [INFO ] Time to serialize properties into /tmp/LTL13721579112632491996.ltl : 149 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/LTL2971857868655862031.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13721579112632491996.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(X(X(G("((((p738==0)||(p746==0))||((p750==0)||(p2408==0)))||(p2423==0))"))))))
Formula 0 simplified : XXXF!"((((p738==0)||(p746==0))||((p750==0)||(p2408==0)))||(p2423==0))"
Detected timeout of ITS tools.
[2023-03-18 23:36:27] [INFO ] Flatten gal took : 129 ms
[2023-03-18 23:36:27] [INFO ] Applying decomposition
[2023-03-18 23:36:27] [INFO ] Flatten gal took : 152 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/graph6415123180640294601.txt' '-o' '/tmp/graph6415123180640294601.bin' '-w' '/tmp/graph6415123180640294601.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6415123180640294601.bin' '-l' '-1' '-v' '-w' '/tmp/graph6415123180640294601.weights' '-q' '0' '-e' '0.001'
[2023-03-18 23:36:27] [INFO ] Decomposing Gal with order
[2023-03-18 23:36:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 23:36:27] [INFO ] Removed a total of 1597 redundant transitions.
[2023-03-18 23:36:27] [INFO ] Flatten gal took : 182 ms
[2023-03-18 23:36:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 1524 labels/synchronizations in 179 ms.
[2023-03-18 23:36:28] [INFO ] Time to serialize gal into /tmp/LTL15545667926829048859.gal : 27 ms
[2023-03-18 23:36:28] [INFO ] Time to serialize properties into /tmp/LTL12937912830301063002.ltl : 2 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/LTL15545667926829048859.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12937912830301063002.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 : !((X(X(X(G("((((i13.i1.i1.u266.p738==0)||(i13.i1.i1.u269.p746==0))||((i13.i1.i1.u270.p750==0)||(i44.i0.i2.u867.p2408==0)))||(i44.i0.i2...178
Formula 0 simplified : XXXF!"((((i13.i1.i1.u266.p738==0)||(i13.i1.i1.u269.p746==0))||((i13.i1.i1.u270.p750==0)||(i44.i0.i2.u867.p2408==0)))||(i44.i0.i2.u87...168
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13510904646338826329
[2023-03-18 23:36:43] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13510904646338826329
Running compilation step : cd /tmp/ltsmin13510904646338826329;'/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/ltsmin13510904646338826329;'/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/ltsmin13510904646338826329;'/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 ShieldIIPs-PT-100A-LTLFireability-09 finished in 252046 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||F(p1)) U p2)||G(F(p3)))))'
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)))'
[2023-03-18 23:36:48] [INFO ] Flatten gal took : 204 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9258463649994783205
[2023-03-18 23:36:48] [INFO ] Too many transitions (2403) to apply POR reductions. Disabling POR matrices.
[2023-03-18 23:36:48] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9258463649994783205
Running compilation step : cd /tmp/ltsmin9258463649994783205;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '102' '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-18 23:36:48] [INFO ] Applying decomposition
[2023-03-18 23:36:48] [INFO ] Flatten gal took : 128 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/graph13829460434673354590.txt' '-o' '/tmp/graph13829460434673354590.bin' '-w' '/tmp/graph13829460434673354590.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13829460434673354590.bin' '-l' '-1' '-v' '-w' '/tmp/graph13829460434673354590.weights' '-q' '0' '-e' '0.001'
[2023-03-18 23:36:48] [INFO ] Decomposing Gal with order
[2023-03-18 23:36:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 23:36:48] [INFO ] Removed a total of 1600 redundant transitions.
[2023-03-18 23:36:48] [INFO ] Flatten gal took : 162 ms
[2023-03-18 23:36:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 1544 labels/synchronizations in 192 ms.
[2023-03-18 23:36:49] [INFO ] Time to serialize gal into /tmp/LTLFireability16669560575312133951.gal : 25 ms
[2023-03-18 23:36:49] [INFO ] Time to serialize properties into /tmp/LTLFireability1905878538838988062.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/LTLFireability16669560575312133951.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1905878538838988062.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 7 LTL properties
Checking formula 0 : !((G(F(("(i35.i1.i1.u774.p2150==0)")&&(X("(((i15.i1.i1.u337.p936==0)||(i15.i1.i1.u339.p940==0))||(i15.i1.i1.u342.p951==0))"))))))
Formula 0 simplified : FG(!"(i35.i1.i1.u774.p2150==0)" | X!"(((i15.i1.i1.u337.p936==0)||(i15.i1.i1.u339.p940==0))||(i15.i1.i1.u342.p951==0))")
Compilation finished in 5705 ms.
Running link step : cd /tmp/ltsmin9258463649994783205;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 94 ms.
Running LTSmin : cd /tmp/ltsmin9258463649994783205;'/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' '[](<>(((LTLAPp0==true)&&X((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin9258463649994783205;'/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' '[](<>(((LTLAPp0==true)&&X((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9258463649994783205;'/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))&&<>([]((LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin9258463649994783205;'/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))&&<>([]((LTLAPp3==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9258463649994783205;'/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' '<>(([](!(LTLAPp4==true))||(!(LTLAPp4==true)&&[](<>((!(LTLAPp5==true) U ([](!(LTLAPp5==true))||(!(LTLAPp5==true)&&[](!(LTLAPp4==true))))))))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 3454932 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16025056 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="ShieldIIPs-PT-100A"
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 ShieldIIPs-PT-100A, 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 r389-oct2-167903713200164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-100A.tgz
mv ShieldIIPs-PT-100A 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 ;