About the Execution of ITS-Tools for PolyORBNT-COL-S10J80
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16220.647 | 3600000.00 | 10986536.00 | 44779.40 | FF??FTTFTFFFTTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r293-tall-167873945800707.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is PolyORBNT-COL-S10J80, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945800707
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 9.1K Feb 26 01:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 01:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 00:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 00:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 03:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 03:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Feb 26 02:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 95K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-00
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-01
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-02
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-03
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-04
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-05
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-06
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-07
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-08
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-09
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-10
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-11
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-12
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-13
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-14
FORMULA_NAME PolyORBNT-COL-S10J80-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678946251567
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J80
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202303021504
[2023-03-16 05:57:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 05:57:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 05:57:33] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-16 05:57:33] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 05:57:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 480 ms
[2023-03-16 05:57:33] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1694 PT places and 13742.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-16 05:57:33] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 12 ms.
[2023-03-16 05:57:33] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PolyORBNT-COL-S10J80-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10008 steps, including 573 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 22) seen :13
Incomplete Best-First random walk after 10001 steps, including 188 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10000 steps, including 324 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 203 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 181 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 259 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 193 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 200 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 202 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 38 rows 48 cols
[2023-03-16 05:57:35] [INFO ] Computed 13 place invariants in 11 ms
[2023-03-16 05:57:35] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-16 05:57:35] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-16 05:57:35] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:4
[2023-03-16 05:57:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 05:57:35] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 05:57:35] [INFO ] After 91ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 7 atomic propositions for a total of 12 simplifications.
FORMULA PolyORBNT-COL-S10J80-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J80-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-16 05:57:35] [INFO ] Flatten gal took : 24 ms
[2023-03-16 05:57:35] [INFO ] Flatten gal took : 8 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-16 05:57:35] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 13580 transitions 119919 arcs in 214 ms.
[2023-03-16 05:57:35] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Deduced a syphon composed of 80 places in 38 ms
Reduce places removed 80 places and 80 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 351 out of 1614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 3390/3390 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1604 transition count 3390
Applied a total of 10 rules in 217 ms. Remains 1604 /1614 variables (removed 10) and now considering 3390/3390 (removed 0) transitions.
[2023-03-16 05:57:36] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
// Phase 1: matrix 3381 rows 1604 cols
[2023-03-16 05:57:36] [INFO ] Computed 182 place invariants in 228 ms
[2023-03-16 05:57:39] [INFO ] Dead Transitions using invariants and state equation in 2951 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2023-03-16 05:57:39] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
// Phase 1: matrix 2766 rows 1604 cols
[2023-03-16 05:57:39] [INFO ] Computed 182 place invariants in 128 ms
[2023-03-16 05:57:40] [INFO ] Implicit Places using invariants in 1345 ms returned []
[2023-03-16 05:57:40] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
[2023-03-16 05:57:40] [INFO ] Invariant cache hit.
[2023-03-16 05:57:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:57:48] [INFO ] Implicit Places using invariants and state equation in 7530 ms returned []
Implicit Place search using SMT with State Equation took 8881 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1604/1614 places, 2775/3390 transitions.
Applied a total of 0 rules in 100 ms. Remains 1604 /1604 variables (removed 0) and now considering 2775/2775 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12156 ms. Remains : 1604/1614 places, 2775/3390 transitions.
Support contains 351 out of 1604 places after structural reductions.
[2023-03-16 05:57:48] [INFO ] Flatten gal took : 239 ms
[2023-03-16 05:57:48] [INFO ] Flatten gal took : 145 ms
[2023-03-16 05:57:49] [INFO ] Input system was already deterministic with 2775 transitions.
Incomplete random walk after 10000 steps, including 561 resets, run finished after 459 ms. (steps per millisecond=21 ) properties (out of 19) seen :3
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :10
Running SMT prover for 6 properties.
[2023-03-16 05:57:49] [INFO ] Flow matrix only has 2766 transitions (discarded 9 similar events)
[2023-03-16 05:57:49] [INFO ] Invariant cache hit.
[2023-03-16 05:57:50] [INFO ] [Real]Absence check using 176 positive place invariants in 51 ms returned sat
[2023-03-16 05:57:50] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 36 ms returned sat
[2023-03-16 05:57:50] [INFO ] After 441ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2023-03-16 05:57:50] [INFO ] [Nat]Absence check using 176 positive place invariants in 56 ms returned sat
[2023-03-16 05:57:50] [INFO ] [Nat]Absence check using 176 positive and 6 generalized place invariants in 36 ms returned sat
[2023-03-16 05:58:08] [INFO ] After 17382ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :1
[2023-03-16 05:58:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:58:08] [INFO ] After 117ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :4 sat :1
[2023-03-16 05:58:08] [INFO ] After 321ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :1
Attempting to minimize the solution found.
Minimization took 123 ms.
[2023-03-16 05:58:08] [INFO ] After 18275ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :1
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 1604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 1604 transition count 2689
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 172 place count 1518 transition count 2689
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 172 place count 1518 transition count 2604
Deduced a syphon composed of 85 places in 2 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 342 place count 1433 transition count 2604
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 343 place count 1432 transition count 2603
Iterating global reduction 2 with 1 rules applied. Total rules applied 344 place count 1432 transition count 2603
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 348 place count 1430 transition count 2601
Applied a total of 348 rules in 407 ms. Remains 1430 /1604 variables (removed 174) and now considering 2601/2775 (removed 174) transitions.
[2023-03-16 05:58:08] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2023-03-16 05:58:09] [INFO ] Computed 182 place invariants in 69 ms
[2023-03-16 05:58:10] [INFO ] Dead Transitions using invariants and state equation in 1397 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1808 ms. Remains : 1430/1604 places, 2601/2775 transitions.
Finished random walk after 1007 steps, including 77 resets, run visited all 2 properties in 19 ms. (steps per millisecond=53 )
FORMULA PolyORBNT-COL-S10J80-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 8 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U p1)))'
Support contains 3 out of 1604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 1604 transition count 2689
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 172 place count 1518 transition count 2689
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 172 place count 1518 transition count 2605
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 340 place count 1434 transition count 2605
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 341 place count 1433 transition count 2604
Iterating global reduction 2 with 1 rules applied. Total rules applied 342 place count 1433 transition count 2604
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 346 place count 1431 transition count 2602
Applied a total of 346 rules in 391 ms. Remains 1431 /1604 variables (removed 173) and now considering 2602/2775 (removed 173) transitions.
[2023-03-16 05:58:12] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2023-03-16 05:58:12] [INFO ] Computed 182 place invariants in 63 ms
[2023-03-16 05:58:13] [INFO ] Dead Transitions using invariants and state equation in 1474 ms found 0 transitions.
[2023-03-16 05:58:13] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-16 05:58:13] [INFO ] Invariant cache hit.
[2023-03-16 05:58:14] [INFO ] Implicit Places using invariants in 1422 ms returned []
[2023-03-16 05:58:14] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-16 05:58:14] [INFO ] Invariant cache hit.
[2023-03-16 05:58:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:58:24] [INFO ] Implicit Places using invariants and state equation in 9108 ms returned []
Implicit Place search using SMT with State Equation took 10533 ms to find 0 implicit places.
[2023-03-16 05:58:24] [INFO ] Redundant transitions in 131 ms returned []
[2023-03-16 05:58:24] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-16 05:58:24] [INFO ] Invariant cache hit.
[2023-03-16 05:58:25] [INFO ] Dead Transitions using invariants and state equation in 1479 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1431/1604 places, 2602/2775 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14031 ms. Remains : 1431/1604 places, 2602/2775 transitions.
Stuttering acceptance computed with spot in 1153 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 3 s1429), p0:(LEQ s82 s83)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-COL-S10J80-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J80-LTLCardinality-00 finished in 15255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 3 out of 1604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 1604 transition count 2690
Reduce places removed 85 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 86 rules applied. Total rules applied 171 place count 1519 transition count 2689
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 172 place count 1518 transition count 2689
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 172 place count 1518 transition count 2605
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 340 place count 1434 transition count 2605
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 341 place count 1433 transition count 2604
Iterating global reduction 3 with 1 rules applied. Total rules applied 342 place count 1433 transition count 2604
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 346 place count 1431 transition count 2602
Applied a total of 346 rules in 282 ms. Remains 1431 /1604 variables (removed 173) and now considering 2602/2775 (removed 173) transitions.
[2023-03-16 05:58:27] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2023-03-16 05:58:27] [INFO ] Computed 182 place invariants in 61 ms
[2023-03-16 05:58:28] [INFO ] Dead Transitions using invariants and state equation in 1412 ms found 0 transitions.
[2023-03-16 05:58:28] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-16 05:58:28] [INFO ] Invariant cache hit.
[2023-03-16 05:58:30] [INFO ] Implicit Places using invariants in 1445 ms returned []
[2023-03-16 05:58:30] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-16 05:58:30] [INFO ] Invariant cache hit.
[2023-03-16 05:58:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:58:41] [INFO ] Implicit Places using invariants and state equation in 11263 ms returned []
Implicit Place search using SMT with State Equation took 12722 ms to find 0 implicit places.
[2023-03-16 05:58:41] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-16 05:58:41] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-16 05:58:41] [INFO ] Invariant cache hit.
[2023-03-16 05:58:42] [INFO ] Dead Transitions using invariants and state equation in 1451 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1431/1604 places, 2602/2775 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15929 ms. Remains : 1431/1604 places, 2602/2775 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1429 s497), p1:(GT 1 s414)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7965 reset in 1216 ms.
Product exploration explored 100000 steps with 7961 reset in 1197 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 188 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 695 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 05:58:45] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-16 05:58:45] [INFO ] Invariant cache hit.
[2023-03-16 05:58:45] [INFO ] [Real]Absence check using 175 positive place invariants in 46 ms returned sat
[2023-03-16 05:58:46] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 32 ms returned sat
[2023-03-16 05:58:46] [INFO ] After 1036ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 05:58:47] [INFO ] [Nat]Absence check using 175 positive place invariants in 46 ms returned sat
[2023-03-16 05:58:47] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-16 05:58:48] [INFO ] After 1170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 05:58:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:58:48] [INFO ] After 427ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 05:58:50] [INFO ] Deduced a trap composed of 582 places in 654 ms of which 1 ms to minimize.
[2023-03-16 05:58:50] [INFO ] Deduced a trap composed of 526 places in 693 ms of which 2 ms to minimize.
[2023-03-16 05:58:52] [INFO ] Deduced a trap composed of 600 places in 613 ms of which 2 ms to minimize.
[2023-03-16 05:58:53] [INFO ] Deduced a trap composed of 597 places in 611 ms of which 12 ms to minimize.
[2023-03-16 05:58:53] [INFO ] Deduced a trap composed of 591 places in 590 ms of which 1 ms to minimize.
[2023-03-16 05:58:54] [INFO ] Deduced a trap composed of 621 places in 600 ms of which 1 ms to minimize.
[2023-03-16 05:58:55] [INFO ] Deduced a trap composed of 591 places in 593 ms of which 2 ms to minimize.
[2023-03-16 05:58:55] [INFO ] Deduced a trap composed of 615 places in 594 ms of which 1 ms to minimize.
[2023-03-16 05:58:56] [INFO ] Deduced a trap composed of 594 places in 596 ms of which 1 ms to minimize.
[2023-03-16 05:58:57] [INFO ] Deduced a trap composed of 621 places in 580 ms of which 1 ms to minimize.
[2023-03-16 05:58:58] [INFO ] Deduced a trap composed of 591 places in 594 ms of which 1 ms to minimize.
[2023-03-16 05:58:58] [INFO ] Deduced a trap composed of 618 places in 588 ms of which 1 ms to minimize.
[2023-03-16 05:58:59] [INFO ] Deduced a trap composed of 600 places in 587 ms of which 1 ms to minimize.
[2023-03-16 05:59:00] [INFO ] Deduced a trap composed of 606 places in 603 ms of which 1 ms to minimize.
[2023-03-16 05:59:00] [INFO ] Deduced a trap composed of 609 places in 592 ms of which 1 ms to minimize.
[2023-03-16 05:59:01] [INFO ] Deduced a trap composed of 603 places in 596 ms of which 1 ms to minimize.
[2023-03-16 05:59:02] [INFO ] Deduced a trap composed of 606 places in 588 ms of which 1 ms to minimize.
[2023-03-16 05:59:02] [INFO ] Deduced a trap composed of 606 places in 589 ms of which 1 ms to minimize.
[2023-03-16 05:59:03] [INFO ] Deduced a trap composed of 615 places in 602 ms of which 1 ms to minimize.
[2023-03-16 05:59:04] [INFO ] Deduced a trap composed of 606 places in 606 ms of which 1 ms to minimize.
[2023-03-16 05:59:05] [INFO ] Deduced a trap composed of 597 places in 608 ms of which 1 ms to minimize.
[2023-03-16 05:59:05] [INFO ] Deduced a trap composed of 588 places in 599 ms of which 1 ms to minimize.
[2023-03-16 05:59:06] [INFO ] Deduced a trap composed of 591 places in 614 ms of which 1 ms to minimize.
[2023-03-16 05:59:07] [INFO ] Deduced a trap composed of 621 places in 594 ms of which 1 ms to minimize.
[2023-03-16 05:59:07] [INFO ] Deduced a trap composed of 615 places in 611 ms of which 1 ms to minimize.
[2023-03-16 05:59:08] [INFO ] Deduced a trap composed of 594 places in 600 ms of which 1 ms to minimize.
[2023-03-16 05:59:09] [INFO ] Deduced a trap composed of 594 places in 604 ms of which 4 ms to minimize.
[2023-03-16 05:59:10] [INFO ] Deduced a trap composed of 600 places in 611 ms of which 1 ms to minimize.
[2023-03-16 05:59:10] [INFO ] Deduced a trap composed of 609 places in 600 ms of which 1 ms to minimize.
[2023-03-16 05:59:11] [INFO ] Deduced a trap composed of 591 places in 600 ms of which 1 ms to minimize.
[2023-03-16 05:59:12] [INFO ] Deduced a trap composed of 603 places in 611 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 05:59:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 05:59:12] [INFO ] After 25341ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 1431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 82 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2023-03-16 05:59:12] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-16 05:59:12] [INFO ] Invariant cache hit.
[2023-03-16 05:59:13] [INFO ] Dead Transitions using invariants and state equation in 1466 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1549 ms. Remains : 1431/1431 places, 2602/2602 transitions.
Incomplete random walk after 10000 steps, including 728 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 237190 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 237190 steps, saw 39587 distinct states, run finished after 3002 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 05:59:16] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-16 05:59:16] [INFO ] Invariant cache hit.
[2023-03-16 05:59:17] [INFO ] [Real]Absence check using 175 positive place invariants in 43 ms returned sat
[2023-03-16 05:59:17] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 31 ms returned sat
[2023-03-16 05:59:17] [INFO ] After 1059ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 05:59:18] [INFO ] [Nat]Absence check using 175 positive place invariants in 43 ms returned sat
[2023-03-16 05:59:18] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-16 05:59:19] [INFO ] After 1191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 05:59:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:59:19] [INFO ] After 423ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 05:59:21] [INFO ] Deduced a trap composed of 582 places in 602 ms of which 1 ms to minimize.
[2023-03-16 05:59:21] [INFO ] Deduced a trap composed of 526 places in 671 ms of which 1 ms to minimize.
[2023-03-16 05:59:23] [INFO ] Deduced a trap composed of 600 places in 621 ms of which 5 ms to minimize.
[2023-03-16 05:59:24] [INFO ] Deduced a trap composed of 597 places in 587 ms of which 1 ms to minimize.
[2023-03-16 05:59:24] [INFO ] Deduced a trap composed of 591 places in 603 ms of which 1 ms to minimize.
[2023-03-16 05:59:25] [INFO ] Deduced a trap composed of 621 places in 596 ms of which 1 ms to minimize.
[2023-03-16 05:59:26] [INFO ] Deduced a trap composed of 591 places in 606 ms of which 1 ms to minimize.
[2023-03-16 05:59:26] [INFO ] Deduced a trap composed of 615 places in 601 ms of which 2 ms to minimize.
[2023-03-16 05:59:27] [INFO ] Deduced a trap composed of 594 places in 606 ms of which 2 ms to minimize.
[2023-03-16 05:59:28] [INFO ] Deduced a trap composed of 621 places in 606 ms of which 1 ms to minimize.
[2023-03-16 05:59:29] [INFO ] Deduced a trap composed of 591 places in 600 ms of which 1 ms to minimize.
[2023-03-16 05:59:29] [INFO ] Deduced a trap composed of 618 places in 612 ms of which 1 ms to minimize.
[2023-03-16 05:59:30] [INFO ] Deduced a trap composed of 600 places in 609 ms of which 1 ms to minimize.
[2023-03-16 05:59:31] [INFO ] Deduced a trap composed of 606 places in 621 ms of which 1 ms to minimize.
[2023-03-16 05:59:31] [INFO ] Deduced a trap composed of 609 places in 597 ms of which 1 ms to minimize.
[2023-03-16 05:59:32] [INFO ] Deduced a trap composed of 603 places in 612 ms of which 1 ms to minimize.
[2023-03-16 05:59:33] [INFO ] Deduced a trap composed of 606 places in 609 ms of which 1 ms to minimize.
[2023-03-16 05:59:34] [INFO ] Deduced a trap composed of 606 places in 644 ms of which 1 ms to minimize.
[2023-03-16 05:59:34] [INFO ] Deduced a trap composed of 615 places in 617 ms of which 1 ms to minimize.
[2023-03-16 05:59:35] [INFO ] Deduced a trap composed of 606 places in 614 ms of which 1 ms to minimize.
[2023-03-16 05:59:36] [INFO ] Deduced a trap composed of 597 places in 609 ms of which 1 ms to minimize.
[2023-03-16 05:59:37] [INFO ] Deduced a trap composed of 588 places in 619 ms of which 1 ms to minimize.
[2023-03-16 05:59:37] [INFO ] Deduced a trap composed of 591 places in 588 ms of which 1 ms to minimize.
[2023-03-16 05:59:38] [INFO ] Deduced a trap composed of 621 places in 594 ms of which 1 ms to minimize.
[2023-03-16 05:59:39] [INFO ] Deduced a trap composed of 615 places in 605 ms of which 4 ms to minimize.
[2023-03-16 05:59:39] [INFO ] Deduced a trap composed of 594 places in 597 ms of which 1 ms to minimize.
[2023-03-16 05:59:40] [INFO ] Deduced a trap composed of 594 places in 593 ms of which 1 ms to minimize.
[2023-03-16 05:59:41] [INFO ] Deduced a trap composed of 600 places in 581 ms of which 1 ms to minimize.
[2023-03-16 05:59:41] [INFO ] Deduced a trap composed of 609 places in 582 ms of which 1 ms to minimize.
[2023-03-16 05:59:42] [INFO ] Deduced a trap composed of 591 places in 587 ms of which 1 ms to minimize.
[2023-03-16 05:59:43] [INFO ] Deduced a trap composed of 603 places in 606 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 05:59:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 05:59:43] [INFO ] After 25435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 1431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 86 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 1431/1431 places, 2602/2602 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 99 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2023-03-16 05:59:43] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-16 05:59:43] [INFO ] Invariant cache hit.
[2023-03-16 05:59:45] [INFO ] Implicit Places using invariants in 1424 ms returned []
[2023-03-16 05:59:45] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-16 05:59:45] [INFO ] Invariant cache hit.
[2023-03-16 05:59:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 05:59:55] [INFO ] Implicit Places using invariants and state equation in 10408 ms returned []
Implicit Place search using SMT with State Equation took 11837 ms to find 0 implicit places.
[2023-03-16 05:59:55] [INFO ] Redundant transitions in 146 ms returned []
[2023-03-16 05:59:55] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-16 05:59:55] [INFO ] Invariant cache hit.
[2023-03-16 05:59:56] [INFO ] Dead Transitions using invariants and state equation in 1335 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13444 ms. Remains : 1431/1431 places, 2602/2602 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1431 transition count 2593
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 1431 transition count 2592
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 1430 transition count 2592
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1430 transition count 2591
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 1429 transition count 2591
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 1429 transition count 2581
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 1419 transition count 2581
Applied a total of 33 rules in 322 ms. Remains 1419 /1431 variables (removed 12) and now considering 2581/2602 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2581 rows 1419 cols
[2023-03-16 05:59:57] [INFO ] Computed 182 place invariants in 53 ms
[2023-03-16 05:59:57] [INFO ] [Real]Absence check using 175 positive place invariants in 39 ms returned sat
[2023-03-16 05:59:57] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 36 ms returned sat
[2023-03-16 05:59:58] [INFO ] After 1215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 05:59:58] [INFO ] [Nat]Absence check using 175 positive place invariants in 39 ms returned sat
[2023-03-16 05:59:58] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-16 05:59:59] [INFO ] After 1028ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 06:00:00] [INFO ] Deduced a trap composed of 589 places in 638 ms of which 1 ms to minimize.
[2023-03-16 06:00:01] [INFO ] Deduced a trap composed of 592 places in 546 ms of which 3 ms to minimize.
[2023-03-16 06:00:02] [INFO ] Deduced a trap composed of 616 places in 562 ms of which 1 ms to minimize.
[2023-03-16 06:00:02] [INFO ] Deduced a trap composed of 604 places in 615 ms of which 3 ms to minimize.
[2023-03-16 06:00:03] [INFO ] Deduced a trap composed of 616 places in 548 ms of which 1 ms to minimize.
[2023-03-16 06:00:03] [INFO ] Deduced a trap composed of 601 places in 533 ms of which 2 ms to minimize.
[2023-03-16 06:00:04] [INFO ] Deduced a trap composed of 601 places in 560 ms of which 6 ms to minimize.
[2023-03-16 06:00:05] [INFO ] Deduced a trap composed of 592 places in 554 ms of which 1 ms to minimize.
[2023-03-16 06:00:05] [INFO ] Deduced a trap composed of 595 places in 550 ms of which 1 ms to minimize.
[2023-03-16 06:00:06] [INFO ] Deduced a trap composed of 598 places in 561 ms of which 1 ms to minimize.
[2023-03-16 06:00:07] [INFO ] Deduced a trap composed of 619 places in 548 ms of which 1 ms to minimize.
[2023-03-16 06:00:07] [INFO ] Deduced a trap composed of 607 places in 546 ms of which 2 ms to minimize.
[2023-03-16 06:00:08] [INFO ] Deduced a trap composed of 589 places in 548 ms of which 1 ms to minimize.
[2023-03-16 06:00:08] [INFO ] Deduced a trap composed of 601 places in 542 ms of which 1 ms to minimize.
[2023-03-16 06:00:09] [INFO ] Deduced a trap composed of 592 places in 553 ms of which 2 ms to minimize.
[2023-03-16 06:00:10] [INFO ] Deduced a trap composed of 595 places in 607 ms of which 2 ms to minimize.
[2023-03-16 06:00:10] [INFO ] Deduced a trap composed of 598 places in 600 ms of which 1 ms to minimize.
[2023-03-16 06:00:11] [INFO ] Deduced a trap composed of 592 places in 546 ms of which 2 ms to minimize.
[2023-03-16 06:00:12] [INFO ] Deduced a trap composed of 613 places in 601 ms of which 2 ms to minimize.
[2023-03-16 06:00:12] [INFO ] Deduced a trap composed of 607 places in 554 ms of which 1 ms to minimize.
[2023-03-16 06:00:13] [INFO ] Deduced a trap composed of 589 places in 543 ms of which 1 ms to minimize.
[2023-03-16 06:00:14] [INFO ] Deduced a trap composed of 592 places in 552 ms of which 1 ms to minimize.
[2023-03-16 06:00:14] [INFO ] Deduced a trap composed of 610 places in 531 ms of which 1 ms to minimize.
[2023-03-16 06:00:15] [INFO ] Deduced a trap composed of 601 places in 542 ms of which 1 ms to minimize.
[2023-03-16 06:00:15] [INFO ] Deduced a trap composed of 604 places in 532 ms of which 2 ms to minimize.
[2023-03-16 06:00:16] [INFO ] Deduced a trap composed of 592 places in 554 ms of which 1 ms to minimize.
[2023-03-16 06:00:17] [INFO ] Deduced a trap composed of 592 places in 543 ms of which 1 ms to minimize.
[2023-03-16 06:00:17] [INFO ] Deduced a trap composed of 598 places in 547 ms of which 1 ms to minimize.
[2023-03-16 06:00:18] [INFO ] Deduced a trap composed of 583 places in 552 ms of which 1 ms to minimize.
[2023-03-16 06:00:19] [INFO ] Deduced a trap composed of 592 places in 545 ms of which 2 ms to minimize.
[2023-03-16 06:00:19] [INFO ] Deduced a trap composed of 598 places in 547 ms of which 1 ms to minimize.
[2023-03-16 06:00:20] [INFO ] Deduced a trap composed of 607 places in 544 ms of which 1 ms to minimize.
[2023-03-16 06:00:20] [INFO ] Deduced a trap composed of 607 places in 544 ms of which 1 ms to minimize.
[2023-03-16 06:00:21] [INFO ] Deduced a trap composed of 613 places in 544 ms of which 2 ms to minimize.
[2023-03-16 06:00:22] [INFO ] Deduced a trap composed of 613 places in 553 ms of which 1 ms to minimize.
[2023-03-16 06:00:22] [INFO ] Deduced a trap composed of 592 places in 543 ms of which 1 ms to minimize.
[2023-03-16 06:00:23] [INFO ] Deduced a trap composed of 607 places in 541 ms of which 1 ms to minimize.
[2023-03-16 06:00:24] [INFO ] Deduced a trap composed of 601 places in 552 ms of which 1 ms to minimize.
[2023-03-16 06:00:24] [INFO ] Deduced a trap composed of 625 places in 543 ms of which 1 ms to minimize.
[2023-03-16 06:00:25] [INFO ] Deduced a trap composed of 577 places in 547 ms of which 1 ms to minimize.
[2023-03-16 06:00:25] [INFO ] Deduced a trap composed of 589 places in 570 ms of which 1 ms to minimize.
[2023-03-16 06:00:26] [INFO ] Deduced a trap composed of 601 places in 552 ms of which 1 ms to minimize.
[2023-03-16 06:00:27] [INFO ] Deduced a trap composed of 601 places in 555 ms of which 1 ms to minimize.
[2023-03-16 06:00:27] [INFO ] Deduced a trap composed of 610 places in 556 ms of which 2 ms to minimize.
[2023-03-16 06:00:28] [INFO ] Deduced a trap composed of 610 places in 561 ms of which 1 ms to minimize.
[2023-03-16 06:00:29] [INFO ] Deduced a trap composed of 598 places in 551 ms of which 1 ms to minimize.
[2023-03-16 06:00:29] [INFO ] Deduced a trap composed of 586 places in 563 ms of which 1 ms to minimize.
[2023-03-16 06:00:30] [INFO ] Deduced a trap composed of 598 places in 567 ms of which 1 ms to minimize.
[2023-03-16 06:00:31] [INFO ] Deduced a trap composed of 619 places in 563 ms of which 1 ms to minimize.
[2023-03-16 06:00:31] [INFO ] Deduced a trap composed of 604 places in 557 ms of which 1 ms to minimize.
[2023-03-16 06:00:32] [INFO ] Deduced a trap composed of 604 places in 547 ms of which 1 ms to minimize.
[2023-03-16 06:00:32] [INFO ] Deduced a trap composed of 601 places in 550 ms of which 2 ms to minimize.
[2023-03-16 06:00:33] [INFO ] Deduced a trap composed of 622 places in 568 ms of which 1 ms to minimize.
[2023-03-16 06:00:34] [INFO ] Deduced a trap composed of 610 places in 569 ms of which 1 ms to minimize.
[2023-03-16 06:00:34] [INFO ] Deduced a trap composed of 613 places in 560 ms of which 1 ms to minimize.
[2023-03-16 06:00:35] [INFO ] Deduced a trap composed of 604 places in 561 ms of which 1 ms to minimize.
[2023-03-16 06:00:36] [INFO ] Deduced a trap composed of 598 places in 569 ms of which 2 ms to minimize.
[2023-03-16 06:00:36] [INFO ] Deduced a trap composed of 598 places in 561 ms of which 2 ms to minimize.
[2023-03-16 06:00:37] [INFO ] Deduced a trap composed of 616 places in 564 ms of which 1 ms to minimize.
[2023-03-16 06:00:38] [INFO ] Deduced a trap composed of 598 places in 552 ms of which 1 ms to minimize.
[2023-03-16 06:00:38] [INFO ] Deduced a trap composed of 601 places in 565 ms of which 1 ms to minimize.
[2023-03-16 06:00:39] [INFO ] Deduced a trap composed of 601 places in 570 ms of which 1 ms to minimize.
[2023-03-16 06:00:40] [INFO ] Deduced a trap composed of 592 places in 556 ms of which 1 ms to minimize.
[2023-03-16 06:00:40] [INFO ] Deduced a trap composed of 613 places in 573 ms of which 2 ms to minimize.
[2023-03-16 06:00:41] [INFO ] Deduced a trap composed of 598 places in 574 ms of which 2 ms to minimize.
[2023-03-16 06:00:42] [INFO ] Deduced a trap composed of 580 places in 562 ms of which 1 ms to minimize.
[2023-03-16 06:00:42] [INFO ] Deduced a trap composed of 604 places in 559 ms of which 1 ms to minimize.
[2023-03-16 06:00:43] [INFO ] Deduced a trap composed of 595 places in 556 ms of which 1 ms to minimize.
[2023-03-16 06:00:43] [INFO ] Deduced a trap composed of 595 places in 555 ms of which 1 ms to minimize.
[2023-03-16 06:00:44] [INFO ] Deduced a trap composed of 613 places in 562 ms of which 1 ms to minimize.
[2023-03-16 06:00:45] [INFO ] Deduced a trap composed of 601 places in 553 ms of which 1 ms to minimize.
[2023-03-16 06:00:45] [INFO ] Deduced a trap composed of 601 places in 552 ms of which 1 ms to minimize.
[2023-03-16 06:00:46] [INFO ] Deduced a trap composed of 613 places in 552 ms of which 1 ms to minimize.
[2023-03-16 06:00:47] [INFO ] Deduced a trap composed of 580 places in 559 ms of which 1 ms to minimize.
[2023-03-16 06:00:47] [INFO ] Deduced a trap composed of 595 places in 563 ms of which 1 ms to minimize.
[2023-03-16 06:00:48] [INFO ] Deduced a trap composed of 613 places in 565 ms of which 1 ms to minimize.
[2023-03-16 06:00:49] [INFO ] Deduced a trap composed of 601 places in 554 ms of which 1 ms to minimize.
[2023-03-16 06:00:49] [INFO ] Deduced a trap composed of 595 places in 546 ms of which 1 ms to minimize.
[2023-03-16 06:00:50] [INFO ] Deduced a trap composed of 613 places in 557 ms of which 1 ms to minimize.
[2023-03-16 06:00:50] [INFO ] Deduced a trap composed of 604 places in 556 ms of which 2 ms to minimize.
[2023-03-16 06:00:51] [INFO ] Deduced a trap composed of 610 places in 557 ms of which 1 ms to minimize.
[2023-03-16 06:00:52] [INFO ] Deduced a trap composed of 598 places in 552 ms of which 2 ms to minimize.
[2023-03-16 06:00:52] [INFO ] Deduced a trap composed of 604 places in 557 ms of which 1 ms to minimize.
[2023-03-16 06:00:53] [INFO ] Deduced a trap composed of 607 places in 556 ms of which 1 ms to minimize.
[2023-03-16 06:00:54] [INFO ] Deduced a trap composed of 604 places in 563 ms of which 1 ms to minimize.
[2023-03-16 06:00:54] [INFO ] Deduced a trap composed of 598 places in 542 ms of which 1 ms to minimize.
[2023-03-16 06:00:55] [INFO ] Deduced a trap composed of 592 places in 560 ms of which 1 ms to minimize.
[2023-03-16 06:00:56] [INFO ] Deduced a trap composed of 592 places in 551 ms of which 1 ms to minimize.
[2023-03-16 06:00:56] [INFO ] Deduced a trap composed of 586 places in 555 ms of which 1 ms to minimize.
[2023-03-16 06:00:57] [INFO ] Deduced a trap composed of 598 places in 566 ms of which 2 ms to minimize.
[2023-03-16 06:00:58] [INFO ] Deduced a trap composed of 598 places in 552 ms of which 1 ms to minimize.
[2023-03-16 06:00:58] [INFO ] Deduced a trap composed of 610 places in 562 ms of which 2 ms to minimize.
[2023-03-16 06:00:59] [INFO ] Deduced a trap composed of 613 places in 565 ms of which 1 ms to minimize.
[2023-03-16 06:00:59] [INFO ] Deduced a trap composed of 589 places in 565 ms of which 1 ms to minimize.
[2023-03-16 06:01:00] [INFO ] Deduced a trap composed of 601 places in 572 ms of which 2 ms to minimize.
[2023-03-16 06:01:01] [INFO ] Deduced a trap composed of 595 places in 545 ms of which 1 ms to minimize.
[2023-03-16 06:01:01] [INFO ] Deduced a trap composed of 610 places in 555 ms of which 1 ms to minimize.
[2023-03-16 06:01:02] [INFO ] Deduced a trap composed of 604 places in 551 ms of which 2 ms to minimize.
[2023-03-16 06:01:03] [INFO ] Deduced a trap composed of 604 places in 550 ms of which 1 ms to minimize.
[2023-03-16 06:01:03] [INFO ] Deduced a trap composed of 610 places in 560 ms of which 1 ms to minimize.
[2023-03-16 06:01:04] [INFO ] Deduced a trap composed of 601 places in 604 ms of which 1 ms to minimize.
[2023-03-16 06:01:05] [INFO ] Deduced a trap composed of 589 places in 613 ms of which 1 ms to minimize.
[2023-03-16 06:01:05] [INFO ] Deduced a trap composed of 604 places in 610 ms of which 1 ms to minimize.
[2023-03-16 06:01:07] [INFO ] Deduced a trap composed of 592 places in 549 ms of which 1 ms to minimize.
[2023-03-16 06:01:08] [INFO ] Deduced a trap composed of 583 places in 550 ms of which 1 ms to minimize.
[2023-03-16 06:01:08] [INFO ] Deduced a trap composed of 592 places in 551 ms of which 1 ms to minimize.
[2023-03-16 06:01:09] [INFO ] Deduced a trap composed of 598 places in 559 ms of which 1 ms to minimize.
[2023-03-16 06:01:10] [INFO ] Deduced a trap composed of 601 places in 554 ms of which 1 ms to minimize.
[2023-03-16 06:01:10] [INFO ] Deduced a trap composed of 595 places in 535 ms of which 1 ms to minimize.
[2023-03-16 06:01:11] [INFO ] Deduced a trap composed of 607 places in 555 ms of which 1 ms to minimize.
[2023-03-16 06:01:13] [INFO ] Deduced a trap composed of 601 places in 564 ms of which 1 ms to minimize.
[2023-03-16 06:01:23] [INFO ] Deduced a trap composed of 622 places in 567 ms of which 2 ms to minimize.
[2023-03-16 06:01:23] [INFO ] Deduced a trap composed of 583 places in 562 ms of which 1 ms to minimize.
[2023-03-16 06:01:24] [INFO ] Deduced a trap composed of 619 places in 579 ms of which 2 ms to minimize.
[2023-03-16 06:01:24] [INFO ] Deduced a trap composed of 610 places in 559 ms of which 1 ms to minimize.
[2023-03-16 06:01:25] [INFO ] Deduced a trap composed of 610 places in 565 ms of which 1 ms to minimize.
[2023-03-16 06:01:26] [INFO ] Deduced a trap composed of 604 places in 566 ms of which 1 ms to minimize.
[2023-03-16 06:01:26] [INFO ] Deduced a trap composed of 595 places in 558 ms of which 1 ms to minimize.
[2023-03-16 06:03:43] [INFO ] Trap strengthening (SAT) tested/added 118/118 trap constraints in 223480 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 06:03:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 06:03:43] [INFO ] After 225019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1431 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 83 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2023-03-16 06:03:43] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2023-03-16 06:03:44] [INFO ] Computed 182 place invariants in 61 ms
[2023-03-16 06:03:45] [INFO ] Dead Transitions using invariants and state equation in 1447 ms found 0 transitions.
[2023-03-16 06:03:45] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-16 06:03:45] [INFO ] Invariant cache hit.
[2023-03-16 06:03:46] [INFO ] Implicit Places using invariants in 1416 ms returned []
[2023-03-16 06:03:46] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-16 06:03:46] [INFO ] Invariant cache hit.
[2023-03-16 06:03:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:03:57] [INFO ] Implicit Places using invariants and state equation in 10250 ms returned []
Implicit Place search using SMT with State Equation took 11668 ms to find 0 implicit places.
[2023-03-16 06:03:57] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-16 06:03:57] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-16 06:03:57] [INFO ] Invariant cache hit.
[2023-03-16 06:03:58] [INFO ] Dead Transitions using invariants and state equation in 1381 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14651 ms. Remains : 1431/1431 places, 2602/2602 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 168 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 701 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 06:03:58] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-16 06:03:58] [INFO ] Invariant cache hit.
[2023-03-16 06:03:59] [INFO ] [Real]Absence check using 175 positive place invariants in 42 ms returned sat
[2023-03-16 06:03:59] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 31 ms returned sat
[2023-03-16 06:04:00] [INFO ] After 1036ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 06:04:00] [INFO ] [Nat]Absence check using 175 positive place invariants in 45 ms returned sat
[2023-03-16 06:04:00] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 32 ms returned sat
[2023-03-16 06:04:01] [INFO ] After 1212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 06:04:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:04:01] [INFO ] After 442ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 06:04:03] [INFO ] Deduced a trap composed of 582 places in 579 ms of which 2 ms to minimize.
[2023-03-16 06:04:04] [INFO ] Deduced a trap composed of 526 places in 674 ms of which 1 ms to minimize.
[2023-03-16 06:04:05] [INFO ] Deduced a trap composed of 600 places in 600 ms of which 1 ms to minimize.
[2023-03-16 06:04:06] [INFO ] Deduced a trap composed of 597 places in 594 ms of which 2 ms to minimize.
[2023-03-16 06:04:07] [INFO ] Deduced a trap composed of 591 places in 600 ms of which 1 ms to minimize.
[2023-03-16 06:04:07] [INFO ] Deduced a trap composed of 621 places in 593 ms of which 2 ms to minimize.
[2023-03-16 06:04:08] [INFO ] Deduced a trap composed of 591 places in 596 ms of which 1 ms to minimize.
[2023-03-16 06:04:09] [INFO ] Deduced a trap composed of 615 places in 590 ms of which 1 ms to minimize.
[2023-03-16 06:04:09] [INFO ] Deduced a trap composed of 594 places in 592 ms of which 1 ms to minimize.
[2023-03-16 06:04:10] [INFO ] Deduced a trap composed of 621 places in 593 ms of which 1 ms to minimize.
[2023-03-16 06:04:11] [INFO ] Deduced a trap composed of 591 places in 588 ms of which 1 ms to minimize.
[2023-03-16 06:04:11] [INFO ] Deduced a trap composed of 618 places in 600 ms of which 1 ms to minimize.
[2023-03-16 06:04:12] [INFO ] Deduced a trap composed of 600 places in 608 ms of which 1 ms to minimize.
[2023-03-16 06:04:13] [INFO ] Deduced a trap composed of 606 places in 592 ms of which 1 ms to minimize.
[2023-03-16 06:04:14] [INFO ] Deduced a trap composed of 609 places in 626 ms of which 1 ms to minimize.
[2023-03-16 06:04:14] [INFO ] Deduced a trap composed of 603 places in 609 ms of which 1 ms to minimize.
[2023-03-16 06:04:15] [INFO ] Deduced a trap composed of 606 places in 611 ms of which 1 ms to minimize.
[2023-03-16 06:04:16] [INFO ] Deduced a trap composed of 606 places in 624 ms of which 1 ms to minimize.
[2023-03-16 06:04:16] [INFO ] Deduced a trap composed of 615 places in 602 ms of which 1 ms to minimize.
[2023-03-16 06:04:17] [INFO ] Deduced a trap composed of 606 places in 606 ms of which 1 ms to minimize.
[2023-03-16 06:04:18] [INFO ] Deduced a trap composed of 597 places in 598 ms of which 1 ms to minimize.
[2023-03-16 06:04:19] [INFO ] Deduced a trap composed of 588 places in 588 ms of which 1 ms to minimize.
[2023-03-16 06:04:19] [INFO ] Deduced a trap composed of 591 places in 604 ms of which 1 ms to minimize.
[2023-03-16 06:04:20] [INFO ] Deduced a trap composed of 621 places in 605 ms of which 1 ms to minimize.
[2023-03-16 06:04:21] [INFO ] Deduced a trap composed of 615 places in 609 ms of which 1 ms to minimize.
[2023-03-16 06:04:21] [INFO ] Deduced a trap composed of 594 places in 609 ms of which 1 ms to minimize.
[2023-03-16 06:04:22] [INFO ] Deduced a trap composed of 594 places in 593 ms of which 1 ms to minimize.
[2023-03-16 06:04:23] [INFO ] Deduced a trap composed of 600 places in 594 ms of which 1 ms to minimize.
[2023-03-16 06:04:24] [INFO ] Deduced a trap composed of 609 places in 612 ms of which 1 ms to minimize.
[2023-03-16 06:04:24] [INFO ] Deduced a trap composed of 591 places in 615 ms of which 1 ms to minimize.
[2023-03-16 06:04:25] [INFO ] Deduced a trap composed of 603 places in 611 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 06:04:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 06:04:25] [INFO ] After 25505ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 1431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 75 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2023-03-16 06:04:25] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-16 06:04:25] [INFO ] Invariant cache hit.
[2023-03-16 06:04:26] [INFO ] Dead Transitions using invariants and state equation in 1365 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1441 ms. Remains : 1431/1431 places, 2602/2602 transitions.
Incomplete random walk after 10000 steps, including 707 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 243280 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 243280 steps, saw 40478 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 06:04:30] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-16 06:04:30] [INFO ] Invariant cache hit.
[2023-03-16 06:04:30] [INFO ] [Real]Absence check using 175 positive place invariants in 45 ms returned sat
[2023-03-16 06:04:30] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 31 ms returned sat
[2023-03-16 06:04:31] [INFO ] After 1028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 06:04:31] [INFO ] [Nat]Absence check using 175 positive place invariants in 44 ms returned sat
[2023-03-16 06:04:31] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 40 ms returned sat
[2023-03-16 06:04:32] [INFO ] After 1210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 06:04:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:04:33] [INFO ] After 429ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 06:04:34] [INFO ] Deduced a trap composed of 582 places in 596 ms of which 1 ms to minimize.
[2023-03-16 06:04:35] [INFO ] Deduced a trap composed of 526 places in 653 ms of which 1 ms to minimize.
[2023-03-16 06:04:36] [INFO ] Deduced a trap composed of 600 places in 599 ms of which 1 ms to minimize.
[2023-03-16 06:04:37] [INFO ] Deduced a trap composed of 597 places in 590 ms of which 1 ms to minimize.
[2023-03-16 06:04:38] [INFO ] Deduced a trap composed of 591 places in 587 ms of which 1 ms to minimize.
[2023-03-16 06:04:38] [INFO ] Deduced a trap composed of 621 places in 609 ms of which 1 ms to minimize.
[2023-03-16 06:04:39] [INFO ] Deduced a trap composed of 591 places in 582 ms of which 1 ms to minimize.
[2023-03-16 06:04:40] [INFO ] Deduced a trap composed of 615 places in 576 ms of which 1 ms to minimize.
[2023-03-16 06:04:40] [INFO ] Deduced a trap composed of 594 places in 592 ms of which 1 ms to minimize.
[2023-03-16 06:04:41] [INFO ] Deduced a trap composed of 621 places in 587 ms of which 1 ms to minimize.
[2023-03-16 06:04:42] [INFO ] Deduced a trap composed of 591 places in 581 ms of which 1 ms to minimize.
[2023-03-16 06:04:42] [INFO ] Deduced a trap composed of 618 places in 587 ms of which 1 ms to minimize.
[2023-03-16 06:04:43] [INFO ] Deduced a trap composed of 600 places in 600 ms of which 2 ms to minimize.
[2023-03-16 06:04:44] [INFO ] Deduced a trap composed of 606 places in 592 ms of which 1 ms to minimize.
[2023-03-16 06:04:44] [INFO ] Deduced a trap composed of 609 places in 608 ms of which 1 ms to minimize.
[2023-03-16 06:04:45] [INFO ] Deduced a trap composed of 603 places in 602 ms of which 1 ms to minimize.
[2023-03-16 06:04:46] [INFO ] Deduced a trap composed of 606 places in 612 ms of which 1 ms to minimize.
[2023-03-16 06:04:47] [INFO ] Deduced a trap composed of 606 places in 595 ms of which 2 ms to minimize.
[2023-03-16 06:04:47] [INFO ] Deduced a trap composed of 615 places in 614 ms of which 1 ms to minimize.
[2023-03-16 06:04:48] [INFO ] Deduced a trap composed of 606 places in 599 ms of which 1 ms to minimize.
[2023-03-16 06:04:49] [INFO ] Deduced a trap composed of 597 places in 596 ms of which 1 ms to minimize.
[2023-03-16 06:04:49] [INFO ] Deduced a trap composed of 588 places in 589 ms of which 1 ms to minimize.
[2023-03-16 06:04:50] [INFO ] Deduced a trap composed of 591 places in 591 ms of which 1 ms to minimize.
[2023-03-16 06:04:51] [INFO ] Deduced a trap composed of 621 places in 587 ms of which 1 ms to minimize.
[2023-03-16 06:04:52] [INFO ] Deduced a trap composed of 615 places in 581 ms of which 1 ms to minimize.
[2023-03-16 06:04:52] [INFO ] Deduced a trap composed of 594 places in 586 ms of which 1 ms to minimize.
[2023-03-16 06:04:53] [INFO ] Deduced a trap composed of 594 places in 584 ms of which 1 ms to minimize.
[2023-03-16 06:04:54] [INFO ] Deduced a trap composed of 600 places in 596 ms of which 1 ms to minimize.
[2023-03-16 06:04:54] [INFO ] Deduced a trap composed of 609 places in 569 ms of which 1 ms to minimize.
[2023-03-16 06:04:55] [INFO ] Deduced a trap composed of 591 places in 590 ms of which 1 ms to minimize.
[2023-03-16 06:04:56] [INFO ] Deduced a trap composed of 603 places in 585 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 06:04:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 06:04:56] [INFO ] After 25098ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 1431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 74 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 1431/1431 places, 2602/2602 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 77 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2023-03-16 06:04:56] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-16 06:04:56] [INFO ] Invariant cache hit.
[2023-03-16 06:04:57] [INFO ] Implicit Places using invariants in 1431 ms returned []
[2023-03-16 06:04:57] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-16 06:04:57] [INFO ] Invariant cache hit.
[2023-03-16 06:04:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:05:07] [INFO ] Implicit Places using invariants and state equation in 9934 ms returned []
Implicit Place search using SMT with State Equation took 11366 ms to find 0 implicit places.
[2023-03-16 06:05:07] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-16 06:05:07] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-16 06:05:07] [INFO ] Invariant cache hit.
[2023-03-16 06:05:09] [INFO ] Dead Transitions using invariants and state equation in 1362 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12868 ms. Remains : 1431/1431 places, 2602/2602 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1431 transition count 2593
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 1431 transition count 2592
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 1430 transition count 2592
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1430 transition count 2591
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 1429 transition count 2591
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 1429 transition count 2581
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 1419 transition count 2581
Applied a total of 33 rules in 295 ms. Remains 1419 /1431 variables (removed 12) and now considering 2581/2602 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2581 rows 1419 cols
[2023-03-16 06:05:09] [INFO ] Computed 182 place invariants in 68 ms
[2023-03-16 06:05:09] [INFO ] [Real]Absence check using 175 positive place invariants in 44 ms returned sat
[2023-03-16 06:05:09] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 31 ms returned sat
[2023-03-16 06:05:10] [INFO ] After 1282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 06:05:11] [INFO ] [Nat]Absence check using 175 positive place invariants in 42 ms returned sat
[2023-03-16 06:05:11] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 31 ms returned sat
[2023-03-16 06:05:12] [INFO ] After 1066ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 06:05:13] [INFO ] Deduced a trap composed of 589 places in 604 ms of which 1 ms to minimize.
[2023-03-16 06:05:13] [INFO ] Deduced a trap composed of 592 places in 560 ms of which 2 ms to minimize.
[2023-03-16 06:05:14] [INFO ] Deduced a trap composed of 616 places in 555 ms of which 1 ms to minimize.
[2023-03-16 06:05:14] [INFO ] Deduced a trap composed of 604 places in 576 ms of which 1 ms to minimize.
[2023-03-16 06:05:15] [INFO ] Deduced a trap composed of 616 places in 561 ms of which 1 ms to minimize.
[2023-03-16 06:05:16] [INFO ] Deduced a trap composed of 601 places in 569 ms of which 2 ms to minimize.
[2023-03-16 06:05:16] [INFO ] Deduced a trap composed of 601 places in 571 ms of which 1 ms to minimize.
[2023-03-16 06:05:17] [INFO ] Deduced a trap composed of 592 places in 567 ms of which 1 ms to minimize.
[2023-03-16 06:05:18] [INFO ] Deduced a trap composed of 595 places in 552 ms of which 2 ms to minimize.
[2023-03-16 06:05:18] [INFO ] Deduced a trap composed of 598 places in 556 ms of which 1 ms to minimize.
[2023-03-16 06:05:19] [INFO ] Deduced a trap composed of 619 places in 545 ms of which 2 ms to minimize.
[2023-03-16 06:05:20] [INFO ] Deduced a trap composed of 607 places in 561 ms of which 2 ms to minimize.
[2023-03-16 06:05:20] [INFO ] Deduced a trap composed of 589 places in 567 ms of which 5 ms to minimize.
[2023-03-16 06:05:21] [INFO ] Deduced a trap composed of 601 places in 545 ms of which 1 ms to minimize.
[2023-03-16 06:05:22] [INFO ] Deduced a trap composed of 592 places in 566 ms of which 2 ms to minimize.
[2023-03-16 06:05:22] [INFO ] Deduced a trap composed of 595 places in 553 ms of which 2 ms to minimize.
[2023-03-16 06:05:23] [INFO ] Deduced a trap composed of 598 places in 555 ms of which 1 ms to minimize.
[2023-03-16 06:05:23] [INFO ] Deduced a trap composed of 592 places in 563 ms of which 1 ms to minimize.
[2023-03-16 06:05:24] [INFO ] Deduced a trap composed of 613 places in 563 ms of which 1 ms to minimize.
[2023-03-16 06:05:25] [INFO ] Deduced a trap composed of 607 places in 555 ms of which 1 ms to minimize.
[2023-03-16 06:05:25] [INFO ] Deduced a trap composed of 589 places in 555 ms of which 1 ms to minimize.
[2023-03-16 06:05:26] [INFO ] Deduced a trap composed of 592 places in 554 ms of which 1 ms to minimize.
[2023-03-16 06:05:27] [INFO ] Deduced a trap composed of 610 places in 563 ms of which 1 ms to minimize.
[2023-03-16 06:05:27] [INFO ] Deduced a trap composed of 601 places in 551 ms of which 1 ms to minimize.
[2023-03-16 06:05:28] [INFO ] Deduced a trap composed of 604 places in 549 ms of which 1 ms to minimize.
[2023-03-16 06:05:28] [INFO ] Deduced a trap composed of 592 places in 552 ms of which 1 ms to minimize.
[2023-03-16 06:05:29] [INFO ] Deduced a trap composed of 592 places in 567 ms of which 1 ms to minimize.
[2023-03-16 06:05:30] [INFO ] Deduced a trap composed of 598 places in 567 ms of which 1 ms to minimize.
[2023-03-16 06:05:30] [INFO ] Deduced a trap composed of 583 places in 555 ms of which 1 ms to minimize.
[2023-03-16 06:05:31] [INFO ] Deduced a trap composed of 592 places in 542 ms of which 2 ms to minimize.
[2023-03-16 06:05:32] [INFO ] Deduced a trap composed of 598 places in 554 ms of which 2 ms to minimize.
[2023-03-16 06:05:32] [INFO ] Deduced a trap composed of 607 places in 543 ms of which 1 ms to minimize.
[2023-03-16 06:05:33] [INFO ] Deduced a trap composed of 607 places in 546 ms of which 1 ms to minimize.
[2023-03-16 06:05:34] [INFO ] Deduced a trap composed of 613 places in 549 ms of which 1 ms to minimize.
[2023-03-16 06:05:34] [INFO ] Deduced a trap composed of 613 places in 561 ms of which 1 ms to minimize.
[2023-03-16 06:05:35] [INFO ] Deduced a trap composed of 592 places in 553 ms of which 2 ms to minimize.
[2023-03-16 06:05:35] [INFO ] Deduced a trap composed of 607 places in 539 ms of which 1 ms to minimize.
[2023-03-16 06:05:36] [INFO ] Deduced a trap composed of 601 places in 545 ms of which 1 ms to minimize.
[2023-03-16 06:05:37] [INFO ] Deduced a trap composed of 625 places in 549 ms of which 1 ms to minimize.
[2023-03-16 06:05:37] [INFO ] Deduced a trap composed of 577 places in 546 ms of which 2 ms to minimize.
[2023-03-16 06:05:38] [INFO ] Deduced a trap composed of 589 places in 557 ms of which 1 ms to minimize.
[2023-03-16 06:05:39] [INFO ] Deduced a trap composed of 601 places in 548 ms of which 1 ms to minimize.
[2023-03-16 06:05:39] [INFO ] Deduced a trap composed of 601 places in 549 ms of which 2 ms to minimize.
[2023-03-16 06:05:40] [INFO ] Deduced a trap composed of 610 places in 550 ms of which 1 ms to minimize.
[2023-03-16 06:05:40] [INFO ] Deduced a trap composed of 610 places in 557 ms of which 1 ms to minimize.
[2023-03-16 06:05:41] [INFO ] Deduced a trap composed of 598 places in 559 ms of which 1 ms to minimize.
[2023-03-16 06:05:42] [INFO ] Deduced a trap composed of 586 places in 554 ms of which 1 ms to minimize.
[2023-03-16 06:05:42] [INFO ] Deduced a trap composed of 598 places in 548 ms of which 1 ms to minimize.
[2023-03-16 06:05:43] [INFO ] Deduced a trap composed of 619 places in 554 ms of which 1 ms to minimize.
[2023-03-16 06:05:44] [INFO ] Deduced a trap composed of 604 places in 558 ms of which 1 ms to minimize.
[2023-03-16 06:05:44] [INFO ] Deduced a trap composed of 604 places in 567 ms of which 1 ms to minimize.
[2023-03-16 06:05:45] [INFO ] Deduced a trap composed of 601 places in 539 ms of which 1 ms to minimize.
[2023-03-16 06:05:46] [INFO ] Deduced a trap composed of 622 places in 549 ms of which 1 ms to minimize.
[2023-03-16 06:05:46] [INFO ] Deduced a trap composed of 610 places in 565 ms of which 1 ms to minimize.
[2023-03-16 06:05:47] [INFO ] Deduced a trap composed of 613 places in 554 ms of which 1 ms to minimize.
[2023-03-16 06:05:47] [INFO ] Deduced a trap composed of 604 places in 552 ms of which 1 ms to minimize.
[2023-03-16 06:05:48] [INFO ] Deduced a trap composed of 598 places in 565 ms of which 2 ms to minimize.
[2023-03-16 06:05:49] [INFO ] Deduced a trap composed of 598 places in 546 ms of which 1 ms to minimize.
[2023-03-16 06:05:49] [INFO ] Deduced a trap composed of 616 places in 551 ms of which 1 ms to minimize.
[2023-03-16 06:05:50] [INFO ] Deduced a trap composed of 598 places in 566 ms of which 1 ms to minimize.
[2023-03-16 06:05:51] [INFO ] Deduced a trap composed of 601 places in 550 ms of which 1 ms to minimize.
[2023-03-16 06:05:51] [INFO ] Deduced a trap composed of 601 places in 549 ms of which 1 ms to minimize.
[2023-03-16 06:05:52] [INFO ] Deduced a trap composed of 592 places in 556 ms of which 1 ms to minimize.
[2023-03-16 06:05:53] [INFO ] Deduced a trap composed of 613 places in 560 ms of which 1 ms to minimize.
[2023-03-16 06:05:53] [INFO ] Deduced a trap composed of 598 places in 547 ms of which 1 ms to minimize.
[2023-03-16 06:05:54] [INFO ] Deduced a trap composed of 580 places in 550 ms of which 1 ms to minimize.
[2023-03-16 06:05:55] [INFO ] Deduced a trap composed of 604 places in 564 ms of which 2 ms to minimize.
[2023-03-16 06:05:55] [INFO ] Deduced a trap composed of 595 places in 562 ms of which 1 ms to minimize.
[2023-03-16 06:05:56] [INFO ] Deduced a trap composed of 595 places in 555 ms of which 1 ms to minimize.
[2023-03-16 06:05:56] [INFO ] Deduced a trap composed of 613 places in 560 ms of which 2 ms to minimize.
[2023-03-16 06:05:57] [INFO ] Deduced a trap composed of 601 places in 566 ms of which 1 ms to minimize.
[2023-03-16 06:05:58] [INFO ] Deduced a trap composed of 601 places in 570 ms of which 1 ms to minimize.
[2023-03-16 06:05:58] [INFO ] Deduced a trap composed of 613 places in 540 ms of which 1 ms to minimize.
[2023-03-16 06:05:59] [INFO ] Deduced a trap composed of 580 places in 554 ms of which 1 ms to minimize.
[2023-03-16 06:06:00] [INFO ] Deduced a trap composed of 595 places in 545 ms of which 1 ms to minimize.
[2023-03-16 06:06:00] [INFO ] Deduced a trap composed of 613 places in 555 ms of which 1 ms to minimize.
[2023-03-16 06:06:01] [INFO ] Deduced a trap composed of 601 places in 560 ms of which 2 ms to minimize.
[2023-03-16 06:06:02] [INFO ] Deduced a trap composed of 595 places in 553 ms of which 1 ms to minimize.
[2023-03-16 06:06:02] [INFO ] Deduced a trap composed of 613 places in 557 ms of which 1 ms to minimize.
[2023-03-16 06:06:03] [INFO ] Deduced a trap composed of 604 places in 542 ms of which 1 ms to minimize.
[2023-03-16 06:06:03] [INFO ] Deduced a trap composed of 610 places in 560 ms of which 1 ms to minimize.
[2023-03-16 06:06:04] [INFO ] Deduced a trap composed of 598 places in 539 ms of which 1 ms to minimize.
[2023-03-16 06:06:05] [INFO ] Deduced a trap composed of 604 places in 558 ms of which 1 ms to minimize.
[2023-03-16 06:06:05] [INFO ] Deduced a trap composed of 607 places in 568 ms of which 1 ms to minimize.
[2023-03-16 06:06:06] [INFO ] Deduced a trap composed of 604 places in 552 ms of which 1 ms to minimize.
[2023-03-16 06:06:07] [INFO ] Deduced a trap composed of 598 places in 549 ms of which 2 ms to minimize.
[2023-03-16 06:06:07] [INFO ] Deduced a trap composed of 592 places in 553 ms of which 1 ms to minimize.
[2023-03-16 06:06:08] [INFO ] Deduced a trap composed of 592 places in 554 ms of which 1 ms to minimize.
[2023-03-16 06:06:09] [INFO ] Deduced a trap composed of 586 places in 557 ms of which 1 ms to minimize.
[2023-03-16 06:06:09] [INFO ] Deduced a trap composed of 598 places in 568 ms of which 1 ms to minimize.
[2023-03-16 06:06:10] [INFO ] Deduced a trap composed of 598 places in 545 ms of which 1 ms to minimize.
[2023-03-16 06:06:11] [INFO ] Deduced a trap composed of 610 places in 544 ms of which 1 ms to minimize.
[2023-03-16 06:06:11] [INFO ] Deduced a trap composed of 613 places in 549 ms of which 2 ms to minimize.
[2023-03-16 06:06:12] [INFO ] Deduced a trap composed of 589 places in 549 ms of which 2 ms to minimize.
[2023-03-16 06:06:12] [INFO ] Deduced a trap composed of 601 places in 561 ms of which 1 ms to minimize.
[2023-03-16 06:06:13] [INFO ] Deduced a trap composed of 595 places in 558 ms of which 1 ms to minimize.
[2023-03-16 06:06:14] [INFO ] Deduced a trap composed of 610 places in 553 ms of which 1 ms to minimize.
[2023-03-16 06:06:14] [INFO ] Deduced a trap composed of 604 places in 565 ms of which 1 ms to minimize.
[2023-03-16 06:06:15] [INFO ] Deduced a trap composed of 604 places in 557 ms of which 1 ms to minimize.
[2023-03-16 06:06:16] [INFO ] Deduced a trap composed of 610 places in 563 ms of which 1 ms to minimize.
[2023-03-16 06:06:16] [INFO ] Deduced a trap composed of 601 places in 616 ms of which 1 ms to minimize.
[2023-03-16 06:06:17] [INFO ] Deduced a trap composed of 589 places in 625 ms of which 1 ms to minimize.
[2023-03-16 06:06:18] [INFO ] Deduced a trap composed of 604 places in 607 ms of which 1 ms to minimize.
[2023-03-16 06:06:19] [INFO ] Deduced a trap composed of 592 places in 563 ms of which 1 ms to minimize.
[2023-03-16 06:06:20] [INFO ] Deduced a trap composed of 583 places in 555 ms of which 1 ms to minimize.
[2023-03-16 06:06:21] [INFO ] Deduced a trap composed of 592 places in 559 ms of which 1 ms to minimize.
[2023-03-16 06:06:21] [INFO ] Deduced a trap composed of 598 places in 575 ms of which 1 ms to minimize.
[2023-03-16 06:06:22] [INFO ] Deduced a trap composed of 601 places in 570 ms of which 1 ms to minimize.
[2023-03-16 06:06:23] [INFO ] Deduced a trap composed of 595 places in 542 ms of which 1 ms to minimize.
[2023-03-16 06:06:23] [INFO ] Deduced a trap composed of 607 places in 553 ms of which 1 ms to minimize.
[2023-03-16 06:06:26] [INFO ] Deduced a trap composed of 601 places in 564 ms of which 1 ms to minimize.
[2023-03-16 06:06:35] [INFO ] Deduced a trap composed of 622 places in 565 ms of which 1 ms to minimize.
[2023-03-16 06:06:36] [INFO ] Deduced a trap composed of 583 places in 560 ms of which 1 ms to minimize.
[2023-03-16 06:06:36] [INFO ] Deduced a trap composed of 619 places in 554 ms of which 1 ms to minimize.
[2023-03-16 06:06:37] [INFO ] Deduced a trap composed of 610 places in 551 ms of which 2 ms to minimize.
[2023-03-16 06:06:38] [INFO ] Deduced a trap composed of 610 places in 556 ms of which 1 ms to minimize.
[2023-03-16 06:06:38] [INFO ] Deduced a trap composed of 604 places in 553 ms of which 1 ms to minimize.
[2023-03-16 06:06:39] [INFO ] Deduced a trap composed of 595 places in 556 ms of which 1 ms to minimize.
[2023-03-16 06:08:55] [INFO ] Trap strengthening (SAT) tested/added 118/118 trap constraints in 223423 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 06:08:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 06:08:55] [INFO ] After 225018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 240 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8001 reset in 1140 ms.
Product exploration explored 100000 steps with 8012 reset in 1173 ms.
Built C files in :
/tmp/ltsmin15330064757033542724
[2023-03-16 06:08:58] [INFO ] Too many transitions (2602) to apply POR reductions. Disabling POR matrices.
[2023-03-16 06:08:58] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15330064757033542724
Running compilation step : cd /tmp/ltsmin15330064757033542724;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15330064757033542724;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15330064757033542724;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 1431 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 81 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2023-03-16 06:09:01] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2023-03-16 06:09:01] [INFO ] Computed 182 place invariants in 62 ms
[2023-03-16 06:09:03] [INFO ] Dead Transitions using invariants and state equation in 1399 ms found 0 transitions.
[2023-03-16 06:09:03] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-16 06:09:03] [INFO ] Invariant cache hit.
[2023-03-16 06:09:04] [INFO ] Implicit Places using invariants in 1440 ms returned []
[2023-03-16 06:09:04] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-16 06:09:04] [INFO ] Invariant cache hit.
[2023-03-16 06:09:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:09:15] [INFO ] Implicit Places using invariants and state equation in 10948 ms returned []
Implicit Place search using SMT with State Equation took 12390 ms to find 0 implicit places.
[2023-03-16 06:09:15] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-16 06:09:15] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-16 06:09:15] [INFO ] Invariant cache hit.
[2023-03-16 06:09:17] [INFO ] Dead Transitions using invariants and state equation in 1407 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15337 ms. Remains : 1431/1431 places, 2602/2602 transitions.
Built C files in :
/tmp/ltsmin9852077531849758310
[2023-03-16 06:09:17] [INFO ] Too many transitions (2602) to apply POR reductions. Disabling POR matrices.
[2023-03-16 06:09:17] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9852077531849758310
Running compilation step : cd /tmp/ltsmin9852077531849758310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9852077531849758310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9852077531849758310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-16 06:09:20] [INFO ] Flatten gal took : 117 ms
[2023-03-16 06:09:20] [INFO ] Flatten gal took : 142 ms
[2023-03-16 06:09:20] [INFO ] Time to serialize gal into /tmp/LTL6846778252960802756.gal : 41 ms
[2023-03-16 06:09:20] [INFO ] Time to serialize properties into /tmp/LTL9792508120453111058.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6846778252960802756.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2918776770376463831.hoa' '-atoms' '/tmp/LTL9792508120453111058.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9792508120453111058.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2918776770376463831.hoa
Detected timeout of ITS tools.
[2023-03-16 06:09:35] [INFO ] Flatten gal took : 111 ms
[2023-03-16 06:09:36] [INFO ] Flatten gal took : 108 ms
[2023-03-16 06:09:36] [INFO ] Time to serialize gal into /tmp/LTL9219962237573984698.gal : 27 ms
[2023-03-16 06:09:36] [INFO ] Time to serialize properties into /tmp/LTL6976808410921235635.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9219962237573984698.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6976808410921235635.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G("(JobCnt_0<=place_522_0)"))||(G(F("(NotifyEventJobQueuedE_0<1)"))))))
Formula 0 simplified : G(F!"(JobCnt_0<=place_522_0)" & FG!"(NotifyEventJobQueuedE_0<1)")
Detected timeout of ITS tools.
[2023-03-16 06:09:51] [INFO ] Flatten gal took : 102 ms
[2023-03-16 06:09:51] [INFO ] Applying decomposition
[2023-03-16 06:09:51] [INFO ] Flatten gal took : 105 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3933052599265081825.txt' '-o' '/tmp/graph3933052599265081825.bin' '-w' '/tmp/graph3933052599265081825.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3933052599265081825.bin' '-l' '-1' '-v' '-w' '/tmp/graph3933052599265081825.weights' '-q' '0' '-e' '0.001'
[2023-03-16 06:09:51] [INFO ] Decomposing Gal with order
[2023-03-16 06:09:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 06:09:52] [INFO ] Removed a total of 2636 redundant transitions.
[2023-03-16 06:09:52] [INFO ] Flatten gal took : 578 ms
[2023-03-16 06:09:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 489 labels/synchronizations in 71 ms.
[2023-03-16 06:09:53] [INFO ] Time to serialize gal into /tmp/LTL7455218539878186148.gal : 25 ms
[2023-03-16 06:09:53] [INFO ] Time to serialize properties into /tmp/LTL15141726725808630410.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7455218539878186148.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15141726725808630410.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("(gu36.JobCnt_0<=gu36.place_522_0)"))||(G(F("(gi0.gi1.gu84.NotifyEventJobQueuedE_0<1)"))))))
Formula 0 simplified : G(F!"(gu36.JobCnt_0<=gu36.place_522_0)" & FG!"(gi0.gi1.gu84.NotifyEventJobQueuedE_0<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12247941606626436300
[2023-03-16 06:10:08] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12247941606626436300
Running compilation step : cd /tmp/ltsmin12247941606626436300;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12247941606626436300;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12247941606626436300;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property PolyORBNT-COL-S10J80-LTLCardinality-02 finished in 704351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Support contains 13 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 132 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2023-03-16 06:10:11] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2023-03-16 06:10:11] [INFO ] Computed 182 place invariants in 58 ms
[2023-03-16 06:10:13] [INFO ] Dead Transitions using invariants and state equation in 2378 ms found 0 transitions.
[2023-03-16 06:10:13] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 06:10:13] [INFO ] Invariant cache hit.
[2023-03-16 06:10:15] [INFO ] Implicit Places using invariants in 1475 ms returned []
[2023-03-16 06:10:15] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 06:10:15] [INFO ] Invariant cache hit.
[2023-03-16 06:10:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:10:27] [INFO ] Implicit Places using invariants and state equation in 11894 ms returned []
Implicit Place search using SMT with State Equation took 13371 ms to find 0 implicit places.
[2023-03-16 06:10:27] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 06:10:27] [INFO ] Invariant cache hit.
[2023-03-16 06:10:29] [INFO ] Dead Transitions using invariants and state equation in 2386 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1603/1604 places, 2774/2775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18268 ms. Remains : 1603/1604 places, 2774/2775 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ s502 s499), p0:(LEQ s1602 (ADD s1420 s1421 s1422 s1423 s1424 s1425 s1426 s1427 s1428 s1429))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5604 reset in 846 ms.
Product exploration explored 100000 steps with 5597 reset in 874 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 p1 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 513 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 561 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 06:10:32] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 06:10:32] [INFO ] Invariant cache hit.
[2023-03-16 06:10:32] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 06:10:32] [INFO ] [Nat]Absence check using 176 positive place invariants in 52 ms returned sat
[2023-03-16 06:10:32] [INFO ] [Nat]Absence check using 176 positive and 6 generalized place invariants in 39 ms returned sat
[2023-03-16 06:10:42] [INFO ] After 10096ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 06:10:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:10:44] [INFO ] After 1439ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 06:10:45] [INFO ] After 2569ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1723 ms.
[2023-03-16 06:10:47] [INFO ] After 14716ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 13 out of 1603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1603/1603 places, 2774/2774 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 1603 transition count 2692
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 164 place count 1521 transition count 2692
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 164 place count 1521 transition count 2607
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 334 place count 1436 transition count 2607
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 338 place count 1434 transition count 2605
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 339 place count 1434 transition count 2604
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 340 place count 1433 transition count 2604
Applied a total of 340 rules in 354 ms. Remains 1433 /1603 variables (removed 170) and now considering 2604/2774 (removed 170) transitions.
[2023-03-16 06:10:47] [INFO ] Flow matrix only has 2595 transitions (discarded 9 similar events)
// Phase 1: matrix 2595 rows 1433 cols
[2023-03-16 06:10:47] [INFO ] Computed 182 place invariants in 55 ms
[2023-03-16 06:10:49] [INFO ] Dead Transitions using invariants and state equation in 1433 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1789 ms. Remains : 1433/1603 places, 2604/2774 transitions.
Finished random walk after 1093 steps, including 75 resets, run visited all 2 properties in 23 ms. (steps per millisecond=47 )
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 423 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1), true]
Support contains 13 out of 1603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1603/1603 places, 2774/2774 transitions.
Applied a total of 0 rules in 62 ms. Remains 1603 /1603 variables (removed 0) and now considering 2774/2774 (removed 0) transitions.
[2023-03-16 06:10:49] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2023-03-16 06:10:49] [INFO ] Computed 182 place invariants in 61 ms
[2023-03-16 06:10:52] [INFO ] Dead Transitions using invariants and state equation in 2326 ms found 0 transitions.
[2023-03-16 06:10:52] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 06:10:52] [INFO ] Invariant cache hit.
[2023-03-16 06:10:53] [INFO ] Implicit Places using invariants in 1490 ms returned []
[2023-03-16 06:10:53] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 06:10:53] [INFO ] Invariant cache hit.
[2023-03-16 06:10:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:11:11] [INFO ] Implicit Places using invariants and state equation in 17562 ms returned []
Implicit Place search using SMT with State Equation took 19053 ms to find 0 implicit places.
[2023-03-16 06:11:11] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 06:11:11] [INFO ] Invariant cache hit.
[2023-03-16 06:11:13] [INFO ] Dead Transitions using invariants and state equation in 2298 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23750 ms. Remains : 1603/1603 places, 2774/2774 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 p1 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 525 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 561 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 4) seen :2
Finished Best-First random walk after 7217 steps, including 68 resets, run visited all 2 properties in 29 ms. (steps per millisecond=248 )
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 442 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 5600 reset in 824 ms.
Product exploration explored 100000 steps with 5603 reset in 886 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1), true]
Support contains 13 out of 1603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1603/1603 places, 2774/2774 transitions.
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 1603 transition count 2774
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 82 place count 1603 transition count 2775
Deduced a syphon composed of 84 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 84 place count 1603 transition count 2775
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 169 places in 1 ms
Iterating global reduction 1 with 85 rules applied. Total rules applied 169 place count 1603 transition count 2775
Discarding 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 252 place count 1520 transition count 2692
Deduced a syphon composed of 86 places in 1 ms
Iterating global reduction 1 with 83 rules applied. Total rules applied 335 place count 1520 transition count 2692
Deduced a syphon composed of 86 places in 0 ms
Applied a total of 335 rules in 445 ms. Remains 1520 /1603 variables (removed 83) and now considering 2692/2774 (removed 82) transitions.
[2023-03-16 06:11:17] [INFO ] Flow matrix only has 2683 transitions (discarded 9 similar events)
// Phase 1: matrix 2683 rows 1520 cols
[2023-03-16 06:11:17] [INFO ] Computed 182 place invariants in 62 ms
[2023-03-16 06:11:20] [INFO ] Dead Transitions using invariants and state equation in 3343 ms found 0 transitions.
[2023-03-16 06:11:20] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-16 06:11:20] [INFO ] Flow matrix only has 2683 transitions (discarded 9 similar events)
[2023-03-16 06:11:20] [INFO ] Invariant cache hit.
[2023-03-16 06:11:24] [INFO ] Dead Transitions using invariants and state equation in 4052 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1520/1603 places, 2692/2774 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7908 ms. Remains : 1520/1603 places, 2692/2774 transitions.
Built C files in :
/tmp/ltsmin15051721811779822547
[2023-03-16 06:11:24] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15051721811779822547
Running compilation step : cd /tmp/ltsmin15051721811779822547;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15051721811779822547;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15051721811779822547;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 13 out of 1603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1603/1603 places, 2774/2774 transitions.
Applied a total of 0 rules in 58 ms. Remains 1603 /1603 variables (removed 0) and now considering 2774/2774 (removed 0) transitions.
[2023-03-16 06:11:27] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2023-03-16 06:11:27] [INFO ] Computed 182 place invariants in 61 ms
[2023-03-16 06:11:30] [INFO ] Dead Transitions using invariants and state equation in 2371 ms found 0 transitions.
[2023-03-16 06:11:30] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 06:11:30] [INFO ] Invariant cache hit.
[2023-03-16 06:11:31] [INFO ] Implicit Places using invariants in 1470 ms returned []
[2023-03-16 06:11:31] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 06:11:31] [INFO ] Invariant cache hit.
[2023-03-16 06:11:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:11:44] [INFO ] Implicit Places using invariants and state equation in 12654 ms returned []
Implicit Place search using SMT with State Equation took 14126 ms to find 0 implicit places.
[2023-03-16 06:11:44] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 06:11:44] [INFO ] Invariant cache hit.
[2023-03-16 06:11:46] [INFO ] Dead Transitions using invariants and state equation in 2388 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18945 ms. Remains : 1603/1603 places, 2774/2774 transitions.
Built C files in :
/tmp/ltsmin4148759946876122548
[2023-03-16 06:11:46] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4148759946876122548
Running compilation step : cd /tmp/ltsmin4148759946876122548;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4148759946876122548;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4148759946876122548;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-16 06:11:50] [INFO ] Flatten gal took : 173 ms
[2023-03-16 06:11:50] [INFO ] Flatten gal took : 147 ms
[2023-03-16 06:11:50] [INFO ] Time to serialize gal into /tmp/LTL15421135776608050448.gal : 16 ms
[2023-03-16 06:11:50] [INFO ] Time to serialize properties into /tmp/LTL2109010735904267195.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15421135776608050448.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8573017907535850210.hoa' '-atoms' '/tmp/LTL2109010735904267195.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2109010735904267195.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8573017907535850210.hoa
Detected timeout of ITS tools.
[2023-03-16 06:12:05] [INFO ] Flatten gal took : 101 ms
[2023-03-16 06:12:05] [INFO ] Flatten gal took : 101 ms
[2023-03-16 06:12:05] [INFO ] Time to serialize gal into /tmp/LTL8043071656996157046.gal : 15 ms
[2023-03-16 06:12:05] [INFO ] Time to serialize properties into /tmp/LTL8201386077590491903.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8043071656996157046.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8201386077590491903.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((("(Try_Check_Sources_B_0<=((((DataOnSrc_0+DataOnSrc_1)+(DataOnSrc_2+DataOnSrc_3))+((DataOnSrc_4+DataOnSrc_5)+(DataOnSrc_6+DataOnSrc...229
Formula 0 simplified : !"(Try_Check_Sources_B_0<=((((DataOnSrc_0+DataOnSrc_1)+(DataOnSrc_2+DataOnSrc_3))+((DataOnSrc_4+DataOnSrc_5)+(DataOnSrc_6+DataOnSrc_...222
Detected timeout of ITS tools.
[2023-03-16 06:12:20] [INFO ] Flatten gal took : 100 ms
[2023-03-16 06:12:20] [INFO ] Applying decomposition
[2023-03-16 06:12:20] [INFO ] Flatten gal took : 114 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18269611840103839686.txt' '-o' '/tmp/graph18269611840103839686.bin' '-w' '/tmp/graph18269611840103839686.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18269611840103839686.bin' '-l' '-1' '-v' '-w' '/tmp/graph18269611840103839686.weights' '-q' '0' '-e' '0.001'
[2023-03-16 06:12:21] [INFO ] Decomposing Gal with order
[2023-03-16 06:12:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 06:12:21] [INFO ] Removed a total of 2906 redundant transitions.
[2023-03-16 06:12:21] [INFO ] Flatten gal took : 265 ms
[2023-03-16 06:12:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 1620 labels/synchronizations in 137 ms.
[2023-03-16 06:12:21] [INFO ] Time to serialize gal into /tmp/LTL174348735796848291.gal : 20 ms
[2023-03-16 06:12:21] [INFO ] Time to serialize properties into /tmp/LTL5380281255059250744.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL174348735796848291.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5380281255059250744.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((("(gu172.Try_Check_Sources_B_0<=((((gu172.DataOnSrc_0+gu172.DataOnSrc_1)+(gu172.DataOnSrc_2+gu172.DataOnSrc_3))+((gu172.DataOnSrc_4...305
Formula 0 simplified : !"(gu172.Try_Check_Sources_B_0<=((((gu172.DataOnSrc_0+gu172.DataOnSrc_1)+(gu172.DataOnSrc_2+gu172.DataOnSrc_3))+((gu172.DataOnSrc_4+...298
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5895327381879215277
[2023-03-16 06:12:37] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5895327381879215277
Running compilation step : cd /tmp/ltsmin5895327381879215277;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5895327381879215277;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5895327381879215277;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property PolyORBNT-COL-S10J80-LTLCardinality-03 finished in 148785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 1604 transition count 2690
Reduce places removed 85 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 86 rules applied. Total rules applied 171 place count 1519 transition count 2689
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 172 place count 1518 transition count 2689
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 172 place count 1518 transition count 2604
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 342 place count 1433 transition count 2604
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 343 place count 1432 transition count 2603
Iterating global reduction 3 with 1 rules applied. Total rules applied 344 place count 1432 transition count 2603
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 348 place count 1430 transition count 2601
Applied a total of 348 rules in 219 ms. Remains 1430 /1604 variables (removed 174) and now considering 2601/2775 (removed 174) transitions.
[2023-03-16 06:12:40] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2023-03-16 06:12:40] [INFO ] Computed 182 place invariants in 60 ms
[2023-03-16 06:12:41] [INFO ] Dead Transitions using invariants and state equation in 1437 ms found 0 transitions.
[2023-03-16 06:12:41] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-16 06:12:41] [INFO ] Invariant cache hit.
[2023-03-16 06:12:43] [INFO ] Implicit Places using invariants in 1517 ms returned []
[2023-03-16 06:12:43] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-16 06:12:43] [INFO ] Invariant cache hit.
[2023-03-16 06:12:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:12:54] [INFO ] Implicit Places using invariants and state equation in 11081 ms returned []
Implicit Place search using SMT with State Equation took 12599 ms to find 0 implicit places.
[2023-03-16 06:12:54] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-16 06:12:54] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-16 06:12:54] [INFO ] Invariant cache hit.
[2023-03-16 06:12:55] [INFO ] Dead Transitions using invariants and state equation in 1355 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1430/1604 places, 2601/2775 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15676 ms. Remains : 1430/1604 places, 2601/2775 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s1332 s1428)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J80-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J80-LTLCardinality-04 finished in 15771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1)||X(F(!p1)))))'
Support contains 4 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 102 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2023-03-16 06:12:55] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
// Phase 1: matrix 2765 rows 1603 cols
[2023-03-16 06:12:55] [INFO ] Computed 182 place invariants in 58 ms
[2023-03-16 06:12:58] [INFO ] Dead Transitions using invariants and state equation in 2248 ms found 0 transitions.
[2023-03-16 06:12:58] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 06:12:58] [INFO ] Invariant cache hit.
[2023-03-16 06:12:59] [INFO ] Implicit Places using invariants in 1531 ms returned []
[2023-03-16 06:12:59] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 06:12:59] [INFO ] Invariant cache hit.
[2023-03-16 06:13:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:13:11] [INFO ] Implicit Places using invariants and state equation in 11685 ms returned []
Implicit Place search using SMT with State Equation took 13217 ms to find 0 implicit places.
[2023-03-16 06:13:11] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 06:13:11] [INFO ] Invariant cache hit.
[2023-03-16 06:13:13] [INFO ] Dead Transitions using invariants and state equation in 2341 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1603/1604 places, 2774/2775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17913 ms. Remains : 1603/1604 places, 2774/2775 transitions.
Stuttering acceptance computed with spot in 95 ms :[false, p1, false]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(GT s82 s1602), p0:(GT s503 s502)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1248 ms.
Product exploration explored 100000 steps with 33333 reset in 1279 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 (AND (NOT p0) (NOT p1))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p1)))
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-COL-S10J80-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S10J80-LTLCardinality-08 finished in 20635 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 101 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2023-03-16 06:13:16] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 06:13:16] [INFO ] Invariant cache hit.
[2023-03-16 06:13:18] [INFO ] Dead Transitions using invariants and state equation in 2356 ms found 0 transitions.
[2023-03-16 06:13:18] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 06:13:18] [INFO ] Invariant cache hit.
[2023-03-16 06:13:20] [INFO ] Implicit Places using invariants in 1419 ms returned []
[2023-03-16 06:13:20] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 06:13:20] [INFO ] Invariant cache hit.
[2023-03-16 06:13:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:13:34] [INFO ] Implicit Places using invariants and state equation in 14032 ms returned []
Implicit Place search using SMT with State Equation took 15452 ms to find 0 implicit places.
[2023-03-16 06:13:34] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 06:13:34] [INFO ] Invariant cache hit.
[2023-03-16 06:13:36] [INFO ] Dead Transitions using invariants and state equation in 2345 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1603/1604 places, 2774/2775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20256 ms. Remains : 1603/1604 places, 2774/2775 transitions.
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 s1336)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J80-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J80-LTLCardinality-09 finished in 20490 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 84 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1603 transition count 2774
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1603 transition count 2774
Applied a total of 2 rules in 97 ms. Remains 1603 /1604 variables (removed 1) and now considering 2774/2775 (removed 1) transitions.
[2023-03-16 06:13:37] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 06:13:37] [INFO ] Invariant cache hit.
[2023-03-16 06:13:39] [INFO ] Dead Transitions using invariants and state equation in 2317 ms found 0 transitions.
[2023-03-16 06:13:39] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 06:13:39] [INFO ] Invariant cache hit.
[2023-03-16 06:13:40] [INFO ] Implicit Places using invariants in 1380 ms returned []
[2023-03-16 06:13:40] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 06:13:40] [INFO ] Invariant cache hit.
[2023-03-16 06:13:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:13:56] [INFO ] Implicit Places using invariants and state equation in 15629 ms returned []
Implicit Place search using SMT with State Equation took 17009 ms to find 0 implicit places.
[2023-03-16 06:13:56] [INFO ] Flow matrix only has 2765 transitions (discarded 9 similar events)
[2023-03-16 06:13:56] [INFO ] Invariant cache hit.
[2023-03-16 06:13:58] [INFO ] Dead Transitions using invariants and state equation in 2360 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1603/1604 places, 2774/2775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21796 ms. Remains : 1603/1604 places, 2774/2775 transitions.
Stuttering acceptance computed with spot in 618 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LEQ (ADD s1436 s1437 s1438 s1439 s1440 s1441 s1442 s1443 s1444 s1445 s1446 s1447 s1448 s1449 s1450 s1451 s1452 s1453 s1454 s1455 s1456 s1457 s1458 s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1697 ms.
Product exploration explored 100000 steps with 50000 reset in 1732 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 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 5 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-COL-S10J80-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S10J80-LTLCardinality-12 finished in 26013 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 1604 transition count 2691
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 168 place count 1520 transition count 2691
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 86 Pre rules applied. Total rules applied 168 place count 1520 transition count 2605
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 340 place count 1434 transition count 2605
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 344 place count 1432 transition count 2603
Applied a total of 344 rules in 163 ms. Remains 1432 /1604 variables (removed 172) and now considering 2603/2775 (removed 172) transitions.
[2023-03-16 06:14:03] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
// Phase 1: matrix 2594 rows 1432 cols
[2023-03-16 06:14:03] [INFO ] Computed 182 place invariants in 58 ms
[2023-03-16 06:14:04] [INFO ] Dead Transitions using invariants and state equation in 1504 ms found 0 transitions.
[2023-03-16 06:14:04] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
[2023-03-16 06:14:04] [INFO ] Invariant cache hit.
[2023-03-16 06:14:05] [INFO ] Implicit Places using invariants in 1318 ms returned []
[2023-03-16 06:14:05] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
[2023-03-16 06:14:05] [INFO ] Invariant cache hit.
[2023-03-16 06:14:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:14:15] [INFO ] Implicit Places using invariants and state equation in 9230 ms returned []
Implicit Place search using SMT with State Equation took 10551 ms to find 0 implicit places.
[2023-03-16 06:14:15] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-16 06:14:15] [INFO ] Flow matrix only has 2594 transitions (discarded 9 similar events)
[2023-03-16 06:14:15] [INFO ] Invariant cache hit.
[2023-03-16 06:14:16] [INFO ] Dead Transitions using invariants and state equation in 1448 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1432/1604 places, 2603/2775 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13729 ms. Remains : 1432/1604 places, 2603/2775 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s1431)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J80-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J80-LTLCardinality-15 finished in 13867 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Found a Lengthening insensitive property : PolyORBNT-COL-S10J80-LTLCardinality-03
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1), true]
Support contains 13 out of 1604 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1604/1604 places, 2775/2775 transitions.
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 1604 transition count 2692
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 166 place count 1521 transition count 2692
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 166 place count 1521 transition count 2607
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 336 place count 1436 transition count 2607
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 337 place count 1435 transition count 2606
Iterating global reduction 2 with 1 rules applied. Total rules applied 338 place count 1435 transition count 2606
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 340 place count 1434 transition count 2605
Applied a total of 340 rules in 184 ms. Remains 1434 /1604 variables (removed 170) and now considering 2605/2775 (removed 170) transitions.
[2023-03-16 06:14:17] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
// Phase 1: matrix 2596 rows 1434 cols
[2023-03-16 06:14:17] [INFO ] Computed 182 place invariants in 58 ms
[2023-03-16 06:14:18] [INFO ] Dead Transitions using invariants and state equation in 1460 ms found 0 transitions.
[2023-03-16 06:14:18] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
[2023-03-16 06:14:18] [INFO ] Invariant cache hit.
[2023-03-16 06:14:19] [INFO ] Implicit Places using invariants in 1136 ms returned []
[2023-03-16 06:14:19] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
[2023-03-16 06:14:19] [INFO ] Invariant cache hit.
[2023-03-16 06:14:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:14:30] [INFO ] Implicit Places using invariants and state equation in 10136 ms returned []
Implicit Place search using SMT with State Equation took 11274 ms to find 0 implicit places.
[2023-03-16 06:14:30] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
[2023-03-16 06:14:30] [INFO ] Invariant cache hit.
[2023-03-16 06:14:31] [INFO ] Dead Transitions using invariants and state equation in 1394 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1434/1604 places, 2605/2775 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 14313 ms. Remains : 1434/1604 places, 2605/2775 transitions.
Running random walk in product with property : PolyORBNT-COL-S10J80-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ s499 s496), p0:(LEQ s1433 (ADD s1416 s1417 s1418 s1419 s1420 s1421 s1422 s1423 s1424 s1425))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6858 reset in 1161 ms.
Product exploration explored 100000 steps with 6855 reset in 1205 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 p1 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 344 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1), true]
Finished random walk after 4475 steps, including 309 resets, run visited all 4 properties in 75 ms. (steps per millisecond=59 )
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 427 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1), true]
Support contains 13 out of 1434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1434/1434 places, 2605/2605 transitions.
Applied a total of 0 rules in 42 ms. Remains 1434 /1434 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
[2023-03-16 06:14:34] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
[2023-03-16 06:14:34] [INFO ] Invariant cache hit.
[2023-03-16 06:14:36] [INFO ] Dead Transitions using invariants and state equation in 1380 ms found 0 transitions.
[2023-03-16 06:14:36] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
[2023-03-16 06:14:36] [INFO ] Invariant cache hit.
[2023-03-16 06:14:37] [INFO ] Implicit Places using invariants in 1106 ms returned []
[2023-03-16 06:14:37] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
[2023-03-16 06:14:37] [INFO ] Invariant cache hit.
[2023-03-16 06:14:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:14:45] [INFO ] Implicit Places using invariants and state equation in 7904 ms returned []
Implicit Place search using SMT with State Equation took 9012 ms to find 0 implicit places.
[2023-03-16 06:14:45] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
[2023-03-16 06:14:45] [INFO ] Invariant cache hit.
[2023-03-16 06:14:46] [INFO ] Dead Transitions using invariants and state equation in 1391 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11826 ms. Remains : 1434/1434 places, 2605/2605 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 p1 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 320 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1), true]
Finished random walk after 3052 steps, including 209 resets, run visited all 4 properties in 56 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 400 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 6865 reset in 1176 ms.
Product exploration explored 100000 steps with 6876 reset in 1206 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1), true]
Support contains 13 out of 1434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1434/1434 places, 2605/2605 transitions.
Applied a total of 0 rules in 64 ms. Remains 1434 /1434 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
[2023-03-16 06:14:50] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
[2023-03-16 06:14:50] [INFO ] Invariant cache hit.
[2023-03-16 06:14:51] [INFO ] Dead Transitions using invariants and state equation in 1386 ms found 0 transitions.
[2023-03-16 06:14:51] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-16 06:14:51] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
[2023-03-16 06:14:51] [INFO ] Invariant cache hit.
[2023-03-16 06:14:53] [INFO ] Dead Transitions using invariants and state equation in 1374 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2878 ms. Remains : 1434/1434 places, 2605/2605 transitions.
Built C files in :
/tmp/ltsmin3212663662777950741
[2023-03-16 06:14:53] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3212663662777950741
Running compilation step : cd /tmp/ltsmin3212663662777950741;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3212663662777950741;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3212663662777950741;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 13 out of 1434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1434/1434 places, 2605/2605 transitions.
Applied a total of 0 rules in 38 ms. Remains 1434 /1434 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
[2023-03-16 06:14:56] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
[2023-03-16 06:14:56] [INFO ] Invariant cache hit.
[2023-03-16 06:14:57] [INFO ] Dead Transitions using invariants and state equation in 1386 ms found 0 transitions.
[2023-03-16 06:14:57] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
[2023-03-16 06:14:57] [INFO ] Invariant cache hit.
[2023-03-16 06:14:58] [INFO ] Implicit Places using invariants in 1092 ms returned []
[2023-03-16 06:14:58] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
[2023-03-16 06:14:58] [INFO ] Invariant cache hit.
[2023-03-16 06:14:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 06:15:07] [INFO ] Implicit Places using invariants and state equation in 8912 ms returned []
Implicit Place search using SMT with State Equation took 10005 ms to find 0 implicit places.
[2023-03-16 06:15:07] [INFO ] Flow matrix only has 2596 transitions (discarded 9 similar events)
[2023-03-16 06:15:07] [INFO ] Invariant cache hit.
[2023-03-16 06:15:09] [INFO ] Dead Transitions using invariants and state equation in 1399 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12829 ms. Remains : 1434/1434 places, 2605/2605 transitions.
Built C files in :
/tmp/ltsmin12121106144449901977
[2023-03-16 06:15:09] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12121106144449901977
Running compilation step : cd /tmp/ltsmin12121106144449901977;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12121106144449901977;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12121106144449901977;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-16 06:15:12] [INFO ] Flatten gal took : 95 ms
[2023-03-16 06:15:12] [INFO ] Flatten gal took : 97 ms
[2023-03-16 06:15:12] [INFO ] Time to serialize gal into /tmp/LTL2085036754582414439.gal : 14 ms
[2023-03-16 06:15:12] [INFO ] Time to serialize properties into /tmp/LTL8972197283004931428.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2085036754582414439.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12342271747269290188.hoa' '-atoms' '/tmp/LTL8972197283004931428.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8972197283004931428.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12342271747269290188.hoa
Detected timeout of ITS tools.
[2023-03-16 06:15:27] [INFO ] Flatten gal took : 93 ms
[2023-03-16 06:15:27] [INFO ] Flatten gal took : 96 ms
[2023-03-16 06:15:27] [INFO ] Time to serialize gal into /tmp/LTL12989377201692933422.gal : 14 ms
[2023-03-16 06:15:27] [INFO ] Time to serialize properties into /tmp/LTL11112992472741939654.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12989377201692933422.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11112992472741939654.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((("(Try_Check_Sources_B_0<=((((DataOnSrc_0+DataOnSrc_1)+(DataOnSrc_2+DataOnSrc_3))+((DataOnSrc_4+DataOnSrc_5)+(DataOnSrc_6+DataOnSrc...229
Formula 0 simplified : !"(Try_Check_Sources_B_0<=((((DataOnSrc_0+DataOnSrc_1)+(DataOnSrc_2+DataOnSrc_3))+((DataOnSrc_4+DataOnSrc_5)+(DataOnSrc_6+DataOnSrc_...222
Detected timeout of ITS tools.
[2023-03-16 06:15:42] [INFO ] Flatten gal took : 93 ms
[2023-03-16 06:15:42] [INFO ] Applying decomposition
[2023-03-16 06:15:42] [INFO ] Flatten gal took : 97 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9949964134838460897.txt' '-o' '/tmp/graph9949964134838460897.bin' '-w' '/tmp/graph9949964134838460897.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9949964134838460897.bin' '-l' '-1' '-v' '-w' '/tmp/graph9949964134838460897.weights' '-q' '0' '-e' '0.001'
[2023-03-16 06:15:43] [INFO ] Decomposing Gal with order
[2023-03-16 06:15:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 06:15:43] [INFO ] Removed a total of 2648 redundant transitions.
[2023-03-16 06:15:43] [INFO ] Flatten gal took : 221 ms
[2023-03-16 06:15:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 1851 labels/synchronizations in 74 ms.
[2023-03-16 06:15:43] [INFO ] Time to serialize gal into /tmp/LTL3149990712967866132.gal : 18 ms
[2023-03-16 06:15:43] [INFO ] Time to serialize properties into /tmp/LTL11611499203182674787.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3149990712967866132.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11611499203182674787.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((("(gu86.Try_Check_Sources_B_0<=((((gu86.DataOnSrc_0+gu86.DataOnSrc_1)+(gu86.DataOnSrc_2+gu86.DataOnSrc_3))+((gu86.DataOnSrc_4+gu86....294
Formula 0 simplified : !"(gu86.Try_Check_Sources_B_0<=((((gu86.DataOnSrc_0+gu86.DataOnSrc_1)+(gu86.DataOnSrc_2+gu86.DataOnSrc_3))+((gu86.DataOnSrc_4+gu86.D...287
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17367458271819885218
[2023-03-16 06:15:58] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17367458271819885218
Running compilation step : cd /tmp/ltsmin17367458271819885218;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17367458271819885218;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17367458271819885218;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property PolyORBNT-COL-S10J80-LTLCardinality-03 finished in 105045 ms.
[2023-03-16 06:16:02] [INFO ] Flatten gal took : 100 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15293061357354816081
[2023-03-16 06:16:02] [INFO ] Too many transitions (2775) to apply POR reductions. Disabling POR matrices.
[2023-03-16 06:16:02] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15293061357354816081
Running compilation step : cd /tmp/ltsmin15293061357354816081;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-16 06:16:02] [INFO ] Applying decomposition
[2023-03-16 06:16:02] [INFO ] Flatten gal took : 101 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14025092667126706082.txt' '-o' '/tmp/graph14025092667126706082.bin' '-w' '/tmp/graph14025092667126706082.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14025092667126706082.bin' '-l' '-1' '-v' '-w' '/tmp/graph14025092667126706082.weights' '-q' '0' '-e' '0.001'
[2023-03-16 06:16:02] [INFO ] Decomposing Gal with order
[2023-03-16 06:16:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 06:16:02] [INFO ] Removed a total of 2666 redundant transitions.
[2023-03-16 06:16:02] [INFO ] Flatten gal took : 283 ms
[2023-03-16 06:16:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 2785 labels/synchronizations in 175 ms.
[2023-03-16 06:16:03] [INFO ] Time to serialize gal into /tmp/LTLCardinality6422364542031182988.gal : 19 ms
[2023-03-16 06:16:03] [INFO ] Time to serialize properties into /tmp/LTLCardinality1721667999246799724.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6422364542031182988.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1721667999246799724.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !((F((G("(gu70.JobCnt_0<=gu70.place_522_0)"))||(G(F("(gi1.gi1.gi0.gu0.NotifyEventJobQueuedE_0<1)"))))))
Formula 0 simplified : G(F!"(gu70.JobCnt_0<=gu70.place_522_0)" & FG!"(gi1.gi1.gi0.gu0.NotifyEventJobQueuedE_0<1)")
Compilation finished in 6920 ms.
Running link step : cd /tmp/ltsmin15293061357354816081;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin15293061357354816081;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp0==true))||[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-16 06:42:15] [INFO ] Applying decomposition
[2023-03-16 06:42:17] [INFO ] Flatten gal took : 1717 ms
[2023-03-16 06:42:17] [INFO ] Decomposing Gal with order
[2023-03-16 06:42:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 06:42:20] [INFO ] Removed a total of 11516 redundant transitions.
[2023-03-16 06:42:20] [INFO ] Flatten gal took : 1780 ms
[2023-03-16 06:42:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 257 ms.
[2023-03-16 06:42:21] [INFO ] Time to serialize gal into /tmp/LTLCardinality7830398926417921962.gal : 125 ms
[2023-03-16 06:42:21] [INFO ] Time to serialize properties into /tmp/LTLCardinality11732953674722599812.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7830398926417921962.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11732953674722599812.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((F((G("(gJobCnt.JobCnt_0<=gplace_522.place_522_0)"))||(G(F("(gNotifyEventJobQueuedE.NotifyEventJobQueuedE_0<1)"))))))
Formula 0 simplified : G(F!"(gJobCnt.JobCnt_0<=gplace_522.place_522_0)" & FG!"(gNotifyEventJobQueuedE.NotifyEventJobQueuedE_0<1)")
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin15293061357354816081;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp0==true))||[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15293061357354816081;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp2==true) U X([]((LTLAPp3==true))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5123368 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15603784 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J80"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S10J80, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r293-tall-167873945800707"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J80.tgz
mv PolyORBNT-COL-S10J80 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;