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 |
| 12528.340 | 3600000.00 | 10382150.00 | 23321.70 | FF?TF??FFFTTF?F? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r222-tall-165286024800164.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPs-PT-100A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286024800164
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.7K Apr 29 15:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 15:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 15:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 15:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 868K May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1652946096614
Running Version 202205111006
[2022-05-19 07:41:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 07:41:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 07:41:38] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2022-05-19 07:41:38] [INFO ] Transformed 2503 places.
[2022-05-19 07:41:38] [INFO ] Transformed 2403 transitions.
[2022-05-19 07:41:38] [INFO ] Found NUPN structural information;
[2022-05-19 07:41:38] [INFO ] Parsed PT model containing 2503 places and 2403 transitions in 364 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 4 formulas.
FORMULA ShieldIIPs-PT-100A-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 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 262 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:41:38] [INFO ] Computed 901 place invariants in 43 ms
[2022-05-19 07:41:40] [INFO ] Implicit Places using invariants in 1448 ms returned []
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:41:40] [INFO ] Computed 901 place invariants in 13 ms
[2022-05-19 07:41:41] [INFO ] Implicit Places using invariants and state equation in 1736 ms returned []
Implicit Place search using SMT with State Equation took 3214 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:41:41] [INFO ] Computed 901 place invariants in 9 ms
[2022-05-19 07:41:43] [INFO ] Dead Transitions using invariants and state equation in 1285 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2403/2403 transitions.
Support contains 66 out of 2503 places after structural reductions.
[2022-05-19 07:41:43] [INFO ] Flatten gal took : 380 ms
[2022-05-19 07:41:43] [INFO ] Flatten gal took : 198 ms
[2022-05-19 07:41:44] [INFO ] Input system was already deterministic with 2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 710 ms. (steps per millisecond=14 ) properties (out of 30) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 9) 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 9) 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 9) 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 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:41:46] [INFO ] Computed 901 place invariants in 9 ms
[2022-05-19 07:41:47] [INFO ] [Real]Absence check using 901 positive place invariants in 167 ms returned sat
[2022-05-19 07:41:47] [INFO ] After 1313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-19 07:41:48] [INFO ] [Nat]Absence check using 901 positive place invariants in 166 ms returned sat
[2022-05-19 07:42:12] [INFO ] After 23794ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-19 07:42:12] [INFO ] After 23804ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-19 07:42:12] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 2653 ms.
Support contains 25 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 11 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 686 times.
Drop transitions removed 686 transitions
Iterating global reduction 0 with 686 rules applied. Total rules applied 690 place count 2501 transition count 2401
Applied a total of 690 rules in 520 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 467 ms. (steps per millisecond=21 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:42:17] [INFO ] Computed 901 place invariants in 120 ms
[2022-05-19 07:42:18] [INFO ] [Real]Absence check using 893 positive place invariants in 164 ms returned sat
[2022-05-19 07:42:18] [INFO ] [Real]Absence check using 893 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-19 07:42:20] [INFO ] After 3128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-19 07:42:21] [INFO ] [Nat]Absence check using 893 positive place invariants in 157 ms returned sat
[2022-05-19 07:42:21] [INFO ] [Nat]Absence check using 893 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-19 07:42:45] [INFO ] After 23962ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-19 07:42:45] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:42:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 07:42:45] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 581 ms.
Support contains 22 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 202 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 85923 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{0=1, 1=1, 4=1, 5=1, 6=1, 7=1}
Probabilistic random walk after 85923 steps, saw 84502 distinct states, run finished after 3002 ms. (steps per millisecond=28 ) properties seen :6
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:42:51] [INFO ] Computed 901 place invariants in 29 ms
[2022-05-19 07:42:51] [INFO ] [Real]Absence check using 895 positive place invariants in 169 ms returned sat
[2022-05-19 07:42:51] [INFO ] [Real]Absence check using 895 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-19 07:42:53] [INFO ] After 2071ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 07:42:53] [INFO ] [Nat]Absence check using 895 positive place invariants in 167 ms returned sat
[2022-05-19 07:42:53] [INFO ] [Nat]Absence check using 895 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-19 07:43:04] [INFO ] After 10993ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:43:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:43:07] [INFO ] After 2486ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 07:43:07] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 3 ms to minimize.
[2022-05-19 07:43:07] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 2 ms to minimize.
[2022-05-19 07:43:07] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2022-05-19 07:43:07] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2022-05-19 07:43:08] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 1 ms to minimize.
[2022-05-19 07:43:08] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 1 ms to minimize.
[2022-05-19 07:43:09] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 1 ms to minimize.
[2022-05-19 07:43:09] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 1 ms to minimize.
[2022-05-19 07:43:09] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 1 ms to minimize.
[2022-05-19 07:43:09] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 1 ms to minimize.
[2022-05-19 07:43:09] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 1 ms to minimize.
[2022-05-19 07:43:10] [INFO ] Deduced a trap composed of 17 places in 220 ms of which 3 ms to minimize.
[2022-05-19 07:43:10] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 0 ms to minimize.
[2022-05-19 07:43:11] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 1 ms to minimize.
[2022-05-19 07:43:11] [INFO ] Deduced a trap composed of 6 places in 211 ms of which 0 ms to minimize.
[2022-05-19 07:43:11] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 0 ms to minimize.
[2022-05-19 07:43:12] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 0 ms to minimize.
[2022-05-19 07:43:12] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 1 ms to minimize.
[2022-05-19 07:43:12] [INFO ] Deduced a trap composed of 9 places in 192 ms of which 0 ms to minimize.
[2022-05-19 07:43:12] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 1 ms to minimize.
[2022-05-19 07:43:13] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 2 ms to minimize.
[2022-05-19 07:43:13] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 0 ms to minimize.
[2022-05-19 07:43:13] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 0 ms to minimize.
[2022-05-19 07:43:13] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 1 ms to minimize.
[2022-05-19 07:43:14] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 1 ms to minimize.
[2022-05-19 07:43:14] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 1 ms to minimize.
[2022-05-19 07:43:14] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 0 ms to minimize.
[2022-05-19 07:43:14] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 0 ms to minimize.
[2022-05-19 07:43:15] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 1 ms to minimize.
[2022-05-19 07:43:15] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 0 ms to minimize.
[2022-05-19 07:43:15] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 1 ms to minimize.
[2022-05-19 07:43:15] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 0 ms to minimize.
[2022-05-19 07:43:16] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 0 ms to minimize.
[2022-05-19 07:43:16] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 3 ms to minimize.
[2022-05-19 07:43:16] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 0 ms to minimize.
[2022-05-19 07:43:16] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 0 ms to minimize.
[2022-05-19 07:43:17] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 1 ms to minimize.
[2022-05-19 07:43:17] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2022-05-19 07:43:17] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 0 ms to minimize.
[2022-05-19 07:43:17] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 0 ms to minimize.
[2022-05-19 07:43:17] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
[2022-05-19 07:43:18] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 10758 ms
[2022-05-19 07:43:18] [INFO ] After 13336ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2022-05-19 07:43:18] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 2501 transition count 2401
Applied a total of 8 rules in 210 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 146529 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{0=1}
Probabilistic random walk after 146529 steps, saw 144476 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:43:21] [INFO ] Computed 901 place invariants in 29 ms
[2022-05-19 07:43:22] [INFO ] [Real]Absence check using 898 positive place invariants in 170 ms returned sat
[2022-05-19 07:43:22] [INFO ] [Real]Absence check using 898 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 07:43:23] [INFO ] After 1785ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:43:24] [INFO ] [Nat]Absence check using 898 positive place invariants in 172 ms returned sat
[2022-05-19 07:43:24] [INFO ] [Nat]Absence check using 898 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-19 07:43:25] [INFO ] After 1222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:43:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:43:25] [INFO ] After 105ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 07:43:25] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 1 ms to minimize.
[2022-05-19 07:43:26] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 1 ms to minimize.
[2022-05-19 07:43:26] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 0 ms to minimize.
[2022-05-19 07:43:26] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 1 ms to minimize.
[2022-05-19 07:43:26] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 0 ms to minimize.
[2022-05-19 07:43:27] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 0 ms to minimize.
[2022-05-19 07:43:27] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 1 ms to minimize.
[2022-05-19 07:43:27] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 0 ms to minimize.
[2022-05-19 07:43:27] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 1 ms to minimize.
[2022-05-19 07:43:28] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 0 ms to minimize.
[2022-05-19 07:43:28] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 0 ms to minimize.
[2022-05-19 07:43:28] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 1 ms to minimize.
[2022-05-19 07:43:28] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 0 ms to minimize.
[2022-05-19 07:43:28] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 3 ms to minimize.
[2022-05-19 07:43:29] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 0 ms to minimize.
[2022-05-19 07:43:29] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 1 ms to minimize.
[2022-05-19 07:43:29] [INFO ] Deduced a trap composed of 5 places in 244 ms of which 0 ms to minimize.
[2022-05-19 07:43:30] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 0 ms to minimize.
[2022-05-19 07:43:30] [INFO ] Deduced a trap composed of 5 places in 232 ms of which 0 ms to minimize.
[2022-05-19 07:43:30] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 1 ms to minimize.
[2022-05-19 07:43:30] [INFO ] Deduced a trap composed of 9 places in 217 ms of which 1 ms to minimize.
[2022-05-19 07:43:31] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 1 ms to minimize.
[2022-05-19 07:43:31] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 0 ms to minimize.
[2022-05-19 07:43:31] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 1 ms to minimize.
[2022-05-19 07:43:31] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 0 ms to minimize.
[2022-05-19 07:43:32] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 0 ms to minimize.
[2022-05-19 07:43:32] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 1 ms to minimize.
[2022-05-19 07:43:34] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 0 ms to minimize.
[2022-05-19 07:43:35] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 1 ms to minimize.
[2022-05-19 07:43:35] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 1 ms to minimize.
[2022-05-19 07:43:35] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 1 ms to minimize.
[2022-05-19 07:43:40] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 0 ms to minimize.
[2022-05-19 07:43:45] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 1 ms to minimize.
[2022-05-19 07:43:46] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 0 ms to minimize.
[2022-05-19 07:43:46] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 0 ms to minimize.
[2022-05-19 07:43:46] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 1 ms to minimize.
[2022-05-19 07:43:46] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 0 ms to minimize.
[2022-05-19 07:43:47] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 0 ms to minimize.
[2022-05-19 07:43:47] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 0 ms to minimize.
[2022-05-19 07:43:47] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 0 ms to minimize.
[2022-05-19 07:43:47] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 0 ms to minimize.
[2022-05-19 07:43:48] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 0 ms to minimize.
[2022-05-19 07:43:48] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
[2022-05-19 07:43:48] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 0 ms to minimize.
[2022-05-19 07:43:48] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 1 ms to minimize.
[2022-05-19 07:43:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 07:43:48] [INFO ] After 25070ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 175 ms.
Support contains 3 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 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 2 place count 2499 transition count 2400
Applied a total of 2 rules in 170 ms. Remains 2499 /2501 variables (removed 2) and now considering 2400/2401 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 2499/2501 places, 2400/2401 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U p1)||!((p1 U !p2)||p0)) U !F(p3)))'
Support contains 9 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 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 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 200 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:43:49] [INFO ] Computed 901 place invariants in 12 ms
[2022-05-19 07:43:50] [INFO ] Implicit Places using invariants in 1151 ms returned []
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:43:50] [INFO ] Computed 901 place invariants in 12 ms
[2022-05-19 07:43:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:43:52] [INFO ] Implicit Places using invariants and state equation in 1761 ms returned []
Implicit Place search using SMT with State Equation took 2916 ms to find 0 implicit places.
[2022-05-19 07:43:53] [INFO ] Redundant transitions in 482 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
[2022-05-19 07:43:53] [INFO ] Computed 901 place invariants in 7 ms
[2022-05-19 07:43:54] [INFO ] Dead Transitions using invariants and state equation in 1300 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 85 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2501/2503 places, 2400/2403 transitions.
Stuttering acceptance computed with spot in 382 ms :[p3, true, p3, (NOT p1), (AND p3 (NOT p0) (NOT p1) p2)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p1) (AND (NOT p3) p2)), acceptance={} source=0 dest: 0}, { cond=(OR (AND p3 p0) (AND p3 p1) (AND p3 p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p3 (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p3 p0 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p3, acceptance={} source=2 dest: 1}, { cond=(NOT p3), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND p3 (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}]], initial=0, aps=[p3:(AND (EQ s1413 1) (EQ s1421 1) (EQ s1427 1)), p0:(AND (EQ s1433 1) (EQ s1447 1)), p1:(EQ s1097 1), p2:(AND (EQ s688 1) (EQ s696 1) (EQ s702 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 7255 steps with 1 reset in 146 ms.
FORMULA ShieldIIPs-PT-100A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLFireability-00 finished in 5601 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p0)||p1)) U (X((X(F(p2)) U p1))||p3)))'
Support contains 10 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 64 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:43:55] [INFO ] Computed 901 place invariants in 9 ms
[2022-05-19 07:43:56] [INFO ] Implicit Places using invariants in 1233 ms returned []
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:43:56] [INFO ] Computed 901 place invariants in 12 ms
[2022-05-19 07:43:58] [INFO ] Implicit Places using invariants and state equation in 1786 ms returned []
Implicit Place search using SMT with State Equation took 3024 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:43:58] [INFO ] Computed 901 place invariants in 7 ms
[2022-05-19 07:43:59] [INFO ] Dead Transitions using invariants and state equation in 1296 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p1) (NOT p3)), (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(AND (EQ s88 1) (EQ s98 1) (EQ s102 1)), p1:(AND (EQ s1763 1) (EQ s1771 1) (EQ s1775 1)), p0:(AND (EQ s1211 1) (EQ s1217 1) (EQ s1227 1)), p2:(EQ s172 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5114 steps with 0 reset in 89 ms.
FORMULA ShieldIIPs-PT-100A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLFireability-01 finished in 4841 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(X(X(p0))))||F(G((G(p1)||G(p2))))))'
Support contains 8 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 63 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:44:00] [INFO ] Computed 901 place invariants in 10 ms
[2022-05-19 07:44:01] [INFO ] Implicit Places using invariants in 1161 ms returned []
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:44:01] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 07:44:02] [INFO ] Implicit Places using invariants and state equation in 1714 ms returned []
Implicit Place search using SMT with State Equation took 2881 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:44:02] [INFO ] Computed 901 place invariants in 6 ms
[2022-05-19 07:44:04] [INFO ] Dead Transitions using invariants and state equation in 1298 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (EQ s2386 0) (EQ s2390 0) (EQ s2402 0)), p1:(OR (EQ s2136 0) (EQ s2140 0) (EQ s2151 0)), p2:(OR (EQ s803 0) (EQ s824 0))], nbAcceptance=2, 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]]
Product exploration explored 100000 steps with 19 reset in 1731 ms.
Product exploration explored 100000 steps with 19 reset in 2051 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 p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 5) seen :4
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
Running SMT prover for 1 properties.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:44:08] [INFO ] Computed 901 place invariants in 10 ms
[2022-05-19 07:44:09] [INFO ] [Real]Absence check using 901 positive place invariants in 171 ms returned sat
[2022-05-19 07:44:10] [INFO ] After 1953ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:44:11] [INFO ] [Nat]Absence check using 901 positive place invariants in 179 ms returned sat
[2022-05-19 07:44:18] [INFO ] After 6853ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:44:18] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 0 ms to minimize.
[2022-05-19 07:44:18] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 0 ms to minimize.
[2022-05-19 07:44:19] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 0 ms to minimize.
[2022-05-19 07:44:19] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 1 ms to minimize.
[2022-05-19 07:44:19] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2022-05-19 07:44:19] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2022-05-19 07:44:19] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2022-05-19 07:44:20] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 0 ms to minimize.
[2022-05-19 07:44:20] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 0 ms to minimize.
[2022-05-19 07:44:20] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2022-05-19 07:44:20] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 0 ms to minimize.
[2022-05-19 07:44:20] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2022-05-19 07:44:20] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2022-05-19 07:44:21] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2022-05-19 07:44:21] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2022-05-19 07:44:21] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2022-05-19 07:44:21] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2022-05-19 07:44:21] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3282 ms
[2022-05-19 07:44:21] [INFO ] After 10272ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9030 ms.
[2022-05-19 07:44:30] [INFO ] After 19898ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 271 ms.
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 11 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 694 times.
Drop transitions removed 694 transitions
Iterating global reduction 0 with 694 rules applied. Total rules applied 698 place count 2501 transition count 2401
Applied a total of 698 rules in 239 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 147549 steps, run timeout after 3002 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 147549 steps, saw 145491 distinct states, run finished after 3004 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:44:34] [INFO ] Computed 901 place invariants in 60 ms
[2022-05-19 07:44:35] [INFO ] [Real]Absence check using 898 positive place invariants in 166 ms returned sat
[2022-05-19 07:44:35] [INFO ] [Real]Absence check using 898 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 07:44:36] [INFO ] After 1813ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:44:37] [INFO ] [Nat]Absence check using 898 positive place invariants in 176 ms returned sat
[2022-05-19 07:44:37] [INFO ] [Nat]Absence check using 898 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 07:44:47] [INFO ] After 10725ms 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 SAFETY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 76 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 71 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:44:47] [INFO ] Computed 901 place invariants in 29 ms
[2022-05-19 07:44:48] [INFO ] Implicit Places using invariants in 1450 ms returned []
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:44:48] [INFO ] Computed 901 place invariants in 36 ms
[2022-05-19 07:44:50] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:44:54] [INFO ] Implicit Places using invariants and state equation in 5774 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 7231 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 75 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2500/2501 places, 2401/2401 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 120 ms. (steps per millisecond=83 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 161511 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 161511 steps, saw 159299 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:44:58] [INFO ] Computed 900 place invariants in 30 ms
[2022-05-19 07:44:58] [INFO ] [Real]Absence check using 897 positive place invariants in 169 ms returned sat
[2022-05-19 07:44:58] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 07:44:59] [INFO ] After 1942ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:45:00] [INFO ] [Nat]Absence check using 897 positive place invariants in 169 ms returned sat
[2022-05-19 07:45:00] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-19 07:45:10] [INFO ] After 10740ms 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 SAFETY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 80 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 71 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:45:10] [INFO ] Computed 900 place invariants in 28 ms
[2022-05-19 07:45:12] [INFO ] Implicit Places using invariants in 1458 ms returned []
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:45:12] [INFO ] Computed 900 place invariants in 23 ms
[2022-05-19 07:45:16] [INFO ] Implicit Places using invariants and state equation in 4506 ms returned []
Implicit Place search using SMT with State Equation took 5967 ms to find 0 implicit places.
[2022-05-19 07:45:17] [INFO ] Redundant transitions in 203 ms returned []
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:45:17] [INFO ] Computed 900 place invariants in 27 ms
[2022-05-19 07:45:18] [INFO ] Dead Transitions using invariants and state equation in 1373 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 88 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:45:18] [INFO ] Computed 900 place invariants in 28 ms
[2022-05-19 07:45:19] [INFO ] [Real]Absence check using 897 positive place invariants in 170 ms returned sat
[2022-05-19 07:45:19] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 6 ms returned sat
[2022-05-19 07:45:20] [INFO ] After 1919ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:45:21] [INFO ] [Nat]Absence check using 897 positive place invariants in 169 ms returned sat
[2022-05-19 07:45:21] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 3 ms returned sat
[2022-05-19 07:45:31] [INFO ] After 10732ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND p0 p1 p2), true]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p0)), (F (AND (NOT p1) p2)), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 2 factoid took 190 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 8 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 63 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:45:31] [INFO ] Computed 901 place invariants in 11 ms
[2022-05-19 07:45:33] [INFO ] Implicit Places using invariants in 1234 ms returned []
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:45:33] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:45:34] [INFO ] Implicit Places using invariants and state equation in 1707 ms returned []
Implicit Place search using SMT with State Equation took 2945 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:45:34] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:45:36] [INFO ] Dead Transitions using invariants and state equation in 1296 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:45:36] [INFO ] Computed 901 place invariants in 13 ms
[2022-05-19 07:45:37] [INFO ] [Real]Absence check using 901 positive place invariants in 167 ms returned sat
[2022-05-19 07:45:38] [INFO ] After 1938ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:45:39] [INFO ] [Nat]Absence check using 901 positive place invariants in 168 ms returned sat
[2022-05-19 07:45:46] [INFO ] After 7138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:45:46] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 1 ms to minimize.
[2022-05-19 07:45:47] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 0 ms to minimize.
[2022-05-19 07:45:47] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2022-05-19 07:45:47] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 0 ms to minimize.
[2022-05-19 07:45:47] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
[2022-05-19 07:45:48] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 0 ms to minimize.
[2022-05-19 07:45:48] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 0 ms to minimize.
[2022-05-19 07:45:48] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 0 ms to minimize.
[2022-05-19 07:45:48] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2022-05-19 07:45:48] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2022-05-19 07:45:48] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 0 ms to minimize.
[2022-05-19 07:45:49] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2022-05-19 07:45:49] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2022-05-19 07:45:49] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2022-05-19 07:45:49] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2022-05-19 07:45:49] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2022-05-19 07:45:49] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2022-05-19 07:45:50] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3449 ms
[2022-05-19 07:45:50] [INFO ] After 10726ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8695 ms.
[2022-05-19 07:45:58] [INFO ] After 19982ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 282 ms.
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 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
Partial Free-agglomeration rule applied 694 times.
Drop transitions removed 694 transitions
Iterating global reduction 0 with 694 rules applied. Total rules applied 698 place count 2501 transition count 2401
Applied a total of 698 rules in 241 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 174 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 123 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 152898 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 152898 steps, saw 150783 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:46:02] [INFO ] Computed 901 place invariants in 30 ms
[2022-05-19 07:46:03] [INFO ] [Real]Absence check using 898 positive place invariants in 167 ms returned sat
[2022-05-19 07:46:03] [INFO ] [Real]Absence check using 898 positive and 3 generalized place invariants in 3 ms returned sat
[2022-05-19 07:46:04] [INFO ] After 1911ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:46:05] [INFO ] [Nat]Absence check using 898 positive place invariants in 170 ms returned sat
[2022-05-19 07:46:05] [INFO ] [Nat]Absence check using 898 positive and 3 generalized place invariants in 4 ms returned sat
[2022-05-19 07:46:15] [INFO ] After 10729ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 77 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 70 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:46:15] [INFO ] Computed 901 place invariants in 30 ms
[2022-05-19 07:46:17] [INFO ] Implicit Places using invariants in 1544 ms returned []
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:46:17] [INFO ] Computed 901 place invariants in 22 ms
[2022-05-19 07:46:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:46:22] [INFO ] Implicit Places using invariants and state equation in 5725 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 7280 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 2500/2501 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.
Finished structural reductions, in 2 iterations. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) 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 155438 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 155438 steps, saw 153291 distinct states, run finished after 3002 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:46:26] [INFO ] Computed 900 place invariants in 28 ms
[2022-05-19 07:46:26] [INFO ] [Real]Absence check using 897 positive place invariants in 171 ms returned sat
[2022-05-19 07:46:26] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 07:46:28] [INFO ] After 1937ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:46:28] [INFO ] [Nat]Absence check using 897 positive place invariants in 176 ms returned sat
[2022-05-19 07:46:28] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-19 07:46:38] [INFO ] After 10743ms 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 SAFETY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 75 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 102 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:46:39] [INFO ] Computed 900 place invariants in 33 ms
[2022-05-19 07:46:40] [INFO ] Implicit Places using invariants in 1510 ms returned []
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:46:40] [INFO ] Computed 900 place invariants in 28 ms
[2022-05-19 07:46:44] [INFO ] Implicit Places using invariants and state equation in 4416 ms returned []
Implicit Place search using SMT with State Equation took 5928 ms to find 0 implicit places.
[2022-05-19 07:46:45] [INFO ] Redundant transitions in 98 ms returned []
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:46:45] [INFO ] Computed 900 place invariants in 29 ms
[2022-05-19 07:46:46] [INFO ] Dead Transitions using invariants and state equation in 1369 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 75 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:46:46] [INFO ] Computed 900 place invariants in 32 ms
[2022-05-19 07:46:47] [INFO ] [Real]Absence check using 897 positive place invariants in 169 ms returned sat
[2022-05-19 07:46:47] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 07:46:48] [INFO ] After 1919ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:46:49] [INFO ] [Nat]Absence check using 897 positive place invariants in 171 ms returned sat
[2022-05-19 07:46:49] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-19 07:46:59] [INFO ] After 10759ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND p0 p1 p2), true]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p0)), (F (AND (NOT p1) p2)), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 19 reset in 1654 ms.
Product exploration explored 100000 steps with 19 reset in 2055 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 8 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 12 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 11 ms
Applied a total of 2 rules in 488 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2022-05-19 07:47:04] [INFO ] Redundant transitions in 248 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
[2022-05-19 07:47:04] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 07:47:06] [INFO ] Dead Transitions using invariants and state equation in 1326 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 81 ms. Remains 2503 /2503 variables (removed 0) and now considering 2402/2402 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2503/2503 places, 2402/2403 transitions.
Product exploration explored 100000 steps with 19 reset in 1657 ms.
Product exploration explored 100000 steps with 19 reset in 2067 ms.
Built C files in :
/tmp/ltsmin15369955007528122636
[2022-05-19 07:47:10] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15369955007528122636
Running compilation step : cd /tmp/ltsmin15369955007528122636;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15369955007528122636;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15369955007528122636;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 8 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 69 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:47:13] [INFO ] Computed 901 place invariants in 12 ms
[2022-05-19 07:47:14] [INFO ] Implicit Places using invariants in 1131 ms returned []
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:47:14] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:47:16] [INFO ] Implicit Places using invariants and state equation in 1794 ms returned []
Implicit Place search using SMT with State Equation took 2927 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:47:16] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 07:47:17] [INFO ] Dead Transitions using invariants and state equation in 1323 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2403/2403 transitions.
Built C files in :
/tmp/ltsmin3308346235088914663
[2022-05-19 07:47:17] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3308346235088914663
Running compilation step : cd /tmp/ltsmin3308346235088914663;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3308346235088914663;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3308346235088914663;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 07:47:21] [INFO ] Flatten gal took : 168 ms
[2022-05-19 07:47:21] [INFO ] Flatten gal took : 183 ms
[2022-05-19 07:47:21] [INFO ] Time to serialize gal into /tmp/LTL1856159152637438083.gal : 30 ms
[2022-05-19 07:47:21] [INFO ] Time to serialize properties into /tmp/LTL8312616445692127361.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1856159152637438083.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8312616445692127361.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1856159...266
Read 1 LTL properties
Checking formula 0 : !(((X(G(X(X("(((p2386==0)||(p2390==0))||(p2402==0))")))))||(F(G((G("(((p2136==0)||(p2140==0))||(p2151==0))"))||(G("((p803==0)||(p824==...166
Formula 0 simplified : !(XGXX"(((p2386==0)||(p2390==0))||(p2402==0))" | FG(G"(((p2136==0)||(p2140==0))||(p2151==0))" | G"((p803==0)||(p824==0))"))
Detected timeout of ITS tools.
[2022-05-19 07:47:36] [INFO ] Flatten gal took : 158 ms
[2022-05-19 07:47:36] [INFO ] Applying decomposition
[2022-05-19 07:47:36] [INFO ] Flatten gal took : 166 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7342559521337973638.txt' '-o' '/tmp/graph7342559521337973638.bin' '-w' '/tmp/graph7342559521337973638.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7342559521337973638.bin' '-l' '-1' '-v' '-w' '/tmp/graph7342559521337973638.weights' '-q' '0' '-e' '0.001'
[2022-05-19 07:47:37] [INFO ] Decomposing Gal with order
[2022-05-19 07:47:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:47:37] [INFO ] Removed a total of 1600 redundant transitions.
[2022-05-19 07:47:38] [INFO ] Flatten gal took : 1000 ms
[2022-05-19 07:47:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 1544 labels/synchronizations in 304 ms.
[2022-05-19 07:47:38] [INFO ] Time to serialize gal into /tmp/LTL6165332049698408770.gal : 35 ms
[2022-05-19 07:47:38] [INFO ] Time to serialize properties into /tmp/LTL3924432024300308204.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6165332049698408770.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3924432024300308204.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6165332...245
Read 1 LTL properties
Checking formula 0 : !(((X(G(X(X("(((i40.i2.i0.u859.p2386==0)||(i40.i2.i0.u861.p2390==0))||(i40.i2.i2.u864.p2402==0))")))))||(F(G((G("(((i36.i2.i1.u769.p21...286
Formula 0 simplified : !(XGXX"(((i40.i2.i0.u859.p2386==0)||(i40.i2.i0.u861.p2390==0))||(i40.i2.i2.u864.p2402==0))" | FG(G"(((i36.i2.i1.u769.p2136==0)||(i36...266
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5566665209124259167
[2022-05-19 07:47:53] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5566665209124259167
Running compilation step : cd /tmp/ltsmin5566665209124259167;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5566665209124259167;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5566665209124259167;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldIIPs-PT-100A-LTLFireability-02 finished in 237062 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(G((F(p0)&&G(F((X(G(p2))&&p1))))))))'
Support contains 7 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 11 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 11 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 162 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:47:57] [INFO ] Computed 901 place invariants in 10 ms
[2022-05-19 07:47:58] [INFO ] Implicit Places using invariants in 1227 ms returned []
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:47:58] [INFO ] Computed 901 place invariants in 10 ms
[2022-05-19 07:47:58] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:48:00] [INFO ] Implicit Places using invariants and state equation in 1739 ms returned []
Implicit Place search using SMT with State Equation took 2976 ms to find 0 implicit places.
[2022-05-19 07:48:00] [INFO ] Redundant transitions in 252 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
[2022-05-19 07:48:00] [INFO ] Computed 901 place invariants in 9 ms
[2022-05-19 07:48:01] [INFO ] Dead Transitions using invariants and state equation in 1297 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 81 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2501/2503 places, 2400/2403 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-04 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=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1155 1) (EQ s1168 1)), p1:(AND (EQ s1980 1) (EQ s1993 1)), p2:(AND (EQ s1186 1) (EQ s1190 1) (EQ s1201 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 5206 steps with 0 reset in 88 ms.
FORMULA ShieldIIPs-PT-100A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLFireability-04 finished in 5075 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||F(G(F(X(G(p1))))))))'
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 11 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
Applied a total of 4 rules in 186 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:48:02] [INFO ] Computed 901 place invariants in 12 ms
[2022-05-19 07:48:03] [INFO ] Implicit Places using invariants in 1244 ms returned []
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:48:03] [INFO ] Computed 901 place invariants in 10 ms
[2022-05-19 07:48:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:48:05] [INFO ] Implicit Places using invariants and state equation in 1703 ms returned []
Implicit Place search using SMT with State Equation took 2956 ms to find 0 implicit places.
[2022-05-19 07:48:05] [INFO ] Redundant transitions in 418 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
[2022-05-19 07:48:05] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 07:48:06] [INFO ] Dead Transitions using invariants and state equation in 1289 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 73 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2501/2503 places, 2400/2403 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(OR (EQ s1378 0) (EQ s1399 0)), p0:(OR (EQ s2106 0) (EQ s2117 0))], nbAcceptance=2, 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 1685 ms.
Product exploration explored 100000 steps with 19 reset in 2076 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 p1 p0), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 332 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 22 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:48:11] [INFO ] Computed 901 place invariants in 12 ms
[2022-05-19 07:48:12] [INFO ] [Real]Absence check using 901 positive place invariants in 166 ms returned sat
[2022-05-19 07:48:13] [INFO ] After 1872ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:48:13] [INFO ] [Nat]Absence check using 901 positive place invariants in 173 ms returned sat
[2022-05-19 07:48:24] [INFO ] After 10688ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 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 2501 transition count 2400
Applied a total of 696 rules in 149 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2400/2400 transitions.
Finished random walk after 6548 steps, including 1 resets, run visited all 1 properties in 134 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 1081 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 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 76 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:48:25] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 07:48:26] [INFO ] Implicit Places using invariants in 1173 ms returned []
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:48:26] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:48:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 07:48:28] [INFO ] Implicit Places using invariants and state equation in 1706 ms returned []
Implicit Place search using SMT with State Equation took 2895 ms to find 0 implicit places.
[2022-05-19 07:48:28] [INFO ] Redundant transitions in 273 ms returned []
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:48:28] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:48:30] [INFO ] Dead Transitions using invariants and state equation in 1308 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 392 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:48:30] [INFO ] Computed 901 place invariants in 11 ms
[2022-05-19 07:48:31] [INFO ] [Real]Absence check using 901 positive place invariants in 166 ms returned sat
[2022-05-19 07:48:32] [INFO ] After 1905ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:48:33] [INFO ] [Nat]Absence check using 901 positive place invariants in 176 ms returned sat
[2022-05-19 07:48:43] [INFO ] After 10777ms 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 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 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 2501 transition count 2400
Applied a total of 696 rules in 149 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2400/2400 transitions.
Finished random walk after 3050 steps, including 0 resets, run visited all 1 properties in 58 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 399 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 19 reset in 1705 ms.
Product exploration explored 100000 steps with 19 reset in 2099 ms.
Built C files in :
/tmp/ltsmin17424545913774328675
[2022-05-19 07:48:48] [INFO ] Too many transitions (2400) to apply POR reductions. Disabling POR matrices.
[2022-05-19 07:48:48] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17424545913774328675
Running compilation step : cd /tmp/ltsmin17424545913774328675;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17424545913774328675;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17424545913774328675;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 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 80 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:48:51] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:48:52] [INFO ] Implicit Places using invariants in 1215 ms returned []
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:48:52] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 07:48:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 07:48:54] [INFO ] Implicit Places using invariants and state equation in 1841 ms returned []
Implicit Place search using SMT with State Equation took 3057 ms to find 0 implicit places.
[2022-05-19 07:48:54] [INFO ] Redundant transitions in 231 ms returned []
// Phase 1: matrix 2400 rows 2501 cols
[2022-05-19 07:48:54] [INFO ] Computed 901 place invariants in 11 ms
[2022-05-19 07:48:55] [INFO ] Dead Transitions using invariants and state equation in 1280 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2400/2400 transitions.
Built C files in :
/tmp/ltsmin2264794400246629518
[2022-05-19 07:48:56] [INFO ] Too many transitions (2400) to apply POR reductions. Disabling POR matrices.
[2022-05-19 07:48:56] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2264794400246629518
Running compilation step : cd /tmp/ltsmin2264794400246629518;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2264794400246629518;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2264794400246629518;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 07:49:00] [INFO ] Flatten gal took : 146 ms
[2022-05-19 07:49:00] [INFO ] Flatten gal took : 144 ms
[2022-05-19 07:49:00] [INFO ] Time to serialize gal into /tmp/LTL5808454636659708631.gal : 11 ms
[2022-05-19 07:49:00] [INFO ] Time to serialize properties into /tmp/LTL17890506936155286855.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5808454636659708631.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17890506936155286855.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5808454...267
Read 1 LTL properties
Checking formula 0 : !((F((G("((p2106==0)||(p2117==0))"))||(F(G(F(X(G("((p1378==0)||(p1399==0))")))))))))
Formula 0 simplified : !F(G"((p2106==0)||(p2117==0))" | FGFXG"((p1378==0)||(p1399==0))")
Detected timeout of ITS tools.
[2022-05-19 07:49:15] [INFO ] Flatten gal took : 137 ms
[2022-05-19 07:49:15] [INFO ] Applying decomposition
[2022-05-19 07:49:15] [INFO ] Flatten gal took : 142 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph385189847880374589.txt' '-o' '/tmp/graph385189847880374589.bin' '-w' '/tmp/graph385189847880374589.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph385189847880374589.bin' '-l' '-1' '-v' '-w' '/tmp/graph385189847880374589.weights' '-q' '0' '-e' '0.001'
[2022-05-19 07:49:15] [INFO ] Decomposing Gal with order
[2022-05-19 07:49:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:49:16] [INFO ] Removed a total of 1595 redundant transitions.
[2022-05-19 07:49:16] [INFO ] Flatten gal took : 154 ms
[2022-05-19 07:49:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 1552 labels/synchronizations in 175 ms.
[2022-05-19 07:49:16] [INFO ] Time to serialize gal into /tmp/LTL3962017916412033992.gal : 23 ms
[2022-05-19 07:49:16] [INFO ] Time to serialize properties into /tmp/LTL5361514038651030784.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3962017916412033992.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5361514038651030784.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3962017...245
Read 1 LTL properties
Checking formula 0 : !((F((G("((i36.i1.i1.u758.p2106==0)||(i36.i1.i1.u762.p2117==0))"))||(F(G(F(X(G("((i23.i2.i0.u496.p1378==0)||(i23.i2.i2.u504.p1399==0))...165
Formula 0 simplified : !F(G"((i36.i1.i1.u758.p2106==0)||(i36.i1.i1.u762.p2117==0))" | FGFXG"((i23.i2.i0.u496.p1378==0)||(i23.i2.i2.u504.p1399==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13210306864892158973
[2022-05-19 07:49:31] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13210306864892158973
Running compilation step : cd /tmp/ltsmin13210306864892158973;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13210306864892158973;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13210306864892158973;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldIIPs-PT-100A-LTLFireability-05 finished in 92427 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U !F(G((!p1 U X(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 57 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:49:34] [INFO ] Computed 901 place invariants in 10 ms
[2022-05-19 07:49:35] [INFO ] Implicit Places using invariants in 1178 ms returned []
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:49:35] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:49:37] [INFO ] Implicit Places using invariants and state equation in 1672 ms returned []
Implicit Place search using SMT with State Equation took 2851 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:49:37] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:49:38] [INFO ] Dead Transitions using invariants and state equation in 1278 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 122 ms :[p0, false, p0]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s983 1) (EQ s997 1)), p0:(AND (EQ s286 1) (EQ s290 1) (EQ s301 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33527 reset in 6485 ms.
Product exploration explored 100000 steps with 33350 reset in 6677 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 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 396 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[p0, false, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:49:52] [INFO ] Computed 901 place invariants in 13 ms
[2022-05-19 07:49:53] [INFO ] [Real]Absence check using 901 positive place invariants in 168 ms returned sat
[2022-05-19 07:49:53] [INFO ] After 630ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 07:49:54] [INFO ] [Nat]Absence check using 901 positive place invariants in 165 ms returned sat
[2022-05-19 07:49:55] [INFO ] After 1318ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 07:49:55] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2022-05-19 07:49:55] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2022-05-19 07:49:56] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2022-05-19 07:49:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 522 ms
[2022-05-19 07:49:56] [INFO ] After 2071ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 199 ms.
[2022-05-19 07:49:56] [INFO ] After 2935ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 341 ms.
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 11 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
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 298 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 2499/2503 places, 2400/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 136476 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 136476 steps, saw 133611 distinct states, run finished after 3003 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 07:50:00] [INFO ] Computed 900 place invariants in 26 ms
[2022-05-19 07:50:01] [INFO ] [Real]Absence check using 896 positive place invariants in 163 ms returned sat
[2022-05-19 07:50:01] [INFO ] [Real]Absence check using 896 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-19 07:50:01] [INFO ] After 635ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 07:50:01] [INFO ] [Nat]Absence check using 896 positive place invariants in 156 ms returned sat
[2022-05-19 07:50:01] [INFO ] [Nat]Absence check using 896 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-19 07:50:03] [INFO ] After 1241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 07:50:03] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 1 ms to minimize.
[2022-05-19 07:50:03] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 0 ms to minimize.
[2022-05-19 07:50:03] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2022-05-19 07:50:04] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 1 ms to minimize.
[2022-05-19 07:50:04] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2022-05-19 07:50:04] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 0 ms to minimize.
[2022-05-19 07:50:04] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2022-05-19 07:50:04] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 0 ms to minimize.
[2022-05-19 07:50:05] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 0 ms to minimize.
[2022-05-19 07:50:05] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 1 ms to minimize.
[2022-05-19 07:50:05] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 0 ms to minimize.
[2022-05-19 07:50:05] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 0 ms to minimize.
[2022-05-19 07:50:05] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 0 ms to minimize.
[2022-05-19 07:50:06] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 1 ms to minimize.
[2022-05-19 07:50:06] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2022-05-19 07:50:06] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 0 ms to minimize.
[2022-05-19 07:50:06] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2022-05-19 07:50:06] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 1 ms to minimize.
[2022-05-19 07:50:06] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 1 ms to minimize.
[2022-05-19 07:50:07] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 0 ms to minimize.
[2022-05-19 07:50:07] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2022-05-19 07:50:07] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2022-05-19 07:50:07] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 0 ms to minimize.
[2022-05-19 07:50:07] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4535 ms
[2022-05-19 07:50:07] [INFO ] After 5984ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 167 ms.
[2022-05-19 07:50:08] [INFO ] After 6780ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 77 ms.
Support contains 5 out of 2499 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 87 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2499/2499 places, 2400/2400 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 72 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 07:50:08] [INFO ] Computed 900 place invariants in 28 ms
[2022-05-19 07:50:09] [INFO ] Implicit Places using invariants in 1538 ms returned []
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 07:50:09] [INFO ] Computed 900 place invariants in 29 ms
[2022-05-19 07:50:13] [INFO ] Implicit Places using invariants and state equation in 3977 ms returned []
Implicit Place search using SMT with State Equation took 5517 ms to find 0 implicit places.
[2022-05-19 07:50:13] [INFO ] Redundant transitions in 101 ms returned []
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 07:50:13] [INFO ] Computed 900 place invariants in 25 ms
[2022-05-19 07:50:15] [INFO ] Dead Transitions using invariants and state equation in 1236 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 69 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 07:50:15] [INFO ] Computed 900 place invariants in 26 ms
[2022-05-19 07:50:15] [INFO ] [Real]Absence check using 896 positive place invariants in 150 ms returned sat
[2022-05-19 07:50:15] [INFO ] [Real]Absence check using 896 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-19 07:50:15] [INFO ] After 580ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 07:50:16] [INFO ] [Nat]Absence check using 896 positive place invariants in 166 ms returned sat
[2022-05-19 07:50:16] [INFO ] [Nat]Absence check using 896 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-19 07:50:17] [INFO ] After 1258ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 07:50:18] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 0 ms to minimize.
[2022-05-19 07:50:18] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 1 ms to minimize.
[2022-05-19 07:50:18] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 1 ms to minimize.
[2022-05-19 07:50:18] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 0 ms to minimize.
[2022-05-19 07:50:18] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2022-05-19 07:50:19] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 1 ms to minimize.
[2022-05-19 07:50:19] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2022-05-19 07:50:19] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 1 ms to minimize.
[2022-05-19 07:50:19] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 0 ms to minimize.
[2022-05-19 07:50:19] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 0 ms to minimize.
[2022-05-19 07:50:20] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 0 ms to minimize.
[2022-05-19 07:50:20] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 0 ms to minimize.
[2022-05-19 07:50:20] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 0 ms to minimize.
[2022-05-19 07:50:20] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2022-05-19 07:50:20] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 0 ms to minimize.
[2022-05-19 07:50:21] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 0 ms to minimize.
[2022-05-19 07:50:21] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 1 ms to minimize.
[2022-05-19 07:50:21] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 1 ms to minimize.
[2022-05-19 07:50:21] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 0 ms to minimize.
[2022-05-19 07:50:21] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2022-05-19 07:50:21] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2022-05-19 07:50:22] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2022-05-19 07:50:22] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2022-05-19 07:50:22] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4520 ms
[2022-05-19 07:50:22] [INFO ] After 5988ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 166 ms.
[2022-05-19 07:50:22] [INFO ] After 6836ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 214 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 433 ms :[p0, false, p0]
Stuttering acceptance computed with spot in 97 ms :[p0, false, 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 63 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:50:23] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:50:24] [INFO ] Implicit Places using invariants in 1198 ms returned []
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:50:24] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:50:26] [INFO ] Implicit Places using invariants and state equation in 1795 ms returned []
Implicit Place search using SMT with State Equation took 2996 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:50:26] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 07:50:27] [INFO ] Dead Transitions using invariants and state equation in 1259 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 328 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 108 ms :[p0, false, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:50:28] [INFO ] Computed 901 place invariants in 6 ms
[2022-05-19 07:50:29] [INFO ] [Real]Absence check using 901 positive place invariants in 173 ms returned sat
[2022-05-19 07:50:29] [INFO ] After 606ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 07:50:29] [INFO ] [Nat]Absence check using 901 positive place invariants in 169 ms returned sat
[2022-05-19 07:50:31] [INFO ] After 1306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 07:50:31] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 0 ms to minimize.
[2022-05-19 07:50:31] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2022-05-19 07:50:31] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2022-05-19 07:50:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 547 ms
[2022-05-19 07:50:32] [INFO ] After 2092ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 199 ms.
[2022-05-19 07:50:32] [INFO ] After 2893ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 327 ms.
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 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
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 299 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 2499/2503 places, 2400/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 136789 steps, run timeout after 3002 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 136789 steps, saw 133918 distinct states, run finished after 3002 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 07:50:36] [INFO ] Computed 900 place invariants in 27 ms
[2022-05-19 07:50:36] [INFO ] [Real]Absence check using 896 positive place invariants in 164 ms returned sat
[2022-05-19 07:50:36] [INFO ] [Real]Absence check using 896 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-19 07:50:36] [INFO ] After 640ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 07:50:37] [INFO ] [Nat]Absence check using 896 positive place invariants in 165 ms returned sat
[2022-05-19 07:50:37] [INFO ] [Nat]Absence check using 896 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-19 07:50:38] [INFO ] After 1285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 07:50:39] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 0 ms to minimize.
[2022-05-19 07:50:39] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 1 ms to minimize.
[2022-05-19 07:50:39] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 1 ms to minimize.
[2022-05-19 07:50:39] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 0 ms to minimize.
[2022-05-19 07:50:40] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2022-05-19 07:50:40] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 0 ms to minimize.
[2022-05-19 07:50:40] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2022-05-19 07:50:40] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 0 ms to minimize.
[2022-05-19 07:50:40] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 1 ms to minimize.
[2022-05-19 07:50:41] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 1 ms to minimize.
[2022-05-19 07:50:41] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 1 ms to minimize.
[2022-05-19 07:50:41] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 1 ms to minimize.
[2022-05-19 07:50:41] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 0 ms to minimize.
[2022-05-19 07:50:41] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 0 ms to minimize.
[2022-05-19 07:50:42] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2022-05-19 07:50:42] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 0 ms to minimize.
[2022-05-19 07:50:42] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 0 ms to minimize.
[2022-05-19 07:50:42] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 1 ms to minimize.
[2022-05-19 07:50:42] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 0 ms to minimize.
[2022-05-19 07:50:43] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2022-05-19 07:50:43] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2022-05-19 07:50:43] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 0 ms to minimize.
[2022-05-19 07:50:43] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2022-05-19 07:50:43] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4706 ms
[2022-05-19 07:50:43] [INFO ] After 6214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 172 ms.
[2022-05-19 07:50:43] [INFO ] After 7062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 74 ms.
Support contains 5 out of 2499 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 1 iterations. Remains : 2499/2499 places, 2400/2400 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 67 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 07:50:44] [INFO ] Computed 900 place invariants in 27 ms
[2022-05-19 07:50:45] [INFO ] Implicit Places using invariants in 1507 ms returned []
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 07:50:45] [INFO ] Computed 900 place invariants in 19 ms
[2022-05-19 07:50:49] [INFO ] Implicit Places using invariants and state equation in 3937 ms returned []
Implicit Place search using SMT with State Equation took 5444 ms to find 0 implicit places.
[2022-05-19 07:50:49] [INFO ] Redundant transitions in 97 ms returned []
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 07:50:49] [INFO ] Computed 900 place invariants in 23 ms
[2022-05-19 07:50:51] [INFO ] Dead Transitions using invariants and state equation in 1321 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 71 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 07:50:51] [INFO ] Computed 900 place invariants in 23 ms
[2022-05-19 07:50:51] [INFO ] [Real]Absence check using 896 positive place invariants in 167 ms returned sat
[2022-05-19 07:50:51] [INFO ] [Real]Absence check using 896 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-19 07:50:51] [INFO ] After 618ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 07:50:52] [INFO ] [Nat]Absence check using 896 positive place invariants in 165 ms returned sat
[2022-05-19 07:50:52] [INFO ] [Nat]Absence check using 896 positive and 4 generalized place invariants in 0 ms returned sat
[2022-05-19 07:50:53] [INFO ] After 1276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 07:50:53] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 0 ms to minimize.
[2022-05-19 07:50:54] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 1 ms to minimize.
[2022-05-19 07:50:54] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 1 ms to minimize.
[2022-05-19 07:50:54] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 0 ms to minimize.
[2022-05-19 07:50:54] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2022-05-19 07:50:55] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 1 ms to minimize.
[2022-05-19 07:50:55] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2022-05-19 07:50:55] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 1 ms to minimize.
[2022-05-19 07:50:55] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 0 ms to minimize.
[2022-05-19 07:50:55] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 1 ms to minimize.
[2022-05-19 07:50:56] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2022-05-19 07:50:56] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 0 ms to minimize.
[2022-05-19 07:50:56] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
[2022-05-19 07:50:56] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 0 ms to minimize.
[2022-05-19 07:50:56] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
[2022-05-19 07:50:57] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 0 ms to minimize.
[2022-05-19 07:50:57] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2022-05-19 07:50:57] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 0 ms to minimize.
[2022-05-19 07:50:57] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2022-05-19 07:50:57] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2022-05-19 07:50:57] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2022-05-19 07:50:58] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 0 ms to minimize.
[2022-05-19 07:50:58] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 0 ms to minimize.
[2022-05-19 07:50:58] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4484 ms
[2022-05-19 07:50:58] [INFO ] After 5969ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 161 ms.
[2022-05-19 07:50:58] [INFO ] After 6809ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 297 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 117 ms :[p0, false, p0]
Stuttering acceptance computed with spot in 94 ms :[p0, false, p0]
Stuttering acceptance computed with spot in 102 ms :[p0, false, p0]
Product exploration explored 100000 steps with 33440 reset in 6403 ms.
Product exploration explored 100000 steps with 33415 reset in 6658 ms.
Built C files in :
/tmp/ltsmin5316676063015982405
[2022-05-19 07:51:12] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5316676063015982405
Running compilation step : cd /tmp/ltsmin5316676063015982405;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5316676063015982405;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5316676063015982405;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 5 out of 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 63 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:51:15] [INFO ] Computed 901 place invariants in 13 ms
[2022-05-19 07:51:16] [INFO ] Implicit Places using invariants in 1219 ms returned []
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:51:16] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:51:18] [INFO ] Implicit Places using invariants and state equation in 1779 ms returned []
Implicit Place search using SMT with State Equation took 3000 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:51:18] [INFO ] Computed 901 place invariants in 7 ms
[2022-05-19 07:51:19] [INFO ] Dead Transitions using invariants and state equation in 1210 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2403/2403 transitions.
Built C files in :
/tmp/ltsmin18199552061983762333
[2022-05-19 07:51:19] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18199552061983762333
Running compilation step : cd /tmp/ltsmin18199552061983762333;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18199552061983762333;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18199552061983762333;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 07:51:23] [INFO ] Flatten gal took : 148 ms
[2022-05-19 07:51:23] [INFO ] Flatten gal took : 147 ms
[2022-05-19 07:51:23] [INFO ] Time to serialize gal into /tmp/LTL7618128085831899749.gal : 8 ms
[2022-05-19 07:51:23] [INFO ] Time to serialize properties into /tmp/LTL8758591411934739029.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7618128085831899749.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8758591411934739029.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7618128...266
Read 1 LTL properties
Checking formula 0 : !((F(("(((p286==1)&&(p290==1))&&(p301==1))")U(!(F(G((!("((p983==1)&&(p997==1))"))U(X("(((p286==1)&&(p290==1))&&(p301==1))")))))))))
Formula 0 simplified : !F("(((p286==1)&&(p290==1))&&(p301==1))" U !FG(!"((p983==1)&&(p997==1))" U X"(((p286==1)&&(p290==1))&&(p301==1))"))
Detected timeout of ITS tools.
[2022-05-19 07:51:38] [INFO ] Flatten gal took : 139 ms
[2022-05-19 07:51:38] [INFO ] Applying decomposition
[2022-05-19 07:51:38] [INFO ] Flatten gal took : 137 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14499642541053275263.txt' '-o' '/tmp/graph14499642541053275263.bin' '-w' '/tmp/graph14499642541053275263.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14499642541053275263.bin' '-l' '-1' '-v' '-w' '/tmp/graph14499642541053275263.weights' '-q' '0' '-e' '0.001'
[2022-05-19 07:51:38] [INFO ] Decomposing Gal with order
[2022-05-19 07:51:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:51:38] [INFO ] Removed a total of 1600 redundant transitions.
[2022-05-19 07:51:39] [INFO ] Flatten gal took : 141 ms
[2022-05-19 07:51:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 1540 labels/synchronizations in 179 ms.
[2022-05-19 07:51:39] [INFO ] Time to serialize gal into /tmp/LTL16394956788370018861.gal : 16 ms
[2022-05-19 07:51:39] [INFO ] Time to serialize properties into /tmp/LTL17765606230719399385.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16394956788370018861.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17765606230719399385.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1639495...247
Read 1 LTL properties
Checking formula 0 : !((F(("(((i4.i1.i2.u103.p286==1)&&(i4.i1.i2.u105.p290==1))&&(i4.i1.i1.u108.p301==1))")U(!(F(G((!("((i17.i0.i0.u354.p983==1)&&(i17.i0.i...266
Formula 0 simplified : !F("(((i4.i1.i2.u103.p286==1)&&(i4.i1.i2.u105.p290==1))&&(i4.i1.i1.u108.p301==1))" U !FG(!"((i17.i0.i0.u354.p983==1)&&(i17.i0.i0.u35...252
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12040281465904543258
[2022-05-19 07:51:54] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12040281465904543258
Running compilation step : cd /tmp/ltsmin12040281465904543258;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12040281465904543258;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12040281465904543258;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldIIPs-PT-100A-LTLFireability-06 finished in 142915 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(G(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 60 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:51:57] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:51:58] [INFO ] Implicit Places using invariants in 1129 ms returned []
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:51:58] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:52:00] [INFO ] Implicit Places using invariants and state equation in 1816 ms returned []
Implicit Place search using SMT with State Equation took 2947 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:52:00] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 07:52:01] [INFO ] Dead Transitions using invariants and state equation in 1336 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 228 ms :[true, (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: 2}]], initial=3, aps=[p0:(AND (EQ s1986 1) (EQ s1992 1) (EQ s2002 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-100A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLFireability-09 finished in 4608 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((F(p0)||p1))||X(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 65 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:52:02] [INFO ] Computed 901 place invariants in 10 ms
[2022-05-19 07:52:03] [INFO ] Implicit Places using invariants in 1157 ms returned []
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:52:03] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 07:52:04] [INFO ] Implicit Places using invariants and state equation in 1693 ms returned []
Implicit Place search using SMT with State Equation took 2851 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:52:04] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:52:06] [INFO ] Dead Transitions using invariants and state equation in 1331 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1455 0) (EQ s1468 0)), p1:(AND (OR (EQ s88 0) (EQ s98 0) (EQ s102 0)) (OR (EQ s1455 0) (EQ s1468 0))), p2:(AND (EQ s88 1) (EQ s98 1) (EQ s102 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 9050 ms.
Product exploration explored 100000 steps with 50000 reset in 9175 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 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 2 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPs-PT-100A-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-100A-LTLFireability-11 finished in 22675 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((!X((G(p0)||F(p1))) U p2))))'
Support contains 2 out of 2503 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 63 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:52:24] [INFO ] Computed 901 place invariants in 12 ms
[2022-05-19 07:52:25] [INFO ] Implicit Places using invariants in 1227 ms returned []
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:52:25] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:52:27] [INFO ] Implicit Places using invariants and state equation in 1772 ms returned []
Implicit Place search using SMT with State Equation took 3000 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:52:27] [INFO ] Computed 901 place invariants in 7 ms
[2022-05-19 07:52:29] [INFO ] Dead Transitions using invariants and state equation in 1331 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p2), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s1833 1) (EQ s1847 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 7541 steps with 2 reset in 111 ms.
FORMULA ShieldIIPs-PT-100A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLFireability-12 finished in 4602 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 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 63 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:52:29] [INFO ] Computed 901 place invariants in 10 ms
[2022-05-19 07:52:30] [INFO ] Implicit Places using invariants in 1224 ms returned []
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:52:30] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:52:32] [INFO ] Implicit Places using invariants and state equation in 1797 ms returned []
Implicit Place search using SMT with State Equation took 3022 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:52:32] [INFO ] Computed 901 place invariants in 7 ms
[2022-05-19 07:52:33] [INFO ] Dead Transitions using invariants and state equation in 1309 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-13 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 s207 1) (EQ s209 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 21 reset in 1260 ms.
Product exploration explored 100000 steps with 22 reset in 1625 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 124624 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 124624 steps, saw 115694 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:52:40] [INFO ] Computed 901 place invariants in 11 ms
[2022-05-19 07:52:40] [INFO ] [Real]Absence check using 901 positive place invariants in 171 ms returned sat
[2022-05-19 07:52:41] [INFO ] After 1779ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:52:42] [INFO ] [Nat]Absence check using 901 positive place invariants in 168 ms returned sat
[2022-05-19 07:52:43] [INFO ] After 1231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:52:43] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2022-05-19 07:52:44] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2022-05-19 07:52:44] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2022-05-19 07:52:44] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2022-05-19 07:52:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 610 ms
[2022-05-19 07:52:44] [INFO ] After 1904ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 86 ms.
[2022-05-19 07:52:44] [INFO ] After 2588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 129 ms.
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 11 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
Partial Free-agglomeration rule applied 697 times.
Drop transitions removed 697 transitions
Iterating global reduction 0 with 697 rules applied. Total rules applied 701 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 702 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 703 place count 2499 transition count 2400
Applied a total of 703 rules in 304 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 2499/2503 places, 2400/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
Finished probabilistic random walk after 41216 steps, run visited all 1 properties in 643 ms. (steps per millisecond=64 )
Probabilistic random walk after 41216 steps, saw 40298 distinct states, run finished after 645 ms. (steps per millisecond=63 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:52:46] [INFO ] Computed 901 place invariants in 10 ms
[2022-05-19 07:52:50] [INFO ] [Real]Absence check using 901 positive place invariants in 1154 ms returned sat
[2022-05-19 07:52:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:53:01] [INFO ] [Real]Absence check using state equation in 11039 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 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 62 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:53:01] [INFO ] Computed 901 place invariants in 11 ms
[2022-05-19 07:53:02] [INFO ] Implicit Places using invariants in 1247 ms returned []
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:53:02] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 07:53:04] [INFO ] Implicit Places using invariants and state equation in 1816 ms returned []
Implicit Place search using SMT with State Equation took 3065 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:53:04] [INFO ] Computed 901 place invariants in 7 ms
[2022-05-19 07:53:05] [INFO ] Dead Transitions using invariants and state equation in 1313 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 160 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 120916 steps, run timeout after 3042 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 120916 steps, saw 112539 distinct states, run finished after 3042 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:53:09] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 07:53:10] [INFO ] [Real]Absence check using 901 positive place invariants in 174 ms returned sat
[2022-05-19 07:53:11] [INFO ] After 1827ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:53:11] [INFO ] [Nat]Absence check using 901 positive place invariants in 165 ms returned sat
[2022-05-19 07:53:13] [INFO ] After 1200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:53:13] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2022-05-19 07:53:13] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2022-05-19 07:53:13] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2022-05-19 07:53:13] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2022-05-19 07:53:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 601 ms
[2022-05-19 07:53:13] [INFO ] After 1866ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2022-05-19 07:53:13] [INFO ] After 2542ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 101 ms.
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 11 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
Partial Free-agglomeration rule applied 697 times.
Drop transitions removed 697 transitions
Iterating global reduction 0 with 697 rules applied. Total rules applied 701 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 702 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 703 place count 2499 transition count 2400
Applied a total of 703 rules in 318 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 2499/2503 places, 2400/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Finished probabilistic random walk after 41216 steps, run visited all 1 properties in 669 ms. (steps per millisecond=61 )
Probabilistic random walk after 41216 steps, saw 40298 distinct states, run finished after 671 ms. (steps per millisecond=61 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:53:15] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 07:53:19] [INFO ] [Real]Absence check using 901 positive place invariants in 1203 ms returned sat
[2022-05-19 07:53:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:53:30] [INFO ] [Real]Absence check using state equation in 11031 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22 reset in 1305 ms.
Product exploration explored 100000 steps with 22 reset in 1649 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 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 12 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 166 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2022-05-19 07:53:34] [INFO ] Redundant transitions in 274 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
[2022-05-19 07:53:34] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:53:35] [INFO ] Dead Transitions using invariants and state equation in 1258 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 87 ms. Remains 2503 /2503 variables (removed 0) and now considering 2402/2402 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2503/2503 places, 2402/2403 transitions.
Product exploration explored 100000 steps with 22 reset in 1319 ms.
Product exploration explored 100000 steps with 22 reset in 1777 ms.
Built C files in :
/tmp/ltsmin3270457062195557548
[2022-05-19 07:53:38] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3270457062195557548
Running compilation step : cd /tmp/ltsmin3270457062195557548;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3270457062195557548;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3270457062195557548;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 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 64 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:53:42] [INFO ] Computed 901 place invariants in 13 ms
[2022-05-19 07:53:43] [INFO ] Implicit Places using invariants in 1233 ms returned []
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:53:43] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 07:53:45] [INFO ] Implicit Places using invariants and state equation in 1786 ms returned []
Implicit Place search using SMT with State Equation took 3024 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:53:45] [INFO ] Computed 901 place invariants in 9 ms
[2022-05-19 07:53:46] [INFO ] Dead Transitions using invariants and state equation in 1242 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2403/2403 transitions.
Built C files in :
/tmp/ltsmin3547349368968570186
[2022-05-19 07:53:46] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3547349368968570186
Running compilation step : cd /tmp/ltsmin3547349368968570186;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3547349368968570186;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3547349368968570186;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 07:53:49] [INFO ] Flatten gal took : 142 ms
[2022-05-19 07:53:49] [INFO ] Flatten gal took : 141 ms
[2022-05-19 07:53:49] [INFO ] Time to serialize gal into /tmp/LTL6896547920269722776.gal : 8 ms
[2022-05-19 07:53:50] [INFO ] Time to serialize properties into /tmp/LTL5662225620589826184.ltl : 354 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6896547920269722776.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5662225620589826184.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6896547...266
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((p207==1)&&(p209==1))")))))
Formula 0 simplified : !XXF"((p207==1)&&(p209==1))"
Detected timeout of ITS tools.
[2022-05-19 07:54:05] [INFO ] Flatten gal took : 137 ms
[2022-05-19 07:54:05] [INFO ] Applying decomposition
[2022-05-19 07:54:05] [INFO ] Flatten gal took : 139 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12414363837760514415.txt' '-o' '/tmp/graph12414363837760514415.bin' '-w' '/tmp/graph12414363837760514415.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12414363837760514415.bin' '-l' '-1' '-v' '-w' '/tmp/graph12414363837760514415.weights' '-q' '0' '-e' '0.001'
[2022-05-19 07:54:05] [INFO ] Decomposing Gal with order
[2022-05-19 07:54:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:54:05] [INFO ] Removed a total of 1600 redundant transitions.
[2022-05-19 07:54:05] [INFO ] Flatten gal took : 132 ms
[2022-05-19 07:54:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 1528 labels/synchronizations in 165 ms.
[2022-05-19 07:54:06] [INFO ] Time to serialize gal into /tmp/LTL6958762143580397127.gal : 18 ms
[2022-05-19 07:54:06] [INFO ] Time to serialize properties into /tmp/LTL15828720308005339023.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6958762143580397127.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15828720308005339023.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6958762...246
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((i4.i0.i0.u74.p207==1)&&(i4.i0.i2.u75.p209==1))")))))
Formula 0 simplified : !XXF"((i4.i0.i0.u74.p207==1)&&(i4.i0.i2.u75.p209==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1275053902076407154
[2022-05-19 07:54:21] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1275053902076407154
Running compilation step : cd /tmp/ltsmin1275053902076407154;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1275053902076407154;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1275053902076407154;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldIIPs-PT-100A-LTLFireability-13 finished in 114920 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p1)&&G(F(p2))))&&p0)))'
Support contains 7 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 65 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:54:24] [INFO ] Computed 901 place invariants in 11 ms
[2022-05-19 07:54:25] [INFO ] Implicit Places using invariants in 1245 ms returned []
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:54:25] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:54:27] [INFO ] Implicit Places using invariants and state equation in 1832 ms returned []
Implicit Place search using SMT with State Equation took 3079 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:54:27] [INFO ] Computed 901 place invariants in 7 ms
[2022-05-19 07:54:28] [INFO ] Dead Transitions using invariants and state equation in 1325 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(NOT p2), acceptance={} source=3 dest: 5}, { cond=true, acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s2079 1) (EQ s2094 1)), p1:(AND (EQ s1613 1) (EQ s1623 1) (EQ s1625 1)), p2:(AND (EQ s383 1) (EQ s398 1) (OR (EQ s1613 0) (EQ s1623 0) (EQ s16...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-100A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLFireability-14 finished in 4753 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(X(G(X(X(F(p0))))))||F(p1)))))'
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 62 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:54:29] [INFO ] Computed 901 place invariants in 11 ms
[2022-05-19 07:54:30] [INFO ] Implicit Places using invariants in 1230 ms returned []
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:54:30] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 07:54:31] [INFO ] Implicit Places using invariants and state equation in 1191 ms returned []
Implicit Place search using SMT with State Equation took 2423 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:54:31] [INFO ] Computed 901 place invariants in 11 ms
[2022-05-19 07:54:32] [INFO ] Dead Transitions using invariants and state equation in 1231 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s2139 1) (EQ s2160 1)), p0:(EQ s1272 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 148 reset in 1302 ms.
Product exploration explored 100000 steps with 149 reset in 1603 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) p0), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 1288 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 2324 steps, including 0 resets, run visited all 2 properties in 33 ms. (steps per millisecond=70 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 199 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT 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 65 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:54:37] [INFO ] Computed 901 place invariants in 10 ms
[2022-05-19 07:54:38] [INFO ] Implicit Places using invariants in 1221 ms returned []
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:54:38] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:54:40] [INFO ] Implicit Places using invariants and state equation in 1751 ms returned []
Implicit Place search using SMT with State Equation took 2975 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:54:40] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:54:41] [INFO ] Dead Transitions using invariants and state equation in 1289 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 p1) p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 335 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 2416 steps, including 0 resets, run visited all 2 properties in 38 ms. (steps per millisecond=63 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 151 reset in 1325 ms.
Product exploration explored 100000 steps with 150 reset in 1701 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
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 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 17 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 11 ms
Applied a total of 2 rules in 152 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2022-05-19 07:54:46] [INFO ] Redundant transitions in 264 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
[2022-05-19 07:54:46] [INFO ] Computed 901 place invariants in 9 ms
[2022-05-19 07:54:48] [INFO ] Dead Transitions using invariants and state equation in 1295 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 13 ms
Applied a total of 0 rules in 80 ms. Remains 2503 /2503 variables (removed 0) and now considering 2402/2402 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2503/2503 places, 2402/2403 transitions.
Product exploration explored 100000 steps with 152 reset in 1295 ms.
Product exploration explored 100000 steps with 152 reset in 1596 ms.
Built C files in :
/tmp/ltsmin13328422387467420939
[2022-05-19 07:54:51] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13328422387467420939
Running compilation step : cd /tmp/ltsmin13328422387467420939;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13328422387467420939;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13328422387467420939;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 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 67 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:54:54] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:54:55] [INFO ] Implicit Places using invariants in 1246 ms returned []
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:54:55] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 07:54:56] [INFO ] Implicit Places using invariants and state equation in 1195 ms returned []
Implicit Place search using SMT with State Equation took 2442 ms to find 0 implicit places.
// Phase 1: matrix 2403 rows 2503 cols
[2022-05-19 07:54:56] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 07:54:57] [INFO ] Dead Transitions using invariants and state equation in 1299 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 2403/2403 transitions.
Built C files in :
/tmp/ltsmin14353781338482770568
[2022-05-19 07:55:01] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14353781338482770568
Running compilation step : cd /tmp/ltsmin14353781338482770568;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14353781338482770568;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14353781338482770568;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 07:55:05] [INFO ] Flatten gal took : 150 ms
[2022-05-19 07:55:05] [INFO ] Flatten gal took : 154 ms
[2022-05-19 07:55:05] [INFO ] Time to serialize gal into /tmp/LTL8018443888509880866.gal : 10 ms
[2022-05-19 07:55:05] [INFO ] Time to serialize properties into /tmp/LTL14733573057692565492.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8018443888509880866.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14733573057692565492.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8018443...267
Read 1 LTL properties
Checking formula 0 : !((X(F((G(X(G(X(X(F("(p1272==0)")))))))||(F("((p2139==1)&&(p2160==1))"))))))
Formula 0 simplified : !XF(GXGXXF"(p1272==0)" | F"((p2139==1)&&(p2160==1))")
Detected timeout of ITS tools.
[2022-05-19 07:55:20] [INFO ] Flatten gal took : 154 ms
[2022-05-19 07:55:20] [INFO ] Applying decomposition
[2022-05-19 07:55:20] [INFO ] Flatten gal took : 135 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6017474266888068755.txt' '-o' '/tmp/graph6017474266888068755.bin' '-w' '/tmp/graph6017474266888068755.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6017474266888068755.bin' '-l' '-1' '-v' '-w' '/tmp/graph6017474266888068755.weights' '-q' '0' '-e' '0.001'
[2022-05-19 07:55:20] [INFO ] Decomposing Gal with order
[2022-05-19 07:55:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:55:21] [INFO ] Removed a total of 1600 redundant transitions.
[2022-05-19 07:55:21] [INFO ] Flatten gal took : 138 ms
[2022-05-19 07:55:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 1548 labels/synchronizations in 162 ms.
[2022-05-19 07:55:21] [INFO ] Time to serialize gal into /tmp/LTL254408183407430300.gal : 22 ms
[2022-05-19 07:55:21] [INFO ] Time to serialize properties into /tmp/LTL15919033873074319257.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL254408183407430300.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15919033873074319257.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2544081...245
Read 1 LTL properties
Checking formula 0 : !((X(F((G(X(G(X(X(F("(i22.i0.i2.u458.p1272==0)")))))))||(F("((i37.i1.i0.u771.p2139==1)&&(i38.i0.i1.u778.p2160==1))"))))))
Formula 0 simplified : !XF(GXGXXF"(i22.i0.i2.u458.p1272==0)" | F"((i37.i1.i0.u771.p2139==1)&&(i38.i0.i1.u778.p2160==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7575209557203458178
[2022-05-19 07:55:36] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7575209557203458178
Running compilation step : cd /tmp/ltsmin7575209557203458178;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7575209557203458178;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7575209557203458178;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldIIPs-PT-100A-LTLFireability-15 finished in 70575 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(X(X(p0))))||F(G((G(p1)||G(p2))))))'
Found a SL insensitive property : ShieldIIPs-PT-100A-LTLFireability-02
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 8 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SLCL_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 11 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 164 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:55:40] [INFO ] Computed 901 place invariants in 12 ms
[2022-05-19 07:55:41] [INFO ] Implicit Places using invariants in 1196 ms returned []
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 07:55:41] [INFO ] Computed 901 place invariants in 7 ms
[2022-05-19 07:55:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 07:55:46] [INFO ] Implicit Places using invariants and state equation in 5192 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6394 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 2500/2503 places, 2401/2403 transitions.
Applied a total of 0 rules in 90 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2500/2503 places, 2401/2403 transitions.
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (EQ s2386 0) (EQ s2390 0) (EQ s2402 0)), p1:(OR (EQ s2136 0) (EQ s2140 0) (EQ s2151 0)), p2:(OR (EQ s803 0) (EQ s824 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 19 reset in 1356 ms.
Product exploration explored 100000 steps with 19 reset in 1696 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 p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 417 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:55:50] [INFO ] Computed 900 place invariants in 10 ms
[2022-05-19 07:55:51] [INFO ] [Real]Absence check using 900 positive place invariants in 169 ms returned sat
[2022-05-19 07:55:52] [INFO ] After 1902ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 07:55:53] [INFO ] [Nat]Absence check using 900 positive place invariants in 168 ms returned sat
[2022-05-19 07:55:59] [INFO ] After 6459ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 07:56:00] [INFO ] Deduced a trap composed of 9 places in 229 ms of which 1 ms to minimize.
[2022-05-19 07:56:00] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 1 ms to minimize.
[2022-05-19 07:56:00] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 0 ms to minimize.
[2022-05-19 07:56:01] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 1 ms to minimize.
[2022-05-19 07:56:01] [INFO ] Deduced a trap composed of 11 places in 218 ms of which 1 ms to minimize.
[2022-05-19 07:56:01] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 1 ms to minimize.
[2022-05-19 07:56:02] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 1 ms to minimize.
[2022-05-19 07:56:02] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 0 ms to minimize.
[2022-05-19 07:56:02] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 1 ms to minimize.
[2022-05-19 07:56:02] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 0 ms to minimize.
[2022-05-19 07:56:03] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 1 ms to minimize.
[2022-05-19 07:56:03] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 1 ms to minimize.
[2022-05-19 07:56:03] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2022-05-19 07:56:03] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 0 ms to minimize.
[2022-05-19 07:56:03] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 0 ms to minimize.
[2022-05-19 07:56:04] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 0 ms to minimize.
[2022-05-19 07:56:04] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 0 ms to minimize.
[2022-05-19 07:56:04] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2022-05-19 07:56:04] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2022-05-19 07:56:04] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 0 ms to minimize.
[2022-05-19 07:56:04] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 0 ms to minimize.
[2022-05-19 07:56:05] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2022-05-19 07:56:05] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2022-05-19 07:56:05] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2022-05-19 07:56:05] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 0 ms to minimize.
[2022-05-19 07:56:05] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2022-05-19 07:56:05] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2022-05-19 07:56:06] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2022-05-19 07:56:06] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2022-05-19 07:56:06] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2022-05-19 07:56:06] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2022-05-19 07:56:06] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2022-05-19 07:56:06] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2022-05-19 07:56:06] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 6807 ms
[2022-05-19 07:56:09] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 1 ms to minimize.
[2022-05-19 07:56:09] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 0 ms to minimize.
[2022-05-19 07:56:10] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 1 ms to minimize.
[2022-05-19 07:56:10] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 0 ms to minimize.
[2022-05-19 07:56:10] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 1 ms to minimize.
[2022-05-19 07:56:10] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 1 ms to minimize.
[2022-05-19 07:56:10] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2022-05-19 07:56:11] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2022-05-19 07:56:11] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2022-05-19 07:56:11] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2022-05-19 07:56:11] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2022-05-19 07:56:11] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 0 ms to minimize.
[2022-05-19 07:56:12] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2022-05-19 07:56:12] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 0 ms to minimize.
[2022-05-19 07:56:12] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 0 ms to minimize.
[2022-05-19 07:56:12] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2022-05-19 07:56:12] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2022-05-19 07:56:13] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2022-05-19 07:56:13] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 0 ms to minimize.
[2022-05-19 07:56:13] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2022-05-19 07:56:13] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2022-05-19 07:56:13] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2022-05-19 07:56:13] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2022-05-19 07:56:14] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2022-05-19 07:56:14] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2022-05-19 07:56:14] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 4996 ms
[2022-05-19 07:56:14] [INFO ] After 20970ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2975 ms.
[2022-05-19 07:56:17] [INFO ] After 24621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 447 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 694 times.
Drop transitions removed 694 transitions
Iterating global reduction 0 with 694 rules applied. Total rules applied 694 place count 2500 transition count 2401
Applied a total of 694 rules in 146 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 120108 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 120108 steps, saw 118325 distinct states, run finished after 3003 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:56:21] [INFO ] Computed 900 place invariants in 31 ms
[2022-05-19 07:56:22] [INFO ] [Real]Absence check using 897 positive place invariants in 173 ms returned sat
[2022-05-19 07:56:22] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 07:56:23] [INFO ] After 1998ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 07:56:24] [INFO ] [Nat]Absence check using 897 positive place invariants in 151 ms returned sat
[2022-05-19 07:56:24] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-19 07:56:34] [INFO ] After 10217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:56:36] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 1 ms to minimize.
[2022-05-19 07:56:45] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 9240 ms
[2022-05-19 07:56:45] [INFO ] After 21223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-19 07:56:45] [INFO ] After 21836ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 135 ms.
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 87 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 87 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:56:45] [INFO ] Computed 900 place invariants in 27 ms
[2022-05-19 07:56:47] [INFO ] Implicit Places using invariants in 1455 ms returned []
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:56:47] [INFO ] Computed 900 place invariants in 23 ms
[2022-05-19 07:56:47] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-19 07:56:51] [INFO ] Implicit Places using invariants and state equation in 4466 ms returned []
Implicit Place search using SMT with State Equation took 5923 ms to find 0 implicit places.
[2022-05-19 07:56:51] [INFO ] Redundant transitions in 100 ms returned []
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:56:51] [INFO ] Computed 900 place invariants in 29 ms
[2022-05-19 07:56:53] [INFO ] Dead Transitions using invariants and state equation in 1363 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 75 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:56:53] [INFO ] Computed 900 place invariants in 28 ms
[2022-05-19 07:56:53] [INFO ] [Real]Absence check using 897 positive place invariants in 174 ms returned sat
[2022-05-19 07:56:53] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 07:56:55] [INFO ] After 1947ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 07:56:55] [INFO ] [Nat]Absence check using 897 positive place invariants in 175 ms returned sat
[2022-05-19 07:56:55] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 07:57:06] [INFO ] After 10278ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 07:57:13] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 1 ms to minimize.
[2022-05-19 07:57:19] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 0 ms to minimize.
[2022-05-19 07:57:20] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 0 ms to minimize.
[2022-05-19 07:57:29] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 15666 ms
[2022-05-19 07:57:29] [INFO ] After 33441ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-19 07:57:29] [INFO ] After 34133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND p0 p1 p2), true]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p0)), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 2 factoid took 327 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 8 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 68 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:57:30] [INFO ] Computed 900 place invariants in 10 ms
[2022-05-19 07:57:31] [INFO ] Implicit Places using invariants in 1218 ms returned []
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:57:31] [INFO ] Computed 900 place invariants in 6 ms
[2022-05-19 07:57:33] [INFO ] Implicit Places using invariants and state equation in 1785 ms returned []
Implicit Place search using SMT with State Equation took 3005 ms to find 0 implicit places.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:57:33] [INFO ] Computed 900 place invariants in 8 ms
[2022-05-19 07:57:34] [INFO ] Dead Transitions using invariants and state equation in 1300 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 : [(AND p0 p1 p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:57:35] [INFO ] Computed 900 place invariants in 8 ms
[2022-05-19 07:57:35] [INFO ] [Real]Absence check using 900 positive place invariants in 165 ms returned sat
[2022-05-19 07:57:36] [INFO ] After 1830ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:57:37] [INFO ] [Nat]Absence check using 900 positive place invariants in 171 ms returned sat
[2022-05-19 07:57:47] [INFO ] After 10711ms 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 SAFETY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 694 times.
Drop transitions removed 694 transitions
Iterating global reduction 0 with 694 rules applied. Total rules applied 694 place count 2500 transition count 2401
Applied a total of 694 rules in 150 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 188624 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 188624 steps, saw 186109 distinct states, run finished after 3002 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:57:50] [INFO ] Computed 900 place invariants in 29 ms
[2022-05-19 07:57:51] [INFO ] [Real]Absence check using 897 positive place invariants in 167 ms returned sat
[2022-05-19 07:57:51] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-19 07:57:52] [INFO ] After 1948ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:57:53] [INFO ] [Nat]Absence check using 897 positive place invariants in 168 ms returned sat
[2022-05-19 07:57:53] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 07:58:03] [INFO ] After 10727ms 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 SAFETY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 76 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 71 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:58:03] [INFO ] Computed 900 place invariants in 29 ms
[2022-05-19 07:58:05] [INFO ] Implicit Places using invariants in 1533 ms returned []
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:58:05] [INFO ] Computed 900 place invariants in 31 ms
[2022-05-19 07:58:09] [INFO ] Implicit Places using invariants and state equation in 4508 ms returned []
Implicit Place search using SMT with State Equation took 6047 ms to find 0 implicit places.
[2022-05-19 07:58:09] [INFO ] Redundant transitions in 94 ms returned []
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:58:09] [INFO ] Computed 900 place invariants in 31 ms
[2022-05-19 07:58:11] [INFO ] Dead Transitions using invariants and state equation in 1281 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 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.
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:58:11] [INFO ] Computed 900 place invariants in 27 ms
[2022-05-19 07:58:11] [INFO ] [Real]Absence check using 897 positive place invariants in 168 ms returned sat
[2022-05-19 07:58:11] [INFO ] [Real]Absence check using 897 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-19 07:58:13] [INFO ] After 1891ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 07:58:13] [INFO ] [Nat]Absence check using 897 positive place invariants in 170 ms returned sat
[2022-05-19 07:58:13] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 07:58:23] [INFO ] After 10733ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND p0 p1 p2), true]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p0)), (F (AND (NOT p1) p2)), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 2 factoid took 165 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 437 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 19 reset in 1332 ms.
Product exploration explored 100000 steps with 19 reset in 1653 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 8 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 85 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2022-05-19 07:58:28] [INFO ] Redundant transitions in 248 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
[2022-05-19 07:58:28] [INFO ] Computed 900 place invariants in 5 ms
[2022-05-19 07:58:29] [INFO ] Dead Transitions using invariants and state equation in 1305 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 78 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2500/2500 places, 2400/2401 transitions.
Product exploration explored 100000 steps with 19 reset in 1389 ms.
Product exploration explored 100000 steps with 19 reset in 1799 ms.
Built C files in :
/tmp/ltsmin9660818806701214177
[2022-05-19 07:58:33] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9660818806701214177
Running compilation step : cd /tmp/ltsmin9660818806701214177;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9660818806701214177;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9660818806701214177;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 8 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 59 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:58:36] [INFO ] Computed 900 place invariants in 13 ms
[2022-05-19 07:58:37] [INFO ] Implicit Places using invariants in 1242 ms returned []
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:58:37] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 07:58:39] [INFO ] Implicit Places using invariants and state equation in 1689 ms returned []
Implicit Place search using SMT with State Equation took 2933 ms to find 0 implicit places.
// Phase 1: matrix 2401 rows 2500 cols
[2022-05-19 07:58:39] [INFO ] Computed 900 place invariants in 8 ms
[2022-05-19 07:58:40] [INFO ] Dead Transitions using invariants and state equation in 1306 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2401/2401 transitions.
Built C files in :
/tmp/ltsmin5193081804345845987
[2022-05-19 07:58:40] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5193081804345845987
Running compilation step : cd /tmp/ltsmin5193081804345845987;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5193081804345845987;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5193081804345845987;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 07:58:44] [INFO ] Flatten gal took : 137 ms
[2022-05-19 07:58:44] [INFO ] Flatten gal took : 141 ms
[2022-05-19 07:58:44] [INFO ] Time to serialize gal into /tmp/LTL5275871085807952789.gal : 8 ms
[2022-05-19 07:58:44] [INFO ] Time to serialize properties into /tmp/LTL16458232661929980850.ltl : 178 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5275871085807952789.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16458232661929980850.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5275871...267
Read 1 LTL properties
Checking formula 0 : !(((X(G(X(X("(((p2386==0)||(p2390==0))||(p2402==0))")))))||(F(G((G("(((p2136==0)||(p2140==0))||(p2151==0))"))||(G("((p803==0)||(p824==...166
Formula 0 simplified : !(XGXX"(((p2386==0)||(p2390==0))||(p2402==0))" | FG(G"(((p2136==0)||(p2140==0))||(p2151==0))" | G"((p803==0)||(p824==0))"))
Detected timeout of ITS tools.
[2022-05-19 07:58:59] [INFO ] Flatten gal took : 135 ms
[2022-05-19 07:58:59] [INFO ] Applying decomposition
[2022-05-19 07:58:59] [INFO ] Flatten gal took : 138 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3129191146847458334.txt' '-o' '/tmp/graph3129191146847458334.bin' '-w' '/tmp/graph3129191146847458334.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3129191146847458334.bin' '-l' '-1' '-v' '-w' '/tmp/graph3129191146847458334.weights' '-q' '0' '-e' '0.001'
[2022-05-19 07:58:59] [INFO ] Decomposing Gal with order
[2022-05-19 07:58:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 07:59:00] [INFO ] Removed a total of 1597 redundant transitions.
[2022-05-19 07:59:00] [INFO ] Flatten gal took : 131 ms
[2022-05-19 07:59:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 1540 labels/synchronizations in 159 ms.
[2022-05-19 07:59:00] [INFO ] Time to serialize gal into /tmp/LTL4428129906924906096.gal : 17 ms
[2022-05-19 07:59:00] [INFO ] Time to serialize properties into /tmp/LTL17625545651080282890.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4428129906924906096.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17625545651080282890.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4428129...246
Read 1 LTL properties
Checking formula 0 : !(((X(G(X(X("(((i43.i0.i0.u859.p2386==0)||(i43.i0.i0.u861.p2390==0))||(i43.i0.i2.u864.p2402==0))")))))||(F(G((G("(((i38.i0.i0.u769.p21...286
Formula 0 simplified : !(XGXX"(((i43.i0.i0.u859.p2386==0)||(i43.i0.i0.u861.p2390==0))||(i43.i0.i2.u864.p2402==0))" | FG(G"(((i38.i0.i0.u769.p2136==0)||(i38...266
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1940282821617536965
[2022-05-19 07:59:15] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1940282821617536965
Running compilation step : cd /tmp/ltsmin1940282821617536965;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1940282821617536965;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1940282821617536965;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldIIPs-PT-100A-LTLFireability-02 finished in 218996 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||F(G(F(X(G(p1))))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U !F(G((!p1 U X(p0)))))))'
Found a CL insensitive property : ShieldIIPs-PT-100A-LTLFireability-06
Stuttering acceptance computed with spot in 186 ms :[p0, false, p0]
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SLCL_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 12 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 12 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 243 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 07:59:19] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 07:59:21] [INFO ] Implicit Places using invariants in 2458 ms returned []
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 07:59:21] [INFO ] Computed 900 place invariants in 5 ms
[2022-05-19 07:59:23] [INFO ] Implicit Places using invariants and state equation in 1656 ms returned []
Implicit Place search using SMT with State Equation took 4132 ms to find 0 implicit places.
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 07:59:23] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 07:59:24] [INFO ] Dead Transitions using invariants and state equation in 1293 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 2499/2503 places, 2400/2403 transitions.
Finished structural reductions, in 1 iterations. Remains : 2499/2503 places, 2400/2403 transitions.
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s982 1) (EQ s996 1)), p0:(AND (EQ s285 1) (EQ s289 1) (EQ s300 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33406 reset in 2195 ms.
Product exploration explored 100000 steps with 33331 reset in 2527 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 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 211 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 95 ms :[p0, false, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 07:59:30] [INFO ] Computed 900 place invariants in 10 ms
[2022-05-19 07:59:30] [INFO ] [Real]Absence check using 900 positive place invariants in 152 ms returned sat
[2022-05-19 07:59:30] [INFO ] After 593ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 07:59:31] [INFO ] [Nat]Absence check using 900 positive place invariants in 152 ms returned sat
[2022-05-19 07:59:32] [INFO ] After 1234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 07:59:32] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2022-05-19 07:59:32] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 0 ms to minimize.
[2022-05-19 07:59:33] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2022-05-19 07:59:33] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2022-05-19 07:59:33] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 0 ms to minimize.
[2022-05-19 07:59:33] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2022-05-19 07:59:33] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2022-05-19 07:59:33] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1106 ms
[2022-05-19 07:59:33] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2022-05-19 07:59:34] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2022-05-19 07:59:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 373 ms
[2022-05-19 07:59:34] [INFO ] After 2835ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 188 ms.
[2022-05-19 07:59:34] [INFO ] After 3647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 154 ms.
Support contains 5 out of 2499 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 138 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2499/2499 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 134020 steps, run timeout after 3123 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 134020 steps, saw 131670 distinct states, run finished after 3123 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 07:59:38] [INFO ] Computed 900 place invariants in 18 ms
[2022-05-19 07:59:38] [INFO ] [Real]Absence check using 900 positive place invariants in 160 ms returned sat
[2022-05-19 07:59:38] [INFO ] After 623ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 07:59:39] [INFO ] [Nat]Absence check using 900 positive place invariants in 154 ms returned sat
[2022-05-19 07:59:40] [INFO ] After 1210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 07:59:40] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 1 ms to minimize.
[2022-05-19 07:59:41] [INFO ] Deduced a trap composed of 14 places in 199 ms of which 1 ms to minimize.
[2022-05-19 07:59:41] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 0 ms to minimize.
[2022-05-19 07:59:41] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 0 ms to minimize.
[2022-05-19 07:59:42] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 0 ms to minimize.
[2022-05-19 07:59:42] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 1 ms to minimize.
[2022-05-19 07:59:42] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 1 ms to minimize.
[2022-05-19 07:59:42] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 1 ms to minimize.
[2022-05-19 07:59:43] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 0 ms to minimize.
[2022-05-19 07:59:43] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 1 ms to minimize.
[2022-05-19 07:59:43] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 0 ms to minimize.
[2022-05-19 07:59:43] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 0 ms to minimize.
[2022-05-19 07:59:44] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 1 ms to minimize.
[2022-05-19 07:59:44] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 1 ms to minimize.
[2022-05-19 07:59:44] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 0 ms to minimize.
[2022-05-19 07:59:44] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 0 ms to minimize.
[2022-05-19 07:59:44] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 1 ms to minimize.
[2022-05-19 07:59:45] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 0 ms to minimize.
[2022-05-19 07:59:45] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 1 ms to minimize.
[2022-05-19 07:59:45] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4751 ms
[2022-05-19 07:59:45] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4751 ms
[2022-05-19 07:59:45] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 0 ms to minimize.
[2022-05-19 07:59:45] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 0 ms to minimize.
[2022-05-19 07:59:46] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 0 ms to minimize.
[2022-05-19 07:59:46] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 1 ms to minimize.
[2022-05-19 07:59:46] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 1 ms to minimize.
[2022-05-19 07:59:46] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 0 ms to minimize.
[2022-05-19 07:59:46] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2022-05-19 07:59:47] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 1 ms to minimize.
[2022-05-19 07:59:47] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 0 ms to minimize.
[2022-05-19 07:59:47] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 0 ms to minimize.
[2022-05-19 07:59:47] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 0 ms to minimize.
[2022-05-19 07:59:47] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2022-05-19 07:59:48] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 0 ms to minimize.
[2022-05-19 07:59:48] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 0 ms to minimize.
[2022-05-19 07:59:48] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 0 ms to minimize.
[2022-05-19 07:59:48] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 0 ms to minimize.
[2022-05-19 07:59:48] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2022-05-19 07:59:48] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 1 ms to minimize.
[2022-05-19 07:59:49] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 0 ms to minimize.
[2022-05-19 07:59:49] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3676 ms
[2022-05-19 07:59:49] [INFO ] After 9759ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 175 ms.
[2022-05-19 07:59:49] [INFO ] After 10547ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 89 ms.
Support contains 5 out of 2499 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 81 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2499/2499 places, 2400/2400 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 93 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 07:59:49] [INFO ] Computed 900 place invariants in 18 ms
[2022-05-19 07:59:51] [INFO ] Implicit Places using invariants in 1546 ms returned []
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 07:59:51] [INFO ] Computed 900 place invariants in 18 ms
[2022-05-19 07:59:53] [INFO ] Implicit Places using invariants and state equation in 2081 ms returned []
Implicit Place search using SMT with State Equation took 3661 ms to find 0 implicit places.
[2022-05-19 07:59:53] [INFO ] Redundant transitions in 96 ms returned []
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 07:59:53] [INFO ] Computed 900 place invariants in 18 ms
[2022-05-19 07:59:54] [INFO ] Dead Transitions using invariants and state equation in 1298 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 66 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 07:59:54] [INFO ] Computed 900 place invariants in 20 ms
[2022-05-19 07:59:55] [INFO ] [Real]Absence check using 900 positive place invariants in 155 ms returned sat
[2022-05-19 07:59:55] [INFO ] After 597ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 07:59:55] [INFO ] [Nat]Absence check using 900 positive place invariants in 152 ms returned sat
[2022-05-19 07:59:57] [INFO ] After 1208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 07:59:57] [INFO ] Deduced a trap composed of 9 places in 203 ms of which 1 ms to minimize.
[2022-05-19 07:59:57] [INFO ] Deduced a trap composed of 14 places in 206 ms of which 1 ms to minimize.
[2022-05-19 07:59:58] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 1 ms to minimize.
[2022-05-19 07:59:58] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 1 ms to minimize.
[2022-05-19 07:59:58] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 0 ms to minimize.
[2022-05-19 07:59:58] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 1 ms to minimize.
[2022-05-19 07:59:59] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 1 ms to minimize.
[2022-05-19 07:59:59] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 0 ms to minimize.
[2022-05-19 07:59:59] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 1 ms to minimize.
[2022-05-19 07:59:59] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 1 ms to minimize.
[2022-05-19 08:00:00] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 1 ms to minimize.
[2022-05-19 08:00:00] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 1 ms to minimize.
[2022-05-19 08:00:00] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 1 ms to minimize.
[2022-05-19 08:00:00] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 0 ms to minimize.
[2022-05-19 08:00:01] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 1 ms to minimize.
[2022-05-19 08:00:01] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 0 ms to minimize.
[2022-05-19 08:00:01] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 1 ms to minimize.
[2022-05-19 08:00:01] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 0 ms to minimize.
[2022-05-19 08:00:01] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 0 ms to minimize.
[2022-05-19 08:00:01] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4719 ms
[2022-05-19 08:00:01] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4719 ms
[2022-05-19 08:00:02] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 0 ms to minimize.
[2022-05-19 08:00:02] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 0 ms to minimize.
[2022-05-19 08:00:02] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 1 ms to minimize.
[2022-05-19 08:00:02] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 0 ms to minimize.
[2022-05-19 08:00:03] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 1 ms to minimize.
[2022-05-19 08:00:03] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 0 ms to minimize.
[2022-05-19 08:00:03] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 1 ms to minimize.
[2022-05-19 08:00:03] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 0 ms to minimize.
[2022-05-19 08:00:03] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 1 ms to minimize.
[2022-05-19 08:00:04] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 0 ms to minimize.
[2022-05-19 08:00:04] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 0 ms to minimize.
[2022-05-19 08:00:04] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 0 ms to minimize.
[2022-05-19 08:00:04] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 1 ms to minimize.
[2022-05-19 08:00:04] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 0 ms to minimize.
[2022-05-19 08:00:05] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 0 ms to minimize.
[2022-05-19 08:00:05] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 0 ms to minimize.
[2022-05-19 08:00:05] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 0 ms to minimize.
[2022-05-19 08:00:05] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 9 ms to minimize.
[2022-05-19 08:00:05] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2022-05-19 08:00:05] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3773 ms
[2022-05-19 08:00:05] [INFO ] After 9826ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 172 ms.
[2022-05-19 08:00:06] [INFO ] After 10612ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 245 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[p0, false, p0]
Stuttering acceptance computed with spot in 104 ms :[p0, false, p0]
Support contains 5 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 59 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 08:00:06] [INFO ] Computed 900 place invariants in 9 ms
[2022-05-19 08:00:07] [INFO ] Implicit Places using invariants in 1254 ms returned []
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 08:00:07] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:00:09] [INFO ] Implicit Places using invariants and state equation in 1643 ms returned []
Implicit Place search using SMT with State Equation took 2912 ms to find 0 implicit places.
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 08:00:09] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:00:11] [INFO ] Dead Transitions using invariants and state equation in 1523 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 200 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 92 ms :[p0, false, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 08:00:11] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:00:12] [INFO ] [Real]Absence check using 900 positive place invariants in 151 ms returned sat
[2022-05-19 08:00:12] [INFO ] After 583ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 08:00:12] [INFO ] [Nat]Absence check using 900 positive place invariants in 148 ms returned sat
[2022-05-19 08:00:14] [INFO ] After 1212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 08:00:14] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2022-05-19 08:00:14] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2022-05-19 08:00:14] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2022-05-19 08:00:14] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2022-05-19 08:00:14] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 0 ms to minimize.
[2022-05-19 08:00:15] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2022-05-19 08:00:15] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2022-05-19 08:00:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1117 ms
[2022-05-19 08:00:15] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2022-05-19 08:00:15] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2022-05-19 08:00:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 323 ms
[2022-05-19 08:00:15] [INFO ] After 2777ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 180 ms.
[2022-05-19 08:00:15] [INFO ] After 3565ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 156 ms.
Support contains 5 out of 2499 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 136 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2499/2499 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 135637 steps, run timeout after 3002 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 135637 steps, saw 133247 distinct states, run finished after 3003 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 08:00:19] [INFO ] Computed 900 place invariants in 24 ms
[2022-05-19 08:00:20] [INFO ] [Real]Absence check using 900 positive place invariants in 149 ms returned sat
[2022-05-19 08:00:20] [INFO ] After 568ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 08:00:20] [INFO ] [Nat]Absence check using 900 positive place invariants in 155 ms returned sat
[2022-05-19 08:00:22] [INFO ] After 1232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 08:00:22] [INFO ] Deduced a trap composed of 9 places in 212 ms of which 0 ms to minimize.
[2022-05-19 08:00:22] [INFO ] Deduced a trap composed of 14 places in 194 ms of which 1 ms to minimize.
[2022-05-19 08:00:22] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 0 ms to minimize.
[2022-05-19 08:00:23] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 0 ms to minimize.
[2022-05-19 08:00:23] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 1 ms to minimize.
[2022-05-19 08:00:23] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 1 ms to minimize.
[2022-05-19 08:00:23] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 1 ms to minimize.
[2022-05-19 08:00:24] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 1 ms to minimize.
[2022-05-19 08:00:24] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 0 ms to minimize.
[2022-05-19 08:00:24] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 0 ms to minimize.
[2022-05-19 08:00:24] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 1 ms to minimize.
[2022-05-19 08:00:25] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 1 ms to minimize.
[2022-05-19 08:00:25] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 0 ms to minimize.
[2022-05-19 08:00:25] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 0 ms to minimize.
[2022-05-19 08:00:25] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 0 ms to minimize.
[2022-05-19 08:00:25] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 1 ms to minimize.
[2022-05-19 08:00:26] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 0 ms to minimize.
[2022-05-19 08:00:26] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 1 ms to minimize.
[2022-05-19 08:00:26] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 1 ms to minimize.
[2022-05-19 08:00:26] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4422 ms
[2022-05-19 08:00:26] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4422 ms
[2022-05-19 08:00:26] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 1 ms to minimize.
[2022-05-19 08:00:27] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 0 ms to minimize.
[2022-05-19 08:00:27] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 1 ms to minimize.
[2022-05-19 08:00:27] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 0 ms to minimize.
[2022-05-19 08:00:27] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 0 ms to minimize.
[2022-05-19 08:00:27] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 0 ms to minimize.
[2022-05-19 08:00:28] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 1 ms to minimize.
[2022-05-19 08:00:28] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 1 ms to minimize.
[2022-05-19 08:00:28] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 0 ms to minimize.
[2022-05-19 08:00:28] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
[2022-05-19 08:00:28] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 0 ms to minimize.
[2022-05-19 08:00:28] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 0 ms to minimize.
[2022-05-19 08:00:29] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 0 ms to minimize.
[2022-05-19 08:00:29] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2022-05-19 08:00:29] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 0 ms to minimize.
[2022-05-19 08:00:29] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 0 ms to minimize.
[2022-05-19 08:00:29] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2022-05-19 08:00:29] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 0 ms to minimize.
[2022-05-19 08:00:30] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2022-05-19 08:00:30] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3577 ms
[2022-05-19 08:00:30] [INFO ] After 9350ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 165 ms.
[2022-05-19 08:00:30] [INFO ] After 10132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 85 ms.
Support contains 5 out of 2499 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 71 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2499/2499 places, 2400/2400 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 68 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 08:00:30] [INFO ] Computed 900 place invariants in 24 ms
[2022-05-19 08:00:32] [INFO ] Implicit Places using invariants in 1527 ms returned []
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 08:00:32] [INFO ] Computed 900 place invariants in 18 ms
[2022-05-19 08:00:34] [INFO ] Implicit Places using invariants and state equation in 2235 ms returned []
Implicit Place search using SMT with State Equation took 3762 ms to find 0 implicit places.
[2022-05-19 08:00:34] [INFO ] Redundant transitions in 97 ms returned []
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 08:00:34] [INFO ] Computed 900 place invariants in 27 ms
[2022-05-19 08:00:35] [INFO ] Dead Transitions using invariants and state equation in 1336 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2499/2499 places, 2400/2400 transitions.
Applied a total of 0 rules in 71 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 08:00:35] [INFO ] Computed 900 place invariants in 25 ms
[2022-05-19 08:00:36] [INFO ] [Real]Absence check using 900 positive place invariants in 169 ms returned sat
[2022-05-19 08:00:36] [INFO ] After 655ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 08:00:37] [INFO ] [Nat]Absence check using 900 positive place invariants in 156 ms returned sat
[2022-05-19 08:00:38] [INFO ] After 1202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 08:00:38] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 0 ms to minimize.
[2022-05-19 08:00:38] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 1 ms to minimize.
[2022-05-19 08:00:39] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 1 ms to minimize.
[2022-05-19 08:00:39] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 1 ms to minimize.
[2022-05-19 08:00:39] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 1 ms to minimize.
[2022-05-19 08:00:39] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 1 ms to minimize.
[2022-05-19 08:00:40] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 0 ms to minimize.
[2022-05-19 08:00:40] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 1 ms to minimize.
[2022-05-19 08:00:40] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 1 ms to minimize.
[2022-05-19 08:00:40] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 0 ms to minimize.
[2022-05-19 08:00:41] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 1 ms to minimize.
[2022-05-19 08:00:41] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 0 ms to minimize.
[2022-05-19 08:00:41] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 0 ms to minimize.
[2022-05-19 08:00:41] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 0 ms to minimize.
[2022-05-19 08:00:41] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 1 ms to minimize.
[2022-05-19 08:00:42] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 0 ms to minimize.
[2022-05-19 08:00:42] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 1 ms to minimize.
[2022-05-19 08:00:42] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 0 ms to minimize.
[2022-05-19 08:00:42] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 0 ms to minimize.
[2022-05-19 08:00:42] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4296 ms
[2022-05-19 08:00:42] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4296 ms
[2022-05-19 08:00:42] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 1 ms to minimize.
[2022-05-19 08:00:43] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 0 ms to minimize.
[2022-05-19 08:00:43] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 0 ms to minimize.
[2022-05-19 08:00:43] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 1 ms to minimize.
[2022-05-19 08:00:43] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 0 ms to minimize.
[2022-05-19 08:00:43] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 0 ms to minimize.
[2022-05-19 08:00:44] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 0 ms to minimize.
[2022-05-19 08:00:44] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 0 ms to minimize.
[2022-05-19 08:00:44] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 0 ms to minimize.
[2022-05-19 08:00:44] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2022-05-19 08:00:44] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2022-05-19 08:00:45] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 0 ms to minimize.
[2022-05-19 08:00:45] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2022-05-19 08:00:45] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 0 ms to minimize.
[2022-05-19 08:00:45] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 0 ms to minimize.
[2022-05-19 08:00:45] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 0 ms to minimize.
[2022-05-19 08:00:45] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 0 ms to minimize.
[2022-05-19 08:00:45] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 0 ms to minimize.
[2022-05-19 08:00:46] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 0 ms to minimize.
[2022-05-19 08:00:46] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3463 ms
[2022-05-19 08:00:46] [INFO ] After 9092ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 173 ms.
[2022-05-19 08:00:46] [INFO ] After 9870ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 248 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 139 ms :[p0, false, p0]
Stuttering acceptance computed with spot in 116 ms :[p0, false, p0]
Stuttering acceptance computed with spot in 119 ms :[p0, false, p0]
Product exploration explored 100000 steps with 33369 reset in 2255 ms.
Product exploration explored 100000 steps with 33404 reset in 2591 ms.
Built C files in :
/tmp/ltsmin5598416392742432904
[2022-05-19 08:00:52] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5598416392742432904
Running compilation step : cd /tmp/ltsmin5598416392742432904;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5598416392742432904;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5598416392742432904;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 5 out of 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 61 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 08:00:55] [INFO ] Computed 900 place invariants in 10 ms
[2022-05-19 08:00:56] [INFO ] Implicit Places using invariants in 1179 ms returned []
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 08:00:56] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:00:58] [INFO ] Implicit Places using invariants and state equation in 1783 ms returned []
Implicit Place search using SMT with State Equation took 2964 ms to find 0 implicit places.
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 08:00:58] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:00:59] [INFO ] Dead Transitions using invariants and state equation in 1336 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2499/2499 places, 2400/2400 transitions.
Built C files in :
/tmp/ltsmin13816761231182163115
[2022-05-19 08:00:59] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13816761231182163115
Running compilation step : cd /tmp/ltsmin13816761231182163115;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13816761231182163115;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13816761231182163115;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 08:01:02] [INFO ] Flatten gal took : 87 ms
[2022-05-19 08:01:02] [INFO ] Flatten gal took : 87 ms
[2022-05-19 08:01:02] [INFO ] Time to serialize gal into /tmp/LTL4664055353641825039.gal : 8 ms
[2022-05-19 08:01:02] [INFO ] Time to serialize properties into /tmp/LTL3410349197663422242.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4664055353641825039.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3410349197663422242.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4664055...266
Read 1 LTL properties
Checking formula 0 : !((F(("(((p286==1)&&(p290==1))&&(p301==1))")U(!(F(G((!("((p983==1)&&(p997==1))"))U(X("(((p286==1)&&(p290==1))&&(p301==1))")))))))))
Formula 0 simplified : !F("(((p286==1)&&(p290==1))&&(p301==1))" U !FG(!"((p983==1)&&(p997==1))" U X"(((p286==1)&&(p290==1))&&(p301==1))"))
Detected timeout of ITS tools.
[2022-05-19 08:01:17] [INFO ] Flatten gal took : 91 ms
[2022-05-19 08:01:17] [INFO ] Applying decomposition
[2022-05-19 08:01:17] [INFO ] Flatten gal took : 92 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14033177354633065881.txt' '-o' '/tmp/graph14033177354633065881.bin' '-w' '/tmp/graph14033177354633065881.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14033177354633065881.bin' '-l' '-1' '-v' '-w' '/tmp/graph14033177354633065881.weights' '-q' '0' '-e' '0.001'
[2022-05-19 08:01:18] [INFO ] Decomposing Gal with order
[2022-05-19 08:01:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 08:01:18] [INFO ] Removed a total of 1597 redundant transitions.
[2022-05-19 08:01:18] [INFO ] Flatten gal took : 133 ms
[2022-05-19 08:01:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 1548 labels/synchronizations in 19 ms.
[2022-05-19 08:01:18] [INFO ] Time to serialize gal into /tmp/LTL8533775905503050129.gal : 14 ms
[2022-05-19 08:01:18] [INFO ] Time to serialize properties into /tmp/LTL8407893858084649865.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8533775905503050129.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8407893858084649865.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8533775...245
Read 1 LTL properties
Checking formula 0 : !((F(("(((i5.i1.i0.u103.p286==1)&&(i5.i1.i0.u105.p290==1))&&(i5.i1.i2.u108.p301==1))")U(!(F(G((!("((i17.i2.i2.u354.p983==1)&&(i17.i2.i...266
Formula 0 simplified : !F("(((i5.i1.i0.u103.p286==1)&&(i5.i1.i0.u105.p290==1))&&(i5.i1.i2.u108.p301==1))" U !FG(!"((i17.i2.i2.u354.p983==1)&&(i17.i2.i2.u35...252
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1920439861116326312
[2022-05-19 08:01:33] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1920439861116326312
Running compilation step : cd /tmp/ltsmin1920439861116326312;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1920439861116326312;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1920439861116326312;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldIIPs-PT-100A-LTLFireability-06 finished in 138007 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a CL insensitive property : ShieldIIPs-PT-100A-LTLFireability-13
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SLCL_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 28 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 12 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 298 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 08:01:37] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:01:39] [INFO ] Implicit Places using invariants in 2226 ms returned []
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 08:01:39] [INFO ] Computed 900 place invariants in 3 ms
[2022-05-19 08:01:41] [INFO ] Implicit Places using invariants and state equation in 1624 ms returned []
Implicit Place search using SMT with State Equation took 3889 ms to find 0 implicit places.
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 08:01:41] [INFO ] Computed 900 place invariants in 3 ms
[2022-05-19 08:01:42] [INFO ] Dead Transitions using invariants and state equation in 1297 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 2499/2503 places, 2400/2403 transitions.
Finished structural reductions, in 1 iterations. Remains : 2499/2503 places, 2400/2403 transitions.
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-13 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 s206 1) (EQ s208 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22 reset in 1270 ms.
Product exploration explored 100000 steps with 21 reset in 1657 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 121174 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 121174 steps, saw 112760 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
[2022-05-19 08:01:48] [INFO ] Computed 900 place invariants in 10 ms
[2022-05-19 08:01:49] [INFO ] [Real]Absence check using 900 positive place invariants in 151 ms returned sat
[2022-05-19 08:01:50] [INFO ] After 1095ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 08:01:50] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 0 ms to minimize.
[2022-05-19 08:01:50] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2022-05-19 08:01:50] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2022-05-19 08:01:50] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2022-05-19 08:01:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 630 ms
[2022-05-19 08:01:51] [INFO ] After 1787ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:01:51] [INFO ] After 2339ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:01:51] [INFO ] [Nat]Absence check using 900 positive place invariants in 151 ms returned sat
[2022-05-19 08:01:52] [INFO ] After 1082ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:01:52] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 0 ms to minimize.
[2022-05-19 08:01:52] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2022-05-19 08:01:53] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2022-05-19 08:01:53] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2022-05-19 08:01:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 612 ms
[2022-05-19 08:01:53] [INFO ] After 1754ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2022-05-19 08:01:53] [INFO ] After 2370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 41 ms.
Support contains 2 out of 2499 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Partial Free-agglomeration rule applied 598 times.
Drop transitions removed 598 transitions
Iterating global reduction 0 with 598 rules applied. Total rules applied 598 place count 2499 transition count 2400
Applied a total of 598 rules in 147 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2499/2499 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 173 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 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
Finished probabilistic random walk after 37623 steps, run visited all 1 properties in 579 ms. (steps per millisecond=64 )
Probabilistic random walk after 37623 steps, saw 36744 distinct states, run finished after 581 ms. (steps per millisecond=64 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 08:01:54] [INFO ] Computed 900 place invariants in 3 ms
[2022-05-19 08:01:58] [INFO ] [Real]Absence check using 900 positive place invariants in 994 ms returned sat
[2022-05-19 08:01:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 08:02:09] [INFO ] [Real]Absence check using state equation in 11284 ms returned sat
[2022-05-19 08:02:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 08:02:13] [INFO ] [Nat]Absence check using 900 positive place invariants in 722 ms returned sat
[2022-05-19 08:02:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 08:02:21] [INFO ] [Nat]Absence check using state equation in 8322 ms returned sat
[2022-05-19 08:02:21] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2022-05-19 08:02:22] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 0 ms to minimize.
[2022-05-19 08:02:22] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2022-05-19 08:02:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 939 ms
[2022-05-19 08:02:22] [INFO ] Computed and/alt/rep : 2399/5992/2399 causal constraints (skipped 0 transitions) in 222 ms.
[2022-05-19 08:02:24] [INFO ] Added : 65 causal constraints over 13 iterations in 2247 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 2 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 64 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 08:02:24] [INFO ] Computed 900 place invariants in 11 ms
[2022-05-19 08:02:26] [INFO ] Implicit Places using invariants in 1219 ms returned []
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 08:02:26] [INFO ] Computed 900 place invariants in 11 ms
[2022-05-19 08:02:27] [INFO ] Implicit Places using invariants and state equation in 1810 ms returned []
Implicit Place search using SMT with State Equation took 3032 ms to find 0 implicit places.
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 08:02:27] [INFO ] Computed 900 place invariants in 9 ms
[2022-05-19 08:02:29] [INFO ] Dead Transitions using invariants and state equation in 1301 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 122377 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122377 steps, saw 113786 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
[2022-05-19 08:02:32] [INFO ] Computed 900 place invariants in 10 ms
[2022-05-19 08:02:33] [INFO ] [Real]Absence check using 900 positive place invariants in 163 ms returned sat
[2022-05-19 08:02:34] [INFO ] After 1164ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 08:02:34] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2022-05-19 08:02:34] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2022-05-19 08:02:34] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2022-05-19 08:02:35] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2022-05-19 08:02:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 592 ms
[2022-05-19 08:02:35] [INFO ] After 1818ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:02:35] [INFO ] After 2407ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:02:35] [INFO ] [Nat]Absence check using 900 positive place invariants in 163 ms returned sat
[2022-05-19 08:02:36] [INFO ] After 1168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:02:37] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 0 ms to minimize.
[2022-05-19 08:02:37] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2022-05-19 08:02:37] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2022-05-19 08:02:37] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2022-05-19 08:02:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 652 ms
[2022-05-19 08:02:37] [INFO ] After 1879ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2022-05-19 08:02:37] [INFO ] After 2556ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 42 ms.
Support contains 2 out of 2499 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2499/2499 places, 2400/2400 transitions.
Partial Free-agglomeration rule applied 598 times.
Drop transitions removed 598 transitions
Iterating global reduction 0 with 598 rules applied. Total rules applied 598 place count 2499 transition count 2400
Applied a total of 598 rules in 133 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2499/2499 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Finished probabilistic random walk after 37623 steps, run visited all 1 properties in 577 ms. (steps per millisecond=65 )
Probabilistic random walk after 37623 steps, saw 36744 distinct states, run finished after 579 ms. (steps per millisecond=64 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 08:02:39] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:02:42] [INFO ] [Real]Absence check using 900 positive place invariants in 1048 ms returned sat
[2022-05-19 08:02:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 08:02:54] [INFO ] [Real]Absence check using state equation in 11273 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21 reset in 1246 ms.
Product exploration explored 100000 steps with 22 reset in 1651 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 2499 places. Attempting structural reductions.
Starting structural reductions in SI_LTL 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.
[2022-05-19 08:02:57] [INFO ] Redundant transitions in 261 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
[2022-05-19 08:02:57] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:02:58] [INFO ] Dead Transitions using invariants and state equation in 1270 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/2499 places, 2399/2400 transitions.
Applied a total of 0 rules in 84 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2499/2499 places, 2399/2400 transitions.
Product exploration explored 100000 steps with 22 reset in 1241 ms.
Product exploration explored 100000 steps with 21 reset in 1585 ms.
Built C files in :
/tmp/ltsmin18177327806953251425
[2022-05-19 08:03:01] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18177327806953251425
Running compilation step : cd /tmp/ltsmin18177327806953251425;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18177327806953251425;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18177327806953251425;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 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 61 ms. Remains 2499 /2499 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 08:03:04] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:03:06] [INFO ] Implicit Places using invariants in 1285 ms returned []
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 08:03:06] [INFO ] Computed 900 place invariants in 4 ms
[2022-05-19 08:03:07] [INFO ] Implicit Places using invariants and state equation in 1652 ms returned []
Implicit Place search using SMT with State Equation took 2946 ms to find 0 implicit places.
// Phase 1: matrix 2400 rows 2499 cols
[2022-05-19 08:03:07] [INFO ] Computed 900 place invariants in 5 ms
[2022-05-19 08:03:09] [INFO ] Dead Transitions using invariants and state equation in 1218 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2499/2499 places, 2400/2400 transitions.
Built C files in :
/tmp/ltsmin13763747731898397194
[2022-05-19 08:03:09] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13763747731898397194
Running compilation step : cd /tmp/ltsmin13763747731898397194;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13763747731898397194;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13763747731898397194;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 08:03:12] [INFO ] Flatten gal took : 82 ms
[2022-05-19 08:03:12] [INFO ] Flatten gal took : 84 ms
[2022-05-19 08:03:12] [INFO ] Time to serialize gal into /tmp/LTL8772414291822416357.gal : 8 ms
[2022-05-19 08:03:12] [INFO ] Time to serialize properties into /tmp/LTL4964809411667342025.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8772414291822416357.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4964809411667342025.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8772414...266
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((p207==1)&&(p209==1))")))))
Formula 0 simplified : !XXF"((p207==1)&&(p209==1))"
Detected timeout of ITS tools.
[2022-05-19 08:03:27] [INFO ] Flatten gal took : 83 ms
[2022-05-19 08:03:27] [INFO ] Applying decomposition
[2022-05-19 08:03:27] [INFO ] Flatten gal took : 84 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18282825744261770658.txt' '-o' '/tmp/graph18282825744261770658.bin' '-w' '/tmp/graph18282825744261770658.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18282825744261770658.bin' '-l' '-1' '-v' '-w' '/tmp/graph18282825744261770658.weights' '-q' '0' '-e' '0.001'
[2022-05-19 08:03:27] [INFO ] Decomposing Gal with order
[2022-05-19 08:03:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 08:03:28] [INFO ] Removed a total of 1597 redundant transitions.
[2022-05-19 08:03:28] [INFO ] Flatten gal took : 121 ms
[2022-05-19 08:03:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 1540 labels/synchronizations in 18 ms.
[2022-05-19 08:03:28] [INFO ] Time to serialize gal into /tmp/LTL8677414423189198185.gal : 13 ms
[2022-05-19 08:03:28] [INFO ] Time to serialize properties into /tmp/LTL14262060596489995716.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8677414423189198185.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14262060596489995716.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8677414...246
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((i3.i1.i2.u74.p207==1)&&(i3.i1.i0.u75.p209==1))")))))
Formula 0 simplified : !XXF"((i3.i1.i2.u74.p207==1)&&(i3.i1.i0.u75.p209==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2390854480811838057
[2022-05-19 08:03:43] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2390854480811838057
Running compilation step : cd /tmp/ltsmin2390854480811838057;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2390854480811838057;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2390854480811838057;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldIIPs-PT-100A-LTLFireability-13 finished in 129562 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(X(G(X(X(F(p0))))))||F(p1)))))'
Found a CL insensitive property : ShieldIIPs-PT-100A-LTLFireability-15
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SLCL_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 19 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
Applied a total of 4 rules in 177 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 08:03:46] [INFO ] Computed 901 place invariants in 10 ms
[2022-05-19 08:03:47] [INFO ] Implicit Places using invariants in 1234 ms returned []
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 08:03:47] [INFO ] Computed 901 place invariants in 5 ms
[2022-05-19 08:03:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 08:03:49] [INFO ] Implicit Places using invariants and state equation in 1742 ms returned []
Implicit Place search using SMT with State Equation took 2976 ms to find 0 implicit places.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 08:03:49] [INFO ] Computed 901 place invariants in 12 ms
[2022-05-19 08:03:50] [INFO ] Dead Transitions using invariants and state equation in 1234 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 2501/2503 places, 2401/2403 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2503 places, 2401/2403 transitions.
Running random walk in product with property : ShieldIIPs-PT-100A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s2139 1) (EQ s2160 1)), p0:(EQ s1272 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 153 reset in 1332 ms.
Product exploration explored 100000 steps with 153 reset in 1660 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 p1) p0), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 2283 steps, including 0 resets, run visited all 2 properties in 35 ms. (steps per millisecond=65 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 199 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 2501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 67 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 08:03:54] [INFO ] Computed 901 place invariants in 13 ms
[2022-05-19 08:03:55] [INFO ] Implicit Places using invariants in 1165 ms returned []
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 08:03:55] [INFO ] Computed 901 place invariants in 9 ms
[2022-05-19 08:03:56] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-19 08:03:57] [INFO ] Implicit Places using invariants and state equation in 1677 ms returned []
Implicit Place search using SMT with State Equation took 2842 ms to find 0 implicit places.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 08:03:57] [INFO ] Computed 901 place invariants in 12 ms
[2022-05-19 08:03:58] [INFO ] Dead Transitions using invariants and state equation in 1236 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 2401/2401 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 p1) p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 206 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 2325 steps, including 0 resets, run visited all 2 properties in 38 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 257 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 151 reset in 1319 ms.
Product exploration explored 100000 steps with 152 reset in 1699 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 78 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2022-05-19 08:04:03] [INFO ] Redundant transitions in 258 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
[2022-05-19 08:04:03] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 08:04:04] [INFO ] Dead Transitions using invariants and state equation in 1255 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2501 places, 2400/2401 transitions.
Applied a total of 0 rules in 91 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2501/2501 places, 2400/2401 transitions.
Product exploration explored 100000 steps with 151 reset in 1226 ms.
Product exploration explored 100000 steps with 153 reset in 1649 ms.
Built C files in :
/tmp/ltsmin11216162672000829840
[2022-05-19 08:04:07] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11216162672000829840
Running compilation step : cd /tmp/ltsmin11216162672000829840;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11216162672000829840;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11216162672000829840;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 2501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 59 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2022-05-19 08:04:10] [INFO ] Computed 901 place invariants in 4 ms
[2022-05-19 08:04:13] [INFO ] Implicit Places using invariants in 2824 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2841 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 60 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2500/2501 places, 2401/2401 transitions.
Built C files in :
/tmp/ltsmin3724900407844694285
[2022-05-19 08:04:13] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3724900407844694285
Running compilation step : cd /tmp/ltsmin3724900407844694285;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3724900407844694285;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3724900407844694285;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 08:04:16] [INFO ] Flatten gal took : 140 ms
[2022-05-19 08:04:17] [INFO ] Flatten gal took : 141 ms
[2022-05-19 08:04:17] [INFO ] Time to serialize gal into /tmp/LTL13204275986986071121.gal : 18 ms
[2022-05-19 08:04:17] [INFO ] Time to serialize properties into /tmp/LTL3901474246793023552.ltl : 247 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13204275986986071121.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3901474246793023552.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1320427...267
Read 1 LTL properties
Checking formula 0 : !((X(F((G(X(G(X(X(F("(p1272==0)")))))))||(F("((p2139==1)&&(p2160==1))"))))))
Formula 0 simplified : !XF(GXGXXF"(p1272==0)" | F"((p2139==1)&&(p2160==1))")
Detected timeout of ITS tools.
[2022-05-19 08:04:32] [INFO ] Flatten gal took : 137 ms
[2022-05-19 08:04:32] [INFO ] Applying decomposition
[2022-05-19 08:04:32] [INFO ] Flatten gal took : 145 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12127084485053845063.txt' '-o' '/tmp/graph12127084485053845063.bin' '-w' '/tmp/graph12127084485053845063.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12127084485053845063.bin' '-l' '-1' '-v' '-w' '/tmp/graph12127084485053845063.weights' '-q' '0' '-e' '0.001'
[2022-05-19 08:04:32] [INFO ] Decomposing Gal with order
[2022-05-19 08:04:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 08:04:33] [INFO ] Removed a total of 1597 redundant transitions.
[2022-05-19 08:04:33] [INFO ] Flatten gal took : 138 ms
[2022-05-19 08:04:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 1560 labels/synchronizations in 161 ms.
[2022-05-19 08:04:33] [INFO ] Time to serialize gal into /tmp/LTL18230889186325880478.gal : 20 ms
[2022-05-19 08:04:33] [INFO ] Time to serialize properties into /tmp/LTL4262763713856227367.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18230889186325880478.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4262763713856227367.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1823088...246
Read 1 LTL properties
Checking formula 0 : !((X(F((G(X(G(X(X(F("(i21.i0.i1.u458.p1272==0)")))))))||(F("((i36.i1.i0.u771.p2139==1)&&(i37.i0.i1.u778.p2160==1))"))))))
Formula 0 simplified : !XF(GXGXXF"(i21.i0.i1.u458.p1272==0)" | F"((i36.i1.i0.u771.p2139==1)&&(i37.i0.i1.u778.p2160==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin259297311529672328
[2022-05-19 08:04:48] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin259297311529672328
Running compilation step : cd /tmp/ltsmin259297311529672328;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin259297311529672328;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin259297311529672328;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldIIPs-PT-100A-LTLFireability-15 finished in 65383 ms.
[2022-05-19 08:04:51] [INFO ] Flatten gal took : 141 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin61375541453448498
[2022-05-19 08:04:51] [INFO ] Too many transitions (2403) to apply POR reductions. Disabling POR matrices.
[2022-05-19 08:04:51] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin61375541453448498
Running compilation step : cd /tmp/ltsmin61375541453448498;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-19 08:04:51] [INFO ] Applying decomposition
[2022-05-19 08:04:52] [INFO ] Flatten gal took : 287 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5590496337163666550.txt' '-o' '/tmp/graph5590496337163666550.bin' '-w' '/tmp/graph5590496337163666550.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5590496337163666550.bin' '-l' '-1' '-v' '-w' '/tmp/graph5590496337163666550.weights' '-q' '0' '-e' '0.001'
[2022-05-19 08:04:52] [INFO ] Decomposing Gal with order
[2022-05-19 08:04:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 08:04:53] [INFO ] Removed a total of 1600 redundant transitions.
[2022-05-19 08:04:53] [INFO ] Flatten gal took : 264 ms
[2022-05-19 08:04:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 1560 labels/synchronizations in 323 ms.
[2022-05-19 08:04:53] [INFO ] Time to serialize gal into /tmp/LTLFireability4580865128912543276.gal : 34 ms
[2022-05-19 08:04:53] [INFO ] Time to serialize properties into /tmp/LTLFireability16301390959377000939.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4580865128912543276.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16301390959377000939.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 5 LTL properties
Checking formula 0 : !(((X(G(X(X("(((i41.i1.i1.u859.p2386==0)||(i41.i1.i1.u861.p2390==0))||(i41.i1.i0.u864.p2402==0))")))))||(F(G((G("(((i37.i1.i0.u769.p21...286
Formula 0 simplified : !(XGXX"(((i41.i1.i1.u859.p2386==0)||(i41.i1.i1.u861.p2390==0))||(i41.i1.i0.u864.p2402==0))" | FG(G"(((i37.i1.i0.u769.p2136==0)||(i37...266
Compilation finished in 7984 ms.
Running link step : cd /tmp/ltsmin61375541453448498;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin61375541453448498;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X([](X(X((LTLAPp0==true)))))||<>([](([]((LTLAPp1==true))||[]((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin61375541453448498;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X([](X(X((LTLAPp0==true)))))||<>([](([]((LTLAPp1==true))||[]((LTLAPp2==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin61375541453448498;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp3==true))||<>([](<>(X([]((LTLAPp4==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin61375541453448498;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp3==true))||<>([](<>(X([]((LTLAPp4==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin61375541453448498;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp5==true) U !<>([]((!(LTLAPp6==true) U X((LTLAPp5==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 08:32:39] [INFO ] Applying decomposition
[2022-05-19 08:32:39] [INFO ] Flatten gal took : 633 ms
[2022-05-19 08:32:39] [INFO ] Decomposing Gal with order
[2022-05-19 08:32:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 08:32:41] [INFO ] Removed a total of 1700 redundant transitions.
[2022-05-19 08:32:41] [INFO ] Flatten gal took : 668 ms
[2022-05-19 08:32:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 726 ms.
[2022-05-19 08:32:42] [INFO ] Time to serialize gal into /tmp/LTLFireability9607414958142472876.gal : 86 ms
[2022-05-19 08:32:42] [INFO ] Time to serialize properties into /tmp/LTLFireability16580044911198948539.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9607414958142472876.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16580044911198948539.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 5 LTL properties
Checking formula 0 : !(((X(G(X(X("(((u956.p2386==0)||(u958.p2390==0))||(u961.p2402==0))")))))||(F(G((G("(((u856.p2136==0)||(u858.p2140==0))||(u861.p2151==0...206
Formula 0 simplified : !(XGXX"(((u956.p2386==0)||(u958.p2390==0))||(u961.p2402==0))" | FG(G"(((u856.p2136==0)||(u858.p2140==0))||(u861.p2151==0))" | G"((u3...186
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin61375541453448498;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp5==true) U !<>([]((!(LTLAPp6==true) U X((LTLAPp5==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin61375541453448498;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>((LTLAPp7==true))))' '--buchi-type=spotba'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="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-4028"
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 r222-tall-165286024800164"
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 ;